Kursledare: Axel Ruhe
Datorpostadress: ruhe@nada.kth.se
Studiehandbokstexten på svenska
och engelska.
| 14:15 |
Dag Lindbo |
Multigrid for linear systems |
| 14:30 |
Oana Marin |
Regularization in image processing |
| 14:45 |
||
| Time |
Names |
Subject |
| Time |
Names |
Subject |
| 13:15 |
||
| 13:30 |
Hilda Sundström |
Compare lanso and eigs |
| 13:45 |
Kenneth Duru, Emmanuel Doro |
Pseudospectra |
| 14:15 |
Zhu Xueyu, Mikael Stöckli |
Laplace matrix
for graph partitioning |
| 14:30 |
Huang Xuejun |
Regularization
for image processing |
| 14:45 |
| Time | Names | Subject |
| 13:15 |
Gaël Dubus, Mathieu Scotto | Fields of values and closest normal matrix |
| 13:40 |
Katharina Wagner, Anne Lebhardt | Information retrieval with SVD |
| Meeting |
Text |
Contents |
|
| 1 |
Tuesday Oct 25, 13:15-15
in D4523 |
D 2.2, 2.2.1 |
Linear Systems: Perturbations, relative
perturbations |
| 2 |
D 2.4.2, 2.4.3 |
Rounding errors in Gaussian elimination,
Condition estimation |
|
| 3 |
Wednesday Nov 2, 10:15-12 in D4523 |
D 6.6.1 L4.2.1 |
Krylov subspaces: Arnoldi algorithm, eigenvalues
and linear systems |
| 4 |
D 7.2, D 5.2 L4.2.2 E 4.4 |
Symmetric matrices: Lanczos algorithm, Ritz
approximations, perturbation theory, Courant Fischer minimax |
|
| 5 |
Wednesday, Nov 9, 13:15-15 in D4523 |
D 7.3-4 E 4.4.2-4 |
Lanczos algorithm: Convergence and orthogonality |
| 6 |
D 6.6.2-3 L 5.1-2 |
Krylov subspaces, linear systems: Conjugate
gradient algorithm |
|
| 7 |
Monday Nov 14, 10:15-12 in D4523 |
D 6.6.4-5 L 5.3 |
CG: convergence and preconditioning |
| 8 |
D 6.6.6 |
Linear systems: Further developments, GMRES, QMR |
|
| 9 |
Wednesday Nov 23, 13:15-15 in D4523 |
E4.4.3, E 4.5 |
Eigenvalues: Spectral transformation, implicit
restart |
| 10 |
Computing the SVD: Bidiagonalization, bidiagonal
SVD |
||
| 11 |
Wednesday Nov 30, 13:15-15 in D4523 |
D 5.3.3 |
Large tridiagonal matrices: Divide and Conquer,
Relative Robust Representation |
| 12 |
Wednesday, Dec 7, 13:15-15 in D4523 |
Large SVD: Hubs and authorities on the web The largest matrix eigenvalue problem: The Google matrix |
|
| 13 |
| Nr |
Task and comments |
People |
| 1 |
Recursive BLAS for fastest parallel linear
systems |
|
| 2 |
Preconditioned iterations for large linear
systems |
|
| 3 |
Multigrid for linear systems Demmel Q
6.16 |
Dag Lindbo |
| 4 |
Regularization for image processing, the
L-curve Look at works of Per
Christian Hansen,
Copenhagen, especially his Matlab toolbox regtools
and its use for smooth regression by Michael Wendland. |
Oana Marin, Huang Xuejun |
| 5 |
Information retrieval with SVD Study
Latent semantic indexing LSI,
and
the Krylov space variant developed with Katarina Blom. Matlab routines
are available. |
Katharina Wagner, Anne Lebhardt |
| 6 |
Sensitivity of eigenvalues, pseudospectrum
The pseudospectrum
is used by L N
Trefethen, and people in France under the name spectral
portraits. Do Demmel Q 4.14 eigscat.m |
Kenneth Duru, Emmanuel Doro |
| 7 |
Compare lanso and eigs Lanczos with
selective orthogonalization, lanso, and implicit restart Arnoldi, eigs.
Etemplates 4.4.4. |
Hilda Sundström |
| 8 |
Lanczos with Cullum's device Etemplates
4.4.4 |
|
| 9 |
Jacobi Davidson for eigenvalues
Etemplates 4.7. |
|
| 10 |
Jacobi is better than QR, high relative
precision Demmel 5.3.5 and 5.4.3. Read original article J. Demmel and K. Veselic, Jacobi’s method is
more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204–1245 |
|
| 11 |
Fields of values and closest normal matrix Read
my article
Test Matlab implementation by Higham in The Matrix Computation Toolbox |
Gaël Dubus, Mathieu Scotto |
| 12 |
Simultaneous diagonalization of several
matrices |
Askar Beishenaliev |
| 13 |
Laplace matrix for graph partitioning Alex Pothen uses the
second eigenvector
of the Laplace matrix of a graph for partitioning. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning
sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal.
Appl.,
11:430--452, 1990 Study works by Karypis |
Zhu Xueyu, Michael Stöckli |
| 14 |
Geometry and eigenvalues Demmel Q 4.16. |
M'hamed Begdadi |
Upp till Nadas
kurser.