OpenFrontiers
Join
← Back to the index
OP-11897Status unassessedAlgorithms and data structures

Reproducible parameterized linear-system benchmarks

Reproducible parameterized linear-system benchmarks. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

MSC 65F · Numerical linear algebra

Editorial MSC2020 mapping of Reproducible parameterized linear-system benchmarks. https://arxiv.org/html/2602.05394v3#S2.Thmproblem1 Not an author-supplied code.

Source question · editorial summaryAs of 2602.05394v3; current status unassessedSource & evidence ↓
Read original source ↗ 0Submit progressLean 4 ↓Discussion (0)

Problem statement

Build parameterized linear-system benchmark generators that combine practical relevance with instances amenable to rigorous analysis.

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.

Share a formalization →Verification guide ↗

Background

Editorial question summary. Consult the linked source for the complete model, assumptions and discussion.

Progress & source assessment

Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

References
  1. [1]Amsel, Noah; Baumann, Yves; Beckman, Paul; Bürgisser, Peter; Camaño, Chris; Chen, Tyler; Chow, Edmond; Damle, Anil; Derezinski, Michal; Embree, Mark; Epperly, Ethan N.; Falgout, Robert; Fornace, Mark; Greenbaum, Anne; Greif, Chen; Halikias, Diana; Huang, Zhen; Jarlebring, Elias; Koutis, Yiannis; Kressner, Daniel; Kyng, Rasmus; Liesen, Jörg; Lok, Jackie; Meyer, Raphael A.; Nakatsukasa, Yuji; Pearce, Kate; Peng, Richard; Persson, David; Rebrova, Eliza; Schneider, Ryan; Shah, Rikhav; Solomonik, Edgar; Srivastava, Nikhil; Townsend, Alex; Webber, Robert J.; Williams, Jess. Simons Workshop — Linear Systems and Eigenvalue Problems (2026).; Reproducible parameterized linear-system benchmarks linkIndependently written short question summaries and bibliographic pointers. No blanket redistribution license asserted for the original text.

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.