Results 21 to 30 of about 72,703 (318)
INVARIANT SUBSPACES IN THE BIDISC AND WANDERING SUBSPACES [PDF]
Abstract Let M be a forward-shift-invariant subspace and N a backward-shift-invariant subspace in the Hardy space H2 on the bidisc. We assume that $H^2=N \oplus M$ . Using the wandering subspace of M and N, we study the relations between M and N. Moreover we study M and N using several natural operators defined by shift operators on H2.
openaire +3 more sources
An Accurate and Efficient Device-Free Localization Approach Based on Sparse Coding in Subspace
In practical device-free localization (DFL) applications, for enlarging the monitoring area and improving localization accuracy, too many nodes need to be deployed, which results in a large volume of DFL data with high dimensions.
Huakun Huang +5 more
doaj +1 more source
This paper presents a subspace method of spot centroiding algorithm for locating the centers of laser spots. It focuses on how to find the position of the activated pixel which is the position of the imaged spot on the detector of the camera using ...
Azad Raheem Kareem
doaj +1 more source
GLRT-Based Direction Detectors in Homogeneous Noise and Subspace Interference [PDF]
In this paper, we derive and assess decision schemes to discriminate, resorting to an array of sensors, between the H0 hypothesis that data under test contain disturbance only (i.e., noise plus interference) and the H1 hypothesis that they also contain ...
Ricci, Giuseppe +12 more
core +1 more source
About Subspace-Frequently Hypercyclic Operators [PDF]
In this paper, we introduce subspace-frequently hypercyclic operators. We show that these operators are subspace-hypercyclic and there are subspace-hypercyclic operators that are not subspace-frequently hypercyclic. There is a criterion like to subspace-
Mansooreh Moosapoor, Mohammad Shahriari
doaj +1 more source
Cyclic subspace codes via subspace polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kamil Otal, Ferruh Özbudak
openaire +3 more sources
Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design, showing they are tight via explicit constructions.
Santonastaso, Paolo, Zullo, Ferdinando
openaire +5 more sources
A Probabilistic Subspace Bound with Application to Active Subspaces [PDF]
Given a real symmetric positive semi-definite matrix E, and an approximation S that is a sum of n independent matrix-valued random variables, we present bounds on the relative error in S due to randomization. The bounds do not depend on the matrix dimensions but only on the numerical rank (intrinsic dimension) of E.
John T. Holodnak +2 more
openaire +3 more sources
An \(n\)-dimensional vector space over the field \(F\) with \(q\) elements gives rise to an \((n-1)\)-dimensional projective space. The set of subspaces \(S\) of either space becomes a metric space by the subspace distance: \(d(U,U'):=\dim(U+U')-\dim(U\cap U')\), \(U,U'\in S\). These metric spaces are canonically isomorphic. The authors construct a \(q\
Antonio Cossidente, Francesco Pavese
openaire +4 more sources
Let \(T\) and \(D\) be the translation and unitary dilation operators on \(L^2(\mathbb{R})\) given by \((Tf)(t)= f(t- 1)\) and \((Df)(t)=\sqrt 2f(2t)\). An orthogonal wavelet for a subspace \(X\) of \(L^2(\mathbb{R})\) is a unit vector \(\psi\in X\) such that \(\{D^nT^m\psi: n,m\in\mathbb{Z}\}\) is an orthonormal basis of \(X\).
Dai, Xingde, Lu, Shijie
openaire +3 more sources

