Search Results for "polynomial"
Sort By:
Showing 31 open source projects for "polynomial"
View related business solutions-
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.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
2
Advanced Trigonometry Calculator
Open-source C/C++ math engine for advanced scientific computing
...Created in 2011 and maintained by Renato Alexandre dos Santos Freitas, ATC is designed as a practical Windows desktop application for advanced calculations, automation, and technical problem solving. ATC supports equation solving, polynomial tools, complex numbers, matrix calculations, statistics, physics, geometry, unit conversions, DSP/FFT operations, and scripting. It can also process batch TXT files, making it useful for repeatable calculations and automated workflows. The project also includes ATC Online Alpha, a WebAssembly-based version that brings parts of the ATC engine to the web. ... -
3
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
-
4
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),... -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
basic_numerical_methods
Didactic application to aid students in learning Numerical Methods;
A practical tool (for students and engineers) to foresee the result of calculus exercises. Calculation and visualization numerical methods for nonlinear equation, ODE, integration, linear system, polynomial fitting,..... -
6
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!) -
7
Polynomial System Solver
pss5 is a polynomial system solver, under development.
The objective of this project is to build a general-purpose polynomials system solver. While a few of those programs are available, this one will incorporate recent mathematical advances on mixed volume computations, sparse condition numbers and condition-metric homotopy. -
8
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.
-
9
C++11 implementation of the Galois Field of two to the power M, GF(2^M), as well as polynomial ring over GF(2^M).
-
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.
-
10
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. -
11
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 -
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. -
13
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. ...
-
14
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. -
15
HASEM
Matrix c++ library solving any linear algebra problems
...HASEM solves any linear equation of any kind, it might be homogenous/none homogenous, compute the inverse of square/none square matrices, find LU decomposition, find determinant and rank of matrices, calculate the characteristic polynomial of matrices, find the eigenvalues and eigen vectors and so on. HASEM uses many methods, therefore, you are not limited to just one method, you have the choice to define your desire method as default one. With over 200 member functions and over 40 none member functions HASEM is almost able to solve any linear algebra problems. HASEM support multidimensional as well, you can mix up your multidimensional matrix with other matrices with different size, and apply all operations on them as well.It's possible to save the computed matrix into files, and when required read it from files and load the data into matrices. ... -
16
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.
-
17
-
18
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.
-
19
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.
-
20
...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.
-
21
A polynomial-time algorithm for constructing level-2 phylogenetic networks from dense sets of rooted triplets.
-
22
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
-
23
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.
-
24
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.
-
25
