Ports Search

GOBLIN is a C++ class library focussed on graph optimization and network programming problems. It deals with all of the standard graph optimization problems discussed by textbooks and in courses on combinatorial optimization. Today, GOBLIN provides strongly polynomial algorithms for the following graph optimization problems: - Shortest paths in graphs and digraphs with negative lengths. - Negative cycles and minimum mean cycles. - Strong and 2-connected components. - Minimum spanning trees, arborescences and 1-trees. - Maximum st-flows, feasible circulations and b-flows. - Min-cost st-flows, b-flows and circulations. - Assignment problems of any kind. - 1-matchings, b-matchings, capacitated b-matchings, f-factors and degree-constrained subgraphs. - Directed and undirected Chinese postman problems, T-joins. The library also includes methods for NP-hard problems, namely TSP, ATSP, stable sets and graph colouring.

Fityk is a program for nonlinear fitting of analytical functions (especially peak-shaped) to data (usually experimental data). There are also people using it only to display data or to remove baseline from data. It is reported to be used in crystallography, chromatography, photoluminescence, infrared and Raman spectroscopy and other fields. Fityk knows about common peak-shaped functions (Gaussian, Lorentzian, Voigt, Pearson VII, bifurcated Gaussian, EMG, Doniach-Sunjic, etc.) and polynomials. It also supports user-defined functions. Fityk offers intuitive graphical interface (and also command line interface), variouse optimization methods (standard Marquardt least-square algorithm, Genetic Algorithms, Nelder-Mead simplex), equality constraints, modelling error of x coordinate of points (eg. zero-shift of instrument), handling series of datasets, automation of common tasks with scripts, and more.

R and Eigen integration using Rcpp. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers and related algorithms. It supports dense and sparse matrices on integer, floating point and complex numbers, decompositions of such matrices, and solutions of linear systems. Its performance on many algorithms is comparable with some of the best implementations based on Lapack and level-3 BLAS. The RcppEigen package includes the header files from the Eigen C++ template library (currently version 3.2.2). Thus users do not need to install Eigen itself in order to use RcppEigen. Since version 3.1.1, Eigen is licensed under the Mozilla Public License (version 2); earlier version were licensed under the GNU LGPL version 3 or later. RcppEigen (the Rcpp bindings/bridge to Eigen) is licensed under the GNU GPL version 2 or later, as is the rest of Rcpp.

General purpose computer algebra system released under GPLv3. French documentation by Renee De Graeve is for non-commercial use only. The package consists of: - C++ library (libgiac). It is build on C and C++ libraries: PARI, NTL (arithmetic), CoCoA (Groebner basis), GSL (numerics), GMP (big integers), MPFR (bigfloats) and provides algorithms for basic polynomial operations (product, GCD) and symbolic computations (simplifications, limits/series, symbolic integration, summation, ...). The library can be configured to accept Maple or TI syntax to ease the transition for users of these systems. - Command line interpreter (icas or giac). It can be called from texmacs. - FLTK-based GUI (xcas). It is a GUI for symbolic computation with several modules added: 2-d and 3-d graphics, dynamic 2-d and 3-d geometry (exact or numeric), spreadsheet, programming environment.

The octave-forge package is the result of The GNU Octave Repositry project, which is intended to be a central location for custom scripts, functions and extensions for GNU Octave. contains the source for all the functions plus build and install scripts. This is interval. The interval package for real-valued interval arithmetic allows to evaluate functions over subsets of their domain. All results are verified, because interval computations automatically keep track of any errors. These concepts can be used to handle uncertainties, estimate arithmetic errors and produce reliable results. Also it can be applied to computer-assisted proofs, constraint programming, and verified computing. The implementation is based on interval boundaries represented by binary64 numbers and is conforming to IEEE Std 1788-2015, IEEE standard for interval arithmetic.

The Math::FFT module provides an interface to various Fast Fourier Transform (FFT) routines of the C routine of fft4g.c; The one-dimensional data sets, of size 2^n, are assumed to be sampled at a constant rate. The FFT methods available are - cdft: Complex Discrete Fourier Transform - rdft: Real Discrete Fourier Transform - ddct: Discrete Cosine Transform - ddst: Discrete Sine Transform - dfct: Cosine Transform of RDFT (Real Symmetric DFT) - dfst: Sine Transform of RDFT (Real Symmetric DFT) as well as their inverses. The C code for the FFT routines of fft4g.c is copyrighted 1996-99 by Takuya OOURA. The file arrays.c included here to handle passing arrays to and from C comes from the PGPLOT module of Karl Glazebrook <kgb@aaoepp.aao.gov.au>. The perl interface of the Math::FTT module is Copyright 2000 by Randy Kobes <randy@theoryx5.uwinnipeg.ca>, and may be distributed under the same terms as Perl itself.

The Numeric Extensions to Python give Python the number crunching power of numeric languages like Matlab and IDL while maintaining all of the advantages of the general-purpose programming language Python. These extensions add two new object types to Python, and then include a number of extensions that take advantage of these two new objects. * Multidimensional Array Objects + Efficient arrays of homogeneous machine types + Arbitrary number of dimensions + Sophisticated structural operations * Universal Function Objects + Supports mathematical functions on all python objects + Very efficient for Array Objects * Simple interfaces to existing numerical libraries: + Linear Algebra (LAPACK) + Fourier Transforms (FFTPACK) + Random Numbers (RANLIB) _____________ Note: Development for Numeric has ceased, and users should transisition to NumPy as quickly as possible.

SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.

This library of routines is part of a reference implementation for the Dense and Banded BLAS routines, along with their Extended and Mixed Precision versions, as documented in Chapters 2 and 4 of the new BLAS Standard. EXTENDED PRECISION is only used internally; the input and output arguments remain the same as in the existing BLAS. At present, we only allow Single, Double, or Extra internal precision. Extra precision is implemented as double-double precision (128-bit total, 106-bit significand). The routines for the double-double precision basic arithmetic operations +, -, *, / were developed by David Bailey. We have designed all our routines assuming that single precision arithmetic is actually done in IEEE single precision (32 bits) and that double precision arithmetic is actually done in IEEE double precision (64 bits). The routines also pass our tests on an Intel machine with 80-bit floating point registers. MIXED PRECISION permits some input/output arguments to be of different types (mixing real and complex) or precisions (mixing single and double).

`gnuls' is a port of the GNU colorized `ls' program--the one most Linux users are familiar with. The port installs four programs in `/usr/local/bin': `gnuls', `dir', `vdir' and `dircolors'. It also installs man pages for all four programs. See the individual man pages for details on each program. NOTES: 1. This port modifies the GNU `coreutils' make procedure so that it installs only programs and man pages listed above. In particular, it does not install the various GNU info files associated with the programs. 2. This port installs GNU's `ls' as `gnuls' so it won't conflict with the normal BSD `ls' program or the BSD `colorls' program (the latter available from the ports collection). 3. This colorized `ls' program is not the same as the `colorls' program available from the ports collection.