Search Results for "polynomial"
Sort By:
Showing 22 open source projects for "polynomial"
View related business solutions-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
2
java symbolic computing library and math editor, with : polynomial system solving, vectors & matrices, factorization, derivatives, integrals (rational functions), boolean algebra, simplification, MathML output, java code generation, geometric algebra
-
3
NAVAL-SEM
Free offline SEM software with HTMT, bootstrapping & exports
NAVAL-SEM is a free, open-source, fully offline desktop application for Structural Equation Modeling (SEM), supporting both PLS-SEM and CB-SEM workflows. Designed for researchers, PhD scholars, professors, students, and analysts, it enables advanced quantitative research without subscriptions, cloud dependencies, or proprietary software restrictions. Key features include visual drag-and-drop model building, bootstrapping, mediation analysis, HTMT, AVE, Composite Reliability (CR),... -
4
polynomial-roots-calculation
Application for calculating the real roots of a polynomial
Application for polynomial roots calculation. The application does the job by supposing the roots of the derivative function are known. This way, we can delimit the range where each possible root is in, and by applying Bolzano's theorem, we can find the zeroes. It is not a very eficient way, as we must calculate al the derivatives of the polinomial, implying very high numbers (n!) -
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
5
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request. We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++. In particular, SparsePOPC++-windows contains a binary file which works on Windows, and does not require to compile.
-
6
MattsMathTools
MathTools is an aid in preparing printed math tests.
Matt's MathTools is a Java application designed as an aid in preparing printed math tests. It is easily embedded in other Java applications or it can be used alone as a single-user desktop app. It includes a scripting environment, numerous demonstration classes and several general utilities. A scripting tutorial is also available. -
7
pure python polyfit
python2/3: compute polyfit (1D, 2D, N-D) without thirdparty libraries
python2/3: compute polyfit (1D, 2D, N-D) without any thirdparty library like numpy, scipy etc. also can be used for least squares solution computation and for A=QR matrix decomposition. Tested with python 2.7 and 3.4 Consider donating to this project: https://sourceforge.net/p/purepythonpolyfit/donation For a Sample use, refer to the WIKI -
8
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. -
9
Respol: A software package for computing projections of resultant polytopes Description: Respol is C++ software to compute a projection of the Newton polytope of the resultant of a given polynomial system. These are indirectly defined high-dimensional polytopes. Related Papers: [1] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. An oracle-based, output sensitive algorithm for projections of resultant polytopes. International J. Computational Geometry & Applications (Special issue) World Scientific, 2013. [2] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. ...
-
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.
-
10
SymbolicC++
An object oriented C++ library for computer algebra
SymbolicC++ is a general purpose computer algebra system embedded in the programming language C++. It is free software released under the terms of the GNU General Public License. SymbolicC++ is used by including a C++ header file or by linking against a library. -
11
This library provides a general purpose polynomial calculator for actionscript 3. This includes basic math operators, deriviatives, finding zeros (uses TOMS493 algorithm), and solving. Supports copmlex coeffiecents and rational polynomials.
-
12
This is a research project. A new modulation method 'Advanced PCC-OFDM' is developed. With this method you can construct a modulation, which is fast decaying in frequency domain, while maintaining spectral efficiency.
-
13
This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.
-
14
...Educational software originally made for the study and simulation of electrical LTI circuits, but which supply also a lot of mathematics computations, like complex, polynomial and matrix operations.
-
15
A polynomial-time algorithm for constructing level-2 phylogenetic networks from dense sets of rooted triplets.
-
16
Sake is a PHP implementation of Polynomial Least Squares Regression. The algorithm takes data points as input and returns the resulting polynomial. Graphs can be made using any plotting package. Sake provides the polynomial and will compute as many point
-
17
Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.
-
18
This is a hybrid Matlab-Mathematica package for the numerical/pointwise and symbolic/explicit (as a piecewise polynomial) calculation of the B-Spline supported on a given 2D domain.
-
19
-
20
The Function Wizard is designed to provide a lightweight, fast, and easy to use application that will integrate, differentiate, calculate maxima and minima, etc. basic polynomials, as well as assist in other tedious polynomial tasks.
-
21
MATHLIB3D: MATHLIB3D is a Vector/Matrix/Quaternion/Plane/Polynomial C++/Java library targeting either precision or fast mathematical operations executed on vectors, matrices and quaternions.
-
22
TRAPEX - solution of quadrature problems on finite intervals using trapezoidal sums with polynomial extrapolation and adaptive order and stepsize control.
- Previous
- You're on page 1
- Next
