Circular arithmetic and the determination of polynomial zeros

DOI10.1007/BF01404681zbMath0228.65038OpenAlexW2019656110MaRDI QIDQ2549925

Irene Gargantini, Peter Henrici

Publication date: 1972

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132111

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (only showing first 100 items - show all)

Laguerre-like inclusion method for polynomial zeros ⋮ Scaled parallel iterative method for finding real roots of nonlinear equations ⋮ Improved methods for the simultaneous inclusion of multiple polynomial zeros ⋮ On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane ⋮ An effective method for division of rectangular intervals ⋮ Arithmetic for closed balls ⋮ Multi-step root solvers of Traub's type in real interval arithmetic ⋮ On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step ⋮ Error-bounds for zeroes of polynomials using complex circular arithmetic ⋮ Inclusion isotonicity of circular complex centered forms ⋮ On a modification of the Koenig theorem ⋮ Some interval iterations for finding a zero of a polynomial with error bounds ⋮ The simultaneous determination of all zeros of a polynomial ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ Modified Newton method in circular interval arithmetic ⋮ Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros ⋮ Bounds for the range of a complex polynomial over a rectangular region ⋮ On the k-th root in circular arithmetic ⋮ Complex sector arithmetic ⋮ On some simultaneous methods based on Weierstrass' correction ⋮ On initial conditions for the convergence of simultaneous root finding methods ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ Multiplying disks: Robust stability of a cascade connection ⋮ Disk Bézier curves ⋮ Point estimation and some applications to iterative methods ⋮ A note on the inclusion isotonicity for meromorphic forms ⋮ The range of values of a circular complex polynomial over a circular complex interval ⋮ The Root Separation of Polynomials and Some Applications ⋮ Parallel square-root iterations for multiple roots ⋮ Tight coefficients of averaged operators via scaled relative graph ⋮ Enclosing clusters of zeros of polynomials ⋮ Ten methods to bound multiple roots of polynomials ⋮ Existence and uniqueness of inclusion isotonic centered ball extensions ⋮ On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic ⋮ On the efficiency of some combined methods for polynomial complex zeros ⋮ New higher-order methods for the simultaneous inclusion of polynomial zeros ⋮ The circular complex centered form ⋮ Die Auflösbarkeit linearer Kreisscheiben- und Intervall-Gleichungssysteme ⋮ On an iterative method for simultaneous inclusion of polynomial complex zeros ⋮ Fast interval matrix multiplication ⋮ Normbälle in der Intervallrechnung ⋮ A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ On an efficient inclusion method for finding polynomial zeros ⋮ Higher-order iterative methods for approximating zeros of analytic functions ⋮ Komplexe Kreisarithmetik ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Methods with corrections for the simultaneous inclusion of polynomial zeros ⋮ Circular centered forms for rational functions in several complex variables ⋮ A family of root-finding methods with accelerated convergence ⋮ A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial ⋮ Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra ⋮ Efficient methods for the inclusion of polynomial zeros ⋮ Weierstrass-like methods with corrections for the inclusion of polynomial zeros ⋮ Derivative free inclusion methods for polynomial zeros ⋮ A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic ⋮ Arithmetiken für komplexe Kreise ⋮ Eine Methode zur Nullstellenbestimmung von Funktionen ⋮ A new higher-order family of inclusion zero-finding methods ⋮ An iteration formula for the simultaneous determination of the zeros of a polynomial ⋮ On the improved Newton-like methods for the inclusion of polynomial zeros ⋮ Solution of elementary equations in the Minkowski geometric algebra of complex sets ⋮ On the computation of the Galois group over the quotient field of \(\mathbb{C}[\lambda\)] ⋮ An algorithm for the total, or partial, factorization of a polynomial ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ Inclusion isotonicity for circular centered forms in several complex variables ⋮ Comparing parallel Newton's method with parallel Laguerre's method ⋮ An estimation of algebraic solution for a complex interval linear system ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ The numerical stability of simultaneous iterations via square-rooting ⋮ The range of values of a complex polynomial over a complex interval ⋮ Point estimation of a family of simultaneous zero-finding methods ⋮ Complexity analysis of a process for simultaneously obtaining all zeros of polynomials ⋮ Forms for meromorphic functions ⋮ Schröder-like algorithms for multiple complex zeros of a polynomial ⋮ Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic ⋮ A hybrid method for polynomial complex zero ⋮ Rational circular complex centered forms ⋮ On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros ⋮ The self-validated method for polynomial zeros of high efficiency ⋮ Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen ⋮ A note on the circular complex centered form ⋮ The sign matrix and the separation of matrix eigenvalues ⋮ A circular splitting search algorithm for systems of complex equations ⋮ On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros ⋮ On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step ⋮ Improved Halley-like methods for the inclusion of polynomial zeros ⋮ On the convergence order of accelerated root iterations ⋮ The numerical stability of the generalised root iterations for polynomial zeros ⋮ Including iterations for the Lambda-matrix eigenproblem ⋮ A family of simultaneous methods for the determination of polynomial complex zeros ⋮ On an efficient simultaneous method for finding polynomial zeros ⋮ Some decidable results on reachability of solvable systems ⋮ On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic ⋮ An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction ⋮ On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros ⋮ Some modifications of the parallel Halley iteration method and their convergence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die Notwendigkeit einer Fehlerschranken-Arithmetik für Rechenautomaten
• A Machine Method for Solving Polynomial Equations
• Finding zeros of a polynomial by the Q-D algorithm
• Complex interval arithmetic
• Methods of Search for Solving Polynomial Equations
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Periodic Sigma Functions

This page was built for publication: Circular arithmetic and the determination of polynomial zeros