Results 21 to 30 of about 331,846 (302)
Higher-Order Multiplicative Derivative Iterative Scheme to Solve the Nonlinear Problems
Grossman and Katz (five decades ago) suggested a new definition of differential and integral calculus which utilizes the multiplicative and division operator as compared to addition and subtraction.
Gurjeet Singh +2 more
doaj +1 more source
Convergence order of one regularization method
The multiscale solution of the Klein‐Gordon equations in the linear theory of (two‐phase) materials with microstructure is defined by using a family of wavelets based on the harmonic wavelets.
S. Guseinov, I. Volodko
doaj +1 more source
The Sinkhorn-Knopp algorithm : convergence and applications [PDF]
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
New Iterative Methods for Solving Nonlinear Problems with One and Several Unknowns
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
Statistical convergence in vector lattices
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]
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]
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
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
About Convergence and Order of Convergence of some Fractional Derivatives
Fil: Roscani, Sabrina Dina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
Roscani, Sabrina Dina +1 more
openaire +3 more sources
On (Δm,I)-Statistical Convergence of Order α
The idea of I-convergence of real sequences was introduced by Kostyrko et al., (2000/01) and also independently by Nuray and Ruckle (2000). In this paper, we introduce the concepts of (Δm,I)-statistical convergence of order α and strong (Δpm,I)-Cesàro ...
Mikail Et +2 more
doaj +1 more source

