pith. sign in

arxiv: 2606.27178 · v1 · pith:6MYYJIN5new · submitted 2026-06-25 · 🧮 math.NA · cs.NA· math.FA

De la Vall\'ee Poussin type approximation for solving some Fredholm integral equations

Domenico Mezzanotte , Donatella Occorsio , Mario Pezzella , Woula Themistoclakis This is my paper

Pith reviewed 2026-06-26 03:34 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.FA
keywords Fredholm integral equationsde la Vallée Poussin approximationJacobi zerosweighted uniform spacesnumerical stabilityconvergence analysissingular kernelsoscillatory kernels
0
0 comments X

The pith

De la Vallée Poussin polynomial approximations solve second-kind Fredholm integral equations with stability and higher local accuracy than Lagrange methods.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper presents a numerical method for second-kind Fredholm integral equations that uses de la Vallée Poussin-type polynomial approximations evaluated at Jacobi zeros. The method is intended to manage cases where the solution has algebraic singularities at the endpoints and the kernel has weak singularities or oscillates rapidly. It proves that the approach is stable and converges in weighted uniform spaces, while delivering better local accuracy than the standard Lagrange interpolation projection at the same points. An efficient solver based on a well-conditioned linear system is also provided, with numerical tests backing the theory.

Core claim

Under suitable assumptions, the VP-type method based on approximations at Jacobi zeros is stable and convergent in weighted uniform spaces and achieves higher local accuracy than the corresponding Lagrange-based projection method for FIEs with possible algebraic endpoint singularities and kernels with weak singularities or high oscillation.

What carries the argument

de la Vallée Poussin-type (VP) polynomial approximations at Jacobi zeros, which provide uniformly bounded Lebesgue constants and near-best approximation in weighted spaces while reducing the Gibbs phenomenon.

If this is right

  • Stability and convergence hold in weighted uniform spaces for the targeted class of FIEs.
  • Higher local accuracy is obtained compared to Lagrange-based methods.
  • The method handles algebraic endpoint singularities in the solution and weak or oscillatory singularities in the kernel.
  • Implementation reduces to solving a well-conditioned linear system.
  • Theoretical error estimates are confirmed by numerical experiments.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The bounded Lebesgue constants could make this approximation useful for other operator equations beyond Fredholm integrals.
  • Mitigation of Gibbs phenomenon suggests potential benefits for approximating functions with discontinuities in related numerical methods.
  • Extensions to time-dependent or multidimensional integral equations might be feasible if similar weighted space properties apply.
  • Testing on kernels with stronger singularities could reveal the limits of the current convergence proofs.

Load-bearing premise

The functions and kernels must satisfy suitable assumptions that enable the stability and convergence proofs in the weighted uniform spaces.

What would settle it

Observing that the computed solution for a test FIE with endpoint singularities fails to converge at the predicted rate in the weighted norm, or that the linear system becomes ill-conditioned for large degrees.

read the original abstract

In the present paper, we introduce a numerical method for second-kind Fredholm integral equations (FIEs) based on de la Vall\'ee Poussin-type (VP) polynomial approximations at Jacobi zeros. This class of approximations offers several advantages over classical Lagrange interpolation at the same nodes. In particular, it guarantees uniformly bounded Lebesgue constants in suitable weighted function spaces and provides near-best uniform approximation for functions in these spaces, while also significantly mitigating the Gibbs phenomenon. We show how these properties can be exploited in the numerical solution of FIEs. In particular, the proposed approach effectively handles functions with possible algebraic endpoint singularities and kernel functions featuring weak singularities or highly oscillatory behavior. Under suitable assumptions, we prove stability and convergence of the method in weighted uniform spaces. Furthermore, we develop an efficient implementation based on the solution of a well-conditioned linear system. Numerical results confirm the theoretical error estimates and show that the proposed method achieves higher local accuracy than the corresponding Lagrange-based projection method.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces a numerical method for second-kind Fredholm integral equations based on de la Vallée Poussin-type polynomial approximations at Jacobi zeros. It claims that these approximations have uniformly bounded Lebesgue constants in weighted function spaces, provide near-best uniform approximation, and mitigate the Gibbs phenomenon better than Lagrange interpolation at the same nodes. The approach is shown to handle algebraic endpoint singularities in the solution and weak singularities or high oscillation in the kernel. Under suitable assumptions, stability and convergence are proved in weighted uniform spaces, an efficient well-conditioned linear system is derived for implementation, and numerical experiments confirm the error estimates while demonstrating higher local accuracy than the corresponding Lagrange projection method.

