A simple algorithm for lattice reduction of polynomial matrices is described and analysed. The algorithm is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation. © 2003 Elsevier Science Ltd. All rights reserved.

in this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf f}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf f}$ of positive characteristic $p$. moreover, we find a one-to-one correspondence between $p$-semiline...

quadratic equation is eigen-decomposed to build a linear This paper proposes a linear algorithm for metric equation to compute the projective-to-Euclidean trans-reconstruction from projective reconstruction. Metric formation matrix. reconstruction problem is equivalent to estimating the projective transformation matrix that converts projective reconstruction to Euclidean reconstruction. We buil...

The semidefinite matrix rank minimization, which has a broad range of applications in system control, statistics, network localization, econometrics and so on, is computationally NPhard in general due to the noncontinuous and non-convex rank function. A natural way to handle this type of problems is to substitute the rank function into some tractable surrogates, most popular ones of which inclu...

The semidefinite matrix rank minimization, which has a broad range of applications in system control, statistics, network localization, econometrics and so on, is computationally NPhard in general due to the noncontinuous and non-convex rank function. A natural way to handle this type of problems is to substitute the rank function into some tractable surrogates, most popular ones of which inclu...

Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.