- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 645345, 11 pages
Dynamics of Numerics of Nonautonomous Equations with Periodic Solutions: Introducing the Numerical Floquet Theory
Department of Mathematics, University of Johannesburg, P.O. Box 17011, Doornfontein 2028, South Africa
Received 22 September 2012; Revised 2 March 2013; Accepted 26 March 2013
Academic Editor: Alberto Cabada
Copyright © 2013 Melusi Khumalo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Nonautonomous systems with periodic solutions are encountered frequently in applications. In this paper, we will consider simple systems whose solutions are periodic with a known period. Their transformation under linearized collocation methods is investigated, using a technique called stroboscopic sampling, a discrete version of the well-known Poincaré map. It is shown that there is an inextricable relationship between AN stability (or BN stability) of the numerical methods and the correct qualitative behaviour of solutions.
Let where , be a scalar ordinary differential equation in which is a periodic function of with prime period .
The detailed dynamics of numerics for nonautonomous ODEs has notably been lacking. Although any nonautonomous ODE can be transformed to an autonomous one, thereby increasing the dimension by one, the familiar dynamics of autonomous equations which is centered around the notion of equilibrium points  is lost. In certain special cases, this notion is replaced by that of periodicity. It is on these special cases that we will focus our attention. Stuart  proved using the bifurcation theory that for reaction-diffusion-convection equations, linearized instability implies the existence of spurious periodic solutions. Our approach differs from that of Stuart, who considered partial differential equations. Nonautonomous ODEs where is periodic in are very common in applications such as population dynamics with seasonal parameters or periodically forced systems.
Under certain conditions on , (1) has a unique -periodic solution . We will assume that the solution is approximated by a linearized one-point collocation method as in Foster and Khumalo . Our objective is to determine, for each under consideration, whether the numerical scheme has the same dynamical behaviour as the differential equation. In particular, we will consider cases in which the ODE has a unique, asymptotically stable periodic solution and establish conditions under which the numerical methods have the same dynamics. These special cases will take the following form:(i)linear: , where and are -periodic functions of ,(ii) nonlinear: , where is a nonlinear function of .
The linearized one-point collocation methods for the scalar nonautonomous equation (1) are given by where .
For a discussion of collocation methods in general, see Hairer et al. .
We begin with a description of the dynamical systems theory approach, which will be used in determining the conditions under which the methods have the same dynamical behaviour as the differential equations. Upon establishing these conditions, we compare them with those imposed by nonautonomous stability theory.
1.1. Dynamical Systems Approach
In what follows, we will use a technique known as stroboscopic sampling to reduce the problem of determining existence and stability of periodic solutions to existence and stability of fixed points.
Let be the discrete system representing the numerical method, applied with fixed stepsize, to the nonautonomous differential equation.
Step 1. Using inductive arguments, write the method in the form .
Step 2. Choose such that the period . Then, , and then we establish the new discrete system . This is known as stroboscopic sampling.
Step 3. The fixed points of the last system correspond to -periodic solutions of the method. These are determined with their stability types.
2. Linear Case
Suppose that , where and are -periodic functions of . Then, the linear nonautonomous differential equation (1) becomes If , then (4) has a unique -periodic asymptotically stable solution. If , then (4) has a unique -periodic solution that is asymptotically stable if (Hale and Koçak, ).
Now, the linearized one-point collocation methods are given by
2.1. Linear Case with
Theorem 1. Suppose that a linearized one-point collocation method is used to solve the linear nonautonomous differential equation (4) with . The method tends (as , fixed) to a periodic solution for any starting value if and only if where for each .
Proof. Assume that . Taking in (5), we obtain
so that for a given value of ,
Fix such that . Consider the th iterate of under : and the related iteration, which corresponds to stroboscopic sampling where . If the summation on the right-hand side of (12) is zero, then the discrete system is fixed at for all , which corresponds to a periodic solution. If it is nonzero, then the stroboscopic iteration has no fixed point and diverges.
Remark 2. The second term on the right-hand side of (12) can be viewed as an application of the left rectangular quadrature rule to the integral
and (12) can be written as the simple map
The above theorem can then be restated as follows. Suppose that a linearized one-point collocation method is used to solve the linear nonautonomous differential equation (4) with . The method tends (as , fixed) to a periodic solution for any starting value if and only if the rectangular quadrature rule, used to approximate the integral in (13), gives a zero.
Illustration. We examine the stroboscopic sampling of the numerical solution of the differential equation , . Figure 1 shows the numerical results for , , and with . For , the method diverges quicker from the periodic solution than for . For , the divergence is negligible.
2.2. Linear Case with
If is a negative constant, (4) could be scaled in such a way that . Then, clearly, , and the differential equation has a unique, asymptotically stable periodic solution.
Theorem 3. Suppose that a linearized one-point collocation method is used to solve the linear nonautonomous differential equation (4) with . Then, for fixed and , the method admits a unique periodic solution that is asymptotically stable, provided
Proof. If , (5) simplifies to
Proceeding in a manner analogous to the above, we can show by induction that
where each is defined by (8).
Denoting the right-hand side of (19) by , we can perform stroboscopic sampling and consider and the associated map Equation (21) is just the linear map with The map has a single fixed point, which is asymptotically stable if and only if ; that is, and the result is established.
The following results are simple consequences of the above theorem.
Corollary 4. The linearized one-point collocation method with any applied to the linear nonautonomous differential equation with admits a unique periodic solution that is asymptotically stable for all .
Corollary 5. The explicit Euler method for the linear nonautonomous differential equation with admits a unique, asymptotically stable periodic solution if and only if .
We now attempt to bound . The following lemma gives a bound on the solution of (4).
Lemma 6. Let be a -periodic function of , and assume that (4) with has a unique -periodic solution. There exist a number such that , and the -periodic solution, , satisfies for .
Proof. The boundedness of and follows from the periodicity and continuity of both functions.
Let be a periodic solution of (4) with . Then, satisfies the inequality This implies that see . Thus, is bounded for ; therefore, it approaches a -periodic solution . Taking in (28) establishes the lemma.
From the above lemma, we have . Then, we have the following theorem.
Theorem 7. Let , given by (24), denote the fixed point generated by the stroboscopic sampling of the numerical solution of the linear nonautonomous differential equation with by a linearized one-point collocation method. Then, the inequality holds.
Proof. Since is continuous, there is a number such that , for all . Then, for large , the solution , and hence .
Hence, has essentially the same bound as the periodic solution.
Example 8. Consider the linear nonautonomous equation which has solution . Figure 2 shows the numerical results (stroboscopic sampling) of the linearized implicit midpoint method () with and . Figure 3 shows the results of the explicit Euler method () with and . In these experiments, ; hence, the convergence to a unique periodic solution is expected for .
2.3. Linear Case with
Let where is a constant and is a -periodic function of . We assume that so that (4) has a unique asymptotically stable periodic solution.
2.3.1. Linearized One-Point Collocation Methods
We establish conditions under which a one-point collocation method with fixed and step-size exhibits the same dynamical behaviour as the nonautonomous linear differential equation with .
Notation. In what follows, we will denote , , , and . Here, as before, ().
Theorem 9. Suppose that a linearized one-point collocation method is used to solve a linear nonautonomous differential equation with . Then, for fixed and , the method will admit a unique periodic solution that is asymptotically stable, provided
Proof. From (5), we deduce that the linearized collocation methods, applied to the nonautonomous linear ODE with given by (33), are
We can write the above as
Proceeding by induction, we establish that from which we deduce that
The discrete system that corresponds to stroboscopic sampling is the linear system where This system has a unique fixed point, , given by (24). It is asymptotically stable if and only if ; that is, , or
Substituting gives the result.
For each of the three special values of , , and the increasing values of , we determined, using (42), the minimum value of such that each method has dynamical behaviour that is the same as that of the differential equation. The results are illustrated in Figure 4.
For , the explicit Euler method is the most restrictive of the three (i.e., comparatively larger minimum values of must be used to obtain dynamical behaviour that is the same as that of the differential equation). However, as is increased, the Explicit Euler method outperforms the linearized implicit Euler method by becoming less restrictive than that method for . For , the explicit Euler and linearized midpoint methods give comparable results, and for those values of , the linearized implicit Euler method becomes more and more restrictive in comparison to the other two.
Finally, we develop a bound on . For the comparison purposes, we present the following lemma, which can be proved in a manner analogous to Lemma 6.
Lemma 10. Let , be -periodic functions of . There exist numbers , such that , , , , and the solution satisfies as .
From the lemma, we have .
Theorem 11. Let , given by (24), be the fixed point generated by the stroboscopic sampling of the numerical solution of the linear nonautonomous differential equation with by a linearized collocation method. Then, the following inequality holds:
Proof. Since and are and periodic, there are numbers , such that , and , for all .
For each , where . If then
On the other hand, we deduce from the definition of that Hence, which is identical to the inequality (44).
We would like to obtain a relationship between the dynamical approach study and stability analysis. We introduce a natural stability criterion for the differential equation as well as any numerical method used to discretize it.
2.4. Conditional AN Stability and AN Stability
We consider the problem of determining a criterion for some sort of “controlled behaviour” of the solutions of the methods. We adopt a linear stability criterion that is based on the scalar test equation where . If Re for all , then for all and .
Definition 12. A numerical method is said to be conditionally AN stable for some if, when applied to the test equation (50) with Re, for all ,
holds for all .
If this condition is satisfied for all , then the method is AN stable.
The following simple result gives a condition under which the linearized one-point collocation methods are conditionally AN stable.
Theorem 13. Assuming real , the linearized one-point collocation methods are conditionally AN stable if and only if and .
Proof. Use the above test equation in (2). On the other hand, if (2) is not satisfied, the method fails the stability criterion and is not AN stable.
Examples:(1)if , then the linearized one-point collocation methods are conditionally AN stable if and only if It is easy to observe that the methods are AN stable if ,(2)if , where , , and , then the linearized one-point collocation methods are conditionally AN stable if and only if
We have proved the existence of a relationship between the linear stability theory of the collocation methods and the existence and asymptotic stability of periodic solutions, identified via stroboscopic sampling. This relationship is stated in the following theorem.
Theorem 14. Suppose that a linearized one-point collocation method is used to solve a linear nonautonomous equation of the form discussed in Sections 2.2 or 2.3 which has periodic coefficients and possesses a unique, asymptotically stable periodic solution. Then, the following conditions are equivalent:(a)the method is AN stable,(b)the method yields the same dynamics as the differential equation.
The last theorem is very significant, since it gives us a bridge connecting standard stability theory with dynamical systems. Naturally, we would like to find out if there is a corresponding result for the nonlinear case, which we now consider.
3. Nonlinear Case
We consider the nonlinear equation, where is a -periodic function of and is a nonlinear function of .
Massera  proved that if a nonlinear equation of the form (56) has the uniqueness property with respect to the initial conditions, the existence of a bounded solution implies the existence of a -periodic solution.
3.1. Linearized One-Point Collocation Methods
The linearized collocation methods, applied to (56), are given by where and .
We perform a simplification on the third term of (57) that takes the form of evaluating the derivative of at the starting value, instead, at each step. The resulting method, that will be referred to as a simplified linearized one-point collocation method, is where
3.2. The Dynamical Systems Approach
We rewrite (58) as Inductively, we can show that
We choose an integer such that . Sampling stroboscopically in the iteration above, we get and associate this with the discrete system where
The theorem below gives conditions under which the simplified linearized one-point collocation methods, applied to (56), exhibit dynamical behaviour that is the same as the differential equation.
Theorem 15. Assume that the differential equation (56) has a unique solution. If(i),(ii) for all ,(iii),(iv) for all , where is given by (67),
then a simplified one-point collocation method has a periodic solution for any ; this solution is unique and asymptotically stable.
Proof. Finding possible fixed points of (63), hence periodic solutions of the methods, is the same as finding zeros of (67). This is equivalent to solving the nonlinear system:
The above system is of the form , where is a nonlinear function of
To prove existence, it is sufficient to show that the Jacobian matrix, J(), of is nonsingular. Now, where for each . We perform one elementary row operation: row 1 row 1–row . The matrix becomes It is easy to see that the above matrix is nonsingular.
To prove uniqueness, let and be two fixed points of (63). Then, from (67), Subtracting (74) from (73) and using the mean value theorem gives which may alternatively be written as
In the above equations, is between and , and is between and .
From the hypotheses of the theorem, we have that , , , and . Thus, .
The periodic solution is asymptotically stable since . This completes the proof.
3.3. Numerical Experiments
Consider the nonlinear nonautonomous ODE
The methods give comparable results, but the implicit midpoint converges faster to the periodic solutions than the other two.
3.4. Nonlinear Stability Theory
We wish to establish conditions under which numerical methods for the solution of (56) behave in a “controlled” manner. We will view such controlled behaviour in the system meaning that neighbouring solution curves get closer and closer together as increases. This concept, called contractivity, is discussed, for instance, in Lambert . As in the linear case, we will contrast the conditions for stability with the existence and uniqueness of a periodic solution in the numerical methods.
We briefly state the concepts of contractivity and conditional BN stability.
Definition 16. Let and be any two solutions of the differential equation , satisfying initial conditions , , . Then, if holds under the norm for all , such that , the solutions of the system are said to be contractive in .
The discrete analog of the above definition is given below.
Definition 17. Let and be two numerical solutions generated by a numerical method with different starting values. Then, if the numerical solutions are said to be contractive for .
Definition 18. The system is dissipative in if holds for all , and for all .
It is easy to show that the solutions of a dissipative system are contractive under the norm induced by the inner product in (80). It is desirable that a numerical method, used with fixed stepsize to solve a dissipative system, gives contractive solutions. This brings us to the concepts of conditional BN stability, BN stability and nonlinear nonautonomous stability criteria.
Definition 19. If a numerical method, applied with fixed steplength to (56) satisfying (80), generates contractive solutions, the method is said to be conditionally BN stable. If the method generates contractive solutions when applied with any , then it it is BN stable (Lambert ).
The concepts of AN and BN stability are equivalent for the nonconfluent Runge-Kutta methods.
To determine the conditional BN stability of the methods, we use the scalar test system where, as before, and . This system is dissipative if where lies between and and is an inner product in . The condition is satisfied if for all and for all . Therefore, the existence and uniqueness of a periodic solution in (56) is a sufficient condition for the dissipativity of the system.
Now, we determine the conditions under which the linearized one-point collocation methods are conditionally BN stable. Applying the methods to the test system (81) for two different initial conditions gives
The solutions generated by the methods are contractive if and only if . Assuming for all and for all and , the methods are conditionally BN stable if and only if
We have, in Theorem 15, established sufficient conditions for the simplified linearized one-point collocation methods to exhibit the same dynamics as the nonlinear nonautonomous ODE. Conditions (i) and (ii) are required for conditional BN stability as well, but condition (iii) is not necessary for the existence of a unique, asymptotically stable solution. In fact, we can come to the same conclusion as in Theorem 15 if, in (75), for all and . The following theorem shows that condition (87) is satisfied if the method is conditionally BN stable.
Theorem 21. Suppose that a simplified linearized one-point collocation method is used to solve a nonlinear nonautonomous equation of the form (56) with periodic coefficients which has a unique, asymptotically stable periodic solution. Then, the method yields a unique periodic solution that is asymptotically stable if it is conditionally BN stable.
Proof. Assume the conditional BN stability. To prove the theorem, it is sufficient to establish condition (87). From conditional BN stability, we have . Recall that from condition (iv). Therefore, Since , if , If , This proves the theorem.
Remark 22. The above theorem is somewhat similar to Theorem 14 (in the linear case) if we replace the concept of conditional BN stability by conditional AN stability.
We already knew that numerical methods can introduce spurious behaviours into the solution for autonomous equations. By concentrating on linear and nonlinear nonautonomous equations with unique periodic solutions and discretizing them using one-point collocation methods, we were interested in the existence of periodic solutions in the numerical methods.
We found that the results obtained from the dynamical systems approach are closely linked to those that are imposed by standard stability analysis. It has been shown that for linear and nonlinear nonautonomous differential equations of the form considered in this chapter, there is a relationship between conditional AN or BN stability of a one-point collocation method and the method yielding the same dynamical behaviour as the differential equation under consideration.
- A. Iserles, “Stability and dynamics of numerical methods for nonlinear ordinary differential equations,” IMA Journal of Numerical Analysis, vol. 10, no. 1, pp. 1–30, 1990.
- A. Stuart, “Linear instability implies spurious periodic solutions,” IMA Journal of Numerical Analysis, vol. 9, no. 4, pp. 465–486, 1989.
- J. K. Hale and H. Koçak, Dynamics and Bifurcations, vol. 3, Springer, New York, NY, USA, 1991.
- A. Foster and M. Khumalo, “Transformation of local bifurcations under collocation methods,” Journal of the Korean Mathematical Society, vol. 48, no. 6, pp. 1101–1123, 2011.
- E. Hairer, S. P. Nørsett, and G. Wanner, Solving Ordinary Differential Equations. I, vol. 8, Springer, Berlin, Germany, 2nd edition, 1993.
- J. D. Lambert, Numerical Methods for Ordinary Differential Systems, John Wiley & Sons, New York, NY, USA, 1991.
- A. M. Stuart and A. R. Humphries, Dynamical Systems and Numerical Analysis, vol. 2, Cambridge University Press, New York, NY, USA, 1996.
- J. L. Massera, “The existence of periodic solutions of systems of differential equations,” Duke Mathematical Journal, vol. 17, pp. 457–475, 1950.