How to Install and Uninstall liblip-dev Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 14,2024

1. Install "liblip-dev" package

This is a short guide on how to install liblip-dev on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                liblip-dev
            
                    
    
    Copied

2. Uninstall "liblip-dev" package

Please follow the guidance below to uninstall liblip-dev on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                liblip-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the liblip-dev package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: liblip-dev
Priority: optional
Section: universe/libdevel
Installed-Size: 297
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Architecture: amd64
Source: liblip
Version: 2.0.0-1.2
Depends: libc6 (>= 2.14), libgcc1 (>= 1:4.1.1), libstdc++6 (>= 4.1.1), libtnt-dev, liblip2 (= 2.0.0-1.2)
Filename: pool/universe/libl/liblip/liblip-dev_2.0.0-1.2_amd64.deb
Size: 63954
MD5sum: 8d746bea72f0f22b105e5acf590a0625
SHA1: 125d75e90bb97f3d5d5740e01976e28153b8477e
SHA256: 483ede38335cb8575e3bbc1eede860895a27982001f713b8de358fae614ca246
Description-en: reliable interpolation of multivariate scattered data
Lip interpolates scattered multivariate data with a Lipschitz function.
.
Methods of interpolation of multivariate scattered data are scarce.
The programming library Lip implements a
new method by G. Beliakov, which relies on building reliable lower and
upper approximations of Lipschitz functions. If we assume that the
function that we want to interpolate is Lipschitz-continuous, we can
provide tight bounds on its values at any point, in the worse case
scenario. Thus we obtain the interpolant, which approximates the unknown
Lipschitz function f best in the worst case scenario. This translates
into reliable learning of f, something that other methods cannot do (the
error of approximation of most other methods can be infinitely large,
depending on what f generated the data).
.
Lipschitz condition implies that the rate of change of the function is
bounded:
.
|f(x)-f(y)| .
It is easily interpreted as the largest slope of the function f. f needs
not be differentiable.
.
The interpolant based on the Lipschitz properties of the function is
piecewise linear, it possesses many useful properties, and it is shown
that it is the best possible approximation to f in the worst case
scenario. The value of the interpolant depends on the data points in the
immediate neigbourhood of the point in question, and in this sense, the
method is similar to the natural neighbour interpolation.
.
There are two methods of construction and evaluation of the interpolant.
The explicit method processes all data points to find the neighbours of
the point in question. It does not require any preprocessing, but the
evaluation of the interpolant has linear complexity O(K) in terms of the
number of data.
.
"Fast" method requires substantial preprocessing in the case of more
than 3-4 variables, but then it provides O(log K) evaluation time, and
thus is suitable for very large data sets (K of order of 500000) and
modest dimension (n=1-4). For larger dimension, explicit method becomes
practically more efficient. The class library Lip implements both fast
and explicit methods.
Description-md5: 4ee83e31f3d395f9f7925d0040a719d4
Homepage: http://www.deakin.edu.au/~gleb/lip.html
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu