Generators for discrete polynomial L1 approximation problems

DOI10.6028/JRES.084.023zbMATH Open0437.65014OpenAlexW2316668220MaRDI QIDQ3878635FDOQ3878635

Authors:

Publication date: 1979

Published in: Journal of Research of the National Bureau of Standards (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.6028/jres.084.023

zbMATH Keywords

polynomial approximationtest problemsautomatic generationalgorithm testingempirical curve-fitting

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Analysis of algorithms and problem complexity (68Q25) Computer aspects of numerical algorithms (65Y99) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Algorithms in computer science (68W99)

Cited In (1)

• Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes

This page was built for publication: Generators for discrete polynomial L1 approximation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3878635)