An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

DOI10.1137/0914009zbMATH Open0770.65022OpenAlexW1965366611MaRDI QIDQ5286340FDOQ5286340

Noël M. Nachtigal, Martin H. Gutknecht, Roland W. Freund

Publication date: 29 June 1993

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d11f2ff3e3947c2b9036aa930de933d566ec4710

Recommendations

• scientific article
• Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
• scientific article
• scientific article; zbMATH DE number 1330404
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• scientific article; zbMATH DE number 3900044
• The look-ahead Lanczos process for nonsymmetric matrices and its applications
• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• A look-back-type restart for the restarted Krylov subspace methods for solving non-Hermitian linear systems
• A fast contour-integral eigensolver for non-Hermitian matrices

zbMATH Keywords

eigenvalue problemsiterative methodsorthogonal polynomialsLanczos methodsparse linear systemsnon-Hermitian matriceslook-ahead steps

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (only showing first 100 items - show all)

• Model reduction using the Vorobyev moment problem
• A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
• The Lanczos algorithm and Hankel matrix factorization
• Computing the eigenvectors of nonsymmetric tridiagonal matrices
• Numerical impluimentation of a new algorithm for polynomials with multiple roots
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
• Breakdowns in the implementation of the Lánczos method for solving linear systems
• A numerical method for diffusion-convection equation using high-order difference schemes
• A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
• BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
• A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Comparison of quasi minimal residual and bi‐conjugate gradient iterative methods to solve complex symmetric systems arising from time‐harmonic magnetic simulations
• Solution of the eigenvalue problems resulting from global non-parallel flow stability analysis
• Look-ahead in Bi-CGSTAB and other product methods for linear systems
• Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
• The Lanczos algorithm and complex Gauss quadrature
• Krylov Subspace Solvers and Preconditioners
• The second-order biorthogonalization procedure and its application to quadratic eigenvalue problems
• A simple form for the fourth order difference method for 3-D elliptic equations
• A comparative study of iterative solutions to linear systems arising in quantum mechanics
• Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
• Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
• Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences
• The block Lanczos method for linear systems with multiple right-hand sides
• Region-dependent optimal \(m\)-stage Runge-Kutta schemes for solving a class of nonsymmetric linear systems
• Rational interpolation via orthogonal plynomials
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Experiments with Krylov subspace methods on a massively parallel computer
• An overview of approaches for the stable computation of hybrid BiCG methods
• Avoiding breakdown in variants of the BI-CGSTAB algorithm
• A QMR-based interior-point algorithm for solving linear programs
• A Lanczos-type procedure for tensors
• Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
• Convergence properties of Krylov subspace methods for singular linear systems with arbitrary index
• A look-ahead algorithm for the solution of general Hankel systems
• Software for simplified Lanczos and QMR algorithms
• Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
• A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
• The multipoint Padé table and general recurrences for rational interpolation
• A review of formal orthogonality in Lanczos-based methods
• The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
• Recycling BiCGSTAB with an Application to Parametric Model Order Reduction
• A rational Lanczos algorithm for model reduction
• Error Analysis of Krylov Methods In a Nutshell
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
• A partial Padé-via-Lanczos method for reduced-order modeling
• A theoretical overview of Krylov subspace methods
• Block Krylov subspace methods for the computation of structural response to turbulent wind
• A new iterative method for solving complex symmetric linear systems
• A Krylov subspace projection method for simultaneous solution of Helmholtz problems at multiple frequencies.
• A new implementation of the CMRH method for solving dense linear systems
• Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
• A Lanczos-type method for multiple starting vectors
• Reliable updated residuals in hybrid Bi-CG methods
• A linear system solver based on a modified Krylov subspace method for breakdown recovery
• Asymptotic waveform evaluation via a Lanczos method
• Lanczos-type algorithms for solving systems of linear equations
• Treatment of near-breakdown in the CGS algorithm
• The importance of structure in incomplete factorization preconditioners
• A stable primal-dual approach for linear programming under nondegeneracy assumptions
• Bifurcations of corank greater than two
• Krylov space methods on state-space control models
• An extended nonsymmetric block Lanczos method for model reduction in large scale dynamical systems
• An analysis of the composite step biconjugate gradient method
• A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
• Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
• An adaptive block Lanczos algorithm
• Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
• Low-Rank Modification of the Unsymmetric Lanczos Algorithm
• Iterative methods for unsymmetric linear systems
• A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges.
• Balanced iterative solvers for linear nonsymmetric systems and nonlinear systems with PDE origins: efficient black-box stopping criteria
• SPMR: A Family of Saddle-Point Minimum Residual Solvers
• Computation of matrix-valued formally orthogonal polynomials and applications
• Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration
• vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations
• Simultaneous similarity reductions for a pair of matrices to condensed forms
• Title not available (Why is that?)
• Nonlinear eigenvalue and frequency response problems in industrial practice
• Convergence and instability in PCG methods for bordered systems
• Numerical implementation of the QMR algorithm by using discrete stochastic arithmetic
• ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose
• AAA-least squares rational approximation and solution of Laplace problems
• The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems
• Generalized block anti-Gauss quadrature rules
• Avoiding look-ahead in the Lanczos method and Padé approximation
• Numerical analytic continuation
• The methods of Vorobyev and Lanczos
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
• Breakdowns and stagnation in iterative methods
• An engineering approach to generalized conjugate gradient methods and beyond
• A Lanczos-like method for non-autonomous linear ordinary differential equations

Uses Software

• ITSOL
• SPARSKIT
• Harwell-Boeing sparse matrix collection
• na1

This page was built for publication: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286340)