A modification of Muller's method
From MaRDI portal
Recommendations
Cites work
- A new iterative method for the computation of the solutions of nonlinear equations
- Algorithm 748: enclosing zeros of continuous functions
- An iterative method for the computation of the solutions of nonlinear equations
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 3626500 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- scientific article; zbMATH DE number 3187178 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- On Enclosing Simple Roots of Nonlinear Equations
- Some efficient methods for enclosing simple zeros of nonlinear equations
Cited in
(20)- A study on new Muller's method
- A numerical algorithm to solve multivariate transcendental equation sets in complex domain and its application in wave dispersion curve characterization
- Superlinear bracketing method for solving nonlinear equations
- On Mill's method of concomitant variations
- A subspace expanding technique for global zero finding of multi-degree-of-freedom nonlinear systems
- scientific article; zbMATH DE number 4172696 (Why is no real title available?)
- An improvement method of Muller method
- scientific article; zbMATH DE number 4068222 (Why is no real title available?)
- scientific article; zbMATH DE number 37937 (Why is no real title available?)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- scientific article; zbMATH DE number 1241067 (Why is no real title available?)
- scientific article; zbMATH DE number 474584 (Why is no real title available?)
- scientific article; zbMATH DE number 6845491 (Why is no real title available?)
- A New Approach of Box-Müller Method
- A modified quadratic interpolation method for root finding
- Combined bracketing methods for solving nonlinear equations
- The upper-crossing/solution (US) algorithm with strongly stable convergence and an acceleration technique for root-finding problems
- A modified Muller routine for finding the zeroes of a non-analytic complex function
- Convergence ball and error analysis of Muller's method
- A generalization of Müller's iteration method based on standard information
This page was built for publication: A modification of Muller's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879743)