An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures (Q724535): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129729285, #quickstatements; #temporary_batch_1726260318586
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Divide and Conquer method for the symmetric tridiagonal eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-one modification of the symmetric eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: ScaLAPACK: A portable linear algebra library for distributed memory computers -- design issues and performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Fast Algorithms for Sequentially Semiseparable Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for hierarchically semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compression of Low Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for the low-rank approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for spherical harmonic expansions. II. / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129729285 / rank
 
Normal rank

Latest revision as of 22:46, 13 September 2024

scientific article
Language Label Description Also known as
English
An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
scientific article

    Statements

    An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    ScaLAPACK
    0 references
    divide-and-conquer
    0 references
    HSS matrix
    0 references
    distributed parallel algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references