2012Carpathian Journal of MathematicsOpen access

Proving the convergence of the iterative methods by using symbolic computation in Maple

Gheorghe Ardelean

Open full text 2 citations

Abstract

The proofs of the convergence for some high-order methods for solving nonlinear equations, by using symbolic computation in Maple, is presented. Also, the convergence error for some Newton-type methods is evaluated by symbolic computation.

Open-access reader

About this research paper

What this paper is about

The proofs of the convergence for some high-order methods for solving nonlinear equations, by using symbolic computation in Maple, is presented. Also, the convergence error for some Newton-type methods is evaluated by symbolic computation.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

The proofs of the convergence for some high-order methods for solving nonlinear equations, by using symbolic computation in Maple, is presented. Also, the convergence error for some Newton-type methods is evaluated by symbolic computation.

Key concepts: Maple, Symbolic computation, Computation, Convergence (economics), Mathematical proof, The Symbolic, Nonlinear system, Newton's method

Related papers

Back to paper searchBrowse research topicsOriginal source
Proving the convergence of the iterative methods by using symbolic computation in Maple — Research Paper | ScholarLens