This paper presents the performance analysis of directions of arrival estimation techniques, Subspace and the Non-Subspace methods. In this paper, exploring the Eigen-analysis category of high resolution and super resolution algorithms, presentation of description, comparison and the performance and resolution analyses of these algorithms are made. Sensitivity to various perturbations and the e...

In this article we develop algorithms for data assimilation based upon a computational time dependent stable/unstable splitting. Our particular method is based upon shadowing refinement and synchronization techniques and is motivated by work on Assimilation in the Unstable Subspace (AUS) [10, 53, 41] and Pseudo-orbit Data Assimilation (PDA) [32, 31, 24]. The algorithm utilizes time dependent pr...

Efficient and compact representation of images is a fundamental problem in computer vision. Principal Component Analysis (PCA) has been widely used for image representation and has been successfully applied to many computer vision algorithms. In this paper, we propose a method that uses Haar-like binary box functions to span a subspace which approximates the PCA subspace. The proposed method ca...

Abstract Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation matrices, and use it to define new pseudo-metric on space matrices. Moreover, show that such is metric subspace adjacency or Laplacian matrices for graphs. Hence, particular, obtain isomorphism classes Additionally, study how some properties graphs translate this measure ...

Abstract We study the computational complexity of satisfiability problem and complement equivalence for complemented (orthocomplemented) modular lattices L classes thereof. Concerning a simple finite height, $$\mathcal {NP}$$ NP -hardness is shown both problems. Moreover, problems are to be polynomial-time eq...

Abstract. We introduce a reduction technique for the well-known TSP. The basic idea of the approach consists of transforming a TSP instance to another one with smaller dimension by contracting pseudo backbone edges computed in a preprocessing step, where pseudo backbone edges are edges which are likely to be in an optimal tour. A tour of the small instance can be retransformed to a tour of the ...

Let n and d be natural integers satisfying n ≥ 3 and d ≥ 10. Let X be an irreducible real hypersurface X in Pn of degree d having many pseudo-hyperplanes. Suppose that X is not a projective cone. We show that the arrangement H of all d − 2 pseudo-hyperplanes of X is trivial, i.e., there is a real projective linear subspace L of Pn(R) of dimension n−2 such that L ⊆ H for all H ∈ H. As a conseque...

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.