Searcharxiv⌕ Search

arXiv subjects

Luigi Brugnano

Publications and source records attributed to Luigi Brugnano.

At least 19 recordsLinked to original sources

A Multi-Order Extension of Fractional HBVMs (FHBVMs)

The efficient numerical solution of fractional differential equations has been recently tackled through the definition of Fractional HBVMs (FHBVMs), a class of Runge-Kutta type methods. Corresponding Matlab (c) codes have been also made available on the internet, proving to be very competitive w.r.t. existing ones. However, so far, FHBVMs have been given for solving systems of fractional differential equations with the same order of fractional derivative, whereas the numerical solution of multi-order problems (i.e., problems in which different orders of fractional derivatives occur) has not been handled, yet. Due to their relevance in applications, in this paper we propose an extension of FHBVMs for addressing fractional multi-order problems, providing full details for such an approach. A corresponding Matlab (c) code, handling the case of two different fractional orders, is also made available, proving very effective for numerically solving these problems.

math.NA↗

On the use of the principle of maximum entropy to improve the robustness of bivariate spline least-squares approximation

We consider fitting a bivariate spline regression model to data using a weighted least-squares cost function, with weights that sum to one to form a discrete probability distribution. By applying the principle of maximum entropy, the weight distribution is determined by maximizing the associated entropy function. This approach, previously applied successfully to polynomials and spline curves, enhances the robustness of the regression model by automatically detecting and down-weighting anomalous data during the fitting process. To demonstrate the effectiveness of the method, we present applications to two image processing problems and further illustrate its potential through two synthetic examples. Unlike the standard ordinary least-squares method, the maximum entropy formulation leads to a nonlinear algebraic system whose solvability requires careful theoretical analysis. We provide preliminary results in this direction and discuss the computational implications of solving the associated constrained optimization problem, which calls for dedicated iterative algorithms. These aspects suggest natural directions for further research on both the theoretical and algorithmic fronts.

stat.ME↗

Analysis and implementation of collocation methods for fractional differential equations

Recently, the class of Runge-Kutta type methods named Fractional HBVMs (FHBVMs) has been introduced for the numerical solution of initial value problems of fractional differential equations, and a corresponding Matlab software has been released. Though an error analysis has already been given, a corresponding linear stability analysis is still lacking. We here provide such an analysis, together with some improvements concerning the mesh selection. This latter has been implemented into a new version of the code, which is available on the web.

math.NA↗

A shooting-Newton procedure for solving fractional terminal value problems

In this paper we consider the numerical solution of fractional terminal value problems (FDE-TVPs). In particular, the proposed procedure uses a Newton-type iteration which is particularly efficient when coupled with a recently-introduced step-by-step procedure for solving fractional initial value problems (FDE-IVPs), able to produce spectrally accurate solutions of FDE problems. Some numerical tests are reported to make evidence of its effectiveness.

math.NA↗

Numerical solution of FDE-IVPs by using Fractional HBVMs: the fhbvm code

In this paper we describe the efficient numerical implementation of Fractional HBVMs, a class of methods recently introduced for solving systems of fractional differential equations. The reported arguments are implemented in the Matlab code fhbvm, which is made available on the web. An extensive experimentation of the code is reported, to give evidence of its effectiveness.

math.NA↗

An entropy-based approach for a robust least squares spline approximation

We consider the weighted least squares spline approximation of a noisy dataset. By interpreting the weights as a probability distribution, we maximize the associated entropy subject to the constraint that the mean squared error is prescribed to a desired (small) value. Acting on this error yields a robust regression method that automatically detects and removes outliers from the data during the fitting procedure, by assigning them a very small weight. We discuss the use of both spline functions and spline curves. A number of numerical illustrations have been included to disclose the potentialities of the maximal-entropy approach in different application fields.

math.NA↗

A new framework for polynomial approximation to differential equations

In this paper we discuss a framework for the polynomial approximation to the solution of initial value problems for differential equations. The framework, initially devised for the approximation of ordinary differential equations, is further extended to cope with constant delay differential equations. Relevant classes of Runge-Kutta methods can be derived within this framework.

math.NA↗

(Spectral) Chebyshev collocation methods for solving differential equations

Recently, the efficient numerical solution of Hamiltonian problems has been tackled by defining the class of energy-conserving Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs). Their derivation relies on the expansion of the vector field along the Legendre orthonormal basis. Interestingly, this approach can be extended to cope with other orthonormal bases and, in particular, we here consider the case of the Chebyshev polynomial basis. The corresponding Runge-Kutta methods were previously obtained by Costabile and Napoli [33]. In this paper, the use of a different framework allows us to carry out a novel analysis of the methods also when they are used as spectral formulae in time, along with some generalizations of the methods.

