A new look at the Lanczos algorithm for solving symmetric systems of linear equations

From MaRDI portal

Publication:1138344

Jump to:navigation, search

DOI10.1016/0024-3795(80)90248-7zbMath0431.65016OpenAlexW1969324505MaRDI QIDQ1138344

Beresford N. Parlett

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90248-7

zbMATH Keywords

conjugate gradient algorithm Lanczos algorithm implementation tridiagonalization large sparse symmetric matrix selective orthogonalization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items

Adaptive preconditioners for nonlinear systems of equations, Numerical method for unitary systems, A continuous approximation to the generalized Schur decomposition, On the optimal solution of large eigenpair problems, An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A, Lanczos algorithms and field of value rotations for symmetric matrix pencils, On Kogbetliantz's SVD algorithm in the presence of clusters, The use of a refined error bound when updating eigenvalues of tridiagonals, A two-step iterative block Lanczos algorithm for a dominant eigenspan, The convergence behavior of Ritz values in the presence of close eigenvalues, On a deflation method for the symmetric generalized eigenvalue problem, Bidiagonalization and diagonalization, Singular value decompositions of complex symmetric matrices, Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\), On extremum properties of orthogonal quotients matrices, The partial total least squares algorithm, Complexity of parallel matrix computations, Computing a nearest symmetric positive semidefinite matrix, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Error analysis of the Trefftz method for solving Laplace's eigenvalue problems, The computation of the Kronecker canonical form of an arbitrary symmetric pencil, On the convergence rate of the QL algorithm with Wilkinson's shift, A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations, Conjugate gradient type methods and preconditioning, Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences, Accelerated simultaneous iterations for large finite element eigenproblems, Block power method for computing solvent and spectral factors of matrix polynomials, A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices, A new kind of discretization scheme for solving a two-dimensional time-independent Schrödinger equation, Computing multiple peak solutions for Bose-Einstein condensates in optical lattices, Variational calculations of structures and energetics in very floppy trimers: a new computational implementation, A note on the approximation of two-sided Rayleigh quotient to eigenvalues, Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\), The channel capacity of read/write isolated memory, A Krylov-Schur approach to the truncated SVD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Rational approximation to the Fermi-Dirac function with applications in density functional theory, A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence, An interactive method for the eigenvalue problem for matrices, Symmetrizability of asymmetric systems, Davidson's method and preconditioning for generalized eigenvalue problems, An algorithm for finding generalized eigenpairs of a symmetric definite matrix pencil, A new algorithm for computing eigenpairs of matrices, Rayleigh quotient iteration fails for nonsymmetric matrices, Derived eigenvalues of symmetric matrices, with applications to distance geometry, Conjugate gradient method for the solution of linear equations: Application to molecular electronic structure calculations, An atlas for tridiagonal isospectral manifolds, Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values, Schur parameter pencils for the solution of the unitary eigenproblem, The eigenvalue spectrum of domain decomposed preconditioners, On asymptotic behaviour of solutions of certain classes of ordinary differential equations, On eigenvalues of a Rayleigh quotient matrix, Residual bounds for unitarily invariant norms on clustered eigenvalues, Lanczos and Arnoldi methods for the solution of convection-diffusion equations, Parallel solution of Toeplitzlike linear systems, Breakdowns in the implementation of the Lánczos method for solving linear systems, Evaluation of matrix functions with the block Lanczos algorithm, An orthogonal accelerated deflation technique for large symmetric eigenproblems, Some asymptotic properties of solutions of homogeneous linear systems of ordinary differential equations, Elastic waves guided by an infinite plane crack, Computing several eigenpairs of Hermitian problems by conjugate gradient iterations, The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures, Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices, The Lanczos optimization of a splitting-up method to solve homogeneous evolutionary equations, Additive preconditioning, eigenspaces, and the inverse iteration, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, Superquadratic convergence of DLASQ for computing matrix singular values, Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential, Parallel implementation of the \texttt{MAGPACK} package for the analysis of high-nuclearity spin clusters, New progress in real and complex polynomial root-finding, Computation of eigenmodes of photonic crystals by inversion of the Maxwell operator, Postprocessing and higher order convergence of the mixed finite element approximations of biharmonic eigenvalue problems, Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems, Restarted block-GMRES with deflation of eigenvalues, Implementation of spectral basis functions in BEM/FEM/GSM domain decomposition methods devoted to scattering and radiation applications, Solving the vibrational Schrödinger equation on an arbitrary multidimensional potential energy surface by the finite element method, An explicit formula for Lanczos polynomials, A minimum norm approach for low-rank approximations of a matrix, Saving flops in LU based shift-and-invert strategy, The QR algorithm and scattering for the finite nonperiodic Toda lattice, On preconditioned eigensolvers and invert-Lanczos processes, Convergence of algorithms of decomposition type for the eigenvalue problem, New method for solving multidimensional scattering problem, An integration-free algorithm for the solution of regular boundary value problems: Space pruning approach, Rational Krylov sequence methods for eigenvalue computation, Numerical enclosure for each eigenvalue in generalized eigenvalue problem, A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx, Error analysis of modal methods for viscously damped structural systems, On the spectral radius of (0,1)-matrices, A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices, A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems, Solving the inverse eigenvalue problem via the eigenvector matrix, An improved Lanczos algorithm for solving ill-conditioned linear equations, Some interlacing results for indefinite Hermitian matrices, Recursive residue generation method for laser-molecule interaction: Utilization of structured sparsity, Analysis of the symmetric Lanczos algorithm with reorthogonalization methods, On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem, On the real convergence rate of the conjugate gradient method, Computing interior eigenvalues of large matrices, The loss of orthogonality in the Gram-Schmidt orthogonalization process, A breakdown-free block conjugate gradient method, Recursive tridiagonalization of infinite dimensional Hamiltonians, A generalized nonsymmetric Lanczos procedure, Super-matrix methods, Numerical solution of large nonsymmetric eigenvalue problems, The block Lanczos algorithm and the calculation of matrix resolvents, Applications of the Lanczos method, Towards a black box Lanczos program, Implementing Lanczos-like algorithms on hypercube architectures, A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications, Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils, On application of the Lanczos method to solution of some partial differential equations, On the transient behavior of a finite birth-death process with an application, On eigenvalue variations of Rayleigh quotient matrix pencils of a definite pencil, A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, Cluster robust error estimates for the Rayleigh-Ritz approximation. I: Estimates for invariant subspaces, Cluster robust error estimates for the Rayleigh-Ritz approximation II: Estimates for eigenvalues, Minimal eigenvalue of a real symmetric positive definite Toeplitz matrix, A fast and stable parallel QR algorithm for symmetric tridiagonal matrices, A parallel processed scheme for the eigenproblem of positive definite matrices, Scaled Toda-like flows, Computation of the fundamental singular subspace of a large matrix, Physical and numerical aspects in Lanczos and modified Lanczos calculations, Numerical solutions for large sparse quadratic eigenvalue problems, Parallel homotopy algorithm for symmetric large sparse eigenproblems, Explicit construction of hyperdominant symmetric matrices with assigned spectrum, A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices, Self-scaling fast rotations for stiff and equality-constrained linear least squares problems, A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix, Nonlinear eigenvector algorithms for local optimization in multivariate data analysis, Finite elastoplastic deformations of space-curved membranes, Determination of eigenstates via Lanczos-based forward substitution and filter- diagonalization, Generalized updating problems and computation of the eigenvalues of rational Toeplitz matrices, Fernando's solution to Wilkinson's problem: An application of double factorization, Robust preconditioning of large, sparse, symmetric eigenvalue problems, Twofold deflation preconditioning of linear algebraic systems. I: Theory, Eigenvalue inequalities and equalities, A new method for computing the stable invariant subspace of a real Hamiltonian matrix, Error bounds in the isometric Arnoldi process, Notes on TQR algorithms, Componentwise analysis of direct factorization of real symmetric and Hermitian matrices, A sharp version of Kahan's theorem on clustered eigenvalues, On the randomized error of polynomial methods for eigenvector and eigenvalue estimates, Parallel solution techniques in computational structural mechanics, Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices, On the numerical integration of three-invariant elastoplastic constitutive models., Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides, A projection method for generalized eigenvalue problems using numerical integration., Rational approximation preconditioners for sparse linear systems., A spectrum slicing method for the Kohn-Sham problem, The Lanczos algorithm for operators with a continuous and a point spectrum, Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values., An iterative system equivalent reduction expansion process for extraction of high frequency response from reduced order finite element model., Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method, Finite deformation plasticity in principal axes: From a manifold to the Euclidean setting, Frequency-domain and time-domain finite-element solution of Maxwell's equations using spectral Lanczos decomposition method., Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods, Comparison of Krylov subspace methods with preconditioning techniques for solving boundary value problems, The relative error in the Pruess method for Sturm-Liouville problems, A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting, Graphs with diameter \(n - e\) minimizing the spectral radius, Certain rank 2K updates act like rank K, A variational technique for the computation of the vibration frequencies of mechanical systems governed by nonsymmetric matrices, Use of indefinite pencils for computing damped natural modes, Trace minimization and definiteness of symmetric pencils, Conjugate gradient type methods for semilinear elliptic problems with symmetry, Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems, Perturbation and interlace theorems for the unitary eigenvalue problem, Large-scale complex eigenvalue problems, Biorthogonal Rosenbrock-Krylov time discretization methods, Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices, On singular values of Hankel operators of finite rank, Toda flows with infinitely many variables, Parallel block Jacobi eigenvalue algorithms using systolic arrays, A new splitting to solve a large Hermitian eigenproblem, Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method, Finite difference schemes and block Rayleigh quotient iteration for electronic structure calculations on composite grids, Unconstrained energy functionals for electronic structure calculations, A parallel Davidson-type algorithm for several eigenvalues, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Modified explicitly restarted Lanczos algorithm, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, The effects of inexact solvers in algorithms for symmetric eigenvalue problems, Eigenvalue computation in the 20th century, Preconditioning eigenvalues and some comparison of solvers, The trace minimization method for the symmetric generalized eigenvalue problem, A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix, A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient, The orthogonal Rayleigh quotient iteration (ORQI) method, One-sided reduction to bidiagonal form, Free and forced vibrations of trusses by Fourier decomposition, and homotopy methods for nonlinear matrix eigenvalue problems. II: Properties and supplements, Relating Newton's method to projection methods for eigenvalue problems, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, On matrix differential equations and abstract FG algorithm, Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs, Numerics of Gram-Schmidt orthogonalization, On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods, A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems, A priori error bounds on invariant subspace approximations by block Krylov subspaces, An efficient algorithm for the Schrödinger-Poisson eigenvalue problem, On pairs of almost diagonal matrices, On feedback stabilization of the tokamak plasma vertical instability, BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES, Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems, Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy, A special incremental–iterative solution technique for non‐linear structural analysis including snap‐through, A sparse nonsymmetric eigensolver for distributed memory architectures, Practical small sample inference for single lag subset autoregressive models, Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems, Edge-disjoint spanning trees and eigenvalues, A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem, Continuous methods for symmetric generalized eigenvalue problems, Asymptotic analysis of Toda lattice on diagonalizable matrices, Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications, A new vector field method for eigen-decomposition of symmetric matrices, Hierarchic higher-order Hermite elements on hybrid triangular/quadrilateral meshes, Sparse matrices, Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem, Computation of Gauss-type quadrature formulas, On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems, Fast generalized cross validation using Krylov subspace methods, A comparison of two parallel algorithms for the symmetric eigenproblem, Multiple right-hand side techniques for the numerical simulation of quasistatic electric and magnetic fields, Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations, An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems, Computation of POD basis functions for fluid flows with Lanczos methods, Fast eigensolver for dense real-symmetric matrices, Residuals of refined projection methods for large matrix eigenproblems, A probabilistic analysis of linear operator testing, A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem, Fast linear iterations for distributed averaging, Low-Rank Modification of the Unsymmetric Lanczos Algorithm, Adaptive frequency windowing for multifrequency solutions in structural acoustics based on the matrix Padé-via-Lanczos algorithm, Free vibration analysis of multilayered composite plates and shells with the natural approach, Numerical-analytical algorithm of seismic wave propagation in inhomogeneous media, A continuation BSOR-Lanczos--Galerkin method for positive bound states of a multi-component Bose-Einstein condensate, Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1138344&oldid=13190303"