Abstract
We obtain an optimal approximation of the block orthogonal greedy algorithm with regard to g-frames in Hilbert spaces and prove an optimal approximation result analogous to the result obtained by E. D. Livshitz [15] using dictionaries.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
