首页   按字顺浏览 期刊浏览 卷期浏览 General programmes for least pth and near minimax approximation
General programmes for least pth and near minimax approximation

 

作者: J. R. POPOVIĆ,   J. W. BANDLER,   C. CHARALAMBOUS,  

 

期刊: International Journal of Systems Science  (Taylor Available online 1974)
卷期: Volume 5, issue 10  

页码: 907-932

 

ISSN:0020-7721

 

年代: 1974

 

DOI:10.1080/00207727408920149

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

User-oriented computer programmes in FORTRAN IV for discrete least pth approximation with a single specified function, and more generalized discrete least pth approximation with various specifications, which may also be used for non-linear programming, are presented. Values of p up to 10" can be used successfully in conjunction with efficient gradient minimization algorithms such as the Fletcher-Powell method and a method due to Fletcher. It has been demonstrated how efficiently extremely near minimax results can be achieved on a discrete sot of sample points using this approach and the programmes written verify this. The programmes may be applied to a wide variety of design problems with a wide range of specifications. They are suitable for electrical network and system design and such problems as filter design.

 

点击下载:  PDF (378KB)



返 回