In the rst part 13] of the paper transformationsmappingToeplitz and Toeplitz-plus-Hankel matrices into generalizedCauchy matrices were studied. In this second part fast algorithms for LU-factorization and inversion of generalized Cauchy matrices are discussed. It is shown that the combinationof transformation pivoting techniques leads to algorithms for indeenite Toeplitz and Toeplitz-plus-Hanke...

We prove that the Jordan Normal Form of a rational matrix can be computed exactly in polynomial time. We obtain the transformation matrix and its inverse exactly, and we show how to apply the basis transformation to any commuting matrices.

Independent component analysis (ICA) finds a linear transformation to variables that are maximally statistically independent. We examine ICA and algorithms for finding the best transformation from the point of view of maximizing the likelihood of the data. In particular, we discuss the way in which scaling of the unmixing matrix permits a "static" nonlinearity to adapt to various marginal densi...

Independent Components Analysis nds a linear transformation to variables which are maximally statistically independent. We examine ICA and algorithms for nding the best transformation from the point of view of maximising the likelihood of the data. In particular, examine the way in which scaling of the unmixing matrix permits a \static" nonlinearity to adapt to various margninal densities. We d...

There are currently five transformation matrices being considered for use in the linear chromatic-adaptation transform in a revision of the CIECAM97s color appearance model. Four of the matrices were developed independently for the purpose of transforming tristimulus values to spectrally sharpened RGB responses. The fifth is the HuntPointer-Estevez transform of CIE tristimulus values to normali...

Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...

Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...