The eigenvalue problem that is not linear

The middle root has no neighbour to lean on

A quartic matrix polynomial's four groups of eigenvalues, up to eight decades apart, were all kept by two scaled reductions of its companion pencil — the trailing one at the second tropical root for the lower pair, the leading one at the third for the upper pair. For a quintic the same pair was predicted to keep the middle group as well up to six decades, and to fail at eight, making the quintic the first polynomial that needs three. The pair keeps the four outer groups to six decades on both families, as predicted, and never keeps the middle group at all — not at eight decades, six, four or even two. Scaled at the middle root, both end coefficients shrink together, as 10 to the minus three times the separation, so every reduction that inverts one end of the pencil is far from the middle. Where the middle group is kept, it is by a reduction centred on it: on the structured family the leading reduction at the third root keeps it at every separation, and with the scaled trailing one that makes two routes again — not the predicted two. On the generic family none of thirteen routes keeps it at four or six decades.

Worth reading first: A matrix that depends on its own eigenvalue · The scaling that buys ten orders · The exact answer to a nearby problem.

An interior root needs its own scaling followed a family of matrix polynomials up in degree. A quadratic with two groups of eigenvalues far apart needed two reductions of its companion pencil, one per group; a cubic’s middle group, unexpectedly, needed none of its own; and a quartic’s four groups, up to eight decades apart, were all kept by two reductions once each was scaled at the right tropical root — the trailing reduction scaled at the second root for the lower two groups, the leading reduction scaled at the third for the upper two.

Its last section asked what a fifth group does. “A quintic’s five groups need the second root’s trailing reduction for the lowest two, the fourth root’s leading reduction for the top two, and something for the middle group at the third root. The prediction with a sign is that at six decades between groups either of the two scaled reductions keeps the middle group to 10−1010^{-10}, so that two still suffice at degree five, and that at eight decades neither does, so that a quintic at that separation is the first polynomial that needs three.”

The first half of that holds and the second half is not the question. The pair keeps the outer four, and it never keeps the middle.

Thirteen ways to reduce one pencil

The quintics are built as the quartics were. Each is P(λ)=∑k=05AkλkP(\lambda) = \sum_{k=0}^{5} A_k\lambda^k with 4×44 \times 4 coefficients U diag(ck) VTU\,\mathrm{diag}(c_k)\,V^{\mathsf T}, where the four diagonal entries are scalar quintics whose roots sit near 10−2a10^{-2a}, 10−a10^{-a}, 11, 10a10^{a} and 102a10^{2a}, so the twenty eigenvalues come in five groups of four, aa decades apart. The generic family adds to each coefficient an independent random matrix of three tenths of its norm, which keeps the groups and destroys the diagonal structure. Five seeds each, at a=2,4,6a = 2, 4, 6 and 8.

The tropical roots are read off the coefficients’ norms, τk=∥Ak∥/∥Ak+1∥\tau_k = \|A_k\|/\|A_{k+1}\|, and they sit at the five groups. Every eigenvalue is assigned to a group by the geometric midpoints between consecutive tropical roots and scored by its backward error as an eigenvalue of PP. The pencil is the first companion form, a 20×2020 \times 20 pair λX+Y\lambda X + Y whose first block row holds the coefficients. A reduction turns it into an ordinary eigenvalue problem by inverting one side: the leading reduction inverts XX, which holds A5A_5; the trailing reduction inverts YY, which holds A0A_0. Each can be done on the polynomial as given or after scaling λ=τkμ\lambda = \tau_k\mu at any of the five tropical roots, which makes ten routes and two unscaled ones; six routes to one spectrum is where this family of routes was first laid side by side. A thirteenth inverts neither end and is described below.

