scholarly journals Fast Computation of Singular Oscillatory Fourier Transforms

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Hongchao Kang ◽  
Xinping Shao
Keyword(s):  
Great Improvement ◽  
Numerical Experiments ◽  
Numerical Evaluation ◽  
Fourier Transforms ◽  
Quadrature Rule ◽  
Steepest Descent ◽  
Fast Computation ◽  
Type Method ◽  
Complex Region ◽  
Theoretical Results

We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms ∫ab‍x-aαb-xβf(x)eiωxdx, whereα>-1  and  β>-1. Based on substituting the original interval of integration by the paths of steepest descent, iffis analytic in the complex regionGcontaining [a,b], the computation of integrals can be transformed into the problems of integrating two integrals on [0, ∞) with the integrand that does not oscillate and decays exponentially fast, which can be efficiently computed by using the generalized Gauss Laguerre quadrature rule. The efficiency and the validity of the method are demonstrated by both numerical experiments and theoretical results. More importantly, the presented method in this paper is also a great improvement of a Filon-type method and a Clenshaw-Curtis-Filon-type method shown in Kang and Xiang (2011) and the Chebyshev expansions method proposed in Kang et al. (2013), for computing the above integrals.

scholarly journals Error Analysis of Randomized Runge–Kutta Methods for Differential Equations with Time-Irregular Coefficients

2017 ◽  
Vol 17 (3) ◽  
pp. 479-498 ◽  
Author(s):  
Raphael Kruse ◽  
Yue Wu
Keyword(s):  
Differential Equations ◽  
Error Analysis ◽  
Numerical Experiments ◽  
Convergence Rates ◽  
Quadrature Rule ◽  
Time Variable ◽  
Important Ingredient ◽  
Riemann Sum ◽  
Runge Kutta ◽  
Theoretical Results

AbstractThis paper contains an error analysis of two randomized explicit Runge–Kutta schemes for ordinary differential equations (ODEs) with time-irregular coefficient functions. In particular, the methods are applicable to ODEs of Carathéodory type, whose coefficient functions are only integrable with respect to the time variable but are not assumed to be continuous. A further field of application are ODEs with coefficient functions that contain weak singularities with respect to the time variable. The main result consists of precise bounds for the discretization error with respect to the {L^{p}(\Omega;{\mathbb{R}}^{d})}-norm. In addition, convergence rates are also derived in the almost sure sense. An important ingredient in the analysis are corresponding error bounds for the randomized Riemann sum quadrature rule. The theoretical results are illustrated through a few numerical experiments.

scholarly journals A Modified Ren’s Method with Memory Using a Simple Self-Accelerating Parameter

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 540 ◽  
Author(s):  
Xiaofeng Wang ◽  
Qiannan Fan
Keyword(s):  
Nonlinear Equations ◽  
Numerical Experiments ◽  
New Method ◽  
Convergence Order ◽  
Type Method ◽  
Computational Costs ◽  
With Memory ◽  
Theoretical Results

In this paper, a self-accelerating type method is proposed for solving nonlinear equations, which is a modified Ren’s method. A simple way is applied to construct a variable self-accelerating parameter of the new method, which does not increase any computational costs. The highest convergence order of new method is 2 + 6 ≈ 4.4495 . Numerical experiments are made to show the performance of the new method, which supports the theoretical results.

scholarly journals An Intuitive Introduction to Fractional and Rough Volatilities

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 994
Author(s):  
Elisa Alòs ◽  
Jorge A. León
Keyword(s):  
Malliavin Calculus ◽  
Numerical Experiments ◽  
Implied Volatility ◽  
Natural Approach ◽  
Volatility Models ◽  
Implied Volatility Surface ◽  
Short Memory ◽  
White Type ◽  
Volatility Surface ◽  
Theoretical Results

Here, we review some results of fractional volatility models, where the volatility is driven by fractional Brownian motion (fBm). In these models, the future average volatility is not a process adapted to the underlying filtration, and fBm is not a semimartingale in general. So, we cannot use the classical Itô’s calculus to explain how the memory properties of fBm allow us to describe some empirical findings of the implied volatility surface through Hull and White type formulas. Thus, Malliavin calculus provides a natural approach to deal with the implied volatility without assuming any particular structure of the volatility. The aim of this paper is to provides the basic tools of Malliavin calculus for the study of fractional volatility models. That is, we explain how the long and short memory of fBm improves the description of the implied volatility. In particular, we consider in detail a model that combines the long and short memory properties of fBm as an example of the approach introduced in this paper. The theoretical results are tested with numerical experiments.

scholarly journals The number of lattice rules having given invariants

1992 ◽  
Vol 46 (3) ◽  
pp. 479-495 ◽  
Author(s):  
Stephen Joe ◽  
David C. Hunt
Keyword(s):  
Normal Form ◽  
Quadrature Rule ◽  
Unit Cube ◽  
Numerical Results ◽  
Smith Normal Form ◽  
Lattice Rules ◽  
Dimensional Unit ◽  
Lattice Rule ◽  
Positive Integers ◽  
Theoretical Results

A lattice rule is a quadrature rule used for the approximation of integrals over the s-dimensional unit cube. Every lattice rule may be characterised by an integer r called the rank of the rule and a set of r positive integers called the invariants. By exploiting the group-theoretic structure of lattice rules we determine the number of distinct lattice rules having given invariants. Some numerical results supporting the theoretical results are included. These numerical results are obtained by calculating the Smith normal form of certain integer matrices.

