Symbolic and numeric methods for exploiting structure in constructing resultant matrices
exact polynomial arithmetic algorithmsexistence of rootsmultivariate nonlinear polynomial equationsNewton matricesnumerical examplesnumerical stabilityresultant matricessparse eliminationsymbolic computation
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)
The authors describe the construction of sparse resultant, or Newton, matrices to compute solutions of nonlinear systems. By exploiting the quasi-Toeplitz structure of the Newton matrix the time complexity of the problem is decreased by roughly one order of magnitude. Fast and numerically stable methods for determining the rank of a rectangular matrix, as well as exact polynomial arithmetic algorithms are used, under a particular model of sparseness, to provide for bounds, linear in the number of variables and number of non-zero terms. Examples analysed elsewhere are used to illustrate the approach.
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A subdivision-based algorithm for the sparse resultant
- Computation of a specified root of a polynomial system of equations using eigenvectors
- Computation of approximate polynomial GCDs and an extension
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Generalized Nested Dissection
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3771547 (Why is no real title available?)
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1008369 (Why is no real title available?)
- scientific article; zbMATH DE number 1859217 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3055967 (Why is no real title available?)
- Multivariate polynomials, duality, and structured matrices
- New techniques for the computation of linear recurrence coefficients
- On the complexity of sparse elimination
- On the Newton polytope of the resultant
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Résolution des systèmes d'équations algébriques
- Solving sparse linear equations over finite fields
- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Improved algorithms for computing determinants and resultants
- Multihomogeneous resultant formulae by means of complexes
- Multilinear polynomial systems: root isolation and bit complexity
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Schur aggregation for linear systems and determinants
- Space saving calculation of symbolic resultants
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Rational univariate reduction via toric resultants
- Parametrization of approximate algebraic surfaces by lines
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Numerical instability of resultant methods for multidimensional rootfinding
- Implicitization of curves and (hyper)surfaces using predicted support
- scientific article; zbMATH DE number 1253983 (Why is no real title available?)
- Solving linear systems of equations with randomization, augmentation and aggregation
- Overdetermined Weierstrass iteration and the nearest consistent system
- New progress in real and complex polynomial root-finding
- Parametrization of approximate algebraic curves by lines
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600039)
