Related Experiment Video
Updated: Feb 8, 2026

04:15
Author Spotlight: Enhancing Engineering Education via WebVR-Based Online Laboratories
Published on: February 23, 2024
1.7K
Two New Discrete-Time Neurodynamic Algorithms Applied to Online Future Matrix Inversion With Nonsingular or
IEEE Transactions on Cybernetics
|July 12, 2018
Summary
This study introduces a novel six-instant discretization (6ID) formula for approximating derivatives. New algorithms, 6ID-type discrete-time zeroing neurodynamic (DTZN) and gradient neurodynamic (DTGN), are developed for online future matrix inversion (OFMI), even with singular matrices.
Area of Science:
- Numerical Analysis
- Computational Neuroscience
- Robotics
Background:
- Continuous-time neurodynamic models are essential for solving complex dynamic problems.
- Existing discretization methods may lack precision, especially for time-varying systems.
- Online future matrix inversion (OFMI) is crucial in real-time control and signal processing.
Purpose of the Study:
- To propose a high-precision general discretization formula using six time instants (6ID).
- To develop and investigate novel discrete-time neurodynamic algorithms for OFMI.
- To address both nonsingular and sometimes-singular coefficient matrix scenarios in OFMI.
Main Methods:
- Development of a general six-instant discretization (6ID) formula for first-order derivatives.
- Discretization of continuous-time zeroing neurodynamic and gradient neurodynamic models using the 6ID formula.
- Formulation and analysis of 6ID-type discrete-time zeroing neurodynamic (DTZN) and gradient neurodynamic (DTGN) algorithms for OFMI.
Main Results:
- A specific 6ID formula is derived from the general one.
- The proposed 6ID-type DTZN and DTGN algorithms are shown to be effective for OFMI.
- The algorithms demonstrate robustness in handling both always-nonsingular and sometimes-singular coefficient matrices.
Conclusions:
- The proposed 6ID formula offers high-precision derivative approximation.
- The novel 6ID-type DTZN and DTGN algorithms provide efficient solutions for OFMI.
- These algorithms are validated through numerical examples, including robotic manipulator control, showcasing their practical advantages.
Related Concept Videos
Discrete-time Fourier transform
1.1K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.1K
Basic Discrete Time Signals
732
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
732
Discrete-Time Fourier Series
714
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
714
BIBO stability of continuous and discrete -time systems
943
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
943
Singularity Functions for Shear
452
In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the...
452
Coefficient of Variation
8.7K
The coefficient of variation measures the dispersion of the data points or distribution around the mean. Using the coefficient of variation, we can compare two data series with drastically different means or different units of measurement. The coefficient of variation for a sample and a population is expressed as a percentage of the ratio of standard deviation to the mean.
The coefficient of variation is a practical statistical tool in finance. It allows investors to assess the volatility or...
The coefficient of variation is a practical statistical tool in finance. It allows investors to assess the volatility or...
8.7K

