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

DOI10.1016/J.CAMWA.2016.03.008zbMATH Open1443.65051OpenAlexW2329958935MaRDI QIDQ2007234FDOQ2007234

Authors: Li-zhi Cheng, Xiang-Ke Liao, Shengguo Li, Ming Gu 

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

Recommendations

• Divide and conquer algorithms for the bandsymmetric eigenvalue problem
• New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
• An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
• scientific article; zbMATH DE number 278836
• A Divide-and-Conquer Algorithm for the Bidiagonal SVD

zbMATH Keywords

SVDeigenvalue problembanded matricesHSS matricesdivide and conquer algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
• SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
• Divide and conquer algorithms for the bandsymmetric eigenvalue problem
• On multisplitting methods for band matrices
• Title not available (Why is that?)

Uses Software

• SBR Toolbox
• PLASMA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007234)