Search Results for "direct linear solver"
Sort By:
Showing 16 open source projects for "direct linear solver"
View related business solutions-
The AI-powered unified PSA-RMM platform for modern MSPs.SuperOps.ai is the only PSA-RMM platform powered by intelligent automation and thoughtfully crafted for the new-age MSP. The platform also helps MSPs manage their projects, clients, and IT documents from a single place.
-
Comet Backup - Fast, Secure Backup Software for MSPsComet is a flexible backup platform, giving you total control over your backup environment and storage destinations.
-
1
Forget about sleepless nights over textbooks! Solver is an application that solves equations quickly and easily. • Solve equations of any type — from linear to the fourth degree. • Save time and effort — you won't have to learn anything else. • Import and export data — work with equations from files and save solutions in the desired format. Don't miss the chance to make learning math simple and effective!
-
2
NetTopologySuite
A .NET GIS solution that is fast and reliable for the .NET platform.
A .NET GIS solution that is fast and reliable for the .NET platform. NetTopologySuite is a direct port of all the functionalities offered by JTS Topology Suite: NTS exposes JTS in a '.NET way', for example using Properties, Indexers, etc. The JTS Topology Suite is an API for modeling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium. -
3
RE2/J
linear time regular expression matching in Java
RE2/J is a high-performance regular expression engine implemented in pure Java as a port of Google’s C++ RE2 library. Unlike traditional regex engines such as Java’s java.util.regex, PCRE, or Perl’s implementation—which rely on backtracking and can suffer from catastrophic exponential runtimes—RE2/J guarantees linear-time matching relative to input size. It achieves this efficiency by simulating all possible matches in a single pass using a nondeterministic finite automaton (NFA), ensuring... -
4
Agrona
High Performance data structures and utility methods for Java
Agrona provides a library of data structures and utility methods that are a common need when building high-performance applications in Java. Many of these utilities are used in the Aeron efficient reliable UDP unicast, multicast, and IPC message transport and provides high-performance buffer implementations to support the Simple Binary Encoding Message Codec. -
Get full visibility and control over your tasks and projects with Wrike.Wrike offers world-class features that empower cross-functional, distributed, or growing teams take their projects from the initial request stage all the way to tracking work progress and reporting results.
-
5
lpsolve
Mixed Integer Linear Programming (MILP) solver.
Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/ -
6
GLPK for Java
Java language binding for the GNU Linear Programming Kit (GLPK)
GLPK for Java provides a Java language binding for the library GLPK. GLPK is a proven solver for linear and mixed integer mathematical programming problems. For Windows binaries see project GLPK for Windows (http://sourceforge.net/projects/winglpk/). -
7
COVID19 Data Visualization HoloLens2
Experimental COVID-19 data visualization for HoloLens 2
...CreateMeshes() creates the graph for three data values and text label. Main menu's Radio buttons simply show/hide GraphContainer objects. Menu stays around the user with tag-along behavior which is provided by MRTK's RadialView solver. Using the pin button, you can toggle tag-along behavior. -
8
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming
-
9
abumpack
Fortran library with the Abaqus user material subroutines UMAT/VUMAT
This library contains several of user material subroutines for implicit quasi-static (UMAT) and explicit dynamic (VUMAT) versions of the Abaqus solver. The project web site: http://abumpack.sf.net. The Abaqus is a proprietary finite element (FE) code ( http://www.3ds.com/products-services/simulia/products/abaqus/). Users can write subroutines for use with the Abaqus. Linear elastic, isotropic hardening plasticity, Gurson-Tvergaard-Needleman (GTN), Rousselier constitutive models are provided. ... -
Data management solutions for confident marketingVerify, deduplicate, manipulate, and assign records automatically to keep your CRM data accurate, complete, and ready for business.
-
10
Simple Simplex Solver is a tool function algorithms to solve equations in linear programming. its free to distribution, this tool may be useful for people. :-)
-
11
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
12
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,... -
13
Linear Program Solver
Solve linear programming problems
Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming -
14
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
15
* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol
-
16
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.
- Previous
- You're on page 1
- Next
