Improved algorithms for computing determinants and resultants
type: Item
instance of: scholarly article
title: Improved algorithms for computing determinants and resultants
zbMATH Open document ID: 1101.68981
author: Ioannis Z. Emiris
author: Victor Y. Pan
published in: Journal of Complexity
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 2136293
zbMATH Keywords: Computer algebra
zbMATH Keywords: Randomized algorithms
zbMATH Keywords: Matrix determinant
zbMATH Keywords: Bit complexity
zbMATH Keywords: Structured matrix
zbMATH Keywords: Polynomial system solving
describes a project that uses: MultRoot
describes a project that uses: na10
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: j.jco.2004.03.003
OpenAlex ID: W2108888104
cites work: On the computational power of pushdown automata
cites work: PRIMES is in P
cites work: Q4331740
cites work: Sign determination in residue number systems
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
cites work: Numerical computation of polynomial zeros by means of Aberth's method
cites work: Generalised characteristic polynomials
cites work: A subdivision-based algorithm for the sparse resultant
cites work: Q3316585
cites work: Q4209232
cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
cites work: Macaulay style formulas for sparse resultants
cites work: Q4329400
cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume
cites work: A Complete Implementation for Computing General Dimensional Convex Hulls
cites work: Symbolic and numeric methods for exploiting structure in constructing resultant matrices
cites work: Polynomial root finding using iterated Eigenvalue computation
cites work: Q5689624
cites work: Q4660696
cites work: On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
cites work: Q4038737
cites work: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
cites work: Q4550785
cites work: Efficient Algorithms for MultiPolynomial Resultant
cites work: Implicit representation of rational parametric surfaces
cites work: Multipolynomial resultant algorithms
cites work: A bibliography on roots of polynomials
cites work: A supplementary bibliography: on roots of polynomials
cites work: Computing the isolated roots by matrix methods
cites work: Parametrization of Newton's iteration for computations with structured matrices and applications
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Q2760974
cites work: Q4736841
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Point estimation of simultaneous methods for solving polynomial equations: A survey
cites work: Safe convergence of simultaneous methods for polynomial zeros
cites work: The guaranteed convergence of Laguerre-like method
cites work: Certification of numerical computation of the sign of the determinant of a matrix
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Efficient isolation of polynomial's real roots.
cites work: Q4720691
cites work: High-order lifting and integrality certification
cites work: The shifted number system for fast linear algebra on integer matrices
cites work: Q5601777
cites work: Q4406533
cites work: Solving sparse linear equations over finite fields
cites work: Q3963124
cites work: Q4660677
cites work: Q4274348
cites work: The theory of Smale's point estimation and its applications
DOI: 10.1016/J.JCO.2004.03.003
description: scientific article; zbMATH DE number 2136293