|
==Variants==
Some modifications of the algorithm is present on the literature.<ref>{{Citation |last=Egidi |first=Nadaniela |title=A New Remez-Type Algorithm for Best Polynomial Approximation |date=2020 |url=http://link.springer.com/10.1007/978-3-030-39081-5_7 |work=Numerical Computations: Theory and Algorithms |volume=11973 |pages=56–69 |editor-last=Sergeyev |editor-first=Yaroslav D. |place=Cham |publisher=Springer International Publishing |language=en |doi=10.1007/978-3-030-39081-5_7 |isbn=978-3-030-39080-8 |access-date=2022-03-19 |last2=Fatone |first2=Lorella |last3=Misici |first3=Luciano |editor2-last=Kvasov |editor2-first=Dmitri E.}}</ref> These include:
Sometimes more than one sample point is replaced at the same time with the locations of nearby maximum absolute differences.
Sometimes* Replacing more than one sample point with the locations of nearby maximum absolute differences.{{Citation needed|date=March 2022}}
* Replacing all of the sample points are replacedwith in a single iteration with the locations of all, alternating sign, maximum differences.<ref name="toobs">2/73 "The Optimization of Bandlimited Systems" – G. C. Temes, F. C. Marshall and V. Barcilon. Proceedings IEEE.</ref>
Sometimes* Using the [[relative error ]] is used to measure the difference between the approximation and the function, especially if the approximation will be used to compute the function on a computer which uses [[floating point]] arithmetic .;▼
Sometimes* Including zero-error point constraints are included in a Modified Remez Exchange Algorithm.<ref name= "toobs " /> ▼▲Sometimes [[relative error]] is used to measure the difference between the approximation and the function, especially if the approximation will be used to compute the function on a computer which uses [[floating point]] arithmetic.
▲Sometimes zero-error point constraints are included in a Modified Remez Exchange Algorithm.<ref name=toobs/>
; Algorithm [[University of Camerino|UniCam]]
June 19, 2019 Nadaniela Egidi, Lorella Fatone and Luciano Misici (Dipartimento di Matematica, [[University of Camerino|Università degli Studi di Camerino]], Italy) represented deep research ''A New Remez-Type Algorithm for Best Polynomial Approximation''.<reF>''Nadaniela Egidi, Lorella Fatone, Luciano Misici''. [https://dl.acm.org/doi/abs/10.1007/978-3-030-39081-5_7 A New Remez-Type Algorithm for Best Polynomial Approximation] // Numerical Computations: Theory and Algorithms: Third International Conference, NUMTA 2019, Crotone, Italy, June 15–21, 2019, [https://www.worldcat.org/title/numerical-computations-theory-and-algorithms-third-international-conference-numta-2019-crotone-italy-june-15-21-2019-revised-selected-papers-part-i/oclc/1142366738 Revised Selected Papers, Part I], Jun 2019, Pages 56–69 [https://doi.org/10.1007/978-3-030-39081-5_7 doi] // [https://www.numta.org/pdf/Program_NUMTA2019.pdf Program NUMTA 2019], June 19, Wednesday morning (9.00): Room 1 // [https://www.numta.org/pdf/Book_NUMTA2019.pdf Book of Abstracts, page 50] // [https://books.google.com.ua/books?id=f3vQDwAAQBAJ&pg=PA56&lpg=PA56&dq=NUMTA+2019+%22new+remez-type%22&source=bl&ots=NRhT0F2Zg5&sig=ACfU3U0zqMAjdm1XBgkryJSPnIDSxDTEBA&hl=uk&sa=X&ved=2ahUKEwivsYnDlpj2AhVMBBAIHe8jD58Q6AF6BAgFEAM#v=onepage&q=NUMTA%202019%20%22new%20remez-type%22&f=false books google, pages 56-57, 60-64, 67-69]</ref>
==See also==
| 