Regularization and Matrix Computation in Numerical Polynomial Algebra

DOI10.1007/978-3-211-99314-9_5zbMath1191.65036OpenAlexW60846433MaRDI QIDQ3576574

Zhonggang Zeng

Publication date: 30 July 2010

Published in: Texts and Monographs in Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-211-99314-9_5

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Related Items (4)

A regularization approach for estimating the type of a plane curve singularity ⋮ Stability analysis of asset flow differential equations ⋮ Duality of multiple root loci ⋮ The numerical factorization of polynomials

Uses Software

• CoCoA
• MixedVol
• MultRoot
• PHCpack
• SNAP
• SYNAPS
• ApaTools
• PHClab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical factorization of multivariate complex polynomials
• A unified method for multivariate polynomial factorizations
• Quasi-gcd computations
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Approximate GCD and its application to ill-conditioned algebraic equations
• Analysis of approximate factorization algorithm. I
• On approximate GCDs of univariate polynomials
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Isolated points, duality and residues
• Detection and validation of clusters of polynomial zeros
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Computation of approximate polynomial GCDs and an extension
• A new algorithm for sparse interpolation of multivariate polynomials
• A numerical elimination method for polynomial computations
• From an approximate to an exact absolute polynomial factorization
• Approximate factorization of multivariate polynomials using singular value decomposition
• A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
• The approximate irreducible factorization of a univariate polynomial
• Towards factoring bivariate approximate polynomials
• Semi-numerical determination of irreducible branches of a reduced space curve
• Approximate multivariate polynomial factorization based on zero-sum relations
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Pseudofactors of multivariate polynomials
• Algorithm 846
• Algebraic algorithms for structure determination in biological chemistry
• The Method of Resultants for Computing Real Solutions of Polynomial Systems
• Rank-Deficient and Discrete Ill-Posed Problems
• Numerical calculation of the multiplicity of a solution to algebraic equations
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Algorithm 795
• Computing multiple roots of inexact polynomials
• Approximate factorization of multivariate polynomials via differential equations
• The approximate GCD of inexact polynomials
• Factoring multivariate polynomials via partial differential equations
• Solving algebraic systems using matrix computations
• Matrix eigenproblems are at the heart of polynomial system solving
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Numerical Polynomial Algebra
• On multiplicities in polynomial system solving
• Newton's method for overdetermined systems of equations
• Computing the multiplicity structure in solving polynomial systems
• Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
• Computing the multiplicity structure from geometric involutive form
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• A Rank-Revealing Method with Updating, Downdating, and Applications
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Algorithm 835
• Perturbation bounds in connection with singular value decomposition
• Symbolic-numeric sparse interpolation of multivariate polynomials

This page was built for publication: Regularization and Matrix Computation in Numerical Polynomial Algebra