Algorithms for computing triangular decomposition of polynomial systems
From MaRDI portal
Recommendations
- Algorithms for computing triangular decompositions of polynomial systems
- scientific article; zbMATH DE number 1736022
- Computations modulo regular chains
- Decomposing polynomial systems into simple systems
- The RegularChains library in Maple 10
- Triangular decomposition of semi-algebraic systems
- Solving via modular methods
- Intersection formulas and algorithms for computing triangular decompositions
- scientific article; zbMATH DE number 1860740
Cites work
- scientific article; zbMATH DE number 5722788 (Why is no real title available?)
- scientific article; zbMATH DE number 3926283 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 1189068 (Why is no real title available?)
- scientific article; zbMATH DE number 48827 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1273649 (Why is no real title available?)
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- scientific article; zbMATH DE number 204997 (Why is no real title available?)
- A complete algorithm for automated discovering of a class of inequality-type theorems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- A zero structure theorem for differential parametric systems
- Algorithmic properties of polynomial rings
- Algorithms for computing triangular decompositions of polynomial systems
- An elimination method for polynomial systems
- Associative differential operations
- Bit-size estimates for triangular sets in positive dimension
- Characteristic set method for differential-difference polynomial systems
- Comprehensive Triangular Decomposition
- Computations modulo regular chains
- Computing cylindrical algebraic decomposition via triangular decomposition
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Decomposing polynomial systems into simple systems
- Factorization-free decomposition algorithms in differential algebra
- Fast arithmetic for triangular sets: from theory to practice
- Lifting techniques for triangular decompositions
- Localization and primary decomposition of polynomial ideals
- Memory of my first research teacher: the great geometer Chern Shiing-Shen
- On the theories of triangular sets
- Optimizations of the subresultant algorithm
- Solving polynomial systems equation by equation
- The RegularChains library in Maple 10
- Triangular decomposition of semi-algebraic systems
Cited in
(50)- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Formal derivation of algorithms
- Multiplicity-preserving triangular set decomposition of two polynomials
- Comprehensive LU Factors of Polynomial Matrices
- Effective algorithms for computing triangular operator in Schubert calculus
- Characteristic decomposition: from regular sets to normal sets
- Triangular decomposition of semi-algebraic systems
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- A Direttissimo Algorithm for Equidimensional Decomposition
- Triangular decomposition of semi-algebraic systems
- Deterministic normal position transformation and its applications
- Computational schemes for subresultant chains
- Intersection formulas and algorithms for computing triangular decompositions
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- Parameter identification on abelian integrals to achieve Chebyshev property
- Generic regular decompositions for parametric polynomial systems
- Chordal graphs in triangular decomposition in top-down style
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Computing triangular systems and regular systems
- On solving parametric polynomial systems
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Triangular decomposition of matrices in a domain
- On the extended Hensel construction and its application to the computation of real limit points
- Computing strong regular characteristic pairs with Gröbner bases
- Lifting techniques for triangular decompositions
- Algorithms for computing triangular decompositions of polynomial systems
- Parallelization of triangular decompositions: techniques and implementation
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Computations modulo regular chains
- Subresultant chains using Bézout matrices
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Irredundant triangular decomposition
- scientific article; zbMATH DE number 1736022 (Why is no real title available?)
- Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- On the Chordality of Simple Decomposition in Top-Down Style
- Tensor inversion and its application to the tensor equations with Einstein product
- On approximate triangular decompositions in dimension zero
- Complexity of triangular representations of algebraic sets
- Decomposition of polynomial sets into characteristic pairs
- Bounding the number of limit cycles for a polynomial Liénard system by using regular chains
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Chordality preserving incremental triangular decomposition and its implementation
- Specifications for triangulation algorithms of elementary-algebraic systems
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- Design and implementation of multi-threaded algorithms in polynomial algebra
- Comprehensive characteristic decomposition of parametric polynomial systems
- Two new ways to formally prove Dandelin-Gallucci's theorem
- On Isolating Roots in a Multiple Field Extension
This page was built for publication: Algorithms for computing triangular decomposition of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413407)
