[图书][B] Domain decomposition methods for the numerical solution of partial differential equations
TPA Mathew - 2008 - Springer
These notes serve as an introduction to a subject of study in computational mathematics
referred to as domain decomposition methods. It concerns divide and conquer methods for …
referred to as domain decomposition methods. It concerns divide and conquer methods for …
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace
correction (based on space decomposition) iterative methods applied to some …
correction (based on space decomposition) iterative methods applied to some …
Sparse grids for the Schrödinger equation
M Griebel, J Hamaekers - ESAIM: Mathematical Modelling and …, 2007 - cambridge.org
We present a sparse grid/hyperbolic cross discretization for many-particle problems. It
involves the tensor product of a one-particle multilevel basis. Subsequent truncation of the …
involves the tensor product of a one-particle multilevel basis. Subsequent truncation of the …
A multigrid method for eigenvalue problem
H Xie - Journal of Computational Physics, 2014 - Elsevier
A multigrid method is proposed to solve the eigenvalue problem by the finite element
method based on the combination of the multilevel correction scheme for the eigenvalue …
method based on the combination of the multilevel correction scheme for the eigenvalue …
[HTML][HTML] The method of subspace corrections
J Xu - Journal of Computational and Applied Mathematics, 2001 - Elsevier
This paper gives an overview for the method of subspace corrections. The method is first
motivated by a discussion on the local behavior of high-frequency components in a solution …
motivated by a discussion on the local behavior of high-frequency components in a solution …
Convergence rate analysis of an asynchronous space decomposition method for convex minimization
XC Tai, P Tseng - Mathematics of Computation, 2002 - ams.org
We analyze the convergence rate of an asynchronous space decomposition method for
constrained convex minimization in a reflexive Banach space. This method includes as …
constrained convex minimization in a reflexive Banach space. This method includes as …
[HTML][HTML] Domain decomposition methods for eigenvalue problems
SH Lui - Journal of computational and applied mathematics, 2000 - Elsevier
This paper proposes several domain decomposition methods to compute the smallest
eigenvalue of linear self-adjoint partial differential operators. Let us be given a partial …
eigenvalue of linear self-adjoint partial differential operators. Let us be given a partial …
A multi-level mixed element scheme of the two-dimensional Helmholtz transmission eigenvalue problem
Y Xi, X Ji, S Zhang - IMA Journal of Numerical Analysis, 2020 - academic.oup.com
In this paper, we present a multi-level mixed element scheme for the Helmholtz transmission
eigenvalue problem on polygonal domains that are not necessarily able to be covered by …
eigenvalue problem on polygonal domains that are not necessarily able to be covered by …
Applications of a space decomposition method to linear and nonlinear elliptic problems
XC Tai, M Espedal - Numerical Methods for Partial Differential …, 1998 - Wiley Online Library
This work presents some space decomposition algorithms for a convex minimization
problem. The algorithms has linear rate of convergence and the rate of convergence …
problem. The algorithms has linear rate of convergence and the rate of convergence …
Kron's method for symmetric eigenvalue problems
SH Lui - Journal of computational and applied mathematics, 1998 - Elsevier
Kron's method has been used successfully by engineers for over 30 years to find
eigenvalues of large symmetric matrices. These matrices arise from domain decomposition …
eigenvalues of large symmetric matrices. These matrices arise from domain decomposition …