Linear Focus 3.2, optimize solution
ClosedPublic

Authored by murveit on Jan 31 2020, 4:25 AM.

Details

Summary

This change only affects the linear focus algorithm, and rev's it to 3.2.
Previously I've found that the algorithm finds solutions, but stops a little too early.
Now, once it finds a solution within tolerance, it will continue to focus-in and see if a better solution is available
if (a) the HFR has been decreasing, and (b) if the next step is less than the minimum position of the polynomial solution
found in the first pass, and (c) it is not near constraints like maximum number of steps or minimum focus position.

Test Plan

Basically it's running the linear focus algorithm with standard parameters (e.g. in the simulator with step size about 1000
starting from around 40000) and noticing that in the 2nd pass, depending on the samples, it does not take the first acceptable
solution if it's been decending and is not yet near the polynomial minimum.

Diff Detail

Repository
R321 KStars
Lint
Automatic diff as part of commit; lint not applicable.
Unit
Automatic diff as part of commit; unit tests not applicable.
murveit created this revision.Jan 31 2020, 4:25 AM
Restricted Application added a project: KDE Edu. · View Herald TranscriptJan 31 2020, 4:25 AM
Restricted Application added a subscriber: kde-edu. · View Herald Transcript
murveit requested review of this revision.Jan 31 2020, 4:25 AM
mutlaqja accepted this revision.Jan 31 2020, 6:36 AM
This revision is now accepted and ready to land.Jan 31 2020, 6:36 AM
This revision was automatically updated to reflect the committed changes.