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

DOI10.1002/NLA.828zbMATH Open1274.65108OpenAlexW1899806734MaRDI QIDQ4924936FDOQ4924936

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

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

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)

Cites Work

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

Uses Software

• LAPACK
• Algorithm 880

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)