Search Results for "point"
Sort By:
Showing 15 open source projects for "point"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
Krylov.jl
A Julia Basket of Hand-Picked Krylov Methods
If you use Krylov.jl in your work, please cite it using the metadata given in CITATION.cff. -
2
Roots.jl
Root finding functions for Julia
...The default is Bisection, for most floating point number types, employed in a manner exploiting floating point storage conventions. For other number types (e.g. BigFloat), an algorithm of Alefeld, Potra, and Shi is used by default. These default methods are guaranteed to converge. Other bracketing methods are available. -
3
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
4
MPI.jl
MPI wrappers for Julia
...MPI is based on a single program, multiple data (SPMD) model, where multiple processes are launched running independent programs, which then communicate as necessary via messages. As the main entry point for users, MPI.jl provides a high-level interface which loosely follows the MPI C API and is described in details in the following sections. The syntax should look familiar if you know MPI already, but some arguments may not be needed (e.g. the type or the number of elements of arrays, which are inferred automatically), others may be placed slightly differently, and others may be optional keyword arguments (e.g. for the index of the root process, or the source and destination of point-to-point communication functions). -
$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.
-
5
Infiltrator.jl
No-overhead breakpoints in Julia
...Running code that ends up triggering the @infiltrate REPL mode via inline evaluation in VS Code or Juno can cause issues, so it's recommended to always use the REPL directly. When the infiltration point is hit, it will drop you into an interactive REPL session that lets you inspect local variables and the call stack as well as execute arbitrary statements in the context of the current local and global scope. -
6
ImplicitDifferentiation.jl
Automatic differentiation of implicit functions
...Reasons can vary depending on your backend, but the most common include calls to external solvers, mutating operations or type restrictions. Those for which automatic differentiation is very slow. A common example is iterative procedures like fixed point equations or optimization algorithms. -
7
ProbNumDiffEq.jl
Probabilistic Numerical Differential Equation solvers via Bayesian fil
ProbNumDiffEq.jl provides probabilistic numerical ODE solvers to the DifferentialEquations.jl ecosystem. The implemented ODE filters solve differential equations via Bayesian filtering and smoothing. The filters compute not just a single point estimate of the true solution, but a posterior distribution that contains an estimate of its numerical approximation error. -
8
FastGaussQuadrature.jl
Julia package for Gaussian quadrature
A Julia package to compute n-point Gauss quadrature nodes and weights to 16-digit accuracy and in O(n) time. So far the package includes gausschebyshev(), gausslegendre(), gaussjacobi(), gaussradau(), gausslobatto(), gausslaguerre(), and gausshermite(). This package is heavily influenced by Chebfun. -
9
Surrogates.jl
Surrogate modeling and optimization for scientific machine learning
...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 evaluations of f. -
Error to trace to log to deploy. One click. No SSH.AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
-
10
FiniteDifferences.jl
High accuracy derivatives, estimated via numerical finite differences
...FiniteDiff.jl and FiniteDifferences.jl are similar libraries: both calculate approximate derivatives numerically. You should definitely use one or the other, rather than the legacy Calculus.jl finite differencing, or reimplementing it yourself. At some point in the future, they might merge, or one might depend on the other. -
11
HomotopyContinuation.jl
A Julia package for solving systems of polynomials
...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. An example of an non-algebraic objective function whose derivative is algebraic is the Kullback–Leibler divergence. Homotopy continuation methods allow us to study the conformation space of molecules as for example cyclooctane (CH₂)₈. This molecule consists of eight carbon atoms aligned in a ring, and eight hydrogen atoms, each of which is attached to one of the carbon atoms. -
12
Query.jl
Query almost anything in julia
...The package currently provides working implementations for in-memory data sources, but will eventually be able to translate queries into e.g. SQL. There is a prototype implementation of such a "query provider" for SQLite in the package, but it is experimental at this point and only works for a very small subset of queries. Query is heavily inspired by LINQ, in fact right now the package is largely an implementation of the LINQ part of the C# specification. Future versions of Query will most likely add features that are not found in the original LINQ design. -
13
Gaius.jl
Divide and Conquer Linear Algebra
Gaius.jl is a multi-threaded BLAS-like library using a divide-and-conquer strategy to parallelism, and built on top of the fantastic LoopVectorization.jl. Gaius spawns threads using Julia's depth-first parallel task runtime and so Gaius's routines may be fearlessly nested inside multi-threaded Julia programs. Gaius is not stable or well-tested. Only use it if you're adventurous. -
14
MonteCarlo.jl
Classical and quantum Monte Carlo simulations in Julia
...As such the package may still go through significant changes and the documentation may be outdated and incomplete. Note that classical Monte Carlo is also not a focus at this point. It is probably usable, but a lot of the adjustments made to DQMC have not been added to classical Monte Carlo, or have been added without thorough testing. -
15
Bridge.jl
A statistical toolbox for diffusion processes
Statistics and stochastic calculus for Markov processes in continuous time, include univariate and multivariate stochastic processes such as stochastic differential equations or diffusions (SDE's) or Levy processes.
- Previous
- You're on page 1
- Next
