Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Conjugate gradient method
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Further reading== * {{cite book|first=Kendell A. |last=Atkinson |year=1988|title=An introduction to numerical analysis|url=https://archive.org/details/introductiontonu0000atki |url-access=registration |edition=2nd |chapter= Section 8.9|publisher= John Wiley and Sons| isbn= 978-0-471-50023-0}} * {{cite book|first=Mordecai|last= Avriel |year=2003|title=Nonlinear Programming: Analysis and Methods|publisher= Dover Publishing| isbn= 978-0-486-43227-4}} * {{cite book|first1=Gene H.|last1=Golub|first2= Charles F.|last2= Van Loan|title=Matrix Computations|edition=4th|chapter=Chapter 11|publisher=Johns Hopkins University Press| isbn=978-1-4214-0794-4|date=2013}} * {{cite book|first=Yousef|last=Saad|title=Iterative methods for sparse linear systems|chapter-url=https://archive.org/details/iterativemethods0000saad|chapter-url-access=registration|edition=2nd|chapter=Chapter 6|publisher=SIAM|isbn=978-0-89871-534-7|date=2003-04-01|url-access=registration|url=https://archive.org/details/iterativemethods0000saad}} * Gérard Meurant: "Detection and correction of silent errors in the conjugate gradient algorithm", Numerical Algorithms, vol.92 (2023), pp.869-891. url=https://doi.org/10.1007/s11075-022-01380-1 * {{Cite book|first1 =Gerard | last1 =Meurant |first2 =Petr | last2 =Tichy | date=2024|title =Error Norm Estimation in the Conjugate Gradient Algorithm |publisher=SIAM | isbn= 978-1-61197-785-1}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)