2004Journal of Zhongkai Agrotechnical CollegeRequires access

An generalized Newton iterative method for extracting the roots of a category equation

Feng Da-chun

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Newton's method, Convergence (economics), Mathematics, Local convergence, Iterative method, Newton's method in optimization, Applied mathematics, Order (exchange)

Related papers

Back to paper searchBrowse research topicsOriginal source
An generalized Newton iterative method for extracting the roots of a category equation — Research Paper | ScholarLens