How to Install and Uninstall libranlip-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: July 25,2024

1. Install "libranlip-dev" package

This guide let you learn how to install libranlip-dev on Ubuntu 21.10 (Impish Indri)

$ sudo apt update $ sudo apt install libranlip-dev

2. Uninstall "libranlip-dev" package

This is a short guide on how to uninstall libranlip-dev on Ubuntu 21.10 (Impish Indri):

$ sudo apt remove libranlip-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libranlip-dev package on Ubuntu 21.10 (Impish Indri)

Package: libranlip-dev
Architecture: amd64
Version: 1.0-4.2build1
Priority: optional
Section: universe/libdevel
Source: libranlip
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 62
Depends: libc6 (>= 2.7), libstdc++6 (>= 5), libtnt-dev, libranlip1c2 (= 1.0-4.2build1)
Filename: pool/universe/libr/libranlip/libranlip-dev_1.0-4.2build1_amd64.deb
Size: 15304
MD5sum: 94e55e5a6030e550335580fd15bb0e46
SHA1: eb6bed879d59001f99ef8567fbb56291bb59dbd4
SHA256: ffed16251ee388d567f60b744e478b2902d059251c2724600084b47200ac5c87
SHA512: 5a8a480477ca51fe50d2907e2f742cb6fbcfe6835cfc0a26e4f748fc3b33ec2701f0addad8a1776ad4fbd511b3a265078cf0b71ab5f3f751aa08b9c38e6c06b1
Homepage: http://www.deakin.edu.au/~gleb/ranlip.html
Description-en: generates random variates with multivariate Lipschitz density
RanLip generates random variates with an arbitrary multivariate
Lipschitz density.
.
While generation of random numbers from a variety of distributions is
implemented in many packages (like GSL library
http://www.gnu.org/software/gsl/ and UNURAN library
http://statistik.wu-wien.ac.at/unuran/), generation of random variate
with an arbitrary distribution, especially in the multivariate case, is
a very challenging task. RanLip is a method of generation of random
variates with arbitrary Lipschitz-continuous densities, which works in
the univariate and multivariate cases, if the dimension is not very
large (say 3-10 variables).
.
Lipschitz condition implies that the rate of change of the function (in
this case, probability density p(x)) is bounded:
.
|p(x)-p(y)| .
From this condition, we can build an overestimate of the density, so
called hat function h(x)>=p(x), using a number of values of p(x) at some
points. The more values we use, the better is the hat function. The
method of acceptance/rejection then works as follows: generatea random
variate X with density h(x); generate an independent uniform on (0,1)
random number Z; if p(X)<=Z h(X), then return X, otherwise repeat all
the above steps.
.
RanLip constructs a piecewise constant hat function of the required
density p(x) by subdividing the domain of p (an n-dimensional rectangle)
into many smaller rectangles, and computes the upper bound on p(x)
within each of these rectangles, and uses this upper bound as the value
of the hat function.
Description-md5: 16e6dead1c9f1967dcaf2f4e023985e2