Computation of Smallest Eigenvalues using Spectral Schur Complements

DOI10.1137/040603528MaRDI QIDQ5470326zbMATH OpenOpenAlexFDO

Authors C. Bekas, Y. Saad

Publication date 30 May 2006

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/040603528

zbMATH Keywords

Krylov subspacesnumerical experimentsnonlinear eigenvalue problemspectral Schur complementsautomated multilevel substructuring method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Estimates of eigenvalues in context of PDEs (35P15) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Recommendations

• Computation of small eigenvalues of a matrix
• Computing the Smallest Eigenvalue of an M-Matrix
• Computing the Smallest Eigenpair of a Symmetric Positive Definite Toeplitz Matrix
• Spectral Schur complement techniques for symmetric eigenvalue problems
• scientific article; zbMATH DE number 1985702
• Computing the smallest eigenvalue of large ill-conditioned Hankel matrices
• Computation of the Smallest Even and Odd Eigenvalues of a Symmetric Positive-Definite Toeplitz Matrix
• Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
• A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
• scientific article; zbMATH DE number 4117742

Cited in

(12)

• Beyond automated multilevel substructuring: domain decomposition with rational filtering
• A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
• A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
• A survey on variational characterizations for nonlinear eigenvalue problems
• A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems
• Efficient solution of symmetric eigenvalue problems from families of coupled systems
• Computing the smallest singular triplets of a large matrix
• Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem
• Enhanced algebraic substructuring for symmetric generalized eigenvalue problems
• On correction equations and domain decomposition for computing invariant subspaces
• Distributed solution of Laplacian eigenvalue problems
• A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation

Describes a project that uses

Uses Software

• NASTRAN
• ARPACK
• MatrixMarket

This page was built for publication: Computation of Smallest Eigenvalues using Spectral Schur Complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470326)