Max-Product Shepard Approximation Operators

Barnabás Bede*, Hajime Nobuhara, János Fodor, Kaoru Hirota

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)

Abstract

In crisp approximation theory the operations that are used are only the usual sum and product of reals. We propose the following problem: are sum and product the only operations that can be used in approximation theory? As an answer to this problem we propose max-product Shepard approximation operators and we prove that these operators have very similar properties to those provided by the crisp approximation theory. In this sense we obtain uniform approximation theorem of Weierstrass type, and Jackson-type error estimate in approximation by these operators.

Original languageEnglish
Pages (from-to)494-497
Number of pages4
JournalJournal of Advanced Computational Intelligence and Intelligent Informatics
Volume10
Issue number4
DOIs
Publication statusPublished - Jul 2006
Externally publishedYes

Keywords

  • Shepard approximation
  • max-product approximation operators

Fingerprint

Dive into the research topics of 'Max-Product Shepard Approximation Operators'. Together they form a unique fingerprint.

Cite this