Skip to main content
Log in

On the spectra of sums of orthogonal projections with applications to parallel computing

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while the convergence of a related sequential method is determined by the spectrum of the product of complementary projections. We study spectral properties of sums of orthogonal projections and in the case of two projections, characterize the spectrum of the sum completely in terms of the spectrum of the product.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. E. Bank and T. F. Dupont,Analysis of a two-level scheme for solving finite element equations, Tech. Report CNA-159, Center for Numerical Analysis, University of Texas at Austin, 1980.

  2. P. E. Bjørstad,Multiplicative and Additive Schwarz Methods: Convergence in the 2 domain case, inDomain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  3. D. Braess,The contraction number of a multigrid method for solving the Poisson equation, Numerische Mathematik, 37 (1981), pp. 387–404.

    Google Scholar 

  4. T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds.,Domain Decomposition Methods for Partial Differential Equations II, Philadelphia, 1989, SIAM.

    Google Scholar 

  5. C. C. Douglas and J. Mandel,The domain reduction method: High way reduction in three dimensions and convergence with inexact solvers, inMultigrid Methods, J. Mandel, S. F. McCormick, J. J. E. Dendy, C. Farhat, G. Lonsdale, S. V. Parter, J. W. Ruge, and K. Stüben, eds., Philadelphia, in print, SIAM.

  6. C. C. Douglas and W. L. Miranker,Constructive interference in parallel algorithms, SIAM J. Numer. Anal., 25 (1988), pp. 376–398.

    Google Scholar 

  7. C. C. Douglas and B. F. Smith,Using symmetries and antisymmetries to analyze a parallel multigrid algorithm: the elliptic boundary value problem case, tech. report, IBM, 1987. Submitted to SIAM J. Num. Anal.

  8. M. Dryja,An additive Schwarz algorithm for two- and three-dimensional finite element elliptic problems, inDomain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  9. M. Dryja and O. B. Widlund,An additive variant of the Schwarz alternating method for the case of many subregions, Tech. Report 339, also Ultracomputer Note 131, Department of Computer Science, Courant Institute, 1987.

  10. On the optimality of an additive iterative refinement method, inMultigrid Methods, J. Mandel, S. McCormick, J. J. E. Dendy, C. Farhat, G. Lonsdale, S. V. Parter, J. W. Ruge, and K. Stüben, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  11. id.,Some domain decomposition algorithms foe elliptic problems, Tech. Report 438; also Ultracomputer Note 155, Department of Computer Science, Courant Institute, 1989. To appear in the proceedings of the Conference on Iterative Methods for Large Linear Systems held in Austin, Texas, October 1988, to celebrate the Sixty-fifth Brithday of David M. Young, Jr., Academic Press, Orlando, Florida, 1989.

  12. R. Glowinski, G. H. Golub, G. A. Meurant, and J. Périaux, eds.,Domain Decomposition Methods for Partial Differential Equations, Philadelphia, 1988, SIAM.

    Google Scholar 

  13. G. H. Golub and C. F. Van Loan,Matrix Computations, Johns Hopkins Univ. Press, 1989. Second Edition.

  14. W. Hackbusch,A new approach to robust multi-grid solvers ICIAM '87, Philadelphia, 1988, SIAM, pp. 114–126.

    Google Scholar 

  15. P. L. Lions,On the Schwarz alternating method. I., inFirst International Symposium on Domain Decomposition Methods for Partial Differential Equations, R. Glowinski, G. H. Golub, G. A. Meurant, and J. Périaux, eds., Philadelphia, 1988, SIAM.

    Google Scholar 

  16. On the Schwarz alternating method. II., inDomain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  17. J. Mandel and S. McCormick,Iterative solution of elliptic equations with refinement: The model multi-level case, inDomain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  18. Iterative solution of elliptic equations with refinement: The two-level case, inDomain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Philadelphia, 1989, SIAM.

    Google Scholar 

  19. A. M. Matsokin and S. V. Nepomnyaschikh,A Schwarz alternating method in a subspace, Soviet Mathematics, 29 (10) (1985), pp. 78–84.

    Google Scholar 

  20. H. A. Schwarz,Gesammelte Mathematische Abhandlungen, vol. 2, Springer, Berlin, 1890, pp. 133–143. First published in Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich, volume 15, 1870, pp. 272–286.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by the Norwegian Research Council for Science and the Humanities under grant D.01.08.054 and by The Royal Norwegian Council for Scientific and Industrial Research under grant IT2.28.28484; also supported in part by the Air Force Office of Scientific Research under grant AFOSR-86-0126 and by the National Science Foundation under grant DMS-8704169.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bjørstad, P.E., Mandel, J. On the spectra of sums of orthogonal projections with applications to parallel computing. BIT 31, 76–88 (1991). https://doi.org/10.1007/BF01952785

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS(MOS) subject classifications

Keywords

Navigation