Algorithms for analyzable linear-system benchmark families
Algorithms for analyzable linear-system benchmark families. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
Editorial MSC2020 mapping of Algorithms for analyzable linear-system benchmark families. https://arxiv.org/html/2602.05394v3#S2.Thmproblem2 Not an author-supplied code.
Problem statement
For the parameterized benchmark families proposed in section 2, develop solvers with both rigorous performance guarantees and strong practical performance.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
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.
- [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).; Algorithms for analyzable linear-system benchmark families 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 recordedAttempts 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 notesNotes 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.