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 7 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)
- Computing the intersection of two ruled surfaces by using a new algebraic approach (Q2457394) (← links)
- Computations of multi-resultant with mechanization (Q2572016) (← 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)