The circulant matrix is singular, so the meaning of convergence needs care. If is the cyclic shift, has Fourier eigenvalues . Its null space consists of constants. Therefore is solvable exactly when , and any solution is determined only up to a constant. Neither iteration can converge to a unique solution for arbitrary right-hand sides.
For a compatible , fix one solution and examine the error. The iteration matrix of the Jacobi method is , with eigenvalues . The constant mode has eigenvalue one. For odd all other eigenvalues have modulus less than one, so the iterates converge to , with the constant selected by the initial mean. For even , the alternating vector has eigenvalue , producing an undamped oscillation. With and alternating initial vector this is an explicit nonconvergent example. For even convergence occurs only when that error component vanishes. When , the mean instead drifts by at each step, so Jacobi cannot converge.
For Gauss-Seidel iteration, put , so is positive semidefinite with diagonal two. The homogeneous error iteration is , . Updating a coordinate exactly minimizes in that coordinate; completing the square gives an energy decrement . Summing within a sweep gives
The same identity holds for the Hermitian energy of complex vectors. If and is nonconstant, its energy is positive, so . Equality forces every update to be zero, whence and is constant, a contradiction. Thus all nonconstant eigenmodes have modulus strictly below one.
The eigenvalue one has only the constant eigenspace. To exclude a generalized eigenvector at one, observe that
If , multiplication by would give . Hence the constant eigenvalue is algebraically simple, and
For compatible , Gauss-Seidel therefore converges from every start to some solution, for either parity of . Its limit differs from by . For an incompatible , the affine update gives , so the iterates again cannot converge.
Thus semiconvergence of cyclic Poisson iterations gives the precise answer:
Both have spectral radius one on the unrestricted space, so neither meets the strict stationary-iteration criterion for a unique limit independent of the starting constant. A spectral radius of one alone is not a proof that Gauss-Seidel's compatible iterates fail to converge. A normalization or projection removing the constant mode makes this distinction explicit.
Consider on a rectangle, with prescribed Dirichlet boundary conditions, and assume initially that the solution is smooth up to the boundary. A finite difference method chooses grid values as unknowns, approximates the differential operator by a local stencil, incorporates the boundary data, and solves the resulting sparse linear system. Accuracy of a stencil by itself is insufficient: one also needs a well-posed discrete problem, a stability estimate uniform under refinement, and a sufficiently accurate algebraic solve.
For a square grid of spacing , centered second differences give the five-point Laplacian
Expanding each opposite pair in a Taylor series gives
Thus the standard equation has second-order normalized local truncation error. Known boundary values move to the right-hand side; they are not iterated as independent unknowns. Nonrectangular geometry requires a consistent boundary approximation rather than silently retaining a full interior stencil outside the domain.
The negative interior operator has positive diagonal and nonpositive off-diagonal entries. For a grid vector extended by zero on the boundary,
The edge sum includes links to the fixed boundary. Connectivity makes the matrix positive definite, proving uniqueness and providing an energy structure. The same sign pattern gives a discrete maximum principle: at a negative interior minimum, is nonpositive. If and the boundary is nonnegative, equality can only persist by propagating that minimum through all neighbors to the boundary, a contradiction. Therefore .
On the unit square, the barrier satisfies exactly. If has zero boundary values and , apply the maximum principle to to obtain
The bound is independent of , so the consistency error gives an nodal error. It also separates the algebraic residual from the discretization error: solving the linear system much less accurately than would spoil the spatial accuracy.
A direct higher-order design is possible. In one coordinate,
has fourth-order accuracy. Adding the corresponding formula in the other coordinate gives a wider stencil. Its advantages must be balanced against boundary closures, more distant couplings, and the possible loss of monotonicity. Higher order does not automatically imply a stable or geometrically convenient scheme.
The Mehrstellen method takes a different route: it uses the Poisson equation to eliminate leading truncation derivatives while keeping a compact unknown stencil. Define the nine-point finite-difference stencil
Here each sum has four terms. Equivalently . Expanding gives
The uncorrected nine-point operator is only second order for a general function. But implies . Moving this known leading defect to the source and approximating its Laplacian with gives
Indeed , and multiplication by makes that replacement's error fourth order. In explicit compact form the right-hand side is . Only known source samples, not additional distant solution unknowns, enter this correction. The corresponding unscaled stencil residual is . If , the leading term already vanishes, which explains harmonic superconvergence of the nine-point stencil.
For zero boundary data, has axial link weights and diagonal link weights . Their energy sum proves positive definiteness, and their sign pattern again proves the discrete maximum principle. The same quadratic barrier is exact for , so
For smooth solutions and accurately imposed boundary values this proves fourth-order nodal convergence of the corrected scheme. Singular corners, rough sources or low-order boundary treatment can reduce the observed rate; a formal interior expansion is not a global regularity theorem.
More generally, compact high-order schemes choose a solution stencil and a source stencil together, match their Taylor expansions, and use differentiated forms of the PDE to remove derivatives that would otherwise need a wide solution stencil. Variable coefficients require their derivatives and mixed terms to be treated consistently; the constant-coefficient identity cannot be reused unchanged for a different elliptic operator. On irregular meshes, conservation and consistent fluxes may be more useful starting points than a symmetric Cartesian formula.
Finally, discretization and solution cost are coupled. The five-point Dirichlet matrix has eigenvalues proportional to sums of squared sine frequencies, so its smallest eigenvalue stays of order one while its largest is . Its condition number grows like ; simple relaxation therefore becomes slow. Sparse direct elimination, Conjugate gradient method with appropriate matrix preconditioning, and the multigrid method are alternatives. A sound design combines local accuracy, boundary fidelity, mesh-independent stability, and an algebraic solver whose residual is small enough for the intended error tolerance.
The multigrid method addresses a characteristic failure of single-grid relaxation: its cheapest updates rapidly remove oscillatory error but barely change smooth error. For example, the one-dimensional Poisson equation matrix has diagonal . The weighted Jacobi method with weight has Fourier error factor
At low physical frequency, and this factor is , requiring sweeps for a fixed error reduction. With , high grid frequencies are multiplied by at most in modulus. Smooth error on a fine mesh is well represented on a coarser mesh, where it is relatively more oscillatory and hence cheaper to remove. These two complementary mechanisms motivate smoothing and coarse-grid correction.
Write the discrete problem as . For an approximation , the residual is and the error satisfies . It is this error equation that is transferred to a coarse grid; restricting the approximate solution alone would not solve the missing error. With prolongation and restriction , solve
For nested Cartesian grids with , linear interpolation copies a coarse value at a coincident fine node and averages the two nearest coarse values at an intermediate node. Its two-dimensional counterpart is bilinear interpolation. Full-weighting restriction uses weights in one dimension and
in two dimensions. With these choices in ordinary coordinate inner products. A Galerkin coarse-grid operator is ; alternatively one can rediscretize the PDE on the coarse mesh when that choice remains compatible with the transfers.
For a symmetric positive-definite fine operator and , the exact correction matrix is
It satisfies and . Thus it removes the coarse-space component of the error and is an orthogonal projection in the energy inner product. With pre- and post-smoothing matrices , the exact two-grid error matrix is . Effective smoothing on the complementary space and accurate coarse representation of smooth error are both needed for contraction.
A concrete harmonic calculation makes the mechanism quantitative. On the one-dimensional constant-coefficient problem, couple the two harmonics and , put and , and use the above transfers. Linear interpolation has harmonic weights , while the fine operator has diagonal symbol . Therefore its Galerkin correction on this pair is
One pre- and one post-sweep of weighted Jacobi with gives , . This rank-one matrix has eigenvalues zero and
The two-grid Poisson factor with weighted Jacobi is therefore mesh-independent in this model. A periodic constant nullspace must first be removed; a Dirichlet problem has no such nullspace. This is evidence for the design, not a claim that the same factor applies to every PDE or every smoother.
The geometric multigrid V-cycle replaces the exact coarse solve by one recursively defined coarse cycle. A complete implementation on level proceeds as follows:
  • On the coarsest level, solve directly and return.
  • Otherwise perform a fixed number of pre-smoothing sweeps, for example .
  • Compute the current residual and restrict it: .
  • Initialize the coarse error approximation at zero and apply one V-cycle to .
  • Prolong and add the correction: .
  • Perform post-smoothing sweeps and return the improved approximation.
