Abstract
This paper is concerned with computations of a few smallest eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that a few smallest eigenvalues can be accurately computed for a diagonally dominant matrix or a product of diagonally dominant matrices by combining a standard iterative method with the accurate inversion algorithms that have been developed for such matrices. Applications to the finite difference discretization of differential operators are discussed. In particular, a new discretization is derived for the 1-dimensional biharmonic operator that can be written as a product of diagonally dominant matrices. Numerical examples are presented to demonstrate the accuracy achieved by the new algorithms.
Original language | English |
---|---|
Pages (from-to) | 237-259 |
Number of pages | 23 |
Journal | Mathematics of Computation |
Volume | 87 |
Issue number | 309 |
DOIs | |
State | Published - 2018 |
Bibliographical note
Publisher Copyright:© 2017 American Mathematical Society.
Keywords
- Accuracy
- Biharmonic operator
- Differential eigenvalue problem
- Eigenvalue
- Ill-conditioned matrix
- Lanczos method
ASJC Scopus subject areas
- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics