A note on generating finer‐grain parallelism in a representation tree

DOI10.1002/NLA.828MaRDI QIDQ4924936zbMATH OpenOpenAlexFDO

Authors Christof Vömel

Publication date 10 June 2013

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.828

zbMATH Keywords

algorithmcomplexityparallelismGPUmulticoregraphics processing unitsymmetric tridiagonal matrixLAPACKeigenvalue clustersorthogonal eigenvectorsmultiple relatively robust representationsrepresentation treespectrum peeling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Trees (05C05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Rough Sets and Current Trends in Computing
• Optimal parallel generation of a computation tree form
• scientific article; zbMATH DE number 2086793
• Parallel construction of succinct trees
• A unified approach to the parallel construction of search trees
• Publication:4860169

Cites work

• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Bidiagonal Matrix Determines Its Hyperbolic SVD to Varied Relative Accuracy
• A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
• Accurate Singular Values of Bidiagonal Matrices
• Accurate singular values and differential qd algorithms
• An implementation of the dqds algorithm (positive case)
• Computing an Eigenvector with Inverse Iteration
• Fernando's solution to Wilkinson's problem: An application of double factorization
• Implicit Cholesky algorithms for singular values and vectors of triangular matrices
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• Orthogonal Eigenvectors and Relative Gaps
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Relatively robust representations of symmetric tridiagonals
• ScaLAPACK's MRRR algorithm
• Some new bounds on perturbation of subspaces
• The Rotation of Eigenvectors by a Perturbation. III
• The design and implementation of the MRRR algorithm
• Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy

Describes a project that uses

Uses Software

• Algorithm 880
• LAPACK

This page was built for publication: A note on generating finer‐grain parallelism in a representation tree

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