Computing specified generators of structured matrix inverses

@inproceedings{Jeannerod2010ComputingSG,
  title={Computing specified generators of structured matrix inverses},
  author={Claude-Pierre Jeannerod and Christophe Mouilleron},
  booktitle={ISSAC},
  year={2010}
}
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-specified… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-3 of 3 references

A divide and conquer method to solve Cauchy-like systems

J.-P. Cardinal
Technical report, The FRISCO Consortium, • 2000
View 14 Excerpts
Highly Influenced

On a property of Cauchy-like matrices

J.-P. Cardinal
C. R. Acad. Sci. Paris - Série I - Analyse numérique/Numerical Analysis, • 1999
View 15 Excerpts
Highly Influenced

Structured Matrices and Polynomials

V. Y. Pan
Birkhäuser Boston Inc., • 2001
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…