Pages that link to "Item:Q3721699"
From MaRDI portal
The following pages link to On the efficiency of algorithms of analysis (Q3721699):
Displaying 50 items.
- Further analysis of the remedian algorithm (Q391134) (← links)
- On optimal fourth-order iterative methods free from second derivative and their dynamics (Q422886) (← links)
- Stability study of eighth-order iterative methods for solving nonlinear equations (Q491050) (← links)
- Invertibility of sparse non-Hermitian matrices (Q520368) (← links)
- Smale's mean value conjecture for finite Blaschke products (Q525417) (← links)
- A new proof of inequality for continuous linear functionals (Q535495) (← links)
- Efficiency of linked cell algorithms (Q538540) (← links)
- Topological complexity of a root finding algorithm (Q582007) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- An upper bound on the smallest singular value of a square random matrix (Q722769) (← links)
- Probabilistic analysis of numerical methods for integral equations (Q808674) (← links)
- Dynamics of a new family of iterative processes for quadratic polynomials (Q847253) (← links)
- Dynamical aspects of some convex acceleration methods as purely iterative algorithm for Newton's maps (Q903036) (← links)
- Solving the quintic by iteration (Q918135) (← links)
- Randomized Newton-Raphson (Q922640) (← links)
- On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
- Stochastic perturbations and smooth condition numbers (Q964920) (← links)
- Random matrices: The distribution of the smallest singular values (Q987365) (← links)
- Methods with prefixed order for approximating square roots with global and general convergence (Q990680) (← links)
- Average case optimality (Q1071513) (← links)
- On the existence of generally convergent algorithms (Q1077876) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- Complexity of fixed points. I (Q1101185) (← links)
- Optimal quadratures with regard to the efficiency (Q1102702) (← links)
- Braiding of the attractor and the failure of iterative algorithms (Q1108637) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- A probabilistic theory for error estimation in automatic integration (Q1116644) (← links)
- Discrete versus continuous Newton's method: A case study (Q1118979) (← links)
- Newton's method and complex dynamical systems (Q1119771) (← links)
- Statistical complexity of the power method for Markov chains (Q1122306) (← links)
- On zero finding methods of higher order from data at one point (Q1122311) (← links)
- On the convergence of Newton's method (Q1122312) (← links)
- Condition numbers of random matrices (Q1179026) (← links)
- Corrections to ''Probabilistic analysis of numerical methods for integral equations'' (Q1182522) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- Statistical complexity of dominant eigenvector calculation (Q1186505) (← links)
- Families of rational maps and convergence basins of Newton's method (Q1201500) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- Convergence of the iteration of Halley's family and Smale operator class in Banach space (Q1267228) (← links)
- A global analysis of Newton iterations for determining turning points (Q1316221) (← links)
- Uniform convergence of higher order quasi Hermite-Fejér interpolation (Q1334101) (← links)
- Average errors for zero finding: Lower bounds for smooth or monotone functions (Q1339671) (← links)
- Local and global behavior for algorithms of solving equations (Q1428833) (← links)
- The theory of Newton's method (Q1593811) (← links)
- Newton's method for analytic systems of equations with constant rank derivatives (Q1599200) (← links)
- Extraneous fixed points of Euler iteration and corresponding Sullivan's basin (Q1609638) (← links)