Which of thirteen reductions of a quintic matrix polynomial's companion pencil keep each of its five groups of eigenvalues at 6 decades between groups, structured and generic families, with the backward error at which each route returns all four of a group's eigenvalues, worst over five seeds, as a power of tenstructured: lowest group kept by trailing, unscaled, trailing, root 1, trailing, root 2, trailing, root 3; second group kept by trailing, root 2; middle group kept by leading, unscaled, leading, root 3; fourth group kept by leading, unscaled, leading, root 3, leading, root 4; top group kept by leading, unscaled, leading, root 3, leading, root 4, leading, root 5. generic: lowest group kept by trailing, unscaled, trailing, root 1, trailing, root 2, trailing, root 3; second group kept by trailing, root 2; middle group kept by no route; fourth group kept by leading, root 4; top group kept by leading, unscaled, leading, root 3, leading, root 4, leading, root 5. A cell is shaded where the route returns all four of the group's eigenvalues with backward error under ten to the minus ten on every seed.6 decades between groupsroutes keeping the middle, structured2routes keeping the middle, generic0structuredlowestsecondmiddlefourthtopleading, unscaled0−1−12−10−15trailing, unscaled−10−4−5−10leading, root 10−2−2−1−4trailing, root 1−15−1000leading, root 20−100−4trailing, root 2−15−10−100leading, root 30−1−12−10−15trailing, root 3−13−7−5−10leading, root 400−1−10−15trailing, root 4−10−100leading, root 50000−15trailing, root 5−10000shifted, third root0−2−100genericlowestsecondmiddlefourthtop0−1−1−1−15−10−2−1−10−1−1−10−2−11−10000−100−2−15−11−1000−1−1−1−15−10−2−1−1000−1−11−15−10−1000000−15−100000−1−2−10shaded: all four under 10⁻¹⁰ on five seedsthe middle has the fewest routes
Fig. 1 For each family at one separation, which of thirteen routes keep each group: a cell is shaded where the route returns all four of the group’s eigenvalues with backward error under 10−1010^{-10} on every seed, and the number is that error’s power of ten, the worst over five seeds. The dial sets the separation.

At six decades the map is a staircase for the outer groups. The lowest group is kept by every trailing reduction scaled at or below the middle root and by the unscaled trailing reduction; the second only by the trailing reduction at the second root; the fourth only by the leading reduction at the fourth root, or on the structured family also by those centred lower; the top by every leading reduction scaled at or above the middle. That is the quartic’s pattern, one group further out at each end. The middle column is nearly empty: on the structured family two routes keep it, the unscaled leading reduction and the leading reduction at the third root; on the generic family none does.

The predicted pair, and the middle it misses

The prediction named two routes and asked them to keep all five groups between them.

The prediction's two scaled reductions on the four outer groups of the generic quintic, backward error at which each returns all four of a group's eigenvalues, worst over five seeds, against the decades between groupslowest, trailing at root 2: 4e-16 at 2, 2e-15 at 4, 9e-16 at 6, 5e-16 at 8; second, trailing at root 2: 1e+0 at 2, 5e-13 at 4, 6e-12 at 6, 2e-13 at 8; fourth, leading at root 4: 9e-15 at 2, 1e-13 at 4, 1e-11 at 6, 8e-14 at 8; top, leading at root 4: 1e-15 at 2, 1e-15 at 4, 7e-16 at 6, 1e-1 at 8.246810⁻¹⁶10⁻¹⁴10⁻¹²10⁻¹⁰10⁻⁸10⁻⁶10⁻⁴10⁻²1decades between groupsworst backward errorlowest, trailing at root 2second, trailing at root 2fourth, leading at root 4top, leading at root 4generic family · dotted: 10⁻¹⁰the outer pairs are kept
Fig. 2 The predicted pair on the generic family’s four outer groups: the trailing reduction at the second root on the lowest and second groups, the leading reduction at the fourth root on the fourth and top groups, against the separation. The dotted line is 10−1010^{-10}.

On the outer four they do what the quartic’s pair did. The lowest group comes back at 10−1510^{-15} at every separation, the second at 5⋅10−135 \cdot 10^{-13} to 6⋅10−126 \cdot 10^{-12} from four decades, the fourth at 8⋅10−148 \cdot 10^{-14} to 10−1110^{-11}, the top at 10−1510^{-15} — until eight decades, where the top group is lost by every route on both families. To six decades the prediction’s pair is exactly the quartic’s pair moved out by one root.

