7 Search Results
Exact Match
Mathematica
Mathematica seamlessly integrates a numeric and symbolic computational engine, graphics system, programming language, documentation system, and advanced connectivity to other applications.
More informationOther Matches
ATLAS
The ATLAS (Automatically Tuned Linear Algebra Software) project is an ongoing research effort focusing on applying empirical techniques in order to provide portable performance. At present, it provides C and Fortran77 interfaces to a portably efficient BLAS implementation, as well as a few routines from LAPACK.
More informationFast Artificial Neural Network Library
Fast Artificial Neural Network Library is a neural network library that implements multilayer artificial neural networks in C with support for both fully connected and sparsely connected networks. Cross-platform execution in both fixed and floating point are supported. It includes a framework for easy handling of training data sets. It is easy to use, versatile, well documented, and fast. PHP, C++, .NET, Python, Delphi, Octave, Ruby, Pure Data, and Mathematica bindings are available. A reference manual accompanies the library with examples and recommendations on how to use the library. A graphical user interface is also available for the library.
More informationGlobal Optimization Toolbox For Maple
Optimization is the science of finding solutions that satisfy complicated constraints and objectives. In engineering, constraints may arise from technical issues. In business, constraints are related to many factors, including cost, time, and staff. The objective of global optimization is to find [numerically] the absolute best solution of highly nonlinear optimization models that may have a number of locally optimal solutions. Global optimization problems can be extremely difficult. Frequently engineers and researchers are forced to settle for solutions that are “good enough” at the expense of extra time, money, and resources, because the best solution has not been found. Using the Global Optimization Toolbox, you can formulate your optimization model easily inside the powerful Maple numeric and symbolic system, and then use world-class Maple numeric solvers to return the best answer, fast! Illustrative references: 1. Pintér, J. D. Global Optimization in Action. Springer Science, 1996, 512 p., ISBN: 978-0-7923-3757-7 Winner of the 2000 INFORMS Computing Society Prize. 2. Pintér, J. D., Linder, D. and Chin, P. Global Optimization Toolbox for Maple: An introduction with illustrative applications. Optimization Methods and Software 21 (2006) (4) 565-582.
More informationigraph
igraph is a collection of network analysis tools with the emphasis on efficiency, portability and ease of use. igraph is a free and open source software package for creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community structure search. The efficient implementation of igraph allows it to handle graphs with millions of vertices and edges. The rule of thumb is that if your graph fits into the physical memory then igraph can handle it. igraph can be programmed in R, Python and C/C++ by virtue of R/igraph, python-igraph and C/igraph, respectively. There is also a Mathematica interface IGraph/M written by Szabolcs Horvát.
More informationSINGULAR
SINGULAR is a Computer Algebra system for polynomial computations in commutative algebra, algebraic geometry, and singularity theory. SINGULAR's main computational objects are ideals and modules over a large variety of baserings. The baserings are polynomial rings over a field (e.g., finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to an ideal. SINGULAR features fast and general implementations for computing Groebner and standard bases, including e.g. Buchberger's algorithm and Mora's Tangent Cone algorithm. Furthermore, it provides polynomial factorizations, resultant, characteristic set and gcd computations, syzygy and free-resolution computations, and many more related functionalities. Based on an easy-to-use interactive shell and a C-like programming language, SINGULAR's internal functionality is augmented and user-extendible by libraries written in the SINGULAR programming language. A general and efficient implementation of communication links allows SINGULAR to make its functionality available to other programs.
More informationTheorema
The Theorema project aims at extending current computer algebra systems by facilities for supporting mathematical proving. The present early-prototype version of the Theorema software system is implemented in Mathematica . The system consists of a general higher-order predicate logic prover and a collection of special provers that call each other depending on the particular proof situations. The individual provers imitate the proof style of human mathematicians and produce human-readable proofs in natural language presented in nested cells. The special provers are intimately connected with the functors that build up the various mathematical domains. The long-term goal of the project is to produce a complete system which supports the mathematician in creating interactive textbooks, i.e. books containing, besides the ordinary passive text, active text representing algorithms in executable format, as well as proofs which can be studied at various levels of detail, and whose routine parts can be automatically generated. This system will provide a uniform (logic and software) framework in which a working mathematician, without leaving the system, can get computer-support while looping through all phases of the mathematical problem solving cycle.
More information