U.S.S.R. Computational Mathematics and Mathematical PhysicsPergamon Press, 1970 - Computers |
Contents
Regularising algorithms for finding a stable normal solution for an equation | 20 |
The best uniform approximation for functions of several arguments | 28 |
The solution of minimaximin problems | 44 |
Copyright | |
33 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algorithm approximation arbitrary associative calculus assume asymptotic expansions boundary layer bounded calculations Chebyshev Chebyshev approximation coefficients components consider constraints construct contour convergence convex coordinates corresponding defined denote determine differential equations e₁ elements equivalent exists finite fixed point floating point formula function g(x G₁ G₁n G₂ Go given graph graph-scheme graph-scheme VT Hence hyperplanes inequality inf inf sup integral kernel Lemma linear linearly independent matrix maximum principle method minimal Moscow Nauk necessary conditions non-zero obtain operator optimal control P₁ parameters polynomials Proof proved region respect saddle-point satisfied scheme segment sequence set F solution of problem solving space stationary point sup inf inf t₁ Theorem Umax values variables vector vychisl word y₁ zero дх