Separable Type Representations of Matrices and Fast Algorithms
Eidelman, Yuli; Gohberg, Israel; Haimovici, Iulian
€ 129.95
FREE Delivery in Ireland
Description for Separable Type Representations of Matrices and Fast Algorithms
Hardcover. 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.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2013
Publisher
Springer Basel Switzerland
Number of pages
416
Condition
New
Series
Operator Theory: Advances and Applications
Number of Pages
399
Place of Publication
Basel, Switzerland
ISBN
9783034806053
SKU
V9783034806053
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Separable Type Representations of Matrices and Fast Algorithms