Proving the convergence of the iterative methods by using symbolic computation in Maple
Gheorghe Ardelean
Abstract
Open-access reader
Gheorghe Ardelean
Abstract
Open-access reader
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
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