Skip to main content
SpringerLink
Log in

Parallel algorithms for solving certain elliptic boundary value problems

  • Chapter
Algorithms for Elliptic Problems

Part of the book series: Mathematics and Its Applications (East European Series) ((MAEE,volume 58))

  • 230 Accesses

Abstract

The results given so far, concerning the acceleration of computation processes involved in solving elliptic partial differential equations, were achieved by designing fast algorithms for serial computers. Applying parallel processing methods is another effective and yet very natural way of accelerating the computation. Multiplying the processors in a parallel computer system makes it possible to design new schemes for the organization of computation. Here the main advantage, compared with the classical serial processing model, is that operations of the computational process can be performed simultaneously on different processor units. Another advantage is the improved reliability, because a failure in one or several processors does not necessarily result in breaking the computation. Parallel computers often enable their configuration to be adapted to suit best the character of the problem to be solved. Modern trends in microelectronics also find their application in the domain of parallel processing; the latest hardware components developed on the basis of VLSI (Very Large Scale Integration) and WSI (Wafer Scale Integration) technologies are advantageously used in parallel computers. Recent examples are the massively parallel computer systems Connection Machine and MasPar with thousands of processors based on VLSI technology.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S. G.: The Design and Analysis of Parallel Algorithms, Prentice-Hall, Englewood Cliffs, N.J., 1989.

    MATH  Google Scholar 

  2. Almasi, G. S. and Gottlieb, A.: Highly Parallel Computing, The Benjamin/Cummings Publ. Co., Redwood City, 1989.

    Google Scholar 

  3. Bank, R. E. and Rose, D.1.: ‘Marching algorithms for elliptic boundary value problems, I: The constant coefficient case’, Sf-i.1’I J. lVumer.final. 14 (1977) 792–829.

    MathSciNet  MATH  Google Scholar 

  4. Bank, R. E. and Rose, D.1.: ‘An 0(a2) method for solving constant coefficient boundary value problems in two dimensions’. 51:1!11 J. Turner.final. 12 (1975) 529–540.

    MathSciNet  MATH  Google Scholar 

  5. Bank, R. E.: ‘Marching algorithms for elliptic boundary value problems, II: The variable coefficient case’, SIAM.1. Naracr. Anal. 14 (1977) 950–970.

    Article  MathSciNet  MATH  Google Scholar 

  6. Bertsekas, D. P. and Tsitsiklis, J. N.: Parallel and Distributed Computation, Prentice-Hall, Englewood Cliffs, N.J., 1989.

    MATH  Google Scholar 

  7. Bjorstad, P. and Widlund, O. B.: `Iterative methods for the solution of elliptic problems on regions partitioned into substructures’, SIAM J. Numer. Anal. 23 (1986) 1097–11211.

    Article  MathSciNet  Google Scholar 

  8. Buzbee, B. L.: ‘A fast Poisson solver amenable to parallel computation’, IEEE Trans. Comp. C-27 (1978) 793–796.

    Google Scholar 

  9. Buzbee, B. L., Golub, G. H. and Nielson, C. W.: `On direct methods for solving Poisson’s equation’, 51.4 Ai J. Numer. Anal. 7 (1970) 627–659.

    MathSciNet  MATH  Google Scholar 

  10. Buzbee, B., Golub, G. and Howell, J.: `Vectorization for the Cray-1 of some methods for solving elliptic difference equations’, in D. Kuck, D. Lawrie and A. Sameh (eds), High Speed Computer and Algorithm Organization, Academic Press, New York, 1977, pp. 255–271.

    Google Scholar 

  11. Chan, T. F., Resasco, D. C. and Saied, F.: `Implementation of domain decomposed fast Poisson solvers on multiprocessors’, Tech. Rep. Y.4LE/DCS/RR-456, Yale University, New Haven, 1986.

    Google Scholar 

  12. Chen, S. C. and Kuck, D. J.: `Time and parallel processor bounds for linear recurrence systems’, IEEE Trans. Comp. C-24 (1975) 701–717.

    Google Scholar 

  13. Ehrlich, L. W.: `Solving the biharmonic equation as coupled finite difference equations’, SL4M J. Numer. Anal. 8 (1971) 278–287.

    Article  MathSciNet  Google Scholar 

  14. El-Giar, O. and Hopkins, T.: ‘The parallel solution of linear elliptic equations using hopscotch algorithms’, Tech. Rep. No. 62, UKC Computing Laboratory, Univ. Kent, Canterbury, 1989.

    Google Scholar 

  15. Ericksen, J.: `Iterative and direct methods for solving the Poisson equation and their adaptability to Illiac IV’, CAC Doc. 60, Univ. Illinois, Urbana, 1972.

    Google Scholar 

  16. Evans, D. J. and Yonsif, W. S.: ‘Explicit block iterative method for the solution of the biharmonic equation’ (submitted to Numerical Methods for Partial Differential Equations).

    Google Scholar 

  17. Flynn, M.: `Some computer organizations and their effectiveness’, IEEE Trans. Comp. C-21 (1972) 948–960.

    Google Scholar 

  18. Gallopoulos, E. and Saad, Y.: ‘A parallel block cyclic reduction algorithm for the fast solution of elliptic equations’, in Supercomputing, Lecture Notes in Computer Science 297, Springer-Verlag, Berlin, 1987, pp. 563–575.

    Google Scholar 

  19. Gordon, P.: `Nonsymmetric difference schemes’.51.1 Al J. Appl. Math. 13 (1965) 667–673.

    MATH  Google Scholar 

  20. Gourlay, A. R.: `Hopscotch: a fast second-order partial differential equation solver’, J. Inst. Math. Appl. 6 (1970) 375–390.

    Article  MathSciNet  MATH  Google Scholar 

  21. Grosch, C. E.: `Performance analysis of Poisson solvers on array computers’, Tech. Rep. 79–3, Old Dominion Univ., Norfolk, 1979.

    Google Scholar 

  22. Heller, D. E., Stevenson, D. K. and Traub, J. F.: `Accelerated iterative methods for the solution of tridiagonal systems on parallel computers’, J.4 CM 23 (1976) 636–654.

    MathSciNet  MATH  Google Scholar 

  23. Hockney, R. W.: `Rapid elliptic solvers’, in Numerical Methods in Applied Fluid Dynamics, Academic Press, New York, 1980, pp. 1–48.

    Google Scholar 

  24. Hockney, R. W. and Jesshope, C. R_: Parallel Computers —.Architecture, Programming arid Algorithms, Adani Hilger, Bristol, 1981.

    Google Scholar 

  25. Hunt, D. J.: `Numerical solution of Poisson’s equation on an array processor using iterative techniques’, DAP Tech. Rep. I, DAP Unit., London, 1981.

    Google Scholar 

  26. Hwang, K. and Briggs, F. A.: Computer Architecture and Parallel Processing, McGraw-Hill, New York, 1984.

    MATH  Google Scholar 

  27. Kershaw, D.: `The solution of single linear tridiagonal systems and vectorization of the ICCG algorithm on the Cray-1’, Res. Rep. UCID-19085, Lawrence Livermore Laboratory, Livermore, Calif., 1981.

    Book  Google Scholar 

  28. Kuck, D. J., Lawrie, D. H. and Sameh, A. H. (eds): High Speed Computer and Algorithm Organization, Academic Press, New York, 1977.

    Google Scholar 

  29. Lichnewsky, A.: ‘Solving some linear systems arising in finite element methods on parallel processors’, SIAM Natl. Meeting, Stanford Univ., Stanford, Calif., 1982.

    Google Scholar 

  30. Meurant, G.:.’Domain decomposition preconditioners for the conjugate gradient methods’, C’alcolo 25 (1988) 103–119.

    Article  MathSciNet  MATH  Google Scholar 

  31. Mikloko, J. and Kotov, V. (eds): algorithms, Software and Hardware of Parallel Computers, Springer-Verlag, Berlin, 1981.

    Google Scholar 

  32. Miklosko, J., Klette, R., Vajtersic, M. and Vrt’o, I.: Fast Algorithms and their Implementation 00 Specialized Parallel Computers, North-Holland, Amsterdam; Veda, Bratislava, 1989.

    Google Scholar 

  33. Miranker, \V. L. ‘A survey parallelism in numerical analysis’, SIAM Rev. 13 (1971) 524–547.

    MathSciNet  MATH  Google Scholar 

  34. Liura, K.: ‘The block-iterative method for Illiac IV’, CAC Doc. 41, Univ. Illinois, Urbana, 1971.

    Google Scholar 

  35. Quinn, M. J.: Design i Ty Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, 1987.

    Google Scholar 

  36. Saad, Y. and Sameh, A.: ‘Iterative methods for the solution of elliptic difference equations on multiprocessors’, in Proc. CONI’AR ’81, Lecture Notes in Computer Science 111, Springer-Verlag, Berlin, 1981, pp. 395–413.

    Chapter  Google Scholar 

  37. Samarskii, A. A.: 7’heory of Difference Schemes (in Russian), Nauka, Moscow, 1987.

    Google Scholar 

  38. Sameh, A.: ‘An overview of parallel algorithms in numerical linear algebra’, EDF, Bulletin de la Direction des Etudes et des Recherches C-1 (1983) 129–134.

    Google Scholar 

  39. Sameh, A.: ‘A fast Poisson solver for multiprocessors’, in Elliptic Problem Solvers II, Academic Press, New York, 1984, pp. 175–186.

    Google Scholar 

  40. Sameh, A. 11., Chen, S. C. and Kuck, D. J.: ‘Parallel Poisson and biharmonic solvers’, Computing 17 (1976) 219–2311.

    Article  MathSciNet  MATH  Google Scholar 

  41. Schendel, U.: Einfiihrunq in die l’arallc(c Vumerik, lt. Oldenburg-Verlag, Munchen, Wien, 1981.

    Google Scholar 

  42. Serafino di, D.,.Marli, A. and Perla, F.: ‘A fast Poisson solver for distributed memory multiprocessors’ (submitted for publications).

    Google Scholar 

  43. Serafino di, 1). and Perla, 1-’.: ‘Past Poisson solvers: Generalized marching and block cyclic reduction on a shared memory ory multiprocessor’, in D. Laforenza and R. Perego (eds), Supercomputiny Tools for.Science and Engineering (in Italian), Franco Angeli, Milan, 1990, pp.:341–347.

    Google Scholar 

  44. Traub, J. F. (ed.): Algorithms and Complexity, Academic Press, New York, London, 1976.

    MATH  Google Scholar 

  45. Vijclavík, P.: ‘Fast parallel algorithm for solving special tridiagonal system of linear equations’ (in Slovak), in Proc. 7111 Symmp. _SCS,Bratislava, 1976, pp. 205214.

    Google Scholar 

  46. Vajteric, M.: ‘A fast algorithm for solving the first. biharmonic boundary value problem’, Computing 23 (1979) 171–178.

    Article  MathSciNet  Google Scholar 

  47. Vajteric, M.: ‘A fast parallel solving the biharmonic boundary value problem on a rectangle’, in Proc. 1st European Conf. Parallel and Distributed Processing, Toulouse (France), 1979. pp. 136–1. 11.

    Google Scholar 

  48. Vajtersic, M.: ‘Fast parallel biharmonic semidirect solvers’, in Proc. 1979 Int. Conf. on Parallel Processing, Shanty Creek, Mich., 1979, p. 135.

    Google Scholar 

  49. Vajtersic, M.: ‘Parallel Poisson and biharmonic solvers implemented on the EGPA multiprocessor’, in Proc. 1982 Int. Conf. on Parallel Processing, Bellaire, Mich., 1982, pp. 72–81.

    Google Scholar 

  50. Vajter’sic, M.: `An improved application of the second Buneman’s variant for parallel computing the semidirect process’, in J. Miklosko and V. Kotov (eds), Algorithms, Software and Hardware of Parallel Computers, Springer-Verlag, Berlin, 1984, pp. 35–44.

    Google Scholar 

  51. Vajtersic, M.: `Fast algorithms for solving some elliptic partial differential equations’, CSc. Thesis, Faculty of Mathematics and Physics, Comenius University, Bratislava, 1983.

    Google Scholar 

  52. Vajtersic, M.: `Parallel marching Poisson solvers’, Parallel Computing 1 (1984) 325–330.

    Article  Google Scholar 

  53. Vajtersic, M.: `An elimination approach for fast parallel solution of the model fourth-order elliptic problem’, Comp. Phys. Comm. 26 (1982) 357–361.

    Article  Google Scholar 

  54. Vajtersic, M.: `Solving two modified discrete Poisson equations in 7 log n steps on n2 processors’, in Proc. CONPAR ‘81, Lecture Notes in Computer Science 111, Springer-Verlag, Berlin, 1981, pp. 423–432.

    Chapter  Google Scholar 

  55. Vorst, H. van der: `A vectorizable variant of some ICCG methods’, SIAM J. Sci. Comp. 3, 1982, 350–356.

    Article  MATH  Google Scholar 

  56. Wallach, Y.: Alternating Parallel-Sequential Processing, Lecture Notes in Computer Science 127, Springer-Verlag, Berlin, 1982.

    Google Scholar 

  57. Zima, H. J. and Chapman, B.: Supercompilers for Parallel and Vector Computers, Addison-Wesley, New York, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control Theory and Robotics, Slovak Academy of Sciences, Bratislava, Czechoslovakia

    Marián Vajteršic

Authors
  1. Marián Vajteršic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Marián Vajteršic

About this chapter

Cite this chapter

Vajteršic, M. (1993). Parallel algorithms for solving certain elliptic boundary value problems. In: Algorithms for Elliptic Problems. Mathematics and Its Applications (East European Series), vol 58. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0701-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0701-5_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4190-6

  • Online ISBN: 978-94-017-0701-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation