نتایج جستجو برای: stability and convergence
تعداد نتایج: 16886838 فیلتر نتایج به سال:
We deal with optimal approximation of solutions ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. show that randomized two-stage Runge-Kutta scheme is method among all algorithms based on standard noisy information. perform numerical experiments confirm our theoretical findings. Moreover, for algorithm we rigorously investigate properties...
The assignment flow recently introduced in the J. Math. Imaging and Vision 58/2 (2017), constitutes a high-dimensional dynamical system that evolves on an elementary statistical manifold performs contextual labeling (classification) of data given any metric space. Vertices graph index points define neighborhoods. These neighborhoods together with nonnegative weight parameters regularization evo...
We study the stability of convergence of the ChristoffelDarboux kernel, associated with a compactly supported measure, to the sine kernel, under perturbations of the Jacobi coefficients of the measure. We prove stability under variations of the boundary conditions and stability in a weak sense under l and random l diagonal perturbations. We also show that convergence to the sine kernel at x imp...
The numerical approximation methods of the differential problems solution are numerous and various. Their classifications are based on several criteria: Consistency, precision, stability, convergence, dispersion, diffusion, speed and many others. For this reason a great interest must be given to the construction and the study of the associated algorithm: indeed the algorithm must be simple, rob...
Optimal boundary control of semilinear parabolic equations requires efficient solution methods in applications. Solution methods bypass the nonlinearity in different approaches. One approach can be quasilinearization (QL) but its applicability is locally in time. Nonetheless, consecutive applications of it can form a new method which is applicable globally in time. Dividing the control problem ...
A mathematical framework for the convergence analysis of the well known Quickprop method is described. The convergence of this method is analyzed. Furthermore, we present modi cations of the algorithm that exhibit improved convergence speed and stability and at the same time, alleviate the use of heuristic learning parameters. Simulations are conducted to compare and evaluate the performance of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید