نتایج جستجو برای: approximating sequence
تعداد نتایج: 419159 فیلتر نتایج به سال:
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
Abstract We show that solutions for a specifically scaled nonlinear wave equation of elasticity converge to linear Euler–Bernoulli beam system. construct an approximation the solution, using suitable asymptotic expansion ansatz based upon one-dimensional equation. Following this, we derive existence appropriately initial data and can bound difference between analytical solution approximating se...
In this paper, the concepts of well-posednesses and Hadamard well-posedness for a family of mixed variational inequalities are studied. Also, some metric characterizations of them are presented and some relations between well-posedness and Hadamard well-posedness of a family of mixed variational inequalities is studied. Finally, a relation between well-posedness for the family of mixed variatio...
This article introduces a new numerical algorithm for approximating the solution of common fixed point problem two operators defined on CAT(0) spaces, belonging to class L2, which was very recently introduced. The main results refer Δ and strong convergence sequence generated by algorithm. A distinct feature adopted approach is use equivalent sequences.
This paper presents a simple method for approximating a rational Bézier curve with Bézier curve sequence, whose control points are those of degree-elevated rational Bézier curves. It is proved that the derivatives with any given degree of the Bézier curve sequence constructed this way would uniformly converge to the corresponding derivatives of the original rational Bézier curve. © 2008 Publish...
Approximating the Koopman operator from data is numerically challenging when many lifting functions are considered. Even low-dimensional systems can yield unstable or ill-conditioned results in a high-dimensional lifted space. In this paper, Extended Dynamic Mode Decomposition (DMD) and DMD with control, two methods for approximating operator, reformulated as convex optimization problems linear...
Given a sequence (s0, s1, . . . , sN ) of observations from a finite set S, we construct a process (sn) that satisfies the following properties: (i) (sn) is a piecewise Markov chain, (ii) the conditional distribution of sn given s0, . . . , sn−1 is close to the empirical transition given by the observed sequence, for most n, (iii) under (sn), with high probability the empirical frequency of the...
We show that the intertwining of sequences of good Lagrange interpolation points for approximating entire functions is still a good sequence of interpolation points. We give examples of such sequences.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید