- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 A note on greedy algorithm Bull. Korean Math. Soc. 2001 Vol. 38, No. 2, 293-302 Nahmwoo Hahm and Bum Il Hong University of Incheon, Kyung Hee University Abstract : We improve the greedy algorithm which is one of the general convergence criterion for certain iterative sequence in a given space by building a constructive greedy algorithm on a normed linear space using an arithmetic average of elements. We also show the degree of approximation order is still $\O (1/ \sqrt{n})$ by a bounded linear functional defined on a bounded subset of a normed linear space, which offers a good approximation method for neural networks. Keywords : approximation with constraints, approximation by arbitrary nonlinear expressions; widths and entropy MSC numbers : 41A29, 41A46 Downloads: Full-text PDF