# A solution to Meneguette's polynomial problem

Source: [A solution to Meneguette's polynomial problem](<https://www.sota2.com/research/paper/6a61a011ef5cfba72b49825e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-07-29T05:00:09.749Z

Authors: K. Castillo

Published: 2026-07-22T14:46:46.000Z

## Abstract

In 1979, Jeltsch \[Numer. Math. 32 (1979), 167-181\] conjectured that every zero-stable Brown method is stiffly stable. For Brown $(K,L)$ methods, Meneguette subsequently reduced the relevant $A\_0$-stability question to a zero-location property for a family of perturbed characteristic polynomials. A closely related perturbation question already appeared in his 1987 Oxford doctoral thesis, and he later posed a broader purely polynomial version of the problem in 1994 \[SIAM Review 36 (1994), 656-657\]. We provide a complete solution to Meneguette's polynomial problem.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2607.20226>)

[PDF](<https://arxiv.org/pdf/2607.20226.pdf>)
