Pages that link to "Item:Q2549925"
From MaRDI portal
The following pages link to Circular arithmetic and the determination of polynomial zeros (Q2549925):
Displaying 50 items.
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros (Q1568729) (← links)
- Solution of elementary equations in the Minkowski geometric algebra of complex sets (Q1774025) (← links)
- An estimation of algebraic solution for a complex interval linear system (Q1797928) (← links)
- Point estimation of a family of simultaneous zero-finding methods (Q1806445) (← links)
- Rational circular complex centered forms (Q1819894) (← links)
- A note on the circular complex centered form (Q1836272) (← links)
- The sign matrix and the separation of matrix eigenvalues (Q1837261) (← links)
- Laguerre-like inclusion method for polynomial zeros (Q1872969) (← links)
- On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step (Q1888238) (← links)
- On a modification of the Koenig theorem (Q1893456) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
- On initial conditions for the convergence of simultaneous root finding methods (Q1924484) (← links)
- Multiplying disks: Robust stability of a cascade connection (Q1925137) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- An effective method for division of rectangular intervals (Q2132202) (← links)
- Tight coefficients of averaged operators via scaled relative graph (Q2190023) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- On an efficient simultaneous method for finding polynomial zeros (Q2345285) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- Weierstrass-like methods with corrections for the inclusion of polynomial zeros (Q2487207) (← links)
- Derivative free inclusion methods for polynomial zeros (Q2487208) (← links)
- Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen (Q2557101) (← links)
- A circular splitting search algorithm for systems of complex equations (Q2564286) (← links)
- On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step (Q2572333) (← links)
- Improved Halley-like methods for the inclusion of polynomial zeros (Q2572348) (← links)
- The simultaneous determination of all zeros of a polynomial (Q2641078) (← links)
- Bounds for the range of a complex polynomial over a rectangular region (Q2656078) (← links)
- Some decidable results on reachability of solvable systems (Q2871582) (← links)
- On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros (Q3147312) (← links)
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros (Q3423751) (← links)
- A note on the inclusion isotonicity for meromorphic forms (Q3493068) (← links)
- A family of simultaneous methods for the determination of polynomial complex zeros (Q3942315) (← links)
- Normbälle in der Intervallrechnung (Q4067985) (← links)
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial (Q4069691) (← links)
- Komplexe Kreisarithmetik (Q4092868) (← links)
- An algorithm for the total, or partial, factorization of a polynomial (Q4151651) (← links)
- Methods with corrections for the simultaneous inclusion of polynomial zeros (Q4378437) (← links)
- On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros (Q4467346) (← links)
- 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 (Q4652860) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)
- The Root Separation of Polynomials and Some Applications (Q4847523) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- Scaled parallel iterative method for finding real roots of nonlinear equations (Q5038158) (← links)
- Arithmetic for closed balls (Q5048910) (← links)
- On the improved Newton-like methods for the inclusion of polynomial zeros (Q5747715) (← links)
- A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic (Q5937194) (← links)
- Inclusion isotonicity for circular centered forms in several complex variables (Q5959133) (← links)
