Thumbnail
Access Restriction
Subscribed

Author Juncosa, M. L. ♦ Mullikin, T. W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1960
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1960-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 7
Issue Number 1
Page Count 8
Starting Page 29
Ending Page 36


Open content in new tab

   Open content in new tab
Source: ACM Digital Library