Exact computations with quasiseparable matrices
From MaRDI portal
Abstract: Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation formats exist for thesematrices that have rarely been compared.We show how the most central formats SSS and HSS can beadapted to symbolic computation, where the exact rank replacesthreshold based numerical ranks. We clarify their links and comparethem with the Bruhat format. To this end, we state their space andtime cost estimates based on fast matrix multiplication, and comparethem, with their leading constants. The comparison is supportedby software experiments.We make further progresses for the Bruhat format, for which wegive a generation algorithm, following a Crout elimination scheme,which specializes into fast algorithms for the construction from asparse matrix or from the sum of Bruhat representations.
Cites work
- A bibliography on semiseparable matrices
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A Givens-Weight Representation for Rank Structured Matrices
- A real QZ algorithm for structured companion pencils
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Algorithms to solve hierarchically semi-separable systems
- Bruhat canonical form for linear systems
- Computing with quasiseparable matrices
- Fast algorithms for hierarchically semiseparable matrices
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Hierarchical matrices: algorithms and analysis
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- scientific article; zbMATH DE number 1955860 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- Implicit QR for rank-structured matrix pencils
- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- On a new class of structured matrices
- On generators of quasiseparable finite block matrices
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Time and space efficient generators for quasiseparable matrices
Cited in
(2)
This page was built for publication: Exact computations with quasiseparable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081972)
