An investigation into direct sparse matrix solution schemes in the finite element method

Simple item page
dc.contributor.advisorVos, Jen_ZA
dc.contributor.authorEastman, Michael Wayneen_ZA
dc.date.accessioned2014-09-22T07:54:43Z
dc.date.available2014-09-22T07:54:43Z
dc.date.issued1987en_ZA
dc.descriptionIncludes bibliographical references.en_ZA
dc.description.abstractThe application of the finite element method invariably involves the solution of large systems of sparse linear algebraic equations. The solution of these systems often represents a significant or even dominant component of the total solution time. Various sparse matrix techniques and strategies have been developed to reduce the time and cost of solving these equations. These techniques exploit both the zero-nonzero structure of the matrix problem and the manner in which the actual numerical components of the problem are computed. This thesis describes some of the direct methods, including the banded, sky line or profile, wavefront and hypermatrix schemes. The relative merits of each of these schemes are also indicated with respect to the number of arithmetical operations, data structure organization, secondary storage requirements and implementation strategy. The second section of this thesis discusses the implementation of an equation solution package for application in the finite element method. Initially a partitioning scheme for a wavefront solver was investigated but due to problems encountered and the increasing complexity of the code, it was decided to use an alternative method. A Cholesky decomposition method with a hypermatrix data storage scheme was then investigated and developed. The equation solution method was developed using a virtual paging scheme as implemented by the DAS package, and a module of general hypermatrix management routines. Finally, the package was implemented and tested in the NEW NOSTRUM development at the University of Cape Town. Suggestions for further developments are briefly discussed.en_ZA
dc.identifier.apacitationEastman, M. W. (1987). <i>An investigation into direct sparse matrix solution schemes in the finite element method</i>. (Thesis). University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Mechanical Engineering. Retrieved from http://hdl.handle.net/11427/7603en_ZA
dc.identifier.chicagocitationEastman, Michael Wayne. <i>"An investigation into direct sparse matrix solution schemes in the finite element method."</i> Thesis., University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Mechanical Engineering, 1987. http://hdl.handle.net/11427/7603en_ZA
dc.identifier.citationEastman, M. 1987. An investigation into direct sparse matrix solution schemes in the finite element method. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Eastman, Michael Wayne AB - The application of the finite element method invariably involves the solution of large systems of sparse linear algebraic equations. The solution of these systems often represents a significant or even dominant component of the total solution time. Various sparse matrix techniques and strategies have been developed to reduce the time and cost of solving these equations. These techniques exploit both the zero-nonzero structure of the matrix problem and the manner in which the actual numerical components of the problem are computed. This thesis describes some of the direct methods, including the banded, sky line or profile, wavefront and hypermatrix schemes. The relative merits of each of these schemes are also indicated with respect to the number of arithmetical operations, data structure organization, secondary storage requirements and implementation strategy. The second section of this thesis discusses the implementation of an equation solution package for application in the finite element method. Initially a partitioning scheme for a wavefront solver was investigated but due to problems encountered and the increasing complexity of the code, it was decided to use an alternative method. A Cholesky decomposition method with a hypermatrix data storage scheme was then investigated and developed. The equation solution method was developed using a virtual paging scheme as implemented by the DAS package, and a module of general hypermatrix management routines. Finally, the package was implemented and tested in the NEW NOSTRUM development at the University of Cape Town. Suggestions for further developments are briefly discussed. DA - 1987 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 1987 T1 - An investigation into direct sparse matrix solution schemes in the finite element method TI - An investigation into direct sparse matrix solution schemes in the finite element method UR - http://hdl.handle.net/11427/7603 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/7603
dc.identifier.vancouvercitationEastman MW. An investigation into direct sparse matrix solution schemes in the finite element method. [Thesis]. University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Mechanical Engineering, 1987 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/7603en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Mechanical Engineeringen_ZA
dc.publisher.facultyFaculty of Engineering and the Built Environment
dc.publisher.institutionUniversity of Cape Town
dc.subject.otherCivil Engineeringen_ZA
dc.titleAn investigation into direct sparse matrix solution schemes in the finite element methoden_ZA
dc.typeMaster Thesis
dc.type.qualificationlevelMasters
dc.type.qualificationnameMScen_ZA
uct.type.filetypeText
uct.type.filetypeImage
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
thesis_ebe_1987_eastman_mw (1).pdf
Size:
6.12 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Masters