Pages that link to "Item:Q2576275"
From MaRDI portal
The following pages link to Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275):
Displaying 20 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- On the Wiener-Hopf factorization for Lévy processes with bounded positive jumps (Q432503) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Approximating the zeros of analytic functions by the exclusion algorithm (Q1316070) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
- Enclosing all zeros of a system of analytic functions (Q2008847) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- On mixed polynomials of bidegree \((n,1)\) (Q2357362) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- A modification of the numerical integration error method for the zero-finding problem of an analytic function (Q2583114) (← links)
- Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem (Q2656070) (← links)
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS (Q3533767) (← links)
- (Q4362786) (← links)
- (Q4427768) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- (Q4984904) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
