Numerical stability for solving nonlinear equations
From MaRDI portal
Cited in
(22)- Hyman's method revisited
- Derivative free multipoint iterative methods for simple and multiple roots
- An approach to backward analysis for linear and nonlinear iterative methods
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- An error analysis for the secant method
- Numerical stability of the Chebyshev method for the solution of large linear systems
- Why does information-based complexity use the real number model?
- How to minimize the cost of iterative methods in the presence of perturbations
- The theory of Newton's method
- Real computations with fake numbers
- On developing a stable and quadratic convergent method for solving absolute value equation
- The asymptotic distribution of the condition number for random circulant matrices
- Probabilistic sentence satisfiability: an approach to PSAT
- On the condition of the zeros of characteristic polynomials
- A secant method for multiple roots
- Three new algorithms based on the sequential secant method
- The Condition Number of Riemannian Approximation Problems
- The stability of gradient-like methods
- Smoothing the absolute value equations by the component-wise analysis
- Solving the linear least squares problem with very high relative accuracy
- \textit{A priori} analysis of reduced description of dynamical systems using approximate inertial manifolds
- An improved method for finding multiple roots and it's multiplicity of nonlinear equations in \(\mathbb R\)
This page was built for publication: Numerical stability for solving nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230355)
