Librería: Majestic Books, Hounslow, Reino Unido
EUR 32,31
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 280 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 36,71
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 280.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 32,99
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 280.
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
EUR 20,10
Cantidad disponible: 1 disponibles
Añadir al carritoSoftcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-03612 3540514856 Sprache: Englisch Gewicht in Gramm: 550.
Idioma: Inglés
Publicado por Berlin, Heidelberg, New York: Springer, 1989
ISBN 10: 3540514856 ISBN 13: 9783540514855
Librería: Antiquariat Bernhardt, Kassel, Alemania
EUR 20,96
Cantidad disponible: 1 disponibles
Añadir al carritoBroschiert Broschiert. Condición: Gut. X, 263 Seiten, Lecture Notes in Mathematics, Band 1387. Zust: Gutes Exemplar. Einband verschmutzt, Seiten leicht gebräunt. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 452.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Springer, Springer Vieweg, 1989
ISBN 10: 3540514856 ISBN 13: 9783540514855
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The 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.
Librería: Buchpark, Trebbin, Alemania
EUR 17,78
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Gut. Zustand: Gut | Seiten: 280 | Sprache: Englisch | Produktart: Bücher | The 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.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Aug 1989, 1989
ISBN 10: 3540514856 ISBN 13: 9783540514855
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 48,14
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The 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. 280 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 3540514856 ISBN 13: 9783540514855
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The 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 c.
Idioma: Inglés
Publicado por Springer, Springer Vieweg Aug 1989, 1989
ISBN 10: 3540514856 ISBN 13: 9783540514855
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 280 pp. Englisch.