arXiv subjects

Giovanni Russo

Publications and source records attributed to Giovanni Russo.

At least 127 records · Page 7Linked to original sources

arXiv2018

The Gaussian wave packets transform for the semi-classical Schrödinger equation with vector potentials

In this paper, we reformulate the semi-classical Schrödinger equation in the presence of electromagnetic field by the Gaussian wave packets transform. With this approach, the highly oscillatory Schrödinger equation is equivalently transformed into another Schrödinger type wave equation, the $w$ equation, which is essentially not oscillatory and thus requires much less computational effort. We propose two numerical methods to solve the $w$ equation, where the Hamiltonian is either divided into the kinetic, the potential and the convection part, or into the kinetic and the potential-convection part. The convection, or the potential-convection part is treated by a semi-Lagrangian method, while the kinetic part is solved by the Fourier spectral method. The numerical methods are proved to be unconditionally stable, spectrally accurate in space and second order accurate in time, and in principle they can be extended to higher order schemes in time. Various one dimensional and multidimensional numerical tests are provided to justify the properties of the proposed methods.

math.NA↗

arXiv2017

Exploiting nodes symmetries to control synchronization and consensus patterns in multiagent systems

We present new conditions to obtain synchronization and consensus patterns in complex network systems. The key idea is to exploit symmetries of the nodes' vector fields to induce a desired synchronization/consensus pattern, where nodes are clustered in different groups each converging towards a different synchronized evolution. We show that the new conditions we present offer a systematic methodology to design a distributed network controller able to drive a network of interest towards a desired synchronization/consensus pattern.

eess.SY↗

arXiv2017

How to desynchronize quorum-sensing networks

In this paper we investigate how so-called quorum-sensing networks can be de-synchronized. Such networks, which arise in many important application fields such as systems biology, are characterized by the fact that direct communication between network nodes is superimposed to communication with a shared, environmental, variable. In particular, we provide a new sufficient condition ensuring that the trajectories of these quorum-sensing networks diverge from their synchronous evolution. Then, we apply our result to study two applications.

nlin.AO↗

arXiv2017

Pedestrian-Aware Engine Management Strategies for Plug-in Hybrid Electric Vehicles

Electric Vehicles (EVs) and Plug-in Hybrid Electric Vehicles (PHEVs) are increasingly being seen as a means of mitigating the pressing concerns of traffic-related pollution. While hybrid vehicles are usually designed with the objective of minimising fuel consumption, in this paper we propose engine management strategies that also take into account environmental effects of the vehicles to pedestrians outside of the vehicles. Specifically, we present optimisation based engine energy management strategies for PHEVs, that attempt to minimise the environmental impact of pedestrians along the route of the vehicle, while taking account of route dependent uncertainties. We implement the proposed approach in a real PHEV, and evaluate the performance in a hardware-in-the-loop platform. A variety of simulation results are given to illustrate the efficacy of our proposed approach.

eess.SY↗

arXiv2016

Central WENO schemes for hyperbolic conservation laws on fixed and moving unstructured meshes

We present a novel arbitrary high order accurate central WENO spatial reconstruction procedure (CWENO) for the solution of nonlinear systems of hyperbolic conservation laws on fixed and moving unstructured simplex meshes in two and three space dimensions. Starting from the given cell averages of a function on a triangular or tetrahedral control volume and its neighbors, the nonlinear CWENO reconstruction yields a high order accurate and essentially non-oscillatory polynomial that is defined everywhere in the cell. Compared to other WENO schemes on unstructured meshes, the total stencil size is the minimum possible one, as in classical point-wise WENO schemes of Jiang and Shu. However, the linear weights can be chosen arbitrarily, which makes the practical implementation on general unstructured meshes particularly simple. We make use of the piecewise polynomials generated by the CWENO reconstruction operator inside the framework of fully discrete and high order accurate one-step ADER finite volume schemes on fixed Eulerian grids as well as on moving Arbitrary-Lagrangian-Eulerian (ALE) meshes. The computational efficiency of the high order finite volume schemes based on the new CWENO reconstruction is tested on several two- and three-dimensional systems of hyperbolic conservation laws and is found to be more efficient in terms of memory consumption and computational efficiency with respect to classical WENO reconstruction schemes on unstructured meshes. We also provide evidence that the new algorithm is suitable for implementation on massively parallel distributed memory supercomputers, showing two numerical examples run with more than one billion degrees of freedom in space. To our knowledge, at present these are the largest simulations ever run with unstructured WENO finite volume schemes.

math.NA↗

arXiv2016

A deterministic particle approximation for non-linear conservation laws

We review our analytical and numerical results obtained on the microscopic Follow-The-Leader (FTL) many particle approximation of one-dimensional conservation laws. More precisely, we introduce deterministic particle schemes for the Hughes model for pedestrian movements and for two vehicular traffic models, that are the scalar Lighthill-Whitham-Richards model (LWR) and the $2\times2$ system Aw-Rascle-Zhang model (ARZ). Their approximation is performed by a set of ODEs, determining the motion of platoons of possible fractional vehicles or pedestrians seen as particles. Convergence results of the schemes in the many particle limit are stated. The numerical simulations suggest the consistency of the schemes.

math.NA↗

arXiv2016

Follow-the-leader approximations of macroscopic models for vehicular and pedestrian flows

We review recent results and present new ones on a deterministic follow-the-leader particle approximation of first and second order models for traffic flow and pedestrian movements. We start by constructing the particle scheme for the first order Lighthill-Whitham-Richards (LWR) model for traffic flow. The approximation is performed by a set of ODEs following the position of discretised vehicles seen as moving particles. The convergence of the scheme in the many particle limit towards the unique entropy solution of the LWR equation is proven in the case of the Cauchy problem on the real line. We then extend our approach to the Initial-Boundary Value Problem (IBVP) with time-varying Dirichlet data on a bounded interval. In this case we prove that our scheme is convergent strongly in $L^1$ up to a subsequence. We then review extensions of this approach to the Hughes model for pedestrian movements and to the second order Aw-Rascle-Zhang (ARZ) model for vehicular traffic. Finally, we complement our results with numerical simulations. In particular, the simulations performed on the IBVP and the ARZ model suggest the consistency of the corresponding schemes, which is easy to prove rigorously in some simple cases.

math.NA↗

arXiv2016

Conservative Multi-Dimensional Semi-Lagrangian Finite Difference Scheme: Stability and Applications to the Kinetic and Fluid Simulations

In this paper, we propose a mass conservative semi-Lagrangian finite difference scheme for multi-dimensional problems without dimensional splitting. The semi-Lagrangian scheme, based on tracing characteristics backward in time from grid points, does not necessarily conserve the total mass. To ensure mass conservation, we propose a conservative correction procedure based on a flux difference form. Such procedure guarantees local mass conservation, while introducing time step constraints for stability. We theoretically investigate such stability constraints from an ODE point of view by assuming exact evaluation of spatial differential operators and from the Fourier analysis for linear PDEs. The scheme is tested by classical two dimensional linear passive-transport problems, such as linear advection, rotation and swirling deformation. The scheme is applied to solve the nonlinear Vlasov-Poisson system using a a high order tracing mechanism proposed in [Qiu and Russo, 2016]. Such high order characteristics tracing scheme is generalized to the nonlinear guiding center Vlasov model and incompressible Euler system. The effectiveness of the proposed conservative semi-Lagrangian scheme is demonstrated numerically by our extensive numerical tests.

math.NA↗

arXiv2016

On noise-induced synchronization and consensus of nonlinear network systems under input disturbances

This paper is concerned with the study of synchronization and consensus phenomena in complex networks of diffusively-coupled nodes subject to external disturbances. Specifically, we make use of stochastic Lyapunov functions to provide conditions for synchronization and consensus for networks of nonlinear, diffusively coupled nodes, where noise diffusion is not just additive but it depends on the nodes' state. The sufficient condition we provide, wich links together network topology, coupling strength and noise diffusion, offers two interesting interpretations. First, as suggested by {\em intuition}, in order for a network to achieve synchronization/consensus, its nodes need to be sufficiently well connected together. The second implication might seem, instead, counter-intuitive: if noise diffusion is {\em properly} designed, then it can drive an unsynchronized network towards synchronization/consensus. Motivated by our current research in Smart Cities and Internet of Things, we illustrate the effectiveness of our approach by showing how our results can be used to control certain collective decision processes.

eess.SY↗

arXiv2016

A High Order Multi-Dimensional Characteristic Tracing Strategy for the Vlasov-Poisson System

In this paper, we consider a finite difference grid-based semi-Lagrangian approach in solving the Vlasov-Poisson (VP) system. Many of existing methods are based on dimensional splitting, which decouples the problem into solving linear advection problems, see {\em Cheng and Knorr, Journal of Computational Physics, 22(1976)}. However, such splitting is subject to the splitting error. If we consider multi-dimensional problems without splitting, difficulty arises in tracing characteristics with high order accuracy. Specifically, the evolution of characteristics is subject to the electric field which is determined globally from the distribution of particle densities via the Poisson's equation. In this paper, we propose a novel strategy of tracing characteristics high order in time via a two-stage multi-derivative prediction-correction approach and by using moment equations of the VP system. With the foot of characteristics being accurately located, we proposed to use weighted essentially non-oscillatory (WENO) interpolation to recover function values between grid points, therefore to update solutions at the next time level. The proposed algorithm does not have time step restriction as Eulerian approach and enjoys high order spatial and temporal accuracy. However, such finite difference algorithm does not enjoy mass conservation; we discuss one possible way of resolving such issue and its potential challenge in numerical stability. The performance of the proposed schemes are numerically demonstrated via classical test problems such as Landau damping and two stream instabilities.

math.NA↗

arXiv2016

On noise-induced synchronization and consensus

In this paper, we present new results for the synchronization and consensus of networks described by Ito stochastic differential equations. From the methodological viewpoint, our results are based on the use of stochastic Lyapunov functions. This approach allowed us to consider networks where nodes dynamics can be nonlinear and non-autonomous and where noise is not just additive but rather its diffusion can be nonlinear and depend on the network state. We first present a sufficient condition on the coupling strength and topology ensuring that a network synchronizes (fulfills consensus) despite noise. Then, we show that noise can be useful, and present a result showing how to design noise so that it induces synchronization/consensus. Motivated by our current research in Smart Cities and Internet of Things, we also illustrate the effectiveness of our approach by showing how our results can be used to analyze/control the onset of synchronization in noisy networks and to study collective decision processes.

math.DS↗

arXiv2013

Implicit-Explicit Runge-Kutta schemes for hyperbolic systems with stiff relaxation and applications

In this paper we give an overview of Implicit-Explicit Runge-Kutta schemes applied to hyperbolic systems with stiff relaxation. In particular, we focus on some recent results on the uniform accuracy for hyperbolic systems with stiff relaxation [6], and hyperbolic system with diffusive relaxation [7, 5, 4]. In the latter case, we present an original application to a model problem arising in Extended Thermodynamics.

math.NA↗

arXiv2013

Graph Metrics for Temporal Networks

Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causality. In this chapter we discuss how to represent temporal networks and we review the definitions of walks, paths, connectedness and connected components valid for graphs in which the links fluctuate over time. We then focus on temporal node-node distance, and we discuss how to characterise link persistence and the temporal small-world behaviour in this class of networks. Finally, we discuss the extension of classic centrality measures, including closeness, betweenness and spectral centrality, to the case of time-varying graphs, and we review the work on temporal motifs analysis and the definition of modularity for temporal graphs.

physics.soc-ph↗

arXiv2012

High-order asymptotic-preserving methods for fully nonlinear relaxation problems

We study solutions to nonlinear hyperbolic systems with fully nonlinear relaxation terms in the limit of, both, infinitely stiff relaxation and arbitrary late time. In this limit, the dynamics is governed by effective systems of parabolic type, with possibly degenerate and/or fully nonlinear diffusion terms. For this class of problems, we develop here an implicit-explicit method based on Runge-Kutta discretization in time, and we use this method in order to investigate several examples of interest in compressible fluid dynamics. Importantly, we impose here a realistic stability condition on the time-step and we demonstrate that solutions in the hyperbolic-to-parabolic regime can be computed numerically with high robustness and accuracy, even in presence of fully nonlinear relaxation terms.

math.AP↗

arXiv2011

Second Order Multigrid Methods for Elliptic Problems with Discontinuous Coefficients on an Arbitrary Interface, I: One Dimensional Problems

In this paper we present a one dimensional second order accurate method to solve Elliptic equations with discontinuous coefficients on an arbitrary interface. Second order accuracy for the first derivative is obtained as well. The method is based on the Ghost Fluid Method, making use of ghost points on which the value is defined by suitable interface conditions. The multi-domain formulation is adopted, where the problem is split in two sub-problems and interface conditions will be enforced to close the problem. Interface conditions are relaxed together with the internal equations, leading to an iterative method on all the set of grid values (inside points and ghost points). A multigrid approach with a suitable definition of the restriction operator is provided. The restriction of the defect is performed separately for both sub-problems, providing a convergence factor close to the one measured in the case of smooth coefficient and independent on the magnitude of the jump in the coefficient. Numerical tests will confirm the second order accuracy. Although the method is proposed in one dimension, the extension in higher dimension is currently underway.

math.NA↗

arXiv2011

A Finite Difference Ghost-Cell Multigrid Approach for Poisson Equation with Mixed Boundary Conditions in Arbitrary Domain

In this paper we present a multigrid approach to solve the Poisson equation in arbitrary domain (identified by a level set function) and mixed boundary conditions. The discretization is based on finite difference scheme and ghost-cell method. This multigrid strategy can be applied also to more general problems where a non-eliminated boundary condition approach is used. Arbitrary domain make the definition of the restriction operator for boundary conditions hard to find. A suitable restriction operator is provided in this work, together with a proper treatment of the boundary smoothing, in order to avoid degradation of the convergence factor of the multigrid due to boundary effects. Several numerical tests confirm the good convergence property of the new method.

math.NA↗

arXiv2011

Contraction analysis of switched systems: the case of Caratheodory Systems and Networks

In this paper we extend to a generic class of piecewise smooth dynamical systems a fundamental tool for the analysis of convergence of smooth dynamical systems: contraction theory. We focus on switched systems satisfying Caratheodory conditions for the existence and unicity of a solution. After generalizing the classical definition of contraction to this class of dynamical systems, we give sufficient conditions for global exponential convergence of their trajectories. The theoretical results are then applied to solve a set of representative problems including proving global asymptotic stability of switched linear systems, giving conditions for incremental stability of piecewise smooth systems, and analyzing the convergence of networked switched linear systems.

math.OC↗

arXiv2011

Controlling centrality in complex networks

Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by their popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute the node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We prove that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We show that many large networks from the real world have surprisingly small controlling sets, containing even less than 5-10% of the nodes. These results suggest that rankings obtained from spectral centrality measures have to be considered with extreme care, since they can be easily controlled and even manipulated by a small group of nodes acting in a coordinated way.

physics.soc-ph↗