The authors describe their package MARS for solving nonlinear polynomial systems of equations, the theoretical basis behind it and implementation issues. The polynomial system is reduced to a sparse eigenvalue problem, using Sylvester/Macaulay and Bézout type matrices. In the implementation, the symbolic part of the computation is performed by MAPLE, and the numerical linear algebra and general programming tasks by MATLAB and C. The paper gives some details, on how the theoretical concepts were implemented and concludes with some examples.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Zhang, Qinghai; Fogelson, Aaron: MARS: an analytic framework of interface tracking via mapping and adjusting regular semialgebraic sets (2016)
- Özmen, A.; Kropat, E.; Weber, G.-W.: Spline regression models for complex multi-modal regulatory networks (2014)
- Verschelde, Jan: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation (1999)
- Gloor, Oliver (ed.): Proceedings of the 1998 international symposium on symbolic and algebraic computation, ISSAC ’98, Rostock, Germany, August 13--15, 1998 (1998)
- Wallack, Aaron; Emiris, Ioannis Z.; Manocha, Dinesh: MARS: A MAPLE/MATLAB/C resultant-based solver (1998)