A radial basis function network approach for the computation of inverse continuous time variant functions
Related Experiment Videos
René V Mayorga1, Jonathan Carrera
1Faculty of Engineering, University of Regina, Regina, Saskatchewan, Canada. Rene.mayorga@uregina.ca
Abstract:
This Paper presents an efficient approach for the fast computation of inverse continuous time variant functions with the proper use of Radial Basis Function Networks (RBFNs). The approach is based on implementing RBFNs for computing inverse continuous time variant functions via an overall damped least squares solution that includes a novel null space vector for singularities prevention. The singularities avoidance null space vector is derived from developing a sufficiency condition for singularities prevention that conduces to establish some characterizing matrices and an associated performance index.
Related Concept Videos
Introduction to Vector Functions
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Basic Continuous Time Signals
The unit step function, denoted u(t), is zero for negative time values and one for positive time values, exhibiting a discontinuity at t=0. This function often represents abrupt changes, such as the step voltage introduced when turning a car's...
Inverse z-Transform by Partial Fraction Expansion
To begin the process, the poles of the function are identified and the function is...
Classification of Systems-II
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...