Cited in
(87)- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Absolute factoring of non-holonomic ideals in the plane
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Parametric quantified SAT solving
- Algorithms for Bernstein-Sato polynomials and multiplier ideals
- Thomas decomposition of algebraic and differential systems
- Computing specified generators of structured matrix inverses
- Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
- On some decidable and undecidable problems related to \(q\)-difference equations with parameters
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
- Consistency of finite difference approximations for linear PDE systems and its algorithmic verification
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals
- Resolvent representation for regular differential ideals
- Decomposition of generic multivariate polynomials
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Algorithmic Thomas decomposition of algebraic and differential systems
- Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes
- Black-box/white-box simplification and applications to quantifier elimination
- Computation with semialgebraic sets represented by cylindrical algebraic formulas
- Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable
- Lagrangian curves in a 4-dimensional affine symplectic space
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Solving recurrence relations using local invariants
- Iterative Toom-Cook methods for very unbalanced long integer multiplication
- Output-sensitive decoding for redundant residue systems
- Symbolic integration at compile time in finite element methods
- Computing canonical representatives of regular differential ideals
- scientific article; zbMATH DE number 5635443 (Why is no real title available?)
- The DMM bound: multivariate (aggregate) separation bounds
- Ginv
- RegularChains
- ALLTYPES
- Kan
- OreModules
- Janet
- BLAD
- DifferentialThomas
- Jets
- Milne
- primdec
- AlgebraicThomas
- OreMorphisms
- AIDA
- Vessiot
- Indiff
- MABSys
- DifferentialAlgebra
- InvolutiveBases
- STURM
- DiffRes
- NLControl
- OreAlgebraicAnalysis
- NumericalSchubertCalculus
- Algebraic and symbolic computation methods in dynamical systems. Based on articles written for the invited sessions of the 5th symposium on system structure and control, IFAC, Grenoble, France, February 4--6, 2013 and of the 21st international symposium on mathematical theory of networks and systems (MTNS 2014), Groningen, the Netherlands, July 7--11, 2014
- Global optimization of polynomials using generalized critical values and sums of squares
- Random polynomials and expected complexity of bisection methods for real solving
- Simultaneously row- and column-reduced higher-order linear differential systems
- Formal algorithmic elimination for PDEs
- Composition collisions and projective polynomials: statement of results
- TrIm
- Differential elimination by differential specialization of Sylvester style matrices
- On symbolic approaches to integro-differential equations
- A new algorithm for computing comprehensive Gröbner systems
- Differential invariants of conformal and projective surfaces
- A distribution input-output polynomial approach for estimating parameters in nonlinear models. Application to a chikungunya model
- A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
- A new incremental algorithm for computing Groebner bases
- When can we detect that a P-finite sequence is positive?
- Liouvillian solutions of irreducible second order linear difference equations
- Partial denominator bounds for partial linear difference equations
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Finding all Bessel type solutions for linear differential equations with rational function coefficients
- Complexity of creative telescoping for bivariate rational functions
- Polynomial integration on regions defined by a triangle and a conic
- Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals
- Blind image deconvolution via fast approximate GCD
- Differential algebra for derivations with nontrivial commutation rules
- Triangular decomposition of semi-algebraic systems
- Solving Schubert problems with Littlewood-Richardson homotopies
- NumGfun: a package for numerical and analytic computation with D-finite functions
- Easy composition of symbolic computation software: a new lingua franca for symbolic computation
- A method for semi-rectifying algebraic and differential systems using scaling type Lie point symmetries with linear algebra
- Linear sparse differential resultant formulas
- An equivalence theorem for regular differential chains
- Differential invariants of a Lie group action: syzygies on a generating set
- An in-place truncated Fourier transform and applications to polynomial multiplication
- Computing the singularities of rational space curves
This page was built for software: DIFFALG
