نتایج جستجو برای: hilbert c

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

2005
WILLIAM ARVESON

We initiate a study of Hilbert modules over the polynomial algebra A = C[z1, . . . , zd] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity version of one of these. Standard Hilbert modules occupy a position analogous to that of free modules of finite rank in commutative algebra, and their quot...

2000
MICHAEL FRANK

Hilbert(ian) A-modules over finite von Neumann algebras with a faithful normal trace state (from global analysis) and Hilbert W*-modules over A (from operator algebra theory) are compared, and a categorical equivalence is established. The correspondence between these two structures sheds new light on basic results in L-invariant theory providing alternative proofs. We indicate new invariants fo...

2000
Michael Frank David R. Larson

We give a comprehensive introduction to a general modular frame construction in Hilbert C*-modules and to related linear operators on them. The Hilbert space situation appears as a special case. The reported investigations rely on the idea of geometric dilation to standard Hilbert C*-modules over unital C*-algebras that admit an orthonormal modular Riesz basis. Interrelations and applications t...

Hilbert frames theory have been extended to frames in Hilbert $C^*$-modules. The paper introduces equivalent $*$-frames and presents ordinary duals of a constructed $*$-frame by an adjointable and invertible operator. Also, some necessary and sufficient conditions are studied such that $*$-frames and ordinary duals or operator duals of another $*$-frames are equivalent under these conditions. W...

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

Journal: :Periodica Mathematica Hungarica 2005
Maria Joita

In this paper we study the unitary equivalence between Hilbert modules over a locally C∗-algebra. Also, we prove a stabilization theorem for countably generated modules over an arbitrary locally C∗-algebra and show that a Hilbert module over a Fréchet locally C∗-algebra is countably generated if and only if the locally C∗-algebra of all ”compact” operators has an approximate unit. 2000 Mathemat...

2007
Huimin He Rudong Chen Jerzy Jezierski

Throughout this paper, letH be a real Hilbert space with inner product 〈·,·〉 and ‖ · ‖. We use xn⇀ x to indicate that the sequence {xn} converges weakly to x. Similarly, xn → x will symbolize strong convergence. we denote by N and R+ the sets of nonnegative integers and nonnegative real numbers, respectively. let C be a closed convex subset of a Hilbert space H , and Let T : C → C be a nonexpan...

Journal: :bulletin of the iranian mathematical society 2016
k. sharifi behnaz a. bonakdar

suppose $t$ and $s$ are moore-penrose invertible operators betweenhilbert c*-module. some necessary and sufficient conditions are given for thereverse order law $(ts)^{ dag} =s^{ dag} t^{ dag}$ to hold.in particular, we show that the equality holds if and only if $ran(t^{*}ts) subseteq ran(s)$ and $ran(ss^{*}t^{*}) subseteq ran(t^{*}),$ which was studied first by greville [{it siam rev. 8 (1966...

2008
K. SHARIFI

In this notes unbounded regular operators on Hilbert C∗-modules over arbitrary C∗-algebras are discussed. A densely defined operator t possesses a densely defined adjoint operator if the graph of t is an orthogonal summand. Moreover, for a densely defined operator t the graph of t is orthogonally complemented if and only if t is regular. For a given C∗-algebra A any densely defined A-linear clo...

Journal: :Softw., Pract. Exper. 2007
Ningtao Chen Nengchao Wang Baochang Shi

An iterative algorithm is described, based on the replication process of the Hilbert matrix, for encoding and decoding the Hilbert order. The time complexity of the proposed algorithm is smaller than those published previously, and the space complexity is bounded by a constant. Moreover, the new algorithm has a wider applicability when compared with existing algorithms for certain machine-word ...

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

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