arXiv subjects

Emma Perracchione

Publications and source records attributed to Emma Perracchione.

At least 37 records · Page 2Linked to original sources

arXiv2021

Efficient Reduced Basis Algorithm (ERBA) for kernel-based approximation

The main purpose of this work is the one of providing an efficient scheme for constructing reduced interpolation models for kernel bases. In literature such problem is mainly addressed via the well-established knot insertion or knot removal schemes. Such iterative strategies are usually quite demanding from a computational point of view and our goal is to study an efficient implementation for data removal approaches, namely Efficient Reduced Basis Algorithm (ERBA). Focusing on kernel-based interpolation, the algorithm makes use of two iterative rules for removing data. The former, called ERBA-r, is based on classical residual evaluations. The latter, namely ERBA-p, is independent of the function values and relies on error bounds defined by the power function. In both cases, inspired by the so-called extended Rippa's algorithm, our ERBA takes advantage of a fast implementation.

math.NA↗

arXiv2021

STIX X-ray microflare observations during the Solar Orbiter commissioning phase

The Spectrometer/Telescope for Imaging X-rays (STIX) is the HXR instrument onboard Solar Orbiter designed to observe solar flares over a broad range of flare sizes, between 4-150 keV. We report the first STIX observations of microflares recorded during the instrument commissioning phase in order to investigate the STIX performance at its detection limit. This first result paper focuses on the temporal and spectral evolution of STIX microflares occuring in the AR12765 in June 2020, and compares the STIX measurements with GOES/XRS, SDO/AIA, and Hinode/XRT. For the observed microflares of the GOES A and B class, the STIX peak time at lowest energies is located in the impulsive phase of the flares, well before the GOES peak time. Such a behavior can either be explained by the higher sensitivity of STIX to higher temperatures compared to GOES, or due to the existence of a nonthermal component reaching down to low energies. The interpretation is inconclusive due to limited counting statistics for all but the largest flare in our sample. For this largest flare, the low-energy peak time is clearly due to thermal emission, and the nonthermal component seen at higher energies occurs even earlier. This suggests that the classic thermal explanation might also be favored for the majority of the smaller flares. In combination with EUV and SXR observations, STIX corroborates earlier findings that an isothermal assumption is of limited validity. Future diagnostic efforts should focus on multi-wavelength studies to derive differential emission measure distributions over a wide range of temperatures to accurately describe the energetics of solar flares. Commissioning observations confirm that STIX is working as designed. As a rule of thumb, STIX detects flares as small as the GOES A class. For flares above the GOES B class, detailed spectral and imaging analyses can be performed.

astro-ph.SR↗

arXiv2021

Data-driven reduced order modeling of environmental hydrodynamics using deep autoencoders and neural ODEs

Model reduction for fluid flow simulation continues to be of great interest across a number of scientific and engineering fields. In a previous work [arXiv:2104.13962], we explored the use of Neural Ordinary Differential Equations (NODE) as a non-intrusive method for propagating the latent-space dynamics in reduced order models. Here, we investigate employing deep autoencoders for discovering the reduced basis representation, the dynamics of which are then approximated by NODE. The ability of deep autoencoders to represent the latent-space is compared to the traditional proper orthogonal decomposition (POD) approach, again in conjunction with NODE for capturing the dynamics. Additionally, we compare their behavior with two classical non-intrusive methods based on POD and radial basis function interpolation as well as dynamic mode decomposition. The test problems we consider include incompressible flow around a cylinder as well as a real-world application of shallow water hydrodynamics in an estuarine system. Our findings indicate that deep autoencoders can leverage nonlinear manifold learning to achieve a highly efficient compression of spatial information and define a latent-space that appears to be more suitable for capturing the temporal dynamics through the NODE framework.

cs.LG↗

arXiv2021

A greedy non-intrusive reduced order model for shallow water equations

