Results 11 to 20 of about 9,925,195 (289)
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 +5 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
A two - grid, fourth order method for nonlinear fourth order boundary value problems [PDF]
, 1985 A fourth order convergent finite difference method is developed for the numerical solution of the nonlinear fourth order boundary value problem y(iv)(x) = f(x,y ...
Twizell, E H
core +6 more sources
Order convergence and convergence almost everywhere revisited [PDF]
, 2010 In Analysis two modes of non-topological convergence are interesting: order convergence and convergence almost everywhere. It is proved here that oder convergence of sequences can be induced by a limit structure, even a finest one, whenever it is considered in sigma-distributive lattices.
Preuß, Gerhard
openaire +2 more sources
AIP Conference ProceedingsA Riesz space or a vector lattice E is a partially ordered linear space that is also a lattice. Order convergence in a Riesz space will be defined and it will be shown that given a solid linear subspace X1 of a Riesz space X, a sequence {xn} is order ...
Joseph T. Belida, Emmanuel A. Cabral
openaire +2 more sources
First-Order Convergence and Roots [PDF]
Combinatorics, Probability and Computing, 2015 Nešetřil and Ossona de Mendez introduced the notion of first-order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether, if (Gi)i∈ℕ is a sequence of graphs with M being their first-order limit and v is a vertex of M, then there exists a sequence (vi)i∈ℕ of vertices such that the graphs Gi rooted at vi ...
Demetres Christofides, Daniel Král'
openaire +4 more sources
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 +4 more sources
First order convergence of matroids [PDF]
European Journal of Combinatorics, 2017 The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling.
Frantisek Kardos +3 more
openaire +4 more sources
About Convergence and Order of Convergence of Some Fractional Derivatives
Progress in Fractional Differentiation and Applications, 2022 In this paper we establish some convergence results for Riemann-Liouville, Caputo, and Caputo-Fabrizio fractional operators when the order of differentiation approaches one. We consider some errors given by $\left|\left| D^{1-\al}f -f'\right|\right|_p$ for p=1 and $p=\infty$ and we prove that for both Caputo and Caputo Fabrizio operators the order of ...
Roscani, Sabrina Dina +1 more
openaire +3 more sources
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