Chemical equilibrium systems as numerical test problems
ACM Transactions on Mathematical Software (TOMS)
Homotopies exploiting Newton polytopes for solving sparse polynomial systems
SIAM Journal on Numerical Analysis
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
Preconditioning Highly Indefinite and Nonsymmetric Matrices
SIAM Journal on Scientific Computing
Normwise Scaling of Second Order Polynomial Matrices
SIAM Journal on Matrix Analysis and Applications
Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
SIAM Journal on Scientific Computing
The Conditioning of Linearizations of Matrix Polynomials
SIAM Journal on Matrix Analysis and Applications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimization Methods & Software - GLOBAL OPTIMIZATION
Meta heuristics for dependent portfolio selection problem considering risk
Expert Systems with Applications: An International Journal
Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
SIAM Journal on Matrix Analysis and Applications
GloMIQO: Global mixed-integer quadratic optimizer
Journal of Global Optimization
| Hi-index | 0.00 |
Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of scale in one or more variable may have drastic effects on the robustness of subsequent calculations. This paper surveys scaling algorithms for systems of polynomials from the literature, and discusses some new ones, applicable to arbitrary polynomial constraint satisfaction problems.