Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
From MaRDI portal
Publication:4278033
DOI10.1051/m2an/1993270606511zbMath0791.65015OpenAlexW2467642971MaRDI QIDQ4278033
L. Desbat, Dominique Delesalle, Denis Trystram
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
rate of convergencenumerical experimentsRichardson methodconjugate gradient methoditerative methodsparallel computingsparse linear systemsmethod of steepest descentconstant parameters
Related Items
Uses Software
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