AbstractRecursive matrices—bi-infinite matrices such that each row can be recursively computed from the previous one—have been revealed to be a useful tool in the study of signal analysis and filter theory. In particular, recursive Toeplitz and Hurwitz matrices are used in [3] to give an algebraic interpretation of signal processing. In this work we introduce the notion of block recursive matrix, and we show that an important property of scalar recursive matrices, namely, the product rule, also holds in the case of block matrices. We also give conditions under which a block Hurwitz matrix of step k can be seen as a scalar Hurwitz matrix of the same step
We consider a special type of signal restoration problem where some of the sampling data are not ava...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
We relate polynomial computations with operations involving infinite band Toeplitz matrices and show...
AbstractRecursive matrices—bi-infinite matrices such that each row can be recursively computed from ...
AbstractBanded Toeplitz and Hurwitz matrices are shown to be particular cases of a more general clas...
This thesis deals with the connections between the theory of block Toeplitz matrices and integrable ...
AbstractConditions for a nonsingular matrix to have a block Toeplitz inverse are obtained. A simpler...
A set of formulas is given for the relations that exist between the first or last b;ock row or colum...
AbstractIt has recently been shown in (M. Barnabei, L.B. Montefusco, Linear Algebra and applications...
We discuss two methods to obtain the spectral factorizations of the inverse of a bi-infinite real bl...
AbstractA set of formulas is given for the relations that exist between the first and last block now...
This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz ...
In this paper we review some numerical methods for the computation of the spectral factorization of ...
AbstractThe theory of block recursive matrices has been revealed to be a flexible tool in order to e...
AbstractWe relate polynomial computations with operations involving infinite band Toeplitz matrices ...
We consider a special type of signal restoration problem where some of the sampling data are not ava...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
We relate polynomial computations with operations involving infinite band Toeplitz matrices and show...
AbstractRecursive matrices—bi-infinite matrices such that each row can be recursively computed from ...
AbstractBanded Toeplitz and Hurwitz matrices are shown to be particular cases of a more general clas...
This thesis deals with the connections between the theory of block Toeplitz matrices and integrable ...
AbstractConditions for a nonsingular matrix to have a block Toeplitz inverse are obtained. A simpler...
A set of formulas is given for the relations that exist between the first or last b;ock row or colum...
AbstractIt has recently been shown in (M. Barnabei, L.B. Montefusco, Linear Algebra and applications...
We discuss two methods to obtain the spectral factorizations of the inverse of a bi-infinite real bl...
AbstractA set of formulas is given for the relations that exist between the first and last block now...
This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz ...
In this paper we review some numerical methods for the computation of the spectral factorization of ...
AbstractThe theory of block recursive matrices has been revealed to be a flexible tool in order to e...
AbstractWe relate polynomial computations with operations involving infinite band Toeplitz matrices ...
We consider a special type of signal restoration problem where some of the sampling data are not ava...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
We relate polynomial computations with operations involving infinite band Toeplitz matrices and show...