Parallel implementation of fast elliptic solver

Parallel Computing

Volumn 23, Issue 8, 1997, Pages 1113-1128

  Petrova, Svetozara ^a,b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

Author keywords

Eigenpairs; Elliptic equations; Parallel computing; Problems with sparse right hand side; Separation of variables

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FINITE DIFFERENCE METHOD; PARALLEL PROCESSING SYSTEMS; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING;

ELLIPTIC EQUATIONS; FAST ALGORITHM FOR SEPARATION OF VARIABLES (FASV); ODD EVEN BLOCK ELIMINATION TECHNIQUE;

PARALLEL ALGORITHMS;

EID: 0031207486     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)00046-x     Document Type: Article

References (20)

1. O. Axelsson, P. Vassilevski, Solution of Equations R″ (Part II) Iterative Solution of Linear Systems, in: P. Ciarlet, J. Lions (Eds.), Handbook on Numerical Methods, North Holland, 1996, to appear.
2. A. Banegas, Fast Poisson solvers for problems with sparsity, Math. Comp. 32 (1978) 441-446.
3. J. Bramble, R. Ewing, J. Pasciak, A. Schatz, A preconditioning technique for the efficient solution of problems with local grid refinement, Comput. Meth. Appl. Mech. Eng. 67 (1988) 149-159.
4. O. Buneman, A compact non-iterative Poisson solver, Rep. 294, Stanford University Institute for Plasma Research, Stanford, California, 1969.
5. R. Ewing, R. Lazarov, P. Vassilevski, Local refinement techniques for elliptic problems on cell-centered grids; II. Optimal order two-grid iterative methods, Numer. Lin. Alg. Appl. 1 (1993) 1-7.
6. D. Heller, Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems, SIAM J. Numer. Anal. 13 (4) (1976) 484-496.
7. R. Hockney, The potential calculation and some applications, Meth. Comp. Physics, Academic Press, New York, 1969, pp. 136-212.
8. Y. Kuznetsov, Block relaxation methods in subspaces, their optimization and application, Sov. J. Numer. Anal. Math. Model. 4 (1989) 433-452.
9. S. McCormick, J. Thomas, The fast adaptive composite grid (FAC) method for elliptic equations, Math. Comp. 46 (1986) 439-456.
10. W. Proskurowski, Numerical solution of Helmholtz equation by implicit capacitance matrix method, ACM Trans. Math. Software 5 (1979) 36-49.
11. Y. Saad, M. Schultz, Data communication in parallel architectures, Parallel Comput. 11 (1989) 131-150.
12. P. Swarztrauber, A direct method for the discrete solution of separable elliptic equations, SIAM J. Numer. Anal 11 (1974) 1136-1150.
13. P. Swarztrauber, The method of cyclic reduction, Fourier analysis and the FACR algorithm for the discrete solution of Poisson equation on a rectangle, SIAM Rev. 19 (1977) 490-501.
14. R. Sweet, A generalized cyclic reduction algorithm, SIAM J. Numer. Anal 11 (1974) 506-520.
15. R. Sweet, A cyclic reduction algorithm for solving block tridiagonal systems of arbitrary dimensions, SIAM J. Numer. Anal 14 (1977) 706-720.
16. P. Vassilevski, Fast algorithm for solving a linear algebraic problem with separation of variables, C. R. Acad. Bulg. Sci. 37 (3) (1984) 305-308.
17. P. Vassilevski, Fast algorithm for solving discrete Poisson equation in a rectangle, C. R. Acad. Bul. Sci. 38 (10) (1985) 1311-1314.
18. P. Vassilevski, S. Petrova, A note on construction of preconditioners in solving 3D elliptic problems by substructuring, C. R. Acad. Bulg. Sci. 41 (7) (1988) 33-36.
19. P. Vassilevski, S. Petrova, R. Lazarov, Finite difference schemes on triangular cell-centered grids with local refinement, SIAM J. Sci. Stat. Comp. 13 (1992) 1287-1313.
20. J. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.