Resumen: The stability properties of the Newton interpolation formula depend on the order of the nodes and can be measured through a condition number. Increasing and Leja orderings have been previously considered (Carnicer et al. in J Approx Theory, 2017. https://doi.org/10.1016/j.jat.2017.07.005; Reichel in BIT 30:332–346, 1990). We analyze central orderings for equidistant nodes on a bounded real interval. A bound for conditioning is given. We demonstrate in particular that this ordering provides a more stable Newton formula than the natural increasing order. We also analyze of a central ordering with respect to the evaluation point, which provides low bounds for the conditioning. Numerical examples are included. Idioma: Inglés DOI: 10.1007/s10543-018-00743-2 Año: 2019 Publicado en: BIT Numerical Mathematics 59 (2019), 371–386 ISSN: 0006-3835 Factor impacto JCR: 1.33 (2019) Categ. JCR: MATHEMATICS, APPLIED rank: 106 / 260 = 0.408 (2019) - Q2 - T2 Categ. JCR: COMPUTER SCIENCE, SOFTWARE ENGINEERING rank: 67 / 108 = 0.62 (2019) - Q3 - T2 Factor impacto SCIMAGO: 0.868 - Computer Networks and Communications (Q1) - Software (Q1) - Applied Mathematics (Q2) - Computational Mathematics (Q2)