na1

swMATH11516MaRDI QIDQ23457

No author found.

Described by source

• Avoiding breakdown and near-breakdown in Lanczos type algorithms

Related Items (55)

The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization ⋮ Templates for the Solution of Algebraic Eigenvalue Problems ⋮ A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms ⋮ 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 ⋮ An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices ⋮ Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ Unnamed Item ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ A new taxonomy of conjugate gradient methods ⋮ The methods of Vorobyev and Lanczos ⋮ Avoiding breakdown in variants of the BI-CGSTAB algorithm ⋮ 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 ⋮ Formal orthogonal polynomials revisited. Applications ⋮ An engineering approach to generalized conjugate gradient methods and beyond ⋮ A theoretical overview of Krylov subspace methods ⋮ Extrapolation algorithms and Padé approximations: A historical survey ⋮ An adaptive block Lanczos algorithm ⋮ A linear system solver based on a modified Krylov subspace method for breakdown recovery ⋮ Unnamed Item ⋮ Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems ⋮ Transpose-free Lanczos-type algorithms for nonsymmetric linear systems ⋮ Fast and stable computation of the barycentric representation of rational interpolants ⋮ A Lanczos-type procedure for tensors ⋮ Avoiding breakdown in the CGS algorithm ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms ⋮ A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms ⋮ Reliability of Lanczos-type product methods from perturbation theory ⋮ A new implementation of the CMRH method for solving dense linear systems ⋮ Lanczos-type algorithms for solving systems of linear equations ⋮ Unnamed Item ⋮ Multiparameter Iterative Schemes for the Solution of Systems of Linear and Nonlinear Equations ⋮ New look-ahead Lanczos-type algorithms for linear systems ⋮ CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm ⋮ Unnamed Item ⋮ Composite Step Product Methods for Solving Nonsymmetric Linear Systems ⋮ Recent computational developments in Krylov subspace methods for linear systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems ⋮ Generalized block anti-Gauss quadrature rules ⋮ Unnamed Item ⋮ New Recurrence Relationships between Orthogonal Polynomials which Lead to New Lanczos-type Algorithms ⋮ Iterative solution of linear systems in the 20th century ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A review of formal orthogonality in Lanczos-based methods ⋮ A breakdown-free Lanczos type algorithm for solving linear systems

This page was built for software: na1