MARC Record from harvard_bibliographic_metadata

LEADER: 04164nam a22004575a 4500
001 013879516-9
005 20140103192749.0
008 131008s2014 sz | s ||0| 0|eng d
020 $a9783034806121
020 $a9783034806121
020 $a9783034806114
024 7 $a10.1007/978-3-0348-0612-1$2doi
035 $a(Springer)9783034806121
040 $aSpringer
050 4 $aQA184-205
072 7 $aPBF$2bicssc
072 7 $aMAT002050$2bisacsh
082 04 $a512.5$223
100 1 $aEidelman, Yuli,$eauthor.
245 10 $aSeparable Type Representations of Matrices and Fast Algorithms :$bVolume 2 Eigenvalue Method /$cby Yuli Eidelman, Israel Gohberg, Iulian Haimovici.
264 1 $aBasel :$bSpringer Basel :$bImprint: Birkhäuser,$c2014.
300 $aXI, 359 p.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aOperator Theory: Advances and Applications,$x0255-0156 ;$v235
505 0 $aPart 5. The eigenvalue structure of order one quasiseparable matrices -- 21. Quasiseparable of order one matrices. Characteristic polynomials -- 22. Eigenvalues with geometric multiplicity one -- 23. Kernels of quasiseparable of order one matrices -- 24. Multiple eigenvalues -- Part 6. Divide and conquer method for eigenproblems -- 25. Divide step -- 26. Conquer step and rational matrix functions eigenproblem -- 27. Complete algorithm for Hermitian matrices -- 28. Complete algorithm for unitary Hessenberg matrices -- Part 7. Algorithms for qr iterations and for reduction to Hessenberg form -- 29. The QR iteration method for eigenvalues -- 30. The reduction to Hessenberg form -- 31. The implicit QR iteration method for eigenvalues of upper Hessenberg matrices -- Part 8. QR iterations for companion matrices -- 32. Companion and unitary matrices -- 33. Explicit methods -- 34. Implicit methods with compression -- 35. The factorization based implicit method -- 36. Implicit algorithms based on the QR representation -- Bibliography.  .
520 $aThis 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 second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods for computing eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms also being derived for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable representations of any order is studied in the third part. This method is then used in the last part in order to provide a fast solver for the polynomial root finding problem. 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 20 $aNumerical analysis.
650 10 $aMathematics.
650 0 $aMathematics.
650 0 $aMatrix theory.
650 0 $aNumerical analysis.
650 24 $aLinear and Multilinear Algebras, Matrix Theory.
700 1 $aHaimovici, Iulian,$eauthor.
700 1 $aGohberg, I.$q(Israel),$d1928-2009,$eauthor.
776 08 $iPrinted edition:$z9783034806114
830 0 $aOperator theory, advances and applications ;$v235.
988 $a20131221
906 $0VEN