نتایج جستجو برای: modified noor iteration

تعداد نتایج: 292622  

2013
Syed Tauseef Mohyud-Din

In this paper, we apply the Modified Variational Iteration Method (MVIM) for solving systems of partial differential equations. The proposed modification is made by introducing He’s polynomials in the correction functional of Variational Iteration Method (VIM). Several examples are given to verify the reliability and efficiency of the method. The fact that the MVIM solves nonlinear problems wit...

2013
Prasit Cholamjiak P. Cholamjiak

We introduce a new modified Halpern-type iteration for a family of Bregman relatively nonexpansive mappings and establish strong convergence theorems in reflexive Banach spaces. The results extend the corresponding results obtained by many authors. Mathematics Subject Classification: 47H09; 47H10

2011
Barbara Kaltenbacher

In this paper we provide a convergence rates result for a modified version of Landweber iteration with a priori regularization parameter choice in a Banach space setting.

Journal: :journal of linear and topological algebra (jlta) 0
m amirfakhrian department of mathematics, islamic azad university, central tehran branch, po. code 14168-94351, iran. f mohammad department of mathematics, islamic azad university, central tehran branch, po. code 14168-94351, iran.

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

Journal: :J. Applied Mathematics 2012
Arif Rafiq Shin Min Kang

We proved that the modified implicit Mann iteration process can be applied to approximate the fixed point of strictly hemicontractive mappings in smooth Banach spaces.

Journal: :SIAM J. Numerical Analysis 2008
Kristian Debrabant Anne Kværnø

In recent years, implicit stochastic Runge–Kutta (SRK) methods have been developed both for strong and weak approximations. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes such as simple iteration, modified Newton iteration or full Newton iteration. We employ a unifying approach for the construction of ...

ژورنال: پژوهش های ریاضی 2020

In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...

2011
ZHONG-ZHI BAI FANG CHEN ZENG-QI WANG

We construct a preconditioned modified Hermitian and skew-Hermitian splitting (PMHSS) iteration scheme for solving and preconditioning a class of block two-by-two linear systems arising from the Galerkin finite element discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods is established and the spectral properties of the PMHS...

1999
Nevin Lianwen Zhang Stephen S. Lee Weihong Zhang

We present a technique for speeding up the convergence of value iteration for par­ tially observable Markov decisions processes (POMDPs). The underlying idea is similar to that behind modified policy iteration for fully observable Markov decision processes (MDPs). The technique can be easily incor­ porated into any existing POMDP value it­ eration algorithms. Experiments have been conducted on ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید