Rosanna Campagna
University of Naples Federico II
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Rosanna Campagna.
Inverse Problems | 2012
Luisa D’Amore; Rosanna Campagna; Ardelio Galletti; Livia Marcellino; Almerico Murli
The scientific and application-oriented interest in the Laplace transform and its inversion is testified by more than 1000 publications in the last century. Most of the inversion algorithms available in the literature assume that the Laplace transform function is available everywhere. Unfortunately, such an assumption is not fulfilled in the applications of the Laplace transform. Very often, one only has a finite set of data and one wants to recover an estimate of the inverse Laplace function from that. We propose a fitting model of data. More precisely, given a finite set of measurements on the real axis, arising from an unknown Laplace transform function, we construct a dth degree generalized polynomial smoothing spline, where d = 2m − 1, such that internally to the data interval it is a dth degree polynomial complete smoothing spline minimizing a regularization functional, and outside the data interval, it mimics the Laplace transform asymptotic behavior, i.e. it is a rational or an exponential function (the end behavior model), and at the boundaries of the data set it joins with regularity up to order m − 1, with the end behavior model. We analyze in detail the generalized polynomial smoothing spline of degree d = 3. This choice was motivated by the (ill)conditioning of the numerical computation which strongly depends on the degree of the complete spline. We prove existence and uniqueness of this spline. We derive the approximation error and give a priori and computable bounds of it on the whole real axis. In such a way, the generalized polynomial smoothing spline may be used in any real inversion algorithm to compute an approximation of the inverse Laplace function. Experimental results concerning Laplace transform approximation, numerical inversion of the generalized polynomial smoothing spline and comparisons with the exponential smoothing spline conclude the work.
Applied Mathematics and Computation | 2015
M. Raoofian Naeeni; Rosanna Campagna; Morteza Eskandari-Ghadi; Alireza A. Ardalan
Different methods for the numerical evaluations of the inverse Laplace and inverse of joint Laplace–Hankel integral transforms are applied to solve a wide range of initial-boundary value problems often arising in engineering and applied mathematics. The aim of the paper is to present a performance comparison among different numerical methods when they are applied to transformed functions related to actual engineering problems found in the literature. Most of our selected test functions have been found in the solution of boundary value problems of applied mechanics such as those related to transient responses of isotropic and transversely isotropic half-space to concentrated impulse or those related to viscoelastic wave motion in layered media. These classes of test functions are frequently encountered in similar problems such as those in boundary element or boundary integral equations, theoretical seismology, soil–structure-interaction in time domain and so on. Therefore, their behavior with different numerical inversion algorithms could make a useful guide to a precise choice of more suitable inversion method to be used in similar problems. Some different methods are also investigated in detail and compared for the inversion of the joint Hankel–Laplace transforms, where more sophisticated integrand functions are encountered. It is shown that Durbin, Crump, D’Amore, Fixed-Talbot, Gaver–Whyn–Rho (GWR), and Direct Integration methods have excellent performance and produce good results when applied to the same problems. On the contrary, Gaver–Stehfest and Piessens methods furnish results not very reliable for almost all classes of transformed functions and they seem good only for “simple” transformed functions. Particularly the performance of GWR algorithm is very good even for transformed functions with infinite number of singularities, where the other methods fail. In addition, in case of double integral transforms, only the Fixed-Talbot, Durbin and Weeks methods are recommended.
Numerical Algorithms | 2013
Luisa D'Amore; Rosanna Campagna; Valeria Mele; Almerico Murli
A software package for numerical inversion of Laplace transforms computable everywhere on the real axis is described. Besides the function to invert the user has only to provide the numerical value (even if it is an approximate value) of the abscissa of convergence and the accuracy required for the inverse function. The software provides a controlled accuracy, i.e. it dynamically computes the so-called maximum attainable accuracy such that numerical results are provided within the greatest value between the user’s required accuracy and the maximum attainable accuracy. This is done because the intrinsic ill posedness of the real inversion problem sometime may prevent to reach the desired accuracy. The method implemented is based on a Laguerre polynomial series expansion of the inverse function and belongs to the class of polynomial-type methods of inversion of the Laplace transform, formally characterized as Collocation methods (C-methods).
signal image technology and internet based systems | 2016
Salvatore Cuomo; Rosanna Campagna; Vittorio Di Somma; Gerardo Severino
The computation of the European options price in a Black-Scholes market, characterized by the presence of no arbitrage condition, is an important applicative problem. In this paper we are interested in highlighting some numerical issues related to this problem. The proposed procedure is mainly divided into three parts: the test of the lognomality of the risk asset, the estimation of the volatility of the underlying and, finally, the determination of the price. As concerns the first point, we propose the adoption of the the Shapiro-Wilk test, in the second one we suggest to estimate the volatility by the sample standard deviation and in the third point we apply the Black-Scholes formula and we introduce an approximation for a Normal function value by means of a quadrature formula.
Archive | 2010
Rosanna Campagna; Luisa D’Amore; Ardelio Galletti; Almerico Murli; M. Rizzardi
Many applications are tackled using the Laplace Transform (LT) known on a countable number of real values [J. Electroanal. Chem. 608, 37–46 (2007), Int. J. solid Struct. 41, 3653–3674 (2004), Imaging 26, 1183–1196 (2008), J. Magn. Reson. 156, 213–221 (2002)]. The usual approach to solve the LT inverse problem relies on a regularization technique combined with information a priori both on the LT function and on its inverse (see for instance [http://s-provencher.com/pages/ contin.shtml]). We propose a fitting model enjoying LT properties: we define a generalized spline that interpolates the LT function values and mimics the asymptotic behavior of LT functions. Then, we prove existence and uniqueness of this model and, through a suitable error analysis, we give a priori approximation error bounds to confirm the reliability of this approach. Numerical results are presented.
International Journal of Parallel Programming | 2017
Giovanni Battista Barone; Vania Boccia; Davide Bottalico; Rosanna Campagna; Luisa Carracciuolo; Giuliano Laccetti; Marco Lapegna
The minimisation of the total cost of ownership is hard to be faced by the owners of large scale computing systems, without affecting negatively the quality of service for the users. Modern datacenters, often included in distributed environments, appear to be “elastic”, i.e., they are able to shrink or enlarge the number of local physical or virtual resources, also by recruiting them from private/public clouds. This increases the degree of dynamicity, making the infrastructure management more and more complex. Here, we report some advances in the realisation of an adaptive scheduling controller (ASC) which, by interacting with the datacenter resource manager, allows an effective and an efficient usage of resources. In particular, we focus on the mathematical formalisation of the ASC’s kernel that allows to dynamically configure, in a suitable way, the datacenter resources manager. The described formalisation is based on a probabilistic approach that, starting from both a hystorical resources usage and on the actual users request of the datacenter resources, identifies a suitable probability distribution for queue time with the aim to perform a short term forecasting. The case study is the SCoPE datacenter at the University of Naples Federico II.
NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms” | 2016
Rosanna Campagna; Serena Crisci; Salvatore Cuomo; Ardelio Galletti; Livia Marcellino
The algorithms based on the Bregman iterative regularization are known for efficiently solving convex constraint optimization problems. In this paper, we introduce a second order derivative scheme for the class of Bregman algorithms. Its properties of convergence and stability are investigated by means of numerical evidences. Moreover, we apply the proposed scheme to an isotropic Total Variation (TV) problem arising out of the Magnetic Resonance Image (MRI) denoising. Experimental results confirm that our algorithm has good performance in terms of denoising quality, effectiveness and robustness.
ACM Transactions on Mathematical Software | 2014
Luisa D'Amore; Rosanna Campagna; Valeria Mele; Almerico Murli
Algorithm 662 of the ACM TOMS library is a software package, based on the Weeks method, which is used for calculating function values of the inverse Laplace transform. The software requires transform values at arbitrary points in the complex plane. We developed a software package, called ReLIADiff, which is a modification of Algorithm 662 using transform values at arbitrary points on real axis. ReLIADiff, implemented in C++, relies on TADIFF software package designed for Algorithmic Differentiation. In this article, we present ReLIADiff focusing on its design principles, performance, and use.
Applied Mathematics and Computation | 2017
Rosanna Campagna; Serena Crisci; Salvatore Cuomo; Livia Marcellino; Gerardo Toraldo
Abstract Minimizing variational models by means of (un)constrained optimization algorithms is a well-known approach for dealing with the image denoising problem. In this paper, we propose a modification of the widely explored TV-ROF model named H-TV-ROF, in which a penalty term based on higher order derivatives is added. A Split Bregman iterative scheme is used to solve the proposed model and its convergence is proved. The performance of the new algorithm is analized and compared with TV-ROF on a set of numerical experiments.
Inverse Problems in Science and Engineering | 2018
Luisa D’Amore; Valeria Mele; Rosanna Campagna
We are concerned with Gaver’s formula, which is at the heart of a numerical algorithm, widely used in scientific and engineering applications, for computing approximations of inverse Laplace transform in multi-precision arithmetic systems. We demonstrate that, once parameters n (i.e. the number of terms of Gaver’s formula) and (i.e. an upper bound on noise on data) are given, then the number of correct significant digits of computed values of the inverse function is bounded above by . In case of noise free data this number is arbitrarily large, as it is bounded below by n. We establish the requirement of the multi-precision system ensuring that the quality of numerical results is fulfilled. Experiments and comparisons validate the effectiveness of such approach.