scientific article; zbMATH DE number 1254251
From MaRDI portal
Publication:4227296
zbMATH Open0920.65034MaRDI QIDQ4227296FDOQ4227296
Authors: Robert M. Corless, Patrizia Gianni, Stephen M. Watt, Barry Trager 
Publication date: 19 September 1999
Title of this publication is not available (Why is that?)
Recommendations
polynomial computationsLazard's \(u\)-resultant algorithmoverdetermined systems of polynomial equationssingular value decomposition algorithms
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Real polynomials: location of zeros (26C10)
Cited In (71)
- Polarimetric Fourier phase retrieval
- Guessing singular dependencies
- Title not available (Why is that?)
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Quartic coincidences and the singular value decomposition
- Approximate parametrization of plane algebraic curves by linear systems of curves
- A subdivision method for computing nearest gcd with certification
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Title not available (Why is that?)
- Structured total least norm and approximate GCDs of inexact polynomials
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Using symmetries in the eigenvalue method for polynomial systems
- A robust solution of the generalized polynomial Bézout identity
- Approximate square-free part and decomposition
- Pseudozeros of multivariate polynomials
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Polynomial computations for blind image deconvolution
- New progress in real and complex polynomial root-finding
- Parametrization of approximate algebraic curves by lines
- Root-finding by expansion with independent constraints
- Polynomial matrix linearization and strongly irreducible realization for singular systems
- The computation of multiple roots of a polynomial
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Regularization and matrix computation in numerical polynomial algebra
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Obtaining exact interpolation multivariate polynomial by approximation
- Recursive polynomial remainder sequence and its subresultants
- Nearest multivariate system with given root multiplicities
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- The canonical decomposition of \(\mathcal{C}^n_d\) and numerical Gröbner and border bases
- A computational study of ruled surfaces
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- The computation of multiple roots of a Bernstein basis polynomial
- On approximate linearized triangular decompositions
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Variable projection methods for approximate (greatest) common divisor computations
- Obtaining exact value by approximate computations
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Certified approximate univariate GCDs
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- On rational functions without Froissart doublets
- Computation of approximate polynomial GCDs and an extension
- Structured low rank approximation
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- On real factors of real interval polynomials
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- The amended DSeSC power method for polynomial root-finding
- Parametrization of approximate algebraic surfaces by lines
- Approximate factorization of multivariate polynomials using singular value decomposition
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- The ERES method for computing the approximate GCD of several polynomials
- Algebraic properties of robust Padé approximants
- Computing approximate greatest common right divisors of differential polynomials
- Computing multiple roots of inexact polynomials
- Bernstein-Bézoutian matrices
- Approximate polynomial GCD by approximate syzygies
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Title not available (Why is that?)
- Numerical and symbolical methods for the GCD of several polynomials
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Pseudospectra of exponential matrix polynomials
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227296)
