Yunrong Zhu
Idaho State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Yunrong Zhu.
Mathematical Models and Methods in Applied Sciences | 2008
Jinchao Xu; Yunrong Zhu
This paper gives a solution to an open problem concerning the performance of various multilevel preconditioners for the linear finite element approximation of second-order elliptic boundary value problems with strongly discontinuous coefficients. By analyzing the eigenvalue distribution of the BPX preconditioner and multigrid V-cycle preconditioner, we prove that only a small number of eigenvalues may deteriorate with respect to the discontinuous jump or meshsize, and we prove that all the other eigenvalues are bounded below and above nearly uniformly with respect to the jump and meshsize. As a result, we prove that the convergence rate of the preconditioned conjugate gradient methods is uniform with respect to the large jump and meshsize. We also present some numerical experiments to demonstrate the theoretical results.
Communications in Computational Physics | 2012
Michael Holst; James Andrew McCammon; Zeyun Yu; Youngcheng Zhou; Yunrong Zhu
We consider the design of an effective and reliable adaptive finite element method (AFEM) for the nonlinear Poisson-Boltzmann equation (PBE). We first examine the two-term regularization technique for the continuous problem recently proposed by Chen, Holst, and Xu based on the removal of the singular electrostatic potential inside biomolecules; this technique made possible the development of the first complete solution and approximation theory for the Poisson-Boltzmann equation, the first provably convergent discretization, and also allowed for the development of a provably convergent AFEM. However, in practical implementation, this two-term regularization exhibits numerical instability. Therefore, we examine a variation of this regularization technique which can be shown to be less susceptible to such instability. We establish a priori estimates and other basic results for the continuous regularized problem, as well as for Galerkin finite element approximations. We show that the new approach produces regularized continuous and discrete problems with the same mathematical advantages of the original regularization. We then design an AFEM scheme for the new regularized problem, and show that the resulting AFEM scheme is accurate and reliable, by proving a contraction result for the error. This result, which is one of the first results of this type for nonlinear elliptic problems, is based on using continuous and discrete a priori L(∞) estimates to establish quasi-orthogonality. To provide a high-quality geometric model as input to the AFEM algorithm, we also describe a class of feature-preserving adaptive mesh generation algorithms designed specifically for constructing meshes of biomolecular structures, based on the intrinsic local structure tensor of the molecular surface. All of the algorithms described in the article are implemented in the Finite Element Toolkit (FETK), developed and maintained at UCSD. The stability advantages of the new regularization scheme are demonstrated with FETK through comparisons with the original regularization approach for a model problem. The convergence and accuracy of the overall AFEM algorithm is also illustrated by numerical approximation of electrostatic solvation energy for an insulin protein.
Mathematics of Computation | 2013
Blanca Ayuso de Dios; Michael Holst; Yunrong Zhu; Ludmil Zikatanov
In this article we develop and analyze two-level and multi-level methods for the family of Interior Penalty (IP) discontinuous Galerkin (DG) discretizations of second order elliptic problems with rough coecients (exhibiting large jumps across interfaces in the domain). These methods are based on a decomposition of the DG nite element space that inherently hinges on the diusion coecient of the problem. Our analysis of the proposed preconditioners is presented for both symmetric and non-symmetric IP schemes, and we establish both robustness with respect to the jump in the coecient and near-optimality with respect to the mesh size. Following the analysis, we present a sequence of detailed numerical results which verify the theory and illustrate the performance of the methods.
Computing and Visualization in Science | 2012
Long Chen; Michael Holst; Jinchao Xu; Yunrong Zhu
The goal of this paper is to design optimal multilevel solvers for the finite element approximation of second order linear elliptic problems with piecewise constant coefficients on bisection grids. Local multigrid and BPX preconditioners are constructed based on local smoothing only at the newest vertices and their immediate neighbors. The analysis of eigenvalue distributions for these local multilevel preconditioned systems shows that there are only a fixed number of eigenvalues which are deteriorated by the large jump. The remaining eigenvalues are bounded uniformly with respect to the coefficients and the meshsize. Therefore, the resulting preconditioned conjugate gradient algorithm will converge with an asymptotic rate independent of the coefficients and logarithmically with respect to the meshsize. As a result, the overall computational complexity is nearly optimal.
Archive | 2011
Jinchao Xu; Yunrong Zhu
In this paper, we construct an auxiliary space preconditioner for Maxwell’s equations with interface, and generalize the HX preconditioner developed in [9] to the problem with strongly discontinuous coefficients. For the H(curl) interface problem, we show that the condition number of the HX preconditioned system is uniformly bounded with respect to the coefficients and meshsize.
Archive | 2009
Ray S. Tuminaro; Jinchao Xu; Yunrong Zhu
This paper is devoted to study of an auxiliary spaces preconditioner for H(div) systems and its application in the mixed formulation of second order elliptic equations. Extensive numerical results show the efficiency and robustness of the algorithms, even in the presence of large coefficient variations. For the mixed formulation of elliptic equations, we use the augmented Lagrange technique to convert the solution of the saddle point problem into the solution of a nearly singular H(div) system. Numerical experiments also justify the robustness and efficiency of this scheme.
Numerical Linear Algebra With Applications | 2014
Yunrong Zhu
SUMMARY In this paper, we present a multigrid V-cycle preconditioner for the linear system arising from piecewise linear nonconforming Crouzeix–Raviart discretization of second-order elliptic problems with jump coefficients. The preconditioner uses standard conforming subspaces as coarse spaces. We showed that the convergence rates of the (multiplicative) two-grid and multigrid V-cycle algorithms will deteriorate rapidly because of large jumps in coefficient. However, the preconditioned systems have only a fixed number of small eigenvalues depending on the large jump in coefficient, and the effective condition numbers are independent of the coefficient and bounded logarithmically with respect to the mesh size. As a result, the two-grid or multigrid preconditioned conjugate gradient algorithm converges nearly uniformly. We also comment on some major differences of the convergence theory between the nonconforming case and the standard conforming case. Numerical experiments support the theoretical results. Copyright
arXiv: Numerical Analysis | 2013
Michael Holst; Ryan Szypowski; Yunrong Zhu
In this article we study adaptive finite element methods (AFEM) with inexact solvers for a class of semilinear elliptic interface problems.We are particularly interested in nonlinear problems with discontinuous diffusion coefficients, such as the nonlinear Poisson-Boltzmann equation and its regularizations. The algorithm we study consists of the standard SOLVE-ESTIMATE-MARK-REFINE procedure common to many adaptive finite element algorithms, but where the SOLVE step involves only a full solve on the coarsest level, and the remaining levels involve only single Newton updates to the previous approximate solution.
Journal of Scientific Computing | 2016
Tzanio V. Kolev; Jinchao Xu; Yunrong Zhu
In this paper, we extend some of the multilevel convergence results obtained by Xu and Zhu in [Xu and Zhu, M3AS 2008], to the case of second order linear reaction-diffusion equations. Specifically, we consider the multilevel preconditioners for solving the linear systems arising from the linear finite element approximation of the problem, where both diffusion and reaction coefficients are piecewise-constant functions. We discuss in detail the influence of both the discontinuous reaction and diffusion coefficients to the performance of the classical BPX and multigrid V-cycle preconditioner.
arXiv: Numerical Analysis | 2013
Blanca Ayuso de Dios; Michael Holst; Yunrong Zhu; Ludmil Zikatanov
In this paper, we present a multigrid preconditioner for solving the linear system arising from the piecewise linear nonconforming Crouzeix-Raviart discretization of second order elliptic problems with jump coefficients. The preconditioner uses the standard conforming subspaces as coarse spaces. Numerical tests show both robustness with respect to the jump in the coefficient and near-optimality with respect to the number of degrees of freedom.