na1
From MaRDI portal
Software:23457
swMATH11516MaRDI QIDQ23457FDOQ23457
Author name not available (Why is that?)
Cited In (55)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Recurrence Relationships between Orthogonal Polynomials which Lead to New Lanczos-type Algorithms
- New look-ahead Lanczos-type algorithms for linear systems
- The matrix and polynomial approaches to Lanczos-type algorithms
- Title not available (Why is that?)
- Avoiding breakdown in the CGS algorithm
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
- Title not available (Why is that?)
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Multiparameter Iterative Schemes for the Solution of Systems of Linear and Nonlinear Equations
- On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
- Title not available (Why is that?)
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- Formal orthogonal polynomials revisited. Applications
- Title not available (Why is that?)
- Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
- Iterative solution of linear systems in the 20th century
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- Reliability of Lanczos-type product methods from perturbation theory
- Avoiding breakdown in variants of the BI-CGSTAB algorithm
- Templates for the Solution of Algebraic Eigenvalue Problems
- A look-ahead strategy for the implementation of some old and new extrapolation methods
- Breakdown and near-breakdown control in the CGS algorithm using stochastic arithmetic
- Title not available (Why is that?)
- A Lanczos-type procedure for tensors
- Fast and stable computation of the barycentric representation of rational interpolants
- Generalized block anti-Gauss quadrature rules
- Composite Step Product Methods for Solving Nonsymmetric Linear Systems
- A new taxonomy of conjugate gradient methods
- A review of formal orthogonality in Lanczos-based methods
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- A theoretical overview of Krylov subspace methods
- A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
- A new implementation of the CMRH method for solving dense linear systems
- The methods of Vorobyev and Lanczos
- A linear system solver based on a modified Krylov subspace method for breakdown recovery
- A breakdown-free Lanczos type algorithm for solving linear systems
- Lanczos-type algorithms for solving systems of linear equations
- Treatment of near-breakdown in the CGS algorithm
- Title not available (Why is that?)
- Recent computational developments in Krylov subspace methods for linear systems
- An engineering approach to generalized conjugate gradient methods and beyond
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- Extrapolation algorithms and Padé approximations: A historical survey
- An adaptive block Lanczos algorithm
This page was built for software: na1