Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
DOI10.1016/J.CAMWA.2012.06.011zbMATH Open1319.65027OpenAlexW1989455457MaRDI QIDQ493418FDOQ493418
Faisal Saied, A. Klinvex, 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
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
Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (8)
- Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems
- A Parallel Implementation of the Trace Minimization Eigensolver
- On generalizing trace minimization principles
- TraceMIN
- The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software
- MINRES and MINERR Are Better than SYMMLQ in Eigenpair Computations
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Increasing the Performance of the Jacobi--Davidson Method by Blocking
Uses Software
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)
