Separable Type Representations of Matrices and Fast Algorithms, 1st Edition

  • Volume 1
  • Published By:
  • ISBN-10: 303480606X
  • ISBN-13: 9783034806060
  • DDC: 512.9434
  • Grade Level Range: College Freshman - College Senior
  • 399 Pages | eBook
  • Original Copyright 2014 | Published/Released June 2014
  • This publication's content originally published in print form: 2014

  • Price:  Sign in for price



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

Table of Contents

Front Cover.
Half Title Page.
Operator Theory: Advances and Applications.
Title Page.
Copyright Page.
1: Basics on Separable, Semi-separable and Quasiseparable Representations of Matrices.
2: Matrices with Separable Representation and Low Complexity Algorithms.
3: The Minimal Rank Completion Problem.
4: Matrices in Diagonal Plus Semiseparable Form.
5: Quasiseparable Representations: The Basics.
6: Quasiseparable Generators.
7: Rank Numbers of Pairs of Mutually Inverse Matrices, Asplund Theorems.
8: Unitary Matrices with Quasiseparable Representations.
9: Completion of Matrices with Specified Bands.
10: Completion to Green Matrices.
11: Completion to Matrices with Band Inverses and with Minimal Ranks.
12: Completion of Special Types of Matrices.
13: Completion of Mutually Inverse Matrices.
14: Completion to Unitary Matrices.
15: Quasiseparable Representations of Matrices, Descriptor Systems with Boundary Conditions and First Applications.
16: Quasiseparable Representations and Descriptor Systems with Boundary Conditions.
17: The First Inversion Algorithms.
18: Inversion of Matrices in Diagonal Plus Semiseparable Form.
19: Quasiseparable/semiseparable Representations and One-direction Systems.
20: Multiplication of Matrices.
21: Factorization and Inversion.
22: The LDU Factorization and Inversion.
23: Scalar Matrices with Quasiseparable Order One.
24: The Qr-factorization Based Method.