RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2014 Volume 14, Issue 4(2), Pages 526–532 (Mi isu545)

Mathematics

About the Retrofit of the Valle'e–Poussin's Algorithm for Approximations of Multivalued Mappings by Algebraic Polynomial with Type Constraint Equality

I. Yu. Vygodchikova

Saratov State University, 83, Astrakhanskaya str., Saratov, 410012, Russia

Abstract: The discrete approximation of noisy data by algebraic polynomial with restriction of type equality is studied. The aim of the investigation is to obtain the fundamental properties of solution of the problem and development by them the new algorithm, more effective, in comparison with existing methods of the solution. The tasks of the research — gets the properties of the solution of the problem, presentation of the algorithm and the demonstration of its implementation. Research methodology continues P. L. Chebyshjov's and Valle–Pussen's method. Results. The criterion for optimality of the solution, which is a retrofit of the well-known in the theory of approximations of alternance P. L. Chebyshjov. Developed a rational algorithm, similar to the algorithm Vallee–Poussin. The conclusions. This problem has application to assess noise events at approximation to complex chaotic processes.

Key words: minimax, multivalued mapping, approximating polynomial, solutions's properties, computational algorithm.

UDC: 517.518.826, 519.65

DOI: 10.18500/1816-9791-2014-14-4-526-532



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024