Pages that link to "Item:Q1599530"
From MaRDI portal
The following pages link to Fast computation of the Bézout and Dixon resultant matrices (Q1599530):
Displayed 14 items.
- A recursive algorithm for constructing complicated Dixon matrices (Q606826) (← links)
- Kukles revisited: Advances in computing techniques (Q630663) (← links)
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients (Q1432892) (← links)
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces (Q1675354) (← links)
- Resultant elimination via implicit equation interpolation (Q1691953) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- Computing the intersection of two ruled surfaces by using a new algebraic approach (Q2457394) (← links)
- Computations of multi-resultant with mechanization (Q2572016) (← links)
- Numerical Instability of Resultant Methods for Multidimensional Rootfinding (Q2796860) (← links)
- Complexity of constructing Dixon resultant matrix (Q3174885) (← links)
- Computing the Dixon Resultant with the Maple Package DR (Q4610015) (← links)
- Division-free computation of subresultants using Bezout matrices (Q5850765) (← links)
- On the minors of the implicitization Bézout matrix for a rational plane curve (Q5940964) (← links)
- Efficient computation of moving planes for rational parametric surfaces with base points using Dixon resultants (Q6143340) (← links)