Complex Bifurcation from Real Paths

A new bifurcation phenomenon, called complex bifurcation, is studied. The basic idea is simply that real solution paths of real analytic problems frequently have complex paths bifurcating from them. It is shown that this phenomenon occurs at fold points, at pitchfork bifurcation points, and at isola centers. It is also shown that perturbed bifurcations can yield two disjoint real solution branches that are connected by complex paths bifurcating from the perturbed solution paths. This may be useful in finding new real solutions. A discussion of how existing codes for computing real solution paths may be trivially modified to compute complex paths is included, and examples of numerically computed complex solution paths for a nonlinear two point boundary value problem, and a problem from fluid mechanics are given

Hydro-dynamical models for the chaotic dripping faucet

We give a hydrodynamical explanation for the chaotic behaviour of a dripping faucet using the results of the stability analysis of a static pendant drop and a proper orthogonal decomposition (POD) of the complete dynamics. We find that the only relevant modes are the two classical normal forms associated with a Saddle-Node-Andronov bifurcation and a Shilnikov homoclinic bifurcation. This allows us to construct a hierarchy of reduced order models including maps and ordinary differential equations which are able to qualitatively explain prior experiments and numerical simulations of the governing partial differential equations and provide an explanation for the complexity in dripping. We also provide a new mechanical analogue for the dripping faucet and a simple rationale for the transition from dripping to jetting modes in the flow from a faucet.Comment: 16 pages, 14 figures. Under review for Journal of Fluid Mechanic

Computation of periodic solution bifurcations in ODEs using bordered systems

We consider numerical methods for the computation and continuation of the three generic secondary periodic solution bifurcations in autonomous ODEs, namely the fold, the period-doubling (or flip) bifurcation, and the torus (or Neimark–Sacker) bifurcation. In the fold and flip cases we append one scalar equation to the standard periodic BVP that defines the periodic solution; in the torus case four scalar equations are appended. Evaluation of these scalar equations and their derivatives requires the solution of linear BVPs, whose sparsity structure (after discretization) is identical to that of the linearization of the periodic BVP. Therefore the calculations can be done using existing numerical linear algebra techniques, such as those implemented in the software AUTO and COLSYS

Computation of multiple eigenvalues and generalized eigenvectors for matrices dependent on parameters

The paper develops Newton's method of finding multiple eigenvalues with one Jordan block and corresponding generalized eigenvectors for matrices dependent on parameters. It computes the nearest value of a parameter vector with a matrix having a multiple eigenvalue of given multiplicity. The method also works in the whole matrix space (in the absence of parameters). The approach is based on the versal deformation theory for matrices. Numerical examples are given. The implementation of the method in MATLAB code is available.Comment: 19 pages, 3 figure

Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem

A homotopy method to compute the eigenpairs, i.e., the eigenvectors and eigenvalues, of a given real matrix A1 is presented. From the eigenpairs of some real matrix A0, the eigenpairs of A(t) ≡ (1 − t)A0 + tA1 are followed at successive "times" from t = 0 to t = 1 using continuation. At t = 1, the eigenpairs of the desired matrix A1 are found. The following phenomena are present when following the eigenpairs of a general nonsymmetric matrix: • bifurcation, • ill conditioning due to nonorthogonal eigenvectors, • jumping of eigenpaths. These can present considerable computational difficulties. Since each eigenpair can be followed independently, this algorithm is ideal for concurrent computers. The homotopy method has the potential to compete with other algorithms for computing a few eigenvalues of large, sparse matrices. It may be a useful tool for determining the stability of a solution of a PDE. Some numerical results will be presented