Opened 20 years ago
Last modified 19 years ago
#4 closed enhancement
improve efficency of least_squares algorithm for speed increase — at Version 4
| Reported by: | ole | Owned by: | duncan |
|---|---|---|---|
| Priority: | normal | Milestone: | least_squares module finished |
| Component: | Efficiency and optimisation | Version: | |
| Severity: | normal | Keywords: | |
| Cc: | ole |
Description (last modified by )
Arrange quad tree algorithm so that all datapoints contribute to interpolation matrix A, without having to set the expand search flag to true.
Currently this is fixed by expand search but that can be very slow. Need e.g. algorithm for searching neighbouring treenodes.
Change History (4)
comment:1 Changed 20 years ago by
| Milestone: | AnuGA ready for release → least_squares module finished |
|---|
comment:2 Changed 20 years ago by
| Description: | modified (diff) |
|---|
comment:3 Changed 20 years ago by
| Description: | modified (diff) |
|---|
comment:4 Changed 20 years ago by
| Description: | modified (diff) |
|---|---|
| Summary: | least_squares fit does not always use all datapoints → improve efficency of least_squares algorithm for speed increase |
Note: See
TracTickets for help on using
tickets.
