Donatella Occorsio
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Donatella Occorsio has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Maria Grazia Russo
Department of Mathematics, Computer Science and Economics, University Of Basilicata, Potenza, Italy
14 shared publications - Domenico Mezzanotte
Department of Basic and Applied Sciences, University of Basilicata, Potenza, Italy
12 shared publications - Giuseppe Mastroianni
Department of Basic and Applied Sciences, University of Basilicata, Potenza, Italy
11 shared publications - Woula Themistoclakis
C.N.R. National Research Council of Italy, IAC Institute for Applied Computing “Mauro Picone”, Napoli, Italy
10 shared publications - Maria Carmela De Bonis
Department of Basic and Applied Sciences, University of Basilicata, Potenza, Italy
6 shared publications - Luisa Fermo
University of Cagliari
4 shared publications
Latest Publications
- Open Access
- 7 November 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 253, 482-502
A Rational Discrete Collocation method for second kind Fredholm integral equations
- 7 November 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 253, 482-502
Open AccessA Rational Discrete Collocation method for second kind Fredholm integral equations
- Open Access
- 15 September 2026
- Published by Constructive Mathematical Analysis in Constructive Mathematical Analysis
- Vol. 9 (3) , 138-155
A Nyström method for second-kind Volterra integral equations on the square
In this paper, we propose a Nyström-type method for the numerical approximation of second-kind bivariate Volterra integral equations on the unit square. The method is based on bivariate Generalized Bernstein (GB) polynomials and on a cubature formula defined on equally spaced nodes, allowing the integral operator to be discretized directly without requiring any change of variables. The use of uniform grids makes the proposed approach particularly suitable for applications in which data are naturally sampled at equidistant points.The approximation framework relies on tensor-product GB polynomials whose degrees may differ with respect to each variable. This flexibility allows different approximation orders to be prescribed according to the regularity of the target function in each variable. As a result, the computational cost can be reduced while preserving high level of accuracy. Compared with classical Bernstein operators, the proposed GB operators achieve higher approximation orders depending on the smoothness of the approximated functions.The resulting Nyström scheme leads to a well-conditioned linear system and is proved to be stable and convergent. Error estimates are derived in Sobolev and Zygmund spaces. Several numerical experiments are presented to validate the theoretical results and to illustrate the effectiveness of the method for kernels and right-hand side functions with different smoothness properties.
- 15 September 2026
- Published by Constructive Mathematical Analysis in Constructive Mathematical Analysis
- Vol. 9 (3) , 138-155
Open AccessA Nyström method for second-kind Volterra integral equations on the square
In this paper, we propose a Nyström-type method for the numerical approximation of second-kind bivariate Volterra integral equations on the unit square. The method is based on bivariate Generalized Bernstein (GB) polynomials and on a cubature formula defined on equally spaced nodes, allowing the integral operator to be discretized directly without requiring any change of variables. The use of uniform grids makes the proposed approach particularly suitable for applications in which data are naturally sampled at equidistant points.The approximation framework relies on tensor-product GB polynomials whose degrees may differ with respect to each variable. This flexibility allows different approximation orders to be prescribed according to the regularity of the target function in each variable. As a result, the computational cost can be reduced while preserving high level of accuracy. Compared with classical Bernstein operators, the proposed GB operators achieve higher approximation orders depending on the smoothness of the approximated functions.The resulting Nyström scheme leads to a well-conditioned linear system and is proved to be stable and convergent. Error estimates are derived in Sobolev and Zygmund spaces. Several numerical experiments are presented to validate the theoretical results and to illustrate the effectiveness of the method for kernels and right-hand side functions with different smoothness properties.
- Open Access
- 18 December 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (4) , 165
Extended interpolation on the square and a mixed interpolating sequence
This paper investigates an extended interpolation process based on the zeros of Jacobi polynomials to approximate functions on $$[-1,1]^2$$ . By combining a classical Lagrange interpolating polynomial sequence with its extended counterpart, a new mixed polynomial sequence is introduced, which significantly reduces the number of required function evaluations. Convergence conditions in suitable weighted function spaces are rigorously analyzed and some numerical tests are presented to support the efficiency of the proposed scheme.- 18 December 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (4) , 165
Open AccessExtended interpolation on the square and a mixed interpolating sequence
This paper investigates an extended interpolation process based on the zeros of Jacobi polynomials to approximate functions on $$[-1,1]^2$$ . By combining a classical Lagrange interpolating polynomial sequence with its extended counterpart, a new mixed polynomial sequence is introduced, which significantly reduces the number of required function evaluations. Convergence conditions in suitable weighted function spaces are rigorously analyzed and some numerical tests are presented to support the efficiency of the proposed scheme. - Open Access
- 30 August 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 475
Anti-Gauss Laguerre polynomials: Some properties and a new interpolation process
- 30 August 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 475
Open AccessAnti-Gauss Laguerre polynomials: Some properties and a new interpolation process
- Open Access
- 30 July 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 474
An RBF-based Nyström method for Second–Kind Fredholm Integral Equations
- 30 July 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 474
Open AccessAn RBF-based Nyström method for Second–Kind Fredholm Integral Equations
- Open Access
- 4 April 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-28
A global method for solving second-kind Volterra–Fredholm integral equations
The paper presents a Nyström-type method to approximate the solution of second-kind Volterra–Fredholm integral equations. Two forms are considered, that is the disjoint form, in which the Volterra and Fredholm operators are additive integrals; and the mixed one, in which the two integrals appear in a single term through composition. In both situations, the right-hand side and the kernel functions may have algebraic singularities at $$\pm 1$$ and hence equations are treated in suitable weighted spaces equipped with the uniform norm. The proposed methods, based on product and Gauss rules, are stable and convergent. The error is of the order of the best polynomial approximation of the given functions. Numerical examples are presented to illustrate the accuracy of the method.- 4 April 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-28
Open AccessA global method for solving second-kind Volterra–Fredholm integral equations
The paper presents a Nyström-type method to approximate the solution of second-kind Volterra–Fredholm integral equations. Two forms are considered, that is the disjoint form, in which the Volterra and Fredholm operators are additive integrals; and the mixed one, in which the two integrals appear in a single term through composition. In both situations, the right-hand side and the kernel functions may have algebraic singularities at $$\pm 1$$ and hence equations are treated in suitable weighted spaces equipped with the uniform norm. The proposed methods, based on product and Gauss rules, are stable and convergent. The error is of the order of the best polynomial approximation of the given functions. Numerical examples are presented to illustrate the accuracy of the method. - Open Access
A Global Method for Approximating Caputo Fractional Derivatives—An Application to the Bagley–Torvik Equation
In this paper, we propose a global numerical method for approximating Caputo fractional derivatives of order , with The numerical procedure is based on approximating by the m-th derivative of a Lagrange polynomial, interpolating f at Jacobi zeros and some additional nodes suitably chosen to have corresponding logarithmically diverging Lebsegue constants. Error estimates in a uniform norm are provided, showing that the rate of convergence is related to the smoothness of the function f according to the best polynomial approximation error and depending on order . As an application, we approximate the solution of a Volterra integral equation, which is equivalent in some sense to the Bagley–Torvik initial value problem, using a Nyström-type method. Finally, some numerical tests are presented to assess the performance of the proposed procedure.Open AccessA Global Method for Approximating Caputo Fractional Derivatives—An Application to the Bagley–Torvik Equation
In this paper, we propose a global numerical method for approximating Caputo fractional derivatives of order , with The numerical procedure is based on approximating by the m-th derivative of a Lagrange polynomial, interpolating f at Jacobi zeros and some additional nodes suitably chosen to have corresponding logarithmically diverging Lebsegue constants. Error estimates in a uniform norm are provided, showing that the rate of convergence is related to the smoothness of the function f according to the best polynomial approximation error and depending on order . As an application, we approximate the solution of a Volterra integral equation, which is equivalent in some sense to the Bagley–Torvik initial value problem, using a Nyström-type method. Finally, some numerical tests are presented to assess the performance of the proposed procedure. - Open Access
- 17 September 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 207, 569-584
De la Vallée Poussin filtered polynomial approximation on the half–line
- 17 September 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 207, 569-584
Open AccessDe la Vallée Poussin filtered polynomial approximation on the half–line
- Open Access
- 18 July 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 205, 101-119
Approximation of the Hilbert transform on the half–line
- 18 July 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 205, 101-119
Open AccessApproximation of the Hilbert transform on the half–line
- Open Access
- 21 June 2024
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 451
A high order numerical scheme for a nonlinear nonlocal reaction–diffusion model arising in population theory
- 21 June 2024
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 451
Open AccessA high order numerical scheme for a nonlinear nonlocal reaction–diffusion model arising in population theory