Remez algorithm: Difference between revisions

Revision as of 17:42, 15 January 2024

Revision as of 18:56, 16 July 2024

Line 112:

* The Fraser-Hart variant, used to determine the best rational Chebyshev approximation.<ref>{{Cite journal |last=Dunham |first=Charles B. |date=1975 |title=Convergence of the Fraser-Hart algorithm for rational Chebyshev approximation |url=https://www.ams.org/mcom/1975-29-132/S0025-5718-1975-0388732-9/ |journal=Mathematics of Computation |language=en |volume=29 |issue=132 |pages=1078–1082 |doi=10.1090/S0025-5718-1975-0388732-9 |issn=0025-5718|doi-access=free }}</ref>

== See also ==

{{Portal|Mathematics}}

* [[Approximation theory]]

* {{annotated link|Hadamard's lemma}}

* {{annotated link|Laurent series}}

* {{annotated link|Padé approximant}}

* {{annotated link|Newton series}}

* [[{{annotated link|Approximation theory]]}}

* {{annotated link|Function approximation}}

==References==