{"count":51960,"next":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=568","previous":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=566","results":[{"name":"m4ri","portdir":"math/m4ri","version":"20250128","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/malb/m4ri","description":"Successor to PolyBoRi","long_description":"Successor to PolyBoRi","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["libpng"]}],"depends_on":[{"type":"lib","ports":["BRiAl"]}]},{"name":"lp_solve_java","portdir":"math/lp_solve","version":"5.5.2.11","license":"LGPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpsolve.sourceforge.net/5.5/","description":"Java library for Linear Programming Solver","long_description":"Java library for Linear Programming Solver","active":true,"categories":["math"],"maintainers":[{"name":"ryandesign","github":"ryandesign","ports_count":2085}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"extract","ports":["unzip"]}],"depends_on":[]},{"name":"lrslib","portdir":"math/lrslib","version":"7.3","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://cgm.cs.mcgill.ca/~avis/C/lrs.html","description":"self-contained ANSI C implementation of the reverse search algorithm for vertex enumeration/convex hull problems","long_description":"self-contained ANSI C implementation of the reverse search algorithm for vertex enumeration/convex hull problems","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["gmp"]}],"depends_on":[{"type":"lib","ports":["latte-int","polymake","sympol"]}]},{"name":"lp_solve","portdir":"math/lp_solve","version":"5.5.2.11","license":"LGPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpsolve.sourceforge.net/5.5/","description":"Linear Programming Solver","long_description":"Mixed Integer Linear Programming (MILP) solver. lp_solve solves pure linear, (mixed) integer/binary, semi-continuous and special ordered sets (SOS) models.","active":true,"categories":["math"],"maintainers":[{"name":"ryandesign","github":"ryandesign","ports_count":2085}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[{"type":"lib","ports":["shogun","shogun-devel","syncha"]}]},{"name":"lis","portdir":"math/lis","version":"2.0.30","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.ssisc.org/lis/index.en.html","description":"a parallel software library for solving linear equations and eigenvalue problems","long_description":"Lis (Library of Iterative Solvers for linear systems, pronounced [lis]) is a parallel software library for solving linear equations and eigenvalue problems that arise in the numerical solution of partial differential equations using iterative methods.","active":true,"categories":["science","math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"extract","ports":["unzip"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[{"type":"lib","ports":["gerris"]}]},{"name":"linalg","portdir":"math/linalg","version":"1.8.2","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/jchristopherson/linalg","description":"Linear algebra library that provides a user-friendly interface to several BLAS and LAPACK routines","long_description":"Linear algebra library that provides a user-friendly interface to several BLAS and LAPACK routines","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["libgcc","OpenBLAS","qrupdate"]}],"depends_on":[]},{"name":"libtommath","portdir":"math/libtommath","version":"1.3.0","license":"public-domain","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.libtom.net/LibTomMath/","description":"Comprehensive, modular and portable mathematical routines","long_description":"LibTomMath provides highly optimized and portable routines for a vast majority of integer based number theoretic applications (including public key cryptography).","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"extract","ports":["xz"]}],"depends_on":[{"type":"build","ports":["libtomcrypt"]},{"type":"lib","ports":["bitkeeper","MoarVM","tcl9","convertlit"]}]},{"name":"libtifiles2","portdir":"math/libtifiles2","version":"1.1.7","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tilp/","description":"TILibs","long_description":"Utility libraries for TI related apps","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18","autoconf","automake","libtool","pkgconfig"]},{"type":"lib","ports":["libarchive","zlib","gettext","glib2","libticonv"]}],"depends_on":[{"type":"lib","ports":["gfm","libticables2","libticalcs2","tiemu3","tilp2"]}]},{"name":"libticonv","portdir":"math/libticonv","version":"1.1.5","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tilp/","description":"TILibs","long_description":"Utility libraries for TI related apps","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18","automake","libtool","pkgconfig","autoconf"]},{"type":"lib","ports":["libusb-compat","libiconv","glib2"]}],"depends_on":[{"type":"lib","ports":["gfm","libticables2","libticalcs2","libtifiles2","tiemu3","tilp2"]}]},{"name":"libticalcs2","portdir":"math/libticalcs2","version":"1.1.9","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tilp","description":"TILibs","long_description":"Utility libraries for TI related apps","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","pkgconfig","clang-18"]},{"type":"lib","ports":["zlib","libtifiles2","gettext","glib2","libticables2","libticonv"]}],"depends_on":[{"type":"lib","ports":["gfm","tiemu3","tilp2"]}]},{"name":"py313-libsvm","portdir":"math/libsvm","version":"3.36","license":"BSD","platforms":"{darwin any}","epoch":3,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/libsvm/","description":"Python 3.13 bindings for libsvm","long_description":"This package provides Python 3.13 modules for libsvm.","active":true,"categories":["math","python"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["libsvm","py313-numpy","py313-scipy"]}],"depends_on":[]},{"name":"py312-libsvm","portdir":"math/libsvm","version":"3.36","license":"BSD","platforms":"{darwin any}","epoch":3,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/libsvm/","description":"Python 3.12 bindings for libsvm","long_description":"This package provides Python 3.12 modules for libsvm.","active":true,"categories":["math","python"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["libsvm","py312-numpy","py312-scipy"]}],"depends_on":[]},{"name":"py311-libsvm","portdir":"math/libsvm","version":"3.36","license":"BSD","platforms":"{darwin any}","epoch":3,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/libsvm/","description":"Python 3.11 bindings for libsvm","long_description":"This package provides Python 3.11 modules for libsvm.","active":true,"categories":["math","python"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["libsvm","py311-numpy","py311-scipy"]}],"depends_on":[]},{"name":"py310-libsvm","portdir":"math/libsvm","version":"3.36","license":"BSD","platforms":"{darwin any}","epoch":3,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/libsvm/","description":"Python 3.10 bindings for libsvm","long_description":"This package provides Python 3.10 modules for libsvm.","active":true,"categories":["math","python"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["libsvm","py310-numpy","py310-scipy"]}],"depends_on":[]},{"name":"libticables2","portdir":"math/libticables2","version":"1.3.5","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tilp/","description":"TILibs","long_description":"Utility libraries for TI related apps","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18","autoconf","automake","libtool","pkgconfig"]},{"type":"lib","ports":["glib2","libticonv","libtifiles2","gettext"]}],"depends_on":[{"type":"lib","ports":["gfm","libticalcs2","tiemu3","tilp2"]}]},{"name":"libsvm","portdir":"math/libsvm","version":"3.36","license":"BSD","platforms":"darwin","epoch":3,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/libsvm/","description":"A free Support Vector Machine implementation","long_description":"A free Support Vector Machine implementation By Chih-Chung Chang and Chih-Jen Lin of National Taiwan University. \"LIBSVM is an integrated software for support vector classification, (C-SVC, nu-SVC), regression (epsilon-SVR, nu-SVR) and distribution estimation (one-class SVM). It supports multi-class classification.\"","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["python27"]},{"type":"run","ports":["kaffe"]}],"depends_on":[{"type":"lib","ports":["py27-pymvpa","py35-pymvpa","py36-pymvpa","grass","py37-pymvpa","orfeotoolbox","py310-orfeotoolbox","py311-orfeotoolbox","py312-orfeotoolbox","py313-orfeotoolbox","py314-orfeotoolbox","py38-pymvpa","py310-libsvm","py311-libsvm","py312-libsvm","py313-libsvm","php53-svm","php54-svm","php55-svm","php56-svm","php70-svm","php71-svm","php72-svm","php73-svm","php74-svm","php80-svm","php81-svm","php82-svm","php83-svm","php84-svm","php85-svm","py312-pymvpa"]}]},{"name":"libranlib","portdir":"math/libranlib","version":"1.0","license":"Restrictive/Distributable and Noncommercial","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://netlib.org/random/","description":"Library of Routines for Random Number Generation","long_description":"This library provides routines that return: Beta random deviates, Chi-square random deviates, Exponential random deviates, F random deviates, Gamma random deviates, Multivariate normal random deviates (mean and covariance matrix specified), Noncentral chi-square random deviates, Noncentral F random deviates, Univariate normal random deviates, Random permutations of an integer array, Real uniform random deviates between specif, Binomial random deviates, Negative Binomial random deviates, Multinomial random deviates, Poisson random deviates, Integer uniform deviates between specified limits and Seeds for the random number generator calculated from a character string.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"libqalculate","portdir":"math/libqalculate","version":"5.9.0","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/qalculate/libqalculate","description":"libqalculate is math libary for expression evaluation with units, variables and functions support and CAS functionality.","long_description":"libqalculate is math libary for expression evaluation with units, variables and functions support and CAS functionality. This library directly supports the GUI interface qalculate-gtk or qalculate-kde.","active":true,"categories":["math"],"maintainers":[{"name":"jjstickel","github":"jjstickel","ports_count":143},{"name":"judaew","github":"judaew","ports_count":655}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-20","autoconf","automake","gettext","libtool","pkgconfig","doxygen","intltool"]},{"type":"lib","ports":["gmp","icu","mpfr","readline","curl","libiconv","libxml2","gettext-runtime"]}],"depends_on":[{"type":"lib","ports":["cantor","kde4-workspace","step","qalculate-gtk","qalculate-qt"]}]},{"name":"libpetanque","portdir":"math/libpetanque","version":"1.1.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/quarkslab/arybo","description":"Library that helps manipulate symbolic boolean expressions","long_description":"Manipulation, canonicalization and identification of mixed boolean-arithmetic symbolic expressions.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]}],"depends_on":[]},{"name":"libmatheval","portdir":"math/libmatheval","version":"1.1.11","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.gnu.org/software/libmatheval/","description":"in-memory tree representations of mathematical functions","long_description":"GNU libmatheval is comprised of several procedures that make it possible to create in-memory tree representations of mathematical functions over single or multiple variables and later use them to evaluate function for specified variable values, to create a corresponding tree for function derivatives over a specified variable, or to print a textual representation of the in-memory tree to a specified string. The library supports arbitrary variable names in expressions, decimal constants, basic unary and binary operators, and elementary mathematical functions.","active":true,"categories":["devel","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18","guile-1.8"]},{"type":"lib","ports":["flex"]}],"depends_on":[{"type":"lib","ports":["h5utils"]}]},{"name":"liblinear","portdir":"math/liblinear","version":"2.47","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.csie.ntu.edu.tw/~cjlin/liblinear/","description":"A simple package for solving large-scale regularized linear classification.","long_description":"LIBLINEAR is a simple package for solving large-scale regularized linear classification. It currently supports L2-regularized logistic regression/L2-loss support vector classification/L1-loss support vector classification, and L1-regularized L2-loss support vector classification/ logistic regression.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["python311","clang-18"]},{"type":"lib","ports":["python27"]}],"depends_on":[]},{"name":"liblbfgs","portdir":"math/liblbfgs","version":"2021.04.12","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.chokkan.org/software/liblbfgs","description":"A library of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS)","long_description":"libLBFGS is a C port of the implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]}],"depends_on":[{"type":"lib","ports":["crfsuite"]}]},{"name":"libgpuarray","portdir":"math/libgpuarray","version":"0.7.6","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/Theano/libgpuarray","description":"Library to manipulate tensors on the GPU.","long_description":"Library to manipulate tensors on the GPU.","active":true,"categories":["devel","math"],"maintainers":[{"name":"stromnov","github":"stromnov","ports_count":2896}],"variants":["debug"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","clang-18"]}],"depends_on":[{"type":"lib","ports":["py27-pygpu","py35-pygpu","py36-pygpu","py37-pygpu"]}]},{"name":"libflame","portdir":"math/libflame","version":"2024.05.20","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/flame/libflame","description":"LAPACK-like library for dense matrix computations","long_description":"libflame is a portable library for dense matrix computations, providing much of the functionality present in LAPACK. This is a counterpart for blis implementation of BLAS.","active":true,"categories":["math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[]},{"name":"py310-faiss","portdir":"math/libfaiss","version":"1.7.3","license":"BSD","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://github.com/facebookresearch/faiss","description":"Python 3.10 bindings for Efficient similarity search library from Facebook AI Research.","long_description":"This package provides Python 3.10 bindings, modules, and scripts.","active":true,"categories":["math","python"],"maintainers":[{"name":"hoss","github":"beauby","ports_count":5},{"name":"matthijs","github":"mdouze","ports_count":5}],"variants":["debug","openblas","universal"],"dependencies":[{"type":"build","ports":["swig","swig-python","py310-setuptools","clang-18","cmake"]},{"type":"lib","ports":["libomp","OpenBLAS","python310","py310-numpy"]},{"type":"test","ports":["py310-pytest"]}],"depends_on":[{"type":"run","ports":["py310-transformers","py310-photomosaic"]}]},{"name":"libfixmath","portdir":"math/libfixmath","version":"2023.08.08","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/PetteriAimonen/libfixmath","description":"Q16.16 format fixed point operations in C","long_description":"Q16.16 format fixed point operations in C","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"libfaiss","portdir":"math/libfaiss","version":"1.7.3","license":"BSD","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://github.com/facebookresearch/faiss","description":"Efficient similarity search library from Facebook AI Research.","long_description":"Library for efficient similarity search and clustering of dense vectors. It contains algorithms that search in sets of vectors of any size, up to ones that possibly do not fit in RAM. It also contains supporting code for evaluation and parameter tuning. Faiss is written in C++ with complete wrappers for Python/numpy. Some of the most useful algorithms are implemented on the GPU.","active":true,"categories":["math"],"maintainers":[{"name":"hoss","github":"beauby","ports_count":5},{"name":"matthijs","github":"mdouze","ports_count":5}],"variants":["debug","openblas","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["libomp","OpenBLAS"]}],"depends_on":[]},{"name":"libcerf","portdir":"math/libcerf","version":"3.3","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://jugit.fz-juelich.de/mlz/libcerf","description":"Library for complex error functions","long_description":"The libcerf library is a self-contained numeric library that provides an efficient and accurate implementation of complex error functions, along with Dawson, Faddeeva, and Voigt functions.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[{"type":"lib","ports":["gnuplot"]}]},{"name":"libKriging","portdir":"math/libKriging","version":"0.8.3","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/libKriging/libKriging","description":"Kriging library for performance and wide language support","long_description":"Kriging library for performance and wide language support","active":true,"categories":["math"],"maintainers":[],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","universal"],"dependencies":[{"type":"build","ports":["pkgconfig","gcc15","clang-20","cmake"]},{"type":"fetch","ports":["git"]},{"type":"lib","ports":["hdf5","armadillo","libgcc"]}],"depends_on":[]},{"name":"levmar","portdir":"math/levmar","version":"2.6","license":"GPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.ics.forth.gr/~lourakis/levmar/","description":"Levenberg-Marquardt nonlinear least squares algorithm","long_description":"levmar is a native ANSI C implementation of the Levenberg-Marquardt optimization algorithm. Both unconstrained and constrained (under linear equations, inequality and box constraints) Levenberg-Marquardt variants are included. The LM algorithm is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. When the current solution is far from the correct on, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge. When the current solution is close to the correct solution, it becomes a Gauss-Newton method.","active":true,"categories":["math"],"maintainers":[{"name":"tlockhart1976","github":"lockhart","ports_count":27}],"variants":["universal","atlas"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["atlas"]}],"depends_on":[]},{"name":"lean","portdir":"math/lean","version":"3.51.1","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/leanprover-community/lean","description":"The Lean theorem prover.","long_description":"A fork of Lean 3 maintained and updated by the Lean community. Lean is a functional programming language that makes it easy to write correct and maintainable code. You can also use Lean as an interactive theorem prover.","active":true,"categories":["math"],"maintainers":[{"name":"","github":"kakuhen","ports_count":9}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","ninja","clang-18"]},{"type":"lib","ports":["gmp"]}],"depends_on":[]},{"name":"lda-d","portdir":"math/lda-d","version":"0.2","license":"unknown","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://chasen.org/~daiti-m/dist/lda/","description":"a Latent Dirichlet Allocation package","long_description":"lda-d is a Latent Dirichlet Allocation (LDA) package made by Daichi Mochihashi.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"latte-int","portdir":"math/latte-int","version":"1.7.6","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.math.ucdavis.edu/~latte/","description":"LattE integrale, software for counting lattice points and integration over convex polytopes","long_description":"LattE integrale, software for counting lattice points and integration over convex polytopes","active":true,"categories":["math"],"maintainers":[],"variants":["experimental","universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-20"]},{"type":"lib","ports":["LiDIA","cddlib","lrslib","TOPCOM","gmp","ntl","4ti2"]}],"depends_on":[]},{"name":"lda-c","portdir":"math/lda-c","version":"20080413","license":"GPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.cs.princeton.edu/~blei/lda-c/","description":"a C implementation of latent Dirichlet allocation (LDA)","long_description":"LDA-C is a C implementation of latent Dirichlet allocation (LDA) made by David M. Blei.","active":true,"categories":["math"],"maintainers":[],"variants":["universal","sample"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"lapack","portdir":"math/lapack","version":"3.12.1","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.netlib.org/lapack/","description":"Linear Algebra PACKage","long_description":"LAPACK is written in Fortran 90 and provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems.","active":true,"categories":["devel","science","math"],"maintainers":[{"name":"takeshi","github":"tenomoto","ports_count":54},{"name":"dave.allured","github":"Dave-Allured","ports_count":10}],"variants":["accelerate","debug","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","openblas","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[{"type":"lib","ports":["gr-adapt","gr37-adapt"]}]},{"name":"laspack","portdir":"math/laspack","version":"1.12.2","license":"Noncommercial","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.mgnet.org/mgnet/Codes/laspack/html/laspack.html","description":"Package for solving large sparse systems of linear equations","long_description":"LASPack is a package for solving large sparse systems of linear equations like those which arise from discretization of partial differential equations.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"kalker","portdir":"math/kalker","version":"2.2.2","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/PaddiM8/kalker","description":"Kalker (or kalk) is a calculator that supports user-defined variables, functions, derivation, and integration.","long_description":"Kalker (or kalk) is a calculator that supports user-defined variables, functions, derivation, and integration.","active":true,"categories":["math"],"maintainers":[{"name":"smanojkarthick","github":"manojkarthick","ports_count":10},{"name":"herby.gillot","github":"herbygillot","ports_count":1056}],"variants":["universal"],"dependencies":[{"type":"build","ports":["cargo","legacy-support","m4","rust","clang-20"]},{"type":"lib","ports":["libunwind"]}],"depends_on":[]},{"name":"lambda","portdir":"math/lambda","version":"0.1.4","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://66.47.116.75/~demo/lambda/","description":"A lambda calculus interpreter","long_description":"Lambda is a lambda calculus interpreter. It also will convert lambda expression into the combinators S, K, and I.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"kalc","portdir":"math/kalc","version":"1.5.1","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/bgkillas/kalc","description":"a complex numbers, 2d/3d graphing, arbitrary precision, vector, matrix, tui calculator with real-time output","long_description":"a complex numbers, 2d/3d graphing, arbitrary precision, vector, matrix, tui calculator with real-time output","active":true,"categories":["math"],"maintainers":[{"name":"herby.gillot","github":"herbygillot","ports_count":1056}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-20","autoconf","automake","cargo","legacy-support","m4","rust"]},{"type":"lib","ports":["libunwind"]}],"depends_on":[]},{"name":"k3dsurf","portdir":"math/k3dsurf","version":"0.6.2","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://k3dsurf.sourceforge.net/","description":"Multidimensional surface visualizer","long_description":"K3DSurf is a program to visualize and manipulate multidimensional surfaces by using mathematical equations. It's also a modeler for POV-Ray in the area of parametric surfaces.","active":true,"categories":["graphics","science","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["qt3"]}],"depends_on":[]},{"name":"itsol","portdir":"math/itsol","version":"2.0","license":"GPL-2+","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://www-users.cs.umn.edu/~saad/software/ITSOL/","description":"ITerative SOLvers for sparse linear systems.","long_description":"ITSOL is a library of iterative solvers for general sparse linear systems of equations. ITSOL can be viewed as an extension of the itsol module in SPARSKIT. It is written in C and offers a selection of recently developed preconditioners. The preconditioner suite includes: ILUK (ILU preconditioner with level of fill), ILUT (ILU preconditioner with threshold), ILUC (Crout version of ILUT), VBILUK (variable block preconditioner with level of fill - with automatic block detection), VBILUT (variable block preconditioner with threshold - with automatic block detection), ARMS (Algebraic Recursive Multilevel Solvers -- includes actually several methods, in particular the standard ARMS and the ddPQ version which uses nonsymmetric permutations). Note that ITSOL is a scalar package.","active":true,"categories":["math"],"maintainers":[{"name":"michaelld","github":"michaelld","ports_count":462}],"variants":["accelerate","atlas","blis","flexiblas","openblas","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc","OpenBLAS"]}],"depends_on":[]},{"name":"ivy","portdir":"math/ivy","version":"0.4.0","license":"BSD","platforms":"darwin freebsd linux","epoch":0,"replaced_by":null,"homepage":"https://github.com/robpike/ivy","description":"ivy is an interpreter for an APL-like language.","long_description":"ivy is an interpreter for an APL-like language.","active":true,"categories":["math"],"maintainers":[{"name":"herby.gillot","github":"herbygillot","ports_count":1056}],"variants":[],"dependencies":[{"type":"build","ports":["go","clang-18"]}],"depends_on":[]},{"name":"itpp-devel","portdir":"math/itpp","version":"20180529","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://sourceforge.net/projects/itpp/","description":"IT++ is a C++ library of mathematical, signal processing and communication classes and functions.","long_description":"IT++ is a C++ library of mathematical, signal processing and communication classes and functions.: This port is kept up with the IT++ GIT 'master' branch, which is typically updated daily to weekly. This version of IT++ generally contains fixes to, and its API is compatible with, the current IT++ release, and will be incorporated in an upcoming release. This port may or not compile or function correctly, as it represents a work in progress. If it does not work, check back in a few days. Or try deactivating the currently active IT++ port, cleaning any current builds, and trying again.","active":true,"categories":["science","math","comms"],"maintainers":[{"name":"michaelld","github":"michaelld","ports_count":462}],"variants":["debug","docs","atlas","accelerate","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","texlive-latex"]},{"type":"fetch","ports":["git"]},{"type":"lib","ports":["xmlto","doxygen","fftw-3","graphviz"]}],"depends_on":[]},{"name":"itpp","portdir":"math/itpp","version":"4.3.1","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://sourceforge.net/projects/itpp/","description":"IT++ is a C++ library of mathematical, signal processing and communication classes and functions.","long_description":"IT++ is a C++ library of mathematical, signal processing and communication classes and functions. Its main use is in simulation of communication systems and for performing research in the area of communications.","active":true,"categories":["science","math","comms"],"maintainers":[{"name":"michaelld","github":"michaelld","ports_count":462}],"variants":["debug","docs","atlas","accelerate","universal"],"dependencies":[{"type":"build","ports":["cmake","texlive-latex","clang-18"]},{"type":"lib","ports":["graphviz","xmlto","fftw-3","doxygen"]}],"depends_on":[{"type":"lib","ports":["dsd","gr-ofdm","gr37-ofdm"]}]},{"name":"itl","portdir":"math/itl","version":"4.0.0-1","license":"Artistic-1","platforms":"any","epoch":0,"replaced_by":null,"homepage":"http://www.osl.iu.edu/research/itl/","description":"Iterative Template Library (based on MTL)","long_description":"The Iterative Template Library (ITL) is a generic component library that provides iterative methods for solving linear systems. ITL also provides numerious preconditioners which is for MTL. ITL uses the abstract interface of matrix-vector, vector-vector, and vector-scalor operations MTL is default to serve those operations. ITL is able to use other packages such as Blitz++ and BLAS with the same abstract interface provided.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["blitz","mtl"]}],"depends_on":[]},{"name":"ipopt","portdir":"math/ipopt","version":"3.14.16","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://coin-or.github.io/Ipopt","description":"COIN-OR Interior Point Optimizer IPOPT","long_description":"COIN-OR Interior Point Optimizer IPOPT","active":true,"categories":["math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["OpenBLAS","mumps","scalapack","asl","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["scip"]}]},{"name":"igraph","portdir":"math/igraph","version":"1.0.1","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://igraph.org","description":"Network analysis and graph theory library for C.","long_description":"igraph is a C library for network analysis and graph theory, with an emphasis on efficiency, portability and ease of use.","active":true,"categories":["devel","science","math"],"maintainers":[{"name":"snc","github":"nerdling","ports_count":157},{"name":"szhorvat","github":"szhorvat","ports_count":18}],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","tls","openmp","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]},{"type":"lib","ports":["arpack","glpk","gmp","plfit","libxml2","OpenBLAS"]}],"depends_on":[{"type":"lib","ports":["py37-igraph","py39-igraph","py38-igraph","py310-igraph","py311-igraph","py312-igraph","py313-igraph","py314-igraph"]}]},{"name":"hypre","portdir":"math/hypre","version":"2.32.0","license":"LGPL-2.1","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/hypre-space/hypre","description":"HYPRE is a linear solver","long_description":"HYPRE is a library for solving large, sparse linear systems of equations on massively parallel computers.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","longindex","openmp","tests","universal"],"dependencies":[{"type":"build","ports":["cmake","grep","clang-20"]},{"type":"lib","ports":["libomp"]}],"depends_on":[{"type":"lib","ports":["hpddm","polysolve","gerris"]}]},{"name":"ibex-lib","portdir":"math/ibex-lib","version":"2.8.5","license":"LGPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/ibex-team/ibex-lib","description":"IBEX is a C++ library for constraint processing over real numbers.","long_description":"IBEX is a C++ library for constraint processing over real numbers. It provides reliable algorithms for handling non-linear constraints. In particular, roundoff errors are also taken into account. It is based on interval arithmetic and affine arithmetic. The main feature of Ibex is its ability to build strategies declaratively through the contractor programming paradigm. It can also be used as a black-box solver.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["pkgconfig","python27","clang-18"]},{"type":"test","ports":["cppunit"]}],"depends_on":[{"type":"build","ports":["VIBES"]}]},{"name":"hptt","portdir":"math/hptt","version":"1.0.5","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/springer13/hptt","description":"High-Performance Tensor Transpose library","long_description":"High-Performance Tensor Transpose library","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[]}]}