Boundary values of the solution are imposed on the fine level; the error equation has homogeneous boundary conditions when those values were already imposed exactly. Residuals must be computed after pre-smoothing, not before. The zero initialization on each recursive error solve makes the cycle an error correction rather than an accidental addition of an old coarse solution. For an energy-symmetric cycle usable in Conjugate gradient method, choose compatible adjoint transfers and symmetric smoothing, such as forward Gauss-Seidel before correction and its backward sweep afterward.
With bounded stencil size and fixed sweep counts, a sweep, residual calculation or transfer costs . Uniform coarsening gives , so
If the full V-cycle has an error reduction factor independent of mesh size, reducing an arbitrary initial algebraic error by a factor takes cycles and work. Linear work per cycle alone does not prove the mesh-independent factor; it rests on the smoothing and approximation properties just illustrated. Full multigrid starts on a coarse mesh, interpolates its solution to each successive finer mesh, and uses a few cycles per level. When the interpolation accuracy and cycle contraction match the discretization error, this reaches discretization-level accuracy in work.
Performance depends on the operator. Strong anisotropy can leave error oscillatory in one direction but weakly penalized by the differential operator, defeating point smoothing; line or plane relaxation and selective coarsening address this. Large coefficient jumps demand compatible coarse spaces. Nonrectangular meshes motivate algebraic rather than purely geometric coarsening. Nonlinear problems use a full-approximation formulation instead of the linear residual correction verbatim. Singular Neumann or periodic operators need right-hand-side compatibility and consistent nullspace treatment on every level. Multigrid is fast because its components address different error scales, not because coarsening alone guarantees a good solver.
This is mid-edge subdivision, rather than a vertex-retaining refinement. Use the usual closed two-manifold mesh setting: each edge has two incident facets and each vertex has a cyclic fan. For boundary meshes, a boundary refinement rule has to be specified separately. The relevant generic-position condition excludes collapsed local tangent directions and singular regular patches.
Topology and the manifold property. Regard the abstract mesh as a cell decomposition of a surface. Join the edge midpoints in each facet. The inner polygon is the new face associated with that facet; the corner regions around an old vertex assemble into the face associated with that vertex. At an old edge midpoint, the four adjacent corner connections form a cyclic link. Thus every new interior vertex has valence four, every new edge has two incident faces, and the refined cell complex is homeomorphic to the original surface. If the original counts are , the new counts are , preserving . The cyclic-link argument, rather than Euler characteristic alone, verifies the local manifold condition. Convergence and local regularity, justified below, transfer this abstract surface structure to the limit.
Convex hull. Each newly created point is an average of two previous points. By induction it is a convex combination of original vertices. The same is true of points of any triangulation of the refined facets, and taking limits keeps them in the closed convex hull. Hence the entire limit stays in that hull, not necessarily inside the original nonconvex enclosed solid.
Facet centroids. Follow the descendant inner face of an original -sided facet, with cyclic vertices . Its vertices satisfy . Summing proves mid-edge facet centroid invariance:
For a cyclic Fourier mode the multiplier is , whose modulus is for . Every mean-zero mode therefore decays, so all descendant face vertices converge to . Consequently the original vertex centroid belongs to the limit surface. No planarity assumption is needed.
Quadratic triangular pieces. On a regular quadrilateral mesh, apply two midpoint steps. Each new point combines three old neighboring controls with weights . For example, around a face with cyclic corners , the four new points are
This is the binary refinement mask obtained by expanding
with the translation chosen to place the refined grid at quarter offsets. The limit is therefore represented by shifts of the quadratic four-direction box spline with directions . Projection of a four-cube onto the plane has piecewise total degree , and its knot grid is triangular. Coordinatewise linear combinations preserve that degree, giving parametric quadratic triangle patches. Around a nonregular center there are infinitely many shrinking rings of such patches; the isolated center is their limit, not generally part of a finite polynomial patch representation.
Only finitely many initially possible smoothness exceptions. Every vertex has valence four after the first step. Only the descendants of original facets and the faces created around original vertices can remain nonquadrilateral. All subsequently created faces around four-valent vertices are quadrilaterals. Thus every point except the limiting centers of those persistent nonquadrilateral faces eventually lies in a regular patch neighborhood. The number of possible exceptional centers is at most . For the regular box spline, any three distinct directions still span the plane, so three directions must be removed to make the remainder nonspanning. The box spline continuity criterion gives across its triangle boundaries. This proves continuity away from at most those finitely many centers.
Removing the apparent exceptions. Center a finite neighborhood of an -sided exceptional face, and analyze a full two-step subdivision matrix so the mesh orientation is restored. Cyclic Fourier basis modes diagonalize its sector symmetry. The face mode has eigenvalue
The local ring blocks also contribute eigenvalues and zero. For , the constant mode is the single eigenvalue one, and the two first-frequency tangent modes dominate all nonconstant remaining modes. Construct their characteristic map of a subdivision surface; its quadratic derivative pieces must have a nonzero consistently oriented Jacobian, and its fundamental sector must be injective. These checks, not the eigenvalue ordering alone, give a regular chart and a continuously limiting tangent plane for generic data.
The case needs a separate Jordan analysis: is eightfold, so the usual semisimple double-eigenvalue test does not apply. Its first-frequency Jordan chains supply the leading tangent behavior, while the other contributions become relatively negligible. Regularity and injectivity of that generalized characteristic map complete the argument. These concrete spectral and characteristic-map checks are established for this scheme in Peters and Reif, Sections 3 and Appendix. Thus the generic limit is geometrically also at the exceptional centers; compatible local charts need not preserve the original uniform refinement parameterization.
The manifold statement concerns the abstract limit surface and its regular local parametrizations. It does not, from combinatorics and generic tangent data alone, prove global injectivity of the image in three-dimensional space. A particular model may require an additional global self-intersection test before claiming that its image is an embedded manifold.
For a real matrix with positive determinant, the polar decomposition of an invertible real matrix gives unique factorizations
where and are the right stretch tensor and left stretch tensor, respectively. Positivity here means positive definiteness, not merely nonnegative entries.
To prove existence, is symmetric and for every nonzero , because is invertible. The spectral theorem for real symmetric matrices supplies an orthogonal matrix and positive eigenvalues such that . Define using the principal square root of a positive semidefinite matrix construction:
Then , so is orthogonal. Also ; an orthogonal matrix has determinant plus or minus one, hence . Set . It is symmetric positive definite, , and .
For uniqueness, any second factorization with the same properties gives . Since commutes with its square, it preserves every eigenspace of . On a -eigenspace its own positive eigenvalues must square to , so it equals times the identity there. Thus , then , and finally is fixed too. This proves both uniqueness and the polar decomposition in continuum mechanics, with the same proper rotation in its left and right forms.
Write the perturbation Stokes streamfunction as , with and nonzero . Its radial and axial velocity amplitudes are and . These automatically obey incompressibility. Linearizing the radial and axial Euler equations, with pressure amplitude , gives
Thus
Differentiating the first expression, the terms involving cancel. Equating the two expressions for proves the axisymmetric inviscid pipe stability equation:
At the axis, finite smooth axisymmetric velocity requires , after choosing the irrelevant constant in the streamfunction. At the wall, impermeability gives . There is no tangential no-slip condition in this inviscid problem. A decoupled azimuthal disturbance satisfies and does not introduce a growing discrete mode when .
For real , suppose with , so division by is legitimate. Multiply the ordinary differential equation by , integrate, and apply integration by parts. The endpoint terms vanish by the preceding regularity and wall conditions, leaving
Taking its imaginary part yields
A growing temporal mode therefore requires a sign change of , rather than a sign change of alone. This is the cylindrical counterpart of Rayleigh's inflection-point theorem. If this derivative vanishes identically, the positive first integral rules out a nontrivial growing real-wavenumber mode as well. Isolated zeros without a sign change do not make the second integral vanish for a nonzero regular mode.
For the parabolic Poiseuille flow, is constant. Under the specified exclusion of critical levels, division gives
Setting , or equivalently choosing in , turns this into
It is the Modified Bessel differential equation of order one. Hence . Since tends to a nonzero constant at the axis, it gives a singular radial velocity and must be excluded. The admissible mode shape is therefore
For , direct solution gives after axis regularity, and the wall condition again forces the trivial solution. For nonzero , the nonzero roots of are imaginary. Writing for the zeros of the ordinary Bessel function , the evanescent potential modes of inviscid Poiseuille flow are
Their perturbation vorticity vanishes: . These modes grow exponentially in one axial direction and decay in the other. They can describe end-forced or spatially localized potential fields, but neither sign gives a bounded normal mode on a whole infinite pipe. Moreover, the reduced radial equation contains no : it supplies no temporal eigenvalue condition. An arbitrary imaginary part assigned to here is consequently not evidence for a physical temporal instability.
The real-wavenumber calculation does exclude growing discrete axisymmetric modes of this inviscid profile. It does not establish every form of stability: singular neutral disturbances with in the range of , transient dynamics, non-axisymmetric disturbances, and finite-amplitude transition require separate treatment. The exclusion specifically removes the inviscid continuous spectrum.
With viscosity, linearize the Navier-Stokes equations instead and eliminate pressure to obtain a fourth-order cylindrical counterpart of the Orr-Sommerfeld equation. Impose both and , with appropriate regularity at the axis. The resulting eigenvalue problem involves the Reynolds number and determines complex frequencies, rather than leaving arbitrary. Viscosity supplies diffusion, no-slip boundary layers and critical-layer regularization, so the inviscid sign argument alone no longer decides its spectrum. That observation does not imply that viscous pipe flow must have a growing linear eigenmode; finite-amplitude pipe transition is a different question.
At normal incidence the P wave and the two S wave polarizations decouple. In each uniform layer the relevant displacement satisfies , with for a longitudinal wave and for a shear wave. Its speed is and its seismic impedance is . A welded interface preserves particle velocity and traction. For displacement or velocity amplitudes, incidence from medium 0 onto medium 1 therefore gives
Reflection reverses the displacement sign when the receiving seismic impedance is larger. The energy-flux fractions are
The impedance factor matters: a displacement transmission coefficient larger than one does not imply energy amplification. Equal impedance eliminates reflection even when the densities and speeds differ.
For a stack, every interface creates reflected waves which can return to all earlier interfaces. A seismic layer transfer matrix incorporates those multiple reflections exactly. Use harmonic time dependence , particle velocity and compressive traction for a P-wave, or the negative relevant shear traction for an S-wave. Through layer of thickness ,
This follows by solving and . Continuity means that the state passes unchanged across each welded interface. Put , with , and let the exterior impedances be . A unit incident velocity gives top state and bottom state . Eliminating these states yields
For real moduli and no attenuation, conservation of elastic-wave energy flux gives . Reciprocal incidence gives equal energy transmission in the reverse direction; flux-normalized amplitudes express that reciprocity without unequal exterior impedances obscuring it.
The wave phase accumulated in each layer determines constructive or destructive interference. For one layer between identical exterior media, an integral number of half-wavelengths makes and gives perfect transmission, regardless of the layer impedance. At quarter-wave phase thickness, a single matching layer with also gives zero reflection: the layer transforms the terminal impedance to . Away from these matching conditions there are transmission peaks, reflection maxima and rapid frequency-dependent phase changes. In the time domain these are a direct transmitted pulse followed by delayed internal reverberations and reflected echoes. Long residence in a resonant stack produces narrow peaks and long ringing, without creating energy.
For a periodic two-layer stack, the half-trace of one cell is
This is the periodic seismic multilayer stop band criterion. When the absolute right side exceeds one, the cell eigenvalues are a reciprocal growing/decaying pair and a long finite stack has exponentially small transmission. The missing transmitted energy is reflected, not absorbed. Large impedance contrast and repeated quarter-wave layers strengthen such stop bands. In pass bands the cell modes propagate, and a finite stack superposes transmission resonances on that propagation. An irregular stack need not have equally spaced peaks: the individual travel times and impedance contrasts set its interference pattern.
At sufficiently low frequency a finite stack has , so its leading reflection is that of the two exterior media alone. For many thin repeated layers with wavelength much longer than a cell, their effective density is the volume-weighted density and their normal modulus is the harmonic mean, . This follows by expanding each propagation matrix to first order and averaging its two coefficients. At high frequency, sharp interfaces still reflect: there is no general disappearance of reflection, only increasingly rapid interference fringes. Smooth impedance grading instead suppresses short-wavelength reflection when its variation scale is long compared with the wavelength.
These calculations provide a reproducible investigation: vary the layer travel times, impedances and number of cells; compute the matrix product; plot reflected/transmitted fluxes and check their sum. Adding attenuation makes the flux sum smaller than one and reduces reverberation peaks, while oblique incidence introduces Snell law for elastic waves and P-SV mode conversion absent from this one-dimensional setting. Impedance contrasts generate reflections, propagation phases organize their interference, and energy conservation separates reflection from genuine absorption.
Use the local coordinate . The differential system becomes
For the nonzero quadratic leading term, the coefficient of the local linear ordinary differential equation system has a pole of order four, so infinity is an irregular singular point of Poincaré rank three in this gauge. The matrix-valued function itself has a pole of order two; the extra factor is essential when classifying the equation. If vanishes the degree and these orders decrease. The specified distinct eigenvalues give the nondegenerate unramified case.
The leading exponential function factors have actions , so their difference is . Equal exponential magnitudes occur on
These are commonly called Stokes rays in the sectorial ODE convention. With the action-phase convention used by the wiki's Stokes line article they are anti-Stokes lines; the same-phase rays instead have
Giving both defining equations removes the nomenclature ambiguity; both sets contain six directions.
The standard construction with distinct leading eigenvalues uses six sectorial fundamental solutions per turn, with basic angular spacing . They are fundamental matrices, each containing two independent column solutions. On the logarithm cover choose six consecutive overlapping sectors of width , with small. Their union has angular opening , covering the requested . One often also writes a seventh index to compare the closing sector with the first after a full turn; that is a closing copy, not a seventh independent sector in the six-sector construction. The number is a generic sectorial fundamental solution normalization count, not a universal minimum for exceptional systems with vanishing Stokes matrices: the exactly diagonal system already has one global elementary fundamental matrix.
There is a missing qualification in the requested product identity. Polynomial coefficients give an entire invertible fundamental matrix, hence trivial actual monodromy about a large circle: the circle contracts through ordinary points. But the formal matrix generally has the form , and a positive turn changes its logarithm branch by the formal monodromy . This factor cannot be discarded.
To specify the printed product order, let act on column vectors of solution coefficients across the th sector boundary, so adjacent normalized matrices satisfy . Six transitions give . The normalized formal branch after the turn is , so sectorial uniqueness gives . Consequently
Using Stokes matrices for right changes of fundamental matrices instead reverses/inverts the corresponding convention; the formal monodromy factor remains necessary. The formal monodromy correction to an entire-system Stokes product shows that the printed identity holds when , including the corrected Lax specialization discussed below.
It does not follow from polynomiality alone. For example take
The coefficient matching in question 2 gives , hence and the ordered Stokes matrix product is , not , despite having no finite singularity. This is an explicit counterexample to the unqualified final clause.
For both parameters the autonomous planar system is , . It has the conserved energy
Indeed . At any equilibrium point the eigenvalues satisfy
For , the quadratic is strictly positive, so the only equilibrium point is , with eigenvalues . Since has the sign of , has a unique strict minimum at zero and tends to infinity in both directions. All positive energy levels are closed curves surrounding this stable center equilibrium. They are clockwise: rightward when and leftward when .
For , factor . The three equilibrium points and their classifications are
The two center equilibria are stable but not asymptotically stable; the saddle equilibrium is unstable. At the saddle equilibrium the local unstable and stable directions are and .
The potential values are , , and . Consequently there are closed loops around the left center for , closed loops in both wells for , and a figure-eight pair of homoclinic orbits at . At the right center is a stationary point while the left well still has a closed orbit. For , each closed curve encircles both centers and the saddle.
The two homoclinic orbits satisfy . Their outer turning points can be located exactly from
Every nonstationary energy curve is oriented to the right in the upper half-plane and to the left in the lower half-plane. The sketches show the closed curves, the separating orbits, the stable and unstable saddle directions and the direction of flow.
Figure 1.
Clockwise phase flows, alternating pendulum saddles and centers, and the one-well and two-well quartic potentials
. Details.
Here the autonomous planar system is , . Its equilibrium points are
The Jacobian matrix is
For even , the eigenvalues are , so these points are unstable saddle equilibria. Writing , their local unstable and stable directions are and respectively. For odd , the eigenvalues are .
To classify the latter points nonlinearly, differentiate the first integral
At this energy has a strict local minimum. Its nearby level sets are closed curves, proving that the odd- points are stable center equilibria, with no attraction to the center. The phase portrait consists of closed oscillatory orbits for , heteroclinic orbits at joining consecutive saddle equilibria, and open rotating orbits for . The separating curves have
Above the horizontal axis , so flow is rightward; below it flow is leftward. The closed orbits are clockwise, and these same signs orient every separating and rotating orbit.