The problems that are to be numerically computed in science and technology are often high dimensional, millions of unknowns is not exceptional. To facilitate efficient computations, these problems are projected onto low dimensional spaces. The low dimensional projected problems should provide accurate approximations to the solution of the original high-dimensional problems. The low dimensional space, the so-called search subspace, is expanded until the extracted approximation is sufficiently accurate. Fundamental question are how to find effective expansion vectors and how to extract to best information from the projected problem. Stability and efficiency issues play an important role. Solution methods of this type are GMRES and Bi-CGSTAB for linear systems of equations and Arnoldi and Jacobi-Davidson for eigenvalue problems. In this seminar, we will also study more complicated problems that can be solved with similar approaches.
|
Prof. Dr. H.A. van der Vorst and Dr. G.L.G. Sleijpen |
Seminar. Each of the particpants will give a presentation on one or more research papers and will actively participate with the presentation of the other particpants. If you sign in for the seminar then it is obligatory to attend all talks. (Be prepared to get an additional assigment if you mis a talk.) There are two rounds of talks. Each of the participants will give a presentation of 45 minutes in each of the rounds. (There are some guidelines for preparing a talk.) |
Not only the quality of the presentations determines the grade but also the intesity of participation during the presentation by the other students. |
Most of the papers that will be studied in the seminar have been published and are available on internet (a link for some of the papers that are not easy to find will be provided on this page) or can be obtained via this page (see below). |
The first meeting is Wednesday, February 4, at 13h15 in room 611B of the Wiskunde Gebouw. This meeting is for exchanging information; the talks will be scheduled and guidelines will be discussed.
The next meetings are on wednesdays
|