SearcharxivSearch

arXiv · 2201.04447

Floquet multipliers and the stability of periodic linear differential equations: a unified algorithm and its computer realization

Abstract

Floquet multipliers (characteristic multipliers) play significant role in the stability of the periodic equations. Based on the iterative method, we provide a unified algorithm to compute the Floquet multipliers (characteristic multipliers) and determine the stability of the periodic linear differential equations on time scales unifying discrete, continuous, and hybrid dynamics. Our approach is based on calculating the value of A and B (see Theorem 3.1), which are the sum and product of all Floquet multipliers (characteristic multipliers) of the system, respectively. We obtain an explicit expression of A (see Theorem 4.1) by the method of variation and approximation theory and an explicit expression of B by Liouville's formula. Furthermore, a computer program is designed to realize our algorithm. Specifically, you can determine the stability of a second order periodic linear system, whether they are discrete, continuous or hybrid, as long as you enter the program codes associated with the parameters of the equation. In fact, few literatures have dealt with the algorithm to compute the Floquet multipliers, not mention to design the program for its computer realization. Our algorithm gives the explicit expressions of all Floquet multipliers and our computer program is based on the approximations of these explicit expressions. In particular, on an arbitrary discrete periodic time scale, we can do a finite number of calculations to get the explicit value of Floquet multipliers (see Theorem 4.2). Therefore, for any discrete periodic system, we can accurately determine the stability of the system even without computer! Finally, in Section 6, several examples are presented to illustrate the effectiveness of our algorithm.

Explore related subjects

Keep this discovery

BibTeXRIS

Mengda Wu, Yonghui Xia, Ziyi Xu. 2022-01-12. Floquet multipliers and the stability of periodic linear differential equations: a unified algorithm and its computer realization. https://arxiv.org/abs/2201.04447

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA