2001
DOI: 10.1016/s0016-0032(00)00066-1
|View full text |Cite
|
Sign up to set email alerts
|

Transfer function computation for generalized n-dimensional systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2003
2003
2015
2015

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…This programming approach is described in Appendix. The third approach executes in each step of k the required iterations for each term separately by taking the advantage of the symmetry of the first and second term in the recursive formula (1). This programming approach is described in Appendix.…”
Section: Numerical Algorithmic Implementation Of Interpolationmentioning
confidence: 99%
See 1 more Smart Citation
“…This programming approach is described in Appendix. The third approach executes in each step of k the required iterations for each term separately by taking the advantage of the symmetry of the first and second term in the recursive formula (1). This programming approach is described in Appendix.…”
Section: Numerical Algorithmic Implementation Of Interpolationmentioning
confidence: 99%
“…Polynomial interpolation in several variables is a relatively new topic that has applications to many mathematical problems where the solution is a multivariate polynomial or polynomial matrix i.e. the computation of a) the inverse of a polynomial matrix that has applications in analysis and synthesis theory of Control Systems [5,8], b) the greatest common divisor [7], c) the determinant of a polynomial matrix [9], d) the solution of Diophantine equations [4], e) the transfer function of a multidimensional system [1], f) the generalized inverse of a polynomial matrix [6] e.t.c. The analytical solution of these problems leads to difficult and complex procedures that are very difficult to implement in a programming environment which must to supports symbolic operations.…”
Section: Introductionmentioning
confidence: 99%
“…Polynomial interpolation plays a crucial role in a number of applications such as : the calculation of the determinantal polynomial [8], [9], the computation of the transfer function of generalized n-dimensional systems [10], the solutions of polynomial matrix Diophantine equations [11], and the computation of the inverse or the generalized inverse of multivariable polynomial matrices [12], [13], [9], [14]. The Newton multivariate polynomial interpolation can be applied both to triangular and rectangular bases.…”
Section: Introductionmentioning
confidence: 99%
“…Some remarkable examples, but not the only ones of the use of DFT in linear algebra problems, are the calculation of the determinantal polynomial by [15], the computation of the transfer function of generalized n-dimensional systems by [1] and the solutions of polynomial matrix Diophantine equations by [9].…”
Section: Introductionmentioning
confidence: 99%
“…Note that in case of square and nonsingular matrices, both inverses coincide with the known inverse of the matrix. Therefore the computation of these special inverses gives rise also to applications where the usual inverse of a matrix is required such as the computation of the transfer function of a matrix ( [2], [1]). …”
Section: Introductionmentioning
confidence: 99%