An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths

DOI10.1016/j.camwa.2016.03.008zbMath1443.65051OpenAlexW2329958935MaRDI QIDQ2007234

Li-Zhi Cheng, Xiang-Ke Liao, Ming Gu, Sheng-Guo Li

Publication date: 12 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2016.03.008

zbMATH Keywords

eigenvalue problemSVDbanded matricesHSS matricesdivide and conquer algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (2)

SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

Uses Software

• SBR Toolbox
• PLASMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
• Rang revealing QR factorizations
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Divide and conquer algorithms for the bandsymmetric eigenvalue problem
• Rank-one modification of the symmetric eigenproblem
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• On a new class of structured matrices
• An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
• The university of Florida sparse matrix collection
• Randomized algorithms for the low-rank approximation of matrices
• Fast algorithms for hierarchically semiseparable matrices
• A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
• Accurate Singular Values of Bidiagonal Matrices
• A parallel symmetric block-tridiagonal divide-and-conquer algorithm
• Superfast Multifrontal Method for Large Structured Linear Systems of Equations
• A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
• On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
• A Singular Value Decomposition Updating Algorithm for Subspace Tracking
• A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
• A Divide-and-Conquer Algorithm for the Bidiagonal SVD
• A framework for symmetric band reduction
• Algorithm 807
• Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
• Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• On the Compression of Low Rank Matrices
• Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
• Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
• An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
• Some Fast Algorithms for Sequentially Semiseparable Representations
• Electronic Structure
• A bibliography on semiseparable matrices
• Updating the singular value decomposition

This page was built for publication: An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths