2017
DOI: 10.1007/s00025-017-0657-9
|View full text |Cite
|
Sign up to set email alerts
|

Exact K-g-Frames in Hilbert Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Kframes allow us in a stable way, to reconstruct elements from the range of a linear and bounded operator in a Hilbert space. K-g-frames have been introduced in [3,11] and some properties and characterizations of K-g-frames has been obtained, for more information on K-gframes, the reader can check [11,20]. In this paper, we generalize some results in [11] and [20] to continuous version of frames.…”
Section: Introductionmentioning
confidence: 86%
“…Kframes allow us in a stable way, to reconstruct elements from the range of a linear and bounded operator in a Hilbert space. K-g-frames have been introduced in [3,11] and some properties and characterizations of K-g-frames has been obtained, for more information on K-gframes, the reader can check [11,20]. In this paper, we generalize some results in [11] and [20] to continuous version of frames.…”
Section: Introductionmentioning
confidence: 86%
“…From [20] we know that the properties between g-frames and Kg-frames are quite different, e.g., a g-Bessel sequence Λ := {Λ j ∈ L(U, V j ) : j ∈ J} is a g-frame for U, iff its synthesis operator T Λ is surjective on U (see [25]), but for K-g-frames, a g-Bessel sequence {Λ j ∈ L(U, V j ) : j ∈ J} is a K-g-frame for U, is equivalent to the synthesis operator T Λ being bounded and R(K) ⊆ R(T Λ ) (see [20]). For more information on K-g-frame and its special case K-frame, readers can refer to the [10,[18][19][20]. In this paper we will give a sufficient condition for a g-Bessel sequence to be an exact K g-frame (see Theorem 3.1).…”
Section: Introductionmentioning
confidence: 99%