Computing specified generators of structured matrix inverses

Claude-Pierre Jeannerod 1, 2 Christophe Mouilleron 1, 2
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The asymptotically fastest known divide-and-conquer methods for inverting dense structured matrices are essentially variations or extensions of the Morf/Bitmead-Anderson algorithm. Most of them must deal with the growth in length of intermediate generators, and this is done by incorporating various generator compression techniques into the algorithms. One exception is an algorithm by Cardinal, which in the particular case of Cauchy-like matrices avoids such growth by focusing on well-specied, already compressed generators of the inverse. In this paper, we extend Cardinal's method to a broader class of structured matrices including those of Vandermonde, Hankel, and Toeplitz types. Besides, some rst experimental results illustrate the practical interest of the approach.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00450272
Contributor : Claude-Pierre Jeannerod <>
Submitted on : Tuesday, January 26, 2010 - 8:33:39 AM
Last modification on : Wednesday, November 20, 2019 - 2:59:14 AM
Long-term archiving on : Thursday, October 18, 2012 - 1:15:37 PM

File

JeannerodMouilleron2010.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Claude-Pierre Jeannerod, Christophe Mouilleron. Computing specified generators of structured matrix inverses. 35th International Symposium on Symbolic and Algebraic Computation (ISSAC 2010), Jul 2010, Münich, Germany. ⟨10.1145/1837934.1837988⟩. ⟨ensl-00450272⟩

Share

Metrics

Record views

571

Files downloads

306