# A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.

ETNA. Electronic Transactions on Numerical Analysis [electronic only] (1996)

- Volume: 4, page 64-74
- ISSN: 1068-9613

## Access Full Article

top## How to cite

topFaßbender, Heike. "A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.." ETNA. Electronic Transactions on Numerical Analysis [electronic only] 4 (1996): 64-74. <http://eudml.org/doc/119094>.

@article{Faßbender1996,

author = {Faßbender, Heike},

journal = {ETNA. Electronic Transactions on Numerical Analysis [electronic only]},

keywords = {numerical examples; comparison of methods; discrete least squares trigonometric polynomial approximation; algorithm; inverse eigenvalue problem; unitary Hessenberg matrix; Szegö recursion},

language = {eng},

pages = {64-74},

publisher = {Kent State University, Department of Mathematics and Computer Science},

title = {A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.},

url = {http://eudml.org/doc/119094},

volume = {4},

year = {1996},

}

TY - JOUR

AU - Faßbender, Heike

TI - A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.

JO - ETNA. Electronic Transactions on Numerical Analysis [electronic only]

PY - 1996

PB - Kent State University, Department of Mathematics and Computer Science

VL - 4

SP - 64

EP - 74

LA - eng

KW - numerical examples; comparison of methods; discrete least squares trigonometric polynomial approximation; algorithm; inverse eigenvalue problem; unitary Hessenberg matrix; Szegö recursion

UR - http://eudml.org/doc/119094

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.