Viewing Issue Advanced Details
[ Jump to Notes ]
|
[ View Simple ]
[ 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 |
Platform |
|
Status |
resolved |
|
OS |
|
Projection |
none |
|
OS Version |
|
ETA |
none |
Fixed in Version |
2.0 |
Product Version |
|
|
Target Version |
2.0 |
Product Build |
|
|
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). |
Steps To Reproduce |
|
Additional Information |
|
|
Programming language |
Unspecified |
|
Attached Files |
|
|