Results 71 to 80 of about 7,885 (185)
Modified Quaternion Newton Methods [PDF]
, 2014 We revisit the quaternion Newton method for computing roots of a class of quaternion valued functions and propose modified algorithms for finding multiple roots of simple polynomials. We illustrate the performance of these new methods by presenting several numerical experiments.
Fernando Miranda, M. Irene Falcão
openaire +2 more sources
Third-order modification of Newton's method
, 2007 In this paper, we present a new modification of Newton's method for solving non-linear equations. Analysis of convergence shows that the new method is cubically convergent. Numerical examples show that the new method can compete with the classical Newton'
Xiuhua, Wang, Jisheng, Kou, Yitian, Li
core +1 more source
Stability Analysis of Jacobian-Free Newton’s Iterative Method
Algorithms, 2019 It is well known that scalar iterative methods with derivatives are highly more stable than their derivative-free partners, understanding the term stability as a measure of the wideness of the set of converging initial estimations.
Abdolreza Amiri +3 more
doaj +1 more source
Newton’s method and FFT trading
Journal of Symbolic Computation, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
, 2011 Explore Newton's method of root finding for several functions. Use the zoom slider to see more detail at three different levels of zoomComponente Curricular::Educação Superior::Ciências Exatas e da Terra ...
Maes, Chris
core +1 more source
On the Distance to a Root of Polynomials
Abstract and Applied Analysis, 2011 In 2002, Dierk Schleicher gave an explicit estimate of an upper bound for the number of iterations of Newton's method it takes to find all roots of polynomials with prescribed precision. In this paper, we provide a method to improve the upper bound given
Somjate Chaiya
doaj +1 more source
On maximizing a concave function subject to linear constraints by Newton's method [PDF]
, 1968 summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming problems. The adaptation is derived by replacing the gradient direction in Rosen's method by Newton's direction and both its convergence and practical aspects
Žáčková, Jitka
core +1 more source
, 2016 This Demonstration illustrates geometrically Newton's method for approximating roots. The available functions illustrate places where Newton's method yields interesting behaviorComponente Curricular::Educação Superior::Ciências Exatas e da Terra ...
Sharp, Angela +2 more
core
Newton's method under mild differentiability conditions
, 1970 We study Newton's method for determining the solution of f(x) = 0 when f(x) is required only to be continuous and piecewise continuously differentiable in some sphere about the initial iterate, x^(0).
Keller, Herbert B., Herbert B. Keller
core +1 more source
Newton’s Method for the Matrix Nonsingular Square Root
Journal of Applied Mathematics, 2014 Two new algorithms are proposed to compute the nonsingular square root of a matrix A. Convergence theorems and stability analysis for these new algorithms are given. Numerical results show that these new algorithms are feasible and effective.
Chun-Mei Li, Shu-Qian Shen
doaj +1 more source