| On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations |
| Full text |
Pdf
(402 KB)
|
| Source
|
Journal of the ACM (JACM)
archive
Volume 7 , Issue 1 (January 1960)
table of contents
Pages: 29 - 36
Year of Publication: 1960
ISSN:0004-5411
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 4
|
|
|
ABSTRACT
Occasionally in the numerical solution of elliptic partial differential equations the rate of convergence of relaxation methods to the solution is adversely affected by the relative proximity of certain points in the grid. It has been proposed that the removal of the unknown functional values at these points by Gaussian elimination may accelerate the convergence.
By application of the Perron-Frobenius theory of non-negative matrices it is shown that the rates of convergence of the Jacobi-Richardson and Gauss-Seidel iterations are not decreased and could be increased by this elimination. Although this may indicate that the elimination could improve the convergence rate for overrelaxation, it is still strictly an unsolved problem.
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
|
DAVID You~, Iterative methods for solving partml difference equations of elliptic type, Trans. Amer. Math. Soc. 76 (1954), 92-111
|
| |
2
|
S FRANKEL, Convergence rates of iterative treatments of partial differential equations, Math Tables Aids Comp. 4 (1950), 65-75.
|
| |
3
|
HERBERT B. KELLER, On some iterative methods for solving elliptic difference equations, Quart. Appl. Math. 16 (1958), 209-226
|
| |
4
|
M L. JUNCOSA AND D. M. YOUNG, SPADE, A set of subroutines for solving elliptic and parabolic partial differential equations, RAND Corporation Paper P-1709, May 21, 1959 To appear in Proceedings of International Conference on Information Processing, Paris, June 1959.
|
| |
5
|
W. KAHAN, Gauss-Seidel methods of solving large systems of linear equations, Thesis, University of Toronto, 1958.
|
| |
6
|
G FROBENIUS, Uber Matmzen aus nicht negativen Elementen, Sitzungber der Preuss. Akad. Wiss Berlis (1912), pp 456-477
|
| |
7
|
F R. GANTMAKHER, Theory of Matrices (translation), Interscmnce, New York, 1959
|
| |
8
|
H WIELANDT, Unzerlegbare, mcht negative Matrizen, Math Zeitschr. 5~ (June 1949- June 1950), 642-648
|
| |
9
|
E BODEWlG, Matrix Calculus, North-Holland Publishing Company, Amsterdam 1956. Section 6 6.
|
| |
10
|
P. STEIN AND R L. ROSENBERG, On the solution ot simul|aneous equat)ons by iteration, J. Lond Math Soc 23, (1948), 111-118
|
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
|