Preconditioning techniques for large linear systems: a survey
M Benzi - Journal of computational Physics, 2002 - Elsevier
This article surveys preconditioning techniques for the iterative solution of large linear
systems, with a focus on algebraic methods suitable for general sparse matrices. Covered …
systems, with a focus on algebraic methods suitable for general sparse matrices. Covered …
[图书][B] Computational methods for nanoscale applications
I Tsukerman - 2008 - Springer
The purpose of this note… is to sort out my own thoughts… and to solicit ideas from others.
Lloyd N. Trefethen Three mysteries of Gaussian elimination Since 2008, when the first …
Lloyd N. Trefethen Three mysteries of Gaussian elimination Since 2008, when the first …
The jacobi–davidson method
ME Hochstenbach, Y Notay - GAMM‐Mitteilungen, 2006 - Wiley Online Library
Abstract The Jacobi–Davidson method is a popular technique to compute a few eigenpairs
of large sparse matrices. Its introduction, about a decade ago, was motivated by the fact that …
of large sparse matrices. Its introduction, about a decade ago, was motivated by the fact that …
A Jacobi--Davidson method for solving complex symmetric eigenvalue problems
P Arbenz, ME Hochstenbach - SIAM Journal on Scientific Computing, 2004 - SIAM
We discuss variants of the Jacobi--Davidson method for solving the generalized complex
symmetric eigenvalue problem. The Jacobi--Davidson algorithm can be considered as an …
symmetric eigenvalue problem. The Jacobi--Davidson algorithm can be considered as an …
State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
C Vömel, SZ Tomov, OA Marques, A Canning… - Journal of …, 2008 - Elsevier
The band edge states determine optical and electronic properties of semiconductor nano-
structures which can be computed from an interior eigenproblem. We study the reliability …
structures which can be computed from an interior eigenproblem. We study the reliability …
Is Jacobi--Davidson Faster than Davidson?
Y Notay - SIAM journal on matrix analysis and applications, 2004 - SIAM
The Davidson method is a popular technique to compute a few of the smallest (or largest)
eigenvalues of a large sparse real symmetric matrix. It is effective when the matrix is nearly …
eigenvalues of a large sparse real symmetric matrix. It is effective when the matrix is nearly …
A robust two-level incomplete factorization for (navier–) stokes saddle point matrices
We present a new hybrid direct/iterative approach to the solution of a special class of saddle
point matrices arising from the discretization of the steady incompressible Navier–Stokes …
point matrices arising from the discretization of the steady incompressible Navier–Stokes …
Parallel two-level domain decomposition based Jacobi–Davidson algorithms for pyramidal quantum dot simulation
We consider a quintic polynomial eigenvalue problem arising from the finite volume
discretization of a quantum dot simulation problem. The problem is solved by the Jacobi …
discretization of a quantum dot simulation problem. The problem is solved by the Jacobi …
[图书][B] Preconditioning for linear systems
Preconditioning for linear systems Page 1 PRECONDITIONING FOR LINEAR SYSTEMS
Giampaolo Mele Emil Ringh David Ek Federico Izzo Parikshit Upadhyaya Elias Jarlebring Page …
Giampaolo Mele Emil Ringh David Ek Federico Izzo Parikshit Upadhyaya Elias Jarlebring Page …
An adaptive multilevel factorized sparse approximate inverse preconditioning
This paper deals with adaptively preconditioned iterative methods for solving large and
sparse systems of linear equations. In particular, the paper discusses preconditioning where …
sparse systems of linear equations. In particular, the paper discusses preconditioning where …