Reduction, and what a model is for

A tie is a gap smaller than its neighbours

A balanced truncation that cut between two Hankel singular values agreeing to under one per cent left a reduced model with a pole near the axis and twice the error the σ promised, and the warning drawn from it was a rule: never cut inside a tie. Over 1,452 reductions of twelve oscillators, all ten doubled errors are at ties — but three of them have gaps of about two per cent, which a one-per-cent rule lets through, and what they share is a gap under a fifth of the gaps beside it. Moving every such cut one order down never doubles and halves each doubled error, for a median cost of one per cent. It is not free everywhere: at damping 0.5 it costs up to two and a half times. And the near-integrator was never the harm: 32 reductions have one and 22 of them read their σ correctly. The cheapest test of all is one evaluation of the error at zero frequency, which picks out the ten doubled cuts and nothing else.

Worth reading first: The bound that is known in advance · A model that cannot be run.

Where a ringing mode stops being a pair found one failure of balanced truncation that was not gradual. On a six-mode oscillator at dampings 0.07 and 0.1, the reduction to six states cut between two Hankel singular values that agreed to under one per cent, and came back with a pole four to eight hundred times closer to the imaginary axis than any pole of the system it came from. Its error was a spike at zero frequency, twice what the dropped σ read. The essay left a warning and a test for it. Cutting at five or seven instead keeps or drops both members of the tie; “whether either of those reductions keeps its poles near the full model’s at every damping — and what the extra or missing state costs in error — is one more pair of orders on the same sweep, and would turn the warning into a rule: never cut inside a tie.”

The pair of orders answers that case at once, and the figure at the top is what the rule needs before it can be a rule: a census. One system is one place where a cut went wrong. A rule has to say what a tie is, and a census is what says whether the definition catches the failures and how much it costs where there was nothing to catch.

The census

The systems are the earlier essay’s construction — six modes with natural frequencies spaced evenly in logarithm from 1 to 30, each a lightly damped pair of poles −ζω±iω1−ζ2-\zeta\omega \pm i\omega\sqrt{1-\zeta^2}, with input and output weights drawn at random — at twelve seeds, of which seed 3 is the earlier essay’s system. Each is taken at the same eleven dampings from 0.005 to 0.5 and reduced to every order from 1 to 11. That is 1,452 balanced truncations, odd orders included, because an odd order cuts inside a mode’s own pair and the question is about cuts between any two singular values.

For each reduction three things are recorded. The H∞ error, over twice the first dropped singular value 2σr+12\sigma_{r+1}, which the earlier essays established as the reading: a reduction whose error is about one reading has done what its σ promised. A reduction whose error is more than one and a half readings is called doubled, because every one of them turned out to be close to two. The slowest pole of the reduced model, over the damping, since every pole of the full model is at least ζ\zeta from the axis. And the gap at the cut, σr/σr+1−1\sigma_r/\sigma_{r+1} - 1, with the same gap measured relative to the smaller of the two gaps beside it.

Ten reductions are doubled. They come from five of the twelve systems, at dampings from 0.03 to 0.3, at orders four, six and eight, and their errors are 1.69 to 1.93 readings. The other 1,442 run from 0.56 to 1.42, and 1,276 of them are within a fifth of one — mostly just below it, which is the earlier essay’s sum-of-the-pair effect at even orders. Doubling is not the tail of a distribution here. It is a separate population.

One system, every order

The H-infinity error of the balanced truncation at every order, beside twice the first dropped Hankel singular value, for one six-mode oscillator at damping 0.1Errors at orders 1 to 11: 20.3, 9.92, 9.28, 4.90, 3.59, 7.13, 3.54, 1.59, 1.57, 0.714, 0.709. Twice the first dropped σ: 20.7, 12.3, 10.7, 5.56, 3.90, 3.87, 3.58, 1.85, 1.63, 0.811, 0.709. Tied cuts: order 6, relative gap 0.087; order 9, relative gap 0.144; order 11, relative gap 0.142.damping 0.1, errororder 53.6order 67.1order 73.5123456789101110⁻¹110¹10²order of the reduced modelH-infinity errorerrortwice the first dropped σshaded: a tied cuta tie's own state buys nothing
Fig. 1 The earlier essay’s system: H∞ error at every order, solid, beside twice the first dropped σ, dashed. Shaded orders cut at a tie. The dial sets the damping.

