Efficient Solution of Symmetric Eigenvalue Problems from Families of Coupled Systems

  title={Efficient Solution of Symmetric Eigenvalue Problems from Families of Coupled Systems},
  author={Antti Hannukainen and Jarmo Malinen and Antti Ojalammi},
  journal={SIAM J. Numer. Anal.},
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower diagonal block and the range of the coupling blocks remains unchanged. Such block structure naturally arises when studying the effect of a subsystem to the eigenmodes of the full system. The proposed method is based on interpolation of the resolvent function after… Expand
PU-CPI solution of Laplacian eigenvalue problems
A domain decomposition Ritz method, PU-CPI, is proposed, which can be used in distributed computing environments where communication is expensive, e.g., in clusters running on cloud computing services or networked workstations. Expand
Numerical modelling of coupled linear dynamical systems.
Numerical modelling of several coupled passive linear dynamical systems (LDS) is considered. Since such component systems may arise from partial differential equations, transfer functionExpand
A Domain Decomposition Rayleigh-Ritz Algorithm for Symmetric Generalized Eigenvalue Problems
This paper proposes a parallel domain decomposition Rayleigh--Ritz projection scheme to compute a selected number of eigenvalues (and, optionally, associated eigenvectors) of large and sparse symme...


Finite element approximation of eigenvalue problems
  • D. Boffi
  • Mathematics, Computer Science
  • Acta Numerica
  • 2010
The final part tries to introduce the reader to the fascinating setting of differential forms and homological techniques with the description of the Hodge–Laplace eigenvalue problem and its mixed equivalent formulations. Expand
The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems
A new algorithm is developed which computes a specified number of eigenvalues in any part of the spectrum of a generalized symmetric matrix eigenvalue problem. It uses a linear system routineExpand
New A Priori FEM Error Estimates for Eigenvalues
The Ritz--Galerkin method for symmetric eigenvalue problems is analyzed and what is apparently the first truly a priori error estimates that show the levels of the eigen value errors depending on approximability of eigenfunctions in the corresponding eigenspace are proved. Expand
Computation of Smallest Eigenvalues using Spectral Schur Complements
A purely algebraic look at the automated multilevel substructuring method is taken and it is explained that it can be viewed as a combination of three ingredients: a first order expansion to a nonlinear eigenvalue problem that approximates the restriction of the original eigenproblem on the interface between the subdomains, judicious projections on partial eigenbases, and recursivity. Expand
Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering
This paper proposes a rational filtering domain decomposition technique for the solution of large and sparse symmetric generalized eigenvalue problems and integrates only a part of the matrix resolvent while it applies any orthogonalization necessary to vectors whose length is equal to the number of interface variables. Expand
A POD reduced‐order model for eigenvalue problems with application to reactor physics
The novelty of this paper includes a new approach to generating snapshots, POD's application to large-scale eigenvalue calculations, and reduced-order model's application in reactor physics. Expand
Finite element-galerkin approximation of the eigenvalues and Eigenvectors of selfadjoint problems
Abstract : This paper establishes some refined estimates for the approximation of the eigenvalues and eigenvectors of selfadjoint eigenvalue problems by finite element or, more generally, GalerkinExpand
An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
An automated multilevel substructuring method for eigenvalue computations in linear elastodynamics in a variational and algebraic setting to achieve a high level of dimensional reduction, locally and inexpensively, while balancing the errors associated with truncation and the finite element discretization. Expand
Reduced basis approximation and a posteriori error estimates for parametrized elliptic eigenvalue problems
We develop a new reduced basis (RB) method for the rapid and reliable approximation of parametrized elliptic eigenvalue problems. The method hinges upon dual weighted residual type a posteriori errorExpand
An A Priori Bound for Automated Multilevel Substructuring
An a priori bound is derived for the AMLS approximation of eigenvalues by Rewriting the original problem as a rational eigenproblem of the same dimension as the projected problem and taking advantage of a minmax characterization for the rational Eigenproblem. Expand