Editing Runge's phenomenon (section)

===S-Runge algorithm without resampling===
When equidistant samples must be used because resampling on well-behaved sets of nodes is not feasible, the S-Runge algorithm can be considered.<ref name="FakeNodes">
{{citation
|first1 = Stefano
|last1 = De Marchi | author1-link = Stefano De Marchi
|first2 = Francesco
|last2 = Marchetti
|first3 = Emma
|last3 = Perracchione
|first4 = Davide
|last4 = Poggiali
|title = Polynomial interpolation via mapped bases without resampling
|doi = 10.1016/j.cam.2019.112347
|journal = J. Comput. Appl. Math.
|volume = 364
|year = 2020
|issn = 0377-0427
|doi-access = free
}}
</ref> In this approach, the original set of nodes is mapped on the set of [[Chebyshev nodes]], providing a stable polynomial reconstruction. The peculiarity of this method is that there is no need of resampling at the mapped nodes, which are also called ''[[fake nodes]]''. A [[Python (programming language)|Python]] implementation of this procedure can be found [https://github.com/pog87/FakeNodes here].