|
Mantis - ALGLIB
|
|||||
| Viewing Issue Advanced Details | |||||
|
|
|||||
| ID: | Category: | Severity: | Reproducibility: | Date Submitted: | Last Update: |
| 24 | Interpolation | major | always | 2009-03-21 00:26 | 2009-07-23 12:36 |
|
|
|||||
| Reporter: | SergeyB | Platform: | |||
| Assigned To: | SergeyB | OS: | |||
| Priority: | normal | OS Version: | |||
| Status: | resolved | Product Version: | |||
| Product Build: | Resolution: | fixed | |||
| Projection: | none | ||||
| ETA: | none | Fixed in Version: | 2.0 | ||
| Programming language: | Unspecified | ||||
|
|
|||||
| 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: | |||||
| Relationships | |||||
| Attached Files: | |||||
|
|
|||||
| Issue History | |||||
| Date Modified | Username | Field | Change | ||
| 2009-03-21 00:26 | SergeyB | New Issue | |||
| 2009-03-21 00:26 | SergeyB | Programming language | => Unspecified | ||
| 2009-03-21 00:26 | SergeyB | Status | new => assigned | ||
| 2009-03-21 00:26 | SergeyB | Assigned To | => SergeyB | ||
| 2009-03-21 00:26 | SergeyB | Status | assigned => resolved | ||
| 2009-03-21 00:26 | SergeyB | Fixed in Version | => Next minor release | ||
| 2009-03-21 00:26 | SergeyB | Resolution | open => fixed | ||
| 2009-04-20 09:43 | SergeyB | Summary | Inefficient BuildChebyshevLeastSquaresConstrained => FIXED: Inefficient BuildChebyshevLeastSquaresConstrained | ||
| 2009-04-20 09:47 | SergeyB | Target Version | => Upcoming release | ||
| 2009-07-23 12:36 | SergeyB | Category | => Interpolation | ||
| There are no notes attached to this issue. |