Numerical Polynomial Algebra
approximate dataapproximate solutionsapproximate zerosempirical multivariate polynomial systemsnumerical basis computationpolynomial systems
Computational aspects and applications of commutative rings (13Pxx) 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) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Nonlinear algebraic or transcendental equations (65Hxx) Symbolic computation and algebraic computation (68W30)
Written primarily as a textbook, this book is a very thorough account of the current state of research in solving polynomial systems derived from empirical data through the use of numerical analysis, combined with computer algebra. Particular emphasis is placed on continuity, numerical stability, and establishing the validity (as opposed to correctness) of results. The text is highly accessible to students and researchers in both numerical analysis and computer algebra, with chapters on ``Representations of polynomial ideals, ``Polynomials with coefficients of limited accuracy, and ``Approximate numerical computation. Types of systems covered include both univariate and multivariate, zero dimensional (possibly with clusters and/or multiple zeros) and positive dimensional, with the chapter on positive dimensional systems being the least complete, as it is still very much a topic of on-going research. Techniques explored include interval arithmetic, Groebner bases (which takes a back seat to the more general notion of border bases), normal set representations, Taylor approximations and eigenvalue methods. The algorithmic determination of greatest common divisors, interpolation, and the numerical factorization of multivariate polynomials are also touched upon. All data lie in \(\mathbb{C}\) or \(\mathbb{R}\), permit ing ``an analysis of the sensitivity of results to small changes in the data of a problem. The ``quotient ring aspect of ideals is employed frequently, in order to facilitate the use of concepts and algorithms from numerical linear algebra. As the book is intended to be a comprehensive view of a broad, and largely unexplored area, some sections are written more in the style of a survey of results than a standard text. This is particularly true of sections covering areas that are tangential to the main thrust of the book: determining approximate zeros of polynomial systems with coefficients of limited accuracy. The author's emphasis on examples and exercises, the lack of excessive technical detail, the unified view of computation with empirical polynomials from the standpoint of numerical linear algebra, and the ``Historical and bibliographic notes sections at the ends of the chapters make this a wonderfully readable textbook on a topic sparsely covered in the current literature. Additionally, as this is a fairly new area of mathematics, many research problems abound, and a large number of these are mentioned in the text. Multiple references to earlier sections and examples make this well-integrated book difficult to use as a reference text, though the ``Notes sections are excellent guides to the current literature.
- 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
- On border basis and Gröbner basis schemes
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Almost vanishing polynomials for sets of limited precision points
- Efficient computation of dual space and directional multiplicity of an isolated point
- A stabilized normal form algorithm for generic systems of polynomial equations
- Verification of a low-degree polynomial vanishing at empirical points
- Characterizations of border bases
- Multiplication matrices and ideals of projective dimension zero
- Numerical computation of H-bases
- Deterministic normal position transformation and its applications
- Approximate polynomial GCD by approximate syzygies
- Degröbnerization: a political manifesto
- Solving systems of polynomial equations -- a tensor approach
- The close relation between border and Pommaret marked bases
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Computing coupled border bases
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- On the multiplicity of isolated roots of sparse polynomial systems
- Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
- 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
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- 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
- A recursive algorithm of exactness verification of relaxations for robust SDPs
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- An algorithm to parametrize approximately space curves
- Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries
- On approximate triangular decompositions in dimension zero
- Global minimization of rational functions and the nearest GCDs
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Computing real roots of a polynomial in Chebyshev series form through subdivision
- Newton's method with deflation for isolated singularities of polynomial systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Condition analysis of overdetermined algebraic problems
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- An algorithmic method for checking global asymptotic stability of nonlinear polynomial systems with parameters
- Roots of bivariate polynomial systems via determinantal representations
- A practical method for floating-point Gröbner basis computation
- The vanishing ideal of a finite set of points with multiplicity structures
- The approach of moments for polynomial equations
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Multiple zeros of nonlinear systems
- Numerical algebraic geometry and algebraic kinematics
- Generalized linear latent variable models with flexible distribution of latent variables
- Subideal border bases
- BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS
- Chebyshev constants, linear algebra and computation on algebraic curves
- A comparison of companion matrix methods to find roots of a trigonometric polynomial
- From oil fields to Hilbert schemes
- Regularization and matrix computation in numerical polynomial algebra
- ApCoA = Embedding Commutative Algebra into Analysis
- Term cancellations in computing floating-point Gröbner bases
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- The model matching problem for a class of polynomial non-linear discrete input–output systems with cross-products. An algorithmic approach
- Computing Equilibrium Points of Genetic Regulatory Networks
- 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
- A fast recursive orthogonalization scheme for the Macaulay matrix
- On the null spaces of the Macaulay matrix
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- High performance rearrangement and multiplication routines for sparse tensor arithmetic
- Multidimensional realisation theory and polynomial system solving
- Solving polynomial systems via truncated normal forms
- Overdetermined Weierstrass iteration and the nearest consistent system
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- 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
- Stickelberger and the Eigenvalue Theorem
- Toric eigenvalue methods for solving sparse polynomial systems
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- The geometry of border bases
- Finite Time Distributions of Stochastically Modeled Chemical Systems with Absolute Concentration Robustness
- Computing all border bases for ideals of points
- Real and complex pseudozero sets for polynomials with applications
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- 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
- Artificial discontinuities of single-parametric Gröbner bases
- An algorithm for addressing the real interval eigenvalue problem
- Polynomial paradigms. Trends and applications in science and engineering
- On Search for All Roots of a System of Quadratic Equations
- The nearest complex polynomial with a zero in a given complex domain
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations
- On the accuracy of Prony's method for recovery of exponential sums with closely spaced exponents
- Yet another eigenvalue algorithm for solving polynomial systems
- Preliminary orbits with overdetermined systems of Keplerian conservation laws
- Robust numerical algebraic geometry
- Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
- Pivoting in extended rings for computing approximate Gröbner bases
- Numerical methods for computing the greatest common divisor of univariate polynomials using floating point arithmetic
This page was built for publication: Numerical Polynomial Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825151)
