A new high order method of regula falsi type for computing a root of an equation

From MaRDI portal
Publication:5679626

DOI10.1007/BF01951936zbMath0263.65054OpenAlexW2060959271MaRDI QIDQ5679626

Åke Björck, Ned Anderson

Publication date: 1973

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01951936




Related Items (23)

Unnamed ItemA finite element based level set method for two-phase incompressible flowsOn a class of omnibus algorithms for zero-findingA Kantorovich-type analysis for a fast iterative method for solving nonlinear equationsOn an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the rootEfficient polynomial root-refiners: a survey and new record efficiency estimatesA note on King's method F for finding a bracketed rootAn improved pegasus method for root findingDeriving priorities from inconsistent PCM using network algorithmsSeveral new methods for solving equationsA new iterative method of asymptotic order 1+√2 for the computation of fixed pointsImproved bracketing parabolic method for numerical solution of nonlinear equationsOn Enclosing Simple Roots of Nonlinear EquationsA numerical method for an approximate minimax estimator in linear regressionOn a two-point Newton-like method of convergent order twoA method to accelerate the convergence of the secant algorithmOn the structure of zero findersA secant method for multiple rootsA comparison of non-linear equation solversMethods without secant steps for finding a bracketed rootOn a family of multipoint methods for non-linear equationsA common framework for modified regula falsi methods and new methods of this kind


Uses Software


Cites Work


This page was built for publication: A new high order method of regula falsi type for computing a root of an equation