In this work, we develop Non-Intrusive Reduced Order Models (NIROMs) that combine Proper Orthogonal Decomposition (POD) with a Radial Basis Function (RBF) interpolation method to construct efficient reduced order models for time-dependent problems arising in large scale environmental flow applications. The performance of the POD-RBF NIROM is compared with a traditional nonlinear POD (NPOD) model by evaluating the accuracy and robustness for test problems representative of riverine flows. Different greedy algorithms are studied in order to determine a near-optimal distribution of interpolation points for the RBF approximation. A new power-scaled residual greedy (psr-greedy) algorithm is proposed to address some of the primary drawbacks of the existing greedy approaches. The relative performances of these greedy algorithms are studied with numerical experiments using realistic two-dimensional (2D) shallow water flow applications involving coastal and riverine dynamics.

physics.comp-ph↗

arXiv2021

Feature augmentation for the inversion of the Fourier transform with limited data

We investigate an interpolation/extrapolation method that, given scattered observations of the Fourier transform, approximates its inverse. The interpolation algorithm takes advantage of modelling the available data via a shape-driven interpolation based on Variably Scaled Kernels (VSKs), whose implementation is here tailored for inverse problems. The so-constructed interpolants are used as inputs for a standard iterative inversion scheme. After providing theoretical results concerning the spectrum of the VSK collocation matrix, we test the method on astrophysical imaging benchmarks.

math.NA↗

arXiv2020

Visibility Interpolation in Solar Hard X-ray Imaging: Application to RHESSI and STIX

Space telescopes for solar hard X-ray imaging provide observations made of sampled Fourier components of the incoming photon flux. The aim of this study is to design an image reconstruction method relying on enhanced visibility interpolation in the Fourier domain. % methods heading (mandatory) The interpolation-based method is applied on synthetic visibilities generated by means of the simulation software implemented within the framework of the Spectrometer/Telescope for Imaging X-rays (STIX) mission on board Solar Orbiter. An application to experimental visibilities observed by the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI) is also considered. In order to interpolate these visibility data we have utilized an approach based on Variably Scaled Kernels (VSKs), which are able to realize feature augmentation by exploiting prior information on the flaring source and which are used here, for the first time, for image reconstruction purposes.} % results heading (mandatory) When compared to an interpolation-based reconstruction algorithm previously introduced for RHESSI, VSKs offer significantly better performances, particularly in the case of STIX imaging, which is characterized by a notably sparse sampling of the Fourier domain. In the case of RHESSI data, this novel approach is particularly reliable when either the flaring sources are characterized by narrow, ribbon-like shapes or high-resolution detectors are utilized for observations. % conclusions heading (optional), leave it empty if necessary The use of VSKs for interpolating hard X-ray visibilities allows a notable image reconstruction accuracy when the information on the flaring source is encoded by a small set of scattered Fourier data and when the visibility surface is affected by significant oscillations in the frequency domain.

astro-ph.IM↗

arXiv2020

Data-driven extrapolation via feature augmentation based on variably scaled thin plate splines

The data driven extrapolation requires the definition of a functional model depending on the available data and has the application scope of providing reliable predictions on the unknown dynamics. Since data might be scattered, we drive our attention towards kernel models that have the advantage of being meshfree. Precisely, the proposed numerical method makes use of the so-called Variably Scaled Kernels (VSKs), which are introduced to implement a feature augmentation-like strategy based on discrete data. Due to the possible uncertainty on the data and since we are interested in modelling the behaviour of the considered dynamics, we seek for a regularized solution by ridge regression. Focusing on polyharmonic splines, we investigate their implementation in the VSK setting and we provide error bounds in Beppo-Levi spaces. The performances of the method are then tested on functions which are common in the framework of the Laplace transform inversion. Comparisons with Support Vector Regression (SVR) are also carried out and show that the proposed method is effective particularly since it does not require to train complex architecture constructions.

math.NA↗

arXiv2019

Shape-Driven Interpolation with Discontinuous Kernels: Error Analysis, Edge Extraction and Applications in MPI

