Timeline for Comparing iterative methods for linear systems
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 26, 2015 at 3:01 | answer | added | RoyS | timeline score: 1 | |
Nov 27, 2011 at 1:54 | comment | added | J. M. isn't a mathematician | Paul is correct, one can relate the characteristic polynomial of a tridiagonal Toeplitz matrix with the Chebyshev polynomials. | |
Nov 26, 2011 at 21:35 | comment | added | Paul Tupper | This is a tridiagonal symmetric Toeplitz matrix. There are explicit expressions for its eigenvectors and eigenvalues. For example, they are in Iserles' A First Course in the Numerical Analysis of Differential Equations. Is this for a course you are taking? | |
Nov 26, 2011 at 20:26 | comment | added | Dirk | Seems a little bit strange to use Gauß-Seidel or steepest descent, if there is en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm... | |
Nov 26, 2011 at 18:51 | comment | added | J. M. isn't a mathematician | You'll want to see www2.cs.cas.cz/semincm/lectures/2007-05-04-ng.pdf for instance. | |
Nov 26, 2011 at 18:31 | history | asked | user19431 | CC BY-SA 3.0 |