JavaScript / TypeScript API

nerdamer/advanced

Advanced symbolic tools including complex values and Gröbner-basis operations.

Direct npm import. The items on this page are JavaScript / TypeScript exports from nerdamer/advanced. For functions used inside nerdamer('...'), see Nerdamer Notation.
18 exports

Functions

eliminate(polys: readonly SparsePolynomial[], vars: readonly string[], keepVars: readonly string[], opts?: Omit<GroebnerBasisOptions, "order">): SparsePolynomial[]Function

Computes the part of the ideal that lies in the polynomial ring generated by keepVars.

Groebner(polys: readonly SparsePolynomial[], order: MonomialOrder, reduced: boolean): SparsePolynomial[]Function

Computes a Groebner basis for exact sparse integer polynomials. The input polynomials must belong to the same ring. With reduced: true, the basis is interreduced, coefficient content is removed, leading signs are normalized, and exact monic normalization is applied when possible. Results are sorted deterministically and the supplied polynomials are not modified.

groebnerBasisWithOptions(polys: readonly SparsePolynomial[], opts?: GroebnerBasisOptions): SparsePolynomial[]Function

Computes a Groebner basis with ordering, strategy, and budget control.

idealMembership(f: SparsePolynomial, polys: readonly SparsePolynomial[], order: MonomialOrder, opts?: Omit<GroebnerBasisOptions, "order" | "reduced">): booleanFunction

Tests exact ideal membership by reducing against a computed Groebner basis.

reduceByBasis(f: SparsePolynomial, basis: readonly SparsePolynomial[], order: MonomialOrder): SparsePolynomialFunction

Reduces a polynomial by a basis or arbitrary reducer set using fraction-free arithmetic.

solveRationalSystem(polys: readonly SparsePolynomial[], vars: readonly string[], opts?: Omit<GroebnerBasisOptions, "order" | "reduced">): RationalSolution[]Function

Solves a zero-dimensional polynomial system for rational coordinates.

Classes

ComplexClass

Represents a numerical complex value backed by decimal.js components.

FunctionSolverClass

Searches a fixed interval for real roots of a univariate expression.

GroebnerBudgetExceededClass

Thrown when a Groebner pair-count or basis-size budget is exhausted. GroebnerBudgetExceeded.stats is the live counter snapshot from the aborted computation. The error keeps that object by reference and does not freeze it.

SparsePolynomialClass

Sparse polynomial with bigint coefficients and bigint exponents. The variable count is part of the polynomial rather than inferred from its support. Exponent vectors therefore have one exact entry for every variable, including zero polynomials and constants. The internal map key is an encoding detail and is never exposed or parsed by polynomial algorithms.

Types

FunctionSolverOptions: unknownType

Type exported by Nerdamer.

Root: unknownType

Type exported by Nerdamer.

APIs

GroebnerBasisOptions: unknownAPI

Controls monomial order, result normalization, pair strategy, and deterministic budgets.

GroebnerStats: unknownAPI

Deterministic work counters captured when a Groebner resource budget is exceeded.

MonomialOrder: "LEX" | "GRLEX" | "GREVLEX"API

Monomial order used for leading terms, pair processing, and reduction.

RationalSolution: Map<string, { … }>API

Maps each solved variable to a reduced rational numerator/denominator pair. Only rational coordinates discovered by triangular back-substitution are represented.

RootFindingMethod: "Brent" | "NewtonRaphson"API

Numerical method used to refine a candidate interval.

SparsePolynomialTerm: Readonly<{ … }>API

API exported by Nerdamer.