Find a Fundamental Matrix Solution and Transition Matrix
Fundamental Matrix Solution
Let Φ(t) denote the fundamental solution matrix or state transition matrix (STM) that contains n linearly independent solutions of eqn (4) with the initial conditions Φ(0)=I where I is the n×n unit matrix.
From: Encyclopedia of Vibration , 2001
PARAMETRIC EXCITATION
S.C. Sinha , A. David , in Encyclopedia of Vibration, 2001
Floquet Theory
Consider the linear periodic system given by eqn (4). Let Φ(t) denote the fundamental solution matrix or state transition matrix (STM) that contains n linearly independent solutions of eqn (4) with the initial conditions Φ(0)=I where I is the n×n unit matrix. Then the following statements hold:
- 1.
-
and, consequently
- 2.
-
- 3.
-
These results imply that, if the solution is known for the first period, it can be constructed for all time t. The matrix Φ(T) is called the Floquet transition matrix (FTM). The next statement considers the stability of eqn (4).
- 4.
-
Let ζ i(i=1, …, n) denote the eigenvalues of Φ(T). System (4) is asymptotically stable if all ζ i's lie inside the unit circle of the complex plane. The system is unstable if at least one of the eigenvalues of the FTM has magnitude greater than one. The eigenvalues ζ i are called the Floquet multipliers. The above statements briefly summarize the results of Floquet theory.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B0122270851000382
Handbook of Dynamical Systems
Wolf-Jürgen Beyn , ... Björn Sandstede , in Handbook of Dynamical Systems, 2002
Remark
The Floquet multipliers are the eigenvalues of the monodromy matrix V(1), where V (t) is the fundamental solution matrix of the homogeneous linear equation, that is, V (t) satisfies
Due to periodicity, V(1) always has an eigenvalue equal to 1, called the trivial multiplier. For the numerical computation of Floquet multipliers see Fairgrieve and Jepson [27] and Doedel et al. [25].
Above we have assumed α to be fixed. However, in practice we use Keller's method (see Section 2.2) to trace out a branch of periodic solutions. In particular, this allows calculation past folds along such a branch. In the current function space application, Keller's continuation equation takes the form
(7)
The complete computational formulation then consists of Equations (4)–(7), which are to be solved for x(·), T, and α. These equations correspond to a (generalized) boundary value problem (BVP), and are solved by a numerical boundary value technique. The most widely used discretization method for boundary value problems in ordinary differential equations is the method of orthogonal collocation with piecewise polynomials. In particular, orthogonal collocation is used in software such as COLSYS (Ascher et al. [3]), AUTO (Doedel [17], Doedel et al. [20]), COLDAE (Ascher and Spiteri [2]), and CONTENT (Kuznetsov and Levitin [52]). Its high accuracy (de Boor and Swartz [14]) and its known mesh-adaption techniques (Russell and Christiansen [67]) make this method particularly suitable for difficult problems.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874575X0280025X
Handbook of Dynamical Systems
David Cai , ... Kenneth T.R. McLaughlin , in Handbook of Dynamical Systems, 2002
Remark
In this section we have replaced t in the defocusing NLS equation with -t, and the equation becomes
The above Riemann-Hilbert problem (7.2)-(7.4) is one formulation of the integral equations of inverse scattering theory, as mentioned in Section 3. Indeed, if we set
(7.6)
then it turns out that for is a fundamental matrix solution of differential Equation (3.3), normalized by the following two conditions:
(7.7)
(7.8)
The jump relation (7.3) expresses the fact that while ψ (λ, x, t) satisfying (7.7)-(7.8) is defined a priori for only, it turns out that ψ(λ, x, t) has continuous boundary values for ,
Since ψ+ and ψ− represent two fundamental matrix solutions of (3.3), they must be related, i.e.,
for some jump matrix v which is independent of x.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874575X02800339
Periodic Solutions of Singular Perturbation Problems1
E.R. RANG , in International Symposium on Nonlinear Differential Equations and Nonlinear Mechanics, 1963
A Formula for Periodic Solutions
We included here a formula for periodic solutions of a nonhomogeneous linear system with periodic coefficients which was found helpful in the analysis. Consider the vector equation
(10)
when P(t), r(t) are real and periodic with period T 0 and continuous for all real t. Let Φ(t ) be a fundamental matrix solution of the homogeneous system
(11)
Then by direct calculation, one finds that equation (10) has a unique periodic solution of period T 0 which can be written in the form
(12)
providing that the matrix [Φ(t + T 0) — Φ(t)] is nonsingular, that is, the homogeneous equation (11) has no nontrivial periodic solution of period T 0.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B9780123956514500386
Periodically forced discontinuous systems
Michal Fečkan , Michal Pospíšil , in Poincaré-Andronov-Melnikov Analysis for Non-Smooth Systems, 2016
I.1.4 Nonlinear planar applications
Here we consider the following piecewise-nonlinear planar problem
(I.1.30) ε
with assumptions
(I.1.31)
Note the dependence on ε in the notation (I.1.30) ε . Hence (I.1.30)0 refers to the unperturbed system.
Due to linearity, the first part of (I.1.30)0 can be easily solved, e.g. via a matrix exponential. For the starting point and t ∈ [0, t 1], the solution is
(I.1.32)
Time t 1 of the first intersection with discontinuity boundary and the point (x 1, y 1) of this intersection are obtained from the relations h(γ 1(t 1)) = 0 for h(x, y) = y and (x 1, y 1) = γ 1(t 1), respectively:
After transformation x = r cos θ, y + δ = r sin θ in the second part of (I.1.30)0 , we get
from which one can see that the second part of (I.1.30)0 possesses a stable limit cycle/circle with the center at (0, −δ) and radius , which intersects boundary Ω0. Now it is obvious that (x 1, y 1) is a point of this cycle and the direction of rotation remains the same as in . Therefore γ 2(t) is a part of the circle, given by
(I.1.33)
for t ∈ [t 1, t 2], where . Equation h(γ 2(t 2)) = 0 together with the symmetry of γ 2(t) give the couple of equations
From these we obtain
Point (x 2, y 2) is the second intersection point of the limit cycle and Ω0, i.e.
Next, solution γ(t) continues in Ω+ following the solution of the first part of (I.1.30)0 . Thus we have
(I.1.34)
for t ∈ [t 2, T]. Period T obtained from the identity γ 3(T) = (x 0, y 0) is
The next theorem is due to Diliberto (cf. [15–17 ]), and we shall use it to find the fundamental matrix solution of the variational equation.
Theorem I.1.10
Let γ(t) be a solution of the differential equation , . If γ(0) = p, f(p) ≠ 0 then the variational equation along γ(t),
has the fundamental matrix solution Φ(t) satisfying det Φ(0) = ‖f(p)‖2, given by
where [λ 1, λ 2] stands for a matrix with columns λ 1 and λ 2, and
Lemma I.1.11
Assuming (I.1.31), unperturbed system (I.1.30)0 has fundamental matrices X 1, X 2 and X 3 satisfying (I.1.14), (I.1.15) and (I.1.17), respectively, given by
where
and saltation matrices
defined by (I.1.16), (I.1.20), respectively.
Proof
Matrices X 1(t) and X 3(t) are derived easily because of the linearity of function f +(x, y). Using
(I.1.35)
saltation matrices are obtained directly from their definitions. Since (I.1.30)0 is 2-dimensional and one solution of the second part is already known – the limit cycle, we can apply Theorem I.1.10 to derive the fundamental solution of this part. So we get a matrix
such that
and . If X 2(t) has to satisfy (I.1.15), then clearly .
Now, we can verify the basic assumptions.
Proposition I.1.12
Assuming (I.1.31), unperturbed system (I.1.30)0 has a T-periodic solution with initial point , defined by (I.1.2) with branches γ 1(t), γ 2(t) and γ 3(t) given by (I.1.32), (I.1.33) and (I.1.34), respectively. Moreover, conditions H1), H2) and H3) are satisfied.
Proof
Condition H1) was already verified. Since ∇h(x, y) = (0, 1) for all and (I.1.35) holds, also condition H2) is fulfilled.
Now suppose that dim . We recall that . Since is linear, there is a vector
such that . Then we can write . Using formula (I.1.18) for we look for the image of under the mapping . We subsequently obtain
where and are values of W and at t = t 2,
and finally
Since , it is obvious that if and only if . Hence the verification of condition H3) is finished.
Because, in general, the formula for A(t) is rather awkward, we move to examples with concrete parameters.
Example I.1.13
Consider system (I.1.30)ε with
(I.1.36)
Then we have ω 3 = 3, T = 2π, initial point , saltation matrices
and
Therefore and .
After some algebra we obtain
for M(α) = Mω (α) of (I.1.26), where
(I.1.37)
For ω > 0, ω ≠ 1, M(α) has a simple root if and only if (ωA + B)2 + (ωC + D)2 > 0. Since A and C are 8-periodic functions,
and according to Figure I.1.2, we have the estimate
and one can see that for ω ≥ 17, the T-periodic orbit in the perturbed system (I.1.30) ε persists for all ε ≠ 0 small. It can be proved numerically (see Figure I.1.2) that
(I.1.38)
for ω ∈ (0, 17). We conclude:
Corollary I.1.14
Consider (I.1.30) ε with parameters (I.1.36). Then 2π-periodic orbit persists for all ω > 0 and ε ≠ 0 small.
Example I.1.15
Consider system (I.1.30) ε with
(I.1.39)
Consequently, the Poincaré-Andronov-Melnikov function of (I.1.26) is
where A, B, C, D are given by (I.1.37) and
Function M(α) possesses a simple root if and only if
(I.1.40)
Applying Theorem I.1.6 we obtain the next result.
Corollary I.1.16
Consider (I.1.30) ε with parameters (I.1.39). If μ 1, μ 2 and ω satisfy (I.1.40), then the 2π-periodic orbit persists for ε ≠ 0 small.
Remark I.1.17
Inequality (I.1.40) means that if the periodic perturbation is sufficiently large (with respect to the non-periodic part of the perturbation), then the T-periodic trajectory persists. Note that the right-hand side of (I.1.40) can be estimated from above by
for appropriate constants c 1, c 2, c 3, which tends to 0, if ω tends to +∞. Hence the bigger frequency ω, the bigger |μ 1| is needed for fixed μ 2 ≠ 0 for persistence of the T-periodic orbit after Theorem I.1.6.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B9780128042946500035
Exponential integrators for coupled self-adjoint non-autonomous partial differential systems
Enrique Ponsoda , Sergio Blanes , in Applied Mathematics and Computation, 2014
3.2 The non-autonomous case
Suppose we are interested in approximating the solution of (3) on a time mesh, i.e. for and . This requires to compute numerical approximations to
This can be achieved by solving numerically the following matrix equations
, and where are the approximate solutions from the previous step.
To solve numerically this problem using standard methods, requires to apply the integrator repeatedly for each value of l and n. In general, the computational cost increases considerably with n, and what is even worst, the error also grows considerably with n and can make the numerical series expansion divergent. We will propose an algorithm which circumvent these two main troubles.
Let us now consider the IVPs (6) and (7), where is given by (8). If denotes the fundamental matrix solution of the homogeneous matrix equation
then, the solution of the homogeneous Eqs. (6),(7) can be written in the form
Note that the dependence on n is given by because the initial conditions, and , remain the same for all .
If we denote by , the values of , at a mesh , with , and , then
At this point it is convenient to analyze the structure of the fundamental matrix solution. It is easy to prove that, for this problem, the matrix, , takes the form
where are -valued functions bounded by a constant which does not depend of n, and in the limit (or ).
Then, for the integration over a finite time interval, , with , we have that
where are -valued functions which can also be bounded by functions depending on , but not on n. As a result, standard explicit methods like explicit Runge–Kutta methods are not appropriate for solving this problem because for a fixed value of h, the numerical solution grows polynomially with n and the series solution will not converge so, one has to use implicit methods.
The matrices for , have to be numerically approximated, and this can lead to exceedingly costly algorithms. If we take the same time step, h, for all values of n, the matrices need to be computed only once on each interval (if the same quadrature rule is used for all values of n), i.e. the same values , can be used for all . However, as we will see, the performance of most standard methods rapidly deteriorate with n. In addition, implicit methods usually need to compute the inverse of a matrix (the problem is linear) and the algorithm has to repeat this computation times.
In the following, we show that some exponential methods have many advantages for the numerical integration of this problem. The exponential methods we consider in this work are explicit methods, but closely related to implicit methods for linear problems [6]. They show a better performance for large values of n (they converge to the exact solution in the limit when are constant) and there is a recursive algorithm which allows to compute all matrices from .
Read full article
URL:
https://www.sciencedirect.com/science/article/pii/S0096300314007152
Find a Fundamental Matrix Solution and Transition Matrix
Source: https://www.sciencedirect.com/topics/mathematics/fundamental-matrix-solution