Open AccessGenerators for discrete polynomial L1 approximation problems
Author(s) -
Paul D. Domich,
John W. Lawrence,
Douglas R. Shier
Publication year - 1979
Publication title -
journal of research of the national bureau of standards
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2376-5259
pISSN - 0160-1741
DOI - 10.6028/jres.084.023
Subject(s) - generator (circuit theory) , polynomial , class (philosophy) , computer science , mathematics , mathematical optimization , artificial intelligence , mathematical analysis , power (physics) , physics , quantum mechanics
Polynomial approximation problems represent a class of specially structured problems which are frequently encountered in empirical curve-fitting. Two generators for creating such problems have been developed, implemented and used in the testing of discrete L 1 approximation codes. Both generators permit automatic generation of problems with specified characteristics and (for one generator) having known, unique and controllable solutions.