Comparison of Purely Greedy and Orthogonal Greedy Algorithm

IF 0.6 4区数学 Q3 MATHEMATICS

Mathematical Notes Pub Date : 2024-04-22 DOI:10.1134/s0001434624010048

K. S. Vishnevetskiy

引用次数: 0

Abstract

Conditions for a dictionary in a Hilbert space are obtained that are necessary or sufficient for the coincidence of purely greedy and orthogonal greedy algorithms with respect to this dictionary.

查看原文本刊更多论文

纯粹贪心算法与正交贪心算法的比较

摘要获得了希尔伯特空间中字典的条件，这些条件是纯粹贪婪算法和正交贪婪算法与该字典重合的必要或充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Mathematical Notes 数学-数学

CiteScore

0.90

自引率

16.70%

发文量

179

审稿时长

24 months

期刊介绍： Mathematical Notes is a journal that publishes research papers and review articles in modern algebra, geometry and number theory, functional analysis, logic, set and measure theory, topology, probability and stochastics, differential and noncommutative geometry, operator and group theory, asymptotic and approximation methods, mathematical finance, linear and nonlinear equations, ergodic and spectral theory, operator algebras, and other related theoretical fields. It also presents rigorous results in mathematical physics.