Pages that link to "Item:Q2505645"
From MaRDI portal
The following pages link to On location and approximation of clusters of zeros of analytic functions (Q2505645):
Displaying 28 items.
- Efficient hybrid-symbolic methods for quantum mechanical calculations (Q311842) (← links)
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one (Q385011) (← links)
- Direct computation of elliptic singularities across anisotropic, multi-material edges (Q549450) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Verified error bounds for singular solutions of nonlinear systems (Q747729) (← links)
- General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- A new deflation method for verifying the isolated singular zeros of polynomial systems (Q1987424) (← links)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Numerical approximation of multiple isolated roots of analytical systems (Q2211505) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
- On the probability distribution of singular varieties of given corank (Q2457405) (← links)
- Newton's method with deflation for isolated singularities of polynomial systems (Q2503291) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- A certified iterative method for isolated singular roots (Q2674007) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
- On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
- Two-step Newton's method for deflation-one singular zeros of analytic systems (Q6149147) (← links)
- Rounding error analysis of linear recurrences using generating series (Q6163326) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
