MARC Record from Library of Congress

LEADER: 03495cam a22004937i 4500
001 2013951156
003 DLC
005 20150908122750.0
008 130923t20142014sz b 001 0 eng d
010 $a 2013951156
015 $aGBB346251$2bnb
016 7 $a016335503$2Uk
020 $a9783034806053 (v. 1 : alk. paper)
020 $a3034806051 (v. 1 : alk. paper)
020 $a9783034806114 (v. 2 : alk. paper)
020 $a3034806116 (v. 2 : alk. paper)
020 $z9783034806060 (v. 1 : ebk.)
020 $z9783034806121 (v. 2 : ebk.)
035 $a(OCoLC)ocn864080999
040 $aUKMGB$beng$cUKMGB$erda$dOCLCO$dOHX$dB3G$dMUU$dSTF$dOCLCF$dYDXCP$dCDX$dBTCTA$dCHVBK$dDLC
042 $alccopycat
050 00 $aQA188$b.E376 2014
072 7 $aQA$2lcco
082 04 $a512.9434$223
100 1 $aEidelman, Yuli,$d1955-$eauthor.
245 10 $aSeparable type representations of matrices and fast algorithms /$cYuli Eidelman, Israel Gohberg, Iulian Haimovici.
264 1 $aBasel ;$aNew York :$bBirkhäuser/Springer,$c[2014]
264 4 $c©2014
300 $a2 volumes ;$c25 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aOperator theory: advances and applications,$x0255-0156 ;$v234-235
504 $aIncludes bibliographical references and index.
505 0 $aV. 1. Basics; completion problems; multiplication and inversion algorithms -- v. 2. Eigenvalue method.
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. --$cSource other than Library of Congress.
650 0 $aMatrices.
650 0 $aAlgorithms.
650 7 $aAlgorithms.$2fast$0(OCoLC)fst00805020
650 7 $aMatrices.$2fast$0(OCoLC)fst01012399
700 1 $aGohberg, I.$q(Israel),$d1928-2009,$eauthor.
700 1 $aHaimovici, Iulian,$eauthor.
830 0 $aOperator theory, advances and applications ;$v234.
830 0 $aOperator theory, advances and applications ;$v235.