ABSTRACT
An iterative method of solving an equation or system of equations as understood here is defined by a function f such that the sequence Xp+1 = f(Xp) converges to the solution x of the equation or system of equations, at least when xO is sufficiently close to x in some sense of the word. In the actual computation of f roundoff errors are normally introduced and one cannot expect the computed sequence to have x as its limit. Instead one will terminate the sequence with some x*, upon whose deviation from x one would like to place limits.
Index Terms
- Errors in iterative solutions of linear systems
Recommendations
Iterative and non-iterative methods for non-linear Volterra integro-differential equations
Iterative and non-iterative methods for the solution of nonlinear Volterra integro-differential equations are presented and their local convergence is proved. The iterative methods provide a sequence solution and make use of fixed-point theory, whereas ...
Monotone iterative solutions for nonlinear fractional differential systems with deviating arguments
Consider the nonlinear fractional differential systems with deviating arguments.Establish the existence result of solution.Introduce a numerical iterative scheme. By means of the monotone iterative technique, we consider the nonlinear fractional ...
Iterative approximation of solutions for semilinear parabolic equations system
In this paper we present the convergence analysis of iterative schemes for solving semilinear systems resulting from multidimensional semilinear second-order parabolic partial differential equations (PDEs) defined in a domain ℝn x ℝ+ and subject to ...
Comments