Search Results for "point"
Sort By:
Showing 53 open source projects for "point"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
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. -
2
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. -
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). -
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.
-
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. -
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.
-
10
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. -
11
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. -
12
Excalidraw MCP
Fast and streamable Excalidraw MCP App
...Its design supports fast, streamable rendering with smooth viewport control and optional fullscreen editing so that diagrams feel live and fluid as they evolve. Users can deploy it locally or via services like Vercel, then configure their MCP host to point at the Excalidraw-MCP endpoint, so prompts like “draw an architecture diagram” yield immediate visual results within chat. -
13
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. -
14
SPX
A simple & straight-to-the-point PHP profiling extension
SPX, which stands for Simple Profiling eXtension, is just another profiling extension for PHP. It differentiates itself from other similar extensions as being totally free and confined to your infrastructure (i.e. no data leaks to a SaaS). Very simple to use: just set an environment variable (command line) or switch on a radio button (web request) to profile your script. Thus, you are free of manually instrumenting your code (Ctrl-C a long running command line script is even supported).... -
15
ggrepel
epel overlapping text labels away from each other in your ggplot2
...When placing text labels on a plot (e.g. labeling points), the labels can often overlap; ggrepel ensures labels don’t overlap (or overlap less) by repelling labels / pushing them away, adding connecting lines or nudges, etc. It improves the readability of plots, especially when many labels are present. Support for point and segment geoms (so labels can be connected by lines when moved). Supports both plotting of labels inside or outside plot area, with trimming/clipping etc. -
16
luscus
molecular editor and viewer
...Luscus can also visualize dipole moments, normal modes, molecular orbitals, electron densities and electrostatic potentials. In addition, simple geometrical objects can be rendered in order to point out a geometrical feature or a physical quantity. The program is developed as a graphical interface for MOLCAS program package, however it's adaptive nature makes possible using luscus with other computational program packages and chemical formats. If you use this program, please cite: G. Kovačević, V. Veryazov, J. Cheminformatics, 7 (2015) 1-10; DOI: 10.1186/s13321-015-0060-z -
17
JaxoDraw
JaxoDraw: Feynman Diagrams made easy!
JaxoDraw is a tool to generate Feynman diagrams in a mouse click-and-drag fashion. Graphs can be exported to a variety of graphics formats and arbitrary latex code can be used for labels to produce high-quality publishing-style figures. -
18
Foxglove Studio
Robotics visualization and debugging
...Use Foxglove Studio's rich interactive visualizations to analyze live connections and pre-recorded data. Experience the world as your robot does. Visualize images and point clouds, overlay bounding boxes, add classification labels and planned movements, and drill down into your data with plots or raw message views. Upload recordings to your private data lake for easy storage, searching, and analysis. Stream recorded data directly into Foxglove Studio to get insights into your robots' behavior. We're long-time fans and beneficiaries of open source software. ... -
19
jOcular
Optical Design Software for simulating systems of lenses, prisms, etc.
Optical Design Software for optical systems comprised of light sources, lenses, apertures, prisms, imagers, photometers, etc. Simulate light through the system and compute images and intensities at various locations in the design. -
20
GTB: Graphics Toolbox
C++ libraries and apps for computer graphics and data visualization
The Graphics Toolbox (GTB) is a collection of C++ libraries and apps for computer graphics and data visualization. Wagner Correa initially created GTB as part of his Ph.D. research at Princeton University in collaboration with Professor Claudio Silva and Dr. James Klosowski. Several other researchers later contributed to GTB (see the AUTHORS file). -
21
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. -
22
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. -
23
3Depict
atom probe software : visualisation and data analysis
This software is designed to help users visualize and analyze 3D point clouds with an associated real value, in a fast and flexible fashion. The primary use is in Atom Probe Tomography, which is an atomic imaging technique. However the program may also be useful in other areas, such as geospatial data, lidar, etc. -
24
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. -
25
Learn Julia the Hard Way
Learn Julia the hard way
...Julia was developed with the occasional reference to R, and with an avowed intent to improve upon R's clunkiness. R is a great language, but relatively slow, to the point that most people use it to rapidly prototype, and then implement the algorithm for production in Python or Java. Julia seeks to be as approachable as R but without the speed penalty.
