Skip to main content
Log in

A fast Poisson solver

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Summary

A direct method is developed for the discrete solution of Poisson's equation on a rectangle. The algorithm proposed is of the class of marching methods. The idea is to generalize the classical Cramer's method using Chebyshev matrix polynomials formalism. This results in the solution ofN independent diagonal system of linear equations in the eigenvector coordinate system. An elementary transformation to the original coordinate system is then carried out.

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.

Similar content being viewed by others

References

  1. F. Dorr, The direct solution of the discrete Poisson's equation on a rectangle,SIAM Rev.,12 (1970), 248–263.

    Google Scholar 

  2. R. Singleton, An algorithm for computing the mixed matrix fast fourrier transform,IEEE Trans. Audio and electroacoustics,17 (1969), 93–103.

    Google Scholar 

  3. P. Swarztrauber, A direct method for the discrete solution of separable elliptic equations,SIAM J, Numer. Anal.,11 (1974).

  4. R. Sweet, Direct methods for the solution of Poisson's equation on a staggered grid,J. Computational Phys.,12 (1973), 422–428.

    Google Scholar 

  5. B. Buzbee, G. Golub andC. Nielson, On direct methods for solving Poisson's equation,SIAM Numer. Anal.,7 (1970), 627–656.

    Google Scholar 

  6. O. Buneman, A compact non-iterative Poisson solver,Rep.294.Stanford University Institute for Plasma Research, Stanford, Calif., 1969.

  7. R. Sweet, A generalized cyclic reduction algorithm,SIAM Journal Numer. Anal.,11 (1974), No 3, 506–520.

    Google Scholar 

  8. P. Swarztrauber andR. Sweet, The direct solution of the discrete Poisson's equation on a disk,SIAM Journal Numer. Anal.,10 (1973), No. 5, 900–907.

    Google Scholar 

  9. A. Shieh, Fast Poisson Solvers on general two dimensional region for the Dirichlet problem,Numer. Math. 31 (1979), 405–429.

    Google Scholar 

  10. R. Bank, Marching algorithms for elliptic, boundary value problems,Ph. D. Thesis Harvard University, 1975.

  11. R. Bank andJ. Rose, AnO(n2) method for solving constant coefficient boundary value problems in two dimensions,SIAM J. Numer. Anal. 12 (1975), 529–540.

    Google Scholar 

  12. B. Buzbee andF. Dorr, The direct solution of the Biharmonic equation on a rectangular regions and the Poisson equation on irregular regions.SIAM Jour. Num. Anal. 11 (1974), 753–763.

    Google Scholar 

  13. P. Swarztrauber andR. Sweet, Algorithm 541-Efficient Fortran subprograms for the solution of separable elliptic partial differential equations,ACM. Trans. on math. Soft. Vol.5 (1979), 352–364.

    Google Scholar 

  14. R. Boisvert andR. Sweet, in: Science and development of mathematical software.

  15. R. Sweet, A cyclic reduction algorithm for solving block tridiagonal system of arbitrary dimension,SIAM Journal of Numer. Anal., vol.14 (1977), No. 4, 706–720.

    Google Scholar 

  16. C. Temperton, Direct methods for the solution of the discrete Poisson equation; some comparisons,J. Comp. Physics, V.31 (1979), 1–20.

    Google Scholar 

  17. Heller, Some aspects of the cyclic reduction algorithm for block-tridiagonal linear systems,SIAM J. of Numer. Anal. V.13 No. 4 (1976), 484–456.

    Google Scholar 

  18. R. W. Hockney, A for direct solution of Poisson's equation using Fourier analysis,J. ACM V.12 No. 1 (1965), 95–113.

    Google Scholar 

  19. R. W. Hockney, The potential calculation and some applications.

  20. J. W. Cooley andJ. W. Tukey, An algorithm for the machine calculation of complex Fourier series,Math. Comp. V.19 (1965), 297–301.

    Google Scholar 

  21. G. Golub, Direct methods for solving elliptic difference equations,Lectures notes in the theory of numerical analysis, Lectures notes in maths V.193, 1–18. Springer, (1971).

  22. A. H. Sameh, S. C. Chen andD. J. Kuck, Parallel Poisson and Biharmonic solver,Computing 17 (1976), 219–230.

    Google Scholar 

  23. J. R. Rice andR. F. Boisvert,Solving Elliptic Problems Using-ELLPACK, Springer Verlag, 1984.

  24. M. Schultz,Elliptic Problem Solvers, Academic Press, 1984.

  25. Eisenstat, Yale sparse matrix package,International Journal for Numerical Methods in Engineering, Vol.18 (1982), 1145–1151.

    Google Scholar 

  26. I. Duff andJ. K. Reid, Ma-27-A set of Fortran subroutines for solving sparse symmetric sets of linear euqations,AERE Harwell report R. 10533.

  27. A. A. Samarski andN. N. Nikolaev,Résolution Numérique des Equations de Maille, Moscou, Nauka, 1978.

    Google Scholar 

  28. V. N. Voivodine, Methodes de Résolution Numérique des Problèmes de l'algèbre linéaire,Nauka, Moscou, 1976.

    Google Scholar 

  29. G. H. Golub, D. M. Meurant,Résolution Numérique des Grands Systèmes Linéaires, Eyrolles, 1983.

  30. L. Hageman andD. M. Young,Applied Iterative Methods, 1981.

  31. D. M. Young,Iterative Solution of Large Linear Systems, Academic Press, N.Y., 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Onana, A., Kwankam, S.Y. & Zoue, E. A fast Poisson solver. Period Math Hung 28, 89–101 (1994). https://doi.org/10.1007/BF01876899

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation