Search Results for "direct linear solver"
Sort By:
8 projects for "direct linear solver" with 2 filters applied:
-
PRTG Catches Network Issues Before They Cause DowntimeReactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
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/ -
2
ICE (Interval Calculator for Engineer)
Interval Calculator for Engineer
ICE is a simple mathematical calculator with very useful shortcuts for Engineer: works natively with tolerance, can run Monte Carlo analysis, uses engineer notation, includes most of the day by day functions used by engineers. -
3
SL2
SL2 (= SLSL) - A Simple Linear Systems Library
SL2 is a C++ template library for solving systems of linear equations, providing the most common algorithms for dense and sparse systems. It uses OpenMP for parallelization and has no other dependencies. As the name suggests, SL2's implementation is staightforward with a focus on clear concepts, easy usage and understandable code. -
4
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,... -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
ViennaFEM
A finite element solver using state-of-the-art programming techniques.
ViennaFEM is a library-centric implementation of the finite element method in C++. It features a symbolic math kernel, which manipulates the strong or weak form of the problem and automatically derives the discrete form. ViennaFEM is built on top of the following libraries: ViennaMath provides the symbolic math kernel, ViennaGrid (with ViennaData) allows for a generic grid handling and quantity storage, while ViennaCL provides the linear solvers and GPU acceleration. -
6
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. -
7
jOptimum is a simple linear programming solver developed for educational purposes. Now, jOptimum is hosted by http://incubadora.fapesp.br/projects/joptimum
-
8
- Previous
- You're on page 1
- Next
