A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.
Faßbender, Heike
ETNA. Electronic Transactions on Numerical Analysis [electronic only], Tome 4 (1996), p. 64-74 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1996-01-01
EUDML-ID : urn:eudml:doc:119094 
@article{00918321,
     title = {A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.},
     journal = {ETNA. Electronic Transactions on Numerical Analysis [electronic only]},
     volume = {4},
     year = {1996},
     pages = {64-74},
     zbl = {0862.65095},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00918321}
}

Faßbender, Heike. A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.. ETNA. Electronic Transactions on Numerical Analysis [electronic only], Tome 4 (1996) pp. 64-74. http://gdmltest.u-ga.fr/item/00918321/