Search Results for "julia" - Page 14
Sort By:
Showing 546 open source projects for "julia"
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.
-
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.
-
1
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... -
2
ParallelStencil.jl
Package for writing high-level code for parallel stencil computations
ParallelStencil empowers domain scientists to write architecture-agnostic high-level code for parallel high-performance stencil computations on GPUs and CPUs. Performance similar to CUDA C / HIP can be achieved, which is typically a large improvement over the performance reached when using only CUDA.jl or AMDGPU.jl GPU Array programming. For example, a 2-D shallow ice solver presented at JuliaCon 2020 [1] achieved a nearly 20 times better performance than a corresponding GPU Array... -
3
LFortran
Official main repository for LFortran
LFortran is a modern open-source (BSD licensed) interactive Fortran compiler built on top of LLVM. It can execute the user’s code interactively to allow exploratory work (much like Python, MATLAB or Julia) as well as compile binaries with the goal of running the user’s code on modern architectures such as multi-core CPUs and GPUs. LFortran is in alpha (it is expected to not work on third-party codes and users enthusiastically participate in bug reporting and fixing). -
4
Manifolds.jl
Manifolds.jl provides a library of manifolds
Package Manifolds.jl aims to provide both a unified interface to define and use manifolds as well as a library of manifolds to use for your projects. This package is mostly stable, see #438 for planned upcoming changes. The implemented manifolds are accompanied by their mathematical formulae. The manifolds are implemented using the interface for manifolds given in ManifoldsBase.jl. You can use that interface to implement your own software on manifolds, such that all manifolds based on that... -
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
Functors.jl
Parameterise all the things
Functors.jl provides tools to express a powerful design pattern for dealing with large/ nested structures, as in machine learning and optimization. For large machine learning models, it can be cumbersome or inefficient to work with parameters as one big, flat vector, and structs help manage complexity; but it is also desirable to easily operate over all parameters at once, e.g. for changing precision or applying an optimizer update step. -
6
InfiniteOpt.jl
An intuitive modeling interface for infinite-dimensional optimization
A JuMP extension for expressing and solving infinite-dimensional optimization problems. InfiniteOpt.jl provides a general mathematical abstraction to express and solve infinite-dimensional optimization problems (i.e., problems with decision functions). Such problems stem from areas such as space-time programming and stochastic programming. InfiniteOpt is meant to facilitate intuitive model definition, automatic transcription into solvable models, permit a wide range of user-defined... -
7
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... -
8
Metalhead.jl
Computer vision models for Flux
Metalhead.jl provides standard machine learning vision models for use with Flux.jl. The architectures in this package make use of pure Flux layers, and they represent the best practices for creating modules like residual blocks, inception blocks, etc. in Flux. Metalhead also provides some building blocks for more complex models in the Layers module. -
9
DataFramesMeta.jl
Metaprogramming tools for DataFrames
Metaprogramming tools for DataFrames.jl objects to provide more convenient syntax. DataFrames.jl has the functions select, transform, and combine, as well as the in-place select! and transform! for manipulating data frames. DataFramesMeta.jl provides the macros @select, @transform, @combine, @select!, and @transform! to mirror these functions with more convenient syntax. Inspired by dplyr in R and LINQ in C#. -
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
OnlineStats.jl
Single-pass algorithms for statistics
OnlineStats does statistics and data visualization for big/streaming data via online algorithms. High-performance single-pass algorithms for statistics and data viz. Updated one observation at a time. Algorithms use O(1) memory. Algorithms use O(1) memory. -
11
Gen.jl
A general-purpose probabilistic programming system
An open-source stack for generative modeling and probabilistic inference. Gen’s inference library gives users building blocks for writing efficient probabilistic inference algorithms that are tailored to their models, while automating the tricky math and the low-level implementation details. Gen helps users write hybrid algorithms that combine neural networks, variational inference, sequential Monte Carlo samplers, and Markov chain Monte Carlo. Gen features an easy-to-use modeling language... -
12
PlutoSliderServer.jl
Web server to run just the `@bind` parts of a Pluto.jl notebook
Web server to run just the @bind parts of a Pluto.jl notebook. PlutoSliderServer can run a notebook and generate the export HTML file. This will give you the same file as the export button inside Pluto (top right), but automatically, without opening a browser. One use case is to automatically create a GitHub Pages site from a repository with notebooks. For this, take a look at our template repository that used GitHub Actions and PlutoSliderServer to generate a website on every commit. Many... -
13
PhysicalConstants.jl
Collection of fundamental physical constants with uncertainties
PhysicalConstants.jl provides common physical constants. They are defined as instances of the new Constant type, which is a subtype of AbstractQuantity (from Unitful.jl package) and can also be turned into Measurement objects (from Measurements.jl package) at request. Constants are grouped into different submodules so that the user can choose different datasets as needed. Currently, 2014 and 2018 editions of CODATA recommended values of the fundamental physical constants are provided. -
14
MultivariatePolynomials.jl
Multivariate polynomials interface
MultivariatePolynomials.jl is an implementation-independent library for manipulating multivariate polynomials. 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... -
15
ColorSchemes.jl
colorschemes, colormaps, gradients, and palettes
Color schemes, colormaps, gradients, and palettes. Choose ColorSchemes with care. Refer to Peter Kovesi's PerceptualColourMaps package, or to Fabio Crameri's Scientific Colour Maps for more information. If you want to make more advanced ColorSchemes, use linear-segment dictionaries or indexed lists, and use functions to generate color values, see the make_colorscheme() function in the ColorSchemeTools.jl package. -
16
ReachabilityAnalysis.jl
Compute reachable states of dynamical systems
Reachability analysis is concerned with computing rigorous approximations of the set of states reachable by a dynamical system. In the scope of this package are systems modeled by continuous or hybrid dynamical systems, where the dynamics change with discrete events. Systems are modeled by ordinary differential equations (ODEs) or semi-discrete partial differential equations (PDEs), with uncertain initial states, uncertain parameters or non-deterministic inputs. -
17
FiniteDifferences.jl
High accuracy derivatives, estimated via numerical finite differences
FiniteDifferences.jl estimates derivatives with finite differences. See also the Python package FDM. 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. -
18
ExponentialUtilities.jl
Fast and differentiable implementations of matrix exponentials
ExponentialUtilities is a package of utility functions for matrix functions of exponential type, including functionality for the matrix exponential and phi-functions. These methods are more numerically stable, generic (thus support a wider range of number types), and faster than the matrix exponentiation tools in Julia's Base. The tools are used by the exponential integrators in OrdinaryDiffEq. The package has no external dependencies, so it can also be used independently. -
19
CausalityTools.jl
Algorithms for detecting associations, dynamical influences
CausalityTools.jl is a package for quantifying associations and dynamical coupling between datasets, independence testing, and causal inference. Association measures from conventional statistics, information theory, and dynamical systems theory, for example, distance correlation, mutual information, transfer entropy, convergent cross mapping and a lot more. A dedicated API for independence testing, which comes with automatic compatibility with every measure-estimator combination you can... -
20
ComponentArrays.jl
Arrays with arbitrarily nested named components
The main export of this package is the ComponentArray type. "Components" of ComponentArrays are really just array blocks that can be accessed through a named index. This will create a new ComponentArray whose data is a view into the original, allowing for standalone models to be composed together by simple function composition. In essence, ComponentArrays allow you to do the things you would usually need a modeling language for, but without actually needing a modeling language. The main... -
21
Tullio.jl
Tullio is a very flexible einsum macro
Tullio is a very flexible einsum macro. It understands many array operations written in index notation -- not just matrix multiplication and permutations, but also convolutions, stencils, scatter/gather, and broadcasting. Used by itself the macro writes ordinary nested loops much like Einsum.@einsum. One difference is that it can parse more expressions, and infer ranges for their indices. Another is that it will use multi-threading (via Threads.@spawn) and recursive tiling, on large enough arrays. -
22
StructuralEquationModels.jl
A fast and flexible Structural Equation Modelling Framework
This is a package for Structural Equation Modeling in development. It is written for extensibility, that is, you can easily define your own objective functions and other parts of the model. At the same time, it is (very) fast. We provide fast objective functions, gradients, and for some cases hessians as well as approximations thereof. As a user, you can easily define custom loss functions. For those, you can decide to provide analytical gradients or use finite difference approximation /... -
23
PairPlots.jl
Beautiful and flexible vizualizations of high dimensional data
Beautiful and flexible visualizations of high-dimensional data. This package produces pair plots, otherwise known as corner plots or scatter plot matrices: grids of 1D and 2D histograms that allow you to visualize high-dimensional data. Pair plots are an excellent way to visualize the results of MCMC simulations, but are also a useful way to visualize correlations in general data tables. The default styles of this package roughly reproduce the output of the Python library corner.py for a... -
24
PDMats.jl
Uniform Interface for positive definite matrices of various structures
Uniform interface for positive definite matrices of various structures. Positive definite matrices are widely used in machine learning and probabilistic modeling, especially in applications related to graph analysis and Gaussian models. It is not uncommon that positive definite matrices used in practice have special structures (e.g. diagonal), which can be exploited to accelerate computation. PDMats.jl supports efficient computation on positive definite matrices of various structures. In... -
25
DiffOpt.jl
Differentiating convex optimization programs w.r.t. program parameters
DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in...
