Abstract
Quadarant diagonal partitioning (QDP) method is an iterative method for solving linear system proposed by D. J. Evans et al. (see [1],[2],[3]) appropriate for paralell implementation. Here we show that in case of second order elliptic problem, the classical, color and multicolor ordering technique [4] are applicable for further paralellization of QDP iterative methods. Moreover we give a direct algorithm with arithmetical complexity O(n) for solving a special quadrant tridiagonal matrix and using these results we propose a quadrant tridiagonal preconditioned (QTP) conjugate gradient method for solving second order elliptic problems. The numerical experiments presented here shows that this method in several cases are more effective than other PCG algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Evans, D. J., Hadjidimos, A. and Noutsos, D., The parallel solution of banded linear equations by the new quadrant interlocking factorization (I.Q.F) method. International Journal of Computational Mathematics, 9. (1981).
Evans, D. J., Parallel numerical algorithm for linear systems. In Parallel Processing Systems (ed D. Evans) Cambridge University Press, (1982).
Evans, D. J., Parallel S.O.R. iterative methods. Parallel Computing, 1(1), (1984).
O’Leary, D., Ordering schemes for parallel processing of certain mesh problems. SIAM J. Sci. Stat. Comp. 5, pp. 620–632.
Hackbusch, W., On the multigrid method applied to difference equations. Computing 20. pp. 291–306, (1978).
Iain S. Duff, Gerard A. Meurant, The effect of ordering on preconditioned conjugate gradient. BIT 29. pp. 635–657, (1989).
Axelsson, O., A survey of preconditioned iterative methods for linear system of algebraic equations. BIT, pp. 166–187, (1985).
Axelsson, O., Vasilevski, P.S., A survey of multilevel preconditioned iterative methods. BIT 29, pp. 69–93, (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden
About this chapter
Cite this chapter
Molnárka, G., Szabó, S. (1993). Quadrant Tridiagonal Partitioning and Preconditioned Conjugate Gradient Method for Solving Elliptic Problems. In: Hackbusch, W., Wittum, G. (eds) Incomplete Decomposition (ILU) — Algorithms, Theory, and Applications. Notes on Numerical Fluid Mechanics (NNFM), vol 29. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-85732-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-322-85732-3_10
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-07641-2
Online ISBN: 978-3-322-85732-3
eBook Packages: Springer Book Archive