Affiliation:
1. Department of Applied Mathematics, University of Western Ontario, London, CANADA N6A 5B7
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献