A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
From MaRDI portal
Publication:4005092
DOI10.1137/0613037zbMath0760.65039OpenAlexW4251074344MaRDI QIDQ4005092
Publication date: 27 September 1992
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0613037
orthogonal polynomialsPadé approximantsrecurrence relationscontinued fractionunsymmetric Lanczos algorithmqd algorithmquotient difference algorithmbi-conjugate gradientsbi-orthogonalizationBIORESBIORTHORESBO algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Padé approximation (41A21)
Related Items (58)
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 ⋮ 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 ⋮ Krylov type subspace methods for matrix polynomials ⋮ Hybrid methods based on LCG and GMRES ⋮ The block Lanczos method for linear systems with multiple right-hand sides ⋮ Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ On the squared unsymmetric Lanczos method ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ Breakdowns and stagnation in iterative methods ⋮ Formal orthogonal polynomials and Hankel/Toeplitz duality ⋮ The methods of Vorobyev and Lanczos ⋮ An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem ⋮ Avoiding breakdown in variants of the BI-CGSTAB algorithm ⋮ A look-ahead strategy for the implementation of some old and new extrapolation methods ⋮ An engineering approach to generalized conjugate gradient methods and beyond ⋮ A theoretical overview of Krylov subspace methods ⋮ Model reduction of state space systems via an implicitly restarted Lanczos method ⋮ 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 ⋮ Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate ⋮ Numerical analytic continuation ⋮ A Lanczos-type procedure for tensors ⋮ On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems ⋮ Numerical solution of linear eigenvalue problems ⋮ The universal block Lanczos-Padé method for linear systems over large prime fields ⋮ A Lanczos-like method for non-autonomous linear ordinary differential equations ⋮ Block Krylov subspace methods for the computation of structural response to turbulent wind ⋮ A breakdown of the block CG method ⋮ Numerical impluimentation of a new algorithm for polynomials with multiple roots ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ The Lanczos algorithm and Hankel matrix factorization ⋮ On Padé-type model order reduction of \(J\)-Hermitian linear dynamical systems ⋮ 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 ⋮ The block grade of a block Krylov space ⋮ ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose ⋮ Computation of matrix-valued formally orthogonal polynomials and applications ⋮ On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems ⋮ Lanczos-type algorithms for solving systems of linear equations ⋮ Krylov space methods on state-space control models ⋮ Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems ⋮ On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems ⋮ Generalized block anti-Gauss quadrature rules ⋮ Iterative solution of linear systems in the 20th century ⋮ Eigenvalue computation in the 20th century ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ A Lanczos-type method for multiple starting vectors ⋮ A review of formal orthogonality in Lanczos-based methods ⋮ Block orthogonal systems for symmetric \(P\)-forms ⋮ A breakdown-free Lanczos type algorithm for solving linear systems
This page was built for publication: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
