Convergence of orthogonal greedy algorithm with errors in projectors
    
    
  
  
  
      
      
      
        
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2013), pp. 21-26
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			A model of orthogonal greedy algorithm is proposed. This model allows one to consider computational errors and to study the stability of this algorithm with respect to errors in projections onto subspaces. A criterion for the convergence of orthogonal greedy expansion to the expanded element is given in terms of computational errors.
			
            
            
            
          
        
      @article{VMUMM_2013_1_a3,
     author = {N. N. Fedotov},
     title = {Convergence of orthogonal greedy algorithm with errors in projectors},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {21--26},
     publisher = {mathdoc},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2013_1_a3/}
}
                      
                      
                    N. N. Fedotov. Convergence of orthogonal greedy algorithm with errors in projectors. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2013), pp. 21-26. http://geodesic.mathdoc.fr/item/VMUMM_2013_1_a3/
