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

D. Delesalle; L. Desbat; D. Trystram

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (1993)

  • Volume: 27, Issue: 6, page 651-671
  • ISSN: 0764-583X

How to cite

top

Delesalle, D., Desbat, L., and Trystram, D.. "Résolution de grands systèmes linéaires creux par méthodes itératives parallèles." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 27.6 (1993): 651-671. <http://eudml.org/doc/193718>.

@article{Delesalle1993,
author = {Delesalle, D., Desbat, L., Trystram, D.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {sparse linear systems; iterative methods; parallel computing; numerical experiments; conjugate gradient method; constant parameters; Richardson method; method of steepest descent; rate of convergence},
language = {fre},
number = {6},
pages = {651-671},
publisher = {Dunod},
title = {Résolution de grands systèmes linéaires creux par méthodes itératives parallèles},
url = {http://eudml.org/doc/193718},
volume = {27},
year = {1993},
}

TY - JOUR
AU - Delesalle, D.
AU - Desbat, L.
AU - Trystram, D.
TI - Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1993
PB - Dunod
VL - 27
IS - 6
SP - 651
EP - 671
LA - fre
KW - sparse linear systems; iterative methods; parallel computing; numerical experiments; conjugate gradient method; constant parameters; Richardson method; method of steepest descent; rate of convergence
UR - http://eudml.org/doc/193718
ER -

References

top
  1. [1] S. F. ASHBY, T. A. MANTEUFFEL, P. E. SAYLOR, 1990, A Taxonomy For Conjugate Gradient Methods, Siam J. Numer. Anal., 27. Zbl0723.65018MR1080338
  2. [2] J. Y. BLANC, 1991, Contribution du parallélisme à la résolution d'un problème de répartition de charge dans les réseaux électriques, Thèse de l'institut polytechnique de Grenoble. 
  3. [3] P. CONCUS, G. GOLUB, D. P. O'LEARY, 1984, A Generalized Conjugate Gradient for the Numerical Solution of Elliptic Partial Differential Equations, in Numerical Analysis, série SIAM. Zbl0595.65110
  4. [4] D. DELESALLE, D. TRYSTRAM, D. WENZEK, 1990, Tout ce que vous voulez savoir sur la Connection Machine, Rapport de Recherche LMC-IMAG. 
  5. [5] L. DESBAT, 1990, Critères de Choix des Paramètres de Régularisation : Application à la déconvolution, Thèse de l'université Joseph Fourier, Annexe B : Gradient Conjugué et parallélisme. 
  6. [6] J. DEMMEL, J. J. DONGARRA, J. DUCROZ, A. GREENBAUM, S. J. HAMMARLING, D. C. SORENSEN, 1988, A project for developing a Linear Algebra Library for high-performance computer, Aspect of computation on asynchronous parallel processors, M. Wright. 
  7. [7] J. J. DONGARRA, I. S. DUFF, D. C. SORENSEN, H. A. VAN DER VORST, 1991, Solving Linear Systems on Vector and Shared Memory Computers, Siam. Zbl0770.65009MR1084164
  8. [8] J. J. DONGARRA, C. B. MOLER, J. R. BUNCH, G. W. STEWART, 1979, LINPACK user's guide, Siam philadelphia. Zbl0476.68025
  9. [9] M. J. FLYNN, 1972, Some computer organisations and their effectiveness, IEEE Trans. on Computers C-21, 9. Zbl0241.68020
  10. [10] G. FOX et al., 1988, Solving problems on concurrent processors : General techniques and regular problems (vol. I), Prentice-Hall. 
  11. [11] G. H. GOLUB, G. MEURANT, 1983, Résolution numérique des grands systèmes linéaires, Eyrolles Paris, collection CEA/EDF. Zbl0646.65022MR756627
  12. [12] G. H. GOLUB, R. S. VARGA, 1961, Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second other Richardson iterative methods, Part I et Part II, Numerische Mathematik. Zbl0099.10903
  13. [13] G. H. GOLUB, C. F. VAN LOAN, 1989, Matrix Computation, Second edition, Johns Hopkins. Zbl0733.65016MR1002570
  14. [14] J. GUSTAFSSON, G. LINDSKOG, 1986, A preconditioning technique based on element matrix factorisations, Comp. Meth. Appl. Mech. Engng., 55. Zbl0576.65022MR844907
  15. [15] A. L. HAGEMAN and D. M. YOUNG, 1981, Applied Iterative Methods, Academic Press. Zbl0459.65014MR630192
  16. [16] G. L. HENNIGANet al., 1989, A proposed domain decomposition technique for finite element on FPS T-serie, Proceedings of 4th Conf. Hypercube. 
  17. [17] M. HESTENES, E. STIEFEL, 1952, Methods of Conjugate Gradient for Solving Linear Systems, Journal Res. Nat. Bur. Stan., vol. 49. Zbl0048.09901MR60307
  18. [18] K. HWANG, F. A. BRIGGS, 1984, Computer Architecture and Parallel Processing, McGraw-Hill. Zbl0534.68006
  19. [19] O. G. JOHNSON, C. A. MICCHELLI and G. PAUL, 1983, Polynomial Preconditionnings for Conjugate Gradient Calculations, SIAM J. Numer. Anal., vol. 20, pp. 362-376. Zbl0563.65020MR694525
  20. [20] P. LASCAUX, R. THEODOR, 1987, Calcul matriciel appliqué à l'art de l'ingénieur, Masson. Zbl0601.65017MR883208
  21. [21] P. LAURENT-GENGOUX, D. TRYSTRAM, 1988, Parallel conjugate gradient algorithm with local decomposition, Rapport de recherche TIM3-IMAG. 
  22. [22] O. A. McBRYAN, 1989, Connection Machine Application Performance, Boulder Research report. Zbl0960.68527
  23. [23] THINKING MACHINE CORPORATION, 1991, Connection Machine CM-200 Serie, Technical Summary. 
  24. [24] Y. SAAD, 1983Practical use of polynomial preconditionings for the conjugate gradient method, Yale Research report YALEU/DCS/RR-282. Zbl0601.65019
  25. [25] J. SALTZ, S. PETITON, H. BERRYMAN and A. RIFKIN, 1991, Performance effects of irregular communications patterns on massively parallel multiprocessors, NASA Contracter Report 187514. 
  26. [26] C. TONG, 1989, The Preconditioned Conjugate Gradient Method on the Connection Machine. Int. Jour. of Hight Speed Comp., vol. 1. Zbl0725.65033

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.