Results 41 to 50 of about 4,148,143 (214)
On the determination of cusp points of 3-R\underline{P}R parallel manipulators [PDF]
, 2010 This paper investigates the cuspidal configurations of 3-RPR parallel manipulators that may appear on their singular surfaces in the joint space. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make ...
Chablat, Damien +3 more
core +5 more sources
Computing Independent Variable Sets for Polynomial Ideals
Journal of Mathematics, 2022 Computing independent variable sets for polynomial ideals plays an important role in solving high-dimensional polynomial equations. The computation of a Gröbner basis for an ideal, with respect to a block lexicographical order in classic methods, is huge,
Zhuoran Yang, Chang Tan
doaj +1 more source
A Robust Visual Localization Method With Unknown Focal Length Camera
IEEE Access, 2021 PnP problem is well researched in many fields, such as computer vision. It is considered the fundamental method to solve the key problems of robot SLAM.
Xiliang Yin +3 more
doaj +1 more source
Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems [PDF]
International Symposium on Symbolic and Algebraic Computation, 2019 Grö bner bases is one the most powerful tools in algorithmic nonlinear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables.
M. Bender +2 more
semanticscholar +1 more source
Computer Science Journal of Moldova, 1996 Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas.
Hans Schonemann
doaj
An extension of Buchberger's criteria for Groebner basis decision
, 2009 Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the first question. It
Adams +10 more
core +1 more source
A note on Computing SAGBI-Grobner bases in a Polynomial Ring over a Field [PDF]
Computer Science Journal of Moldova, 2006 In the paper [2] Miller has made concrete Sweedler's theory for ideal bases in commutative valuation rings (see [5]) to the case of subalgebras of a polynomial ring over a field, the ideal bases are called SAGBI-Grobner bases in this case.
Hans Ofverbeck
doaj
Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019 Recent developments in formal verification of arithmetic datapaths make efficient use of symbolic computer algebra algorithms. The circuit is modeled as an ideal in polynomial rings, and Gröbner basis (GB) reductions are performed over these polynomials ...
Utkarsh Gupta, P. Kalla, V. Rao
semanticscholar +1 more source
GBLA: Gröbner Basis Linear Algebra Package [PDF]
International Symposium on Symbolic and Algebraic Computation, 2016 This is a system paper about a new GPLv2 open source C library GBLA implementing and improving the idea [8] of Faugère and Lachartre (GB reduction).
Brice Boyer +4 more
semanticscholar +1 more source
Generalization of Buchberger’s Algorithm with Respect to Several Orderings on Difference Modules
پژوهشهای ریاضی, 2021 Grobner basis with respect to several orderings is a powerful tool to compute multivariate difference dimension polynomials. In this paper, an algorithm for computing a Grobner basis of a difference module over a ground difference field with respect to ...
hamzeh harfsheno +2 more
doaj