Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue

Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue (2005)

Cached

Download Links

[www.cs.wm.edu]
[www.cs.wm.edu]

Other Repositories/Bibliography

DBLP

by Andreas Stathopoulos

Venue:	SIAM J. SCI. COMPUT
Citations:	14 - 6 self

BibTeX

@TECHREPORT{Stathopoulos05nearlyoptimal,
    author = {Andreas Stathopoulos},
    title = {Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue},
    institution = {SIAM J. SCI. COMPUT},
    year = {2005}
}

Bookmark

OpenURL

Abstract

Citations

1243	Numerical Optimization - Nocedal, Wright - 2006
1128	Practical Optimization - Gill, Murray, et al. - 1981
920	The Algebraic Eigenvalue Problem - Wilkinson - 1965
640	The Symmetric Eigenvalue Problem - Parlett - 1998
280	The Geometry of Algorithms with Orthogonality Constraints - Edelman, Arias, et al. - 1998
231	SPARSKIT: A basic tool kit for sparse matrix computations - Saad - 1990
230	Solution of sparse indefinite systems of linear equations - Paige, Saunders - 1975
205	University of Florida sparse matrix collection - Davis - 1994
198	Implicit application of polynomial filters in a k–step Arnoldi method - Sorensen - 1992
186	Inexact Newton methods - Dembo, Eisenstat, et al. - 1982
152	Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Volume 1: Theory - Cullum, Willoughby - 1985
148	der Vorst, “A Jacobi–Davidson iteration method for linear eigenvalue problems - Sleijpen, Van - 2000
123	The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices - Davidson - 1975
104	ArPack users guide: Solution of large scale eigenvalue problems by implicitly restarted Arnoldi methods, tech - Lehoucq, Sorensen, et al. - 1996
93	der Vorst, Jacobi–Davidson style QR and QZ algorithms for the reduction of matrix pencils - Fokkema, Sleijpen, et al.
67	The block Lanczos method for computing eigenvalues - Golub, Underwood - 1977
65	Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method - Knyazev
52	Generalizations of Davidson’s method for computing eigenvalues of sparse symmetric matrices - Morgan, Scott - 1986
46	An iterative method for nonsymmetric systems with multiple right hand sides - Simoncini, Gallopoulos - 1995
44	Computing interior eigenvalues of large matrices - Morgan - 1991
34	Ablock Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices - Cullum, Donath - 1974
33	Dynamic thick restarting of the Davidson, and the implicitly restarted arnoldi methods - Stathopoulos, Saad, et al. - 1998
32	On restarting the Arnoldi method for large nonsymmetric eigenvalue problems - Morgan - 1996
32	Passing the one-billion limit in full configuration-interaction (FCI) calculations - Olsen, Jørgensen, et al. - 1990
27	A new Krylovsubspace method for symmetric indefinite linear systems - Freund, Nachtigal - 1994
26	Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems - Morgan, Scott - 1993
26	Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem - Notay
25	Analysis of projection methods for solving linear systems with multiple right hand sides - Chan, Wan - 1997
25	Inexact Rayleigh quotient-type methods for eigenvalue computations - Simoncini, Eldén
22	The effects of inexact solvers in algorithms for symmetric eigenvalue problems - Smit, Paardekooper - 1999
22	Restarting techniques for (Jacobi-)Davidson symmetric eigenvalue methods - Stathopoulos, Saad - 1998
21	Inexact inverse iterations for generalized eigenvalue problems - Golub, Ye
20	A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods - Arbenz, Hetmaniuk, et al. - 2005
20	An inexact inverse iteration for large sparse eigenvalue problems - Lai, Lin, et al. - 1997
20	Robust preconditioning of large sparse symmetric eigenvalue problems - Stathopoulos, Saad, et al. - 1995
19	The trace minimization method for the symmetric generalized eigenvalue problem - SAMEH, TONG
18	Large Sparse Symmetric Eigenvalue Problems with Homogeneous Linear Constrains - Golub, Zhang, et al.
18	Implicitly restarted Arnoldi methods and subspace iteration - Lehoucq
17	Iteration methods in eigenvalue problems - D’yakonov - 1983
16	Thick-restart Lanczos method for symmetric eigenvalue problems - Wu, Simon - 2000
14	Preconditioned eigensolvers – an oxymoron - Knyazev - 1998
12	Evaluation of three unstructured multigrid methods on 3d finite element problems in solid mechanics - Adams
12	Improved algorithms for the lowest eigenvalues and associated eigenvectors of large matrices - Murray, Racine, et al. - 1992
10	Dooren, A Grassmann–Rayleigh quotient iteration for computing invariant subspaces - Absil, Mahony, et al. - 2002
10	PRIMME: preconditioned iterative multimethod eigensolver methods and software description - Stathopoulos, McCombs
10	Approximate solutions and eigenvalue bounds from Krylov spaces - Paige, Parlett, et al. - 1995
9	Block Krylov space methods for linear systems with multiple righthand sides: an introduction - Gutknecht - 2006
8	A truncated-cg style method for symmetric generalized eigenvalue problem - Absil, Baker, et al.
8	Sturler, Recycling subspace information for diffuse optical tomography - Kilmer, de
6	Solving Maxwell eigenvalue problems for accelerating cavities - Arbenz, Geus, et al. - 2001