How to Install and Uninstall mpsolve-libs.i686 Package on Fedora 35
Last updated: November 26,2024
1. Install "mpsolve-libs.i686" package
In this section, we are going to explain the necessary steps to install mpsolve-libs.i686 on Fedora 35
$
sudo dnf update
Copied
$
sudo dnf install
mpsolve-libs.i686
Copied
2. Uninstall "mpsolve-libs.i686" package
This guide covers the steps necessary to uninstall mpsolve-libs.i686 on Fedora 35:
$
sudo dnf remove
mpsolve-libs.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the mpsolve-libs.i686 package on Fedora 35
Last metadata expiration check: 0:12:03 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : mpsolve-libs
Version : 3.2.1
Release : 8.fc35
Architecture : i686
Size : 188 k
Source : mpsolve-3.2.1-8.fc35.src.rpm
Repository : fedora
Summary : Multiprecision polynomial solver library
URL : https://numpi.dm.unipi.it/software/mpsolve
License : GPLv3+
Description : MPSolve stands for Multiprecision Polynomial SOLVEr. It aims to provide
: an easy to use universal blackbox for solving polynomials and secular
: equations.
:
: Its features include:
: - Arbitrary precision approximation.
: - Guaranteed inclusion radii for the results.
: - Exploiting of polynomial structures: it can take advantage of sparsity
: as well as coefficients in a particular domain (i.e. integers or
: rationals).
: - It can be specialized for specific classes of polynomials. As an
: example, the roots of the Mandelbrot polynomial of degree 2,097,151
: were computed in about 10 days on a dual Xeon server.
Available Packages
Name : mpsolve-libs
Version : 3.2.1
Release : 8.fc35
Architecture : i686
Size : 188 k
Source : mpsolve-3.2.1-8.fc35.src.rpm
Repository : fedora
Summary : Multiprecision polynomial solver library
URL : https://numpi.dm.unipi.it/software/mpsolve
License : GPLv3+
Description : MPSolve stands for Multiprecision Polynomial SOLVEr. It aims to provide
: an easy to use universal blackbox for solving polynomials and secular
: equations.
:
: Its features include:
: - Arbitrary precision approximation.
: - Guaranteed inclusion radii for the results.
: - Exploiting of polynomial structures: it can take advantage of sparsity
: as well as coefficients in a particular domain (i.e. integers or
: rationals).
: - It can be specialized for specific classes of polynomials. As an
: example, the roots of the Mandelbrot polynomial of degree 2,097,151
: were computed in about 10 days on a dual Xeon server.