Numerical Polynomial Algebra

DOI10.1137/1.9780898717976zbMath1058.65054OpenAlexW1529743226MaRDI QIDQ4825151

Publication date: 5 November 2004

Full work available at URL: https://doi.org/10.1137/1.9780898717976

approximate solutions polynomial systems approximate zeros approximate data empirical multivariate polynomial systems numerical basis computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Computational aspects and applications of commutative rings (13Pxx) Nonlinear algebraic or transcendental equations (65Hxx)

Related Items

Validated Root Enclosures for Interval Polynomials with Multiplicities, Two-step Newton's method for deflation-one singular zeros of analytic systems, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Computing border bases, An algorithmic method for checking global asymptotic stability of nonlinear polynomial systems with parameters, Solving systems of polynomial equations -- a tensor approach, The close relation between border and Pommaret marked bases, Subideal border bases, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials, Stickelberger and the Eigenvalue Theorem, Efficient computation of dual space and directional multiplicity of an isolated point, Analysis of normal-form algorithms for solving systems of polynomial equations, Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method, Stable normal forms for polynomial system solving, Chebyshev constants, linear algebra and computation on algebraic curves, A stabilized normal form algorithm for generic systems of polynomial equations, Deformations of border bases, Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine, A recursive algorithm of exactness verification of relaxations for robust SDPs, A comparison of companion matrix methods to find roots of a trigonometric polynomial, Improved two-step Newton's method for computing simple multiple zeros of polynomial systems, Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, Verification of a low-degree polynomial vanishing at empirical points, Chern numbers of smooth varieties via homotopy continuation and intersection theory, A regularization approach for estimating the type of a plane curve singularity, Computing the nearest singular univariate polynomials with given root multiplicities, Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one, Simple varieties for limited precision points, Output frequency response function of nonlinear Volterra systems, Computing coupled border bases, Toric eigenvalue methods for solving sparse polynomial systems, A fast recursive orthogonalization scheme for the Macaulay matrix, Finite Time Distributions of Stochastically Modeled Chemical Systems with Absolute Concentration Robustness, On the null spaces of the Macaulay matrix, Computing the multiplicity structure of an isolated singular solution: case of breadth one, A multivariate generalization of Prony's method, Artificial discontinuities of single-parametric Gröbner bases, An algorithm for addressing the real interval eigenvalue problem, Multiplication matrices and ideals of projective dimension zero, An algorithm to parametrize approximately space curves, High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic, Multidimensional realisation theory and polynomial system solving, The nearest complex polynomial with a zero in a given complex domain, Computing all border bases for ideals of points, Overdetermined Weierstrass iteration and the nearest consistent system, Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries, A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals, Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme, Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems, On approximate triangular decompositions in dimension zero, Numerical Evidence for a Conjecture in Real Algebraic Geometry, Numerical computation of H-bases, Pivoting in extended rings for computing approximate Gröbner bases, From Oil Fields to Hilbert Schemes, Regularization and Matrix Computation in Numerical Polynomial Algebra, ApCoA = Embedding Commutative Algebra into Analysis, Global minimization of rational functions and the nearest GCDs, The geometry of border bases, Deterministic normal position transformation and its applications, Sweeping algebraic curves for singular solutions, Approximate polynomial GCD by approximate syzygies, Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves, Term Cancellations in Computing Floating-Point Gröbner Bases, Characterizations of border bases, Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis, Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation, Computing real roots of a polynomial in Chebyshev series form through subdivision, Newton's method with deflation for isolated singularities of polynomial systems, Real and complex pseudozero sets for polynomials with applications, Stability and super-resolution of generalized spike recovery, A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set, Solving Polynomial Systems via Truncated Normal Forms, Roots of Bivariate Polynomial Systems via Determinantal Representations, Stable border bases for ideals of points, A Practical Method for Floating-Point Gröbner Basis Computation, The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures, Approximate computation of zero-dimensional polynomial ideals, The Approach of Moments for Polynomial Equations, On isolation of simple multiple zeros and clusters of zeros of polynomial systems, An improved Toeplitz algorithm for polynomial matrix null-space computation, Solving polynomial systems via symbolic-numeric reduction to geometric involutive form, Nearest multivariate system with given root multiplicities, The model matching problem for a class of polynomial non-linear discrete input–output systems with cross-products. An algorithmic approach, On border basis and Gröbner basis schemes, Multiple zeros of nonlinear systems, Computing Equilibrium Points of Genetic Regulatory Networks, A prolongation-projection algorithm for computing the finite real variety of an ideal, Numerical algebraic geometry and algebraic kinematics, Almost vanishing polynomials for sets of limited precision points, Rayleigh quotient methods for estimating common roots of noisy univariate polynomials, Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition, Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition, On the regularity of the monomial point of a border basis scheme, BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS, On the multiplicity of isolated roots of sparse polynomial systems, Degröbnerization: a political manifesto, Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems, Generalized Linear Latent Variable Models with Flexible Distribution of Latent Variables, A unified approach to computing the nearest complex polynomial with a given zero, Accurate solution of near-colliding Prony systems via decimation and homotopy continuation