scholarly journals On Fast and Stable Implementation of Clenshaw-Curtis and Fejér-Type Quadrature Rules

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Shuhuang Xiang ◽  
Guo He ◽  
Haiyong Wang
Keyword(s):  
Quadrature Rules ◽  
Logarithmic Function ◽  
Fast Computation ◽  
Numerical Examples ◽  
Jacobi Weights ◽  
Integration Algorithms ◽  
The Stability ◽  
Interpolation Polynomials ◽  
Modified Moments

Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, together with the efficient evaluation of the modified moments by forward recursions or by Oliver’s algorithms, this paper presents fast and stable interpolating integration algorithms, by using the coefficients and modified moments, for Clenshaw-Curtis, Fejér’s first- and second-type rules for Jacobi weights or Jacobi weights multiplied by a logarithmic function. Numerical examples illustrate the stability, efficiency, and accuracy of these quadratures.

scholarly journals Coleman integration for even-degree models of hyperelliptic curves

2015 ◽  
Vol 18 (1) ◽  
pp. 258-265 ◽  
Author(s):  
Jennifer S. Balakrishnan
Keyword(s):  
Number Theory ◽  
Computer Science ◽  
Hyperelliptic Curves ◽  
Open Book ◽  
Line Integral ◽  
Book Series ◽  
Numerical Examples ◽  
Lecture Notes ◽  
Integration Algorithms ◽  
Mathematical Sciences

The Coleman integral is a $p$-adic line integral that encapsulates various quantities of number theoretic interest. Building on the work of Harrison [J. Symbolic Comput. 47 (2012) no. 1, 89–101], we extend the Coleman integration algorithms in Balakrishnan et al. [Algorithmic number theory, Lecture Notes in Computer Science 6197 (Springer, 2010) 16–31] and Balakrishnan [ANTS-X: Proceedings of the Tenth Algorithmic Number Theory Symposium, Open Book Series 1 (Mathematical Sciences Publishers, 2013) 41–61] to even-degree models of hyperelliptic curves. We illustrate our methods with numerical examples computed in Sage.

scholarly journals On the Numerical Simulation of HPDEs Using θ-Weighted Scheme and the Galerkin Method

Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 78
Author(s):  
Haifa Bin Jebreen ◽  
Fairouz Tchier
Keyword(s):  
Differential Equation ◽  
Galerkin Method ◽  
Linear Ordinary Differential Equation ◽  
Time Interval ◽  
Hyperbolic Partial Differential Equation ◽  
Time Step ◽  
Numerical Examples ◽  
One Dimensional ◽  
The Stability ◽  
The Galerkin Method

Herein, an efficient algorithm is proposed to solve a one-dimensional hyperbolic partial differential equation. To reach an approximate solution, we employ the θ-weighted scheme to discretize the time interval into a finite number of time steps. In each step, we have a linear ordinary differential equation. Applying the Galerkin method based on interpolating scaling functions, we can solve this ODE. Therefore, in each time step, the solution can be found as a continuous function. Stability, consistency, and convergence of the proposed method are investigated. Several numerical examples are devoted to show the accuracy and efficiency of the method and guarantee the validity of the stability, consistency, and convergence analysis.

FAST COMPUTATION OF GEOMETRIC MOMENTS AND INVARIANTS USING SCHLICK'S APPROXIMATION

2008 ◽  
Vol 22 (07) ◽  
pp. 1363-1377 ◽  
Author(s):  
R. MUKUNDAN
Keyword(s):  
Fast Computation ◽  
Recent Past ◽  
Computational Overhead ◽  
Geometric Moments ◽  
Alternative Approach ◽  
Computational Speed ◽  
Moment Functions ◽  
The Moment ◽  
Moment Integral ◽  
Modified Moments

