Why using symbolic computation for proving the convergence of iterative methods?

MaRDI QIDQ2937247zbMATH OpenFDO

Authors Laszlo Balog, Gheorghe Ardelean

Publication date 8 January 2015

zbMATH Keywords

iterative methodsnonlinear equationsNewton's methodorder of convergencesymbolic computationerror of convergence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05)

Recommendations

• Using symbolic computation in Mathematica for verifying the convergence of the iterative methods
• Proving the convergence of the iterative methods by using symbolic computation in Maple
• Modifications of higher-order convergence for solving nonlinear equations
• A note on ``Some higher-order modifications of Newton's method for solving nonlinear equations
• Some modifications of Newton's method with higher-order convergence for solving nonlinear equations

Cited in

(3)

• Why does the F_N-method work?
• Using symbolic computation in Mathematica for verifying the convergence of the iterative methods
• Proving the convergence of the iterative methods by using symbolic computation in Maple

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Why using symbolic computation for proving the convergence of iterative methods?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937247)