Gerardo Toraldo
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
Research Subjects
Gerardo Toraldo has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
- Daniela di Serafino
Department of Mathematics and Applications University of Naples Federico II Napoli Italy
10 shared publications - Gerardo Severino
Department of Agricultural Sciences University of Naples Federico II Naples Italy
6 shared publications - Marco Viola
School of Mathematical Sciences Dublin City University Collins Avenue Extension D09 V209 Dublin Ireland
6 shared publications - Salvatore Cuomo
Department of Mathematics and Applications “R. Caccioppoli”, University of Naples Federico II, Naples, Italy
5 shared publications - Francesco Giannino
Department of Agricultural Sciences, University of Naples Federico II, Portici 80055, Italy
4 shared publications - Anna De Magistris
Department of Mathematics and Physics, University of Campania “Luigi Vanvitelli”, Caserta, Italy
3 shared publications
Latest Publications
- 1 July 2026
- Published by Springer Nature
- p. 221-238
Downsampling Strategies for LES Data from High-Fidelity CFD Solvers
- 1 July 2026
- Published by Springer Nature
- p. 221-238
Downsampling Strategies for LES Data from High-Fidelity CFD Solvers
- Open Access
- 17 April 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 94 (2) , 509-541
A speed up strategy for gradient methods
In this paper, we propose a new acceleration strategy for gradient-based methods applied to strictly convex Quadratic Programming (QP) problems. The strategy consists in performing, at selected iterations, minimization steps along alternative descent directions or even within low-dimensional affine subspaces. In particular, considering the contribution of the linear and quadratic part of the objective function could be useful in designing line searches in acceleration steps. We present numerical experiments to assess the impact of acceleration steps on the performance of different gradient methods. We examined randomly generated QP and box constrained QP test problems, designed to assess the algorithms under various conditions, such as matrix dimensions, condition numbers, and initialization strategies. Our experiments show that the use of acceleration steps in some Barzilai–Borwein methods significantly improves computational results. Moving to general minimization problems, the extension of our approach is not straightforward; in particular, it is not possible to directly extend the two-dimensional minimization phase. In this work, we take a first step in this direction by providing preliminary ideas for a possible extension of the accelerated algorithm to the minimization of general functions.
- 17 April 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 94 (2) , 509-541
Open AccessA speed up strategy for gradient methods
In this paper, we propose a new acceleration strategy for gradient-based methods applied to strictly convex Quadratic Programming (QP) problems. The strategy consists in performing, at selected iterations, minimization steps along alternative descent directions or even within low-dimensional affine subspaces. In particular, considering the contribution of the linear and quadratic part of the objective function could be useful in designing line searches in acceleration steps. We present numerical experiments to assess the impact of acceleration steps on the performance of different gradient methods. We examined randomly generated QP and box constrained QP test problems, designed to assess the algorithms under various conditions, such as matrix dimensions, condition numbers, and initialization strategies. Our experiments show that the use of acceleration steps in some Barzilai–Borwein methods significantly improves computational results. Moving to general minimization problems, the extension of our approach is not straightforward; in particular, it is not possible to directly extend the two-dimensional minimization phase. In this work, we take a first step in this direction by providing preliminary ideas for a possible extension of the accelerated algorithm to the minimization of general functions.
- Open Access
- 7 February 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 158
Analysis and numerical simulations of fractional order model of ring formation due to plant-soil negative feedback
- 7 February 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 158
Open AccessAnalysis and numerical simulations of fractional order model of ring formation due to plant-soil negative feedback
- Open Access
- 8 August 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (5) , 1-11
Roughness regularization for functional data analysis with free knots spline estimation
In the era of big data, an ever-growing volume of information is recorded, either continuously over time or sporadically, at distinct time intervals. Functional Data Analysis (FDA) stands at the cutting edge of this data revolution, offering a powerful framework for handling and extracting meaningful insights from such complex datasets. The currently proposed FDA methods can often encounter challenges, especially when dealing with curves of varying shapes. This can largely be attributed to the method’s strong dependence on data approximation as a key aspect of the analysis process. In this work, we propose a free knots spline estimation method for functional data with two penalty terms and demonstrate its performance by comparing the results of several clustering methods on simulated and real data.
- 8 August 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (5) , 1-11
Open AccessRoughness regularization for functional data analysis with free knots spline estimation
In the era of big data, an ever-growing volume of information is recorded, either continuously over time or sporadically, at distinct time intervals. Functional Data Analysis (FDA) stands at the cutting edge of this data revolution, offering a powerful framework for handling and extracting meaningful insights from such complex datasets. The currently proposed FDA methods can often encounter challenges, especially when dealing with curves of varying shapes. This can largely be attributed to the method’s strong dependence on data approximation as a key aspect of the analysis process. In this work, we propose a free knots spline estimation method for functional data with two penalty terms and demonstrate its performance by comparing the results of several clustering methods on simulated and real data.
- Open Access
Roughness regularization for functional data analysis with free knots spline estimation
In the era of big data, an ever-growing volume of information is recorded, either continuously over time or sporadically, at distinct time intervals. Functional Data Analysis (FDA) stands at the cutting edge of this data revolution, offering a powerful framework for handling and extracting meaningful insights from such complex datasets. The currently proposed FDA me\-thods can often encounter challenges, especially when dealing with curves of varying shapes. This can largely be attributed to the method's strong dependence on data approximation as a key aspect of the analysis process. In this work, we propose a free knots spline estimation method for functional data with two penalty terms and demonstrate its performance by comparing the results of several clustering methods on simulated and real data.
Open AccessRoughness regularization for functional data analysis with free knots spline estimation
In the era of big data, an ever-growing volume of information is recorded, either continuously over time or sporadically, at distinct time intervals. Functional Data Analysis (FDA) stands at the cutting edge of this data revolution, offering a powerful framework for handling and extracting meaningful insights from such complex datasets. The currently proposed FDA me\-thods can often encounter challenges, especially when dealing with curves of varying shapes. This can largely be attributed to the method's strong dependence on data approximation as a key aspect of the analysis process. In this work, we propose a free knots spline estimation method for functional data with two penalty terms and demonstrate its performance by comparing the results of several clustering methods on simulated and real data.
- 6 June 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Biological Systems
- Vol. 32 (04) , 1487-1520
FRACTAL-FRACTIONAL SIRS MODEL FOR THE DISEASE DYNAMICS IN BOTH PREY AND PREDATOR WITH SINGULAR AND NONSINGULAR KERNELS
In this study, we consider a mathematical model for the disease dynamics in both prey and predator by considering the Susceptible–Infected–Recovered–Susceptible (SIRS) model with the prey–predator Lotka–Volterra differential equations. Carrying capacity, predation, migration, and immunity loss are also taken into account for both species. Using the law of mass action, the physical model is transformed into a nonlinear coupled system of ODEs. The classical/integer order ODE system is then generalized through the fractal-fractional differential operators of power law and Mittag-Leffler kernels. For the model under consideration, we additionally check for positivity, boundedness, the basic reproduction number, and equilibrium points. Graphical results are obtained by use of a numerical approach, and the existence and uniqueness of the solution are also established theoretically. The graphical solutions has been displayed via 2D and 3D phase plots. It has been shown that when the fractional order reduces, the amplitude of the chaotic attractor dynamics shrinks, along with the range of limit cycles and periodic trajectories while a drop in the fractal dimension parameter causes an increase in the time period of the chaotic attractor dynamics. This study not only improves the understanding of epidemic breakouts in predator–prey systems, but also highlights the efficiency of fractal-fractional calculus in ecological modeling.
- 6 June 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Biological Systems
- Vol. 32 (04) , 1487-1520
FRACTAL-FRACTIONAL SIRS MODEL FOR THE DISEASE DYNAMICS IN BOTH PREY AND PREDATOR WITH SINGULAR AND NONSINGULAR KERNELS
In this study, we consider a mathematical model for the disease dynamics in both prey and predator by considering the Susceptible–Infected–Recovered–Susceptible (SIRS) model with the prey–predator Lotka–Volterra differential equations. Carrying capacity, predation, migration, and immunity loss are also taken into account for both species. Using the law of mass action, the physical model is transformed into a nonlinear coupled system of ODEs. The classical/integer order ODE system is then generalized through the fractal-fractional differential operators of power law and Mittag-Leffler kernels. For the model under consideration, we additionally check for positivity, boundedness, the basic reproduction number, and equilibrium points. Graphical results are obtained by use of a numerical approach, and the existence and uniqueness of the solution are also established theoretically. The graphical solutions has been displayed via 2D and 3D phase plots. It has been shown that when the fractional order reduces, the amplitude of the chaotic attractor dynamics shrinks, along with the range of limit cycles and periodic trajectories while a drop in the fractal dimension parameter causes an increase in the time period of the chaotic attractor dynamics. This study not only improves the understanding of epidemic breakouts in predator–prey systems, but also highlights the efficiency of fractal-fractional calculus in ecological modeling.
- Open Access
- 7 December 2023
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (4) , 554-565
Analysis and numerical simulations of travelling waves due to plant–soil negative feedback
In this work, we carry out an analytical and numerical investigation of travelling waves representing arced vegetation patterns on sloped terrains. These patterns are reported to appear also in ecosystems which are not water deprived; therefore, we study the hypothesis that their appearance is due to plant–soil negative feedback, namely due to biomass-(auto)toxicity interactions.To this aim, we introduce a reaction-diffusion-advection model describing the dynamics of vegetation biomass and toxicity which includes the effect of sloped terrains on the spatial distribution of these variables. Our analytical investigation shows the absence of Turing patterns, whereas travelling waves (moving uphill in the slope direction) emerge. Investigating the corresponding dispersion relation, we provide an analytic expression for the asymptotic speed of the wave. Numerical simulations not only just confirm this analytical quantity but also reveal the impact of toxicity on the structure of the emerging travelling pattern.Our analysis represents a further step in understanding the mechanisms behind relevant plants‘ spatial distributions observed in real life. In particular, since vegetation patterns (both stationary and transient) are known to play a crucial role in determining the underlying ecosystems’ resilience, the framework presented here allows us to better understand the emergence of such structures to a larger variety of ecological scenarios and hence improve the relative strategies to ensure the ecosystems’ resilience.
- 7 December 2023
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (4) , 554-565
Open AccessAnalysis and numerical simulations of travelling waves due to plant–soil negative feedback
In this work, we carry out an analytical and numerical investigation of travelling waves representing arced vegetation patterns on sloped terrains. These patterns are reported to appear also in ecosystems which are not water deprived; therefore, we study the hypothesis that their appearance is due to plant–soil negative feedback, namely due to biomass-(auto)toxicity interactions.To this aim, we introduce a reaction-diffusion-advection model describing the dynamics of vegetation biomass and toxicity which includes the effect of sloped terrains on the spatial distribution of these variables. Our analytical investigation shows the absence of Turing patterns, whereas travelling waves (moving uphill in the slope direction) emerge. Investigating the corresponding dispersion relation, we provide an analytic expression for the asymptotic speed of the wave. Numerical simulations not only just confirm this analytical quantity but also reveal the impact of toxicity on the structure of the emerging travelling pattern.Our analysis represents a further step in understanding the mechanisms behind relevant plants‘ spatial distributions observed in real life. In particular, since vegetation patterns (both stationary and transient) are known to play a crucial role in determining the underlying ecosystems’ resilience, the framework presented here allows us to better understand the emergence of such structures to a larger variety of ecological scenarios and hence improve the relative strategies to ensure the ecosystems’ resilience.
- Open Access
- 22 May 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 107-134
On the stationarity for nonlinear optimization problems with polyhedral constraints
For polyhedral constrained optimization problems and a feasible point $$\textbf{x}$$ , it is shown that the projection of the negative gradient on the tangent cone, denoted $$\nabla _\varOmega f(\textbf{x})$$ , has an orthogonal decomposition of the form $$\varvec{\beta }(\textbf{x}) + \varvec{\varphi }(\textbf{x})$$ . At a stationary point, $$\nabla _\varOmega f(\textbf{x}) = \textbf{0}$$ so $$\Vert \nabla _\varOmega f(\textbf{x})\Vert $$ reflects the distance to a stationary point. Away from a stationary point, $$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and $$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ measure different aspects of optimality since $$\varvec{\beta }(\textbf{x})$$ only vanishes when the KKT multipliers at $$\textbf{x}$$ have the correct sign, while $$\varvec{\varphi }(\textbf{x})$$ only vanishes when $$\textbf{x}$$ is a stationary point in the active manifold. As an application of the theory, an active set algorithm is developed for convex quadratic programs which adapts the flow of the algorithm based on a comparison between $$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and $$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ .- 22 May 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 107-134
Open AccessOn the stationarity for nonlinear optimization problems with polyhedral constraints
For polyhedral constrained optimization problems and a feasible point $$\textbf{x}$$ , it is shown that the projection of the negative gradient on the tangent cone, denoted $$\nabla _\varOmega f(\textbf{x})$$ , has an orthogonal decomposition of the form $$\varvec{\beta }(\textbf{x}) + \varvec{\varphi }(\textbf{x})$$ . At a stationary point, $$\nabla _\varOmega f(\textbf{x}) = \textbf{0}$$ so $$\Vert \nabla _\varOmega f(\textbf{x})\Vert $$ reflects the distance to a stationary point. Away from a stationary point, $$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and $$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ measure different aspects of optimality since $$\varvec{\beta }(\textbf{x})$$ only vanishes when the KKT multipliers at $$\textbf{x}$$ have the correct sign, while $$\varvec{\varphi }(\textbf{x})$$ only vanishes when $$\textbf{x}$$ is a stationary point in the active manifold. As an application of the theory, an active set algorithm is developed for convex quadratic programs which adapts the flow of the algorithm based on a comparison between $$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and $$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ . - Open Access
- 22 November 2022
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 84 (1) , 1-4
Special issue for SIMAI 2020–2021: large-scale optimization and applications
- 22 November 2022
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 84 (1) , 1-4
Open AccessSpecial issue for SIMAI 2020–2021: large-scale optimization and applications
- 22 June 2022
- Published by American Physical Society (APS) in Physical Review Fluids
- Vol. 7 (6) , 064101
Dipole-flow disturbed by a circular inclusion of conductivity different from the background: From deterministic to a self-consistent analytical solution
Steady dipole-flow through a porous medium, and disturbed by a circular inclusion of conductivity different from the background, is solved analytically. The solution is achieved by means of the circle theorem, which is reformulated to account for the entry/leave of mass and energy through the boundary . It is shown that the governing potential is that which one would consider in absence of the disturbance supplemented with an ad hoc (fictitious) dipole laying inside . Besides the theoretical interest, the analytical solution is used to compute the effective conductivity , by means of the self-consistent approximation. Overall, is found to depend upon the flow configuration, and therefore it cannot be sought as a medium's property (nonlocality). In particular, depends upon the joint probability density function of the conductivity and the distribution/size of the inclusions. Results, analyzed for a fairly general model of , demonstrate that the coefficient of correlation between the involved random fields is the key parameter characterizing the structure of . Indeed, the latter results larger or smaller than that of the background, depending on whether is negative or positive, respectively. For , the effective conductivity is a local property and, in this case, one can apply the superposition principle with the homogeneous conductivity replaced by the geometric mean.- 22 June 2022
- Published by American Physical Society (APS) in Physical Review Fluids
- Vol. 7 (6) , 064101
Dipole-flow disturbed by a circular inclusion of conductivity different from the background: From deterministic to a self-consistent analytical solution
Steady dipole-flow through a porous medium, and disturbed by a circular inclusion of conductivity different from the background, is solved analytically. The solution is achieved by means of the circle theorem, which is reformulated to account for the entry/leave of mass and energy through the boundary . It is shown that the governing potential is that which one would consider in absence of the disturbance supplemented with an ad hoc (fictitious) dipole laying inside . Besides the theoretical interest, the analytical solution is used to compute the effective conductivity , by means of the self-consistent approximation. Overall, is found to depend upon the flow configuration, and therefore it cannot be sought as a medium's property (nonlocality). In particular, depends upon the joint probability density function of the conductivity and the distribution/size of the inclusions. Results, analyzed for a fairly general model of , demonstrate that the coefficient of correlation between the involved random fields is the key parameter characterizing the structure of . Indeed, the latter results larger or smaller than that of the background, depending on whether is negative or positive, respectively. For , the effective conductivity is a local property and, in this case, one can apply the superposition principle with the homogeneous conductivity replaced by the geometric mean.