Return to search

Stone’s original and symmetric factorization procedure : contrasts and comparisons

The numerical solution of elliptic boundary value problems on rectangular regions with Dirichlet boundary conditions is considered. The well-known finite difference scheme is used to discretize the continuous problem. The solution is now expressed as the unknown vector in a high order matrix equation. In general, efficient direct methods for obtaining the solution of the matrix equation are not known. There are several well-known iteration schemes commonly used to solve such problems. The main disadvantage of these methods is that the number of computations which are required to solve the matrix equation increases in a nonlinear
way with the number of equations to be solved. Stone's original and symmetric strongly implicit factorization procedure are considered. The known results concerning the convergence properties of each iteration are presented. A new result concerning the symmetric factorization is presented and the results of numerical investigations are presented. / Science, Faculty of / Mathematics, Department of / Graduate

Identiferoai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/18809
Date January 1974
CreatorsKusiak, Robert A.
Source SetsUniversity of British Columbia
LanguageEnglish
Detected LanguageEnglish
TypeText, Thesis/Dissertation
RightsFor non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.

Page generated in 0.0017 seconds