Results 11 to 20 of about 333,767 (302)
Convergence and Dynamics of a Higher-Order Method [PDF]
Symmetry, 2020 Solving problems in various disciplines such as biology, chemistry, economics, medicine, physics, and engineering, to mention a few, reduces to solving an equation. Its solution is one of the greatest challenges. It involves some iterative method generating a sequence approximating the solution.
Alejandro Moysi +5 more
openaire +6 more sources
The order convergence structure [PDF]
Indagationes Mathematicae, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan Harm van der Walt +1 more
openaire +2 more sources
Δm-deferred statistical convergence of order α [PDF]
Filomat, 2016 In this paper, we introduce the concepts of ?m-deferred statistical convergence of order ? and strong ?mr-deferred Ces?ro summability of order ? of real sequences. Additionally, some inclusion relations about ?m-deferred statistical convergence of order ? and strong ?mr-deferred Ces?ro summability of order ? are given.
Temizsu, F. +2 more
openaire +5 more sources
Local convergence for multi-point-parametric Chebyshev-Halley-type methods of high convergence order [PDF]
, 2015 We present a local convergence analysis for general multi-point-Chebyshev-Halley-type methods (MMCHTM) of high convergence order in order to approximate a solution of an equation in a Banach space setting.
George, Santhosh +2 more
core +1 more source
New Iterative Methods for Solving Nonlinear Problems with One and Several Unknowns
Mathematics, 2018 In this manuscript, a new type of study regarding the iterative methods for solving nonlinear models is presented. The goal of this work is to design a new fourth-order optimal family of two-step iterative schemes, with the flexibility through weight ...
Ramandeep Behl +3 more
doaj +1 more source
The Sinkhorn-Knopp algorithm : convergence and applications [PDF]
, 2008 As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Knight, P.A.
core +1 more source
Statistical convergence in vector lattices
Қарағанды университетінің хабаршысы. Математика сериясы, 2023 The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence in vector lattices by using the finite additive measures on directed sets ...
A. Aydın, F. Temizsu
doaj +1 more source
Order convergence and topological convergence [PDF]
Proceedings of the American Mathematical Society, 1965 In a complete lattice it is possible to define a notion of convergence (for arbitrary nets) known as order convergence (o-convergence) ; for definitions see [l,p.5°]and [3, p. 65]. As a general rule o-convergence is not a topological convergence; i.e., the lattice cannot be topologized so that nets o-converge if and only if they converge with respect ...
openaire +2 more sources
Convergence Rate for the Ordered Upwind Method [PDF]
Journal of Scientific Computing, 2016 The Ordered Upwind Method (OUM) is used to approximate the viscosity solution of the static Hamilton-Jacobi-Bellman (HJB) with direction-dependent weights on unstructured meshes. The method has been previously shown to provide a solution that converges to the exact solution, but no convergence rate has been theoretically proven.
Alex Shum +2 more
openaire +4 more sources
Математичні Студії, 2021 In the earlier work, expensive Taylor formula and conditions on derivatives up to the eighth order have been utilized to establish the convergence of a derivative free class of seventh order iterative algorithms.
I.K. Argyros +5 more
doaj +1 more source