Separable Type Representations of Matrices and Fast Algorithms: Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms: 234 (Operator Theory: Advances and Applications, 234)

Eidelman, Yuli

ISBN 10: 3034806051 / ISBN 13: 9783034806053

Published by Birkh?user, 2013

About this Item

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. Series: Operator Theory: Advances and Applications. Num Pages: 414 pages, biography. BIC Classification: PBF; PBKS. Category: (P) Professional & Vocational. Dimension: 159 x 243 x 28. Weight in Grams: 748. . 2013. 2014th Edition. hardcover. . . . .

Seller Inventory # V9783034806053

Bibliographic Details

• Title: Separable Type Representations of Matrices and Fast Algorithms: Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms: 234 (Operator Theory: Advances and Applications, 234)
• Publisher: Birkh?user
• Publication Date: 2013
• Language: English
• ISBN 10: 3034806051
• ISBN 13: 9783034806053
• Binding: Hardcover
• Condition: New

About this title

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.​

From the Back Cover

This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The primary focus is on fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work examines algorithms of multiplication, inversion and description of eigenstructure and includes a wealth of illustrative examples throughout the different chapters.

The first volume consists of four parts. The first part is mainly theoretical in 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 includes factorization and inversion fast algorithms for matrices via quasiseparable and semiseparable structures. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and accessible style, the text will be a valuable resource for engineers, scientists, numerical analysts, computer scientists and mathematicians alike.