Numerical Polynomial Algebra
From MaRDI portal
Publication:4825151
DOI10.1137/1.9780898717976zbMATH Open1058.65054OpenAlexW1529743226MaRDI QIDQ4825151FDOQ4825151
Authors: Hans J. Stetter 
Publication date: 5 November 2004
Full work available at URL: https://doi.org/10.1137/1.9780898717976
Recommendations
approximate solutionspolynomial systemsapproximate zerosapproximate dataempirical multivariate polynomial systemsnumerical basis computation
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Symbolic computation and algebraic computation (68W30) 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)
Cited In (only showing first 100 items - show all)
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Term cancellations in computing floating-point Gröbner bases
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- On the null spaces of the Macaulay matrix
- A multivariate generalization of Prony's method
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries
- 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
- An algorithmic method for checking global asymptotic stability of nonlinear polynomial systems with parameters
- Deformations of border bases
- Regularization and matrix computation in numerical polynomial algebra
- Numerical algebraic geometry and algebraic kinematics
- Nearest multivariate system with given root multiplicities
- Multiple zeros of nonlinear systems
- Stability and super-resolution of generalized spike recovery
- Computing coupled border bases
- From oil fields to Hilbert schemes
- Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
- Multiplication matrices and ideals of projective dimension zero
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- High performance rearrangement and multiplication routines for sparse tensor arithmetic
- Numerical computation of H-bases
- An algorithm to parametrize approximately space curves
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Computing all border bases for ideals of points
- The geometry of border bases
- Subideal border bases
- Global minimization of rational functions and the nearest GCDs
- Output frequency response function of nonlinear Volterra systems
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- Overdetermined Weierstrass iteration and the nearest consistent system
- An algorithm for addressing the real interval eigenvalue problem
- Computing border bases
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- 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
- Simple varieties for limited precision points
- Stable border bases for ideals of points
- Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
- Accurate solution of near-colliding Prony systems via decimation and homotopy continuation
- 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
- Sweeping algebraic curves for singular solutions
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- The approach of moments for polynomial equations
- Real and complex pseudozero sets for polynomials with applications
- Approximate computation of zero-dimensional polynomial ideals
- On border basis and Gröbner basis schemes
- Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- On the regularity of the monomial point of a border basis scheme
- The nearest complex polynomial with a zero in a given complex domain
- Almost vanishing polynomials for sets of limited precision points
- Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
- Characterizations of border bases
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Generalized linear latent variable models with flexible distribution of latent variables
- 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
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Stable normal forms for polynomial system solving
- Computing Equilibrium Points of Genetic Regulatory Networks
- Artificial discontinuities of single-parametric Gröbner bases
- Pivoting in extended rings for computing approximate Gröbner bases
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- Toric eigenvalue methods for solving sparse polynomial systems
- The model matching problem for a class of polynomial non-linear discrete input–output systems with cross-products. An algorithmic approach
- A unified approach to computing the nearest complex polynomial with a given zero
- On the multiplicity of isolated roots of sparse polynomial systems
- Chebyshev constants, linear algebra and computation on algebraic curves
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Deterministic normal position transformation and its applications
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- The vanishing ideal of a finite set of points with multiplicity structures
- Solving systems of polynomial equations -- a tensor approach
- The close relation between border and Pommaret marked bases
- Title not available (Why is that?)
- Efficient computation of dual space and directional multiplicity of an isolated point
- Multidimensional realisation theory and polynomial system solving
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- A stabilized normal form algorithm for generic systems of polynomial equations
- A practical method for floating-point Gröbner basis computation
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- On approximate triangular decompositions in dimension zero
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- A recursive algorithm of exactness verification of relaxations for robust SDPs
- Stickelberger and the Eigenvalue Theorem
- Verification of a low-degree polynomial vanishing at empirical points
- Roots of bivariate polynomial systems via determinantal representations
- Solving polynomial systems via truncated normal forms
- Polynomial paradigms. Trends and applications in science and engineering
- On Search for All Roots of a System of Quadratic Equations
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)
