A Cutting method for finding discrete minimax with dropping of cutting planes maximum function. In the method some polyhedral set
approximates the epigraph of the objective function
On differential approximations of difference schemesThe concept of the first differential
approximation was introduced in the 1950s for the analysis
The method of secondary quantization in the strong bond approximationThe method of secondary quantization in the strong bond
approximation Рациональная аппроксимация функций Миттаг – Леффлера функции exp (z). It is shown that for m -1 ≤ n the Padé
approximants {πn,m(•; Fy)}, which locally
One approach to constructing cutting algorithms with dropping of cutting planes calculate iteration points by partially embeddimg the admissible set in
approximating polyhedral sets. We
Approximate methods of the decision differential the equations for continuous models of economy the review of
approximate methods of their decision. Expediency of use of this or that numerical methods
Fundamental mode exact schemes for unsteady problemsThe problem of increasing the accuracy of an
approximate solution is considered for boundary value
Uniform Wavelet-Approximation of Singular Integral Equation Solutions, the problem of its
approximate solution with obtaining uniform error estimates is very actual. This equation
Minimax approximation of a complex-valued function modulus by means of linear programming© 2016 IEEE.The problem of
approximating the complex-valued function modulus using a minimax