000 | 03269nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-48174-4 | ||
003 | DE-He213 | ||
005 | 20190213151045.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1989 gw | s |||| 0|eng d | ||
020 |
_a9783540481744 _9978-3-540-48174-4 |
||
024 | 7 |
_a10.1007/BFb0083599 _2doi |
|
050 | 4 | _aQA297-299.4 | |
072 | 7 |
_aPBKS _2bicssc |
|
072 | 7 |
_aMAT021000 _2bisacsh |
|
072 | 7 |
_aPBKS _2thema |
|
082 | 0 | 4 |
_a518 _223 |
100 | 1 |
_aPetković, Miodrag. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aIterative Methods for Simultaneous Inclusion of Polynomial Zeros _h[electronic resource] / _cby Miodrag Petković. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1989. |
|
300 |
_aXII, 268 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1387 |
|
505 | 0 | _aBasic concepts -- Iterative methods without derivatives -- Generalized root iterations -- Bell's polynomials and parallel disk iterations -- Computational efficiency of simultaneous methods. | |
520 | _aThe simultaneous inclusion of polynomial complex zeros is a crucial problem in numerical analysis. Rapidly converging algorithms are presented in these notes, including convergence analysis in terms of circular regions, and in complex arithmetic. Parallel circular iterations, where the approximations to the zeros have the form of circular regions containing these zeros, are efficient because they also provide error estimates. There are at present no book publications on this topic and one of the aims of this book is to collect most of the algorithms produced in the last 15 years. To decrease the high computational cost of interval methods, several effective iterative processes for the simultaneous inclusion of polynomial zeros which combine the efficiency of ordinary floating-point arithmetic with the accuracy control that may be obtained by the interval methods, are set down, and their computational efficiency is described. The rate of these methods is of interest in designing a package for the simultaneous approximation of polynomial zeros, where automatic procedure selection is desired. The book is both a text and a reference source for mathematicans, engineers, physicists and computer scientists who are interested in new developments and applications, but the material is also accessible to anyone with graduate level mathematical background and some knowledge of basic computational complex analysis and programming. | ||
650 | 0 | _aNumerical analysis. | |
650 | 1 | 4 |
_aNumerical Analysis. _0http://scigraph.springernature.com/things/product-market-codes/M14050 |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662211304 |
776 | 0 | 8 |
_iPrinted edition: _z9783540514855 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1387 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0083599 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c9366 _d9366 |