Some iterative Poisson solvers applied to numerical solution of the model fourth-order elliptic problem

Marián Vajteršic

Aplikace matematiky (1985)

  • Volume: 30, Issue: 3, page 176-186
  • ISSN: 0862-7940

Abstract

top
The numerical solution of the model fourth-order elliptic boundary value problem in two dimensions is presented. The iterative procedure in which the biharmonic operator is splitted into two Laplace operators is used. After formulating the finite-difference approximation of the procedure, a formula for the evaluation of the transformed iteration vectors is developed. The Jacobi semi-iterative, Richardson and A.D.I. iterative Poisson solvers are applied to compute one transformed iteration vector. By the efficient use of the decomposition property of the corresponding iteration matrices, the fast Fourier transform algorithm needs to be applied twice in the evaluation of one iteration vector. The asymptotic number of operations for the sequential computation is 5 n 2 l o g 2 n , where n 2 is the number of interior grid points in the unit square. The result of 7 l o g 2 n parallel steps for the parallel computation on an SIMD machine with n 2 processors is so far the best one.

How to cite

top

Vajteršic, Marián. "Some iterative Poisson solvers applied to numerical solution of the model fourth-order elliptic problem." Aplikace matematiky 30.3 (1985): 176-186. <http://eudml.org/doc/15396>.

@article{Vajteršic1985,
abstract = {The numerical solution of the model fourth-order elliptic boundary value problem in two dimensions is presented. The iterative procedure in which the biharmonic operator is splitted into two Laplace operators is used. After formulating the finite-difference approximation of the procedure, a formula for the evaluation of the transformed iteration vectors is developed. The Jacobi semi-iterative, Richardson and A.D.I. iterative Poisson solvers are applied to compute one transformed iteration vector. By the efficient use of the decomposition property of the corresponding iteration matrices, the fast Fourier transform algorithm needs to be applied twice in the evaluation of one iteration vector. The asymptotic number of operations for the sequential computation is $5n^2 log_2 n$, where $n^2$ is the number of interior grid points in the unit square. The result of$7 \ log_2 \ n$ parallel steps for the parallel computation on an SIMD machine with $n^2$ processors is so far the best one.},
author = {Vajteršic, Marián},
journal = {Aplikace matematiky},
keywords = {fourth-order; biharmonic operator; Laplace operators; Jacobi semi- iterative; Richardson; A.D.I.; fast Fourier transform; SIMD machine; fourth-order; biharmonic operator; Laplace operators; Jacobi semi- iterative; Richardson; A.D.I.; fast Fourier transform; SIMD machine},
language = {eng},
number = {3},
pages = {176-186},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Some iterative Poisson solvers applied to numerical solution of the model fourth-order elliptic problem},
url = {http://eudml.org/doc/15396},
volume = {30},
year = {1985},
}

TY - JOUR
AU - Vajteršic, Marián
TI - Some iterative Poisson solvers applied to numerical solution of the model fourth-order elliptic problem
JO - Aplikace matematiky
PY - 1985
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 30
IS - 3
SP - 176
EP - 186
AB - The numerical solution of the model fourth-order elliptic boundary value problem in two dimensions is presented. The iterative procedure in which the biharmonic operator is splitted into two Laplace operators is used. After formulating the finite-difference approximation of the procedure, a formula for the evaluation of the transformed iteration vectors is developed. The Jacobi semi-iterative, Richardson and A.D.I. iterative Poisson solvers are applied to compute one transformed iteration vector. By the efficient use of the decomposition property of the corresponding iteration matrices, the fast Fourier transform algorithm needs to be applied twice in the evaluation of one iteration vector. The asymptotic number of operations for the sequential computation is $5n^2 log_2 n$, where $n^2$ is the number of interior grid points in the unit square. The result of$7 \ log_2 \ n$ parallel steps for the parallel computation on an SIMD machine with $n^2$ processors is so far the best one.
LA - eng
KW - fourth-order; biharmonic operator; Laplace operators; Jacobi semi- iterative; Richardson; A.D.I.; fast Fourier transform; SIMD machine; fourth-order; biharmonic operator; Laplace operators; Jacobi semi- iterative; Richardson; A.D.I.; fast Fourier transform; SIMD machine
UR - http://eudml.org/doc/15396
ER -

References

top
  1. B. L. Buzbee G. H. Golub C. W. Nielson, 10.1137/0707049, SIAM J. Num. Analys., Vol. 7 (1970), 627-656. (1970) Zbl0217.52902MR0287717DOI10.1137/0707049
  2. B. L. Buzbee F. W. Dorr, Ths direct solution of the biharmonic equation on rectangular regions and the Poisson equation on irregular regions, SIAM J. Num. Analys., Vol. 11 (1974)753-762. (1974) Zbl0294.65059MR0362944
  3. F. W. Dorr, 10.1137/1012045, SIAM Rev., Vol. 12 (1970), 248-263. (1970) Zbl0208.42403MR0266447DOI10.1137/1012045
  4. L. W. Ehrlich, 10.1137/0708029, SIAM J. Num. Analys., Vol. 8 (1971), 278-287. (1971) Zbl0215.55702MR0288972DOI10.1137/0708029
  5. L. W. Ehrlich, 10.1145/355611.362550, Comm. ACM, Vol. 16 (1973), 711-714. (1973) Zbl0269.65054DOI10.1145/355611.362550
  6. R. Glowinski O. Pironneau, 10.1137/1021028, SIAM Rev., Vol. 21 (1979), 167-212. (1979) Zbl0427.65073MR0524511DOI10.1137/1021028
  7. D. Greenspan D. Schultz, 10.1145/355602.361313, Comm. ACM, Vol. 15 (1972), 347-350. (1972) Zbl0234.65087MR0314277DOI10.1145/355602.361313
  8. D. Greenspan D. Schultz, Simplification and improvement of a numerical method for Navier-Stokes problems, Proc. 15. Differential equations Keszthely (1975) 201 - 222. (1975) Zbl0363.76017MR0502088
  9. M. M. Gupta, 10.1137/0712029, SIAM J. Num. Analys., Vol. 12. (1975), 364- 377. (1975) Zbl0272.65094MR0403256DOI10.1137/0712029
  10. R. W. Hockney, The potential calculation and some applications, Methods in computational physics 9 (1970), 135-211. (1970) 
  11. A. H. Sameh S. C. Chen D. J. Kuck, Parallel Poisson and biharmonic solvers, Computing, Vol. 17(1976), 219-230. (1976) Zbl0342.65070MR0438737
  12. M. Vajteršic, 10.1007/BF02252095, Computing, Vol. 23 (1979), 171-178. (1979) Zbl0406.65046MR0619928DOI10.1007/BF02252095
  13. M. Vajteršic, A fast parallel solving the biharmonic boundary value problem on a rectangle, Proc. of 1st European Conference on Parallel and Distributed Processing, Toulouse 1979, 136-141. (1979) Zbl0406.65046
  14. R. S. Varga, Matrix Iterative Analysis, Prentice-Hall, New York 1962. (1962) MR0158502
  15. D. M. Young, Iterative Solution of Large Linear Systems, Academic Press, New York 1971. (1971) Zbl0231.65034MR0305568

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.