In this paper, recent results by Petersen and Ran on the J-spectral factorization problem to rational matrix functions with constant signature that are not necessarily analytic at infinity are extended. In particular, a full parametrization of all J̃-spectral factors that have the same pole pair as a given square J-spectral factor is given. In this case a special realization involving a quintet ...

A new numerical scheme for computing balancing coordinate transformations for signature symmetric realizations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and hyperbolic Jacobi-type rotations is considered. The algorithm is shown to be glob...

with the increase of communication and financial transaction through internet, on-line signature verification is an accepted biometric technology for access control and plays a significant role in authenticity and authorization in modernized society. therefore, fast and precise algorithms for the signature verification are very attractive. the goal of this paper is modeling of velocity signal t...

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

The main goal of this research was to propose a new method polarimetric SAR data decomposition that will extract additional information from the Synthetic Aperture Radar (SAR) images compared other existing methods. Most current methods are based on scattering, covariance or coherence matrices describing radar wave-scattering phenomenon represented in single pixel an image. A lot different have...

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses sup W2P k(W 1 2 X) + W 1 2 k 2 of a matrix X where P is a set of diagonal positive deenite matrices. We improved their results to obtain the ...

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O’Leary obtained an upper bound for scaled pseudoinverses sup W∈P ‖(W 12X)+W 2 ‖2 of a matrix X where P is a set of diagonal positive definite matrices. We improved their results to obtain the suprem...

let a; b; k 2 k and u ; v 2 u(k). we show for any idempotent e 2 k, ( a 0 b 0 ) is e-clean i ( a 0 u(vb + ka) 0 ) is e-clean and if ( a 0 b 0 ) is 0-clean, ( ua 0 u(vb + ka) 0 ) is too.

One of the characteristic features of the fundamental group of a closed 3manifold is that its representation variety in a compact Lie group tends to be finite, in a properly understood sense. This has been a guiding principle for defining invariants of 3-manifolds ever since Casson defined his λ-invariant for integral homology 3-spheres via a signed count of the SU(2) representations of the fun...

Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which w...