Project

General

Profile

Slug #907

Updated by Anna Maria Bigatti almost 7 years ago

While "playing" with a demo of sparse squares, I noticed that @ApproxSolve@ is strangely slow on this example (while being much faster on other similar examples produced during the run)

<pre>
use QQ[a[0..7],x];
sys := [
a[6]^2 +2*a[5]*a[7] +2*a[3] +2*a[4],
2*a[5]*a[6] +2*a[4]*a[7] +2*a[2] +2*a[3],
a[5]^2 +2*a[4]*a[6] +2*a[3]*a[7] +2*a[1] +2*a[2],
2*a[4]*a[5] +2*a[3]*a[6] +2*a[2]*a[7] +2*a[0] +2*a[1],
2*a[3]*a[4] +2*a[2]*a[5] +2*a[1]*a[6] +2*a[0]*a[7],
a[3]^2 +2*a[2]*a[4] +2*a[1]*a[5] +2*a[0]*a[6],
2*a[2]*a[3] +2*a[1]*a[4] +2*a[0]*a[5],
a[2]^2 +2*a[1]*a[3] +2*a[0]*a[4],
2*a[1]*a[2] +2*a[0]*a[3],
a[0]*x -1
];
solns := ApproxSolve(sys);
[[FloatStr(z) | z in SolnPt] | SolnPt in solns];
</pre>
*2016-07* added ApproxSolveTF ApproxSolve2 using TwinFloats

Back