Buscar
Mostrando ítems 11-20 de 33
Iterative methods and their dynamics with applications: A contemporary study
(CRC Press, 2017)
Iterative processes are the tools used to generate sequences approximating solutions of equations describing real life problems. Intended for researchers in computational sciences and as a reference book for advanced ...
Sixth-order iterative methods
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
We develop sixth-order iterative methods in order to approximate zeros x of the function f defined on the real line. This method can be used to solve many 64problems from computational sciences and other disciplines ...
King-Werner-type methods of order 1 + √2
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
Iterative methods are used to generate a sequence of approximating a solution x of the nonlinear equation F(x) = 0, (10.1) where F is Fréchet-differentiable operator defined on a convex subset D of a Banach space X with ...
Expanding the applicability of the gauss-newton method for convex optimization under restricted convergence domains and majorant conditions
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
n this chapter we are concerned with the convex composite optimizations problem. This work is mainly motivated by the work in [17,23].We present a convergence analysis of Gauss-Newton method (defined by Algorithm (GNA) in ...
Ball convergence for eighth order method
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
Consider the problem of approximating a locally unique solution x of the nonlinear equation F(x) = 0, (21.1) where F is a Fréchet-differentiable operator defined on a convex subset D of a Banach space X with values in a ...
Inexact gauss-newton method for least square problems
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
In this chapter we are interested in locating a solution x of the nonlinear least squares problem: minG(x) := 1/2 F(x)TF(x), (8.1) where F is Fréchet-differentiable defined on ℝn with values in ℝm, m ≥ n.
Generalized newton method with applications
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
In this chapter we are interested in the approximately solving the generalized equation: Find x ∈ H such that 0 ∈ F(x) + T(x). (16.1) where F : H → H is a Fr→chet differentiable function, H is a Hilbert space and T : H ⇉ ...
Iterative algorithms II
(Nova Science Publishers, 2016-01)
The study of iterative methods began several years ago in order to find the solutions of problems where mathematicians cannot find a solution in closed form. In this way, different studies related to different methods with ...
Müller’s method
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
In this chapter we are concerned with approximating a solution of the equation f(x) = 0, (15.1) where f is defined on an open domain or closed domain D on a real space ℝ.
Directional newton methods and restricted domains
(Iterative Methods and Their Dynamics with Applications: A Contemporary Study, 2017)
Let F : D ⊂ ℝn → ℝ be a differentiable function. In computer graphics, we often need to compute and display the intersection C = A ⋂ B of two surfaces A and B in ℝ3 [5], [6]. If the two surfaces are explicitly given by A ...