scholarly journals Stable Numerical Evaluation of Finite Hankel Transforms and Their Application

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Manoj P. Tripathi ◽  
B. P. Singh ◽  
Om P. Singh
Keyword(s):  
Stability Analysis ◽  
Heat Equation ◽  
Numerical Experiments ◽  
Numerical Evaluation ◽  
Radiation Condition ◽  
Hankel Transform ◽  
Basis Functions ◽  
Infinite Cylinder ◽  
Stable Algorithm ◽  
Hankel Transforms

A new stable algorithm, based on hat functions for numerical evaluation of Hankel transform of order ν>-1, is proposed in this paper. The hat basis functions are used as a basis to expand a part of the integrand, rf(r), appearing in the Hankel transform integral. This leads to a very simple, efficient, and stable algorithm for the numerical evaluation of Hankel transform. The novelty of our paper is that we give error and stability analysis of the algorithm and corroborate our theoretical findings by various numerical experiments. Finally, an application of the proposed algorithm is given for solving the heat equation in an infinite cylinder with a radiation condition.

scholarly journals Stabilised explicit Adams-type methods

2021 ◽  
pp. 82-98
Author(s):  
Vasily I. Repnikov ◽  
Boris V. Faleichik ◽  
Andrew V. Moisa
Keyword(s):  
Numerical Experiments ◽  
Step Method ◽  
Type Method ◽  
Constrained Optimisation ◽  
First Order ◽  
Error Constant ◽  
Stability Intervals ◽  
Multi Step Methods ◽  
First Order Methods ◽  
Accuracy And Stability

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.

scholarly journals On the Semi-Local Convergence of a Traub-Type Method for Solving Equations

Foundations ◽  
2022 ◽  
Vol 2 (1) ◽  
pp. 114-127
Author(s):  
Samundra Regmi ◽  
Christopher I. Argyros ◽  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Banach Space ◽  
Local Convergence ◽  
Type Method ◽  
Lipschitz Constants ◽  
Solving Equations ◽  
Original Domain ◽  
Theoretical Results

The celebrated Traub’s method involving Banach space-defined operators is extended. The main feature in this study involves the determination of a subset of the original domain that also contains the Traub iterates. In the smaller domain, the Lipschitz constants are smaller too. Hence, a finer analysis is developed without the usage of additional conditions. This methodology applies to other methods. The examples justify the theoretical results.

scholarly journals On the numerical solutions for nonlinear Volterra-Fredholm integral equations

2022 ◽  
Vol 40 ◽  
pp. 1-11
Author(s):  
Parviz Darania ◽  
Saeed Pishbin
Keyword(s):  
Nonlinear System ◽  
Integral Equations ◽  
Numerical Experiments ◽  
Numerical Solutions ◽  
Coefficient Matrix ◽  
Collocation Methods ◽  
Fredholm Integral Equations ◽  
Stability Estimates ◽  
Lower Triangular ◽  
Theoretical Results

In this note, we study a class of multistep collocation methods for the numerical integration of nonlinear Volterra-Fredholm Integral Equations (V-FIEs). The derived method is characterized by a lower triangular or diagonal coefficient matrix of the nonlinear system for the computation of the stages which, as it is known, can beexploited to get an efficient implementation. Convergence analysis and linear stability estimates are investigated. Finally numerical experiments are given, which confirm our theoretical results.

A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems

2017 ◽  
Vol 7 (4) ◽  
pp. 827-836
Author(s):  
Ze-Jia Xie ◽  
Xiao-Qing Jin ◽  
Zhi Zhao
Keyword(s):  
Convergence Analysis ◽  
Linear Systems ◽  
Numerical Experiments ◽  
Coefficient Matrix ◽  
Indefinite Systems ◽  
Indefinite Linear Systems ◽  
Theoretical Results

AbstractSome convergence bounds of the minimal residual (MINRES) method are studied when the method is applied for solving Hermitian indefinite linear systems. The matrices of these linear systems are supposed to have some properties so that their spectra are all clustered around ±1. New convergence bounds depending on the spectrum of the coefficient matrix are presented. Some numerical experiments are shown to demonstrate our theoretical results.

On modeling column crystallizers and a Hermite predictor–corrector scheme for a system of integro-differential equations

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Khaldoun El Khaldi ◽  
Nima Rabiei ◽  
Elias G. Saleeby
Keyword(s):  
Numerical Experiments ◽  
Main Part ◽  
Direct Method ◽  
Particle Agglomeration ◽  
Volterra Type ◽  
Type Method ◽  
Method Of Solution ◽  
System Of Integrodifferential Equations ◽  
Predictor Corrector ◽  
A Direct Method

Abstract Multistaged crystallization systems are used in the production of many chemicals. In this article, employing the population balance framework, we develop a model for a column crystallizer where particle agglomeration is a significant growth mechanism. The main part of the model can be reduced to a system of integrodifferential equations (IDEs) of the Volterra type. To solve this system simultaneously, we examine two numerical schemes that yield a direct method of solution and an implicit Runge–Kutta type method. Our numerical experiments show that the extension of a Hermite predictor–corrector method originally advanced in Khanh (1994) for a single IDE is effective in solving our model. The numerical method is presented for a generalization of the model which can be used to study and simulate a number of possible operating profiles of the column.

Sign in / Sign up

Export Citation Format

Share Document