A recursive algorithm for constructing complicated Dixon matrices
From MaRDI portal
Recommendations
- An extended fast algorithm for constructing the Dixon resultant matrix
- Complexity of constructing Dixon resultant matrix
- A new algorithm for the factorization and inversion of recursively generated matrices
- Fast recursive algorithm for a class of structured matrices
- Construction of recursive MDS matrices using DLS matrices
- A recursive doubling algorithm for inverting tridiagonal matrices
- scientific article; zbMATH DE number 1229693
- Algorithmic detection and construction of N-matrices
- An algebraic method to construct the Darboux matrix
Cites work
- scientific article; zbMATH DE number 1263399 (Why is no real title available?)
- An extended fast algorithm for constructing the Dixon resultant matrix
- Basic principles of mechanical theorem proving in elementary geometries
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- Fast computation of the Bézout and Dixon resultant matrices
Cited in
(4)
This page was built for publication: A recursive algorithm for constructing complicated Dixon matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606826)