scientific article

Stephen R. Czapor, Keith O. Geddes, George Labahn

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

resultants Gaussian elimination computer algebra constructive mathematics factorisation Maple differential algebra Chinese Remainder Theorem Risch algorithm GCD computation Gröbner Bases symbolic indefinite integration

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational aspects and applications of commutative rings (13Pxx)

Related Items

One-loop integrals with XLOOPS-GiNaC, Factoring systems of linear PDEs with finite-dimensional solution spaces, Cunningham numbers in modular arithmetic, Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits, Frozen orbits for satellites close to an Earth-like planet, Inversion of mosaic Hankel matrices via matrix polynomial systems, Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach, Buchberger's algorithm: The term rewriter's point of view, The shifted number system for fast linear algebra on integer matrices, Nonabelian sets with distinct $k$-sums, Linear differential equations in exponential extensions, Polynomial factorization algorithms over number fields, The security of the birational permutation signature schemes, Segment LLL reduction of lattice bases using modular arithmetic, Quantifying chaos in stock markets before and during COVID-19 pandemic from the phase space reconstruction, Look-ahead methods for block Hankel systems, Hensel construction with an arbitrary degree of convergence, Reduction-based creative telescoping for Fuchsian D-finite functions, Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases), Modular Las Vegas algorithms for polynomial absolute factorization, Univariate polynomial factorization over finite fields, Left-covariant differential calculi on $\mathrm{SL}_q(2)$ and $\mathrm{SL}_q(3)$, Exact symbolic-numeric computation of planar algebraic curves, On rational functions without Froissart doublets, A new approach to determine tensile stress states from the parameters of longitudinal waves, Modular strategic SMT solving with \textbf{SMT-RAT}, On square-free factorization of multivariate polynomials over a finite field., An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form, Enumeration of Seidel matrices, Multi-key Homomorphic Authenticators, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Convolution surfaces based on polygonal curve skeletons, Subresultants revisited., Sylvester's double sums: an inductive proof of the general case, Regular expression simplification, Constructive homomorphisms for classical groups., New Characterizations for the Eigenvalues of the Prolate Spheroidal Wave Equation, Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation, Polynomial algebra for Birkhoff interpolants, Binomial difference ideals, Unnamed Item, Bit-size estimates for triangular sets in positive dimension, Sparse bivariate polynomial factorization, Hypercomputation by definition, Calculating the set of orders of elements in the finite linear groups, Toward symbolic integration of elliptic integrals, Backward Error Analysis for Perturbation Methods, A practical model for computation with matrix groups., Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, Normal forms for general polynomial matrices, A robust unscented transformation for uncertain moments, A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, Output-sensitive modular algorithms for polynomial matrix normal forms, Algorithms for quadratic forms, A note on Gröbner bases and Berlekamp's algorithm, A fast parallel sparse polynomial GCD algorithm, A new algorithm for computing the extended Hensel construction of multivariate polynomials, The method of Gauss-Newton to compute power series solutions of polynomial homotopies, Computing high precision matrix Padé approximants, In honour of Keith Geddes on his 60th birthday, Real solution isolation with multiplicity of zero-dimensional triangular systems, An algebraic approach to continuous collision detection for ellipsoids, Generic, Type-Safe and Object Oriented Computer Algebra Software, Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra, Landen transformations and the integration of rational functions, Algorithms for solving linear systems over cyclotomic fields, Efficient $q$-integer linear decomposition of multivariate polynomials, Exact, efficient, and complete arrangement computation for cubic curves, The complexity of sparse Hensel lifting and sparse polynomial factorization, A Symbolic Approach to Compute a Null-Space Basis in the Projection Method, Algebraic properties of robust Padé approximants, An improved EZ-GCD algorithm for multivariate polynomials, An algorithm to simplify tensor expressions, Factorization of polynomials given by arithmetic branching programs, Factorization patterns on nonlinear families of univariate polynomials over a finite field, Second order linear differential equations with analytic uncertainties: stochastic analysis via the computation of the probability density function, On the Lambert $w$ function, Calculating cyclotomic polynomials, Computing Characteristic Polynomials of Matrices of Structured Polynomials, Using Sparse Interpolation in Hensel Lifting, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, Common factors in fraction-free matrix decompositions, A verified common lisp implementation of Buchberger's algorithm in ACL2, Construction of the Jordan decomposition by means of Newton's method, Chromatic polynomials and order ideals of monomials, Analytic combinatorics of non-crossing configurations, Algorithme de Bareiss, algorithme des sous-résultants, Solving multivariate algebraic equation by Hensel construction, An exact and efficient approach for computing a cell in an arrangement of quadrics, The RCH method for computing minimal polynomials of polynomial matrices, Complexity of nilpotent unification and matching problems., A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix, Introduction to the GiNaC framework for symbolic computation within the $\text{C}^{++}$ programming language, Predicting zero coefficients in formal power series computations., Which pivot to solve linear systems?, Algebraic methods and arithmetic filtering for exact predicates on circle arcs, Subresultant chains using Bézout matrices, Residue polynomial systems, The calculation of radical ideals in positive characteristic, Hensel lifting and bivariate polynomial factorisation over finite fields, Rapid multiplication modulo the sum and difference of highly composite numbers, Factoring multivariate polynomials via partial differential equations, Unnamed Item, Algebraic number fields and the LLL algorithm, A New Black Box Factorization Algorithm - the Non-monic Case, Computing Logarithmic Parts by Evaluation Homomorphisms✱, Nonintegrability of the SEIR epidemic model, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Ocean Surface Waves and Ocean-Atmosphere Interactions, Unnamed Item, Reduction of systems of nonlinear partial differential equations to simplified involutive forms, Constructing Maximal Subgroups of Classical Groups, Computation and Applications of Mathieu Functions: A Historical Perspective, An algorithm for the chinese remainder problem, Symbolic-numeric sparse interpolation of multivariate polynomials, Detecting algebraic curves in bad position, Rational solutions of Riccati-like partial differential equations, The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects, On the minors of the implicitization Bézout matrix for a rational plane curve, Rational Landen transformations on $\mathbb{R}$, Elementary Functions, Automatic derivation of probabilistic inference rules, Strong Coalitional Structure in an Open Vehicle Routing Game, Lazy and Forgetful Polynomial Arithmetic and Applications, Orthogonal designs via computational algebra, Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2, Criteria of algebraic independence with multiplicities and interpolation determinants, Using sparse interpolation to solve multivariate diophantine equations

Uses Software