How to Install and Uninstall libmpfrcx1 Package on openSuSE Tumbleweed
Last updated: December 25,2024
1. Install "libmpfrcx1" package
Please follow the steps below to install libmpfrcx1 on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
libmpfrcx1
Copied
2. Uninstall "libmpfrcx1" package
Learn how to uninstall libmpfrcx1 on openSuSE Tumbleweed:
$
sudo zypper remove
libmpfrcx1
Copied
3. Information about the libmpfrcx1 package on openSuSE Tumbleweed
Information for package libmpfrcx1:
-----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libmpfrcx1
Version : 0.6.3-1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 86.0 KiB
Installed : No
Status : not installed
Source package : mpfrcx-0.6.3-1.7.src
Upstream URL : http://www.multiprecision.org/mpfrcx
Summary : Multi-precision floating-point interval arithmetic computation library
Description :
MPFRCX is a library for the arithmetic of univariate polynomials over
arbitrary precision real or complex numbers, without control on the
rounding.
The motivation for the library is to have functionality available for
the floating-point approach to complex multiplication.
Asymptotically-fast routines such as Toom–Cook and the FFT for
multiplication of polynomials are available, as well as fast routines
for interpolation and evaluation based on trees of polynomials.
-----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libmpfrcx1
Version : 0.6.3-1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 86.0 KiB
Installed : No
Status : not installed
Source package : mpfrcx-0.6.3-1.7.src
Upstream URL : http://www.multiprecision.org/mpfrcx
Summary : Multi-precision floating-point interval arithmetic computation library
Description :
MPFRCX is a library for the arithmetic of univariate polynomials over
arbitrary precision real or complex numbers, without control on the
rounding.
The motivation for the library is to have functionality available for
the floating-point approach to complex multiplication.
Asymptotically-fast routines such as Toom–Cook and the FFT for
multiplication of polynomials are available, as well as fast routines
for interpolation and evaluation based on trees of polynomials.