Abstract
Since most partial differential equations (PDEs) do not have exact solutions, they are usually solved by some type of numerical method. Since a numerical method is commonly built from finite difference approximations derived from Taylor series expansions, such a development is derived. Stability and convergence of these methods is defined and the rate of convergence is defined and shown for a few simple methods. Of particular importance is the difference between implicit and explicit methods. Finally, the current applications and adaptations of implicit methods on parallel processors are examined and their strengths and weaknesses discussed.
Recommended Citation
Reeves, Larry, "Implicit Methods on Parallel Processors" (1993). Computer Science Technical Reports. 40.
https://scholarsmine.mst.edu/comsci_techreports/40
Department(s)
Computer Science
Report Number
CSC-93-18
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1993 University of Missouri--Rolla, All rights reserved.
Publication Date
03 Aug 1993