Significance. If the stability and convergence proofs hold under the stated assumptions, the work provides a useful projection method for FIEs with endpoint singularities or oscillatory/weakly singular kernels. The exploitation of bounded Lebesgue constants and near-best approximation properties of VP operators at Jacobi zeros is a clear technical strength that supports the convergence analysis and distinguishes the method from standard Lagrange-based approaches.

major comments (2)
  1. [Abstract] Abstract: the stability and convergence proofs are stated to hold 'under suitable assumptions,' but these assumptions are not listed explicitly. Since the central claims of stability, convergence, and applicability to singular/oscillatory cases rest on them, the assumptions must be stated clearly (e.g., in the statement of the main theorem) so that the scope of the result can be assessed.
  2. [Numerical results] The claim of higher local accuracy than the Lagrange-based method is asserted on the basis of numerical results, but without reference to specific error tables, computed rates, or test cases in the provided material it is not possible to verify that the improvement is systematic rather than instance-specific.
minor comments (2)
  1. Notation for the weighted uniform spaces and the associated norms should be introduced once and used consistently throughout the theoretical sections.
  2. The description of the linear system and its conditioning would benefit from an explicit reference to the matrix entries or the conditioning bound derived from the Lebesgue constants.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment, and recommendation of minor revision. We address each major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the stability and convergence proofs are stated to hold 'under suitable assumptions,' but these assumptions are not listed explicitly. Since the central claims of stability, convergence, and applicability to singular/oscillatory cases rest on them, the assumptions must be stated clearly (e.g., in the statement of the main theorem) so that the scope of the result can be assessed.

    Authors: We agree that explicit listing improves clarity. The assumptions (Jacobi parameters α, β > −1 with the weight class, Hölder regularity of the kernel away from diagonal singularities, and algebraic endpoint singularity form |x−a|^μ with μ > −1) are stated in Section 3 immediately before Theorem 3.1. In the revised manuscript we will enumerate them verbatim inside the theorem statement and add one sentence to the abstract. revision: yes

  2. Referee: [Numerical results] The claim of higher local accuracy than the Lagrange-based method is asserted on the basis of numerical results, but without reference to specific error tables, computed rates, or test cases in the provided material it is not possible to verify that the improvement is systematic rather than instance-specific.

    Authors: Section 5 contains four test cases with explicit error tables, observed convergence rates, and pointwise comparisons at interior and near-endpoint nodes. To make the claim immediately verifiable we will insert parenthetical references to Tables 5.1–5.3 and Figure 5.2 when the local-accuracy statement appears in the abstract and introduction. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent approximation-theoretic proofs

full rationale

The paper's central claims of stability and convergence for the VP-type projection method rest on explicit mathematical proofs that exploit bounded Lebesgue constants and near-best approximation properties of the operators at Jacobi zeros. These properties are established within the derivation chain rather than by self-definition, parameter fitting, or load-bearing self-citation that reduces the result to its inputs. The abstract and described structure indicate standard numerical analysis reasoning with external benchmarks (error estimates confirmed numerically), making the work self-contained against the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no explicit free parameters, axioms, or invented entities are stated.

pith-pipeline@v0.9.1-grok · 5720 in / 1073 out tokens · 35920 ms · 2026-06-26T03:34:15.613665+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 18 canonical work pages

  1. [1]

    K. E. Atkinson. The Numerical Solution of Integral Equations of the Second K ind. Cambridge Monographs on Applied and Computational Mathematics, Series Num ber 4, 1997

    1997

  2. [2]

    Capobianco, P

    M.R. Capobianco, P. Junghanns, U. Luther, and G. Mastroianni. Weighted uniform convergence of the quadrature method for Cauchy singular integral equations. I n Operators and Related Topics (Tel Aviv, 1995) , volume 90 of Oper. Theory Adv. Appl. , pages 153–181. Birkh¨ auser Basel, Basel, 1995. doi:10.1007/978-3-0348-9040-3_5

    work page doi:10.1007/978-3-0348-9040-3_5 1995

  3. [3]

    Capobianco and W

    M.R. Capobianco and W. Themistoclakis. On the boundedness of de la Vall` ee Poussin operators. East J. Approx, , 2001

    2001

  4. [4]

    M. C. De Bonis, D. Occorsio, and W. Themistoclakis. Filtered interp olation for solving prandtl’s integro-differential equations. Numerical Algorithms , 88(2):679–709, February 2021. doi:10.1007/s11075-020-01053-x

    work page doi:10.1007/s11075-020-01053-x 2021

  5. [5]

    De Bonis and G

    M.C. De Bonis and G. Mastroianni. Projection methods and conditio n numbers in uniform norm for Fredholm and Cauchy integral equations. SIAM J. Numerical Analysis , 44, 2006. doi:10.1137/050626934

    work page doi:10.1137/050626934 2006

  6. [6]

    de la Vall´ ee Poussin.Le¸ cons sur l’Approximation des Fonctions d’une Variable R´ eelle

    C.-J. de la Vall´ ee Poussin.Le¸ cons sur l’Approximation des Fonctions d’une Variable R´ eelle. Gauthier- Villars, Paris, 1919. Reprinted by Chelsea Publishing Company, New Yo rk, 1970. 25

    1919

  7. [7]

    Ditzian and W

    Z. Ditzian and W. Totik. Moduli of smoothness. SCMG Springer-Verlag, New York Berlin Heidelberg London Paris Tokyo, 1987

    1987

  8. [8]

    I. S. Gradshteyn and I. M. Ryzhik. Table of Integrals, Series, and Products . Academic Press, Amsterdam, 7 edition, 2007. Translated from Russian by Scripta Te chnica, Inc

    2007

  9. [10]

    Junghanns, G

    P. Junghanns, G. Mastroianni, and I. Notarangelo. Weighted Polynomial Approximation and Numer- ical Methods for Integral Equations . Pathways in Mathematics. Birkh¨ auser, Cham, Basel, Switzer- land, 2021. doi:10.1016/S0377-0427(96)00128-8

    work page doi:10.1016/s0377-0427(96)00128-8 2021

  10. [11]

    H. Kang, S. Xiang, and G. He. Computation of integrals with oscilla tory and singu- lar integrands using Chebyshev expansions. J. Comput. Appl. Math. , 242:141–156, 2013. doi:10.1016/j.cam.2012.10.016

    work page doi:10.1016/j.cam.2012.10.016 2013

  11. [12]

    R. Kress. Linear Integral Equations. Springer, 3rd edition, 2014. doi:10.1007/978-1-4614-9593-2

    work page doi:10.1007/978-1-4614-9593-2 2014

  12. [13]

    Mastroianni and G

    G. Mastroianni and G. V. Milovanovi´ c. Interpolation Processes Basic Theory and Applications. Springer Monographs in Mathematics. Springer Verlag, Berlin, 200 9. doi:10.1007/978-3-540-68349-0

    work page doi:10.1007/978-3-540-68349-0

  13. [14]

    Mastroianni, M.G

    G. Mastroianni, M.G. Russo, and W. Themistoclakis. Numerical Me thods for Cauchy Sin- gular Integral Equations in Spaces of Weighted Continuous Functio ns. In Recent Advances in Operator Theory and its Applications , pages 311–336, Basel, 2005. Birkh¨ auser Basel. doi:10.1007/3-7643-7398-9_15

    work page doi:10.1007/3-7643-7398-9_15 2005

  14. [15]

    Mastroianni and W

    G. Mastroianni and W. Themistoclakis. A numerical method for t he generalized airfoil equation based on the de la Vall´ ee Poussin interpolation.Journal of Computational and Applied Mathematics , 180(1):71–105, 2005. doi:10.1016/j.cam.2004.10.003

    work page doi:10.1016/j.cam.2004.10.003 2005

  15. [16]

    Occorsio, M

    D. Occorsio, M. G. Russo, and W. Themistoclakis. Filtered integr ation rules for finite weighted Hilbert transforms II. Dolomites Research Notes on Approximation , 15(3):93–104, 2022. doi:10.14658/PUPJ-DRNA-2022-3-9

    work page doi:10.14658/pupj-drna-2022-3-9 2022

  16. [17]

    Occorsio, M.G

    D. Occorsio, M.G. Russo, and W. Themistoclakis. On solving some C auchy singular inte- gral equations by de la Vall´ ee Poussin filtered approximation. Appl. Num. Math. , 200:358– 378, 2024. New Trends in Approximation Methods and Numerical Ana lysis (F AATNA20¿22). doi:10.1016/j.apnum.2023.07.022

    work page doi:10.1016/j.apnum.2023.07.022 2024

  17. [18]

    Occorsio and W

    D. Occorsio and W. Themistoclakis. On the filtered polynomial inte rpolation at Chebyshev nodes. Appl. Numer. Math. , 166:272–287, 2021. doi:10.1016/j.apnum.2021.04.013

    work page doi:10.1016/j.apnum.2021.04.013 2021

  18. [19]

    Occorsio and W

    D. Occorsio and W. Themistoclakis. Some remarks on filtered poly nomial interpolation at Chebyshev nodes. Dolomites Res. Notes Approx , 14:68–84, 2021. doi:10.14658/PUPJ-DRNA-2021-2-9

    work page doi:10.14658/pupj-drna-2021-2-9 2021

  19. [20]

    Occorsio and W

    D. Occorsio and W. Themistoclakis. Some remarks on filtered poly nomial interpolation at Chebyshev nodes. Dolomites Research Notes on Approximation , 14:68–84, 2021

    2021

  20. [21]

    Piessens and M

    R. Piessens and M. Branders. On the computation of Fourier tr ansforms of singular functions. J. Comput. Appl. Math. , 43(1):159–169, 1992. doi:10.1016/0377-0427(92)90264-X

    work page doi:10.1016/0377-0427(92)90264-x 1992

  21. [22]

    G. Szeg¨ o. Orthogonal Polynomials . Number v. 23 in American Mathematical Society colloquium publications. American Mathematical Society, 1959

    1959

  22. [23]

    Themistoclakis

    W. Themistoclakis. Some Interpolating Operators of de la Vall´ e e-Poussin Type. Acta Mathematica Hungarica, 84(3):221–235, August 1999. doi:10.1023/a:1006637303487

    work page doi:10.1023/a:1006637303487 1999

  23. [24]

    Uniform approximation on [−1, 1] via discrete de la Vallée Poussin means

    W. Themistoclakis. Uniform approximation on [ − 1, 1] via discrete de la Vall´ ee Poussin means. Numer. Algorithms , 60:593–612, 2012. doi:10.1007/s11075-012-9588-4

    work page doi:10.1007/s11075-012-9588-4 2012

  24. [25]

    Themistoclakis

    W. Themistoclakis. Weighted l1 approximation on [ − 1, 1] via discrete de la Vall´ ee Poussin means. Math. Comput. Simul. , 147:279–292, 2018. doi:10.1016/j.matcom.2017.06.005. 26

    work page doi:10.1016/j.matcom.2017.06.005 2018

  25. [26]

    Themistoclakis and M

    W. Themistoclakis and M. Van Barel. Generalized de la Vall´ ee Pous sin approximations on [ − 1, 1]. Numer. Algorithms , 75:1–31, 2017. doi:10.1007/s11075-016-0194-8 . 27

    work page doi:10.1007/s11075-016-0194-8 2017