Résolution de grands systèmes linéaires creux par méthodes itératives parallèles

DOI10.1051/m2an/1993270606511zbMath0791.65015MaRDI QIDQ4278033

Denis Trystram, Dominique Delesalle, L. Desbat

Publication date: 1 February 1994

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193718

zbMATH Keywords

rate of convergence; numerical experiments; Richardson method; conjugate gradient method; iterative methods; parallel computing; sparse linear systems; method of steepest descent; constant parameters

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

Related Items

Speedup and efficiency of large-size applications on heterogeneous networks

Uses Software

• LINPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• A preconditioning technique based on element matrix factorizations
• A Taxonomy for Conjugate Gradient Methods
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• THE PRECONDITIONED CONJUGATE GRADIENT METHOD ON THE CONNECTION MACHINE
• Some Computer Organizations and Their Effectiveness
• Methods of conjugate gradients for solving linear systems