Spectral Schur complement techniques for symmetric eigenvalue problems

MaRDI QIDQ333596zbMATHFDO

Authors Vassilis Kalantzis, Ruipeng Li, Y. 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

sparse matrixdomain decompositioneigenvalue problemseigenvectornumerical exampleparallel computingNewton's methodspectral Schur complements

Mathematics Subject Classification ID

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

Recommendations

• A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
• A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
• scientific article; zbMATH DE number 218267
• Spectral element methods for eigenvalue problems based on domain decomposition
• scientific article; zbMATH DE number 218070

Cited in

(15)

• Computation of Smallest Eigenvalues using Spectral Schur Complements
• 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
• Inertia‐based spectrum slicing for symmetric quadratic eigenvalue problems
• A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
• A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
• A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
• An iterative method for solving the spectral problem of complex symmetric matrices
• Cucheb: a GPU implementation of the filtered Lanczos procedure
• Fast computation of spectral densities for generalized eigenvalue problems
• Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem
• Beyond automated multilevel substructuring: domain decomposition with rational filtering
• Schur complement spectral bounds for large hybrid FETI-DP clusters and huge three-dimensional scalar problems
• On the asymmetric eigenvalue complementarity problem
• Efficient solution of symmetric eigenvalue problems from families of coupled systems

Describes a project that uses

Uses Software

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

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

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