{"count":51961,"next":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=566","previous":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=564","results":[{"name":"vowpal_wabbit","portdir":"math/vowpal_wabbit","version":"8.3.1","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://hunch.net/~vw/","description":"a fast online learning tool","long_description":"Vowpal Wabbit is the essence of speed in machine learning, able to learn from terafeature datasets with ease. Via parallel learning, it can exceed the throughput of any single machine network interface when doing linear learning, a first amongst learning algorithms.","active":true,"categories":["math"],"maintainers":[{"name":"stromnov","github":"stromnov","ports_count":2896}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["boost176"]}],"depends_on":[]},{"name":"vinci","portdir":"math/vinci","version":"1.0.5","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.multiprecision.org/vinci/home.html","description":"Package that implements algorithms for convex body volume computation","long_description":"Package that implements algorithms for convex body volume computation","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"viennacl","portdir":"math/viennacl","version":"1.7.1","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://viennacl.sourceforge.net","description":"ViennaCL is a free open-source linear algebra library","long_description":"ViennaCL is a free open-source linear algebra library for computations on many-core architectures (GPUs, MIC) and multi-core CPUs. The library is written in C++ and supports CUDA, OpenCL, and OpenMP. In addition to core functionality and many other features including BLAS level 1-3 support and iterative solvers.","active":true,"categories":["devel","math"],"maintainers":[{"name":"stromnov","github":"stromnov","ports_count":2896}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["boost"]}],"depends_on":[]},{"name":"vdt","portdir":"math/vdt","version":"0.4.6","license":"LGPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/dpiparo/vdt","description":"A collection of fast and inline implementations of mathematical functions.","long_description":"vdt provides A collection of fast and inline implementations of mathematical functions..","active":true,"categories":["math"],"maintainers":[{"name":"jonesc","github":"cjones051073","ports_count":232}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[{"type":"lib","ports":["root6"]}]},{"name":"vampire","portdir":"math/vampire","version":"4.9","license":"BSD and MIT","platforms":"darwin freebsd","epoch":1,"replaced_by":null,"homepage":"https://github.com/vprover/vampire","description":"Vampire Theorem Prover","long_description":"High performance automated theorem prover.","active":true,"categories":["science","math"],"maintainers":[{"name":"landonf","github":"landonf","ports_count":84}],"variants":["debug","native","polly","profile","z3","universal"],"dependencies":[{"type":"build","ports":["cmake","ninja","clang-20"]}],"depends_on":[]},{"name":"tilp2","portdir":"math/tilp2","version":"1.18","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tilp/","description":"Texas Instruments calculators linking program","long_description":"Program to communicate with Texas Instruments (TI) calculators, based on gtk2","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","pkgconfig","groff","intltool","clang-18"]},{"type":"lib","ports":["gettext","libiconv","gtk2","libglade2","libticables2","libticalcs2","libticonv","libtifiles2"]}],"depends_on":[]},{"name":"taucs","portdir":"math/taucs","version":"2.2","license":"LGPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.tau.ac.il/~stoledo/taucs/","description":"C library of sparse linear solvers","long_description":"TAUCS is a C library of sparse linear solvers.","active":true,"categories":["math"],"maintainers":[{"name":"mark.brethen","github":"mbrethen","ports_count":7},{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["libf2c","OpenBLAS","metis"]}],"depends_on":[]},{"name":"tiemu3","portdir":"math/tiemu3","version":"3.03","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://lpg.ticalc.org/prj_tiemu/","description":"Texas Instruments TI89, Titanium, TI-92, TI-92+, Voyager 200 multi-platform emulator","long_description":"TiEmu is a full-featured TI89, Titanium, TI-92, TI-92+, Voyager 200 multi-platform emulator with an html manual. It offers: popup menu, screenshots, ASM/C debugger, link port, saving state and some other stuffs.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["pkgconfig","groff","clang-18"]},{"type":"lib","ports":["libglade2","libticables2","libticalcs2","gettext","libtifiles2","libiconv","libticonv","libsdl","gtk2"]}],"depends_on":[]},{"name":"tablix","portdir":"math/tablix","version":"0.3.5","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.tablix.org/","description":"Kernel for solving general timetabling problems","long_description":"Tablix is a powerful free software kernel for solving general timetabling problems. It uses a coarse-grained parallel genetic algorithm in combination with other techniques to construct sensible timetables from XML formatted problem descriptions. Tablix supports a very wide range of timetabling problems, from high school timetabling to barge scheduling. A number of timetable constraints are already implemented in the default installation and kernel's modular design makes it is easy to add new ones.","active":true,"categories":["math"],"maintainers":[{"name":"tomaz.solc","github":"","ports_count":1}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["pvm","libxml2"]},{"type":"run","ports":["gnuplot"]}],"depends_on":[]},{"name":"sympol","portdir":"math/sympol","version":"0.1.9","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.math.uni-rostock.de/~rehn/software/sympol.html","description":"C++ tool to work with symmetric polyhedra.","long_description":"C++ tool to work with symmetric polyhedra. It helps to compute restricted automorphisms (parts of the linear symmetry group) of polyhedra and performs polyhedral description conversion up to a given or computed symmetry group.","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","permlib","clang-18"]},{"type":"lib","ports":["eigen3","cddlib","lrslib","boost176","gmp","bliss"]}],"depends_on":[{"type":"lib","ports":["polymake"]}]},{"name":"sympow","portdir":"math/sympow","version":"2.023.7","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://gitlab.com/rezozer/forks/sympow","description":"SYMmetric POWer elliptic curve L-functions","long_description":"SYMmetric POWer elliptic curve L-functions","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["help2man","clang-18"]},{"type":"lib","ports":["pari"]}],"depends_on":[]},{"name":"svmlin","portdir":"math/svmlin","version":"1.0","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://vikas.sindhwani.org","description":"Fast linear SVM solvers for supervised and semi-supervised learning","long_description":"Fast linear SVM solvers for supervised and semi-supervised learning","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"superlu_dist","portdir":"math/superlu_dist","version":"9.1.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://portal.nersc.gov/project/sparse/superlu/","description":"A package for solving linear equations","long_description":"SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","mpich","openmpi","longindex","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["OpenBLAS","parmetis","mpich-clang18"]}],"depends_on":[]},{"name":"svdlibc","portdir":"math/svdlibc","version":"1.4","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://tedlab.mit.edu/~dr/SVDLIBC/","description":"SVDLIBC is a C library to perform singular value decomposition","long_description":"SVDLIBC is a C library based on the SVDPACKC library. It offers a cleaned-up version of the code with a sane library interface and a front-end executable that performs matrix file type conversions, along with computing singular value decompositions. Currently the only SVDPACKC algorithm implemented in SVDLIBC is las2, because it seems to be consistently the fastest.","active":true,"categories":["science","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"superlu","portdir":"math/superlu","version":"5.2.2","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://portal.nersc.gov/project/sparse/superlu","description":"A package for solving linear equations","long_description":"SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["OpenBLAS"]}],"depends_on":[{"type":"lib","ports":["apbs"]}]},{"name":"sundials6","portdir":"math/sundials6","version":"6.7.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://computing.llnl.gov/projects/sundials","description":"SUite of Nonlinear and DIfferential/ALgebraic equation Solvers","long_description":"SUNDIALS consists of the following five solvers: CVODE solves initial value problems for ordinary differential equation (ODE) systems. CVODES solves ODE systems and includes sensitivity analysis capabilities (forward and adjoint). IDA solves initial value problems for differential-algebraic equation (DAE) systems. IDAS solves DAE systems and includes sensitivity analysis capabilities (forward and adjoint). KINSOL solves nonlinear algebraic systems.","active":true,"categories":["devel","math"],"maintainers":[{"name":"mascguy","github":"mascguy","ports_count":359}],"variants":["atlas","debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","examples","accelerate","openblas","doc","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"extract","ports":["gnutar"]},{"type":"lib","ports":["libgcc","SuiteSparse_KLU","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["octave"]},{"type":"run","ports":["stanmath"]}]},{"name":"sundials5","portdir":"math/sundials5","version":"5.8.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://computing.llnl.gov/projects/sundials","description":"SUite of Nonlinear and DIfferential/ALgebraic equation Solvers","long_description":"SUNDIALS consists of the following five solvers: CVODE solves initial value problems for ordinary differential equation (ODE) systems. CVODES solves ODE systems and includes sensitivity analysis capabilities (forward and adjoint). IDA solves initial value problems for differential-algebraic equation (DAE) systems. IDAS solves DAE systems and includes sensitivity analysis capabilities (forward and adjoint). KINSOL solves nonlinear algebraic systems.","active":true,"categories":["devel","math"],"maintainers":[{"name":"mascguy","github":"mascguy","ports_count":359}],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","examples","accelerate","atlas","openblas","doc","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["libgcc","SuiteSparse_KLU","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["cantera-devel","deal.ii","cantera"]}]},{"name":"sundials2","portdir":"math/sundials2","version":"2.7.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://computing.llnl.gov/projects/sundials","description":"SUite of Nonlinear and DIfferential/ALgebraic equation Solvers","long_description":"SUNDIALS consists of the following five solvers: CVODE solves initial value problems for ordinary differential equation (ODE) systems. CVODES solves ODE systems and includes sensitivity analysis capabilities (forward and adjoint). IDA solves initial value problems for differential-algebraic equation (DAE) systems. IDAS solves DAE systems and includes sensitivity analysis capabilities (forward and adjoint). KINSOL solves nonlinear algebraic systems.","active":true,"categories":["devel","math"],"maintainers":[],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","examples","accelerate","atlas","openblas","doc","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["libgcc","SuiteSparse_KLU","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["mcsim"]}]},{"name":"strumpack","portdir":"math/strumpack","version":"8.0.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://portal.nersc.gov/project/sparse/strumpack","description":"Structured Matrix Package (LBNL)","long_description":"STRUMPACK (STRUctured Matrix PACKage) is a software library providing linear algebra routines and linear system solvers for sparse and for dense rank-structured linear systems.","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","util-linux","clang-20","gcc15"]},{"type":"lib","ports":["libgcc","libomp","OpenBLAS","metis"]},{"type":"test","ports":["wget"]}],"depends_on":[{"type":"lib","ports":["hiop"]}]},{"name":"stp","portdir":"math/stp","version":"20150306","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://stp.github.io/stp","description":"STP (Simple Theorem Provider)","long_description":"STP is a constraint solver (also referred to as a decision procedure or automated prover) aimed at solving constraints generated by program analysis tools, theorem provers, automated bug finders, intelligent fuzzers and model checkers.","active":true,"categories":["math"],"maintainers":[],"variants":["debug"],"dependencies":[{"type":"build","ports":["bison","cmake","flex","perl5","clang-18"]},{"type":"lib","ports":["boost176"]}],"depends_on":[]},{"name":"stanmath","portdir":"math/stanmath","version":"4.9.0","license":"BSD","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://mc-stan.org/math","description":"C++ template library for automatic differentiation","long_description":"The Stan Math Library is a C++, reverse-mode automatic differentiation library designed to be usable, extensive and extensible, efficient, scalable, stable, portable and redistributable in order to facilitate the construction and utilization of algorithms that utilize derivatives.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":[null]},{"type":"run","ports":["eigen3","onetbb","boost178","sundials6"]}],"depends_on":[{"type":"lib","ports":["stan"]}]},{"name":"sprng","portdir":"math/sprng","version":"1.0","license":"CC-BY-SA-4","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.sprng.org","description":"Scalable Parallel Random Number Generators","long_description":"Scalable Parallel Random Number Generators","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"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["mpich-clang18"]}],"depends_on":[]},{"name":"stan","portdir":"math/stan","version":"2.35.0","license":"BSD","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://mc-stan.org","description":"C++ package for Bayesian inference, maximum likelihood estimation etc.","long_description":"C++ package for Bayesian inference, maximum likelihood estimation etc.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["rapidjson","stanmath"]}],"depends_on":[]},{"name":"spral","portdir":"math/spral","version":"2024.05.08","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.numerical.rl.ac.uk/spral","description":"Sparse Parallel Robust Algorithms Library","long_description":"An open-source (BSD) library for sparse linear algebra and associated algorithms. It is primarily developed by the Numerical Analysis group at STFC Rutherford Appleton Laboratory.","active":true,"categories":["science","math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","openmp","universal"],"dependencies":[{"type":"build","ports":["gcc15","autoconf","automake","libtool","pkgconfig","clang-18"]},{"type":"lib","ports":["libgcc","libomp","OpenBLAS","metis","hwloc"]}],"depends_on":[]},{"name":"soplex","portdir":"math/soplex","version":"8.0.2","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://soplex.zib.de","description":"Sequential object-oriented simPlex","long_description":"SoPlex is an optimization package for solving linear programming problems (LPs) based on an advanced implementation of the primal and dual revised simplex algorithm.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","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-20","gcc15"]},{"type":"lib","ports":["libgcc","OpenBLAS","zlib","boost188","onetbb","gmp","mpfr"]}],"depends_on":[{"type":"build","ports":["papilo"]},{"type":"lib","ports":["TOPCOM","polymake","scip"]}]},{"name":"slepc","portdir":"math/slepc","version":"3.22.1","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://slepc.upv.es","description":"Scalable Library for Eigenvalue Problem Computations","long_description":"SLEPc is a software library for the solution of large scale sparse eigenvalue problems on parallel computers. It is an extension of PETSc and can be used for either standard or generalized eigenproblems, with real or complex arithmetic. It can also be used for computing a partial SVD of a large, sparse, rectangular matrix.","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","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","arpack","universal"],"dependencies":[{"type":"build","ports":["sowing","python311","clang-18"]},{"type":"lib","ports":["petsc","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["py27-slepc4py","py35-slepc4py","py36-slepc4py","py38-slepc4py","py37-slepc4py","py39-slepc4py","py310-slepc4py","py311-slepc4py"]}]},{"name":"sofia-ml","portdir":"math/sofia-ml","version":"2011-06-20-r42","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://code.google.com/p/sofia-ml/","description":"Suite of Fast Incremental Algorithms for Machine Learning","long_description":"The suite of fast incremental algorithms for machine learning (sofia-ml) can be used for training models for classification, regression, ranking, or combined regression and ranking. Several different techniques are available. This release is intended to aid researchers and practitioners who require fast methods for classification and ranking on large, sparse data sets.","active":true,"categories":["math"],"maintainers":[],"variants":["universal","kmeans"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"fetch","ports":["subversion"]}],"depends_on":[]},{"name":"shogun-devel","portdir":"math/shogun-devel","version":"4.0.0","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://shogun-toolbox.org","description":"The machine learning toolbox's focus is on large scale kernel methods","long_description":"The machine learning toolbox's focus is on large scale kernel methods and especially on Support Vector Machines (SVM). It provides a generic SVM object interfacing to several different SVM implementations, among them the state of the art OCAS, LibSVM, SVMLight, SVMLin and GPDT.","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","python27"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","python27","clang-18"]},{"type":"lib","ports":["xz","protobuf-cpp","readline","arpack","atlas","bzip2","glpk","lp_solve","hdf5","json-c","libxml2","eigen3","gzip","lzo2","snappy"]}],"depends_on":[]},{"name":"singular","portdir":"math/singular","version":"4.4.0","license":"(GPL-2 or GPL-3)","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.singular.uni-kl.de/","description":"the Singular computer algebra system","long_description":"Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry, and singularity theory.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["readline","cddlib","ntl","flint","gmp","mpfr","ncurses"]}],"depends_on":[{"type":"lib","ports":["polymake"]}]},{"name":"shogun","portdir":"math/shogun","version":"2.1.0","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.shogun-toolbox.org","description":"The machine-learning toolbox's focus is on large-scale kernel methods","long_description":"The machine-learning toolbox's focus is on large-scale kernel methods and especially on Support Vector Machines (SVM). It provides a generic SVM object interfacing to several different SVM implementations, among them the state of the art OCAS, LibSVM, SVMLight, SVMLin and GPDT.","active":true,"categories":["science","math"],"maintainers":[],"variants":["g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","python27","perl","r","octave","java","csharp","lua","ruby","elwms","hmm_parallel"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18","gcc15"]},{"type":"lib","ports":["snappy","xz","readline","libgcc","arpack","atlas","bzip2","glpk","lp_solve","hdf5","json-c","libxml2","eigen3","gzip","lzo2"]}],"depends_on":[]},{"name":"shark","portdir":"math/shark","version":"4.0.1","license":"LGPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://image.diku.dk/shark/","description":"Fast, modular, feature-rich open-source C++ machine learning library","long_description":"Shark is a fast, modular, feature-rich open-source C++ machine learning library. It provides methods for linear and nonlinear optimization, kernel-based learning algorithms, neural networks and various other machine learning techniques. It serves as a powerful toolbox for real world applications as well as research.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["hdf5","boost171"]}],"depends_on":[{"type":"lib","ports":["orfeotoolbox","py310-orfeotoolbox","py311-orfeotoolbox","py312-orfeotoolbox","py313-orfeotoolbox","py314-orfeotoolbox"]}]},{"name":"scip","portdir":"math/scip","version":"10.0.2","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://scipopt.org/","description":"Solving Constraint Integer Programs","long_description":"SCIP is currently one of the fastest non-commercial solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP).","active":true,"categories":["math"],"maintainers":[],"variants":["debug","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-20","gcc15"]},{"type":"lib","ports":["readline","libgcc","OpenBLAS","onetbb","zlib","ipopt","libpapilo","boost188","soplex","gmp","mpfr"]}],"depends_on":[{"type":"lib","ports":["papilo","polymake"]}]},{"name":"sgd","portdir":"math/sgd","version":"2.1","license":"LGPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://leon.bottou.org/projects/sgd","description":"Stochastic Gradient Descent","long_description":"The goal of this package is to illustrate the efficiency of stochastic gradient descent for large-scale learning tasks. Two algorithms, Stochastic Gradient Descent (SGD), and Averaged Stochastic Gradient Descent (ASGD), are applied to two well known problems, Linear Support Vector Machines, and Conditional Random Fields.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["zlib"]}],"depends_on":[]},{"name":"scalc","portdir":"math/scalc","version":"1.15","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fokus.fraunhofer.de/research/cc/berlios/employees/joerg.schilling/private/","description":"tool for simple integer calculations or for converting numbers","long_description":"The calc command may be used to do simple integer calculations or to convert numbers from one radix to another.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["smake","clang-18"]}],"depends_on":[]},{"name":"scalapack","portdir":"math/scalapack","version":"2.2.2","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.netlib.org/scalapack","description":"A package for solving linear equations","long_description":"The ScaLAPACK (or Scalable LAPACK) library includes a subset of LAPACK routines redesigned for distributed memory MIMD parallel computers. Since version 2.0.0, ScaLAPACK includes BLACS.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","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":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["libgcc","OpenBLAS","mpich-clang18"]}],"depends_on":[{"type":"lib","ports":["bpack","hiop","hpddm","ipopt","mumps","quantum-espresso"]}]},{"name":"s2geometry","portdir":"math/s2geometry","version":"0.11.1","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://s2geometry.io","description":"Computational geometry and spatial indexing on the sphere","long_description":"Computational geometry and spatial indexing on the sphere","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","tests","universal"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","clang-20"]},{"type":"lib","ports":["abseil","openssl3"]}],"depends_on":[]},{"name":"reduce","portdir":"math/reduce","version":"20211019","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://reduce-algebra.sourceforge.io/","description":"REDUCE Computer Algebra System","long_description":"REDUCE is an interactive system for general algebraic computations of interest to mathematicians, scientists and engineers.","active":true,"categories":["lang","math"],"maintainers":[{"name":"mark.brethen","github":"mbrethen","ports_count":7}],"variants":[],"dependencies":[{"type":"build","ports":["clang-18","Xft2","xorg-libX11","xorg-libXcursor","xorg-libXext","xorg-libXrandr","xorg-xorgproto","xrender","autoconf","automake","libtool","gnuplot"]},{"type":"lib","ports":["freetype","fontconfig","netpbm","ncurses","libffi"]},{"type":"run","ports":["texlive","gnuplot"]}],"depends_on":[]},{"name":"radian","portdir":"math/radian","version":"0.6.13","license":"MIT","platforms":"{darwin any}","epoch":0,"replaced_by":null,"homepage":"https://github.com/randy3k/radian","description":"A XXI century R console","long_description":"radian is an alternative console for the R program with multiline editing and rich syntax highlight. One would consider radian as a ipython clone for R, though its design is more aligned to Julia.","active":true,"categories":["math","python","R"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["py311-installer","py311-setuptools","py311-wheel","py311-pytest-runner","clang-18","py311-build"]},{"type":"lib","ports":["python311","py311-pygments","py311-prompt_toolkit","py311-rchitect"]},{"type":"run","ports":["R"]},{"type":"test","ports":["py311-pytest","py311-ptyprocess","py311-pexpect","py311-pyte"]}],"depends_on":[]},{"name":"qrupdate","portdir":"math/qrupdate","version":"1.1.2","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://sourceforge.net/projects/qrupdate/","description":"library for fast updates of QR and Cholesky decompositions","long_description":"a Fortran library for fast updates of QR and Cholesky decompositions","active":true,"categories":["math"],"maintainers":[],"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":[{"type":"lib","ports":["linalg","octave"]}]},{"name":"qhull","portdir":"math/qhull","version":"2020.2","license":"Permissive","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.qhull.org","description":"Programs and library for computing convex hulls.","long_description":"Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The software runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. Qhull also computes volumes, surface areas, and approximations to the convex hull.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","native","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[{"type":"build","ports":["gnudatalanguage"]},{"type":"lib","ports":["py36-matplotlib","gdal","gdal-hdf5","gdal-kea","gdal-netcdf","py39-matplotlib","py37-matplotlib","py38-matplotlib","libpcl","ipe","palapeli","octave","py310-matplotlib","py311-matplotlib","py312-matplotlib","py313-matplotlib","py314-matplotlib","py27-matplotlib","FreeSOLID","plplot","plplot510","plplot-single","plplot510-single","py35-matplotlib","solid"]}]},{"name":"qepcad","portdir":"math/qepcad","version":"2023.03.12","license":"Restrictive","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/PetterS/qepcad","description":"Quantifier Elimination by Partial Cylindrical Algebraic Decomposition","long_description":"Quantifier Elimination by Partial Cylindrical Algebraic Decomposition","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"qalculate-qt","portdir":"math/qalculate-qt","version":"5.9.0","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/qalculate/qalculate-qt","description":"Qalculate! is a multi-purpose desktop calculator","long_description":"Qalculate! is a multi-purpose desktop calculator It is small and simple to use but with much power and versatility underneath. Features include customizable functions, units, arbitrary precision, plotting, and a user-friendly interface.","active":true,"categories":["math"],"maintainers":[{"name":"judaew","github":"judaew","ports_count":655}],"variants":["debug"],"dependencies":[{"type":"build","ports":["qt5-qttools","pkgconfig","clang-18"]},{"type":"lib","ports":["qt5-qtbase","qt5-qtsvg","libqalculate"]}],"depends_on":[]},{"name":"qalculate-gtk","portdir":"math/qalculate-gtk","version":"5.9.0","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/qalculate/qalculate-gtk","description":"Qalculate! is a multi-purpose desktop calculator","long_description":"Qalculate! is a multi-purpose desktop calculator. It is small and simple to use but with much power and versatility underneath. Features include customizable functions, units, arbitrary precision, plotting, and a user-friendly interface.","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-18","libtool","pkgconfig","intltool","autoconf","automake","gettext"]},{"type":"lib","ports":["libqalculate","gettext-runtime","gtk3"]}],"depends_on":[]},{"name":"pspp-devel","portdir":"math/pspp-devel","version":"2.0.1","license":"GPL-3+","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://www.gnu.org/software/pspp/","description":"Statistical analysis of sampled data (free replacement for SPSS).","long_description":"PSPP is a program for statistical analysis of sampled data. It is a Free replacement for the proprietary program SPSS, and appears very similar to it with a few exceptions.","active":true,"categories":["math"],"maintainers":[{"name":"snc","github":"nerdling","ports_count":157}],"variants":["help","postgres","gui","quartz","x11","universal"],"dependencies":[{"type":"build","ports":["gettext","pkgconfig","makeicns","coreutils","p5.34-text-diff","clang-18"]},{"type":"lib","ports":["gtksourceview4","cairo","fontconfig","gdk-pixbuf2","harfbuzz","librsvg","gsl","spread-sheet-widget","freetype","libiconv","libxml2","texinfo","pango","perl5.34","gettext-runtime","python311","zlib","atk","glib2","ncurses","readline","gtk3"]},{"type":"test","ports":["coreutils","p5.34-text-diff"]}],"depends_on":[]},{"name":"pspp","portdir":"math/pspp","version":"1.6.2","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.gnu.org/software/pspp/","description":"Statistical analysis of sampled data (free replacement for SPSS).","long_description":"PSPP is a program for statistical analysis of sampled data. It is a Free replacement for the proprietary program SPSS, and appears very similar to it with a few exceptions.","active":true,"categories":["math"],"maintainers":[{"name":"snc","github":"nerdling","ports_count":157}],"variants":["help","doc","reloc","postgres","gui","quartz","x11","universal"],"dependencies":[{"type":"build","ports":["clang-18","gettext","pkgconfig","makeicns","texinfo","python310"]},{"type":"lib","ports":["readline","gtksourceview3","cairo","fontconfig","gdk-pixbuf2","gsl","spread-sheet-widget","freetype","libiconv","libxml2","pango","xorg-libX11","zlib","xorg-libXcomposite","xorg-libXcursor","xorg-libXdamage","xorg-libXdmcp","xorg-libXext","xorg-libXfixes","xorg-libXi","xorg-libXinerama","xorg-libXrandr","xorg-libxcb","xrender","xorg-libXau","appstream-glib","atk","gettext","glib2","ncurses"]},{"type":"run","ports":["adwaita-icon-theme"]}],"depends_on":[]},{"name":"psblas3","portdir":"math/psblas3","version":"3.8.1-2","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/sfilippone/psblas3","description":"Library of parallel sparse linear algebra on high performance computer.","long_description":"Library of parallel sparse linear algebra on high performance computer.","active":true,"categories":["science","math","parallel"],"maintainers":[],"variants":["accelerate","atlas","blis","flexiblas","openblas","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","gcc15"]},{"type":"lib","ports":["OpenBLAS","SuiteSparse_AMD","libgcc","mpich-clang18","metis","libomp"]}],"depends_on":[]},{"name":"primme","portdir":"math/primme","version":"3.2.3","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.cs.wm.edu/~andreas/software","description":"PReconditioned Iterative MultiMethod Eigensolver for solving symmetric/Hermitian eigenvalue problems and singular value problems","long_description":"PReconditioned Iterative MultiMethod Eigensolver for solving symmetric/Hermitian eigenvalue problems and singular value problems","active":true,"categories":["math"],"maintainers":[],"variants":["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":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc","OpenBLAS"]}],"depends_on":[]},{"name":"primesieve","portdir":"math/primesieve","version":"12.4","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://primesieve.org/","description":"Fast C/C++ prime number generator","long_description":"Primesieve is a C/C++ library that generates prime numbers using a highly optimized sieve of Eratosthenes implementation. It supports segmented sieving and is designed to generate primes in parallel.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]}],"depends_on":[]},{"name":"primegen","portdir":"math/primegen","version":"0.97","license":"public-domain","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://cr.yp.to/primegen.html","description":"Binary and library to generate prime numbers","long_description":"primegen is a small, fast library to generate prime numbers in order. Can generate primes up to 1000000000000000, although it is not optimized for primes past 32 bits. It uses the Sieve of Atkin instead of the traditional Sieve of Eratosthenes.","active":true,"categories":["math"],"maintainers":[{"name":"bstj","github":"","ports_count":3}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"prc","portdir":"math/prc","version":"1.5.6","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://supfam.mrc-lmb.cam.ac.uk/PRC/","description":"program for aligning and scoring two profile hidden Markov models","long_description":"PRC is a stand-alone program for aligning and scoring two profile hidden Markov models. This can be used to detect remote relationships between profiles more effectively than by doing simple profile-sequence comparisons. PRC takes into account all transition and emission probabilities in both hidden Markov models. PRC can read SAM, HMMER, PSI-BLAST and FASTA files.","active":true,"categories":["science","math"],"maintainers":[{"name":"ryandesign","github":"ryandesign","ports_count":2085}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]}]}