- 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
 The simultaneous approximation order by neural networks with a squashing function Bull. Korean Math. Soc. 2009 Vol. 46, No. 4, 701-712 https://doi.org/10.4134/BKMS.2009.46.4.701Printed July 1, 2009 Nahmwoo Hahm University of Incheon Abstract : In this paper, we study the simultaneous approximation to functions in $C^m [0,1]$ by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive. Keywords : simultaneous approximation, Bernstein polynomial, squashing function, neural network MSC numbers : Primary 41A10, 41A29, 65D15 Downloads: Full-text PDF