This paper explores the reconstruction of a real-valued function f defined over a domain Ω⊂R2 using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the averages of f over a given triangulation TN of Ω are available and seek a bivariate polynomial that approximates f using a histopolation approach, potentially flanked by an additional regression technique. This methodology relies on the selection of a subset of triangles TM⊂TN for histopolation, ensuring both the solvability and the well-conditioning of the problem. The remaining triangles can potentially be used to enhance the accuracy of the polynomial approximation through a simultaneous regression. We will introduce histopolation and combined histopolation-regression methods using the Padua points, discrete Leja sequences, and approximate Fekete nodes. The proposed algorithms are implemented and evaluated through numerical experiments that demonstrate their effectiveness in function approximation.
Bivariate polynomial histopolation techniques on Padua, Fekete, and Leja triangles
Francesco Dell'AccioMembro del Collaboration Group
;Federico NudoMembro del Collaboration Group
2026-01-01
Abstract
This paper explores the reconstruction of a real-valued function f defined over a domain Ω⊂R2 using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the averages of f over a given triangulation TN of Ω are available and seek a bivariate polynomial that approximates f using a histopolation approach, potentially flanked by an additional regression technique. This methodology relies on the selection of a subset of triangles TM⊂TN for histopolation, ensuring both the solvability and the well-conditioning of the problem. The remaining triangles can potentially be used to enhance the accuracy of the polynomial approximation through a simultaneous regression. We will introduce histopolation and combined histopolation-regression methods using the Padua points, discrete Leja sequences, and approximate Fekete nodes. The proposed algorithms are implemented and evaluated through numerical experiments that demonstrate their effectiveness in function approximation.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


