Recent theoretical developments are reviewed and associated algorithms are proposed to determine the numerical testability for large multi-input/multioutput systems. The modified nodal analysis and the usual techniques for the sensitivity computation in the frequency domain are used. According to the theoretical basis provided by S. Sen and R. Saeks (1979) the testability evaluation is related to the computation of the number of linearly independent columns in a convenient form of the sensitivity matrix with rational entries having a common denominator. By extending some results already obtained by G. Iuculano et al, it is shown that the above-mentioned number can be determined by computing the numerical rank of a matrix comprised of the coefficients obtained by expanding the numerators of the sensitivities in a suitable orthogonal polynomial series. The numerical rank computation is simplified, particularly for large systems, through an algorithm based on the estimation of the polynomial degrees, which is performed by the iterative comparison between the Chebyshev and the corresponding Stirling coefficients.

IMPROVEMENTS TO NUMERICAL TESTABILITY EVALUATION / Catelani M.; Iuculano G.; Liberatore A.; Manetti S.; Marini M.. - In: IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT. - ISSN 0018-9456. - STAMPA. - 36:(1987), pp. 902-907.

IMPROVEMENTS TO NUMERICAL TESTABILITY EVALUATION.

CATELANI, MARCANTONIO;MANETTI, STEFANO;MARINI, MAURO
1987

Abstract

Recent theoretical developments are reviewed and associated algorithms are proposed to determine the numerical testability for large multi-input/multioutput systems. The modified nodal analysis and the usual techniques for the sensitivity computation in the frequency domain are used. According to the theoretical basis provided by S. Sen and R. Saeks (1979) the testability evaluation is related to the computation of the number of linearly independent columns in a convenient form of the sensitivity matrix with rational entries having a common denominator. By extending some results already obtained by G. Iuculano et al, it is shown that the above-mentioned number can be determined by computing the numerical rank of a matrix comprised of the coefficients obtained by expanding the numerators of the sensitivities in a suitable orthogonal polynomial series. The numerical rank computation is simplified, particularly for large systems, through an algorithm based on the estimation of the polynomial degrees, which is performed by the iterative comparison between the Chebyshev and the corresponding Stirling coefficients.
1987
36
902
907
Catelani M.; Iuculano G.; Liberatore A.; Manetti S.; Marini M.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/645918
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 13
social impact