On the earlier system at damping 0.1 the error tracks the reading at every order but six. At six it jumps to 7.13 against a reading of 3.87; at five it is 3.59 and at seven 3.54. Both sides of the tie are clean. Neither has a slow pole — the slowest are at 0.58 and 0.57 of the damping — and the extra state of order seven buys 1.5 per cent of error over order five. At damping 0.07 the numbers are 5.67 at five, 11.3 at six and 5.67 at seven: two more states for nothing.

That is the first answer to the question as posed, and it has a shape worth stating before the census generalises it. The two members of the tie belong to two different modes; the earlier essay identified them as the third and fourth modes, whose σ nearly coincide. Keeping one member keeps half of a mode, which buys nothing a reading can see. Keeping both keeps half of each of two modes, which buys almost nothing either. The tie’s own states are worth about what the singular values say — the same — and so a cut that keeps one of them and drops the other is a cut that the σ cannot rank.

Turn the dial down to 0.005 and the staircase appears that a mode that rings is counted twice explained: the error falls only at even orders, because each mode’s two singular values agree to about 2ζ2\zeta — one per cent at this damping — and every odd order cuts inside a pair. Those cuts are ties too, by any definition that looks at the gap, and they are harmless: the error at order five is 96.5 against 97.4 at four. A tie inside one mode wastes a state; a tie between two modes can double the error. The census has to tell them apart.

What a tie is

The warning as written was a gap under one per cent. In the census 65 cuts satisfy it and seven of the ten doubled reductions are among them. The other three have gaps of 1.85, 2.13 and 2.18 per cent, at dampings 0.2 and 0.3, and a one-per-cent rule would cut there without complaint.

What those three share with the seven is visible in the figure at the top. Plotted against the gap at the cut divided by the smaller of the gaps on either side, every doubled reduction lies to the left of a fifth: from 0.007 to 0.168. A gap of two per cent at damping 0.3 sits between gaps of thirteen per cent and more, where the modes’ own pairs have split by about 2ζ2\zeta; it is a tie because its neighbours are not. A gap of one per cent at damping 0.005 sits between gaps of close to a hundred per cent, and is a tie for the same reason, but of the harmless kind.

So the relative definition catches all ten, and it pays for that by catching a great deal else: 431 of the 1,452 cuts are ties by it — 68 at each of the two lightest dampings, where every odd order is one, falling to 17 at 0.1. A rule that refuses to cut at any of them refuses thirty per cent of all orders. Whether that matters depends on what refusing costs, which is the next measurement.

The near-integrator was a symptom

The reduced model's slowest pole, over the damping, against the error over the reading, for every reduction in the census32 reductions have a pole closer to the axis than a tenth of the damping; 10 of those are doubled and every doubled reduction is among them. The other 22 near-integrators have errors between 0.75 and 1.42 readings.slowest pole under a tenth of the dampingnear-integrators32of them doubled1010⁻⁴10⁻³10⁻²10⁻¹110¹0.511.52slowest reduced pole ÷ dampingerror ÷ twice the first dropped σdoubled aboveshaded: a pole ten times slower than any of the system'sa slow pole is necessary, not sufficient
Fig. 2 Every reduction’s slowest pole over the damping, against its error over the reading. Shaded: a pole more than ten times slower than any of the full model’s.

The earlier essay’s failure came with a pole near the axis, and it is natural to make the pole the thing to test for: balanced truncation guarantees a stable reduced model and nothing about how stable, and a pole at 10−410^{-4} of the damping is a model that rings for ten thousand of the full model’s time constants. Thirty-two reductions in the census have a pole closer to the axis than a tenth of the damping. All ten doubled reductions are among them.

The other twenty-two are not doubled. Their errors run from 0.75 to 1.42 readings, and one of them has its slowest pole at 4.4⋅10−44.4\cdot 10^{-4} of the damping — slower than seven of the ten that doubled. Most sit at damping 0.5, where the modes are barely oscillatory and the σ no longer come in pairs, or at order eleven, where the cut drops a single σ and the reduced model can afford a slow pole whose residue is small. A pole near the axis is necessary for the failure in this census and nowhere near sufficient for it. A slow pole with a small residue contributes a narrow spike of small height; a slow pole with a large one is the failure. The pole locates the failure without measuring it, which is the same distinction a model that cannot be run drew for a reduced model whose construction had done exactly what it promised: the property a construction guarantees is not the property a user needed.

Which side to cut

What moving each tied cut one order down costs: the error with both tied states dropped over the error with one kept, against the damping, every tie in the census363 ties with an order below them. At dampings up to 0.3 the ratio's median is 1.010 and its largest 1.110; at 0.5 the largest is 2.47. The ten doubled cuts fall to 0.50, 0.50, 0.47, 0.48, 0.50, 0.46, 0.50, 0.50, 0.50, 0.50 of their error, and the cut below is never doubled and never has a near-integrator.one order down ÷ the tied cutworst, damping to 0.31.1worst, damping 0.52.5doubled cuts after0damping ratioerror one order down ÷ error at the tie0.0050.010.030.10.30.50.512doubled ties, halveddashed: no changeone state fewer, almost never worse
Fig. 3 For every tie with an order below it, the error with both tied states dropped over the error with one kept, against the damping. The larger dots are the ten doubled cuts.

Moving every tied cut one order down — dropping both members of the tie — is never doubled in the census and never leaves a near-integrator. Each of the ten doubled errors falls to between 0.46 and 0.50 of what it was, which is the reading: the doubled cuts were paying twice and the cut below pays once. On the 340 ties at dampings up to 0.3 the median cost of the move is one per cent and the worst eleven, because one order fewer is one singular value more dropped and at a tie that singular value is nearly equal to the one that was already being paid for.

At damping 0.5 the same move costs up to 2.47 times, on four of the twenty-three ties there by more than twelve per cent. At that damping the modes have stopped pairing, the σ fall without structure, and a gap that is small against its neighbours is no longer two modes’ values coinciding; it is one mode’s single value next to another’s, and dropping it drops a mode. The relative definition was built from lightly damped systems and it describes them. On heavily damped ones it flags cuts that need no flagging and the remedy is not free.

The error with both tied states kept over the error with both dropped, for ties inside one lightly damped mode's pair and ties between two modes198 ties whose gap is within thirty per cent of twice the damping, a mode's own pair: median ratio 0.495. 59 ties whose gap is under three tenths of twice the damping, values of two different modes: median 0.682, from 0.198 to 1.227. The cut above leaves a near-integrator 2 times and is never doubled.two states more ÷ noneinside one mode's pair, median0.49between two modes, median0.68error one order above ÷ error one order below0.20.51inside one mode's pairbetween two modesone dot per tiethe extra states buy a mode, or part of one
Fig. 4 For every tie with an order on each side, the error with both tied states kept over the error with both dropped: ties inside one mode’s own pair, and ties between the values of two different modes.

The cut above keeps both members of the tie, and it is safe too: never doubled, and two harmless near-integrators. What it buys over the cut below, at the price of two more states, depends on what kind of tie it is. Where the tie is a mode’s own pair — a gap within thirty per cent of 2ζ2\zeta — keeping both members keeps the whole mode, and the error halves: a median of 0.495 over 198 such ties. Where the tie is between two modes’ values the two extra states are half of each of two modes, and the median buys 0.68, anywhere from five times better to slightly worse.

So the rule the earlier essay hoped for has a direction. At a tie between two modes, cut below it: one state fewer than the tied cut, at most eleven per cent worse to damping 0.3, never doubled. If two more states are affordable, cut above it, and expect about a third off. Never cut inside it. That rule reads nothing but the singular values, which are in hand before any reduced model is built.

A check that needs no threshold

The reduction's error at zero frequency against its whole H-infinity error, both over twice the first dropped Hankel singular value, every reduction in the censusA zero-frequency error can only be at most the whole error, so every point is on or under the diagonal. All 10 doubled reductions have their largest error at zero frequency and sit on the diagonal; 10 reductions exceed one and a half readings at zero frequency, the same 10. The largest zero-frequency error of any other reduction is 1.42 readings.one evaluationflagged at zero frequency10doubled10largest other, readings1.400.511.5200.511.52whole error ÷ readingerror at zero frequency ÷ readingflag abovesolid diagonal: the whole error is at zero frequencythe doubled cuts announce themselves at ω = 0
Fig. 5 Every reduction’s error at zero frequency against its whole H∞ error, both over the reading. The diagonal is where the largest error is at zero frequency.