Accurate interpolation and approximation techniques for functions with discontinuities are key tools in many applications as, for instance, medical imaging. In this paper, we study an RBF type method for scattered data interpolation that incorporates discontinuities via a variable scaling function. For the construction of the discontinuous basis of kernel functions, information on the edges of the interpolated function is necessary. We characterize the native space spanned by these kernel functions and study error bounds in terms of the fill distance of the node set. To extract the location of the discontinuities, we use a segmentation method based on a classification algorithm from machine learning. The conducted numerical experiments confirm the theoretically derived convergence rates in case that the discontinuities are a priori known. Further, an application to interpolation in magnetic particle imaging shows that the presented method is very promising.

math.NA↗

arXiv2018

Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects

We consider the problem of reconstructing 3D objects via meshfree interpolation methods. In this framework, we usually deal with large data sets and thus we develop an efficient local scheme via the well-known Partition of Unity (PU) method. The main contribution in this paper consists in constructing the local interpolants for the implicit interpolation by means of Rational Radial Basis Functions (RRBFs). Numerical evidence confirms that the proposed method is particularly performing when 3D objects, or more in general implicit functions defined by scattered data, need to be approximated.

math.NA↗

arXiv2017

Optimal selection of local approximants in RBF-PU interpolation

The Partition of Unity (PU) method, performed with local Radial Basis Function (RBF) approximants, has been proved to be an effective tool for solving large scattered data interpolation problems. However, in order to achieve a good accuracy, the question about how many points we have to consider on each local subdomain, i.e. how large can be the local data sets, needs to be answered. Moreover, it is well-known that also the shape parameter affects the accuracy of the local RBF approximants and, as a consequence, of the PU interpolant. Thus here, both the shape parameter used to fit the local problems and the size of the associated linear systems are supposed to vary among the subdomains. They are selected by minimizing an a priori error estimate. As evident from extensive numerical experiments and applications provided in the paper, the proposed method turns out to be extremely accurate also when data with non-homogeneous density are considered.

math.NA↗

arXiv2017

Positive constrained approximation via RBF-based partition of unity method

In this paper, we discuss the problem of constructing Radial Basis In this paper, we discuss the problem of constructing Radial Basis Function (RBF)-based Partition of Unity (PU) interpolants that are positive if data values are positive. More specifically, we compute positive local approximants by adding up several constraints to the interpolation conditions. This approach, considering a global approximation problem and Compactly Supported RBFs (CSRBFs), has been previously proposed. Here, the use of the PU technique enables us to intervene only locally and as a consequence to reach a better accuracy. This is also due to the fact that we select the optimal number of positive constraints by means of an a priori error estimate and we do not restrict to the use of CSRBFs. Numerical experiments and applications to population dynamics are provided to illustrate the effectiveness of the method in applied sciences.

math.NA↗

arXiv2016

RBF-PU Interpolation with Variable Subdomain Sizes and Shape Parameters

In this paper, we deal with the challenging computational issue of interpolating large data sets, with eventually non-homogeneous densities. To such scope, the Radial Basis Function Partition of Unity (RBF-PU) method has been proved to be a reliable numerical tool. However, there are not available techniques enabling us to efficiently select the sizes of the local PU subdomains which, together with the value of the RBF shape parameter, greatly influence the accuracy of the final fit. Thus here, by minimizing an \emph{a priori} error estimate, we propose a RBF-PU method by suitably selecting variable shape parameters and subdomain sizes. Numerical results and applications show performaces of the interpolation technique.

math.NA↗

arXiv2015

Fast and flexible interpolation via PUM with applications in population dynamics

In this paper the Partition of Unity Method (PUM) is efficiently performed using Radial Basis Functions (RBFs) as local approximants. In particular, we present a new space-partitioning data structure extremely useful in applications because of its independence from the problem geometry. Moreover, we study, in the context of wild herbivores in forests, an application of such algorithm. This investigation shows that the ecosystem of the considered natural park is in a very delicate situation, for which the animal population could become extinguished. The determination of the so-called sensitivity surfaces, obtained with the new fast and flexible interpolation tool, indicates some possible preventive measures to the park administrators.

