On approximating complex polynomial zeros Modified quadtree (Weyl's) construction and improved Newton's iteration

Ehrlich-type methods with king’s correction for the simultaneous approximation of polynomial complex zeros

Neves Machado, Roselaine
Lopes, Luiz Guerreiro

January 2019

There are many simultaneous iterative methods for approximating complex polynomial zeros, from more...

A computational test for the existence of polynomial zero

Petković, M.S.
Petković, L.D.

December 1989

AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...

Approximatng zeros of polynomials

Bera, Magdalena

Praca poświęcona jest problemowi znajdowania pierwiastków wielomianów zespolonych jednej zmiennej me...

Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration

Victor Y. Pan

January 1996

We propose a new algorithm for the classical and still practically important problem of approximatin...

Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration

Pan, Victor Y.

March 2000

AbstractWe propose a new algorithm for the classical and still practically important problem of appr...

Optimal and nearly optimal algorithms for approximating polynomial zeros

Pan, V.Y.

June 1996

AbstractWe substantially improve the known algorithms for approximating all the complex zeros of an ...

Solving zero-dimensional polynomial systems through the rational univariate representation

Rouillier, Fabrice
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1998

Theme 2 - Genie logiciel et calcul symbolique. Projet PolkaAvailable from INIST (FR), Document Suppl...

Iterative methods for simultaneous inclusion of polynomial zeros

Petković, Miodrag

January 1989

The simultaneous inclusion of polynomial complex zeros is a crucial problem in numerical analysis. R...

Fast algorithms for zero-dimensional polynomial systems using duality

Bostan, Alin
Salvy, Bruno
Schost, Eric
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 2001

Theme 2 - Genie logiciel et calcul symbolique - Projet AlgoSIGLEAvailable from INIST (FR), Document ...

An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm)

Nourein, A.W.

June 1977

AbstractIn a recent paper [2], Nourein derived an iteration formula, which exhibited cubic convergen...

Computing the Zeros of Polynomials using the Divide and Conquer Approach

Michael R Farmer

January 2013

This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...

Serie Research Memoranda Comments on Determining the Number of Zeros of a Complex Polynomial in a Half-Piane *

Faculteit Economische
R. Lm. Peeters

January 1991

vrije Universiteit amsterdam Comments on determining the number of zeros of a complex polynomial in ...

On iteration methods without derivatives for the simultaneous determination of polynomial zeros

Carstensen, Carsten
Petković, Miodrag S.

May 1993

AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...

Numerical computation of a polynomial GCD and extensions

Pan, Victor Y.
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 2 - Genie logiciel et calcul symbolique. Projet SAFIRSIGLEAvailable at INIST (FR), Document Su...

The self-validated method for polynomial zeros of high efficiency

Petković, Miodrag S.

December 2009

AbstractThe improved iterative method of Newton’s type for the simultaneous inclusion of all simple ...

Ehrlich-type methods with king’s correction for the simultaneous approximation of polynomial complex zeros

Neves Machado, Roselaine
Lopes, Luiz Guerreiro

January 2019

There are many simultaneous iterative methods for approximating complex polynomial zeros, from more...

A computational test for the existence of polynomial zero

Petković, M.S.
Petković, L.D.

December 1989

AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...

Approximatng zeros of polynomials

Bera, Magdalena

Praca poświęcona jest problemowi znajdowania pierwiastków wielomianów zespolonych jednej zmiennej me...

Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration

Victor Y. Pan

January 1996

We propose a new algorithm for the classical and still practically important problem of approximatin...

Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration

Pan, Victor Y.

March 2000

AbstractWe propose a new algorithm for the classical and still practically important problem of appr...

Optimal and nearly optimal algorithms for approximating polynomial zeros

Pan, V.Y.

June 1996

AbstractWe substantially improve the known algorithms for approximating all the complex zeros of an ...

Solving zero-dimensional polynomial systems through the rational univariate representation

Rouillier, Fabrice
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1998

Theme 2 - Genie logiciel et calcul symbolique. Projet PolkaAvailable from INIST (FR), Document Suppl...

Iterative methods for simultaneous inclusion of polynomial zeros

Petković, Miodrag

January 1989

The simultaneous inclusion of polynomial complex zeros is a crucial problem in numerical analysis. R...

Fast algorithms for zero-dimensional polynomial systems using duality

Bostan, Alin
Salvy, Bruno
Schost, Eric
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 2001

Theme 2 - Genie logiciel et calcul symbolique - Projet AlgoSIGLEAvailable from INIST (FR), Document ...

An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm)

Nourein, A.W.

June 1977

AbstractIn a recent paper [2], Nourein derived an iteration formula, which exhibited cubic convergen...

Computing the Zeros of Polynomials using the Divide and Conquer Approach

Michael R Farmer

January 2013

This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...

Serie Research Memoranda Comments on Determining the Number of Zeros of a Complex Polynomial in a Half-Piane *

Faculteit Economische
R. Lm. Peeters

January 1991

vrije Universiteit amsterdam Comments on determining the number of zeros of a complex polynomial in ...

On iteration methods without derivatives for the simultaneous determination of polynomial zeros

Carstensen, Carsten
Petković, Miodrag S.

May 1993

AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...

Numerical computation of a polynomial GCD and extensions

Pan, Victor Y.
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 2 - Genie logiciel et calcul symbolique. Projet SAFIRSIGLEAvailable at INIST (FR), Document Su...

The self-validated method for polynomial zeros of high efficiency

Petković, Miodrag S.

December 2009

AbstractThe improved iterative method of Newton’s type for the simultaneous inclusion of all simple ...

Ehrlich-type methods with king’s correction for the simultaneous approximation of polynomial complex zeros

Neves Machado, Roselaine
Lopes, Luiz Guerreiro

January 2019

There are many simultaneous iterative methods for approximating complex polynomial zeros, from more...

A computational test for the existence of polynomial zero

Petković, M.S.
Petković, L.D.

December 1989

AbstractUsing the Newton-like algorithm for finding a complex zero of a polynomial, presented by M. ...

Approximatng zeros of polynomials

Bera, Magdalena

Praca poświęcona jest problemowi znajdowania pierwiastków wielomianów zespolonych jednej zmiennej me...

On approximating complex polynomial zeros Modified quadtree (Weyl's) construction and improved Newton's iteration

Abstract

Extracted data

On approximating complex polynomial zeros Modified quadtree (Weyl's) construction and improved Newton's iteration

Abstract

Extracted data

Related items

Related items