Separable Type Representations of Matrices and Fast Algorithms: Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms

Here is a systematic theoretical and computational study of generalizations of separable matrices. Covers quasiseparable and semiseparable representations of matrices and minimal rank completion problems, factorization and inversion fast algorithms and more.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Eidelman, Yuli, Gohberg, Israel, Haimovici, Iulian
Format: Buch
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Here is a systematic theoretical and computational study of generalizations of separable matrices. Covers quasiseparable and semiseparable representations of matrices and minimal rank completion problems, factorization and inversion fast algorithms and more.
ISSN:0255-0156
2296-4878
DOI:10.1007/978-3-0348-0606-0