• MultRoot

  • Referenced in 98 articles [sw00604]
  • Matlab package for computing polynomial roots and multiplicities. MultRoot is a collection of Matlab modules ... accurate computation of polynomial roots, especially roots with non-trivial multiplicities. As a blackbox-type ... polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated ... accuracy on multiple roots without using multiprecision arithmetic, even if the polynomial coefficients are inexact...
  • INTLAB

  • Referenced in 426 articles [sw04004]
  • simple) univariate functions univariate and multivariate (interval) polynomials rigorous real interval standard functions (fast, very ... matrix-vector residuals (interpreted, reference implementation, slow) multiple precision interval arithmetic with error bounds (does...
  • SLRA

  • Referenced in 23 articles [sw11262]
  • approximate GCD problem of multiple univariate polynomials in the weighted 2-norm. Backward error minimization...
  • GPGCD

  • Referenced in 9 articles [sw06224]
  • divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials...
  • FOXBOX

  • Referenced in 16 articles [sw00307]
  • underlying field and polynomial arithmetic. Multiple arithmetic plugins can be used in the same computation...
  • CUMODP

  • Referenced in 8 articles [sw08402]
  • Typical operations are matrix determinant computation, polynomial multiplication (both plain and FFT-based), univariate polynomial...
  • BPAS

  • Referenced in 8 articles [sw08399]
  • particular hardware accelerators. Typical operations are polynomial multiplication, multi-point evaluation and interpolation, real root ... BPAS distribution contains code for dense polynomials whose coefficients can be either rational numbers...
  • Audi

  • Referenced in 3 articles [sw19687]
  • internally powered by the truncated polynomial multiplication algorithm of the open source project Piranha some ... described in: Biscani, Francesco. Parallel sparse polynomial multiplication on modern hardware architectures. Proceedings ... Computation. ACM, 2012. Biscani, Francesco. Multiplication of sparse Laurent polynomials and Poisson series on modern ... fine-grained parallelization of the truncated polynomial multiplication. The benefits of this fine grained parallelization...
  • ADE-4

  • Referenced in 8 articles [sw14077]
  • linear regression methods including lowess and polynomial regression, multiple and PLS (partial least squares) regression...
  • MPFI

  • Referenced in 40 articles [sw00597]
  • shows that the overhead due to the multiple precision is completely acceptable. Eventually, some applications ... MPFI are given: robotics, isolation of polynomial real roots (by an algorithm combining symbolic...
  • M4GB

  • Referenced in 3 articles [sw35027]
  • store already computed (tail-)reduced multiples of basis polynomials to prevent redundant work ... computation of a term polynomial multiplication, where all computations are done over coefficient vectors over ... algorithm tailored for dense overdefined polynomial systems as a proof of concept and made...
  • Aztec

  • Referenced in 83 articles [sw12817]
  • necessary transformations for the matrix-vector multiplication and preconditioning. After the transformations, the iterative solvers ... Jacobi, block Jacobi, Gauss-Seidel, least-squares polynomials, and overlapping domain decomposition using sparse...
  • HolonomicFunctions

  • Referenced in 48 articles [sw06666]
  • annihilating ideals and execute closure properties (addition, multiplication, substitutions) for such functions. An annihilating ideal ... HolonomicFunctions: computations in Ore algebras (noncommutative polynomial arithmetic with mixed difference-differential operators), noncommutative Gröbner...
  • NUMATH

  • Referenced in 5 articles [sw00639]
  • polynomials, splines and trigonometric polynomials; numerical integration, including multiple integrals, solving nonlinear equations; minimization...
  • simPH

  • Referenced in 2 articles [sw23155]
  • hazard ratios) for linear coefficients, multiplicative interactions, polynomials, penalised splines, and non-proportional hazards ... also simulates and plots marginal effects for multiplicative interactions...
  • boolfun

  • Referenced in 1 article [sw20674]
  • also implements functionality to handle Boolean polynomials, namely multiplication and addition of multivariate polynomials with...
  • PARAM

  • Referenced in 14 articles [sw09669]
  • class. Due to parametricity, evaluation results are polynomials or rational functions. By instantiating the parameters ... function, one can cheaply obtain results for multiple individual instantiations, based on only a single...
  • Polynomials

  • Referenced in 4 articles [sw32226]
  • like addition, multiplication, and substitution. We also define (weak) monotonicity of polynomials and comparison...
  • SEGRE

  • Referenced in 5 articles [sw07760]
  • provides convenient procedures for calculations in multiplicity theory, intersection theory, and singularity theory. Based ... Hilbert polynomials of multigraded rings, it contains procedures for the calculation of mixed multiplicities...