We survey the definitions and use of rank-revealingmatrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both diagonal (eigenvalue and singular value) decompositions and rank-revealing triangular decompositio...

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. The algorithm consists essentially of Gauss’ upper triangular form algorithm. It is proved that the basis of the ideal of algebraic relations found by the algorithm consists of polynomials having coefficie...

In the MUSIC approach for multiple emitter location, the array covariance matrix is a Hermite matrix. In order to realize the MUSIC approach, we have to do the work of eigenvalue-based decomposition of the Hermite matrix. This paper proves that the problem of Hermite matrix decomposition can be transformed into the problem of real symmetric matrix decomposition, and the article gives the detail...

We consider the coupling across an interface of a fluid flow and a porous media flow. The differential equations involve Stokes equations in the fluid region and Darcy equations in the porous region, and a coupling through an interface with Beaver-Joseph-Saffman transmission conditions. The discretization consists of P2/P1 triangular Taylor-Hood finite elements in the fluid region, the lowest o...

We propose a hyperbolic counterpart of the Schur decomposition, with the emphasis on the preservation of structures related to some given hyperbolic scalar product. We give results regarding the existence of such a decomposition and research the properties of its block triangular factor for various structured matrices.

In this paper parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n2), and the O(n 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs the class of NC and that the time and processors bounds are of O(log2n) and to O(n4), respectively. Howeve...