na5

swMATH11489MaRDI QIDQ23431

No author found.

Described by source

• Treatment of near-breakdown in the CGS algorithm

Related Items (max. 100)

Hybrid procedures for solving linear systems ⋮ A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ The methods of Vorobyev and Lanczos ⋮ 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 ⋮ Extrapolation algorithms and Padé approximations: A historical survey ⋮ Transpose-free Lanczos-type algorithms for nonsymmetric linear systems ⋮ Unnamed Item ⋮ Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations ⋮ Unnamed Item ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ Unnamed Item ⋮ Lanczos-type algorithms for solving systems of linear equations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Numerical Linear Algebra for High-Performance Computers ⋮ On vector Hankel determinants ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A review of formal orthogonality in Lanczos-based methods ⋮ Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences ⋮ A breakdown-free Lanczos type algorithm for solving linear systems

This page was built for software: na5