Show simple item record

Higher order discretization of elliptic partial differential equations

dc.contributor.advisorWalton, D. J.
dc.contributor.authorPathan, Golam Mosthafa
dc.date.accessioned2017-06-06T13:08:42Z
dc.date.available2017-06-06T13:08:42Z
dc.date.created1979
dc.date.issued1979
dc.identifier.urihttp://knowledgecommons.lakeheadu.ca/handle/2453/2255
dc.description.abstractHigher order finite difference methods are discussed with respect to speed and accuracy when used in the solution of elliptic partial differential equations. Although fast direct methods for solving elliptic partial differential equations are currently often discussed in the literature, the methods usually lean towards using the conventional five-point differencing on a uniform rectangular mesh which gives rise to block tridiagonal and tridiagonal matrices of Toeplitz form. For the solution of large linear systems which result from the use of a finite difference formula involving more mesh-points, the matrix equation XA + AY = F is used instead of the usual composite matrix approach. Although the matrices involved become less sparse, the operation count remains 0(n[superscript 3] ) when using an n x n mesh. However, for a comparable accuracy, n is much smaller for a higher order finite difference formula than that required for a standard five-point formula.
dc.language.isoen_US
dc.subjectDifferential equations, Partial
dc.subjectDifferential equations, Elliptic
dc.titleHigher order discretization of elliptic partial differential equations
dc.typeThesis
etd.degree.nameMaster of Science
etd.degree.levelMaster
etd.degree.disciplineMathematical Sciences
etd.degree.grantorLakehead University


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record