Method of nose stretching in Newton's problem of minimal resistance
Optimization and Control
2021-08-11 v2 Metric Geometry
Abstract
We consider the problem (Newton's problem) and its generalizations. In the paper \cite{BrFK} it is proved that if a solution is in an open set then in . It follows that graph does not contain extreme points of the subgraph of . In this paper we prove a somewhat stronger result. Namely, there exists a solution possessing the following property. If is in an open set then graph does not contain extreme points of the convex body . As a consequence, we have C_u = \text{\rm Conv} (\overline{\text{\rm SingC_u}}), where Sing denotes the set of singular points of . We prove a similar result for a generalized Newton's problem.
Keywords
Cite
@article{arxiv.2003.06682,
title = {Method of nose stretching in Newton's problem of minimal resistance},
author = {Alexander Plakhov},
journal= {arXiv preprint arXiv:2003.06682},
year = {2021}
}
Comments
28 pages, 5 figures