math.NA↗

arXiv2015

Wild herbivores in forests: four case studies

A three population system with a top predator population, i.e. the herbivores, and two prey populations, grass and trees, is considered to model the interaction of herbivores with natural resources. We apply the model for four natural mountain parks in Northern Italy, three located in the Eastern Alps, two of which in the Dolomites and one in the Julian Alps, and one in the Maritime Alps, Northwest Italy. The simulations, based on actual data gathered from contacts with rangers and parks administrators, field samplings and published material, provide useful information on the behavior of the vegetation-wild herbivores interactions and the possible medium-long term evolution of these ecosystems. At the same time they show that these ecosystems are in a very delicate situation, for which the animal populations could become extinguished in case of adverse environmental conditions. The determination of the so called sensitivity surfaces support our findings and indicate some possible preventive measures to the park admistrators.

q-bio.PE↗

arXiv2015

Approximating basins of attraction for dynamical systems via stable radial bases

In applied sciences, such as physics and biology, it is often required to model the evolution of populations via dynamical systems. In this paper, we focus on the problem of approximating the basins of attraction of such models in case of multi-stability. We propose to reconstruct the domains of attraction via an implicit interpolant using stable radial bases, obtaining the surfaces by partitioning the phase space into disjoint regions. An application to a competition model presenting jointly three stable equilibria is considered.

math.NA↗

arXiv2015

An RBF-PSO Based Approach for Modeling Prostate Cancer

Prostate cancer is one of the most common cancers in men. It is characterized by a slow growth and it can be diagnosed in an early stage by observing the Prostate Specific Antigen (PSA). However, a relapse after the primary therapy could arise and different growth characteristics of the new tumor are observed. In order to get a better understanding of the phenomenon, a mathematical model involving several parameters is considered. To estimate the values of the parameters identifying the disease risk level a novel approach, based on combining Particle Swarm Optimization (PSO) with a meshfree interpolation method, is proposed.

q-bio.TO↗

arXiv2015

Robust approximation algorithms for the detection of attraction basins in dynamical systems

In dynamical systems saddle points partition the domain into basins of attractions of the remaining locally stable equilibria. This problem is rather common especially in population dynamics models. Precisely, a particular solution of a dynamical system is completely determined by its initial condition and by the parameters involved in the model. Furthermore, when the omega limit set reduces to a point, the trajectory of the solution evolves towards the steady state. But, in case of multi-stability it is possible that several steady states originate from the same parameter set. Thus, in these cases the importance of accurately reconstruct the attraction basins follows. In this paper we focus on dynamical systems of ordinary differential equations presenting three stable equilibia and we design algorithms for the detection of the points lying on the manifolds determining the basins of attraction and for the reconstruction of such manifolds. The latter are reconstructed by means of the implicit partition of unity method which makes use of radial basis functions (RBFs) as local approximants. Extensive numerical test, carried out with a Matlab package made available to the scientific community, support our findings.

math.NA↗

arXiv2015

Graphical representation of separatrices of attraction basins in two and three dimensional dynamical systems

In this paper we consider the problem of reconstructing separatrices in dynamical systems. In particular, here we aim at partitioning the domain approximating the boundaries of the basins of attraction of different stable equilibria. We start from the 2D case sketched in \cite{cavoretto11} and the approximation scheme presented in \cite{cavoretto11,C-D-P-V}, and then we extend the reconstruction scheme of separatrices in the cases of three dimensional models with two and three stable equilibria. For this purpose we construct computational algorithms and procedures for the detection and the refinement of points located on the separatrix manifolds that partition the phase space. The use of the so-called meshfree or meshless methods is used to reconstruct the separatrices.

math.NA↗