The following pages link to MPSolve (Q17438):
Displayed 14 items.
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial (Q1405573) (← links)
- Efficient isolation of polynomial's real roots. (Q1421215) (← links)
- Implementation of a near-optimal complex root clustering algorithm (Q1662242) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- Accurate computation of traffic workload distributions (Q2387755) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) (Q2574168) (← links)
- Empirical study of an evaluation-based subdivision algorithm for complex root isolation (Q2819634) (← links)
- Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (Q5462811) (← links)
- A generalized Beraha conjecture for non-planar graphs (Q5964111) (← links)