Anonymous | Login | Signup for a new account | 2024-11-24 14:25 MSK |
Main | My View | View Issues | Change Log | Roadmap | Docs |
Viewing Issue Simple Details [ Jump to Notes ] | [ View Advanced ] [ Issue History ] [ Print ] | ||||||
ID | Category | Severity | Reproducibility | Date Submitted | Last Update | ||
0000926 | [ALGLIB] Linear algebra | feature | have not tried | 2021-07-22 17:27 | 2021-08-28 22:42 | ||
Reporter | SergeyB | View Status | public | ||||
Assigned To | SergeyB | ||||||
Priority | normal | Resolution | implemented | ||||
Status | resolved | Product Version | |||||
Summary | 0000926: IMPLEMENTED: AMD ordering for matrices with dense rows | ||||||
Description |
Implemented new AMD ordering algorithm for matrices with dense/nearly dense rows, set as default one for sparse Cholesky/LDLT. Details: original AMD ordering algorithm has O(N^2) running time for a matrix with just one dense row. Improved algorithm postpones ordering of rows with too many nonzero elements (including ones which are not dense, but still has more nonzeros than typical row) and handles them later, at the second ordering round. |
||||||
Additional Information | |||||||
Programming language | Unspecified | ||||||
Attached Files | |||||||
|
There are no notes attached to this issue. |
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |