نتایج جستجو برای: modified picard normal s iteration
تعداد نتایج: 1491225 فیلتر نتایج به سال:
This paper presents a new problem solving approach that is able to generate optimal policy solution for finite-state stochastic sequential decision-making problems with high data efficiency. The proposed algorithm iteratively builds and improves an approximate Markov Decision Process (MDP) model along with cost-to-go value approximates by generating finite length trajectories through the state-...
We study strong and ∆-convergence of a modified S-type iteration process inspired by Agarwal, O’Regal and Sahu (2007) for uniformly L-Lipschitzian and generalized asymptotically nonexpansive mappings in CAT(0) spaces.
*Correspondence: [email protected] School of Mathematics and Statistics, Anyang Normal University, Anyang, 455000, P.R. China Abstract In this paper, based on the modified Hermitian and skew-Hermitian splitting (MHSS) iteration method, the nonlinear MHSS-like iteration method is presented to solve a class of the weakly absolute value equations (AVE). By using a smoothing approximate function, the...
Abstract The Picard iteration method is used to study the existence and uniqueness of solutions for stochastic Volterra-Levin equation with variable delays. Several sufficient conditions are specified ensure that has a unique solution. First, transformed into an integral equation. Then, obtain solution equation, successive approximation sequences constructed, derived by convergence sequences. F...
Using Gauss-Manin derivatives of generalized normal functions, we arrive at results on the non-triviality of the transcendental regulator for Km of a very general projective algebraic manifold. Our strongest results are for the transcendental regulator for K1 of a very general K3 surface and its self-product. We also construct an explicit family of K1 cycles on H ⊕ E8 ⊕ E8-polarized K3 surfaces...
This paper deals with the numerical content of Picard's Thsorem. Two classically equivalent versions of this theorem are proved which are distinct from a computational point of view. The proofs are elementary, and constructive in the sense of Bishop. A Brouwerian counterexample is given to the original version of the theorem.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید