Table of contents
About this book
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.
- DOI https://doi.org/10.1007/978-3-0348-0606-0
- Copyright Information Springer Basel 2014
- Publisher Name Birkhäuser, Basel
- eBook Packages Mathematics and Statistics
- Print ISBN 978-3-0348-0605-3
- Online ISBN 978-3-0348-0606-0
- Series Print ISSN 0255-0156
- Series Online ISSN 2296-4878
- Buy this book on publisher's site