Results 41 to 50 of about 4,814 (186)

Global dynamics of the real secant method

, 2021
We investigate the root finding algorithm given by the secant method applied to a real polynomial p as a discrete dynamical system defined on R2. We study the shape and distribution of the basins of attraction associated to the roots of p, and we also ...
Jarque i Ribera, Xavier, Garijo, Antoni
core  

The Convergence Ball and Error Analysis of the Relaxed Secant Method

Advances in Mathematical Physics, 2017
A relaxed secant method is proposed. Radius estimate of the convergence ball of the relaxed secant method is attained for the nonlinear equation systems with Lipschitz continuous divided differences of first order.
Rongfei Lin, Qingbiao Wu, Minhong Chen, Lu Liu   +3 more
doaj   +1 more source

Modelling and solvability of a class steady-state metal-forming problems

Nonlinear Engineering, 2014
For a class of steady-state metal-forming problems, with rigid-plastic, incompressible, strain-rate dependent material model and with unilateral contact and nonlocal Coulomb’s frictional boundary conditions, a variational inequality formulation ...
Angelov T. A.
doaj   +1 more source

A NEW ROOT–FINDING ALGORITHM USING EXPONENTIAL SERIES

Ural Mathematical Journal, 2019
In this paper, we present a new root-finding algorithm to compute a non-zero real root of the transcendental equations using exponential series. Indeed, the new proposed algorithm is based on the exponential series and in which Secant method is special ...
Srinivasarao Thota
doaj   +1 more source

Secant root finding method

, 2011
Cubic polynomial, Newton's MethodSteps of the secant root finding method for a cubic polynomial. The secant method for numerical root finding of the functions f consists of the steps xk+1= xk – f(xk)(xk-xk-1)/(f(xk)
Trott, Michael
core   +1 more source

A modified secant method for unconstrained minimization [PDF]

Mathematical Programming, 1974
This paper presents a new globally convergent secant method for unconstrained optimization. The root rate of convergence of this algorithm is superlinear, between 1 and 2, decreasing with dimension of the problem. It is shown that on a class of problems, it is substantially more efficient than a number of other algorithms.
openaire   +2 more sources

Secant root finding method

, 2016
Cubic polynomial, Newton's MethodSteps of the secant root finding method for a cubic polynomial. The secant method for numerical root finding of the functions f consists of the steps xk+1= xk – f(xk)(xk-xk-1)/(f(xk)
Trott, Michael
core   +1 more source

Extending the convergence domain of the Secant and Moser method in Banach Space

, 2015
We present a new semilocal convergence analysis for the Secant and the Moser method in order to approximate a solution of an equation in a Banach space setting.
Argyros, Ioannis K., Magreñán, Á. Alberto [0000-0002-6991-5706]   +1 more
core   +1 more source

PERBANDINGAN ANALISIS NUMERIK MENGGUNAKAN METODE SECANTDAN METODE ITERASI SATU TITIK UNTUK MENENTUKAN KOEFISIEN GESEK UDARA PADA KUBUS DAN SILINDRIS

Paedagoria, 2018
Abstrak: Koefisien gesek udara merupakan kemampuan udara untuk memberikan gesekan atau tahanan terhadap benda yang melaluinya, sehingga dapat memperlambat laju benda tersebut.Penelitian ini merupakan penelitian eksperimen laboratorium yang bertujuan ...
Linda Sekar Utami
doaj   +1 more source

A Simplified Algorithm for a Full-Rank Update Quasi-Newton Method

AppliedMath
An efficient linearization method for solving a system of nonlinear equations was developed, showing good stability and convergence properties. It uses an unconventional and simple strategy to improve the performance of classic methods by a full-rank ...
Peter Berzi
doaj   +1 more source