Abstract
A tridiagonal matrix for ADI method can be solved by Gaussian elimination with iterations of three substitutions, two of which need to be carefully parallelized in order to achieve high performance. We propose a parallel scheme for these substitutions (first-order recurrence equations) with scalability to the problem size and our experiment shows that it achieves \(\frac{P}{2.1}\) speedup with P processors.
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
Press, W.: Numerical Recipes in C, Cambridge, UK (1988)
Hockney, R.: Parallel Computer 2, Adam Hilger (1988)
Kadota, H., et al.: Parallel Computer ADENART-its Architecture and Application. In: Proc. of Int’l Conf. on Supercomputing (1991)
Kumar, B., et al.: A Parallel MIMD Cell Partitioned ADI Solver for Parabolic PDEs on VPP700. RIKEN Review 30 (2000)
Fox, G.: Spatial Differencing and ADI Solution of the NAS Benchmarks (1996), http://www.npac.syr.edu/users/gcf/cps713nasii96
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wakatani, A. (2003). A Parallel Scheme for Solving a Tridiagonal Matrix with Pre-propagation. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive