SearcharxivSearch

arXiv subjects

Alessandro Pugliese

Publications and source records attributed to Alessandro Pugliese.

9 recordsLinked to original sources

On the Optimal Laplacian Jordan Structure for Synchronizability

In this work, for a network of differential equations with a prescribed graph structure, our goal is to show how to select the Laplacian of the network in order to obtain the most favorable outcome insofar as synchronizability. That is, we will want to: (i) guarantee asymptotic stability of a synchronous solution (as measured by a negative value of the master stability function), (ii) minimize the normalized spread of the Laplacian eigenvalues, and (iii) have a transient as short as possible. Within the class of tridiagonal Laplacians, we give both necessary and sufficient conditions for satisfying our three criteria above, and give extension to banded Laplacians as well. Finally, we give extensive numerical results to elucidate our theoretical results and to compare to existing works.

math.OC

Generic Cuspidal Points and Their Localization

In this work we consider generic coalescing of eigenvalues of smooth complex valued matrix functions depending on 2 parameters. We call generic cuspidal points the parameter values where eigenvalues coalesce and we discuss the relation between cuspidal points and the closely related exceptional points studied in the literature. By considering loops in parameter space enclosing the cuspidal points, we rigorously prove when there is a phase accumulation for the eigenvectors and further detail how, by looking at the periodicity of the eigenvalues along the loop, and/or by looking at the aforementioned phase accumulation, one may be able to localize generic cuspidal points.

math.RA

Avoided crossings, degeneracies and Berry phases in the spectrum of quantum noise of driven-dissipative bosonic systems

Avoided crossings are fundamental phenomena in quantum mechanics and photonics that originate from the interaction between coupled energy levels and have been extensively studied in linear dispersive dynamics. Their manifestation in open, driven-dissipative systems, however, where nonlinear dynamics of quantum fluctuations come into play, remains largely unexplored. In this work, we analyze the hitherto unexplored occurrence of avoided and genuine crossings in the spectrum of quantum noise. We demonstrate that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the associated singular vectors and suggesting the presence of genuine crossings (diabolical points) in nearby systems. We show that these spectral features can be deliberately designed, highlighting the possibility of programming the quantum noise response of photonic systems. As a notable example, such control can be exploited to generate broad, flat-band squeezing spectra - a desirable feature for enhancing degaussification protocols. Our analysis is based on a detailed study of the Analytic Bloch-Messiah Decomposition (ABMD), which we use to characterize the parameter-dependent behavior of singular values and their corresponding vectors. This study provides new insights into the structure of multimode quantum correlations and offers a theoretical framework for the experimental exploitation of complex quantum optical systems.

quant-ph

On an inverse tridiagonal eigenvalue problem and its application to synchronization of network motion

In this work, motivated by the study of stability of the synchronous orbit of a network with tridiagonal Laplacian matrix, we first solve an inverse eigenvalue problem which builds a tridiagonal Laplacian matrix with eigenvalues $\lambda_1=0<\lambda_2<\cdots <\lambda_N$ and null-vector $\boldsymbol{e} = \begin{bmatrix} 1 \\ \vdots \\ 1 \end{bmatrix}$. Then, we show how this result can be used to guarantee -- if possible -- that a synchronous orbit of a connected tridiagonal network associated to the matrix $L$ above is asymptotically stable, in the sense of having an associated negative Master Stability Function (MSF). We further show that there are limitations when we also impose symmetry for $L$.

math.DS

Cusp bifurcations: numerical detection via two-parameter continuation and computer-assisted proofs of existence

This paper introduces a novel computer-assisted method for detecting and constructively proving the existence of cusp bifurcations in differential equations. The approach begins with a two-parameter continuation along which a tool based on the theory of Poincar\'e index is employed to identify the presence of a cusp bifurcation. Using the approximate cusp location, Newton's method is then applied to a given augmented system (the cusp map), yielding a more precise numerical approximation of the cusp. Through a successful application of a Newton-Kantorovich type theorem, we establish the existence of a non-degenerate zero of the cusp map in the vicinity of the numerical approximation. Employing a Gershgorin circles argument, we then prove that exactly one eigenvalue of the Jacobian matrix at the cusp candidate has zero real part, thus rigorously confirming the presence of a cusp bifurcation. Finally, by incorporating explicit control over the cusp's location, a rigorous enclosure for the normal form coefficient is obtained, providing the explicit dynamics on the center manifold at the cusp. We show the effectiveness of this method by applying it to four distinct models.

math.DS

SVD, joint-MVD, Berry phase, and generic loss of rank for a matrix valued function of 2 parameters

In this work we consider generic losses of rank for complex valued matrix functions depending on two parameters. We give theoretical results that characterize parameter regions where these losses of rank occur. Our main results consist in showing how following an appropriate smooth SVD along a closed loop it is possible to monitor the Berry phases accrued by the singular vectors to decide if -- inside the loop -- there are parameter values where a loss of rank takes place. It will be needed to use a new construction of a smooth SVD, which we call the "joint-MVD" (minimum variation decomposition).

math.RA

Forming a symmetric, unreduced, tridiagonal matrix with a given spectrum

Given a set of $n$ distinct real numbers, our goal is to form a symmetric, unreduced, tridiagonal, matrix with those numbers as eigenvalues. We give an algorithm which is a stable implementation of a naive algorithm forming the characteristic polynomial and then using a technique of Schmeisser.

math.NA

Takagi factorization of matrices depending on parameters and locating degeneracies of singular values

In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to $0$ or multiple singular values. For these phenomena, we give theoretical results showing that their co-dimension is $2$, and we further develop and test numerical methods to locate in parameter space values where these occurrences take place. Numerical study of the density of these occurrences is performed.

math.NA

Decompositions and coalescing eigenvalues of symmetric definite pencils depending on parameters

In this work, we consider symmetric positive definite pencils depending on two parameters. That is, we are concerned with the generalized eigenvalue problem $A(x)-λB(x)$, where $A$ and $B$ are symmetric matrix valued functions in ${\mathbb R}^{n\times n}$, smoothly depending on parameters $x\in Ω\subset {\mathbb R}^2$; further, $B$ is also positive definite. In general, the eigenvalues of this multiparameter problem will not be smooth, the lack of smoothness resulting from eigenvalues being equal at some parameter values (conical intersections). We first give general theoretical results on the smoothness of eigenvalues and eigenvectors for the present generalized eigenvalue problem, and hence for the corresponding projections, and then perform a numerical study of the statistical properties of coalescing eigenvalues for pencils where $A$ and $B$ are either full or banded, for several bandwidths. Our numerical study will be performed with respect to a random matrix ensemble which respects the underlying engineering problems motivating our study.

math.NA