for a bounded linear operator on hilbert space we define a sequence of the so-called weakly extremal vectors‎. ‎we study the properties of weakly extremal vectors and show that the orthogonality equation is valid for weakly extremal vectors‎. ‎also we show that any quasinilpotent operator $t$ has an hypernoncyclic vector‎, ‎and so $t$ has a nontrivial hyperinvariant subspace‎.

For a bounded linear operator on Hilbert space we define a sequence of the so-called weakly extremal vectors‎. ‎We study the properties of weakly extremal vectors and show that the orthogonality equation is valid for weakly extremal vectors‎. ‎Also we show that any quasinilpotent operator $T$ has an hypernoncyclic vector‎, ‎and so $T$ has a nontrivial hyperinvariant subspace‎.

 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...