A high-order iterative formula for simultaneous determination of zeros of a polynomial

DOI10.1016/0377-0427(91)90184-LMaRDI QIDQ1184136zbMATH OpenFDO

Authors Tatsuo Torii, Tetsuya Sakurai, Hiroshi Sugiura

Publication date 28 June 1992

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmsnumerical resultsmultiple rootshigh convergence orderroot finding algorithmhigh-order iterative formulasingle-root methodzeros of a complex polynomialPadé approximation

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Recommendations

• The simultaneous determination of all zeros of a polynomial
• A high order iteration formula for the simultaneous inclusion of polynomial zeros
• Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
• scientific article; zbMATH DE number 60036
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros

Cites work

• scientific article; zbMATH DE number 3161517 (Why is no real title available?)
• scientific article; zbMATH DE number 3860295 (Why is no real title available?)
• scientific article; zbMATH DE number 3986507 (Why is no real title available?)
• scientific article; zbMATH DE number 3493262 (Why is no real title available?)
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• A class of iterative methods for holomorphic functions
• An iteration formula for the simultaneous determination of the zeros of a polynomial
• An iterative method for algebraic equation by Padé approximation
• Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Padé-type approximation and general orthogonal polynomials

Cited in

(19)

• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• A high order iteration formula for the simultaneous inclusion of polynomial zeros
• Construction of zero-finding methods by Weierstrass functions
• An efficient higher order family of root finders
• The convergence of a family of parallel zero-finding methods
• Families of high-order simultaneous methods with several corrections
• On new higher order families of simultaneous methods for finding polynomial zeros
• Simultaneous factorization of a polynomial by rational approximation
• Numerical factorization of a polynomial by rational Hermite interpolation
• A method for finding zeros of polynomial equations using a contour integral based eigensolver
• A class of simultaneous methods for the zeros of analytic functions
• A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
• ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
• On some simultaneous methods based on Weierstrass' correction
• Family of simultaneous methods of Hansen--Patrick's type
• A family of simultaneous zero-finding methods
• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
• A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence

This page was built for publication: A high-order iterative formula for simultaneous determination of zeros of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184136)