Orthogonal functions approach to the analysis of discrete-time systems is unnecessary (Q1389000): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4858729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Walsh operational matrices for analysis and optimal control of linear digital systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete pulse orthogonal functions for the analysis, parameter estimation and optimal control of linear digital systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and identification of discrete-time systems via discrete Legendre orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete pulse orthogonal functions for the analysis, parameter estimation and optimal control of linear time-varying digital systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of time-varying discrete systems using discrete Legendre orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and optimal control of discrete linear time-varying systems via discrete general orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series expansion approach to the analysis and identification of discrete Hammerstein systems / rank
 
Normal rank

Latest revision as of 11:58, 28 May 2024

scientific article
Language Label Description Also known as
English
Orthogonal functions approach to the analysis of discrete-time systems is unnecessary
scientific article

    Statements

    Orthogonal functions approach to the analysis of discrete-time systems is unnecessary (English)
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    The authors first present discrete orthogonal functions and their properties. Then, they discuss the analysis of various discrete-time systems: linear time invariant, linear time-varying described by state-space equations and by difference equations and also nonlinear systems. In all cases it is shown that the analysis of such systems does not provide any computational advantage over standard numerical techniques as the algorithms are nonrecursive; the computation involves the Kronecker product of matrices, increasing the size of matrices used in the algorithms and also involves inversion of large matrices.
    0 references
    discrete orthogonal functions
    0 references
    discrete-time systems
    0 references
    0 references

    Identifiers