Showing 7 open source projects for "e-root"

View related business solutions
  • Streamline Azure Security with Palo Alto Networks VM-Series Icon
    Streamline Azure Security with Palo Alto Networks VM-Series

    Centrally manage physical and virtualized firewalls with Panorama

    Improve your security posture and reduce incident response time. Use the VM-Series to natively analyze Azure traffic and dynamically drive policy updates based on workload changes.
    Learn more
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 1
    UnROOT.jl

    UnROOT.jl

    Native Julia I/O package to work with CERN ROOT files objects

    UnROOT.jl is a reader for the CERN ROOT file format written entirely in Julia, without any dependence on ROOT or Python.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 2
    Polynomials.jl

    Polynomials.jl

    Polynomial manipulations in Julia

    Basic arithmetic, integration, differentiation, evaluation, root finding, and fitting for univariate polynomials in Julia.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    LineSearches.jl

    LineSearches.jl

    Line search methods for optimization and root-finding

    Line search methods for optimization and root-finding. This package provides an interface to line search algorithms implemented in Julia. The code was originally written as part of Optim, but has now been separated out to its own package.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    NonlinearSolve.jl

    NonlinearSolve.jl

    High-performance and differentiation-enabled nonlinear solvers

    Fast implementations of root-finding algorithms in Julia that satisfy the SciML common interface. For information on using the package, see the stable documentation. Use the in-development documentation for the version of the documentation that contains the unreleased features. NonlinearSolve.jl is a unified interface for the nonlinear solving packages of Julia.
    Downloads: 3 This Week
    Last Update:
    See Project
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB 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.
    Start Free
  • 5
    MPI.jl

    MPI.jl

    MPI wrappers for Julia

    ...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).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    VimBindings.jl

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Roots.jl

    Roots.jl

    Root finding functions for Julia

    This package contains simple routines for finding roots, or zeros, of scalar functions of a single real variable using floating-point math. The find_zero function provides the primary interface. 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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB