error constant
Recently Published Documents


TOTAL DOCUMENTS

26
(FIVE YEARS 8)

H-INDEX

3
(FIVE YEARS 1)

Author(s):  
Vasily I. Repnikov ◽  
Boris V. Faleichik ◽  
Andrew V. Moisa

In this work we present explicit Adams-type multi-step methods with extended stability intervals, which are analogous to the stabilised Chebyshev Runge – Kutta methods. It is proved that for any k ≥ 1 there exists an explicit k-step Adams-type method of order one with stability interval of length 2k. The first order methods have remarkably simple expressions for their coefficients and error constant. A damped modification of these methods is derived. In the general case, to construct a k-step method of order p it is necessary to solve a constrained optimisation problem in which the objective function and p constraints are second degree polynomials in k variables. We calculate higher-order methods up to order six numerically and perform some numerical experiments to confirm the accuracy and stability of the methods.


2021 ◽  
Vol 47 (4) ◽  
Author(s):  
Daniel Potts ◽  
Manfred Tasche

AbstractIn this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. Here, we consider the continuous Kaiser–Bessel, continuous exp-type, sinh-type, and continuous cosh-type window functions with the same support and same shape parameter. We present novel explicit error estimates for NFFT with such a window function and derive rules for the optimal choice of the parameters involved in NFFT. The error constant of a window function depends mainly on the oversampling factor and the truncation parameter. For the considered continuous window functions, the error constants have an exponential decay with respect to the truncation parameter.


2020 ◽  
Vol 4 (2) ◽  
pp. 743-748
Author(s):  
Raihanatu Muhammad

Implicit Runge- Kutta methods are used for solving  stiff problems which mostly arise in real life situations. Analysis of  the order, error constant, consistency and convergence will help in determining an effective Runge- Kutta Method (RKM) to use. Due to the loss of  linearity in Runge –Kutta Methods and the fact that the general Runge –Kutta Method  makes no mention of the differential equation makes it impossible to define the order of the method independently of the differential equation. In this paper, we examine in simpler details how to obtain the order, error constant, consistency  and convergence of a Runge -Kutta Type method (RKTM) when the step number  .


2020 ◽  
Vol 3 (2) ◽  
pp. 158-167
Author(s):  
VO Atabo ◽  
PO Olatunji

In this research article, we focus on the formulation of a 5-point block formula for solving first order ordinary differential equations (ODEs). The method is formulated via interpolation and collocation approach using power series expansion as the approximate solution. It has been established that the derived method is of order six. Basic properties such zero and absolute stabilities, convergence, order and error constant have also been investigated. The accuracy of the method was verified on some selected stiff IVPs, compared with some existing methods (DIBBDF, SDIBBDF, BBDF(4), BBDF(5) and odes15s) and test performance showed that the new method is viable.


2019 ◽  
Vol 2 (3) ◽  
pp. 461-486 ◽  
Author(s):  
Daniel J. Frean ◽  
Jennifer K. Ryan

AbstractOne of the beneficial properties of the discontinuous Galerkin method is the accurate wave propagation properties. That is, the semi-discrete error has dissipation errors of order $$2k+1$$2k+1 ($$\le Ch^{2k+1}$$≤Ch2k+1) and order $$2k+2$$2k+2 for dispersion ($$\le Ch^{2k+2}$$≤Ch2k+2). Previous studies have concentrated on the order of accuracy, and neglected the important role that the error constant, C,  plays in these estimates. In this article, we show the important role of the error constant in the dispersion and dissipation error for discontinuous Galerkin approximation of polynomial degree k,  where $$k=0,1,2,3.$$k=0,1,2,3. This gives insight into why one may want a more centred flux for a piecewise constant or quadratic approximation than for a piecewise linear or cubic approximation. We provide an explicit formula for these error constants. This is illustrated through one particular flux, the upwind-biased flux introduced by Meng et al., as it is a convex combination of the upwind and downwind fluxes. The studies of wave propagation are typically done through a Fourier ansatz. This higher order Fourier information can be extracted using the smoothness-increasing accuracy-conserving (SIAC) filter. The SIAC filter ties the higher order Fourier information to the negative-order norm in physical space. We show that both the proofs of the ability of the SIAC filter to extract extra accuracy and numerical results are unaffected by the choice of flux.


2019 ◽  
Vol 17 (01) ◽  
pp. 1843011
Author(s):  
Ramandeep Behl ◽  
Changbum Chun ◽  
Ali Saleh Alshormani ◽  
S. S. Motsa

In this paper, we present a new and interesting optimal scheme of order eight in a general way for solving nonlinear equations, numerically. The beauty of our scheme is that it is capable of producing further new and interesting optimal schemes of order eight from every existing optimal fourth-order scheme whose first substep employs Newton’s method. The construction of this scheme is based on rational functional approach. The theoretical and computational properties of the proposed scheme are fully investigated along with a main theorem which establishes the order of convergence and asymptotic error constant. Several numerical examples are given and analyzed in detail to demonstrate faster convergence and higher computational efficiency of our methods.


Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 691 ◽  
Author(s):  
Mehdi Salimi ◽  
Ramandeep Behl

The principal motivation of this paper is to propose a general scheme that is applicable to every existing multi-point optimal eighth-order method/family of methods to produce a further sixteenth-order scheme. By adopting our technique, we can extend all the existing optimal eighth-order schemes whose first sub-step employs Newton’s method for sixteenth-order convergence. The developed technique has an optimal convergence order regarding classical Kung-Traub conjecture. In addition, we fully investigated the computational and theoretical properties along with a main theorem that demonstrates the convergence order and asymptotic error constant term. By using Mathematica-11 with its high-precision computability, we checked the efficiency of our methods and compared them with existing robust methods with same convergence order.


2015 ◽  
Vol 55 (1) ◽  
pp. 5-18 ◽  
Author(s):  
O. A. Akinfenwa ◽  
S. N. Jator

Abstract We present an Extended Continuous Block Backward Differentiation Formula (ECBBDF) of order k+1 for the numerical solution of stiff ordinary differential equations. This is achieved by constructing an Extended Continuous Backward Differentiation formula (ECBDF) together with the additional methods from its first derivative and are combined to form a single block of methods that simultaneously provide the approximate solutions for the stiff Initial Value Problems (IVPs). The error constant and stability property of the (ECBBDF) is discussed. We use the specific cases k = 4 and k = 5 to illustrate the process. The performance of the method is demonstrated on some numerical examples to show the accuracy and efficiency advantages of the method.


2015 ◽  
Vol 55 (1) ◽  
pp. 109-131
Author(s):  
Bruno de Malafosse

Abstract We present an Extended Continuous Block Backward Differentiation Formula (ECBBDF) of order k+1 for the numerical solution of stiff ordinary differential equations. This is achieved by constructing an Extended Continuous Backward Differentiation formula (ECBDF) together with the additional methods from its first derivative and are combined to form a single block of methods that simultaneously provide the approximate solutions for the stiff Initial Value Problems (IVPs). The error constant and stability property of the (ECBBDF) is discussed. We use the specific cases k = 4 and k = 5 to illustrate the process. The performance of the method is demonstrated on some numerical examples to show the accuracy and efficiency advantages of the method.


Sign in / Sign up

Export Citation Format

Share Document