Search Results for "b-processor"
Sort By:
Showing 10 open source projects for "b-processor"
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.
-
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
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
2
Interpolations.jl
Fast, continuous interpolation of discrete datasets in Julia
This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time. -
3
QuantumOptics.jl
Library for the numerical simulation of closed as well as open quantum
QuantumOptics.jl is a numerical framework written in the Julia programming language that makes it easy to simulate various kinds of open quantum systems. It is inspired by the Quantum Optics Toolbox for MATLAB and the Python framework QuTiP. QuantumOptics.jl optimizes processor usage and memory consumption by relying on different ways to store and work with operators. The framework comes with a plethora of pre-defined systems and interactions making it very easy to focus on the physics, not on the numerics. Every function in the framework has been severely tested with all tests and their code coverage presented on the framework's GitHub page. -
4
VimBindings.jl
Vim bindings for the Julia REPL
Vim bindings for the Julia REPL. VimBindings.jl is a Julia package which brings vim emulation directly to the Julia REPL. -
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
5
QuadGK.jl
adaptive 1d numerical Gauss–Kronrod integration in Julia
...The package provides three basic functions: quadgk, gauss, and kronrod. quadgk performs the integration, gauss computes Gaussian quadrature points and weights for integrating over the interval [a, b], and kronrod computes Kronrod points, weights, and embedded Gaussian quadrature weights for integrating over [-1, 1]. -
6
HCubature.jl
Pure-Julia multidimensional h-adaptive integration
The HCubature module is a pure-Julia implementation of multidimensional "h-adaptive" integration. then hcubature(f, a, b) computes the integral, adaptively subdividing the integration volume into smaller and smaller pieces until convergence is achieved to the desired tolerance (specified by optional rtol and atol keyword arguments. Because hcubature is written purely in Julia, the integrand f(x) can return any vector-like object (technically, any type supporting +, -, * real, and norm: a Banach space). ... -
7
Roots.jl
Root finding functions for Julia
...The basic call is find_zero(f, x0, [M], [p]; kws...) where, typically, f is a function, x0 a starting point or bracketing interval, M is used to adjust the default algorithms used, and p can be used to pass in parameters. Bisection-like algorithms. For functions where a bracketing interval is known (one where f(a) and f(b) have alternate signs), a bracketing method, like Bisection, can be specified. 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. ... -
8
ThinkJulia.jl
Port of the book Think Python to the Julia programming language
ThinkJulia.jl is an open source educational project that adapts Think Python by Allen B. Downey into the Julia programming language, with contributions by Ben Lauwens. It provides a comprehensive introduction to programming and computational thinking using Julia’s modern, high-performance features. The book is structured to gradually teach core concepts such as variables, control flow, functions, recursion, object-oriented programming, and data structures, while offering hands-on exercises to reinforce each topic. ... -
9
Reexport.jl
Julia macro for re-exporting one module from another
Maybe you have a module X that depends on module Y and you want using X to pull in all of the symbols from Y. Maybe you have an outer module A with an inner module B, and you want to export all of the symbols in B from A. It would be nice to have this functionality built into Julia, but we have yet to reach an agreement on what it should look like. This short macro is a stopgap we have a better solution. -
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
10
LightGraphs
An optimized graphs package for the Julia programming language
LightGraphs offers both (a) a set of simple, concrete graph implementations -- Graph (for undirected graphs) and DiGraph (for directed graphs), and (b) an API for the development of more sophisticated graph implementations under the AbstractGraph type. The project goal is to mirror the functionality of robust network and graph analysis libraries such as NetworkX while being simpler to use and more efficient than existing Julian graph libraries such as Graphs.jl. It is an explicit design decision that any data not required for graph manipulation (attributes and other information, for example) is expected to be stored outside of the graph structure itself. ...
- Previous
- You're on page 1
- Next
