Search Results for "root windows"

UnROOT.jl is a reader for the CERN ROOT file format written entirely in Julia, without any dependence on ROOT or Python.

Basic arithmetic, integration, differentiation, evaluation, root finding, and fitting for univariate polynomials in Julia.

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.

This is a basic Julia wrapper for the portable message-passing system Message Passing Interface (MPI). Inspiration is taken from mpi4py, although we generally follow the C and not the C++ MPI API. (The C++ MPI API is deprecated.) 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...

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...

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. The package includes its own high-performance nonlinear solvers which include the ability to swap out to fast direct and iterative...

MESH is a tool that measures distortion between two discrete surfaces (triangular meshes) using the Hausdorff distance to compute a maximum, mean and root-mean-square errors between two given surfaces. It also displays the error values on the surface.