The degree. If the set of approximate real solution is empty, the problem will be solved again by increasing the order of variable. Default is 2.
The method to construct a square polynomial system when the original system is not square.
'fix' (default) fix variable(s) to construct.
'nullspace' use null vector to construct.
'regular' use method [construct_regular] to construct.
The function to decompose.
'full' AFPC_BB_moment will call function schur in MATLAB.
'partial' (default) call function laneig in PROPACK.
Use Barzilai-Borwein continuation technique in function AFPC_BB_moment. The choices are '0' or the default, '1'.
The rational number (<1) to determine how much to decrease μ at every step. Default is 1/4.
The ratio for computing the rank for next iteration. Default is 0.01.
The maximum number of iterations per inner loop. Default is 5000.
The variables are project. The choices are 'true' or the default, 'false'.
The maximum iterations to call probabilistic algorithm 'nullspaceConstruct'. Default is 5.
The tolerance, default is 1e-3.
Refine the sample roots. The choices are 'true' or the default, 'false'.
The method to construct a square polynomial system when the original system is not square.
'roots_exsitence' (default) use method 'construct_regular' to construct.
'each_component' use minor to construct.
If fail to obtain a verified root, use nonradical method to construct a new polynomial system to verify sample point again. The choices are 'true' or the default, 'false'.
The tolerance, default is 1e-7.
Refine the sample roots. The choices are 'true' or the default, 'false'.