Displaying similar documents to “Solving a permutation problem by a fully polynomial-time approximation scheme”

Greedy Algorithms for Adaptive Approximation

Albert Cohen (2009)

Bollettino dell'Unione Matematica Italiana

Similarity:

We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...

Polynomial approximations and universality

A. Mouze (2010)

Studia Mathematica

Similarity:

We give another version of the recently developed abstract theory of universal series to exhibit a necessary and sufficient condition of polynomial approximation type for the existence of universal elements. This certainly covers the case of simultaneous approximation with a sequence of continuous linear mappings. In the case of a sequence of unbounded operators the same condition ensures existence and density of universal elements. Several known results, stronger statements or new results...

Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica

Kyurkchiev, Nikolay, Andreev, Andrey (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.1.2. Moduli for numerical finding of the polynomial of the best Hausdorff approximation of the functions which differs from zero at just one point or having one jump and partially constant in programming environment MATHEMATICA are proposed. They are tested for practically important functions and the results are graphically illustrated. These moduli can be used for scientific research as well in teaching process of Approximation...

Approximation of abstract linear integrodifferential equations

Hirokazu Oka, Naoki Tanaka (2000)

Studia Mathematica

Similarity:

This paper is devoted to the approximation of abstract linear integrodifferential equations by finite difference equations. The result obtained here is applied to the problem of convergence of the backward Euler type discrete scheme.

Approximate maximum principle for discrete approximations of optimal control systems with nonsmooth objectives and endpoint constraints

Boris S. Mordukhovich, Ilya Shvartsman (2013)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The paper studies discrete/finite-difference approximations of optimal control problems governed by continuous-time dynamical systems with endpoint constraints. Finite-difference systems, considered as parametric control problems with the decreasing step of discretization, occupy an intermediate position between continuous-time and discrete-time (with fixed steps) control processes and play a significant role in both qualitative and numerical aspects of optimal control. In this paper...