منابع مشابه
Equivalent Forms of Multistep Formulas
For uniform meshes it is shown that any linear fc-step formula can be formulated so that only k values need to be saved between steps. By saving additional m values it is possible to construct local polynomial approximations of degree k + m — 1, which can be used as predictor formulas. Different polynomial bases lead to different equivalent forms of multistep formulas. In particular, local mono...
متن کاملConstruction of Variable-Stepsize Multistep Formulas
A systematic way of extending a general fixed-stepsize multistep formula to a minimum storage variable-stepsize formula has been discovered that encompasses fixed-coefficient (interpolatory), variable-coefficient (variable step), and fixed leading coefficient as special cases. In particular, it is shown that the " interpolatory" stepsize changing technique of Nordsieck leads to a truly variable...
متن کاملA Proof of the Daniel-moore Conjectures for A-stable Multistep Two-derivative Integration Formulas
A simple proof is given of the following particular case of the DanielMoore conjectures, recently proved in full generality by Wanner, Hairer and Nersett. The maximum error order achievable by an A-stable k-step two-derivative formula equals four and the optimum value of the corresponding error constant is achieved by the second Obrechkoff method. The arguments presented in this paper reveal so...
متن کاملIntegration formulas for the conditional transform involving the first variation
In this paper, we show that the conditional transform with respect to the Gaussian process involving the first variation can be expressed in terms of the conditional transform without the first variation. We then use this result to obtain various integration formulas involving the conditional $diamond$-product and the first variation.
متن کاملConstruction of fully symmetric numerical integration formulas of fully symmetric numerical integration formulas
The paper develops a construction for finding fully symmetric integration formulas of arbitrary degree 2k + t in n-space such that the number of evaluation points is O ((2n)k/k t), n ~ . Formulas of degrees 3, 5, 7, 9, are relatively simple and are presented in detail. The method has been tested by obtaining some special formulas of degrees 7, 9 and 1 t but these are not presented here.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1963
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1963-0155428-x