Geometric moments have been used in several applications in the field of Computer Vision. Many techniques for fast computation of geometric moments have therefore been proposed in the recent past, but these algorithms mainly rely on properties of the moment integral such as piecewise differentiability and separability. This paper explores an alternative approach to approximating the moment kernel itself in order to get a notable improvement in computational speed. Using Schlick's approximation for the normalized kernel of geometric moments, the computational overhead could be significantly reduced and numerical stability increased. The paper also analyses the properties of the modified moment functions, and shows that the proposed method could be effectively used in all applications where normalized Cartesian moment kernels are used. Several experimental results showing the invariant characteristics of the modified moments are also presented.

Stability of real-time hybrid simulation involving time-varying delay and direct integration algorithms

2021 ◽  
pp. 107754632110016
Author(s):  
Liang Huang ◽  
Cheng Chen ◽  
Shenjiang Huang ◽  
Jingfeng Wang
Keyword(s):  
Real Time ◽  
Discrete Time ◽  
Continuous Time ◽  
Hybrid Simulation ◽  
Time Varying ◽  
Discrete Time System ◽  
Time System ◽  
Integration Algorithms ◽  
The Stability ◽  
Continuous Time System

Stability presents a critical issue for real-time hybrid simulation. Actuator delay might destabilize the real-time test without proper compensation. Previous research often assumed real-time hybrid simulation as a continuous-time system; however, it is more appropriately treated as a discrete-time system because of application of digital devices and integration algorithms. By using the Lyapunov–Krasovskii theory, this study explores the convoluted effect of integration algorithms and actuator delay on the stability of real-time hybrid simulation. Both theoretical and numerical analysis results demonstrate that (1) the direct integration algorithm is preferably used for real-time hybrid simulation because of its computational efficiency; (2) the stability analysis of real-time hybrid simulation highly depends on actuator delay models, and the actuator model that accounts for time-varying characteristic will lead to more conservative stability; and (3) the integration step is constrained by the algorithm and structural frequencies. Moreover, when the step is small, the stability of the discrete-time system will approach that of the corresponding continuous-time system. The study establishes a bridge between continuous- and discrete-time systems for stability analysis of real-time hybrid simulation.

Asymptotic Behavior of Periodic Cohen-Grossberg Neural Networks with Delays

2009 ◽  
Vol 21 (12) ◽  
pp. 3444-3459 ◽  
Author(s):  
Wei Lin
Keyword(s):  
Neural Networks ◽  
Periodic Solution ◽  
Lyapunov Method ◽  
Autonomous Systems ◽  
Neural Systems ◽  
Stability Criteria ◽  
Volterra System ◽  
Numerical Examples ◽  
The Stability ◽  
Special Case

Without assuming the positivity of the amplification functions, we prove some M-matrix criteria for the [Formula: see text]-global asymptotic stability of periodic Cohen-Grossberg neural networks with delays. By an extension of the Lyapunov method, we are able to include neural systems with multiple nonnegative periodic solutions and nonexponential convergence rate in our model and also include the Lotka-Volterra system, an important prototype of competitive neural networks, as a special case. The stability criteria for autonomous systems then follow as a corollary. Two numerical examples are provided to show that the limiting equilibrium or periodic solution need not be positive.

scholarly journals Computer methods for stability analysis of the Roesser type model of 2D continuous-discrete linear systems

2012 ◽  
Vol 22 (2) ◽  
pp. 401-408 ◽  
Author(s):  
Mikołaj Busłowicz ◽  
Andrzej Ruszewski
Keyword(s):  
Stability Analysis ◽  
Asymptotic Stability ◽  
Linear Systems ◽  
Type Model ◽  
Stability Tests ◽  
Numerical Examples ◽  
Computer Methods ◽  
Discrete Linear Systems ◽  
Complex Functions ◽  
The Stability

Computer methods for stability analysis of the Roesser type model of 2D continuous-discrete linear systemsAsymptotic stability of models of 2D continuous-discrete linear systems is considered. Computer methods for investigation of the asymptotic stability of the Roesser type model are given. The methods require computation of eigenvalue-loci of complex matrices or evaluation of complex functions. The effectiveness of the stability tests is demonstrated on numerical examples.

scholarly journals Recursive Calculation of Survival Probabilities

