On the Efficient Implementation of an Implicit Discrete-Time Differentiator

New methodologies are designed to reduce the time complexity of an implicit discrete-time differentiator and the simulation time to implement it. They rely on Horner's method and the Shaw-Traub algorithm. The algorithms are compared for differentiators of orders 3, 7, and 10. The Half-Horner and Full-Horner methods showed the best performance and time complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2021

A faster algorithm for Cops and Robbers

We present an algorithm of time complexity O(kn^k+2) deciding whether a ...
research
05/31/2020

A Fast Algorithm for Online k-servers Problem on Trees

We consider online algorithms for the k-servers problem on trees. There ...
research
02/06/2020

Data-based computation of stabilizing minimum dwell times for discrete-time switched linear systems

We present an algorithm to compute stabilizing minimum dwell times for d...
research
12/23/2022

Optimizing the half-gcd algorithm

In this paper, we propose a carefully optimized "half-gcd" algorithm for...
research
02/24/2023

Efficient Point Mass Predictor for Continuous and Discrete Models with Linear Dynamics

This paper deals with state estimation of stochastic models with linear ...
research
10/16/2017

A Fast Tree Algorithm for Electric Field Calculation in Electrical Discharge Simulations

The simulation of electrical discharges has been attracting a great deal...
research
11/19/2017

The destiny of constant structure discrete time closed semantic systems

Constant structure closed semantic systems are the systems each element ...

Please sign up or login with your details

Forgot password? Click here to reset