Improved algorithms for computing determinants and resultants
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 3785035 (Why is no real title available?)
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- scientific article; zbMATH DE number 1736029 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1795735 (Why is no real title available?)
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- scientific article; zbMATH DE number 2151228 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 2086387 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Complete Implementation for Computing General Dimensional Convex Hulls
- A bibliography on roots of polynomials
- A subdivision-based algorithm for the sparse resultant
- A supplementary bibliography: on roots of polynomials
- Certification of numerical computation of the sign of the determinant of a matrix
- Computing the isolated roots by matrix methods
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Efficient Algorithms for MultiPolynomial Resultant
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Efficient isolation of polynomial's real roots.
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Generalised characteristic polynomials
- High-order lifting and integrality certification
- Implicit representation of rational parametric surfaces
- Improved algorithms for computing determinants and resultants
- Macaulay style formulas for sparse resultants
- Multipolynomial resultant algorithms
- Numerical computation of polynomial zeros by means of Aberth's method
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- On the computational power of pushdown automata
- PRIMES is in P
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Polynomial root finding using iterated eigenvalue computation
- Safe convergence of simultaneous methods for polynomial zeros
- Sign determination in residue number systems
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving sparse linear equations over finite fields
- Solving zero-dimensional systems through the rational univariate representation
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- The guaranteed convergence of Laguerre-like method
- The shifted number system for fast linear algebra on integer matrices
- The theory of Smale's point estimation and its applications
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(24)- Schur aggregation for linear systems and determinants
- Additive preconditioning and aggregation in matrix computations
- Multilinear polynomial systems: root isolation and bit complexity
- scientific article; zbMATH DE number 2086387 (Why is no real title available?)
- Elimination theory in differential and difference algebra
- Fast computation of generic bivariate resultants
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Improved polynomial matrix determinant computation
- scientific article; zbMATH DE number 2187725 (Why is no real title available?)
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Computational Science and Its Applications – ICCSA 2004
- Counting solutions of a polynomial system locally and exactly
- Bernstein-Bezoutian matrices and curve implicitization
- Arithmetically improved algorithmic performance
- The shifted number system for fast linear algebra on integer matrices
- Improved algorithms for computing determinants and resultants
- Bezout matrices, subresultant polynomials and parameters
- Rational formulas for traces in zero-dimensional algebras
- Fast computation of special resultants
- Sparse differential resultant for Laurent differential polynomials
- Randomized preprocessing versus pivoting
- Probabilistic algorithms for computing resultants
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
This page was built for publication: Improved algorithms for computing determinants and resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763424)
