scientific article; zbMATH DE number 2142844
From MaRDI portal
Publication:4656084
zbMath1076.53018MaRDI QIDQ4656084
Publication date: 8 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (45)
A new incremental algorithm for computing Groebner bases ⋮ Degree bounds for Gröbner bases of low-dimensional polynomial ideals ⋮ A new algorithm for computing comprehensive Gröbner systems ⋮ Finding all bessel type solutions for linear differential equations with rational function coefficients ⋮ Simultaneously row- and column-reduced higher-order linear differential systems ⋮ Consistency of finite difference approximations for linear PDE systems and its algorithmic verification ⋮ Computation with semialgebraic sets represented by cylindrical algebraic formulas ⋮ Black-box/white-box simplification and applications to quantifier elimination ⋮ Parametric quantified SAT solving ⋮ A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra ⋮ Absolute factoring of non-holonomic ideals in the plane ⋮ Algorithms for Bernstein--Sato polynomials and multiplier ideals ⋮ Global optimization of polynomials using generalized critical values and sums of squares ⋮ A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals ⋮ Composition collisions and projective polynomials ⋮ Decomposition of generic multivariate polynomials ⋮ Chebyshev interpolation polynomial-based tools for rigorous computing ⋮ Blind image deconvolution via fast approximate GCD ⋮ Polynomial integration on regions defined by a triangle and a conic ⋮ Computing the singularities of rational space curves ⋮ Solving schubert problems with Littlewood-Richardson homotopies ⋮ When can we detect that a P-finite sequence is positive? ⋮ Complexity of creative telescoping for bivariate rational functions ⋮ Partial denominator bounds for partial linear difference equations ⋮ Real and complex polynomial root-finding with eigen-solving and preprocessing ⋮ Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method ⋮ Random polynomials and expected complexity of bisection methods for real solving ⋮ The DMM bound ⋮ Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes ⋮ Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology ⋮ Output-sensitive decoding for redundant residue systems ⋮ A Strassen-like matrix multiplication suited for squaring and higher power computation ⋮ Computing specified generators of structured matrix inverses ⋮ Yet another block Lanczos algorithm ⋮ Liouvillian solutions of irreducible second order linear difference equations ⋮ Solving recurrence relations using local invariants ⋮ On some decidable and undecidable problems related to q-difference equations with parameters ⋮ Iterative Toom-Cook methods for very unbalanced long integer multiplication ⋮ An in-place truncated fourier transform and applications to polynomial multiplication ⋮ Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable ⋮ Easy composition of symbolic computation software ⋮ Symbolic integration at compile time in finite element methods ⋮ Triangular decomposition of semi-algebraic systems ⋮ Invariants of surfaces in three-dimensional affine geometry ⋮ NumGfun
This page was built for publication:
