default search action
Sangbeom Park 0001
Person information
- affiliation: Kyungpook National University, Deagu, South Korea
Other persons with the same name
- Sangbeom Park — disambiguation page
- Xiangfan Piao — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Sangbeom Park, Yonghyeon Jeon, Philsu Kim, Soyoon Bak:
An error predict-correction formula of the load vector in the BSLM for solving three-dimensional Burgers' equations. Math. Comput. Simul. 221: 222-243 (2024) - 2023
- [j13]Sangbeom Park, Soyoon Bak, Philsu Kim, Yunchang Seol:
A semi-implicit semi-Lagrangian method for simulating immersed boundary motion under high inertia and elasticity. Appl. Math. Comput. 459: 128269 (2023) - 2022
- [j12]Sangbeom Park, Philsu Kim, Yonghyeon Jeon, Soyoon Bak:
An economical robust algorithm for solving 1D coupled Burgers' equations in a semi-Lagrangian framework. Appl. Math. Comput. 428: 127185 (2022) - [j11]Ming-Chih Lai, Sangbeom Park, Yunchang Seol:
An energy stable finite difference method for anisotropic surface diffusion on closed curves. Appl. Math. Lett. 127: 107848 (2022) - [j10]Soyoon Bak, Philsu Kim, Sangbeom Park:
Development of a parallel CUDA algorithm for solving 3D guiding center problems. Comput. Phys. Commun. 276: 108331 (2022) - 2020
- [j9]Philsu Kim, Dojin Kim, Xiangfan Piao, Soyoon Bak:
A completely explicit scheme of Cauchy problem in BSLM for solving the Navier-Stokes equations. J. Comput. Phys. 401 (2020) - [j8]Xiangfan Piao, Philsu Kim:
An efficient trajectory tracking algorithm for the backward semi-Lagrangian method of solving the guiding center problems. J. Comput. Phys. 418: 109664 (2020)
2010 – 2019
- 2018
- [j7]Xiangfan Piao, Philsu Kim, Dojin Kim:
One-step L(α)-stable temporal integration for the backward semi-Lagrangian scheme and its application in guiding center problems. J. Comput. Phys. 366: 327-340 (2018) - 2017
- [j6]Xiangfan Piao, Sunyoung Bu, Dojin Kim, Philsu Kim:
An embedded formula of the Chebyshev collocation method for stiff problems. J. Comput. Phys. 351: 376-391 (2017) - 2015
- [j5]Xiangfan Piao, Sunyoung Bu, Soyoon Bak, Philsu Kim:
An iteration free backward semi-Lagrangian scheme for solving incompressible Navier-Stokes equations. J. Comput. Phys. 283: 189-204 (2015) - [j4]Jae-Min Kwon, Dokkyun Yi, Xiangfan Piao, Philsu Kim:
Development of semi-Lagrangian gyrokinetic code for full-f turbulence simulation in general tokamak geometry. J. Comput. Phys. 283: 518-540 (2015) - [j3]Xiangfan Piao, Sang Dong Kim, Philsu Kim, Jae-Min Kwon, Dokkyun Yi:
An Iteration Free Backward Semi-Lagrangian Scheme for Guiding Center Problems. SIAM J. Numer. Anal. 53(1): 619-643 (2015) - 2012
- [j2]Sang Dong Kim, Xiangfan Piao, Do Hyung Kim, Philsu Kim:
Convergence on error correction methods for solving initial value problems. J. Comput. Appl. Math. 236(17): 4448-4461 (2012) - 2011
- [j1]Philsu Kim, Xiangfan Piao, Sang Dong Kim:
An Error Corrected Euler Method for Solving Stiff Problems Based on Chebyshev Collocation. SIAM J. Numer. Anal. 49(6): 2211-2230 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint