Jinchao Xu

Jinchao Xu

Auto-generated profile, based on publicly available information

Jinchao Xu

Department of Mathematics Pennsylvania State University 16802 University Park PA USA

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

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

Representative Publications

View All Publications
1 June 2020 in Journal of Computational Mathematics
Verified
Journal Article
Closed access
JHJuncai He
Juncai He
LLLin Li
Lin Li
JXJinchao Xu
Jinchao Xu
CZChunyue Zheng
Chunyue Zheng
Journal of Computational Mathematics (JCM) is the first Chinese mathematics journal founded by Professor Feng Kang. As the flagship scientific computing journal in China, JCM covers all branches of modern computational mathematics such as numerical linear algebra, numerical optimization, computational geometry, numerical PDEs, and inverse problems. JCM has been sponsored by the Institute of Computational Mathematics of the Chinese Academy of Sciences since 1983.

20 May 1999 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
JXJinchao Xu
Jinchao Xu
LZLudmil Zikatanov
Ludmil Zikatanov
A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an M M -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.

8 April 2002 in Journal of the American Mathematical Society
Verified
Journal Article
Open access
PDF file
JXJinchao Xu
Jinchao Xu
LZLudmil Zikatanov
Ludmil Zikatanov
A new identity is given in this paper for estimating the norm of the product of nonexpansive operators in Hilbert space. This identity can be applied for the design and analysis of the method of alternating projections and the method of subspace corrections. The method of alternating projections is an iterative algorithm for determining the best approximation to any given point in a Hilbert space from the intersection of a finite number of subspaces by alternatively computing the best approximations from the individual subspaces which make up the intersection. The method of subspace corrections is an iterative algorithm for finding the solution of a linear equation in a Hilbert space by approximately solving equations restricted on a number of closed subspaces which make up the entire space. The new identity given in the paper provides a sharpest possible estimate for the rate of convergence of these algorithms. It is also proved in the paper that the method of alternating projections is essentially equivalent to the method of subspace corrections. Some simple examples of multigrid and domain decomposition methods are given to illustrate the application of the new identity.

17 August 1999 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
JXJinchao Xu
Jinchao Xu
AZAihui Zhou
Aihui Zhou
A two-grid discretization scheme is proposed for solving eigenvalue problems, including both partial differential equations and integral equations. With this new scheme, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a much coarser grid, and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy.

19 May 1999 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
JXJinchao Xu
Jinchao Xu
AZAihui Zhou
Aihui Zhou
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. The theoretical tools for analyzing these methods are some local a priori and a posteriori estimates that are also obtained in this paper for finite element solutions on general shape-regular grids. Some numerical experiments are also presented to support the theory.