Search Results for "polynomial"
Sort By:
Showing 99 open source projects for "polynomial"
View related business solutions-
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.
-
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
TaylorSeries.jl
Taylor polynomial expansions in one and several independent variables
A Julia package for Taylor polynomial expansions in one or more independent variables. -
2
HomotopyContinuation.jl
A Julia package for solving systems of polynomials
HomotopyContinuation.jl is a Julia package for solving systems of polynomial equations by numerical homotopy continuation. Many models in the sciences and engineering are expressed as sets of real solutions to systems of polynomial equations. We can optimize any objective whose gradient is an algebraic function using homotopy methods by computing all critical points of the objective function. An important special case is when the objective function is the euclidean distance to a given point. ... -
3
SumOfSquares.jl
Sum of Squares Programming for Julia
SumOfSquares.jl is a JuMP extension that, when used in conjunction with MultivariatePolynomial and PolyJuMP, implements a sum of squares reformulation for polynomial optimization. -
4
MultivariatePolynomials.jl
Multivariate polynomials interface
...It defines abstract types and an API for multivariate monomials, terms, and polynomials and gives default implementation for common operations on them using the API. On the one hand, This packages allows you to implement algorithms on multivariate polynomials that will be independant on the representation of the polynomial that will be chosen by the user. On the other hand, it allows the user to easily switch between different representations of polynomials to see which one is faster for the algorithm that he is using. -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
5
Polynomials.jl
Polynomial manipulations in Julia
Basic arithmetic, integration, differentiation, evaluation, root finding, and fitting for univariate polynomials in Julia. -
6
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
7
Nemo.jl
Julia bindings for various mathematical libraries (including flint2)
Nemo is a computer algebra package for the Julia programming language. It aims to cover commutative algebra, number theory and group theory. Julia bindings for various mathematical libraries (including flint2) -
8
AbstractAlgebra.jl
Generic abstract algebra functionality in pure Julia
AbstractAlgebra is a pure Julia package for computational abstract algebra. It grew out of the Nemo project and provides all of the abstract types and generic implementations that Nemo relies on. It was originally developed by William Hart, Tommy Hofmann, Fredrik Johansson and Claus Fieker with contributions from others. Current maintainers are Claus Fieker, Tommy Hofmann and Max Horn. -
9
Surrogates.jl
Surrogate modeling and optimization for scientific machine learning
A surrogate model is an approximation method that mimics the behavior of a computationally expensive simulation. In more mathematical terms: suppose we are attempting to optimize a function f(p), but each calculation of f is very expensive. It may be the case we need to solve a PDE for each point or use advanced numerical linear algebra machinery, which is usually costly. The idea is then to develop a surrogate model g which approximates f by training on previous data collected from... -
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.
-
10
MathPHP
Powerful modern math library for PHP
Math PHP is a library that brings advanced mathematical functions and data analysis capabilities to PHP applications. It covers a wide range of topics, including linear algebra, calculus, statistics, probability, and numerical analysis. Math PHP is designed for developers and data scientists who require precise and efficient mathematical computations in PHP, making it suitable for scientific computing and data processing. -
11
DataFrame
C++ DataFrame for statistical, Financial, and ML analysis
...DataFrame also includes a large collection of analytical algorithms in the form of visitors. These are from basic stats such as Mean, and Std Deviation and return, … to more involved analysis such as Affinity Propagation, Polynomial Fit, and Fast Fourier transform of arbitrary length … including a good collection of trading indicators. You can also easily add your own algorithms. -
12
Reduce.jl
Symbolic parser for Julia language term rewriting using REDUCE algebra
REDUCE is a portable general-purpose computer algebra system. It is a system for doing scalar, vector and matrix algebra by computer, which also supports arbitrary precision numerical approximation and interfaces to gnuplot to provide graphics. It can be used interactively for simple calculations (as illustrated in the screenshot below) but also provides a full programming language, with a syntax similar to other modern programming languages. REDUCE supports alternative user interfaces... -
13
DeepXDE
A library for scientific machine learning & physics-informed learning
...Solving forward/inverse integro-differential equations (IDEs) [SIAM Rev.] fPINN: solving forward/inverse fractional PDEs (fPDEs) [SIAM J. Sci. Comput.] NN-arbitrary polynomial chaos (NN-aPC): solving forward/inverse stochastic PDEs (sPDEs) [J. Comput. Phys.] PINN with hard constraints (hPINN): solving inverse design/topology optimization [SIAM J. Sci. Comput.] Residual-based adaptive sampling [SIAM Rev., arXiv] Gradient-enhanced PINN (gPINN) [Comput. Methods Appl. Mech. Eng.] PINN with multi-scale Fourier features [Comput. ... -
14
C++ Eigenvectors
C++ matrix class template with eigenvectors
All code is in a single .h file except for a .cpp file with the main() demo. Computation time scales as N^4. Also has class template Polynomial. Has extensive operators and methods. Algorithm summary: Any polynomial of degree m is uniquely and simply determined by its values at m+1 points. In particular the characteristic polynomial of an NxN matrix A can be determined by evaluating the determinant |x * I - A| at N+1 distinct values of x. Householder reduction is used to find determinants. ... -
15
OpenSpectra
User interface to control a Hamamtsu C12880MA spectrometer
Use this software as an user interface for the Hamamatsu C12880MA mini spectrometer connected to an Arduino board. The project details can be found in my github repository: https://github.com/luramire/OpenSpectra -
16
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. ... -
17
Eleana
Program for the analysis of spectroscopic data, in particular EPR(ESR)
Eleana is a program for manipulating, modifying and analyzing various spectroscopic data, in particular electron paramagnetic resonance spectra. It allows you to import data from Bruker spectrometers such as Elexsys or EMX and data from any ASCII file or imported from the clipboard. The program is under constant development, but already has many functions implemented for spectral analysis. Some of the basic functions include: baseline corrections, filtering, spectral clipping, integration /... -
18
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
-
19
matgts
programs for geotechnical engineering and mathematics
...mtfem - finite element analysis, 2D, plane strain state (C, SDL), GNU/Linux and Wind0ws executables present; mtpile - analysis of a laterally loaded pile (C, SDL); mtslope - slope stability and displacement analysis using limit equilibrium (C,SDL); jswall - analysis of a diaphragm wall (JavaScript); jsmath - mathematics: polynomial equations, linear systems of equations, eigenvalues, matrix multiplication, matrix inversion (JavaScript); mtwall - obsolete program for analysing a diaphragm wall (C, SDL). Some Javascript programs require at least Firefox 3 or 4, because of <canvas> and "use strict". -
20
NAVAL-SEM
Award-winning open-source offline SEM platform for PLS-SEM & CB-SEM
NAVAL-SEM is an award-winning, free and open-source offline Structural Equation Modeling (SEM) platform supporting PLS-SEM and CB-SEM workflows. Designed for researchers, PhD scholars, professors, and analysts, it provides visual model building, measurement assessment, structural model analysis, and reproducible research workflows without subscriptions or cloud dependency. Features include: • PLS-SEM & CB-SEM • Bootstrapping, mediation, moderation & conditional process analysis • HTMT,... -
21
C++ Complex Calculator
C++ complex calculator with arrays, matrices, eigenvectors, functions
...A variable may simultaneously represent a scalar, an array, and a string. Arrays up to ten dimensions are allowed. Householder reduction is used for determinants, eigenvectors, and QR matrix factorization. Class Matrix and class Polynomial facilitate finding the characteristic polynomial. A hash table is used to do fast variable and function lookup (they are entries in the same table). Collisions are handled in the hash table by making each entry a linked list. Written as C++ classes using the STL libraries <complex> and <vector>. The Numerical Recipes routines zroots and laguer rewritten in C++ find the complex roots of a polynomial with complex coefficients. ... -
22
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,..... -
23
DDogleg Numerics
High performance numerics library in Java
DDogleg Numerics is a high performance Java library for non-linear optimization, robust model fitting, polynomial root finding, sorting, and more. Source code is publicly available and has been released under and Apache 2.0 license. -
24
CalcTools
A library of tools for math calculation
Java source intended to serve as a nexus for teaching both mathematics and software solutions for computation on iterative equations. Public interfaces allow a user to extend the available operator and function lists to external libraries. Currently the packaged libraries include the CERN Colt library and the Anaconda package of math libraries which include MpMath and SciPy. A user can easily extend the functionality by coding to the provided interfaces and dropping a JAR of the... -
25
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!)