Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
92 tokens/sec
Gemini 2.5 Pro Premium
46 tokens/sec
GPT-5 Medium
27 tokens/sec
GPT-5 High Premium
22 tokens/sec
GPT-4o
87 tokens/sec
DeepSeek R1 via Azure Premium
98 tokens/sec
GPT OSS 120B via Groq Premium
465 tokens/sec
Kimi K2 via Groq Premium
226 tokens/sec
2000 character limit reached

Operator Coefficient Methods for Linear Equations (1203.2390v1)

Published 12 Mar 2012 in math.NA

Abstract: New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high order recurrence formulas with scalars for coefficients, as in truncated orthomin, or have 1st order recurrence formulas with matrix polynomials for coefficients, as in restarted gcr/gmres. The new methods include both: high order recurrence formulas and matrix polynomials for coefficients. These methods provide a trade-off between recurrence order and polynomial degree that can be exploited to achieve greater efficiency. Convergence results are obtained for both constant coefficient and varying coefficient methods.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to a collection.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube