Eun-Jae Park

Eun-Jae Park

Auto-generated profile, based on publicly available information

Eun-Jae Park

School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, Korea

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 June 2004 in Numerical Methods for Partial Differential Equations
Verified
Journal Article
Closed access
PDF file
EPEun‐Jae Park
Eun‐Jae Park

1 October 1998 in SIAM Journal on Applied Mathematics
Verified
Journal Article
Closed access
EPE. J. Park
E. J. Park
MIM. Iannelli
M. Iannelli
MKM. Y. Kim
M. Y. Kim
SAS. Anita
S. Anita
Here we investigate the optimal harvesting problem for some periodic age-dependent population dynamics; namely, we consider the linear Lotka--McKendrick model with periodic vital rates and a periodic forcing term that sustains oscillations. Existence and uniqueness of a positive periodic solution are demonstrated and the existence and uniqueness of the optimal control are established. We also state necessary optimality conditions. A numerical algorithm is developed to approximate the optimal control and the optimal harvest. Some numerical results are presented.

1 February 2004 in Physiological Measurement
Verified
Journal Article
Closed access
CPChunjae Park
Chunjae Park
EPEun-Jae Park
Eun-Jae Park
EWEung Je Woo
Eung Je Woo
OKOhin Kwon
Ohin Kwon
JSJin Keun Seo
Jin Keun Seo
A new image reconstruction algorithm is proposed to visualize static conductivity images of a subject in magnetic resonance electrical impedance tomography (MREIT). Injecting electrical current into the subject through surface electrodes, we can measure the induced internal magnetic flux density B = (Bx, By, Bz) using an MRI scanner. In this paper, we assume that only the z-component Bz is measurable due to a practical limitation of the measurement technique in MREIT. Under this circumstance, a constructive MREIT imaging technique called the harmonic Bz algorithm was recently developed to produce high-resolution conductivity images. The algorithm is based on the relation between inverted delta2Bz and the conductivity requiring the computation of inverted delta2Bz. Since twice differentiations of noisy Bz data tend to amplify the noise, the performance of the harmonic Bz algorithm is deteriorated when the signal-to-noise ratio in measured Bz data is not high enough. Therefore, it is highly desirable to develop a new algorithm reducing the number of differentiations. In this work, we propose the variational gradient Bz algorithm where Bz is differentiated only once. Numerical simulations with added random noise confirmed its ability to reconstruct static conductivity images in MREIT. We also found that it outperforms the harmonic Bz algorithm in terms of noise tolerance. From a careful analysis of the performance of the variational gradient Bz algorithm, we suggest several methods to further improve the image quality including a better choice of basis functions, regularization technique and multilevel approach. The proposed variational framework utilizing only Bz will lead to different versions of improved algorithms.

1 January 2011 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
CCCarsten Carstensen
Carsten Carstensen
DKDongho Kim
Dongho Kim
EPEun-Jae Park
Eun-Jae Park
The pseudostress-velocity formulation of the stationary Stokes problem allows a Raviart–Thomas mixed finite element formulation with quasi-optimal convergence and some superconvergent reconstruction of the velocity. This local postprocessing gives rise to some averaging a posteriori error estimator with explicit constants for reliable error control. Standard residual-based explicit a posteriori error estimation is shown to be reliable and efficient and motivates adaptive mesh-refining algorithms. Numerical experiments confirm our theoretical findings and illustrate the accuracy of the guaranteed upper error bounds even with reduced regularity.

1 January 2015 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
CCCarsten Carstensen
Carsten Carstensen
EPEun-Jae Park
Eun-Jae Park
The first-order div least squares finite element methods (LSFEMs) allow for an immediate a posteriori error control by the computable residual of the least squares functional. This paper establishes an adaptive refinement strategy based on some equivalent refinement indicators. Since the first-order div LSFEM measures the flux errors in $H$(div), the data resolution error measures the $L^2$ norm of the right-hand side $f$ minus the piecewise polynomial approximation $\Pi f$ without a mesh-size factor. Hence the data resolution term is neither an oscillation nor of higher order and consequently requires a particular treatment, e.g., by the thresholding second algorithm due to Binev and DeVore. The resulting novel adaptive LSFEM with separate marking converges with optimal rates relative to the notion of a nonlinear approximation class.

1 January 2019 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
LZLina Zhao
Lina Zhao
EPEun-Jae Park
Eun-Jae Park