An elementary solution of a minimax problem arising in algorithms for automatic mesh selection

Abstract

We fill in some details in the solution of a minimax problem arising in automatic mesh selection. We supply two proofs of a result that, while simple, deserves the attention, in particular because we will need it to establish the complexity of an algorithm for factorization of bivariate approximate polynomials in an upcoming paper.