نتایج جستجو برای: dense subspace

تعداد نتایج: 82205  

2005
S. Albeverio A. Konstantinov V. Koshmanenko

Let A be an unbounded from above self-adjoint operator in a separable Hilbert space H and EA(·) its spectral measure. We discuss the inverse spectral problem for singular perturbations à of A (à and A coincide on a dense set in H). We show that for any a ∈ R there exists a singular perturbation à of A such that à and A coincide in the subspace EA((−∞, a))H and simultaneously à has an additional...

1999
SEN-ZHONG HUANG

We establish the following result. Theorem. Let α : G → L(X) be a σ(X, X∗) integrable bounded group representation whose Arveson spectrum Sp(α) is scattered. Then the subspace generated by all eigenvectors of the dual representation α∗ is w∗ dense in X∗. Moreover, the σ(X, X∗) closed subalgebra Wα generated by the operators αt (t ∈ G) is semisimple. If, in addition, X does not contain any copy ...

Journal: :EURASIP J. Adv. Sig. Proc. 2007
Michael Ian Yang Williams Thushara D. Abhayapala Rodney A. Kennedy

We propose a new broadband beamformer design technique which produces an optimal receiver beam pattern for any set of field measurements in space and time. The modal subspace decomposition (MSD) technique is based on projecting a desired pattern into the subspace of patterns achievable by a particular set of space-time sampling positions. This projection is the optimal achievable pattern in the...

2013
Haim Avron Alex Druinsky Sivan Toledo

We describe a Krylov-subspace method for estimating the spectral condition number of a real matrix A or indicating that it is numerically rank deficient. The main difficulty in estimating the condition number is the estimation of the smallest singular value σmin of A. Our method estimates this value by solving a consistent linear least-squares problem with a known solution using a specific Kryl...

2015
Namrata Vaswani Chenlu Qiu Brian Lois Han Guo Jinchun Zhan

This work studies the problem of sequentially recovering a sparse vector St and a vector from a low-dimensional subspace Lt from knowledge of their sum Mt := Lt + St. If the primary goal is to recover the low-dimensional subspace in which the Lt’s lie, then the problem is one of online or recursive robust principal components analysis (PCA). An example of where such a problem might arise is in ...

Journal: :Applied Categorical Structures 2007
Marcel Erné Mai Gehrke Ales Pultr

From the work of Simmons about nuclei in frames it follows that a topological space X is scattered if and only if each congruence Θ on the frame of open sets is induced by a unique subspace A so that Θ = {(U, V ) |U ∩A = V ∩A}, and that the same holds without the uniqueness requirement iff X is weakly scattered (corrupt). We prove a seemingly similar but substantially different result about qua...

2004
VADIM KOSTRYKIN K. A. MAKAROV

Let A be a bounded self-adjoint operator on a separable Hilbert space H and H0 ⊂ H a closed invariant subspace of A. Assuming that H0 is of codimension 1, we study the variation of the invariant subspace H0 under bounded self-adjoint perturbations V of A that are off-diagonal with respect to the decomposition H = H0 ⊕ H1. In particular, we prove the existence of a one-parameter family of dense ...

2002
Dennis K. Burke Justin T. Moore

We study three problems which involve the nature of subspaces of the Sorgenfrey Line S. It is shown that no integer power of an uncountable subspace of S can be embedded in a smaller power of S. We review the known results about the existence of uncountable X ⊆ S where X is Lindelöf. These results about Lindelöf powers are quite set-theoretic. A descriptive characterization is given of those su...

2011
VAUGHN CLIMENHAGA

Multifractal analysis studies level sets of asymptotically defined quantities in a topological dynamical system. We consider the topological pressure function on such level sets, relating it both to the pressure on the entire phase space and to a conditional variational principle. We use this to recover information on the topological entropy and Hausdorff dimension of the level sets. Our approa...

Journal: :J. Graph Algorithms Appl. 2015
Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and each edge (u, v) is represented by the intersection between R(u) and R(v), if it belongs to a dense subgraph, or by a curve connecting the boundaries ofR(u) andR(v), otherwise. We study a notion of plana...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید