自动网格选择算法中出现的极大极小问题的初等解

SIGSAM Bull. Pub Date : 2000-12-01 DOI:10.1145/377626.377633

Robert M Corless

{"title":"自动网格选择算法中出现的极大极小问题的初等解","authors":"Robert M Corless","doi":"10.1145/377626.377633","DOIUrl":null,"url":null,"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.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An elementary solution of a minimax problem arising in algorithms for automatic mesh selection\",\"authors\":\"Robert M Corless\",\"doi\":\"10.1145/377626.377633\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/377626.377633\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/377626.377633","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

对自动网格选择中出现的极大极小问题进行了详细的解决。我们提供了两个结果的证明，虽然简单，但值得注意，特别是因为我们将需要它来建立二元近似多项式分解算法的复杂性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGSAM Bull.

自引率

0.00%

发文量