Opened 20 years ago

Closed 20 years ago

#4 closed enhancement (fixed)

improve efficency of least_squares algorithm for speed increase

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 duncan)

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 (9)

comment:1 Changed 20 years ago by ole

Milestone: AnuGA ready for release → least_squares module finished

comment:2 Changed 20 years ago by ole

Description: modified (diff)

comment:3 Changed 20 years ago by ole

Description: modified (diff)

comment:4 Changed 20 years ago by duncan

Description: modified (diff)
Summary: least_squares fit does not always use all datapoints → improve efficency of least_squares algorithm for speed increase

comment:5 Changed 20 years ago by duncan

Severity: normal → enhancement

comment:6 Changed 20 years ago by ole

Component: Compilation and installation → Efficiency and optimisation

comment:7 Changed 20 years ago by duncan

Status: new → assigned

The slowness occurs when expand_search is True and cropping is False. This can happen when you want to fit a mesh to grid points. There will be no values to the grid points outside of the mesh.

A solution would be to always crop and return the cropped points, so they aren't lost.

comment:8 Changed 20 years ago by duncan

Previous comment should've said interpolate, not fit.

comment:9 Changed 20 years ago by duncan

Resolution: → fixed
Status: assigned → closed

The same search algorithm is used. Cropping is now inforced, which means expand serach is not slow.

Note: See TracTickets for help on using tickets.