An generalized Newton iterative method for extracting the roots of a category equation
Feng Da-chun
Abstract
Feng Da-chun
Abstract
In order to get the λ repeated roots of equation f(x) = 0, where λ∈R~+ and the equation may be underivative, an generalized Newton iterative method was constructed with order 2 as its convergence. It is an improved general Newton method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to get the λ repeated roots of equation f(x) = 0, where λ∈R~+ and the equation may be underivative, an generalized Newton iterative method was constructed with order 2 as its convergence. It is an improved general Newton method.
Key concepts: Newton's method, Convergence (economics), Mathematics, Local convergence, Iterative method, Newton's method in optimization, Applied mathematics, Order (exchange)