Computational singular perturbation method for nonstandard slow-fast systems
Ian Lizarraga, Martin Wechselberger

TL;DR
This paper extends the computational singular perturbation (CSP) method to nonstandard slow-fast systems with normally hyperbolic attracting critical manifolds, providing new formulas and demonstrating its applicability on complex examples.
Contribution
It adapts the CSP method to nonstandard systems, offering new formulas and the first concrete demonstrations on genuinely nonstandard examples.
Findings
Successfully extended CSP to nonstandard systems
Derived new formulas for the adapted CSP method
Demonstrated applicability on complex nonstandard examples
Abstract
The computational singular perturbation (CSP) method is an algorithm which iteratively approximates slow manifolds and fast fibers in multiple-timescale dynamical systems. Since its inception due to Lam and Goussis, the convergence of the CSP method has been explored in depth; however, rigorous applications have been confined to the standard framework, where the separation between `slow' and `fast' variables is made explicit in the dynamical system. This paper adapts the CSP method to {\it nonstandard} slow-fast systems having a normally hyperbolic attracting critical manifold. We give new formulas for the CSP method in this more general context, and provide the first concrete demonstrations of the method on genuinely nonstandard examples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Computational singular perturbation method for nonstandard slow-fast systems
Ian Lizarraga111School of Mathematics and Statistics, The University of Sydney, Camperdown NSW 2006, Australia ([email protected]). This author acknowledges support from the ARC Discovery Project Grant DP180103022.
Martin Wechselberger222School of Mathematics and Statistics, The University of Sydney, Camperdown NSW 2006, Australia ([email protected]). This author acknowledges support from the ARC Discovery Project Grant DP180103022.
Abstract
The computational singular perturbation (CSP) method is an algorithm which iteratively approximates slow manifolds and fast fibers in multiple-timescale dynamical systems. Since its inception due to Lam and Goussis [17], the convergence of the CSP method has been explored in depth; however, rigorous applications have been confined to the standard framework, where the separation between ‘slow’ and ‘fast’ variables is made explicit in the dynamical system. This paper adapts the CSP method to nonstandard slow-fast systems having a normally hyperbolic attracting critical manifold. We give new formulas for the CSP method in this more general context, and provide the first concrete demonstrations of the method on genuinely nonstandard examples.
1 Introduction
Most systems in nature consist of processes that evolve on disparate timescales and the observed dynamics in such systems reflect these multiple timescale features as well. Mathematical models of such multiple timescale systems are considered singular perturbation problems with slow-fast (or two timescale) problems as the most common. Models of homogeneously mixed biochemical reactions such as substrate-enzyme or ligand-receptor kinetics are prime examples.
An interesting and pervasive feature of these biochemical reaction systems is the observed transition from transient fast kinetics to long-term slow kinetics, wherein the system settles onto a so-called quasi-steady state (QSS). Geometrically, this QSS is perceived as a lower dimensional slow manifold. Identifying such an attracting lower dimensional slow manifold provides the means to reduce the dimension of biochemical reaction systems. Such QSS reduction techniques are frequently employed in the biochemical literature with Michaelis-Menten-type laws as prime examples; see e.g. [12].
The mathematical foundation to justify such a QSS reduction is given by Tikhonov’s [27] respectively Fenichel’s [4] work on normally hyperbolic attracting slow manifolds in singular perturbation problems. Goeke, Noethen and Walcher [22, 6] provide a comprehensive discussion on the general setup of Fenichel’s geometric singular perturbation theory (GSPT) with an emphasis on explaining when a QSS reduction is justified or when it leads to erroneous results.
Schauer and Heinrich [25] explored a homotopy approach to find QSS approximations in biochemical reaction networks, by formulating a perturbation problem in terms of a small parameter amplifying the ratio of magnitudes of slow and fast reaction rates.111We note that a small perturbation parameter could be properly identified via dimensional analysis. After using stoichiometry to derive the dynamical system from the network, the fast reactions are grouped into a vector , and slow into a vector :
[TABLE]
with state vector , and are constant stoichiometric matrices with full column rank , and is the homotopy parameter. With this splitting, a -dimensional manifold of stationary states (QSS), , can be identified in the singular limit ,
[TABLE]
We emphasize here that the slow-fast splitting (1) is nonstandard from the point of view of GSPT in the sense that slow-fast reactions are distinguished rather than slow-fast variables. Nevertheless, the theory of Fenichel [4] still applies: under the appropriate geometric condition (see Section 2 for details), an invariant slow manifold perturbs from for sufficiently small .
As a motivating example, consider the following four-dimensional slime mold cell communication model [5]:
[TABLE]
Here, refers to the concentration of cAMP; and represent transmembrane receptors; and refers to the bound state of . The parameters are constant reaction rates, the parameter represents a conserved quantity that arises from the model reduction of the original five-dimensional model due to Stiefenhofer [26], and the parameter denotes the concentration of ATP which is assumed to be constant. This system contains a two-dimensional manifold of equilibria given as a graph
[TABLE]
with
[TABLE]
When is sufficiently small, numerical observations reveal the decay of fast transient motion as trajectories are attracted to a low-dimensional invariant set near , as shown in Figure 1. Our objective is to approximate such invariant sets arbitrarily well.
Several algorithmic & computational techniques have been developed to identify these QSS (i.e. a lower dimensional slow manifold), and to identify the simplified system underlying long-term stability. Lam and Goussis [17, 18] devised the computational singular perturbation (CSP) method for chemical kinetics modelling which is an iterative procedure that generates a sequence of CSP manifolds and CSP fibers which approximate the slow manifolds and fast fibers of the dynamical system; see Section 3 for details. The convergence of these CSP objects has been analyzed by Kaper, Kaper, and Zagaris in a series of papers [30, 31, 32, 11]. They rigorously prove this convergence in the case of slow-fast vector fields satisfying a spectral gap condition for the eigenvalues of the Jacobian of the vector field along an attracting invariant manifold, but focus on examples in the standard form. Indeed, the practical applicability of the CSP method has remained unclear in the case where we cannot easily identify the slow or fast components of the vector field a priori. Lam and Goussis [18] give an example of CSP applied to a linearized problem by populating the initial conditions with (constant) eigenvectors, but pointed out the necessity of a modification for more difficult nonlinear problems where the Jacobian of the vector field is point-dependent.
Our approach is to avoid this defect for nonstandard slow-fast systems of the form
[TABLE]
which includes system (3). The idea is that the singular limit vector field factorization of (6), i.e. the vector field , encodes a wealth of geometric information. We will make explicit use of this factorization to provide formulas for a nonstandard version of the CSP method.
Although this paper is concerned with the CSP method, there are in fact a variety of iterative schemes to approximate invariant manifolds; the zero-derivative principle (ZDP), intrinsic low-dimensional manifolds (ILDM), and center manifold normal-form reductions [24] are among a few of these (chapter 11 in [15] give an overview of the first three methods). Many of these schemes are interconnected; for instance, the CSP and ZDP iterations differ only by a multiplicative factor [32].
The paper is organised as follows: In Sec. 2, we describe a general framework for nonstandard slow-fast systems. In Sec. 3 we define the two-step CSP update. Our main results are provided in Secs. 4 and 5: we give specific formulas for initializing the CSP method in the nonstandard context, study the output of the first update carefully, and then give examples demonstrating these formulas. We conclude in Sec. 6 by highlighting some fruitful new connections between the CSP method and the factorization given in the second section. We also provide an appendix (App. A), which expands on the framework underlying the CSP update step.
2 Nonstandard slow-fast dynamical systems
We begin by giving an abbreviated treatment of a general framework for nonstandard slow-fast systems. Much of this material in fact appears in Fenichel’s seminal work on GSPT [4]; see also [22, 6]. This approach has been further developed by Wechselberger [28] and extends the framework to loss of normal hyperbolicity.
We are interested in two-timescale (or slow-fast) dynamical systems of the form (6), which we restate here for convenience:
[TABLE]
with state variable , matrix formed by column vectors with sufficiently smooth functions , , a column vector of sufficiently smooth functions , , a column vector of sufficiently smooth functions , , and characterizes the ratio of timescales in the system.
Definition 2.1
*Let denote the set of equilibria of system (7) in the singular limit . If there exists a subset which forms a -dimensional differentiable manifold of equilibria with , then system (7) defines a singular perturbation problem.
Assumption 2.1
System (7) is a singular perturbation problem with a single subset ,
[TABLE]
*which forms a -dimensional differentiable manifold of equilibria, , called the critical manifold.
Assumption 2.2
*In system (7), the matrix has full (column) rank for all .
Next consider system (7), rescaled from the fast timescale to the slow timescale :
[TABLE]
Systems (7) and (9) are equivalent when but their singular limits are not. In fact, they carry complementary, lower dimensional information, and it is a cornerstone of GSPT to concatenate the information from these two limiting problems to deduce the dynamics of the full system (7) respectively (9).
2.1 The layer problem
We focus first on system (7) evolving on the fast time scale .
Definition 2.2
The layer problem of system (7) is given by the formal limit :
[TABLE]
Under Assumption 2.1, the set forms a -dimensional manifold of equilibria of the layer problem. Hence, the Jacobian along has trivial zero eigenvalues and nontrivial eigenvalues.
Definition 2.3
*A -dimensional critical manifold is called normally hyperbolic if the nontrivial eigenvalues of the Jacobian are bounded away from the imaginary axis.
The existence of a normally hyperbolic manifold implies the following splitting:
[TABLE]
where denotes the tangent space of the critical manifold at , coinciding with the kernel of the linear map , and is the unique complement of the splitting identified with the quotient space . We call the linear fast fiber with basepoint . Repeating this construction across all points of , we obtain the tangent bundle of , and the transverse linear fast fiber bundle . This splitting induces unique projection operators onto the tangent bundle and the linear fast fibre bundle as follows:
[TABLE]
Lemma 1
*At any point of a normally hyperbolic manifold , the rows of form a basis of and the columns of form a basis of .
Proof. The manifold is the zero level set of which forms a -dimensional manifold, i.e. has full row rank for any . Thus the rows of form a basis of the orthogonal complement of .
Since is normally hyperbolic, we have has rank which implies at points . Under Assumption 2.2, has full column rank . Thus the column spaces of and coincide at points and, hence, the columns of form a basis of .
Lemma 2
*Let be a normally hyperbolic manifold. Then the square matrix is regular, and its eigenvalues are equal to the set of nontrivial eigenvalues of .
Proof. Let the linear operator act on the basis of the invariant subset , i.e.
[TABLE]
By Lemma 1, the square matrix is necessarily a regular matrix with nonzero eigenvalues which coincide with the nontrivial eigenvalues of . Note, if is an eigenvector of with eigenvalue then is the corresponding eigenvector of with the same eigenvalue.
Assumption 2.3
*The -dimensional critical manifold of system (7) is normally hyperbolic and attracting, i.e. all nontrivial eigenvalues have negative real part.
Remark 1
System (3) satisfies Assumptions 2.1–2.3. A rich source of examples comes from chemical reaction networks; Schauer and Heinrich [25] provide a derivation of such models with the goal of identifying quasi-steady state approximations in biochemical reaction networks.
*Nevertheless, it is unclear whether general techniques exist to compute such factorizations in a typical slow-fast system. In the case of polynomial vector fields, Goeke and Walcher [6] have used division algorithms for algebraic varieties to factor .
Remark 2
*In this paper we do not concern ourselves with singularities of outside of the critical manifold ; we only require the local geometric structure provided by the differentiable manifold and transverse fibers in the proceeding arguments. A simple example of a system having an isolated singularity as well as a critical manifold is given in Sec. 5.1.
2.2 The reduced problem
Now consider system (9) evolving on the slow timescale . The singular limit of system (9) requires more care, i.e. this limit will only be well-defined provided that we restrict the phase space to and that is restricted to the tangent bundle . The projection operator (12) allows us to formulate this limit.
Definition 2.4
The reduced problem of system (9) is
[TABLE]
Definition 2.5
Consider the splitting , where has dimension and has dimension . The oblique projection of a vector , and , onto the subspace parallel to is a linear map satisfying .
Suppose (resp. ) is an matrix whose column vectors span (resp. ). Then it can be shown that has the following matrix representation:
[TABLE]
The (complementary) oblique projection onto the subspace parallel to is given by
[TABLE]
In the present context, the splitting induces an oblique projection onto the tangent bundle of the critical manifold, parallel to the fast fibers (see Fig. 2). Lemma 1 gives us a matrix representation using the matrices and :
[TABLE]
By Lemma 2, the matrix is regular and, hence, the inverse is well defined. Equivalent projection formulas appear in [4] and [6].
Remark 3
It is easily shown that standard singular perturbation problems are a special case of a nonstandard problem (7). Indeed, select
[TABLE]
and describe the variables and vector field in terms of components and . Then gives
[TABLE]
which is a standard singular perturbation problem. From (19) we observe that lists the slow variables and lists the fast variables. These systems lie in contrast to the nonstandard case, where one cannot expect such a trivial factorization (18) to exist globally.
2.3 Fenichel Theory
In the case of normally hyperbolic critical manifolds, QSS reductions onto a slow invariant manifold are justified by the following theorem.
Theorem 1** (Fenichel’s Theorem [4, 10, 15])**
Given the system (7) with a -smooth vector field and a compact normally hyperbolic critical manifold, the following hold for sufficiently small:
- •
There exists a locally invariant -smooth, normally hyperbolic slow manifold that is -close to .
- •
The flow on converges to the reduced flow on as .
- •
There are -smooth locally invariant stable and unstable manifolds, and .
- •
These manifolds admit nonlinear, -smooth foliations resp. . Furthermore, these families are positively (resp. negatively) invariant on fibers; i.e. if is the time-* flow map of (7) and if , then*
[TABLE]
An analogous statement holds for the fibers , with .
- •
There exist constants such that if , then for we have
[TABLE]
Analogous rate estimates hold for the fibers , with .
The invariant slow manifold and its invariant nonlinear foliation (which split into the sub-foliations given in the theorem above) organise the dynamics of the full system: trajectories perturb from concatenated orbits of the layer and reduced problems under the appropriate transversality conditions. In analogy to the setting, we denote the linear fast fiber at basepoint by and the linear fast fiber bundle by .
3 The CSP iteration
Suppose that the invariant slow manifold of a nonstandard slow-fast system (7) is (locally) given by the graph of a function with . We express as an asymptotic series in :
[TABLE]
The terms may be obtained reinserting this series into (7) and matching coefficients in orders of . The CSP method adopts a different, iterative approach to efficiently compute not only the terms , but also a similar asymptotic approximation to the linear fast fibers transverse to the slow manifold. The motivating idea is to understand how the variational equation of a dynamical system is affected by changes in basis.
3.1 Geometric framework of the CSP method
Consider a smooth vector field , to which we append the variational equation to produce the dynamical system on the tangent bundle:
[TABLE]
Under some arbitrarily chosen splitting , where and , we can write the variational equation in block component form:
[TABLE]
Now suppose is a smooth, regular matrix for all with its dual. Here, the first and second block columns of , denoted and , are of sizes and , respectively; similarly, the first and second block rows and have sizes and , respectively. The vector field expressed in this new basis is given by
[TABLE]
Definition 3.1
For a smooth matrix function and a smooth vector field , is denoted the Lie bracket of and and defined as the matrix whose th column is
[TABLE]
*where and refers to the th column of .
It can be shown that the variational equation of the transformed vector field can be written compactly in the form
[TABLE]
where the nonlinear operator has the algebraic structure of a Lie bracket:
[TABLE]
see the appendix (Sec. A.1) for a derivation of this result. The operator can be written in block-component form:
[TABLE]
The key insight is that in the presence of a -dimensional invariant manifold and corresponding transverse linear fiber bundle , the vector field may be expressed in a clever choice of basis and dual which block-diagonalizes . As a consequence, the invariant manifold and the linear fiber bundle are easily characterized in terms of this basis as follows:
[TABLE]
see the appendix (Sec. A.2) for details. This formalism applies directly to the case of an invariant slow manifold and its accompanying linear fast fiber bundle , as defined by Fenichel’s theorem (Sec. 2.3). The characterizations (27)–(28) then state that is defined by the locus of points where the components of the vector field lying in the direction of the linear fast fibers vanish, and that the linear fast fibers at basepoints are spanned by the columns of the block component .
3.2 CSP objects
The CSP iteration acts on a suitably initialised (point-dependent) basis matrix and dual , producing a sequence of successively refined bases. We initialise with the pair
[TABLE]
The sequence in turn defines a sequence of updates to the operator:
[TABLE]
These approximate operators may be written in block components in analogy to (26). Motivated by the characterizations of the invariant manifold and fast fibers provided in Eqs. (27)–(28), we define the following approximating objects:
Definition 3.2
The CSP manifold of order [math] is the level set
[TABLE]
For integers , the CSP manifold of order , denoted , is
[TABLE]
*where is a graph of .
Definition 3.3
For and , the CSP fiber of order is the subspace
[TABLE]
The CSP fiber bundle of order is the corresponding vector bundle
[TABLE]
Remark 4
*The convergence of the CSP manifolds and fiber bundles to the invariant slow manifold and fast fiber bundle of system (7) depends on the choice of iteration step, as shown in Sec. 3.4.
3.3 One-step and two-step CSP updates
There are two commonly-used variants of the CSP iteration. We will only apply the two-step method in this paper, but it is instructive to introduce the simpler one-step method to clarify the relationship between these iterations and the CSP objects (32)–(33).
Both methods use near-identity transformations in the update step, i.e. multiplication by matrices of the form and , where is the identity matrix, and and are nilpotent matrices of the form
[TABLE]
The block components and , of respective sizes and , are defined by the constraint that the CPS manifolds and fibers converge asymptotically to the slow manifold and linear fast fibers; see Sec. 3.4. Near-identity update matrices are computationally easy to invert. In particular, we obtain efficient update rules for the dual basis , as shown in the following two methods.
3.3.1 One-step CSP method
The one-step CSP method is given by the iteration rule
[TABLE]
The one-step CSP method only updates ‘half’ of the basis. This update is sufficient if we are interested in computing only the CSP manifolds (32). If we wish to approximate the fast fibers to the invariant manifold in tandem, we must update the remaining blocks of the basis and dual basis matrices. This update is provided by the two-step CSP method.
3.3.2 Two-step CSP method
The two-step CSP method is given by the iteration rule
[TABLE]
3.4 Convergence
Suppose that after iterates of the CSP two-step method, the CSP manifold of order defined by (32) is locally expressed as a graph and then expanded as an asymptotic series in :
[TABLE]
When the update terms in the near-identity transformations (3.3.2) are defined appropriately, Kaper, Kaper, and Zagaris [30] demonstrated convergence of the CSP manifold to the invariant slow manifold of Fenichel’s theory (as described in Sec. 2.3), in the following sense.
Theorem 2** (Convergence of CSP manifolds [30])**
Suppose the leading-order term of the graph of , denoted , agrees with the graph of the critical manifold under a local choice of coordinates. Then using the one-step or two-step CSP update rule and for fixed, we have
[TABLE]
when is sufficiently small, where is the graph of with asymptotic series expansion (38) and is the asymptotic series expansion of the graph of .
This theorem states if the CSP two-step method is initialised appropriately, then for pairs of indices we have . This justifies the nomenclature ‘CSP manifold of order ’: the set agrees with up to order terms in the asymptotic expansion.
An analogous convergence statement can be given for the CSP fiber bundle (34):
Theorem 3** (Convergence of CSP fibers [31])**
Fix and let be given locally by the graph for and . Then given the basepoint on (resp. on ), the asymptotic expansions of and agree up to and including terms of . Thus, the CSP fast fiber bundle is an approximation to the fast fiber bundle .
Theorems 2–3 hold when the near-identity updates in (35) are defined as follows:
[TABLE]
With this choice of update step, the CSP two-step method simultaneously block-diagonalizes the CSP operator (as defined in (30)) in discrete steps as follows [31]:
Lemma 3
For , the CSP two-step method (3.3.2) provides the asymptotic estimates
[TABLE]
where is evaluated on .
4 Nonstandard CSP updates
We now describe the CSP update step for nonstandard slow-fast systems (7) satisfying Assumptions 2.1–2.3. The key is that bases for the fast and slow subspaces can be ‘read off’ using the factorization , providing a natural initial condition for the iteration. By Lemma 1, the columns of span the linear fast fiber with basepoint , and the columns of span . Thus,
[TABLE]
where the notation refers to a matrix whose columns form a basis to the subspace orthogonal to the column space of the matrix . We define
[TABLE]
where the matrix prefactors in both block rows (which are well-defined by Lemma 1) normalize the block diagonal components in the product to the identity, as required. With this initialization, the leading-order approximation of the CSP manifold defined in (31) can be computed:
[TABLE]
This level set implicitly defines the graph . On this graph, we expand both sides of this equation in powers of . The leading-order coefficient is
[TABLE]
which matches the definition of the critical manifold as the leading-order part of the asymptotic series of , ; thus, .
The four block components of the operator can be computed explicitly in terms of the components and in the vector field ; compare with (26):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The vector function is on by (42); therefore, the latter three block components are of at most as well. This in turn implies that the update blocks and defined in (39) are both on this set. After one application of the CSP two-step update (3.3.2), the updated bases and are
[TABLE]
Without writing out the update in detail, it suffices to note that the block components and each introduce perturbations of the initial block columns of (respectively block rows of ). The first fast fiber update is explored in greater detail using projection maps, in Sec. 6.1. Subsequent CSP iterations will result in higher-order perturbations.
The first update of the CSP manifold is defined as follows; see (32):
[TABLE]
In this equation and the following, we use the additional subscript ’[math]’ to refer to those quantities that are computed on points . We compute the order coefficient of the asymptotic series assuming the graph form where the leading order coefficient is defined by ; see (43):
[TABLE]
which gives
[TABLE]
This result matches a recent result due to Wechselberger [28] for the first-order correction of in the nonstandard case.
5 Examples
We now demonstrate the two-step CSP method in four nonstandard examples. Our list of systems increases in complexity: first we consider the case where the slow manifold is equal to the critical manifold and the fast fiber bundle remains unchanged. Second, we consider the case where the slow manifold is equal to the critical manifold but the fast fiber bundle perturbs from the case. Third, we consider a system where both the manifold and fiber updates are nontrivial. Finally, we consider the four-dimensional system (3) discussed in the introduction.
5.1 Trivial updates of the slow manifold and fast fibers
Consider the following two-dimensional nonstandard system:
[TABLE]
The critical manifold is a circle. The Jacobian evaluated along is
[TABLE]
with one trivial zero eigenvalue and one negative eigenvalue for all , implying that the critical manifold is attracting and normally hyperbolic. Thus, Assumptions 2.1–2.3 are satisfied. Note that the origin is an isolated singularity of , where , but we do not consider this singularity in the CSP iteration (see Remark 2).
When is small and positive, there is a clear separation between slow motion along versus fast motion toward . The dynamics is made obvious if we write the system in polar coordinates and plot a graph of representative trajectories (Fig. 3):
[TABLE]
The coordinate representation (55) decomposes the system into two independent ODEs. The invariant manifold , which is independent of , can be read off from the first equation of (55). Thus, . We can also determine that the (nonlinear) fast fiber bundle is foliated by the family of rays extending from the origin, with basepoints on the circle:
[TABLE]
Note that the nonlinear and linear fast fiber bundles coincide in this example: . The fast fiber bundle is invariant as a family: for , the fiber is mapped to under the time flow map. Furthermore, exponential contraction of the rays toward is governed by the equation . Compare these facts about the nonlinear fast fibers with Fenichel’s theorem, Sec. 2.3. This behavior is similarly independent of the value of .
We initialize the CSP two-step method using (40):
[TABLE]
We begin by computing the initial CSP manifold (see (31)). We compute
[TABLE]
and so
[TABLE]
We have
[TABLE]
With this information, the initial matrix (30) becomes
[TABLE]
Using (39), we find that and .
The triviality of the updates implies that the CSP manifolds and fibers ((32)–(33)) are
[TABLE]
for .
5.2 Trivial updates of the slow manifold; nontrivial updates of the fast fibers
We now consider a variant of the previous system, where we modify the first component of :
[TABLE]
We still have , and it is easy to check that this is also the invariant slow manifold for : for we have
[TABLE]
so that . Thus, as before. In this modified system, however, the linear fast fiber will not be orthogonal to at points .
The CSP step is initialized as usual with (40). The basis matrices are identical to (57)–(58) since we have not modified or . From (30), the initial operator is (compare (60))
[TABLE]
By definition (39), the update term is trivial since ; on the other hand, the update quantity may give a nontrivial first-order correction to the fast fiber. The first column (resp. first row) of the updated basis matrix (resp. ) are
[TABLE]
Applying the definitions (32)–(33), the updated CSP objects are
[TABLE]
Here, the function refers to a graph of containing the chosen basepoint . Graphs of the form can also be used.
5.3 Parabolic critical manifold
Given the system
[TABLE]
The critical manifold of the system is defined as the level set , which in this case can be solved globally for the graph . This critical manifold is globally attracting and normally hyperbolic—the Jacobian along has one trivial zero eigenvalue and another eigenvalue .
The CSP method is initialized with the following basis and dual as given in (40):
[TABLE]
The initial CSP manifold (31) written to order is
[TABLE]
Define the auxiliary function . The operator (as defined in (30)) computed to linear order is
[TABLE]
After one application of the two-step CSP method (3.3.2), we obtain the updated basis matrix
[TABLE]
and dual .
This gives us the first update of the CSP objects using the definitions (32)–(33):
[TABLE]
The update (30) is given by
[TABLE]
Observe that the off-diagonal elements are now 0 (modulo nonzero terms) while the diagonal terms are unchanged up to order . As we continue to apply the CSP algorithm, the off-diagonal elements can be made to vanish modulo arbitrarily high orders; see Lemma 3. The order we used in the initial basis matrix implies that the (1,1) term governs the fast dynamics and (2,2) term governs the slow dynamics in the decoupled system.
5.4 A four-dimensional system
Recall system (3):
[TABLE]
for parameters , together with the perturbation parameter . This system has the factorized form . Using (40), the initial bases are given by
[TABLE]
and the dual by , whose first two rows are given by the matrix .
As before, the leading-order term of the graph of (defined in (31)) will match the graph of :
[TABLE]
Applying the CSP manifold definition (32), we have
[TABLE]
where and the first-order correction can be factored as
[TABLE]
for the seven polynomials in , defined as follows:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The fast fiber update, which we do not write down, will be an correction to the first block of , in analogy to the previous examples.
Remark 5
*The tensorial nature of the update step only becomes apparent in systems with dimension higher than two. For example, to compute , we must compute the tensor . Such computations quickly become unwieldy for high-dimensional systems after the first or second CSP iterate.
Remark 6
Symbolic computations for these examples were performed using Mathematica Version 11.1.1.0 [29].
6 Conclusion
We have given a detailed treatment of the CSP method for nonstandard slow-fast systems (7), when the vector field admits a geometrically intuitive factorization in the leading-order term, and demonstrated the method explicitly for nontrivial examples. There appear to be several other natural connections between the CSP algorithm and this factorization, which we comment on further.
6.1 CSP as projection
There is a tantalizing connection between the CSP two-step update and the projection operators (12)–(13) which were naturally induced by the normally hyperbolic splitting. Consider the CSP fiber of order 1, , defined by (3.3.2). We have
[TABLE]
where the term can be written out explicitly by using the formulas (4) and (4) for the block components of in the update formula (39):
[TABLE]
where
[TABLE]
A careful comparison to the matrix representation of oblique projection (Definition 2.5) reveals that in fact to leading order, when we evaluate this expression on the set . Since on as shown in (42), the equation (70) becomes
[TABLE]
where the subscript 0 reminds the reader that these quantities are computed on , and the vector is rigorously defined by the two-step CSP rule (3.3.2). The CSP fiber is defined on its corresponding CSP manifold by Def. (33), but it is known that the fiber approximation is still -accurate if is evaluated on (see Sec. 3.5 in [31]).
In the examples 5.1 and 5.2, is an orthogonal projection onto , and furthermore the manifold is given by exactly. The computation (71) shows that the fast fiber update is trivial if . This is indeed the case in the first example 5.1 but not in the modification 5.2.
These results demonstrate the close relationship between the CSP update step and the projectors which define the fast and slow subsystems of (7). Deeper connections, including a recasting of the CSP method as a projective scheme in which the projections are themselves iteratively updated, remain to be further clarified.
6.2 CSP as a factorization algorithm for nonstandard vector fields
As discussed in Sec. 2, the leading-order factorization gives a compact description of the geometry of the system near the critical manifold when , and gives approximate information about the dynamics on the nearby slow manifold when . Consider the following conjecture.
Conjecture 1
Vector fields satisfying Assumptions 2.1–2.3 may be re-factorized as follows:
[TABLE]
The new objects , , and satisfy the following properties:
- •
(Slow manifold as a level set) .
- •
(Basis of fast fibers) The columns of span the linear fast fibers at basepoints .
- •
(Invariance) for .
The assertion is that a vector field factorization with respect to the critical manifold when will induce a new factorization with respect to the slow manifold when .
We describe a possible direction to answer this conjecture in the affirmative in the special case where (as in the examples 5.1 and 5.2). The idea is to use the CSP method to obtain iterative refinements of the objects , , and . Writing out the first few terms in the asymptotic series of the CSP fast fiber (see (33) and (3.3.2)), we have .
The vector field can be re-factorized as follows:
[TABLE]
where
[TABLE]
In comparison to the original factorization , this new factorization has -dependence in the ‘leading-order’ term , and a modified ‘remainder’ term . But observe that . Furthermore, the column space of the prefactor matrix is now an -approximation of the fast fibers. Finally, since is invariant by assumption.
We can extend this idea in the obvious way to refine the factorization to some arbitrary order :
[TABLE]
We remind the reader that the triviality of the level set update is a consequence of the assumption that . The general case where the CSP manifolds also update nontrivially is a topic of further study. Here, more care must be taken to write down the factorizations since the fiber basepoints are not fixed. Furthermore, nontrivial cross-terms of the form , where , begin to appear at a given iterate .
6.3 CSP for slow manifolds of saddle-type
Normally hyperbolic slow manifolds of saddle-type arise in traveling-wave profiles of the FitzHugh-Nagumo model [1], in the Hodgkin-Huxley model [8], and in models of cardiac pacemakers [14]. They are very challenging to numerically approximate even in the standard case, due to exponential instabilities in both forward and backward time [7]. It is therefore of interest to relax the assumption that the critical manifold be attracting for the CSP method.
Appendix A The formalism underlying the CSP method
The purpose of this section is to collect a few results given across the three very detailed papers [30, 31, 11].
A.1 Change of variables and Lie bracket
In this section, we justify the statement that the variational equation of the transformed vector field has the structure of a Lie bracket as shown in (24)–(25). Differentiating with respect to , we obtain the identity
[TABLE]
Furthermore, the chain rule gives
[TABLE]
Using identities (72)-(A.1), the variational equation of the transformed vector field becomes:
[TABLE]
This calculation appears in [11].
A.2 Block-diagonalization of
In this section, we justify the characterizations of the invariant manifold and transverse fiber bundle in terms of a cleverly chosen basis, as shown in (27)–(28). In the presence of an invariant manifold having a transverse fiber bundle which is invariant as a family (i.e. the flow maps fibers into fibers), can be expressed in a basis which block-diagonalizes the operator . This was proven in [30, 31] for the case of a slow manifold having a transverse fast fiber bundle, but the identical argument carries over without distinguishing ‘slow’ versus ‘fast’ components. We demonstrate this for the vanishing of the upper-diagonal block.
Let be an invariant manifold with a transverse fiber bundle ; i.e., at a point , we have the following splitting:
[TABLE]
We write , where the columns of the matrix form a basis of and the columns of the matrix form a basis of . The corresponding dual basis similarly spans the dual splitting: we have .
Proposition 1
For the choice of basis above, we have .
Proof. We have
[TABLE]
By invariance, for points in , and so . The directional derivative along must therefore be identically 0 on as well. This gives us the following identity:
[TABLE]
Here we clarify that is a symmetric bilinear form, and this (matrix) identity is to be understood as taking the standard directional derivative of each column of in turn and concatenating the result into a matrix.
Similarly, we have the trivial identity on , coming from the dual basis criterion. Differentiating with respect to and using the chain rule, we obtain
[TABLE]
Subtracting identities (76) from (A.2) and using the symmetry of the bilinear form, we obtain .
The argument for is similar if slightly more involved, using the invariance of the fiber bundle to obtain an identity as above [31].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. R. Champneys, V. Kirk, E. Knobloch, B. E. Oldeman, and J. Sneyd , When Shil’nikov meets Hopf in excitable system , SIAM J. Appl. Dyn. Syst., 6 (2007), pp. 663-693.
- 2[2] M.J. Davis and R.T. Skodje , Geometric investigation of low-dimensional manifolds in systems approaching equilibrium , J. Chem. Phys., 111(1999), pp. 859–874.
- 3[3] H. Degn, L.F. Olsen, and J.W. Perram , Bistability, oscillation, and chaos in an enzyme reaction , Annals New York Acad. Sci., 316(1979), pp. 623-627.
- 4[4] N. Fenichel , Geometric singular perturbation theory for ordinary differential equations , J. Differential Equations, 31(1979), pp. 53–98.
- 5[5] A. Goeke and S. Walcher , Quasi-Steady State: Searching for and Utilizing Small Parameters , Springer Proceedings in Mathematics and Statistics, 35(2013), 153–178.
- 6[6] A. Goeke and S. Walcher , A constructive approach to quasi-steady state reduction , J. Math. Chem., 52(2014), pp. 2596-2626.
- 7[7] J. Guckenheimer and C. Kuehn , Computing Slow Manifolds of Saddle Type , SIAM J. Appl. Dyn. Syst., 8 (2009), pp. 854–879.
- 8[8] C.R. Hasan, B. Krauskopf, and H.M. Osinga , Saddle Slow Manifolds and Canard Orbits in R 4 superscript 𝑅 4 R^{4} and Application to the Full Hodgkin-Huxley Model , J. Math. Neurosci. (2018) 8:5.
