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