A note on generating finer‐grain parallelism in a representation tree (Q4924936): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Eigenvectors and Relative Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and implementation of the MRRR algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fernando's solution to Wilkinson's problem: An application of double factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively robust representations of symmetric tridiagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ScaLAPACK's MRRR algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Singular Values of Bidiagonal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of the dqds algorithm (positive case) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds on perturbation of subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rotation of Eigenvectors by a Perturbation. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an Eigenvector with Inverse Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate singular values and differential qd algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Cholesky algorithms for singular values and vectors of triangular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bidiagonal Matrix Determines Its Hyperbolic SVD to Varied Relative Accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Revision as of 11:44, 6 July 2024

scientific article; zbMATH DE number 6172691
Language Label Description Also known as
English
A note on generating finer‐grain parallelism in a representation tree
scientific article; zbMATH DE number 6172691

    Statements

    A note on generating finer‐grain parallelism in a representation tree (English)
    0 references
    0 references
    10 June 2013
    0 references
    multiple relatively robust representations
    0 references
    complexity
    0 references
    GPU
    0 references
    multicore
    0 references
    representation tree
    0 references
    spectrum peeling
    0 references
    LAPACK
    0 references
    algorithm
    0 references
    orthogonal eigenvectors
    0 references
    symmetric tridiagonal matrix
    0 references
    eigenvalue clusters
    0 references
    parallelism
    0 references
    graphics processing unit
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references