Narrow your search

Library

Odisee (5)

Thomas More Kempen (5)

Thomas More Mechelen (5)

UCLL (5)

VIVES (5)

KU Leuven (4)

LUCA School of Arts (4)

ULiège (4)

ULB (3)

UGent (2)

More...

Resource type

book (5)


Language

English (5)


Year
From To Submit

2013 (2)

2008 (1)

2007 (1)

2003 (1)

Listing 1 - 5 of 5
Sort by

Book
Point estimation of root finding methods
Author:
ISBN: 9783540778509 3540778500 3540778519 Year: 2008 Publisher: Berlin : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book sets out to state computationally verifiable initial conditions for predicting the immediate appearance of the guaranteed and fast convergence of iterative root finding methods. Attention is paid to iterative methods for simultaneous determination of polynomial zeros in the spirit of Smale's point estimation theory, introduced in 1986. Some basic concepts and Smale's theory for Newton's method, together with its modifications and higher-order methods, are presented in the first two chapters. The remaining chapters contain the recent author's results on initial conditions guaranteing convergence of a wide class of iterative methods for solving algebraic equations. These conditions are of practical interest since they depend only on available data, the information of a function whose zeros are sought and initial approximations. The convergence approach presented can be applied in designing a package for the simultaneous approximation of polynomial zeros.

Numerical methods for roots of polynomials.
Author:
ISBN: 1281052388 9786611052386 0080489478 044452729X Year: 2007 Volume: 14 Publisher: Amsterdam ; London : Elsevier,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton's, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent's method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled "A Handbook of Methods for Polynomial Root-finding?. This book will be invaluable to anyone doing rese


Book
Numerical methods for roots of polynomials.
Authors: ---
ISBN: 008093143X 0444527303 9780080931432 1299592457 9781299592452 9780444527301 Year: 2013 Publisher: Waltham, Mass. : Academic Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Numerical Methods for Roots of Polynomials - Part II along with Part I (9780444527295) covers most of the traditional methods for polynomial root-finding such as interpolation and methods due to Graeffe, Laguerre, and Jenkins and Traub. It includes many other methods and topics as well and has a chapter devoted to certain modern virtually optimal methods. Additionally, there are pointers to robust and efficient programs. This book is invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic. First comprehensive treatment of Root-

Abel's proof
Author:
ISBN: 0262281473 0585482667 0262338955 9780262281478 9780585482668 0262162164 9780262162166 0262661829 9780262661829 Year: 2003 Publisher: Cambridge, Mass. MIT Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

The intellectual and human story of a mathematical proof that transformed our ideas about mathematics.


Book
On the higher-order sheffer orthogonal polynomial sequences
Author:
ISSN: 21918189 ISBN: 1461459680 1461459699 1283945916 Year: 2013 Publisher: New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

On the Higher-Order Sheffer Orthogonal Polynomial Sequences sheds light on the existence/non-existence of B-Type 1 orthogonal polynomials. This book presents a template for analyzing potential orthogonal polynomial sequences including additional higher-order Sheffer classes. This text not only shows that there are no OPS for the special case the B-Type 1 class, but that there are no orthogonal polynomial sequences for the general B-Type 1 class as well. Moreover, it is quite provocative how the seemingly subtle transition from the B-Type 0 class to the B-Type 1 class leads to a drastically more difficult characterization problem. Despite this issue, a procedure is established that yields a definite answer to our current characterization problem, which can also be extended to various other characterization problems as well. Accessible to undergraduate students in the mathematical sciences and related fields, This book functions as an important reference work regarding the Sheffer sequences. The author takes advantage of Mathematica 7 to display unique detailed code and increase the reader's understanding of the implementation of Mathematica 7 and facilitate further experimentation. In addition, this book provides an excellent example of how packages like Mathematica 7 can be used to derive rigorous mathematical results.

Listing 1 - 5 of 5
Sort by