scientific article; zbMATH DE number 4182691

MaRDI QIDQ5748802zbMATH OpenFDO

Authors Bruno Codenotti, Mauro Leoncini

Publication date 1990

zbMATH Keywords

preconditioningcomplexityparallel computationparallel algorithmsmatrix inversionexperimental resultsCsanky's algorithm

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Fast parallel algorithms for matrix inversion and linear systems solution
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Parallel Preconditioning with Sparse Approximate Inverses
• Massively parallel preconditioners for symmetric positive definite linear systems
• Publication:4860196

Cited in

(5)

• Stability of polynomial preconditioning
• Preconditioned method in parallel computation
• On the Origins of Linear and Non-linear Preconditioning
• Linear processing with pregroups
• Fast parallel algorithms for matrix inversion and linear systems solution

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5748802)