An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
From MaRDI portal
Publication:724535
DOI10.1016/j.cam.2018.05.051zbMath1391.65086arXiv1612.07526OpenAlexW2561673710WikidataQ129729285 ScholiaQ129729285MaRDI QIDQ724535
Xuebin Chi, Chun Huang, François-Henry Rouet, Jie Liu, Xingyu Gao, Sheng-Guo Li
Publication date: 26 July 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07526
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05)
Related Items (2)
Synchronization properties of interconnected network based on the vital node ⋮ Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Rank-one modification of the symmetric eigenproblem
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- ScaLAPACK: A portable linear algebra library for distributed memory computers -- design issues and performance
- On a new class of structured matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Fast algorithms for spherical harmonic expansions. II.
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem
- Randomized algorithms for the low-rank approximation of matrices
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- LAPACK Users' Guide
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- On the Compression of Low Rank Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
This page was built for publication: An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
