 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
 | It is requested that a mathematical diagramordiagramsbeincluded in this article to improve its quality. Specific illustrations, plots or diagrams can be requested at the Graphic Lab. For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images. |
 |
Daily pageviews of this article
A graph should have been displayed here but graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at pageviews.wmcloud.org
|
It seems that I deleted accidentally the category. It was a mistake. Mariostorti 15:32, 21 May 2006 (UTC)Reply
??? [xissburg 00:44, 23 March 2010 (UTC)] —Preceding unsigned comment added by Xissburg (talk • contribs)
There should be a diagram showing the quadratic form of a matrix with and without preconditioning and the path of an iterative solver in those cases. —Ben FrantzDale 22:17, 19 January 2007 (UTC)Reply
The statement about making quadratic form of a symmetric operator seems kinda redundant to me. Kallikanzarid (talk) 07:42, 22 February 2010 (UTC)Reply
I think that multiplying by preconditioners in a matrix free fashion is a detail that's not very important to understanding what a preconditioner is. It's a bit of a distraction and shouldn't be in the first paragraph. — Preceding unsigned comment added by 128.220.140.61 (talk) 23:07, 13 March 2013 (UTC)Reply
The page only speaks of preconditioning concerning matrix-related problems. What about "preconditioning"(?) arguments of power series to make them converge faster: I think of the classical algorithm to compute exp(x) by first dividing x by some power 2^k to make it small enough, then using a short power series to get exp(x/2^k), then squaring it k times. Isn't that also a type of preconditioning? Shouldn't it be mentioned here, or else, where more appropriately? — MFH:Talk 13:29, 26 June 2018 (UTC)Reply
