OpenFrontiers
← Back to the index
OP-10459Status unassessedAnalysis

A possible counterexample via FOM

Crouzeix's conjecture · AIMPL workshop record

Editorial mapping of AIMPL list topic: Crouzeix's conjecture. http://aimpl.org/crouzeix/ Not an author-supplied MSC code.

Workshop record · status unassessedAs of 2026-09-10 source snapshot; not a current-status certificationSource & evidence ↓

Problem statement

To extend the above inequality to a counterexample of Crouzeix's conjecture, one may try among other ideas to (1) find matrices AA where (most of) the prescribed Ritz values lie on the boundary of the field of values ; (2) numerically follow the influence of the chosen prescribed residual norm ∥rk∥\| r_k\| on the max of pkp_k for the field of values, with prescribed Ritz values.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Question context

The following inequality holds for FOM polynomials pFp^F when applying the method to a linear system Ax=bAx=b with bb a unit vector such that FOM does not break down at or before the kkth iteration:

0=2max⁡ρ∈Hk∣pkF(ρ)∣<∥rkF∥≤∥pkF(A)∥, 0=2\max_{\rho\in{\cal H}_k}|p_k^F(\rho)| < \| r_k^F\|\leq \|p_k^F(A)\|,

where Hk{\cal H}_k are the Ritz values for the kkth FOM iteration, pkFp_k^F is the corresponding FOM polynomial of degree at most kk with the value one in the origin and rkFr_k^F the residual vector. It is possible to construct matrices yielding {\em any} complex Ritz values
Hk{\cal H}_k while the corresponding residual norm takes {\em any} positive real value (in fact, infinity might be included).

Progress & source assessment

Dated source record, inspected 2026-09-10. Current status has not been independently reassessed. Source-reported results have not been independently verified.

The source supplies no separate status note for this question.

References
  1. [1]Crouzeix's conjecture · Original question link
  2. [2]AIMPL source bibliography link
  3. [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.