Computations of multi-resultant with mechanization
From MaRDI portal
Publication:2572016
Recommendations
- Heuristics to accelerate the Dixon resultant
- A package for computations with classical resultants
- MAPLE---procedures for finding the resultants of systems of nonlinear algebraic equations
- Computing the Dixon resultant with the Maple package DR
- Computing multihomogeneous resultants using straight-line programs
Cites work
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- A new algorithm for integral of trigonometric functions with mechanization
- A new algorithm for symbolic integration with application
- An algorithm for Adomian decomposition method
- An algorithm for solving DAEs with mechanization
- Concise parallel Dixon determinant
- Fast computation of the Bézout and Dixon resultant matrices
- Matrices in elimination theory
- Resultants of determinantal varieties
- The resultant of an unmixed bivariate system
- The resultants method for approximating real fixed points of polynomials
Cited in
(9)- MAPLE---procedures for finding the resultants of systems of nonlinear algebraic equations
- An efficient method for computing resultant systems
- Computing multihomogeneous resultants using straight-line programs
- On computing the resultant of a polynomial and an entire function
- An algorithm for solving the high-order nonlinear Volterra-Fredholm integro-differential equation with mechanization
- A mechanical algorithm for solving the Volterra integral equation
- A new mechanical algorithm for solving the second kind of Fredholm integral equation
- Computing the Dixon resultant with the Maple package DR
- Efficient Algorithms for MultiPolynomial Resultant
This page was built for publication: Computations of multi-resultant with mechanization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572016)