Choosing Improved Initial Values for Polynomial Zerofinding in Extended Newbery Method to Obtain Convergence
In all polynomial zerofinding algorithms, a good convergence requires a very good initial approximation of the exact roots. The objective of the work is to study the conditions for determining the initial approximations for an iterative matrix zerofinding method. The investigation is based on the Ne...
Saved in:
Main Authors: | Saeid Saidanlu, Nor’aini Aris, Ali Abd Rahman |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/167927 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Identities between the Extended -Bernstein Polynomials with Weight and -Bernoulli Polynomials with Weight (,)
by: H. Y. Lee, et al.
Published: (2013-01-01) -
A convergent Deep Learning algorithm for approximation of polynomials
by: Després, Bruno
Published: (2023-09-01) -
Variational Iteration Method for Initial and Boundary Value Problems Using He's Polynomials
by: Syed Tauseef Mohyud-Din, et al.
Published: (2010-01-01) -
The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method
by: Mario Lázaro, et al.
Published: (2015-01-01) -
On the Sets of Convergence for Sequences of the 𝑞-Bernstein Polynomials with 𝑞>1
by: Sofiya Ostrovska, et al.
Published: (2012-01-01)