Scalar linear time-varying systems are addressed. In particular, a new factorization method for the associated scalar polynomial system differential operator is presented. It differs from the classical results due to Cauchy and Floquet, in that it is based upon successive Riccati transformations of the Frobenius companion system matrix. As a consequence, the factorization is obtained in terms o...

Based on the upper-triangular Hessenberg forms for descriptor linear systems and a method for right coprime factorization of descriptor linear systems using matrix elementary transformations, a simple, neat and numerically stable iterative formula for right coprime factorization of a regular singleinput descriptor linear system is proposed. This iterative formula gives directly the coefficients...

This note presents a deterministic integer factorization algorithm based on a system of polynomials equations. This technique exploits a new idea in the construction of irreducible polynomials with parametized roots, and recent advances in polynomial lattices reduction methods. The main result establishes a new deterministic time complexity bench mark. 1 Introduction This note presents a determ...

Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...

The WZ factorization for the solution of symmetric positive definite banded linear systems when combined with a partitioned scheme, renders a divide and conquer algorithm. The WZ factorization of the coefficient matrix in each block has the properties: the vector [a1, . . . , aβ , 0, . . . , 0, an−β+1, . . . , an] is invariant under the transformation W where β is the semibandwidth of the coeff...

This paper describes the design and implementation of three core factorization routines—LU, QR, and Cholesky—included in the out-of-core extension of ScaLAPACK. These routines allow the factorization and solution of a dense system that is too large to fit entirely in physical memory. The full matrix is stored on disk and the factorization routines transfer sub-matrice panels into memory. The ‘l...

In a paper of 1974, Brian Day employed a notion of factorization system in the context of enriched category theory, replacing the usual diagonal lifting property with a corresponding criterion phrased in terms of hom-objects. We set forth the basic theory of such enriched factorization systems. In particular, we establish stability properties for enriched prefactorization systems, we examine th...

in this paper, we study the arens regularity properties of module actions and we extend some proposition from baker, dales, lau and others into general situations. we establish some relationships between the topological centers of module actions and factorization properties of them with some results in group algebras. in 1951 arens shows that the second dual of banach algebra endowed with the e...

The problem of factorization of a nonextensive probability distribution is discussed. It is shown that the correlation energy between the correlated subsystems in the canonical composite system can not be neglected even in the thermodynamic limit. In consequence, the factorization approximation should be employed carefully according to different systems. It is also shown that the zeroth law of ...