An implicit restarted Lanczos method for large symmetric eigenvalue problems
From MaRDI portal
Publication:1344405
zbMath0809.65030MaRDI QIDQ1344405
Danny C. Sorensen, Lothar Reichel, Daniela Calvetti
Publication date: 12 February 1995
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118543
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem, Distributional Robustness in Minimax Linear Quadratic Control with Wasserstein Distance, Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, An implicit shift bidiagonalization algorithm for ill-posed systems, Randomized Spectral Clustering in Large-Scale Stochastic Block Models, Accelerating large partial EVD/SVD calculations by filtered block Davidson methods, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, Model reduction of state space systems via an implicitly restarted Lanczos method, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, Inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction, A compact heart iteration for low-rank approximations of large matrices, A mathematical biography of Danny C. Sorensen, A Krylov-Schur approach to the truncated SVD, A survey of subspace recycling iterative methods, An iterative Lavrentiev regularization method, Numerical solution of linear eigenvalue problems, Computing the smallest singular triplets of a large matrix, On Chebyshev-Davidson method for symmetric generalized eigenvalue problems, Approximate eigensolution of Laplacian matrices for locally modified graph products, A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, Approximating Spectral Clustering via Sampling: A Review, The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations, Cucheb: a GPU implementation of the filtered Lanczos procedure, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, Fast sampling of parameterised Gaussian random fields, Link prediction via controlling the leading eigenvector, An iterative method with error estimators, Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel, A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process, A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems, The numerical rank of Krylov matrices, On preconditioned eigensolvers and invert-Lanczos processes, A cross-product approach for low-rank approximations of large matrices, Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems, Thick-restart Lanczos method for electronic structure calculations, Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling, An extended QR-solver for large profiled matrices, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, A parallel Davidson-type algorithm for several eigenvalues, Clique-based method for social network clustering, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, The spectral condition number plot for regularization parameter evaluation, The implicitly restarted multi-symplectic block-Lanczos method for large-scale Hermitian quaternion matrix eigenvalue problem and applications, Subspace Iteration Randomization and Singular Value Problems, Iterative methods for large continuation problems, The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method, Computing interior eigenvalues of large sparse symmetric matrices
