scientific article
From MaRDI portal
Publication:3200466
zbMath0714.65034MaRDI QIDQ3200466
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergenceconjugate gradient methodroundoff errorsconjugate gradient squared methodincomplete Cholesky preconditioning
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
On the convergence rate of the conjugate gradients in presence of rounding errors ⋮ Optimal preconditioners on solving the Poisson equation with Neumann boundary conditions ⋮ A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ Weighted graph based ordering techniques for preconditioned conjugate gradient methods ⋮ The construction of an algebraically reduced system for the acceleration of preconditioned conjugate gradients ⋮ Conditioning analysis of sparse block approximate factorizations ⋮ A comparison of some GMRES-like methods ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations ⋮ Incomplete factorization by local exact factorization (ILUE) ⋮ Milestones in the development of iterative solution methods ⋮ Modified block-approximate factorization strategies ⋮ Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids ⋮ Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning ⋮ Preconditioning techniques for large linear systems: A survey
Uses Software
This page was built for publication:
