Solving eigenvalue problems by implicit decomposition

DOI10.1002/NUM.1690070203MaRDI QIDQ3361797zbMATH OpenOpenAlexFDO

Authors Jenn-Ching Luo

Publication date 1991

Published in Numerical Methods for Partial Differential Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/num.1690070203

zbMATH Keywords

convergencedecompositiongeneralized eigenvalue problemcoordinate relaxationmultiple eigenpairs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• scientific article; zbMATH DE number 218070
• Numerical methods for large eigenvalue problems
• Parallel implementation and performance of multigrid algorithms for solving eigenvalue problems
• Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
• scientific article; zbMATH DE number 218267

Cites work

• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• A study on decomposition methods

Cited in

(2)

• Implicit computational solution of generalized quadratic eigenvalue problems
• A study on basis conjugate matrices

This page was built for publication: Solving eigenvalue problems by implicit decomposition

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