A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
From MaRDI portal
(Redirected from Publication:4286594)
Recommendations
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- The look-ahead Lanczos process for nonsymmetric matrices and its applications
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Low-Rank Modification of the Unsymmetric Lanczos Algorithm
Cites work
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 53017 (Why is no real title available?)
- scientific article; zbMATH DE number 3614069 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- A Convergence Analysis for Nonsymmetric Lanczos Algorithms
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A generalized nonsymmetric Lanczos procedure
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Large-scale complex eigenvalue problems
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils
- Reduction of a General Matrix to Tridiagonal Form
- Reduction to Tridiagonal Form and Minimal Realizations
- The ELR Method for Computing the Eigenvalues of a General Matrix
- The nonsymmetric Lanczos algorithm and controllability
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Use of indefinite pencils for computing damped natural modes
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(20)- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
- The matrix and polynomial approaches to Lanczos-type algorithms
- Low-Rank Modification of the Unsymmetric Lanczos Algorithm
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations
- Simultaneous similarity reductions for a pair of matrices to condensed forms
- An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
- The look-ahead Lanczos process for nonsymmetric matrices and its applications
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- A review of formal orthogonality in Lanczos-based methods
- Enhanced averaged quadrature rules with application to error estimation
- A theoretical overview of Krylov subspace methods
- Error estimates for quadrature rules based on the Arnoldi process
- Krylov type subspace methods for matrix polynomials
- A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
- A linear system solver based on a modified Krylov subspace method for breakdown recovery
- Multiple orthogonal polynomials applied to matrix function evaluation
- An adaptive block Lanczos algorithm
This page was built for publication: A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286594)
