Exact computations with quasiseparable matrices
From MaRDI portal
Publication:6081972
DOI10.1145/3597066.3597102arXiv2302.04515WikidataQ131121811 ScholiaQ131121811MaRDI QIDQ6081972
Gilles Villard, Unnamed Author, Clément Pernet
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.04515
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generators of quasiseparable finite block matrices
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- On a new class of structured matrices
- A real QZ algorithm for structured companion pencils
- Time and space efficient generators for quasiseparable matrices
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Implicit QR for rank-structured matrix pencils
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Bruhat canonical form for linear systems
- Hierarchical Matrices: Algorithms and Analysis
- Computing with Quasiseparable Matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- A Givens-Weight Representation for Rank Structured Matrices
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- hm-toolbox: MATLAB Software for HODLR and HSS Matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Some Fast Algorithms for Sequentially Semiseparable Representations
- A bibliography on semiseparable matrices
This page was built for publication: Exact computations with quasiseparable matrices
