{"title":"一个用线性规划求实有理函数最优逼近的程序","authors":"N. Papamarkos","doi":"10.1016/0141-1195(89)90034-X","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents a Turbo-Basic program that implements an algorithm for the optimum approximation of real rational functions via linear-programming. The formulation of the linear problem is based on the minimization of a minimax criterion, while its solution is derived through the dual problem. This algorithm is much faster and requires less storage than other approximation techniques. The program is implemented on an IBM-PC AT and tested by several examples. Analytical examples are presented to illustrate how the program is used and the effectiveness of the algorithm.</p></div>","PeriodicalId":100043,"journal":{"name":"Advances in Engineering Software (1978)","volume":"11 1","pages":"Pages 37-48"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0141-1195(89)90034-X","citationCount":"6","resultStr":"{\"title\":\"A program for the optimum approximation of real rational functions via linear programming\",\"authors\":\"N. Papamarkos\",\"doi\":\"10.1016/0141-1195(89)90034-X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper presents a Turbo-Basic program that implements an algorithm for the optimum approximation of real rational functions via linear-programming. The formulation of the linear problem is based on the minimization of a minimax criterion, while its solution is derived through the dual problem. This algorithm is much faster and requires less storage than other approximation techniques. The program is implemented on an IBM-PC AT and tested by several examples. Analytical examples are presented to illustrate how the program is used and the effectiveness of the algorithm.</p></div>\",\"PeriodicalId\":100043,\"journal\":{\"name\":\"Advances in Engineering Software (1978)\",\"volume\":\"11 1\",\"pages\":\"Pages 37-48\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0141-1195(89)90034-X\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Engineering Software (1978)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/014111958990034X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Engineering Software (1978)","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/014111958990034X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A program for the optimum approximation of real rational functions via linear programming
This paper presents a Turbo-Basic program that implements an algorithm for the optimum approximation of real rational functions via linear-programming. The formulation of the linear problem is based on the minimization of a minimax criterion, while its solution is derived through the dual problem. This algorithm is much faster and requires less storage than other approximation techniques. The program is implemented on an IBM-PC AT and tested by several examples. Analytical examples are presented to illustrate how the program is used and the effectiveness of the algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
