Linear Systems and Eigenvalue Problems — Problem 16
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
In the conventional real symmetric interpretation, a symmetric positive definite linear system is \[ Ax=b,\qquad A\in{\mathbb{R}}^{n\times n},\quad b\in{\mathbb{R}}^n,\quad n\geq 1, \] where $A^{\mathsf T}=A$ and $v^{\mathsf T}Av>0$ for every nonzero $v\in{\mathbb{R}}^n$. The source does not explicitly specify the scalar domain; this real formulation is an interpretation requiring confirmation. CG denotes the conjugate gradient algorithm. Here the Lanczos algorithm is to be used as a method for solving the linear system, but the source does not specify how its iterates are constructed.Source question. Determine whether CG and Lanczos behave similarly in finite precision arithmetic when solving a symmetric positive definite linear system, using implementations satisfying the source's requirement of "standard good implementations" of both methods. Preserve the source's qualification that the answer depends on the implementations.
Unresolved formulation. The source does not define "behave similarly" or specify the implementations, the arithmetic model, initialization, stopping criteria, or quantifiers over systems and precision. Consequently, it supplies a research question rather than a fully specified mathematical proposition. A precise comparison requires these choices and a mathematical criterion for similarity; no particular criterion or universal equivalence assertion is imposed here.
Short English statement
The question asks whether conjugate gradient and Lanczos behave similarly when solving symmetric positive definite linear systems in finite precision. The answer is explicitly implementation dependent. The supplied record leaves both the comparison criterion and the meaning of "standard good implementations" unspecified, so a precise theorem or counterexample target requires further formulation.Sources
- Local UnsolvedMath registry: permanent ID $800507$, exact source problem code
catalogue entry, title Linear Systems and Eigenvalue Problems --- Problem 16. The registry attributes the record to Amsel, Baumann et al., with proposed year 2026, and labels itopen. This is a supplied status label, not an independently verified mathematical assessment. - Supplied source: Amsel, Baumann et al., Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop (2026), Problem 16, https://arxiv.org/abs/2602.05394. The supplied background records access on 2026-10-16 and extraction by
arxiv_latex; these are supplied provenance statements, not independently verified access or source verification.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.