Spectral Schur complement techniques for symmetric eigenvalue problems

zbMath1352.65118MaRDI QIDQ333596

Ruipeng Li, Vassilis Kalantzis, Yousef Saad

Publication date: 31 October 2016

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol45/abstract_vol45_pp305-329.html

zbMATH Keywords

numerical exampleNewton's methodeigenvectordomain decompositionparallel computingsparse matrixeigenvalue problemsspectral Schur complements

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (8)

Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem ⋮ Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering ⋮ Fast Computation of Spectral Densities for Generalized Eigenvalue Problems ⋮ A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems ⋮ A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems

Uses Software

• PETSc
• ARPACK
• CHOLMOD
• SparseMatrix
• Scotch
• Isorropia

This page was built for publication: Spectral Schur complement techniques for symmetric eigenvalue problems