Performance - Best Computation Time
Computation Time |
|
|
time [sec] |
|
| drop tolerance |
Memory Requirement |
|
|
nz(L+U) ---------- nz(A) |
|
| drop tolerance |
| matrix size | 49,989 |
| number of nonzeros | 274,498 (5.5 per row on the average) |
| type | real symmetric indefinite matrix, right hand side provided |
| application area | Non-linear Optimization (IPOPT) |
| provided by | Olaf Schenk, University of Basel |
| Abbreviations for Preconditioners | |
|---|---|
| ILUPACK | inverse-based Multilevel ILU. Uses the concept of ARMS and an inverse based partial ILUC |
| ILUPACK - DEFAULT VERSION | medium Schur-complement used, less sensitive w.r.t. drop tolerances |
| ILUPACK - SIMPLE VERSION | simple Schur-complement used, more sensitive w.r.t. drop tolerances, but often faster if it works |
| IB-ILUC | inverse-based incomplete LU decomposition WITHOUT pivoting, based on the Crout version. The norm of the inverse triangular factors is included in the dropping strategy |
| PARDISO | sparse direct solver. For details see the PARDISO home page |
| Abbreviations for Orderings | |
|---|---|
| PP | new PP ordering for multilevel ILU |
| RCM | Reverse Cuthill-McKee |
| MMD | minimum degree |
| AMF | approximate inverse fill |
Performance - Best Computation Time |
|||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|
||||||||||||
Performance - Best Memory Requirement |
|||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|
||||||||||||
Performance - Most Robust Method |
|||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|
||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
|
|||||||||||||||||||||
