Three Dimensional SRG Evolution of theNNInteractions Using Picard Iteration

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Picard Iteration Based Integrator

converge to a unique solution of the IVP up to the boundary of U [1]. In general, φn may converge slowly to the exact solution. The Picard iteration based integrator described in this paper has three main advantages. The the integrator has arbitrary order, is time adaptive, and has dense output. Dense output refers to the integrator being able to take time steps of variable length without havin...

متن کامل

Estimating the Local Radius of Convergence for Picard Iteration

The well known Ostrowski theorem [1] gives a sufficient condition (the spectral radius of the Jacobian of the iteration mapping in the fixed point to be less than 1) for the local convergence of Picard iteration. “However, no estimate for the size of an attraction ball is known” [2] (2009). The problem of estimating the local radius of convergence for different iterative methods was considered ...

متن کامل

T-Stability of Picard Iteration in Metric Spaces

Let X, d be a complete metric space and T a self-map of X. Let xn 1 f T, xn be some iteration procedure. Suppose that F T , the fixed point set of T , is nonempty and that xn converges to a point q ∈ F T . Let {yn} ⊂ X and define n d yn 1, f T, yn . If lim n 0 implies that limyn q, then the iteration procedure xn 1 f T, xn is said to be T -stable. Without loss of generality, we may assume that ...

متن کامل

Compile-Time Partitioning of Three-Dimensional Iteration Spaces

This paper presents a strategy for compile-time partitioning of generalised three-dimensional iteration spaces; it can be applied to loop nests comprising two inner nested loops both of which have bounds linearly dependent on the index of the outermost parallel loop. The strategy is analysed using symbolic analysis techniques for enumerating loop iterations which can provide estimates for the l...

متن کامل

On T-Stability of Picard Iteration in Cone Metric Spaces

i P is closed, nonempty, and P / {0}, ii a, b ∈ R, a, b ≥ 0, and x, y ∈ P imply that ax by ∈ P, iii x ∈ P and −x ∈ P imply that x 0. The space E can be partially ordered by the cone P ⊂ E; by defining, x ≤ y if and only if y − x ∈ P . Also, we write x y if y − x ∈ int P , where int P denotes the interior of P . A cone P is called normal if there exists a constant K > 0 such that 0 ≤ x ≤ y impli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPJ Web of Conferences

سال: 2016

ISSN: 2100-014X

DOI: 10.1051/epjconf/201611308008