An Implicit Runge-kutta Method for a Class of Differential Inclusions: Local Error Estimates
نویسندگان
چکیده
where co means the convex hull and the given functions ai(·) : R n → R, i = 1, 2, . . . , k are supposed to satisfy the following assumptions: A(i): ai(·) are twice continuously differentiable, and A(ii): ai(·) are with linear growth: ‖ai(x)‖ ≤ θ(1 + ‖x‖) for some positive θ, where ‖ · ‖ is the Euclidean norm. For any sequence of k elements (f1, f2, . . . , fk) we use the notation {fi} k i=1. Denote A = { {αi} k i=1 ∣∣∣∣αi ∈ R, k ∑
منابع مشابه
A New Diagonally Implicit Runge-Kutta-Nyström Method for Periodic IVPs
A new diagonally implicit Runge-Kutta-Nyström (RKN) method is developed for the integration of initial-value problems for second-order ordinary differential equations possessing oscillatory solutions. Presented is a method which is three-stage fourth-order with dispersive order six and 'small' principal local truncation error terms and dissipation constant. The analysis of phase-lag, dissipatio...
متن کاملOn the Construction of Error Estimators for Implicit Runge{Kutta Methods
For implicit Runge{Kutta methods intended for stii ODEs or DAEs, it is often diicult to embed a local error estimating method which gives realistic error estimates for stii/algebraic components. If the embedded method's stability function is unbounded at z = 1, stii error components are grossly overestimated. In practice some codes \improve" such inadequate error estimates by premultiplying the...
متن کاملRunge-kutta Methods and Local Uniform Grid Refinement
Local uniform grid refinement (LUGR) is an adaptive grid technique for computing solutions of partial differential equations possessing sharp spatial transitions. Using nested, finer-and-finer uniform subgrids, the LUGR technique refines the space grid locally around these transitions, so as to avoid discretization on a very fine grid covering the entire physical domain. This paper examines the...
متن کاملValidated Explicit and Implicit Runge-Kutta Methods∗†
A set of validated numerical integration methods based on explicit and implicit Runge-Kutta schemes is presented to solve, in a guaranteed way, initial value problems of ordinary differential equations. Runge-Kutta methods are well-known to have strong stability properties, which make them appealing to be the basis of validated numerical integration methods. A new approach to bound the local tr...
متن کاملOptimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods
We derive a posteriori error estimates, which exhibit optimal global order, for a class of time stepping methods of any order that include Runge–Kutta Collocation (RK-C) methods and the continuous Galerkin (cG) method for linear and nonlinear stiff ODEs and parabolic PDEs. The key ingredients in deriving these bounds are appropriate one-degree higher continuous reconstructions of the approximat...
متن کامل