A multigrid Krylov method for eigenvalue problems.

Simple item page
dc.contributor.advisorMorgan, Ronald Benjamin, 1958-
dc.contributor.advisorLenells, Jonatan, 1981-
dc.creatorYang, Zhao, 1983-
dc.date.accessioned2015-09-04T15:22:49Z
dc.date.available2015-09-04T15:22:49Z
dc.date.created2015-08
dc.date.issued2015-07-31
dc.date.submittedAugust 2015
dc.date.updated2015-09-04T15:22:49Z
dc.description.abstractWe are interested in computing eigenvalues and eigenvectors of matrices derived from differential equations. They are often large sparse matrices, including both symmetric and non symmetric cases. Restarted Arnoldi methods are iterative methods for eigenvalue problems based on Krylov subspaces. Multigrid methods solve differential equations by taking advantage of the hierarchy of discretizations. A multigrid Krylov method is proposed by combining Arnoldi and multigrid methods. We compare the new approach with other methods, and explore the theory to explain its efficiency.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2104/9514
dc.language.isoen
dc.rights.accessrightsWorldwide access
dc.subjectKrylov subspaces. Arnoldi. Multigrid. Eigenvalue problems.
dc.titleA multigrid Krylov method for eigenvalue problems.
dc.typeThesis
dc.type.materialtext
thesis.degree.departmentBaylor University. Dept. of Mathematics.
thesis.degree.grantorBaylor University
thesis.degree.levelDoctoral
thesis.degree.namePh.D.

Files

Original bundle

Now showing 1 - 2 of 2
Thumbnail Image
Name:
YANG-DISSERTATION-2015.pdf
Size:
776.23 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
Zhao_Yang_copyright-availabilityform.pdf
Size:
256.28 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.95 KB
Format:
Plain Text
Description:
Download

Collections

Electronic Theses and Dissertations
Theses/Dissertations - Mathematics