Numerical Decomposition of the Solution Sets of Polynomial Systems Into Irreducible Components

SIAM Journal on Numerical Analysis - United States
doi 10.1137/s0036142900372549
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Factoring Solution Sets of Polynomial Systems in Parallel

English

Decomposition of Some Witten-Reshetikhin-Turaev Representations Into Irreducible Factors

Symmetry, Integrability and Geometry: Methods and Applications (SIGMA)
GeometryMathematical PhysicsAnalysisTopology
2019English

Invariant Algebraic Sets and Symmetrization of Polynomial Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2019English

Clustering for Disconnected Solution Sets of Numerical CSPs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

The Number of Irreducible Factors of a Polynomial. I

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Irreducible Numerical Semigroups

Pacific Journal of Mathematics
Mathematics
2003English

Decomposition of Electromagnetic Fields Into Upgoing and Downgoing Components

Geophysics
PetrologyEnergyGeochemistryGeophysics
2006English

On the Number of Irreducible Factors of a Polynomial II

Annales Polonici Mathematici
Mathematics
1983English

On the Shape of Solution Sets of Systems of (Functional) Equations

Aequationes Mathematicae
CombinatoricsMathematicsApplied MathematicsDiscrete Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy