A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
From MaRDI portal
Publication:4287889
DOI10.1137/S0895479890188803zbMath0809.65028MaRDI QIDQ4287889
Publication date: 19 April 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Padé approximantsformal orthogonal polynomialsrecurrencesbreakdownsquotient difference algorithmstaircaseBIODIRbiconjugate gradient algorithmBIOMINunsymmetric Lanczos bi-orthogonalization algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Padé approximation (41A21)
Related Items
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, Krylov type subspace methods for matrix polynomials, Hybrid methods based on LCG and GMRES, Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems, Breakdowns and stagnation in iterative methods, Formal orthogonal polynomials and Hankel/Toeplitz duality, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, Avoiding breakdown in variants of the BI-CGSTAB algorithm, Model reduction of state space systems via an implicitly restarted Lanczos method, 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, High performance algorithms for Toeplitz and block Toeplitz matrices, Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate, vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations, 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, A new presentation of orthogonal polynomials with applications to their computation, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Breakdowns in the implementation of the Lánczos method for solving linear systems, 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, On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems, Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems, Modified moments for indefinite weight functions, On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems, Generalized block anti-Gauss quadrature rules, The matrix and polynomial approaches to Lanczos-type algorithms, A review of formal orthogonality in Lanczos-based methods
