Imagine compressing a thin strip until it folds. A numerical optimizer returns an elegant shape; another initial guess returns its mirror image. After enough repetitions, the picture begins to look convincing. If all successful runs lead to the same pair of shapes, have we found everything that matters?
There are at least three different questions hidden inside that sentence. Have we found the lowest energy? Have we found every stable local configuration? Have we found the unstable equilibria separating those configurations? A method can answer the first two successfully while being deliberately unsuited to the third. Conversely, a root solver can produce many additional shapes without producing a single additional stable state.
Two pairs of minima describe a different landscape from one pair, even if the deeper pair remains unchanged. The extra pair can be metastable: locally resistant to perturbations but not globally preferred. Experimental access additionally depends on loading, forcing and dissipation, which static minimization does not determine.
The study here revisits a reduced folding energy rather than inventing a new continuation method. Deflation, pseudo-arclength continuation and solution-landscape searches already have substantial mathematical and mechanical precedents [1–8]. The useful question is narrower: what does a particular optimizer-only description retain, and what does a branch-aware description add after the roots, classifications and discretization have been checked?
The initial comparison supplied a useful negative result. On 73 loads between 42 and 60, independent multistart minimization recovered every stable reference state in both tested nonlinear parameterizations. Continuation recovered some stationary states missing from optimizer outputs, but an additional deflation stage discovered no new accepted root. Those facts did not justify saying that the optimizer had missed stable folding configurations.
A two-mode calculation then identified a more informative question beyond that original window. In one parameterization, a second pair of minima appears at a higher load, accompanied by mixed-mode saddles. In the other, it does not appear over the extended window. Small shifts in the heterogeneous loading pattern further change this secondary event. This creates a controlled test of metastability and discovery, not a reason to discard the earlier negative result.
The extension compares two nonlinear settings, two mode counts and four load phases: sixteen settings, each on 193 load slices from 42 to 90. Every tested workflow recovers all stable reference states with the fixed main initialization. The revealing differences are instead a legacy continuation trace losing stationary coverage, small purely random initialization budgets missing minima, and additional shape modes changing whether a family is stable at all.
The project overview gives a shorter account. The earlier folding article provides the original shape-steering motivation. Its nonlinear coefficients must be kept separate from those of the smaller benchmark below.
A stationary shape is not necessarily a resting place
At a valley floor, small moves go uphill; at a pass, some go downhill; at a hilltop, many do. All three can have zero first derivative.
An equilibrium calculation begins with that first-derivative condition. If the energy is , where describes shape and describes compression, a stationary state satisfies
The Hessian supplies the local distinction. A positive-definite Hessian gives a strict local minimum. A negative eigenvalue supplies an energy-lowering direction and therefore rules out a strict minimum. The Morse index counts negative eigenvalues; an index-1 saddle has one such direction. An eigenvalue close to zero requires special care because the quadratic approximation has become weak exactly where branch structure may change.
Classification is local to the chosen shape space. Positive curvature in four coordinates does not test every continuum displacement or prescribe a specimen’s dissipative evolution.
Newton solves the zero-gradient equation, including passes and hilltops. Minimization should leave saddles, although exact symmetry or a stationary starting point can make it return one.
The flat origin is always stationary in this even energy. After its first instability it is a saddle, yet a zero starting vector can return it with a perfect residual. Software success would manufacture a false minimum if Hessian classification were omitted. Excluding it from the minimum table does not mean that the optimizer never returned it.
Start with an energy whose terms can be checked
The shape is represented on the dimensionless interval by sine modes. The endpoints therefore have zero displacement. These coordinates prescribe a reduced admissible space; the model is not a full geometrically exact rod or a calibrated tissue simulation.
The bending term penalizes curvature. The quadratic foundation term penalizes displacement. Compression lowers energy through the squared slope, while the positive quartic terms prevent that destabilizing contribution from driving energy indefinitely downward. The coefficient controls amplitude stiffening and controls slope stiffening. Their relative size changes the nonlinear landscape even when the linear onset loads remain identical.
Heterogeneity is introduced through two prescribed fields:
The fixed values are , , and . Holding , the comparison uses : prescribed pattern shifts, not measured material disorder. The mean load is labelled in the figures, distinguishing it from the spatial field .
The small benchmark uses ; the earlier shape-steering study uses . Quartic coefficients do not enter the origin Hessian, so shared linear onset loads can conceal different finite-amplitude landscapes. The two settings are not interchangeable.
After integration the energy has the form , where depends affinely on load and is homogeneous of degree four. This supplies an independent identity. Multiplying the stationary equation by gives
Every nonzero stationary state therefore has negative energy when the quartic form is positive. Negative energy does not distinguish a minimum from a saddle. The positive radial curvature also does not remove angular downhill directions. These identities are useful checks precisely because they expose an attractive but invalid shortcut: “the root lowers energy, so it must be stable.”
Two modes let us count rather than merely search
In two modes write . For brevity use for those two coefficients below, reserving for position along the strip. At zero phase the equilibrium equations reduce to
where
This structure gives a complete finite-dimensional control. The origin is always present. Axis roots exist when the appropriate quadratic coefficient is negative. Mixed roots are obtained by solving a two-by-two linear system for the squared amplitudes; they are real only when both squares are positive. Each feasible mixed magnitude gives four signed combinations.
Enumeration never reads optimizer outputs or supplies missing-root starting guesses. Hundreds of random starts would instead remain a search: finding no new root does not prove absence.
Within the first load window, the signed stationary count changes from one to three to five. The strict-minimum count changes from one to two and then stays at two. The first origin event is at approximately and the second at . Exactly at an event, colliding roots and a zero Hessian eigenvalue must be handled as a degenerate state, not forced into either neighboring strict classification.
The four-mode reference is a union of verified discoveries. Coverage one means recovery of that union, not every mathematical solution. Higher modes can reveal unseen families or destabilize smaller-space minima. Two-mode completeness is a method control, not a four-mode theorem.
A larger load creates a more useful test
The zero-phase two-mode benchmark has a secondary event at . Below it, the first-mode axis pair is saddle-like. Above it, that pair becomes locally stable and four mixed-mode index-1 saddles are present. The signed count changes from five to nine, while the strict-minimum count changes from two to four.
This is qualitatively different from adding two more unstable roots. It introduces another locally stable shape family. Yet it occurs only in the setting over the load interval considered. With the earlier coefficients, the two-mode calculation retains five stationary states and two strict minima through load 90. A nonlinear coefficient change can therefore alter the later landscape without changing the initial linear instability.
The range ends at 90, before the next origin instability in representative higher-mode checks. This targets secondary families associated with the first two modes without ruling out other nonlinear families below 90.
Amplitude increases with load; maximum displacement and slope therefore accompany the energy results. A consistent polynomial model is not proof that a real strip remains within its mechanical assumptions or can realize every computed state.
Shift the pattern, but keep track of the remaining symmetry
Zero-phase heterogeneity preserves spatial reflection. Moving the load pattern away from zero generally breaks that reflection symmetry. It does not break the global sign symmetry: every term in the energy remains even under . An upward shape and its downward sign partner still have equal energy.
For two modes the phase shift introduces a quadratic coupling. The equations become
with
The independent control can still count all directions. When , a nonzero root cannot have . Put and eliminate the amplitude:
There are at most four real directions, each supplying a signed pair, in addition to the origin. A reciprocal chart uses for nearly vertical directions; dividing by a very small first coefficient should not make a state disappear from the count.
The calculation uses exact-rational isolation together with outward intervals for the analytic coefficients. Sturm sign variations count real polynomial roots; interval versions check that the count persists for the coefficient enclosure rather than merely for rounded midpoint coefficients. Positive squared amplitudes and Hessian classification receive their own checks. Near coalescence, uncertainty is retained instead of announcing completeness from an ill-conditioned floating root list.
Separate checks of saved pseudo-arclength turns verify two-mode folds near loads for and for . No additional two-mode stable family appears on the 193 sampled slices for within the selected window. These statements concern the declared finite model and sampling range, not events on an untested extended load interval.
The quick shared event scan missed both small-phase folds. Its near-zero-eigenvalue trigger was 5, whereas the closest sampled branch states had absolute eigenvalues of roughly 14 and 29. A coarse event trigger can therefore miss a genuine turn even when the branch itself has been saved. The supplementary verification used those saved tracks; it did not retroactively supply new seeds or change the original method coverage. Event detection and root recovery deserve separate scores.
More stable states do not necessarily change the best energy
At load 80 in the zero-phase two-mode energy, the first-mode minima have energy approximately . The second-mode minima have energy approximately . At load 90 the corresponding values are and . The new family is locally stable but remains higher in energy.
A map showing only the lowest energy would therefore remain on the deeper family. A map recording every strict minimum would change. The highest-minimum curve in Figure 4 is an envelope over that changing set: it can jump when a new family enters, without any energy discontinuity along a connected branch. A transition map would additionally need saddles and paths.
Coercivity and complete two-mode enumeration permit a global energy comparison. Four- or twelve-mode discovery unions supply the lowest known energy, absent a global bound or complete enumeration.
Metastability is not a measured residence time: large disturbances can leave a local well. Waiting times require dynamical and stochastic assumptions beyond a static Hessian.
Different workflows acquire different information
Independent multistart solves each load without previous-load information: a baseline for the pointwise atlas, not a branch-aware optimizer initialization.
Natural continuation instead carries a known stationary state to the next load. A stronger version predicts the change in shape from the tangent equation
When is nonsingular, this supplies a first-order predictor before Newton correction. Near a bifurcation, the inverse becomes poorly conditioned. At a fold, load ceases to be a good local coordinate along the branch. Merely tightening Newton’s stopping rule cannot repair that geometric problem.
Pseudo-arclength treats shape and load as joint unknowns. A tangent predictor and hyperplane correction let load turn backward while arclength advances. This established numerical tool, not a new mechanical mechanism, also appears in current multiparameter work [4].
Deflation changes a root-search equation to discourage convergence to roots already found. Schematically, if are known states, a shifted multiplier is
Its Jacobian includes the multiplier derivative; multiplying the original Hessian by the scalar alone omits part of the Newton equation. A small deflated residual also cannot replace checking the original gradient [1]. Singular multipliers, rediscovered roots and failed attempts all need to remain visible.
These methods receive shared ordinary-root anchors and shared branch-switch candidates. The independent census is consulted only after discovery. The deflated workflow includes the earlier continuation work plus its extra attempts. Giving it more information and then calling its success an equal-cost comparison would be unfair.
The extended comparison preserves that negative result. All five workflows recover every stable reference across all sixteen settings. Tangent-predictor natural continuation, pseudo-arclength and the deflated workflow also recover every stationary reference. Legacy previous-state natural continuation alone falls to 5/9 stationary recovery in the zero-phase four-mode small benchmark, while retaining full stable recovery. Extra deflated anchor searches accept no new roots in 16,384 attempts and add none beyond pseudo-arclength. This is evidence about a well-seeded problem, not a universal verdict: disconnected beam diagrams show discovery devices matter elsewhere [2,5].
Starting guesses are part of the scientific comparison
An initialization is not neutral. A coordinate-axis start in the zero-phase two-mode system lies in an invariant subspace. It can give direct access to a family that a generic random start rarely reaches. After a phase shift introduces coupling, that same vector no longer defines an invariant direction.
The main bank uses 128 fixed physical-coordinate starts: the origin, signed coordinate directions and a deterministic random remainder. Every method’s information is recorded. Smaller prefix budgets ask how recovery changes before the full bank is exhausted; expanded and additional deterministic banks test whether a conclusion depends on one favorable sample.
The two-mode zero-phase benchmark at load 76 makes this dependence concrete. All four strict minima are recovered in only 3 of 10 purely Gaussian banks at 32 starts. At 64 starts the count rises to 6 of 10; at 128, all 10 recover all four. Structured banks recover all four in every replicate at all three budgets. These are ten initialization replicates of one energy problem, not ten specimens or independent physical systems.
The incomplete sets differ too. At 32 starts, four banks miss the whole higher-energy sign orbit and three miss only one partner; at 64, those counts are one and three. These are two-mode omissions, not proof of a stable higher-mode family.
At load 80, the purely Gaussian recovery counts are 8/10, 9/10 and 10/10 at the same budgets. The unsuccessful banks miss one sign partner, not an entire metastable family: both symmetry orbits are represented. The higher-energy pair also corrects to strict minima in twelve modes. That is a local higher-mode re-solve, not a twelve-mode initialization experiment; the missed signed state belongs to a family that survives the stated refinement.
The frozen main bank also recovers the additional pair. Thus the statement supported here is not that multistart necessarily misses metastability. It is that a small purely random budget can omit verified minima, while a modest structural prior or a larger budget repairs that omission in this control. Reporting only the successful 128-start result would hide that difference; reporting only a failed small bank would unfairly condemn the stronger baseline.
Recovery fractions describe the initialization distribution and algorithm, not physical basin volumes. Physical attraction requires an evolution law, metric and disturbance distribution.
Software success can miss the gradient threshold; software failure can return an acceptable residual. Mathematical checks, rather than the favorable flag, determine acceptance.
Some positive-Hessian optimizer returns receive an accuracy-only root polish from that same point. This extra work is counted. An indefinite return is not polished into a minimum, and the procedure never uses the census to supply a missing starting state. The baseline is therefore minimization with a disclosed stationarity polish, not an untouched software output.
Testing metastability does not retroactively turn the original complete stable coverage into failure. Modest structured multistart can remain enough.
A correct root can still be the wrong branch
The original branch-tracking stress test starts just beyond the first instability. At four modes, the small nonzero branch is stationary, but its amplitude is close to zero. Previous-state natural correction can return to the flat root as the load increases. The flat root has zero residual, so a residual check alone cannot detect the lost branch identity.
At both tested natural steps, this occurred while pseudo-arclength preserved the nonzero branch. Yet natural continuation’s overall slice coverage was still complete because other anchors reached the missing states. “Every slice was covered” and “this trace stayed on its branch” are therefore different results.
The extension also tests tangent-predictor natural continuation: comparing pseudo-arclength only against previous-state correction would overstate its advantage. The legacy failure remains visible while the stronger predictor tests its remedy.
Secondary symmetry events need another precaution. The cubic coefficient governing a nonzero branch is not simply the positive quartic energy evaluated on a null eigenvector. Other coordinates relax as the new direction grows. Eliminating that relaxation can make the effective cubic negative even though the full quartic energy remains positive.
In the two-mode higher-load event, this reduced coefficient is . It explains why the mixed saddles appear on the side where the original axis family becomes locally stable. Reusing the origin-pitchfork formula with a positive cubic would generate starts on the wrong side. This is a mathematical issue in branch switching, not a reason to change a random seed.
For an imperfect-pattern fold, local checks include the zero-gradient equation, one null Hessian direction and nonzero load and nonlinear coefficients in that direction. Nearby accepted states provide further numerical evidence. They do not certify the absence of other roots outside that local neighborhood.
Integration error can imitate a model change
The energy contains integrals, and numerical integration is part of its realization. At zero phase, the integrands are finite cosine combinations. A sufficiently resolved uniform trapezoid rule has special exactness to roundoff in this setting. Near-identical values at 201, 401, 801 and 1601 points are therefore unsurprising.
A nonzero phase introduces sine contributions that do not inherit this particular exactness. The off-diagonal two-mode coupling is a sensitive example. At load 80 and phase , an 801-point trapezoid approximation differs from its analytic value by roughly . That error is small beside some diagonal entries but large compared with a original-gradient acceptance threshold.
Near a bifurcation, a small coefficient error can also move the event or change the sign of a small Hessian eigenvalue. A beautiful, smooth branch diagram could then be a faithful solution of the wrong numerical energy. Newton convergence does not distinguish the intended integral from its approximate realization.
The phase comparison uses Gauss integration for the main energy and checks several Gauss orders independently. Trapezoid refinement is retained as a convergence experiment rather than advertised as exact. The analytic two-mode coefficients supply a further independent target.
Analytic counting, root reconstruction and compatibility with the numerical energy are separate checks. A clean surrogate root list cannot override failed compatibility with the intended model.
Adding modes changes what stability means
Four coefficients describe a richer shape than two, but neither is the continuum beam. Additional modes introduce extra directions in which a stationary state can lower its energy. A minimum in a restricted space can therefore become a saddle in a larger one even when its plotted shape changes only slightly.
The original zero-phase refinements already show measurable changes. The first origin event moves from approximately at four modes to at twelve. The second moves from to . At load 60, the deeper minimum changes from energy to .
Those are not numerical integration effects: independently integrated energies agree much more closely. They come from changing the admissible shape space. A state can survive refinement while its energy and event location shift enough to matter for a quantitative claim.
The larger-load comparison includes its own refinement. Small truncation effects near onset do not bound errors at a larger amplitude. A Newton correction after padding a four-mode state with zeros checks whether a nearby higher-mode stationary state can be found. It does not enumerate every higher-mode family, and it may switch destinations if the original seed is poorly conditioned.
Here refinement changes the qualitative answer. The zero-phase secondary event moves from at two modes to at four and at twelve. At load 76 the new two-mode pair corrects to index-1 saddles in twelve modes; at load 80 the refined pair remains minima. This is not merely a small energy correction: the admissible space changes the stability label.
Phase-shifted events are similarly sensitive. For , the verified four-mode fold is near , just outside the main window, while six-, eight- and twelve-mode refinements lie near , inside it. For , the twelve-mode event moves to approximately , outside. An event being inside or outside a plotting window can therefore depend on truncation. A four-mode discovery union alone cannot prove a family absent, and a two-mode control alone cannot establish its higher-mode stability.
Refinement retains seeds, corrected states, residuals, Morse indices, energy and geometry. Persistence requires a credible shape and low-mode association, not merely another accepted root; stability changes and failed associations remain results.
Grid-based prominent-extremum counts are descriptors, not exact counts of every analytic oscillation. Positions, amplitudes and slopes distinguish structural shifts from features near the detection threshold.
Fewer solves do not automatically mean cheaper science
Repeated minimization pays for many energy and gradient evaluations at every load. Continuation can reuse a root and its tangent, often requiring much less work once an anchor is known. But finding anchors, scouting events, switching branches and sampling traced components also costs time.
Deflation adds more root attempts and a multiplier derivative. A workflow that finds no new state can still be scientifically useful as a robustness check, but that extra expense is not a speed improvement. Conversely, a method that solves many fewer nonlinear systems may spend more time assembling or factoring a difficult matrix.
The comparison records energy, gradient, Hessian and load-derivative evaluations, along with elapsed solver time. Shared discovery is charged to every continuation workflow that receives its information. The deflated workflow includes its earlier pseudo-arclength work. Neighbor verification and retries are retained rather than charged twice or excluded selectively. Logged solver records are accounting entries, not automatically a count of distinct nonlinear solves; a trace can contain summaries, retries and tangent evaluations.
These are transparent work summaries, not an equal-budget efficiency theorem. Different workflows solve different subproblems; branch-switch construction, eigenproblems, classification, plotting and some tensor assembly sit outside the solver totals. Wall-clock time also depends on hardware and library behavior. Repeating the full calculation reproduced its scientific summaries, with measured durations treated separately rather than required to agree.
What a saddle can tell us about a transition
An index-1 saddle is a plausible transition candidate because it has one local downhill direction. Perturbing along the two signs of that direction and minimizing can reach distinct verified minima. This checks a local energy-lowering displacement and candidate endpoints.
It does not reconstruct a continuous physical trajectory. The optimization algorithm may jump, use a nonphysical metric or follow a path that is not a minimum-energy path. A saddle energy minus a minimum energy is therefore not automatically the activation barrier governing a real transition.
A stronger study would specify dynamics or a path principle, track continuous connections, verify endpoint convergence and refine the path independently. It might also need geometry and material validation outside the reduced energy. Existing mechanical landscape studies combine several such layers [6,7]; conditional landscape theory likewise has assumptions that degenerate bifurcation points do not automatically satisfy [8,10].
Here the static audit stops short of that claim. Saddles add structure to the energy picture. Whether they control switching remains a separate question with separate evidence.
Conclusion: ask which map the computation has earned
An optimizer-only shape atlas is not inherently wrong. Over the original comparison window it recovered all stable reference states. Additional root methods filled in some unstable structure without changing that stable-state result. Preserving this negative finding is more informative than turning every new saddle into a missed minimum.
The higher-load and phase comparisons separate emerging metastable families from the deeper energy family, retain the global sign symmetry, and supply independent low-dimensional counts against which discovery can be scored. Their strongest caution is already concrete: a verified two-mode minimum can become a higher-mode saddle, and a refined event can move across the selected load boundary.
The scientific contribution is therefore the separation of questions and evidence in one specified folding model. Lowest known energy, all recovered minima, traced stationary branches and physically validated transitions are different maps. A reliable calculation tells the reader which of those maps it has earned, and which still requires another experiment.
References
- Farrell, Birkisson and Funke. Deflation techniques for finding distinct solutions of nonlinear partial differential equations (2015). Primary paper.
- Farrell, Beentjes and Birkisson. The computation of disconnected bifurcation diagrams (2016 preprint). Inspected preprint.
- Farrell. Computing multiple solutions of systems of nonlinear equations with deflation (2026). Bibliographic record and abstract were accessible; no detailed theorem from the inaccessible full text is used here. Published record.
- Kumar, Pichi and Rozza. Bifurcation curve detection with deflation for multiparametric PDEs (2026, version 2). Primary preprint.
- Xia, Farrell and Castro. Nonlinear bifurcation analysis of stiffener profiles via deflation techniques (2020). Published paper.
- Medina, Farrell, Bertoldi and Rycroft. Navigating the landscape of nonlinear mechanical metamaterials for advanced programmability (2020). Published paper.
- Bonthron, Pierce and Tubaldi. Programming stability and stiffness in two-dimensional multistable structures (2026). Published paper.
- Su, Wang, Zhang, Zhao and Zheng. Improved High-Index Saddle Dynamics for Finding Saddle Points and Solution Landscape (2025). Published paper.
- Pichi and Strazzullo. Deflation-based certified greedy algorithm and adaptivity for bifurcating nonlinear PDEs (2025). Its certification concerns reduced approximations under stated conditions, not unconditional root enumeration. Published paper.
- Yin, Yu and Zhang. Searching the solution landscape by generalized high-index saddle dynamics (2021). Published paper.