Results 11 to 20 of about 72,703 (318)
Arab Journal of Mathematical Sciences, 2017 In this paper, we define and study subspace-diskcyclic operators. We show that subspace-diskcyclicity does not imply diskcyclicity. We establish a subspace-diskcyclic criterion and use it to find a subspace-diskcyclic operator that is not subspace ...
Nareen Bamerni, Adem Kılıçman
doaj +4 more sources
Subspace Polynomials and Cyclic Subspace Codes [PDF]
IEEE Transactions on Information Theory, 2015 Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and decoding algorithms.
Eli Ben-Sasson +3 more
openaire +2 more sources
Subspace Recovery From Structured Union of Subspaces [PDF]
IEEE Transactions on Information Theory, 2015 Lower dimensional signal representation schemes frequently assume that the signal of interest lies in a single vector space. In the context of the recently developed theory of compressive sensing (CS), it is often assumed that the signal of interest is sparse in an orthonormal basis.
Thakshila Wimalajeewa +2 more
openaire +2 more sources
Covering of subspaces by subspaces [PDF]
Designs, Codes and Cryptography, 2012 arXiv admin note: text overlap with arXiv:0805 ...
openaire +3 more sources
Journal of Mathematical Physics, 2017 We extend the notion of anticoherent spin states to anticoherent subspaces. An anticoherent subspace of order t is a subspace whose unit vectors are all anticoherent states of order at least t. We use Klein’s description of algebras of polynomials which are invariant under finite subgroups of SU(2) on C2 to provide constructions of anticoherent ...
Rajesh Pereira, Connor Paul-Paddock
openaire +2 more sources
ON SUBSPACES OF SUBSPACES OF A FINSLER SPACE
Demonstratio Mathematica, 1982 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Awasthi, G. D., Shukla, A. K.
openaire +2 more sources
Convergence of Restarted Krylov Subspaces to Invariant Subspaces [PDF]
SIAM Journal on Matrix Analysis and Applications, 2004 The authors prove estimates for the angle (strictly spoken: for the containment gap) between a searched invariant subspace of a general \(n\times n\) matrix and the subspace generated by Krylov subspace methods like the Arnoldi algorithm or the biorthogonal Lanczos algorithm.
Christopher Beattie +2 more
openaire +1 more source
CS Decomposition Based Bayesian Subspace Estimation [PDF]
, 2012 In numerous applications, it is required to estimate the principal subspace of the data, possibly from a very limited number of samples. Additionally, it often occurs that some rough knowledge about this subspace is available and could be used to improve
Besson, Olivier +2 more
core +1 more source
Remote Sensing, 2022 The classical multiple signal classification (MUSIC) algorithms mainly have two limitations. One is an insufficient number of snapshots, which usually causes an ill-posed sample covariance matrix in many real applications.
Xuejun Zhang, Dazheng Feng
doaj +1 more source
A Generalized Bootstrap Technique for Dependent Observations
Recoletos Multidisciplinary Research Journal, 2014 The bootstrap method for re-sampling essentially obtains the re-sampled observations from the empirical distribution function of the original data. The method relies heavily on the assumption of independence of the observations (iid).
Roberto N. Padua +2 more
doaj +1 more source