𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate algorithms with bounded absolute error for discrete extremal problems

✍ Scribed by R. G. Nigmatullin


Publisher
Springer US
Year
1978
Tongue
English
Weight
851 KB
Volume
14
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Constructive polynomial approximation wi
✍ L. JΓ³dar; A.E. Posso; H. CastejΓ³n πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 486 KB

In this paper, we consider an initial value problem y' = fi x, y), yi 0) = Y0, where f is a continuous function satisfying a Lipschitz condition. First, the function fix, y) is approximated by a Bernstein polynomial in two variables, Bnif; x,y), of an appropriate degree according to a prescribed acc

Frobenius-Chebyshev polynomial approxima
✍ B. Chen; R.Garcia BolΓ³s; L. JΓ³dar πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 578 KB

In this paper, we present a method for approximating the solution of initial value ordinary differential equations with a priori error bounds. The method is based on a Chebyshev perturbation of the original differential equation together with the Frobenius method for solving the equation. Chebyshev