2010•Journal of King Saud University - ScienceOpen access

A note on fuzzy best approximation using Chebyshev’s polynomials

Omid Solaymani Fard, Razieh BeheshtAien

Abstract

This paper deals with the best approximation for fuzzy valued functions using Chebyshev nodes. We prove a result on the best near-minimax approximation in the fuzzy sense. As an application, Runge’s phenomenon is fuzzified in two different cases, i.e. the best approximation and the best near-minimax approximation.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Minimax approximation algorithm, Equioscillation theorem, Minimax, Approximation theory, Mathematics, Chebyshev filter, Chebyshev polynomials, Fuzzy logic