|
ABSTRACT
Tridiagonal linear systems of equations can be solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computation on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BUNEMAN, OSCAR A compact non-iterat~ve Poisson solver. Rep. 294, Inst. for Plasma Res., Stanford U., Stanford, Calif., 1969.
|
| |
2
|
BUZBEE, B. L, GOLUB, G. H, AND NIELSON, C.W. On direct methods for solving Poisson's equations. SIAM J. Numer. Anal 7, 4 (Dec. 1970), 627-656.
|
| |
3
|
EULER, LEONHARD. Introduct~o ~n Analys~n infin~torum, Lausanne, 1748, Sec. 359.
|
| |
4
|
FORSYTHE, G. E., AND MOLEa, C. B. Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs, N. J., 1967.
|
| |
5
|
GAUTSCm, WALTER. Computational aspects of three-term recurrence relations, SIAM Rev. 9, 1, (Jan. 1967), 24-82.
|
| |
6
|
ISAACSON, E., AND KELLER, H.B. Analysis of Numerwal Methods. Wiley, New York, 1966.
|
| |
7
|
KNUTH, D. E. Mathematical analysm of algorithms. Rep. Stan-CS-71-206, Computer Sci. Dep., Stanford U., Stanford, Calif., Mar. 1971.
|
| |
8
|
PERRON, O. D~e Lehre yon den Kettenbruchen. Leipzig, 1913.
|
| |
9
|
SYLVEST~R, J.J. Philosophical Magazine 6, (1853), 297-299.
|
| |
10
|
WALL, H.S. Analytic Theory of Continued Fractions. Van Nostrand, New York, 1948.
|
CITED BY 40
|
|
Y. Tanaka , K. Iwasawa , S. Gotoo , Y. Umetani, Compiling techniques for first-order liner recurrences on a Vector computer, Proceedings of the 1988 ACM/IEEE conference on Supercomputing, p.174-181, November 12-17, 1988, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Josep-L. Larriba-Pey , Juan J. Navarro , Oriol Roig , Angel Jorba, A generalized vision of some parallel bidiagonal systems solvers, Proceedings of the 8th international conference on Supercomputing, p.404-411, July 11-15, 1994, Manchester, England
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|