Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Improving Feast for Real Symmetric Standard Eigenvalue Problems
Download
10672352.pdf
Date
2024-9-03
Author
Özçoban, Kadir
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
243
views
30
downloads
Cite This
Eigenvalue problems may arise from various application areas including Quantum mechanics, Computational Fluid Dynamics, Power Networks, and Machine Learn ing. To solve these problems, several methods for computing all or a batch of eigen values and eigenvectors (i.e. eigenpairs) have been proposed over the years, including both direct and iterative approaches. FEAST is a subspace-based iterative technique that simplifies the computation by projecting the problem onto a lower-dimensional subspace while preserving the eigenpairs. Despite its widespread use, FEAST is not without limitations. One of the most conspicuous problems is that a crucial matrix for the algorithm which is supposed to be orthogonal might lose its orthogonality throughout the iterations because of the well-known floating point errors or the ap proximate methods used to obtain it. This possible issue could cause slower convergence or even spurious eigenvalues, values that do not originally belong to the matrix. In this thesis, new as well as existing methods to improve the stability of the FEAST algorithm are investigated over various eigenvalue spectrum. Additionally, a novel method in which FEAST is preceded with inverse subspace iteration to provide better initial guesses for the algorithm is studied. Moreover, this method is further extended in a Hybrid manner by iterating these two alternatively.
Subject Keywords
Eigenvalue Problem
,
FEAST
,
Hybrid Approaches
,
Sparse Matrix Computations
URI
https://hdl.handle.net/11511/111357
Collections
Graduate School of Natural and Applied Sciences, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Özçoban, “Improving Feast for Real Symmetric Standard Eigenvalue Problems,” M.S. - Master of Science, Middle East Technical University, 2024.