| |
|
|
|
|
|
|
|
|
|
| Description: The term preconditioning comprises as set of techniques to modify a given system of linear equations such that its iterative solution is easier than the solution of the original system. Traditional algorithms for preconditioning are often inherently sequential. When designing parallel preconditioning algorithms, it is crucial to make sure that increasing the level of parallelism does not lead to a slower convergence behavior.
Audience:
Web page for latest course: Lecturer: Martin Bücker
Remarks: |
|
|
|
|
|
|
|