Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of research of the National Institute of Standards and Technology
Paper Title
Journal
Date
