Anonymous | Login | Signup for a new account | 2025-06-22 15:28 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 | ||
0000024 | [ALGLIB] Interpolation | major | always | 2009-03-21 00:26 | 2009-07-23 12:36 | ||
Reporter | SergeyB | View Status | public | ||||
Assigned To | SergeyB | ||||||
Priority | normal | Resolution | fixed | ||||
Status | resolved | Product Version | |||||
Summary | 0000024: FIXED: Inefficient BuildChebyshevLeastSquaresConstrained | ||||||
Description |
Subroutine compexity must be O(N*M^2), but is O(N^2*M) which is much worse. Although it works correctly. This additional overhead is due to incorrect parameters passed to SVD decomposition subroutine (we need only M singular vectors, but whole N*N matrix was requested). |
||||||
Additional Information | |||||||
Programming language | Unspecified | ||||||
Attached Files | |||||||
|
There are no notes attached to this issue. |
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |