Journal
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
Volume 37, Issue 2, Pages 695-718Publisher
SIAM PUBLICATIONS
DOI: 10.1137/15M1017181
Keywords
parameter-dependent eigenvalue problem; Hermitian matrix; subspace acceleration; successive constraint method; quadratic residual bound
Categories
Funding
- SNF research module A Reduced Basis Approach to Large-Scale Pseudospectra Computations within the SNF ProDoc Efficient Numerical Methods
Ask authors/readers for more resources
This work is concerned with approximating the smallest eigenvalue of a parameter-dependent Hermitian matrix A(mu) for many parameter values mu in a domain D subset of R-P. The design of reliable and efficient algorithms for addressing this task is of importance in a variety of applications. Most notably, it plays a crucial role in estimating the error of reduced basis methods for parametrized partial differential equations. The current state-of-the-art approach, the so-called successive constraint method (SCM), addresses affine linear parameter dependencies by combining sampled Rayleigh quotients with linear programming techniques. In this work, we propose a subspace approach that additionally incorporates the sampled eigenvectors of A(mu) and implicitly exploits their smoothness properties. Like SCM, our approach results in rigorous lower and upper bounds for the smallest eigenvalues on D. Theoretical and experimental evidence is given to demonstrate that our approach represents a significant improvement over SCM in the sense that the bounds are often much tighter, at negligible additional cost.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available