This repository containts materials for End-to-End AI for Science
-
Updated
Oct 29, 2026 - Jupyter Notebook
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
modulusHere are 56 public repositories matching this topic...Language: All
Filter by language
Sort: Most stars
Sort options
This repository containts materials for End-to-End AI for Science
machine-learning ai deep-learning hpc artificial-intelligence weather-forecast navier-stokes pde pinn modulus physics-informed-neural-networks ai4hpc omniverse fourcastnet
The lid-driven cavity is a popular problem within the field of computational fluid dynamics (CFD) for validating computational methods. In this repository, we will walk through the process of generating a 2D flow simulation for the Lid Driven Cavity (LDC) flow using Nvidia Modulus framework.
Comprehensive univariate polynomial class. All arithmetic performed symbolically. Some advanced features include: Arithmetic of polynomial rings over a finite field, the Tonelli-Shanks algorithm, GCD, exponentiation by squaring, irreducibility checking, modular arithmetic (obviously) and polynomials from roots.
csharp math polynomials symbolic arithmetic polynomial gcd exponentiation polynomial-arithmetic symbolic-math modulus square-root legendre-symbol polynomial-rings generic-arithmetic-types biginteger-integer
Pure-Python library for working with modular arithmetic, congruence classes, and finite fields.
python library groups algebra mod python-library mathematics ring modular-arithmetic finite-fields field fields group rings abstract-algebra modulo modulus congruence-classes congruence-class congruence-relation
Declarative modular arithmetic for Swift Integers and Floating-Point types that supports Euclidean, flooring, and truncating division algorithms.
good looking calculator web app
Optimized bigint divmod implementations for division bases that have a large number of trailing 0 bits.
Modulus function.
A few scripts for the course 01017 Diskret Matematik at DTU, simply for the second part of the course which contains a lot of boring and long calculations. Here it's simply done in a few scripts.
Zero-based configuration builder for frontend integration projects.
Add this topic to your repoTo associate your repository with the modulus topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |