Additional Information
| Author(s) | Ardelean, Gheorghe |
|---|
Proving the convergence of the iterative methods by using symbolic computation in Maple
Gheorghe Ardelean
Abstract
carpathian_2012_28_1_001_008_abstractThe 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.
Recently posted
-
Operational almost periodic alpha unpredictability
-
Finite-Time H∞ Control for Conformable Fractional-Order Nonlinear Systems with Time Delays
-
Gallai’s property for Archimedean tiling graphs on the torus
-
Two geometric constants of normed spaces related to new characterizations of inner product spaces
-
Weak and strong convergence of multi-inertial forward-backward-forward methods for solving monotone inclusions
-
Solving Certain Classes of Variational Inclusion Problems Using Linearized Splitting Algorithms with Applications
-
The Stinespring-Wittstock theory for variable exponential completely bounded maps
-
On Stability of Two New Generalized Set-Valued Functional Equations
-
The Solodov–Svaiter type proximal point algorithm on a complete geodesic space
-
Iterative criteria for oscillation of third-order linear delay dynamic equations