Skip to main content
SpringerLink
Log in

Parallel computations in linear algebra

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. N. N. Mirenkov, “Solution of a system of linear equations on a computing system,” in: Computing Systems [in Russian], No. 30, Novosibirsk (1968), pp. 8–11.

  2. H. C. Andrews and K. L. Caspari, “Degrees of freedom and modular structure in matrix multiplication,” IEEE Trans. Comput.,C-20, No. 2, 133–141 (1971).

    Google Scholar 

  3. G. Birkhoff and A. George, “Elimination by nested dissection,” in: Complexity of Sequential and Parallel Numerical Algorithms, Academic Press, New York (1973), pp. 221–263.

    Google Scholar 

  4. A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numerical Problems, American Elsevier, New York (1975).

    Google Scholar 

  5. A. Bourgeat, Expérimentation des Méthodes Itératives-Série-Parallèle, Univ. Lyon, I, Section d'Analyse Numérique, Villeurbanne, France (1971–72).

    Google Scholar 

  6. O. Buneman, A Compact Noniterative Poisson Solver, Rep. SU-IPR-294, Institute of Plasma Research, Stanford University, Stanford, California.

  7. B. L. Buzbee, “A fast Poisson solver amenable to parallel computation,” IEEE Trans. Comput.,C-22, No. 8, 793–796 (1973).

    Google Scholar 

  8. B. L. Buzbee, G. H. Golub, and C. W. Nielson, “On direct methods for solving Poisson's equations,” SIAM J. Numer. Anal.,7, No. 4, 627–656 (1970).

    Google Scholar 

  9. D. A. Calahan, Parallel Solution of Sparse Simultaneous Linear Equations, Technical Report, University of Michigan, Ann Arbor Michigan (1973).

    Google Scholar 

  10. D. A. Calahan, “Exploiting parallelism in design algorithms,” in: Basic Questions of Decision Theory, Amsterdam (1974), pp. 285–302.

  11. D. Chazan and W. Miranker, “Chaotic relaxation,” Lin Algebra Appl.,2, No. 2, 199–222 (1969).

    Google Scholar 

  12. S.-C. Chen, Speedup of Iterative Programs in Multiprocessing Systems, Dissertation, Departmentsof Computer Science, University of Illinois, Urbana, Illinois (1975).

    Google Scholar 

  13. S.-C. Chen and D. J. Kuck, “Time and parallel processor bounds for linear recurrence systems,” IEEE Trans. Comput.,C.-24, No. 7, 701–717 (1975).

    Google Scholar 

  14. A. K. Cline, “A Lanczos-type method for the solution of large sparse systems of linear equations,” in: Papers Contributed to the Second Langley Conference on Computer Science, Virginia Beach (1974).

  15. L. Csanky, On the Parallel Complexity of Some Computational Problems, Dissertation, Computer Science Division, University of California, Berkeley, California (1974).

    Google Scholar 

  16. L. Csanky, “Fast parallel matrix inversion algorithms,” in: Sixteenth Annual Symposium on the Foundations of Computer Science, No. 9, New York (1975), pp. 11–12.

  17. L. Csanky, “Fast parallel matrix inversion algorithms,” SIAM J. Comput.,5, No. 4, 618–623 (1976).

    Google Scholar 

  18. J. D. P. Donnelly, “Periodic chaotic relaxation,” Lin. Algebra Appl.,4, No. 2, 117–128 (1971).

    Google Scholar 

  19. F. W. Dorr, “The direct solution of the discrete Poisson equation on a rectangle,” SIAM Rev.,12, No. 2, Part 1, 248–263 (1970).

    Google Scholar 

  20. J. H. Ericksen, Iterative and Direct Methods for Solving Poisson's Equation and Their Adaptability to ILLIAC IV, Document 60, Center for Advanced Computers, University of Illinois, Urbana, Illinois (1972).

    Google Scholar 

  21. P. A. Gilmore, Parallel Relaxation, Goody ear Aerospace Corporation, Akron, Ohio (1971).

    Google Scholar 

  22. P. A. Gilmore, “Matrix computations on an associative processor,” Lect. Notes Comput. Sci., No. 24, 272–290 (1975).

    Google Scholar 

  23. J.C. Hall, Examination of Numerical Methods for Singular Value Decompositions, Master of Science Thesis, University of Colorado, Boulder, Colorado (1973).

    Google Scholar 

  24. L. Han, Storage Schemes for Symmetrical Matrices, ILLIAC IV, Document 149, Department of Computer Science, University of Illinois, Urbana, Illinois (1967).

    Google Scholar 

  25. L. Hayes, Comparative Analysis of Iterative Techniques for Solving Laplace's Equation on the Unit Square on a Parallel Processor, Master of Science Thesis, Department of Mathematics, University of Texas, Austin, Texas (1974).

    Google Scholar 

  26. D. E. Heller, “A determinant theorem with applications to parallel algorithms,” SIAM J. Numer. Anal.,11, No. 3, 559–568 (1974).

    Google Scholar 

  27. D. E. Heller, On the Efficient Computation of Recurrence Relations, ICASE Report NASA Langley Research Center, Carnegie-Mellon University, Hampton, Virginia (1974).

    Google Scholar 

  28. D. E. Heller, “Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems,” SIAM J. Numer. Anal.,13, No. 4, 484–496 (1976).

    Google Scholar 

  29. D. E. Heller, A Survey of Parallel Algorithms in Numerical Linear Algebra, Department of Computer Science, Carnegie-Mellon University (1976).

  30. D. E. Heller, D. K. Stevenson, and J. F. Traub, “Accelerated iterative methods for the solution of tridiagonal systems on parallel computers,” J. Assoc. Comput. Mach.,23, 636–654 (1976).

    Google Scholar 

  31. P. W. Hockney, “A fast direct solution of Poisson's equation using Fourier analysis,” J. Assoc. Comput. Mach.,12, No. 1, 95–113 (1965).

    Google Scholar 

  32. L. M. Howser and J. J. Lambiotte, STAR Adaptation for Two Algorithms Used onSerial Computer, NASA Tech. Mem. X-3003, NASA Langley Research Center, Hampton, Virginia (1974).

    Google Scholar 

  33. L. Hyafil and H. T. Kung, Parallel Algorithms for Solving Triangular Linear Systems with Small Parallelism, Department of Computer Science, Carnegie-Mellon University (1974).

  34. L. Hyafil and H. T. Kung, “Bounds on speedups of parallel evaluation of recurrences,” in: Proceedings of the Second USA-Japan Computer Conference (1975), pp. 178–182.

  35. L. Hyafil and H. T. Kung, Parallel Evaluation of Recurrences and Parallel Algorithms for Solving Band Linear Systems, Department of Computer Science, Carnegie-Mellon University (1975).

  36. T. L. Jordan, A New Parallel Algorithm for Diagonally Dominant Tridiagonal Matrices, Los Alamos Science Laboratory, Los Alamos, New Mexico (1974).

    Google Scholar 

  37. J.H. Katz, “Matrix computation on an associative processor,” in: Parallel Processor Systems Technique and Applications, Spartan, New York (1970), pp. 131–149.

    Google Scholar 

  38. M. Knowles, B. Okawa, Y., Muraoka, and R. Wilhelmson, Matrix Operations on ILLIAC IV Document 118, Department of Computer Science, University of Illinois, Urbana, Illinois (1967).

    Google Scholar 

  39. D. J. Kuck, “ILLIAC IV software and application programming,” IEEE Trans. Comput.,C-17, No. 8, 758–770 (1968).

    Google Scholar 

  40. D. J. Kuck and A. H. Sameh, “Parallel computation of eigenvalues of real matrices,” in: Proceedings of the International Federation of Information Processing Congress-71, Ljubljana, Vol. 2, North-Holland, Amsterdam-London (1972), pp. 1266–1272.

    Google Scholar 

  41. J.-C. Lafon, Complexité de l'Évaluation de Plusieurs Formes Bilinéaires et des Principaux Calculs Matriciels, These, Université de Grenoble (1976), pp. 6+A35+B145+C116.

  42. J. J. Lambiotte, The Solution of Linear Systems of Equations on a Vector Computer, Dissertation, University of Virginia (1975).

  43. J. J. Lambiotte and R. G. Voigt, “The solution of tridiagonal linear systems on the CDC STAR-100 computer,” ACM Trans. Math. Software,1, No. 4, 308–329 (1975).

    Google Scholar 

  44. R. J. Lermit and J. M. Randal, Augmented Significance Routines for ILLIAC IV, Document 56, Center for Advanced Computers, University of Illinois, Urbana, Illinois (1972).

    Google Scholar 

  45. J. W. Liu, The Solution of Mesh Equations on a Parallel Computer, Department of Computer Science, University of Waterloo (1974).

  46. Y. Matsushita, Sparse Matrix Inversion on ILLIAC IV, Document 140, Center for Advanced Computers, University of Illinois, Urbana, Illinois (1968).

    Google Scholar 

  47. L. M. McDaniel, Symmetric Decomposition of Positive Definite Band Matrices and the Corresponding Solution of Systems of Linear Equations on ILLIAC IV, Document 34 Center for Advanced Computers, University of Illinois, Urbana, Illinois (1972).

    Google Scholar 

  48. J. Miklośko, Niectoré Paralelné Algoritmy na Výpoćet Troja Pätdiagonálnych Systémov Linéarnych Algebraiccých Rovnic, Rep. Ústavi Technickej Kybernetiky SAV, Bratislava (1972).

  49. J. Miklośko, “Paralelizmus v algoritmoch numeriskej matematiky,” in: Správa ÚTK SAV Teoretické Zaklady Počitačov Stvrtej Generàcie, Z-20/140, Bratislava (1973), pp. 53–68.

  50. J. Miklośko, “Parallelism in numerical analysis” Acta Univ. Carol. Math. Phys.,15, Nos. 1–2, 103–104 (1974).

    Google Scholar 

  51. J. Miklośko, “Asynchrónne výpoćtové procesy a multiprocesorové poćitaće,” Acta Kybern.,1, 9–17 (1975).

    Google Scholar 

  52. J. Mikośko, “Realizácia asynchrónneho výpoćtového procesu metódou jednèho pamätania,” Inf. Syst.,2, 141–150 (1975).

    Google Scholar 

  53. J. Miklosko “Niektoré problémy konstruovania a analýzy paralelných algoritmov,” in: Zb. 7 Symp. Aplikáciách Teoretických Principov Kybernetiky, SKS, Bratislava (1976), pp. 33–47.

  54. W. L. Miranker, “A survey of parallelism in numerical analysis,” SIAM Rev.,13, No. 4, 524–547 (1971).

    Google Scholar 

  55. P. Morice, Calcul Parallèle et Décomposition dans la Résolution d'Équations aux Dérivées Partièlles de Type Élliptique, IRIA Rep. (1972).

  56. S. E. Orcutt, Computer Organization and Algorithms for Very High-Speed Computations, Dissertation, Stanford University (1974).

  57. J. Palmer, Conjugate Direction Methods and Parallel Computing, Dissertation, Department of Computer Science, Stanford University (1974).

  58. M. C. Pease, “Matrix inversion using parallel processing,” J. Assoc. Comput. Mach.,14, No. 4, 757–764 (1967).

    Google Scholar 

  59. M. C. Pease, “An a daptation of the fast Fourier transform for parallel processing,” J. Assoc. Comput. Mach.,15, No. 2, 252–264 (1968).

    Google Scholar 

  60. M. C. Pease, “Inversion of matrices by partitioning,” J. Assoc. Comput. Mach.,16, No. 2, 302–314 (1969).

    Google Scholar 

  61. M. C. Pease, The C (2, m) Algorithm for Matrix Inversion Stanford Research Institute, Menlo Park, California (1974).

    Google Scholar 

  62. W. G. Poole and R. G. Voigt, “Numerical algorithms for parallel and vector computers: an annotated bibliography,” Comput. Rev.,15, No. 10, 379–387 (1974).

    Google Scholar 

  63. F. Robert, “Méthodes itératives ‘série parallèle,’” C. R. Acad. Sci., Ser. A,271, No. 17, A847-A850 (1970).

    Google Scholar 

  64. J. L. Rosenfeld, “A case study in programming for parallel processors,” Commun. ACM,12, No. 12, 645–655 (1969).

    Google Scholar 

  65. J. L. Rosenfeld and G. C. Driscoll, “Solution of the Dirichlet problem on a simulated parallel processing system,” in: Proceedings of the International Federation of Information Processing Congress-68, Edinburgh, Vol. 1: Mathematics, Software, North-Holland, Amsterdam (1969), pp. 499–507.

    Google Scholar 

  66. L. Rudsinski, Programs for ADI for ILLIAC IV, Document 139, Department of Computer Science, University of Illinois, Urbana, Illinois (1967).

    Google Scholar 

  67. A. H. Sameh, “On Jacobi and Jacobi-like algorithms for a parallel computer,” Math. Comput.,25, No. 115, 579–590 (1971).

    Google Scholar 

  68. A. H. Sameh, S.-C., Chen, and D. J. Kuck, Parallel Direct Poisson and Biharmonic Solvers, Department of Computer Science, University of Illinois, Urbana, Illinois (1974).

    Google Scholar 

  69. A. H. Sameh and D. J. Kuck, Linear System Solvers for Parallel Computers, Department of Computer Science, University of Illinois, Urbana, Illinois (1975).

    Google Scholar 

  70. A. H. Sameh, F. J. Lermit, and K. Noh, “On the intermediate eigenvalues of symmetric sparse matrices,” BIT (Swede),15, No. 2, 185–191 (1975).

    Google Scholar 

  71. F. Sloboda, “Note about the parallel projection method for solution of system of linear algebraic equations,” Acta Univ. Carol. Math. Phys.,15, Nos. 1–2, 157–158 (1974).

    Google Scholar 

  72. H. S. Stone, “An efficient parallel algorithm for the solution of a tridiagonal linear system of equations,” J. Assoc. Comput. Mach.,20, No. 1, 27–38 (1973).

    Google Scholar 

  73. H. S. Stone, “Problems of parallel computation,” in: Complexity of Sequential and Parallel Numerical Algorithms, Academic Press, New York (1973), pp. 1–16.

    Google Scholar 

  74. H. S. Stone, “Parallel tridiagonal solvers,” ACM Trans. Math. Software,1, No. 4, 289–307 (1975).

    Google Scholar 

  75. P. N. Swarztrauber, “A direct method for the discrete solution of separable elliptic equations,” SIAM J. Numer. Anal.,11, No. 6, 1136–1150 (1974).

    Google Scholar 

  76. R. A. Sweet, “A generalized cyclic reduction algorithm,” SIAM J. Numer. Anal.,11, No. 3, 506–520 (1974).

    Google Scholar 

  77. J. F. Traub, “Iterative solution of tridiagonal systems on parallel or vector computers,” in: Complexity of Sequential and Parallel Numerical Algorithms, Academic Press, New York (1973), pp. 49–82.

    Google Scholar 

  78. J. F. Traub, “Parallel algorithms and parallel computational complexity,” in: Proceedings of the International Federation of Information Processing Congress-74, Stockholm, Vol. 3: Mathematical Aspects of Information Processing, North-Holland Amsterdam (1974), pp. 685–687.

    Google Scholar 

  79. R. C. Ward, “The QR-algorithm and Hyman's method on vector computers,” Math. Comput.,30, No. 133, 132–142 (1976).

    Google Scholar 

  80. O. B. Widlund, “On the use of fast methods for separable finite difference equations for the solution of general elliptic problems,” in: Sparse Matrices and Applications Plenum, New York (1972), pp. 121–131.

    Google Scholar 

Download references

Authors
  1. V. N. Faddeeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. K. Faddeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The present article is in the form of a survey. The survey, however, is incomplete, because not all recently published works on the given sphere of problems were available to the authors. On the other hand, certain papers not covered in the article have been included in the literature cited.

Translated from Kibernetika, No. 6, pp. 28–40, November–December, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faddeeva, V.N., Faddeev, D.K. Parallel computations in linear algebra. Cybern Syst Anal 13, 822–834 (1977). https://doi.org/10.1007/BF01068849

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068849

Keywords

Search

Navigation