Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Antonio Fazzi"'
Publikováno v:
International Journal of Adaptive Control and Signal Processing. 36:870-881
Autor:
Antonio Fazzi
Publikováno v:
Numerical Algorithms.
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 42:1553-1580
We propose and study an algorithm for computing a nearest passive system to a given nonpassive linear time-invariant system (with much freedom in the choice of the metric defining “nearest,” which ...
Publikováno v:
Econometrics and Statistics.
The low-rank approximation problem, that is the problem of approximating a given matrix with a matrix of lower rank, appears in many scientific fields. In some applications the given matrix is structured and the approximation is required to have the
Publikováno v:
2021 29th European Signal Processing Conference (EUSIPCO).
We consider the problem of detecting the common dynamic among several observed signals. It has been shown in (Markovsky et al., 2019) that the problem is equivalent to a generalization of the classical Hankel low-rank approximation to the case of mul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36c1d04708fb0ae4d88117b6303df97a
https://doi.org/10.1016/j.ifacol.2021.08.342
https://doi.org/10.1016/j.ifacol.2021.08.342
Rank deficient Hankel matrices are at the core of several applications. However, in practice, the coefficients of these matrices are noisy due to e.g. measurements errors and computational errors, so generically the involved matrices are full rank. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baafd5e172bf4992ac6760f04e147c70
Publikováno v:
CDC
We consider the problem of computing (approximate) greatest common divisors for matrix polynomials and we present some related facts and applications in system and control theory. The main application is to compute the distance of a controllable mult
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific literature in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62c35bc7031aa8c369d269dd51c1e77b
http://arxiv.org/abs/1907.13101
http://arxiv.org/abs/1907.13101
Computing the greatest common divisor of a set of polynomials is a problem which plays an important role in different fields, such as linear system, control, and network theory. In practice, the polynomials are obtained through measurements and compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc5da3c19a426065cc5eacafd682c481
http://hdl.handle.net/11697/130590
http://hdl.handle.net/11697/130590