Time and space efficient generators for quasiseparable matrices - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2018

Time and space efficient generators for quasiseparable matrices


The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in solving PDE's for particle interaction with the Fast Multi-pole Method (FMM), or computing generalized eigenvalues. From these application fields, structured representations and algorithms have been designed in numerical linear algebra to compute with these matrices in time linear in the matrix dimension and either quadratic or cubic in the quasiseparability order. Motivated by the design of the general purpose exact linear algebra library LinBox, and by algorithmic applications in algebraic computing, we adapt existing techniques introduce novel ones to use quasiseparable matrices in exact linear algebra, where sub-cubic matrix arithmetic is available. In particular, we will show, the connection between the notion of quasiseparability and the rank profile matrix invariant, that we have introduced in 2015. It results in two new structured representations, one being a simpler variation on the hierarchically semiseparable storage, and the second one exploiting the generalized Bruhat decomposition. As a consequence, most basic operations, such as computing the quasiseparability orders, applying a vector, a block vector, multiplying two quasiseparable matrices together, inverting a quasiseparable matrix, can be at least as fast and often faster than previous existing algorithms.
Fichier principal
Vignette du fichier
qsprod.pdf (267.95 Ko) Télécharger le fichier

Dates and versions

hal-01424252 , version 1 (02-01-2017)
hal-01424252 , version 2 (20-10-2019)



Clément Pernet, Arne Storjohann. Time and space efficient generators for quasiseparable matrices. Journal of Symbolic Computation, 2018, Special issue on the 41th International Symposium on Symbolic and Alge-braic Computation (ISSAC’16), 85, pp.224-246. ⟨10.1016/j.jsc.2017.07.010⟩. ⟨hal-01424252v2⟩
367 View
573 Download



Gmail Facebook Twitter LinkedIn More