scientific article; zbMATH DE number 7583430
From MaRDI portal
Publication:5104114
zbMath1505.65198MaRDI QIDQ5104114
Publication date: 9 September 2022
Full work available at URL: http://gaceta.rsme.es/abrir.php?id=1622
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Numerical methods for roots of polynomials. Part I
- A class of two-step Steffensen type methods with fourth-order convergence
- Modifications of the interval-Newton-method with improved asymptotic efficiency
- A modified Brent's method for finding zeros of functions
- On Schröder's families of root-finding methods
- Introduction to Numerical Analysis
- Algorithm 748: enclosing zeros of continuous functions
- Optimal Order of One-Point and Multipoint Iteration
- A family of two-point methods with memory for solving nonlinear equations
- A Graduate Introduction to Numerical Methods
- An algorithm with guaranteed convergence for finding a zero of a function
- Revisiting Gilbert Strang's "a chaotic search for i "
- An acceleration of Newton's method: Super-Halley method
This page was built for publication:
