Cargando…
Separable Type Representations of Matrices and Fast Algorithms Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms /
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 algo...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Basel :
Springer Basel : Imprint: Birkhäuser,
2014.
|
| Edición: | 1st ed. 2014. |
| Colección: | Operator Theory: Advances and Applications,
234 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-0348-0606-0 | ||
| 003 | DE-He213 | ||
| 005 | 20220110191029.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 131008s2014 sz | s |||| 0|eng d | ||
| 020 | |a 9783034806060 |9 978-3-0348-0606-0 | ||
| 024 | 7 | |a 10.1007/978-3-0348-0606-0 |2 doi | |
| 050 | 4 | |a QA184-205 | |
| 072 | 7 | |a PBF |2 bicssc | |
| 072 | 7 | |a MAT002050 |2 bisacsh | |
| 072 | 7 | |a PBF |2 thema | |
| 082 | 0 | 4 | |a 512.5 |2 23 |
| 100 | 1 | |a Eidelman, Yuli. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Separable Type Representations of Matrices and Fast Algorithms |h [electronic resource] : |b Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms / |c by Yuli Eidelman, Israel Gohberg, Iulian Haimovici. |
| 250 | |a 1st ed. 2014. | ||
| 264 | 1 | |a Basel : |b Springer Basel : |b Imprint: Birkhäuser, |c 2014. | |
| 300 | |a XV, 399 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Operator Theory: Advances and Applications, |x 2296-4878 ; |v 234 | |
| 505 | 0 | |a Part 1. Basics on separable, semiseparable and quasiseparable representations of matrices -- 1. Matrices with separable representation and low complexity algorithms -- 2. The minimal rank completion problem -- 3. Matrices in diagonal plus semiseparable form -- 4. Quasiseparable representations: the basics -- 5. Quasiseparable generators -- 6. Rank numbers of pairs of mutually inverse matrices, Asplund theorems -- 7. Unitary matrices with quasiseparable representations -- Part 2. Completion of matrices with specified bands -- 8. Completion to Green matrices -- 9. Completion to matrices with band inverses and with minimal ranks -- 10. Completion of special types of matrices -- 11. Completion of mutually inverse matrices -- 12. Completion to unitary matrices -- Part 3. Quasiseparable representations of matrices, descriptor systems with boundary conditions and first applications -- 13. Quasiseparable representations and descriptor systems with boundary conditions -- 14. The first inversion algorithms -- 15. Inversion of matrices in diagonal plus semiseparable form -- 16. Quasiseparable/semiseparable representations and one-direction systems -- 17. Multiplication of matrices -- Part 4. Factorization and inversion -- 18. The LDU factorization and inversion -- 19. Scalar matrices with quasiseparable order one -- 20. The QR factorization based method. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Algebras, Linear. | |
| 650 | 0 | |a Numerical analysis. | |
| 650 | 1 | 4 | |a Linear Algebra. |
| 650 | 2 | 4 | |a Numerical Analysis. |
| 700 | 1 | |a Gohberg, Israel. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 700 | 1 | |a Haimovici, Iulian. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783034806077 |
| 776 | 0 | 8 | |i Printed edition: |z 9783034806053 |
| 830 | 0 | |a Operator Theory: Advances and Applications, |x 2296-4878 ; |v 234 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-0348-0606-0 |z Texto Completo |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||