MPSolve

swMATH5298MaRDI QIDQ17438FDOQ17438

Author name not available (Why is that?)

Official website: http://www.dm.unipi.it/~ananum/polynomial.html

Cited In (19)

• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• New progress in real and complex polynomial root-finding
• Implementation of a near-optimal complex root clustering algorithm
• Empirical study of an evaluation-based subdivision algorithm for complex root isolation
• INTPAK
• na20
• na10
• Eigensolve
• A generalized Beraha conjecture for non-planar graphs
• Ccluster
• Accurate computation of traffic workload distributions
• Solving secular and polynomial equations: a multiprecision algorithm
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique
• Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial
• Efficient isolation of polynomial's real roots.
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications

This page was built for software: MPSolve