scientific article; zbMATH DE number 3195683
From MaRDI portal
Publication:5732060
Cited in
(only showing first 100 items - show all)- Three-step iterative methods with eighth-order convergence for solving nonlinear equations
- Convergence ball and error analysis of a family of iterative methods with cubic convergence
- Accelerating the convergence of the EM algorithm using the vector algorithm
- Improved Newton's method without direct function evaluations
- Fourth-order iterations for solving Hammerstein integral equations
- On a class of Newton-like methods for solving nonlinear equations
- Some modifications of Newton's method with higher-order convergence for solving nonlinear equations
- Some sixth order zero-finding variants of Chebyshev-Halley methods
- Adams-like techniques for zero-finder methods
- A third-order modification of Newton's method for multiple roots
- A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations
- A remark on He's variational iteration technique for solving nonlinear equations
- Convergence criterion and convergence ball of the Newton-type method in Banach space
- Variational iteration technique for solving nonlinear equations
- Some second-derivative-free variants of Halley's method for multiple roots
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- New variants of Jarratt's method with sixth-order convergence
- Zero-finder methods derived from Obreshkov's techniques
- Iterative root approximation in \(p\)-adic numerical analysis
- Optimal transformations for scalar sequences
- Fifth order implicit multipoint method for solving equations
- On the R-order of some recurrences with applications to inclusion- methods
- On the monotone convergence of Newton's method
- SEM approach to transient scattering by a lossy, radially inhomogeneous dielectric circular cylinder
- Rectified approximations for the solution of nonlinear equations
- On the zeros of Flett's function
- Locating multiple zeros interactively
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
- On the R-order of some recurrences with applications to inclusion- methods. II
- The local evaluation of the derivative of a determinant
- Bounds for the R-order of certain iterative numerical processes
- Integration methods for solving equations
- Derivative free multipoint iterative methods for simple and multiple roots
- Optimal solution of nonlinear equations
- Some parallel methods for polynomial root-finding
- Complexity of fixed points. I
- Application of iteration functions to elliptic partial differential equations
- Parallel Newton methods for the nonlinear complementarity problem
- A class of root finding methods
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- An automatic search procedure for finding real zeros
- Über ein Verfahren der Ordnung \(1+\sqrt 2\) zur Nullstellenbestimmung
- On the convergence of some methods for determining zeros of order-convex operators
- Root-finding by divided differences
- Steplength algorithms for minimizing a class of nondifferentiable functions
- Maximal order for quadratures using n evaluations
- Optimal radius of convergence of interpolatory iterations for operator equations
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- On Newton's method with a class of rational functions
- A note on King's fifth-order family of methods for solving equations
- Parallel algorithms for solving systems of nonlinear equations
- On a nonlinear iterative method in applied mechanics. I
- Some supplementary results on the 1+ 2 order method for the solution of nonlinear equations
- Sixth order methods for solving equations
- Efficient algorithms for the inclusion of the inverse matrix using error- bounds for hyperpower methods
- Solving Kepler's equation with high efficiency and accuracy
- A solution to the generalized problem of nonlinear map inversion
- Ostrowski-Traub nonlinear iterative methods are not optimal in the sense of \(S\)-order of convergence
- An iterative method of global convergence without derivatives in the class of smooth functions
- On two sequences of algorithms for approximating square roots
- Multiple root-finding methods
- Note on the estimation of the order of convergence of some iterative methods
- Optimal rational starting approximations
- A method for computing a root of a single nonlinear equation, including its multiplicity
- Model-independent prediction methods in pharmacokinetics: Theoretical considerations
- On a Newton-Moser type method
- On the global convergence of Halley's iteration formula
- An integral-interpolation iterative method for the solution of scalar equations
- A survey of techniques in applied computational complexity
- Numerical stability for solving nonlinear equations
- A new approach to the determination of several eigenvectors of a large Hermitian matrix
- Sui procedimenti iterativi composti
- A family of root finding methods
- The convergence order for iterative multipoint procedures
- Rates of convergence of a one-dimensional search based on interpolating polynomials
- Comparing parallel Newton's method with parallel Laguerre's method
- Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
- Extended iterative methods for the solution of operator equations
- Una variazione del metodo di Halley
- A Fortran program for solving a nonlinear equation by Muller's method
- On the construction of Gauss-Legendre quadrature rules
- Multipoint iterative parallel methods for solving equations
- Un metodo iterativo non stazionario per la risoluzione di equazioni algebriche
- Computational complexity of one-step methods for a scalar autonomous differential equation
- On a family of parallel root-finding methods for generalized polynomials
- nth root extraction: Double iteration process and Newton's method
- Avoiding the computation of the second Fréchet-derivative in the convex acceleration of Newton's method
- On rediscovered iteration methods for solving equations
- Measuring rates of convergence of numerical algorithms
- Exact order of convergence of the secant method
- A local convergence theorem for the super-Halley method in a Banach space
- Extrapolation of numerical solutions for elliptic problems on corner domains
- A new computational method for the functional inequality constrained minimax optimization problem
- Approximation of the roots of equations by Aitken-Steffensen-type monotonic sequences
- A basic family of iteration functions for polynomial root finding and its characterizations
- Comparison theorems for a third order method
- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
- Relaxing convergence conditions for an inverse-free Jarratt-type approximation
- Convergence rate of the augmented Lagrangian SQP method
- On the rate of convergence of 2-term recursions in \(\mathbb{R}^ d\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5732060)