Separable Type Representations of Matrices and Fast Algorithms

Yuli Eidelman

ISBN 10: 3034806051 / ISBN 13: 9783034806053

Edité par Springer Basel, Birkhäuser Basel Okt 2013, 2013

A propos de cet article

Neuware -This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. The first volume consists of four parts. The first part is of a mainly theoretical character introducing and studyingthe quasiseparable and semiseparable representations of matrices and minimal rank completion problems. Three further completions are treated in the second part.The first applications of the quasiseparable and semiseparable structure are included in the third part where the interplay between the quasiseparable structure and discrete time varying linear systems with boundary conditions play an essential role. The fourth part contains factorization and inversion fast algorithms for matrices via quasiseparable and semiseparable structure. The workis based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.¿Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 416 pp. Englisch.

N° de réf. du vendeur 9783034806053

Détails bibliographiques

• Titre: Separable Type Representations of Matrices and Fast Algorithms
• Éditeur: Springer Basel, Birkhäuser Basel Okt 2013
• Date de parution: 2013
• Langue: anglais
• ISBN à 10 chiffres: 3034806051
• ISBN à 13 chiffres: 9783034806053
• Reliure: Buch
• État de l'article: Neu
• Dimensions: 241 L x 160 H x 27 P (en millimètres) 241 millimètres de largeur par 160 millimètres de hauteur par 27 millimètres de profondeur
• Poids: 787 grammes

A propos de ce titre

Synopsis

This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. The first volume consists of four parts. The first part is of a mainly theoretical character introducing and studying the quasiseparable and semiseparable representations of matrices and minimal rank completion problems. Three further completions are treated in the second part. The first applications of the quasiseparable and semiseparable structure are included in the third part where the interplay between the quasiseparable structure and discrete time varying linear systems with boundary conditions play an essential role. The fourth part contains factorization and inversion fast algorithms for matrices via quasiseparable and semiseparable structure. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.​