JSPM

Solve systems of linear equations using gaussian jordan pivoting method.

The goal is to provide a reusable component that abstracts away KaTeX configuration and makes it easy to use

Build, display, and solve algebraic equations.

Equational reasoning based on the unfailing Knuth-Bendix completion procedure

This package will solve little math problems with the help of internal functions.

A lightweight NPM package for solving modular equations using the Chinese Remainder Theorem (CRT). Supports modular inverse, LCM, and GCD calculations.

A support package for Jekyll plugin that converts LaTeX mathematical expressions to PNG images for better compatibility and improved rendering across different platforms

Plot equations as ASCII text, in Node or the browser

Linear equations solver

Tridiagonal matrix algorithm: In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of e

A multi-function solver. Each example outlines different scenarios and mathematical problems being solved.

Runge-Kutta integration for systems of equations using ndarrays.

Visualize javascript math using MathJax

Build, display, and solve algebraic equations.

Evaluate math expressions and solve equations

Evaluates Math equations with variables

Build, display, and solve algebraic equations.

A React component for solving and visualizing mathematical equations

Build, display, and solve algebraic equations.