scientific article; zbMATH DE number 1206418
From MaRDI portal
Publication:4209232
zbMATH Open0920.13026MaRDI QIDQ4209232FDOQ4209232
Authors: David A. Cox, John B. Little, Donal O'Shea 
Publication date: 6 October 1998
Title of this publication is not available (Why is that?)
Recommendations
integer programmingpolynomial equation solvingstandard basisresultantsalgebraic coding theoryeffectivitymultivariate polynomial splinesGröbner basis
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Computational aspects and applications of commutative rings (13Pxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic geometry (14-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to commutative algebra (13-01)
Cited In (only showing first 100 items - show all)
- Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition
- Bifurcation values for a family of planar vector fields of degree five
- The implicit equation of a canal surface
- Computing strong regular characteristic pairs with Gröbner bases
- Linear complete differential resultants and the implicitization of linear DPPEs
- Using \(\mu \)-bases to implicitize rational surfaces with a pair of orthogonal directrices
- Change of order for regular chains in positive dimension
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- The adjacency graph of a real algebraic surface
- Principal invariants and inherent parameters of diffusion kurtosis tensors
- Axial moving planes and singularities of rational space curves
- Computing isolated roots of sparse polynomial systems in affine space
- Sparse FGLM algorithms
- Computing the primary decomposition of zero-dimensional ideals
- Algorithms for computing triangular decomposition of polynomial systems
- Algebraic combinatorics of diametric magic circles
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- An implicitization algorithm for rational surfaces with no base points
- Implicitization of rational surfaces by means of polynomial interpolation
- List decoding of Hermitian codes using Gröbner bases
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Multivariate polynomial system solving using intersections of eigenspaces.
- Division algorithms for Bernstein polynomials
- A Gröbner Basis for Certain Affine Monomial Curves
- The Construction of Orthonormal Wavelets Using Symbolic Methods and a Matrix Analytical Approach for Wavelets on the Interval
- A perturbed differential resultant based implicitization algorithm for linear DPPEs
- Primary decomposition of zero-dimensional ideals over finite fields
- Ad-nilpotent ideals of a parabolic subalgebra
- Solving parametric piecewise polynomial systems
- Set-theoretic generators of rational space curves
- Numerical proper reparametrization of parametric plane curves
- Computing Amoebas
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Commutative partial differential operators
- Definitizability of normal operators on Krein spaces and their functional calculus
- Macaulay style formulas for sparse resultants
- Reparametrization of a rational ruled surface using the \(\mu\)-basis
- Cumulants in noncommutative probability theory. IV: Noncrossing cumulants: de Finetti's theorem and \(L^{p}\)-inequalities
- Gröbner bases of contraction ideals
- Gröbner basis, Mordell-Weil lattices and deformation of singularities. I
- Gröbner basis, Mordell-Weil lattices and deformation of singularities. II
- How tangents solve algebraic equations, or a remarkable geometry of discriminant varieties
- Competitive equilibria in semi-algebraic economies
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- On the free resolution induced by a Pommaret basis
- Explicit estimates for the number of rational points of singular complete intersections over a finite field
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Realization theory for rational systems: minimal rational realizations
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- Gröbner bases and wavelet design
- Poisson geometry of 𝑆𝐿(3,ℂ)-character varieties relative to a surface with boundary
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
- On lines and joints
- Tensors product and hyperdeterminant of boundary formats product
- Tangent cone algorithm for homogenized differential operators
- Trace and residue calculus: a new version of the Abel-inverse theorem, abelian forms
- Cohen-Macaulayness of almost complete intersection tangent cones
- A commutative algebraic approach to the fitting problem
- On the computation of matrices of traces and radicals of ideals
- Error-correction of linear codes via colon ideals
- Properties and construction of extreme bipartite states having positive partial transpose
- Implicitizing rational surfaces without base points by moving planes and moving quadrics
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Computation of isotopisms of algebras over finite fields by means of graph invariants
- On the De Boer-Pellikaan method for computing minimum distance
- Subresultants in multiple roots
- On the computation of spectra in free probability
- Kernels of discrete convolutions and application to stationary subdivision operators
- Multiple point compression on elliptic curves
- Accurate solution of polynomial equations using Macaulay resultant matrices
- Inherently improper surface parametric supports
- A univariate resultant-based implicitization algorithm for surfaces
- Irreducibility criteria for skew polynomials.
- Linear sparse differential resultant formulas
- Computing representation matrices for the action of Frobenius on cohomology groups
- Computing multihomogeneous resultants using straight-line programs
- On degree bounds for the sparse Nullstellensatz
- Rota-Baxter operators on 4-dimensional complex simple associative algebras
- The predicates of the Apollonius diagram: algorithmic analysis and implementation
- Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case
- Gröbner bases and generalized Padé approximation
- Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications
- Hybrid sparse resultant matrices for bivariate polynomials
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces
- Using symmetries in the eigenvalue method for polynomial systems
- Ideal intersections in rings of partial differential operators
- Reducible compositions of spherical four-bar linkages with a spherical coupler component
- Pseudozeros of multivariate polynomials
- Fast and stable polynomial equation solving and its application to computer vision
- Parametrizations of toric varieties over any field
- Algebraic characterization of uniquely vertex colorable graphs
- \textsc{Azurite}: an algebraic geometry based package for finding bases of loop integrals
- Multivariate subresultants in roots
- Aggregate error locator and error value computation in AG codes
- A matrix-based approach to properness and inversion problems for rational surfaces
- System theory for system identification.
- Using polynomial interpolation for implicitizing algebraic curves
- On puncturing of codes from norm-trace curves
- On the identifiability of ternary forms
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 Q4209232)