1991 ◽  
Vol 21 (2) ◽  
pp. 199-221 ◽  
Author(s):  
David C. M. Dickson ◽  
Howard R. Waters
Keyword(s):  
Finite Time ◽  
Approximate Calculation ◽  
Risk Model ◽  
Classical Risk Model ◽  
Infinite Time ◽  
Numerical Examples ◽  
Survival Probabilities ◽  
Recursive Calculation ◽  
The Stability ◽  
The Classical Risk Model

AbstractIn this paper we present an algorithm for the approximate calculation of finite time survival probabilities for the classical risk model. We also show how this algorithm can be applied to the calculation of infinite time survival probabilities. Numerical examples are given and the stability of the algorithms is discussed.

scholarly journals An iterative frequency-sweeping approach for stability analysis of linear systems with multiple delays

2017 ◽  
Vol 36 (2) ◽  
pp. 379-398
Author(s):  
Xu-Guang Li ◽  
Silviu-Iulian Niculescu ◽  
Arben Çela
Keyword(s):  
Stability Analysis ◽  
Asymptotic Behaviour ◽  
Linear Systems ◽  
Invariance Property ◽  
Multiple Delays ◽  
Numerical Examples ◽  
The Stability ◽  
Imaginary Roots ◽  
Frequency Sweeping

AbstractIn this article, we study the stability of linear systems with multiple (incommensurate) delays, by extending a recently proposed frequency-sweeping approach. First, we consider the case where only one delay parameter is free while the others are fixed. The complete stability w.r.t. the free delay parameter can be systematically investigated by proving an appropriate invariance property. Next, we propose an iterative frequency-sweeping approach to study the stability under any given multiple delays. Moreover, we may effectively analyse the asymptotic behaviour of the critical imaginary roots (if any) w.r.t. each delay parameter, which provides a possibility for stabilizing the system through adjusting the delay parameters. The approach is simple (graphical test) and can be applied systematically to the stability analysis of linear systems including multiple delays. A deeper discussion on its implementation is also proposed. Finally, various numerical examples complete the presentation.

scholarly journals Some Second-Order σ Schemes Combined with an H1-Galerkin MFE Method for a Nonlinear Distributed-Order Sub-Diffusion Equation

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 187
Author(s):  
Yaxin Hou ◽  
Cao Wen ◽  
Hong Li ◽  
Yang Liu ◽  
Zhichao Fang ◽  
...  
Keyword(s):  
Finite Element ◽  
Diffusion Equation ◽  
Mixed Finite Element ◽  
Second Order ◽  
Stability And Convergence ◽  
Numerical Examples ◽  
The Stability ◽  
High Order Time ◽  
Distributed Order ◽  
Convergence Of The Scheme

In this article, some high-order time discrete schemes with an H 1 -Galerkin mixed finite element (MFE) method are studied to numerically solve a nonlinear distributed-order sub-diffusion model. Among the considered techniques, the interpolation approximation combined with second-order σ schemes in time is used to approximate the distributed order derivative. The stability and convergence of the scheme are discussed. Some numerical examples are provided to indicate the feasibility and efficiency of our schemes.

scholarly journals On the Effect of Finite Buffer Truncation in a Two-Node Jackson Network

2005 ◽  
Vol 42 (01) ◽  
pp. 199-222 ◽  
Author(s):  
Yutaka Sakuma ◽  
Masakiyo Miyazawa
Keyword(s):  
Stability Condition ◽  
Queue Length ◽  
Length Distribution ◽  
Buffer Size ◽  
Finite Buffer ◽  
Jackson Network ◽  
Numerical Examples ◽  
Queue Length Distribution ◽  
Special Cases ◽  
The Stability

We consider a two-node Jackson network in which the buffer of node 1 is truncated. Our interest is in the limit of the tail decay rate of the queue-length distribution of node 2 when the buffer size of node 1 goes to infinity, provided that the stability condition of the unlimited network is satisfied. We show that there can be three different cases for the limit. This generalizes some recent results obtained for the tandem Jackson network. Special cases and some numerical examples are also presented.

Sign in / Sign up

Export Citation Format

Share Document