Time and space efficient generators for quasiseparable matrices
From MaRDI portal
Publication:2409018
DOI10.1016/j.jsc.2017.07.010zbMath1381.65035arXiv1701.00396OpenAlexW2569934946MaRDI QIDQ2409018
Clément Pernet, Arne Storjohann
Publication date: 10 October 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.00396
algorithmgeneralized eigenvaluesquasiseparable matricesgeneralized Bruhat decompositionfast matrix arithmetichierarchically semiseparable storagerank profile matrix
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Matrix Structures and Matrix Functions ⋮ Exact computations with quasiseparable matrices ⋮ Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- On generators of quasiseparable finite block matrices
- Solving structured linear systems with large displacement rank
- Linear complexity algorithms for semiseparable matrices
- Displacement ranks of matrices and linear equations
- Rank revealing \(LU\) factorizations
- On a new class of structured matrices
- On the existence and computation of rank-revealing LU factorizations
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Gaussian elimination is not optimal
- Bruhat canonical form for linear systems
- Implicit QR for companion-like pencils
- Computing the Rank Profile Matrix
- Simultaneous computation of the row and column rank profiles
- Computing with Quasiseparable Matrices
- Fast algorithms for hierarchically semiseparable matrices
- Sur les représentations induites des groupes de Lie
- Powers of tensors and fast matrix multiplication
- On Computations with Dense Structured Matrices
- A Givens-Weight Representation for Rank Structured Matrices
- Fast Generalized Bruhat Decomposition
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- On Rank-Revealing Factorisations
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Some Fast Algorithms for Sequentially Semiseparable Representations
- A bibliography on semiseparable matrices
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
This page was built for publication: Time and space efficient generators for quasiseparable matrices
