Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem

DOI10.1016/J.CAMWA.2012.06.011MaRDI QIDQ493418zbMATH OpenOpenAlexFDO

Authors A. Klinvex, Faisal Saied, Ahmed H. Sameh

Publication date 3 September 2015

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2012.06.011

zbMATH Keywords

sparse matricesparallel computingsymmetric eigenvalue problemtrace minimization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• A Parallel Implementation of the Trace Minimization Eigensolver
• A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
• Trace-penalty minimization for large-scale eigenspace computation
• scientific article; zbMATH DE number 434520
• An efficient implementation of parallel eigenvalue computation for massively parallel processing

Cited in

(8)

• Increasing the performance of the Jacobi-Davidson method by blocking
• MINRES and MINERR Are Better than SYMMLQ in Eigenpair Computations
• TraceMIN
• On generalizing trace minimization principles
• A Parallel Implementation of the Trace Minimization Eigensolver
• Goal-oriented optimal approximations of Bayesian linear inverse problems
• TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
• The eigenvalues slicing library (EVSL): algorithms, implementation, and software

Describes a project that uses

Uses Software

• PRIMME
• Trilinos
• ARPACK
• LOBPCG

This page was built for publication: Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem

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