Searcharxiv⌕ Search

arXiv subjects

Roberto Cavoretto

Publications and source records attributed to Roberto Cavoretto.

28 records · Page 2Linked to original sources

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↗

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↗

Reliable approximation of separatrix manifolds in competition models with safety niches

In dynamical systems saddle points partition the domain into basins of attractions of the remaining locally stable equilibria. This situation is rather common especially in population dynamics models, like prey-predator or competition systems. Focusing on squirrels population models with niche, in this paper we design algorithms for the detection and the refinement of points lying on the separatrix manifold partitioning the phase space. We consider both the two populations and the three populations cases. To reconstruct the separatrix curve and surface, we apply the Partition of Unity method, which makes use of Wendland's functions as local approximants.

math.NA↗

Partition of Unity Interpolation on Multivariate Convex Domains

In this paper we present a new algorithm for multivariate interpolation of scattered data sets lying in convex domains $Ω\subseteq \RR^N$, for any $N \geq 2$. To organize the points in a multidimensional space, we build a $kd$-tree space-partitioning data structure, which is used to efficiently apply a partition of unity interpolant. This global scheme is combined with local radial basis function approximants and compactly supported weight functions. A detailed description of the algorithm for convex domains and a complexity analysis of the computational procedures are also considered. Several numerical experiments show the performances of the interpolation algorithm on various sets of Halton data points contained in $Ω$, where $Ω$ can be any convex domain like a 2D polygon or a 3D polyhedron.

math.NA↗

A trivariate interpolation algorithm using a cube-partition searching procedure

In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported weight functions. The partition of unity algorithm is efficiently implemented and optimized by connecting the method with an effective cube-partition searching procedure. More precisely, we construct a cube structure, which partitions the domain and strictly depends on the size of its subdomains, so that the new searching procedure and, accordingly, the resulting algorithm enable us to efficiently deal with a large number of nodes. Complexity analysis and numerical experiments show high efficiency and accuracy of the proposed interpolation algorithm.

math.NA↗

Two-dimensional interpolation using a cell-based searching procedure

In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function interpolants with locally supported weight functions. In particular, this interpolation scheme is characterized by the construction of a suitable partition of the domain in cells so that the cell structure strictly depends on the dimension of its subdomains. This fact allows us to construct an efficient cell-based searching procedure, which provides a significant reduction of CPU times. Complexity analysis and numerical results show such improvements on the algorithm performances.

math.NA↗

Local interpolation schemes for landmark-based image registration: a comparison

In this paper we focus, from a mathematical point of view, on properties and performances of some local interpolation schemes for landmark-based image registration. Precisely, we consider modified Shepard's interpolants, Wendland's functions, and Lobachevsky splines. They are quite unlike each other, but all of them are compactly supported and enjoy interesting theoretical and computational properties. In particular, we point out some unusual forms of the considered functions. Finally, detailed numerical comparisons are given, considering also Gaussians and thin plate splines, which are really globally supported but widely used in applications.

math.NA↗

A two-strain ecoepidemic competition model

In this paper we consider a competition system in which two diseases spread by contact. We characterize the system behavior, establishing that only some configurations are possible. In particular we discover that coexistence of the two strains is not possible, under the assumptions of the model. A number of transcritical bifurcations relate the more relevant system's equilibria. Bistability is shown between a situation in which only the disease-unaffected population thrives and another one containing only the second population with endemic disease. An accurate computation of the separating surface of the basins of attraction of these two mutually exclusive equilibria is obtained via novel results in approximation theory.

math.DS↗

On the principle of competitive exclusion in metapopulation models

In this paper we present and analyse a simple two populations model with migrations among two different environments. The populations interact by competing for resources. Equilibria are investigated. A proof for the boundedness of the populations is provided. A kind of competitive exclusion principle for metapopulation systems is obtained. At the same time we show that the competitive exclusion principle at the local patch level may be prevented to hold by the migration phenomenon, i.e. two competing populations may coexist, provided that only one of them is allowed to freely move or that migrations for both occur just in one direction.

q-bio.PE↗

Comparing disease control policies for interacting wild populations

We consider interacting population systems of predator-prey type, presenting four models of control strategies for epidemics among the prey. In particular to contain the transmissible disease, safety niches are considered, assuming they lessen the disease spread, but do not protect prey from predators. This represents a novelty with respect to standard ecosystems where the refuge prevents predators' attacks. The niche is assumed either to protect the healthy individuals, or to hinder the infected ones to get in contact with the susceptibles, or finally to reduce altogether contacts that might lead to new cases of the infection. In addition a standard culling procedure is also analysed. The effectiveness of the different strategies are compared. Probably the environments providing a place where disease carriers cannot come in contact with the healthy individuals, or where their contact rates are lowered, seem to preferable for disease containment.

q-bio.PE↗