The methods of Vorobyev and Lanczos
From MaRDI portal
Publication:1908186
DOI10.1016/0024-3795(94)00081-6zbMath0923.65023OpenAlexW1993332737MaRDI QIDQ1908186
Publication date: 2 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00081-6
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)
Related Items
Algebraic description of the finite Stieltjes moment problem, Comparisons Between Vector and Matrix Padé Approximants, Lanczos-type algorithms for solving systems of linear equations, Homogeneous and nonhomogeneous linear trigonometric moment problem and recursiveness
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An explicit formula for Lanczos polynomials
- Recursive interpolation, extrapolation and projection
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Some vector sequence transformations with applications to systems of equations
- Implementation of the recurrence relations of biorthogonality
- Lanczos maximal algorithm for unsymmetric eigenvalue problems
- Padé-type approximation and general orthogonal polynomials
- Moment methods in Padé approximation: The unitary case
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Generating conjugate directions for arbitrary matrices by matrix equations. II
- A quasi-Newton method for solving fixed point problems in Hilbert spaces
- A breakdown-free Lanczos type algorithm for solving linear systems
- A Padé-type approach to non-classical orthogonal polynomials
- Extrapolation vs. projection methods for linear systems of equations
- Other manifestations of the Schur complement
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Moment methods in Padé approximation
- Avoiding breakdown in the CGS algorithm
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Nonlinear CG-like iterative methods
- Bounds for matrix moments
- Accélération de la convergence en analyse numérique
- Some inequalities of the Gram determinants of the Krylov vector sequence associated with an orthonormal matrix in \(\mathbb{R}^ p\)
- Treatment of near-breakdown in the CGS algorithm
- Extrapolation methods
- Lanczos-type algorithms for solving systems of linear equations
- New implementations of Lanczos method
- Vector orthogonal polynomials and matrix series
- A Projective Newton Method for Semilinear Operator Equations in Banach Spaces
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative refinement of the method of moments
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- An Iterative Variant of the Degenerate Kernel Method for Solving Fredholm Integral Equations
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