The backward error at which four reductions of a quintic matrix polynomial's companion pencil return all four eigenvalues of its middle group, worst over five seeds, against the decades between groups, structured and generic familiesstructured, trailing, root 2: 1e-9 at 2, 2e-2 at 4, 2e-1 at 6, 2e-1 at 8; generic, trailing, root 2: 2e-9 at 2, 1e-2 at 4, 2e-1 at 6, 2e-1 at 8; structured, leading, root 4: 4e-9 at 2, 7e-2 at 4, 3e-1 at 6, 3e-1 at 8; generic, leading, root 4: 2e-8 at 2, 7e-2 at 4, 2e-1 at 6, 3e-1 at 8; structured, leading, root 3: 1e-13 at 2, 2e-12 at 4, 2e-12 at 6, 8e-13 at 8; generic, leading, root 3: 9e-14 at 2, 4e-2 at 4, 5e-2 at 6, 2e-1 at 8; structured, shifted, root 3: 3e-15 at 2, 2e-15 at 4, 8e-2 at 6, 3e-15 at 8; generic, shifted, root 3: 2e-15 at 2, 6e-2 at 4, 3e-2 at 6, 1e-15 at 8. The dotted line is ten to the minus ten.246810⁻¹⁶10⁻¹⁴10⁻¹²10⁻¹⁰10⁻⁸10⁻⁶10⁻⁴10⁻²1decades between groupsmiddle group's backward errortrailing, root 2leading, root 4leading, root 3shifted, root 3filled: structured · open: genericthe prediction's pair never keeps it
Fig. 3 The backward error at which four routes return all four of the middle group’s eigenvalues, the worst over five seeds, against the separation: structured family filled, generic open. The dotted line is 10−1010^{-10}.

The middle group is another matter. The trailing reduction at the second root returns it at 10−910^{-9} at two decades and at 10−210^{-2} to 2⋅10−12 \cdot 10^{-1} from four; the leading reduction at the fourth root at 4⋅10−94 \cdot 10^{-9} to 2⋅10−82 \cdot 10^{-8} at two decades and 7⋅10−27 \cdot 10^{-2} or worse from four. Neither keeps it to 10−1010^{-10} at any separation, on either family. The prediction expected them to hold the middle to six decades and lose it at eight; they lose it from the start, and by four decades they return eigenvalues for it that are no eigenvalues of the polynomial at all.

Both ends shrink at once

Why the pair fails is visible in the coefficients before any eigenvalue is computed. Scaling at a tropical root makes the two coefficients that meet there the largest, and pushes every other one down by its distance from the root. At an outer root that leaves one end of the pencil large and the other tiny, and the reduction that inverts the large end is well conditioned. At the middle root it does something different.

Each coefficient of the structured quintic scaled at its middle tropical root, as a share of the largest, at two, four, six and eight decades between groups2 decades: A0 1e-6, A1 1e-2, A2 1e+0, A3 1e+0, A4 1e-2, A5 1e-6; 4 decades: A0 1e-12, A1 1e-4, A2 1e+0, A3 1e+0, A4 1e-4, A5 1e-12; 6 decades: A0 1e-18, A1 1e-6, A2 1e+0, A3 1e+0, A4 1e-6, A5 1e-18; 8 decades: A0 1e-24, A1 1e-8, A2 1e+0, A3 1e+0, A4 1e-8, A5 1e-24. The leading reduction inverts the block holding the fifth coefficient and the trailing one the block holding the zeroth.01234510⁻²⁵10⁻²⁰10⁻¹⁵10⁻¹⁰10⁻⁵1coefficient k‖Aₖ‖τᵏ over the largest2 decades4 decades6 decades8 decadesscaled at the middle tropical rootboth ends vanish at once
Fig. 4 Each coefficient of the structured quintic scaled at its middle tropical root, as a share of the largest, at each separation.

Scaled at the middle root, A2A_2 and A3A_3 are the largest and both ends fall together: A0A_0 and A5A_5 are each 10−610^{-6} of the largest at two decades, 10−1210^{-12} at four, 10−1810^{-18} at six and 10−2410^{-24} at eight — ten to the minus three times the separation, on both sides. Compare the roots the pair is scaled at. At the second root the trailing reduction inverts the block holding A0A_0, and there A0A_0 is 10−a10^{-a} of the largest — 10−410^{-4} at four decades, 10−610^{-6} at six — while A5A_5 is 10−6a10^{-6a}; at the fourth root the leading reduction inverts A5A_5 at 10−a10^{-a} while A0A_0 is 10−6a10^{-6a}. Each of the pair stands one separation from the end it inverts and five from the other. At the middle root both ends are three separations away. Inverting a small block is not itself the trouble — the block here is a scaled orthogonal matrix and inverts exactly — but the reduced matrix then has a norm 103a10^{3a} times the middle group’s size, and an eigensolver’s error is a few units of roundoff of that norm: at four decades, 10−410^{-4} of a middle eigenvalue, at six, more than all of it. A reduction scaled anywhere else is centred on another group and reaches the middle across even more. The quartic never met this: its two interior roots each have one large neighbour on the side away from the middle, and the quartic’s interior groups could lean on it. A quintic’s middle root has two equal neighbours and no outer one to lean on.

The middle group needs no reduction of its own found the cubic’s middle group kept by the leading reduction, because at three groups the middle root’s distance to the top was one separation and the leading reduction could reach it. At five groups the distance is two separations each way, and the measurement says that is too far for a pencil reduced from either end.

Two routes, but not those two

On the structured family a route centred on the middle does keep it. The leading reduction scaled at the third root returns the middle group at 10−1310^{-13} at two decades, 2⋅10−122 \cdot 10^{-12} at four and six, and 8⋅10−138 \cdot 10^{-13} at eight; the unscaled leading reduction does the same, because the middle root here is near one. And the same route keeps the fourth and top groups too.

The fewest reductions of a quintic matrix polynomial's companion pencil that between them keep every group of eigenvalues that any reduction keeps, and the groups that none keeps, for both families at each separationstructured, 2 decades: leading, root 1; structured, 4 decades: leading, unscaled and trailing, root 2; structured, 6 decades: leading, unscaled and trailing, root 2; structured, 8 decades: leading, unscaled and trailing, root 2; top kept by none; generic, 2 decades: leading, unscaled and trailing, unscaled; second kept by none; generic, 4 decades: trailing, root 2 and leading, root 4; middle kept by none; generic, 6 decades: trailing, root 2 and leading, root 4; middle kept by none; generic, 8 decades: trailing, root 2 and leading, root 4 and shifted, third root; top kept by none.fewest routes keeping every keepable groupkept by nonestructured, 2 decadesleading, root 1—structured, 4 decadesleading, unscaledtrailing, root 2—structured, 6 decadesleading, unscaledtrailing, root 2—structured, 8 decadesleading, unscaledtrailing, root 2topgeneric, 2 decadesleading, unscaledtrailing, unscaledsecondgeneric, 4 decadestrailing, root 2leading, root 4middlegeneric, 6 decadestrailing, root 2leading, root 4middlegeneric, 8 decadestrailing, root 2leading, root 4shifted, third roottopover thirteen routes, every subset triedtwo, but not the predicted two
Fig. 5 For each family and separation, the fewest routes that between them keep every group any route keeps — every subset of the thirteen tried — and the groups that no route keeps.

So the structured quintic needs two routes at four and six decades after all: the trailing reduction at the second root for the lower two groups and the leading reduction at the middle root for the upper three. Not the predicted two — the prediction’s leading reduction at the fourth root keeps the upper pair but not the middle, and the middle root’s leading reduction keeps all three. At eight decades the same two keep four groups and the top group is kept by none. The prediction’s “first polynomial that needs three” is the right count for the wrong reason: what makes two enough or not is whether the upper route is centred on the middle, not the separation.

On the generic family nothing is centred well enough. At four and six decades no route of the thirteen keeps the middle group: the middle root’s own leading reduction returns it at 4⋅10−24 \cdot 10^{-2} and 5⋅10−25 \cdot 10^{-2}, where the same route on the structured family returned 2⋅10−122 \cdot 10^{-12}. The measurement shows the difference and does not explain it. One reading fits the numbers: the structured quintic’s reduced matrix, for all its 103a10^{3a} norm, is graded — its large entries sit in the block that holds the large coefficients, in a pattern the Francis iteration’s deflation can follow — and graded matrices are the case where an eigensolver beats its own normwise error bound by many digits. The generic family’s random parts put a few per cent of every coefficient into every entry, which is exactly what removes grading. That is a reading, not a measurement. The generic family’s random parts couple the groups through every coefficient, and whether that makes the middle group’s eigenvalues worse conditioned or only harder to reach by a reduction is the next question rather than this one’s answer. A perturbation that moves every coefficient is the reminder that the backward error reported here is of that unstructured kind: it lets every coefficient move, and it is small or large for the polynomial as a whole.

For a code that has to choose its routes from the tropical roots alone, before any eigenvalue is computed, the map offers no single rule. On the structured family, centring the upper route on the middle root rather than the fourth keeps every group to six decades with two reductions. On the generic family the same choice is worse than the prediction’s: the middle root’s leading reduction returns the fourth group at 10−710^{-7} at four decades and 6⋅10−26 \cdot 10^{-2} at six, where the fourth root’s kept it at 10−1310^{-13} and 10−1110^{-11}, and it keeps the middle no better. There the predicted pair is the best pair available and still leaves the middle group to something that is not a reduction from an end.

A reduction that inverts neither end

The thirteenth route was built to test the reading. Write the pencil as (λ−σ)X+(Y+σX)(\lambda - \sigma)X + (Y + \sigma X) and invert the combination Y+σXY + \sigma X, which holds every coefficient and is well conditioned wherever σ\sigma is not an eigenvalue: the eigenvalues ν\nu of (Y+σX)−1X(Y + \sigma X)^{-1}X give λ=σ−1/ν\lambda = \sigma - 1/\nu. It is the shift-and-invert step of every sparse eigensolver, applied once. Scaled at the middle root, with σ\sigma one unit to the side away from the middle group’s four eigenvalues, it inverts neither end.

It keeps the middle group at 2⋅10−152 \cdot 10^{-15} at two decades and 10−1510^{-15} at eight on the generic family, where no reduction from an end keeps it; and at two, four and eight on the structured family. It fails on the generic family at four and six decades, at 6⋅10−26 \cdot 10^{-2} and 3⋅10−23 \cdot 10^{-2}, and on the structured at six. So it is not a cure, and its failures fall where the plain reductions fail too; but it is the only route that ever keeps the generic middle group, which says the obstacle at eight decades was the inversion of an end and not the group itself. The number that moves when the problem does priced a backward error that is a property of the route rather than of the polynomial; the middle group’s is one of those.

What the prediction carried over

The scaling that buys ten orders introduced tropical scaling as the device that equalises the two coefficients a group of eigenvalues depends on, and every essay since has used it to choose where to centre a reduction. This one finds its limit at the middle of an odd number of groups: the scaling does equalise the middle two coefficients, and equalising them is no help to a reduction that has to invert something else.

The prediction treated the quintic as the quartic with one more group, and asked how far the quartic’s two routes would stretch. That was the right question for the four outer groups, and they stretch exactly as far as the quartic’s did, to six decades and through eight for three of them. For the middle group it was the wrong frame. The quartic’s routes each served a pair of groups that shared a side of the spectrum; the quintic’s middle group shares a side with neither pair, and a route centred on an outer root reaches it only across the full width of the coefficients’ range. Two groups need two reductions found the same thing at degree two, where the two groups were the two ends: a group is kept by the route centred on it, and the cubic’s exception was that its middle root was near enough to an end.

A backward-stable answer to a problem nobody asked is the warning that applies to the generic family’s middle group at four and six decades: every route returns twenty eigenvalues, the pencil’s backward error is small for each of them, and four of them are not eigenvalues of the polynomial to better than a few per cent. The grouping and the polynomial’s own backward error are what say so.

What ten quintics do not show

Five seeds a family and four separations make a map, not a law, and the map’s corners are noisy: at two decades the groups crowd each other and the midpoint grouping misplaces some eigenvalues, which is why the generic family’s second group shows as kept by no route there, and the shifted reduction’s failures at four and six decades may owe as much to where σ\sigma lands as to anything about the middle group. The structured and generic families differ in more than one way at once. At eight decades the top group is lost by every route on both families, the leading reduction scaled at its own root included, at backward errors of a few tenths; the coefficients’ norms there run from about 2 at both ends to 7⋅10247 \cdot 10^{24} in the middle, and the top group sits sixteen decades above the middle root. Whether that loss is the reductions’, the backward error’s own evaluation at ∣λ∣≈1016|\lambda| \approx 10^{16}, or the group’s, is not settled by anything here, and it is the one result in the map that the essays before this one would not have predicted either. And the reductions here are all to ordinary eigenvalue problems; the QZ algorithm, which works on the pencil without inverting either side, is the route a library would use, and it is not measured.

Still open: the generic middle, and the pencil whole

Conditioning or reach. The generic middle group is lost by every reduction at four and six decades. The prediction with a sign is that its eigenvalue condition numbers, computed from left and right eigenvectors of PP at the eigenvalues the structured route would return, are within a factor of a hundred of the structured family’s — so that the loss is the reductions’ reach and not the group’s sensitivity, and a route that does not invert an end would keep it at every separation.

The pencil whole. The QZ algorithm on the scaled pencil inverts nothing. The prediction is that one QZ run on the pencil scaled at the middle root keeps all five groups of the structured quintic to 10−1210^{-12} at every separation up to six decades, and the generic quintic’s four outer groups and its middle one, so that at degree five the number of routes needed is one, and the count that grew from one to two between the quadratic and the quartic was a property of reductions rather than of polynomials.

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.

Backward errorCompanion formLinearisationMatrix polynomialScalingTropical roots