Rebreather World - View Single Post

**UWSojourner** · 25th June 2006, 01:49

In Baker's code he uses a search technique"RadiusRootFinder" to solve for the root of a cubic equation with coefficients A, B, C.

Is there a reason not to just solve it analytically? Are there conditions that cause the analytic solution to fail? Kinda new to VPM and was just wondering.

25th June 2006, 01:49	#1 (permalink)
UWSojourner Pacific Northwest Current Rebreather/s: Megalodon Other Rebreather/s: Join Date: Feb 2005 Location: Portland Oregon Posts: 558	VPM's "Radius Root Finder" In Baker's code he uses a search technique"RadiusRootFinder" to solve for the root of a cubic equation with coefficients A, B, C. Is there a reason not to just solve it analytically? Are there conditions that cause the analytic solution to fail? Kinda new to VPM and was just wondering.
(Offline)