math.NA↗

Continuous-Stage Runge-Kutta approximation to Differential Problems

In recent years, the efficient numerical solution of Hamiltonian problems has led to the definition of a class of energy-conserving Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs). Such methods admit an interesting interpretation in terms of continuous-stage Runge-Kutta methods, which is here recalled and revisited for general differential problems.

math.NA↗

Arbitrary high-order methods for one-sided direct event location in discontinuous differential problems with nonlinear event function

In this paper we are concerned with numerical methods for the one-sided event location in discontinuous differential problems, whose event function is nonlinear (in particular, of polynomial type). The original problem is transformed into an equivalent Poisson problem, which is effectively solved by suitably adapting a recently devised class of energy-conserving methods for Poisson systems. The actual implementation of the methods is fully discussed, with a particular emphasis to the problem at hand. Some numerical tests are reported, to assess the theoretical findings.

math.NA↗

Arbitrarily high-order energy-conserving methods for Poisson problems

In this paper we are concerned with energy-conserving methods for Poisson problems, which are effectively solved by defining a suitable generalization of HBVMs, a class of energy-conserving methods for Hamiltonian problems. The actual implementation of the methods is fully discussed, with a particular emphasis on the conservation of Casimirs. Some numerical tests are reported, in order to assess the theoretical findings.

math.NA↗

Metodi Iterativi per Sistemi Lineari

These are the lecture notes (in Italian) of a course held in Perugia, Italy, during the summer 2002. They concern the basic facts on the iterative solution of linear systems. The course is self-contained and requires only basic knowledge of numerical linear algebra. This is a corrected version of the original lecture notes, and are dedicated to the memory of Cecilia Magherini.

math.HO↗

Implementation of the PaperRank and AuthorRank indices in the Scopus database

We implement the PaperRank and AuthorRank indices introduced in [Amodio & Brugnano, 2014] in the Scopus database, in order to highlight quantitative and qualitative information that the bare number of citations and/or the h-index of an author are unable to provide. In addition to this, the new indices can be cheaply updated in Scopus, since this has a cost comparable to that of updating the number of citations. Some examples are reported to provide insight in their potentialities, as well as possible extensions.

cs.DL↗

The hidden side of COVID-19 spread in Italy

Background. The paper concerns the SARS-CoV2 (COVID-19) pandemic that, starting from the end of February 2020, began spreading along the Italian peninsula, by first attacking small communities in north regions, and then extending to the center and south of Italy, including the two main islands. Objective. The creation of a forecast model that manages to alert the decision-making bodies and, in particular, the healthcare system, to hinder the emergence of any other pandemic outbreaks, or the arrival of subsequent pandemic waves. Methods. A new mathematical model to describe the pandemic is given. The model includes the class of undiagnosed infected people, and has a multi-region extension, to cope with the in-time and in-space heterogeneity of the epidemic. Results. We obtain a robust and reliable tool for the forecast of the total and active cases, which can be also used to simulate different scenarios. Conclusions. We are able to address a number of issues, such as assessing the adoption of the lockdown in Italy, started from 11 March 2020, and how to employ a rapid screening test campaign for containing the epidemic.

q-bio.PE↗

Arbitrarily high-order energy-preserving methods for simulating the gyrocenter dynamics of charged particles

Gyrocenter dynamics of charged particles plays a fundamental role in plasma physics. In particular, accuracy and conservation of energy are important features for correctly performing long-time simulations. For this purpose, we here propose arbitrarily high-order energy conserving methods for its simulation. The analysis and the efficient implementation of the methods are fully described, and some numerical tests are reported.

math.NA↗

Spectrally accurate space-time solution of Manakov systems

In this paper, we study the numerical solution of Manakov systems by using a spectrally accurate Fourier decomposition in space, coupled with a spectrally accurate time integration. This latter relies on the use of spectral Hamiltonian boundary Value Methods. The used approach allows to conserve all the physical invariants of the systems. Some numerical tests are reported.

math.NA↗

On the use of the Infinity Computer architecture to set up a dynamic precision floating-point arithmetic

We devise a variable precision floating-point arithmetic by exploiting the framework provided by the Infinity Computer. This is a computational platform implementing the Infinity Arithmetic system, a positional numeral system which can handle both infinite and infinitesimal quantities symbolized by the positive and negative finite powers of the radix grossone. The computational features offered by the Infinity Computer allows us to dynamically change the accuracy of representation and floating-point operations during the flow of a computation. When suitably implemented, this possibility turns out to be particularly advantageous when solving ill-conditioned problems. In fact, compared with a standard multi-precision arithmetic, here the accuracy is improved only when needed, thus not affecting that much the overall computational effort. An illustrative example about the solution of a nonlinear equation is also presented.

math.NA↗