The relative definition has a threshold, a fifth, chosen by looking at where the doubled cuts fell, and a threshold chosen that way is a fit to this census. There is a test that has no threshold to fit. Every one of the ten doubled reductions has its largest error at zero frequency, ω=0\omega = 0 — the spike the earlier essay found, in every case — and so every one of them sits on the diagonal of this figure. And no other reduction has an error at zero frequency above 1.42 readings.

The error at zero frequency is one evaluation: H(0)=−CA−1BH(0) = -CA^{-1}B for the full model, the same for the reduced one, and their difference. A reduction that compares that number with 2σr+12\sigma_{r+1} and moves its cut down when the ratio is above one and a half catches all ten doubled reductions in the census and touches nothing else. It costs a solve with the full model’s state matrix, which a code that built the Gramians has already had to decompose, and it needs no definition of a tie at all.

It is narrower than the singular-value rule in one way that matters. It tests for the failure this census contains, which always lands at zero frequency because a near-integrator is a pole near the origin and its spike is centred there. A tie could misbehave elsewhere — a reduced pole pulled close to the axis at a resonance rather than at zero — and the check would not see it. In 1,452 reductions it did not happen, which is a measurement of these systems rather than a theorem about balanced truncation.

What a reduction code would do

A balanced truncation code chooses its order one of two ways: the user names it, or the solver takes the smallest order whose bound, twice the dropped σ summed, is under a tolerance. Both choose a cut without looking at the gap there, and the second is the more exposed, because a tolerance is crossed wherever the sum happens to cross it and the σ near a cluster are the slowly falling ones a sum crosses inside. On the earlier system at damping 0.1 a tolerance between 12.5 and 16.4 lands on order six, the doubled cut.

The census suggests three lines on top of either choice. After the order is chosen, compute the gap at the cut and the gaps beside it; if the cut is a tie and the damping is light, move it down one order. Then evaluate the error at zero frequency and compare it with twice the first dropped σ; if it is more than one and a half times that, move down again. And report the order actually used, since a user who named six and received five should know why. None of the three needs the reduced model’s frequency response, which is the expensive part of measuring a reduction, and the second needs no threshold that this census chose.

Two things the procedure does not do. It does not certify the reduced model’s stability margin, which half the conditions and a certificate showed is a property some reductions can prove and balanced truncation does not try to. And it does not make the order a statement about how reducible the system is: a condition number that is not the model’s found that the quantities a code has to hand while balancing say little about that, and a tie is one more place where the order a reduction picks reflects its own arithmetic rather than the system’s structure.

What the bound was saying all along

The bound that is known in advance introduced balanced truncation through its a priori bound, twice the sum of the dropped σ, and the doubled reductions do not violate it: at order six on the earlier system the bound is 12.5 and the error 7.13. What they violate is the reading the later essays found inside the bound, and the census says the reading’s failures are not scattered. They are one mechanism at one kind of cut. The state that is removed is not a mode warned that a balanced state is not a physical mode and its σ is not a mode’s size; a tie is where that warning bites, because the balancing transformation is not unique inside a tied pair’s span, and which combination the truncation keeps is decided by rounding rather than by the system. The product nobody had to form computed those σ to full relative accuracy; it is precisely their accuracy that makes a gap of 0.4 per cent visible and so makes a rule possible.

What twelve systems do not show

One family: six modes, logarithmically spaced, single input and output, random positive weights. The doubled cuts come from five of the twelve systems, so the census is enough to say what they share and too small to give a rate. Systems with modes clustered on purpose, multi-input systems whose σ come in larger groups, and dampings between 0.3 and 0.5 where the definition stops describing the systems are all unmeasured.

Still open: clusters on purpose, and where the definition stops

A cluster of modes. A periodic structure has several modes at nearly the same frequency, and every cut near the cluster is a cut near a tie. The prediction with a sign is that the doubled cuts become common there — more than one system in three, against five in twelve here with at most four doubled cuts each — and that the zero-frequency check still catches every one, because the mechanism is still a near-integrator.

Where the definition stops. The relative definition costs nothing to damping 0.3 and up to two and a half times at 0.5. Between the two the σ stop pairing, and somewhere there a gap small against its neighbours stops meaning two modes coinciding. Whether the crossover can be read from the σ themselves — from whether the values beside the cut still come in pairs split by about 2ζ2\zeta — is the measurement that would make the singular-value rule as safe as the zero-frequency check.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

Named objects

A flat tag is an object no other essay names yet.

A-priori boundBalanced truncationHankel singular valuesHinf normLyapunov equationReduced stabilityTransfer function