Results 201 to 210 of about 5,078 (233)
Index reduction of differential algebraic equations by differential Dixon resultant
Applied Mathematics and Computation, 2018 High index differential algebraic equations (DAEs) are ordinary differential equations (ODEs) with constraints and arise frequently from many mathematical models of physical phenomenons and engineering fields.
Xiaolin Qin, Peter Fritzson
exaly +4 more sources
Solving geoinformatics parametric polynomial systems using the improved Dixon resultant [PDF]
Earth Science Informatics, 2018 Improvements in computational and observational technologies in geoinformatics, e.g., the use of laser scanners that produce huge point cloud data sets, or the proliferation of global navigation satellite systems (GNSS) and unmanned aircraft vehicles ...
Robert H Lewis +2 more
exaly +4 more sources
Corner edge cutting and Dixon A-resultant quotients
Journal of Symbolic Computation, 2004 10.1016/j.jsc.2003.06.001Journal of Symbolic Computation371101 ...
Chionh, Eng-Wee +3 more
exaly +3 more sources
Solving the recognition problem for six lines using the Dixon resultant
Mathematics and Computers in Simulation, 1999 The “Six-Line Problem ” arises in computer vision and in the automated analysis of images.Given a three-dimensional object, one extracts geometric features (for example six lines) and then, via techniques from algebraic geometry and geometric invariant ...
Robert H Lewis, Peter F Stiller
exaly +3 more sources
Distributed computation of dixon resultant with changeable arguments
2009 International Conference on Apperceiving Computing and Intelligence Analysis, 2009 Elimination method is an effective method for solving non-linear polynomial equations. It mainly includes Wu's methods, Grobner base and resultant methods. Dixon resultant is more efficient than other resultant methods. But Dixon matrix enlarges greatly when the polynomial sets have higher rank. Pro.Fu Hongguang et al worked out the recursive algorithm
Guo Rongxiang
exaly +3 more sources
Computing the Dixon Derived Polynomial by Combination Resultant Method
2010 International Conference on Computational and Information Sciences, 2010 Dixon resultant method is a fundamental elimination method for simultaneously eliminating several variables from polynomials. In this paper, we put forward the combination resultant method to construct any Dixon derived polynomial for any nonlinear polynomial system. Further we can obtain Dixon matrix.
Jingzhong Zhang, Yong Feng, Xun Yuan
exaly +3 more sources
Some of the next articles are maybe not open access.
Heuristics to accelerate the Dixon resultant
Mathematics and Computers in Simulation, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert H Lewis
exaly +3 more sources
Complexity of constructing Dixon resultant matrix
International Journal of Computer Mathematics, 2017Dixon resultant is a fundamental tool of elimination theory in the study and practice of algebraic geometry.
Xiaolin Qin
exaly +2 more sources
Heuristics to sift extraneous factors in Dixon resultants
Journal of Symbolic Computation, 2022This paper focuses in the frame of symbolic computation and, more precisely, on effective methods for elimination theory. Within this wide thematic field, the authors deal with the problem of detecting extraneous factors when computing resultants. In this case, Dixon resultants are studied.
Xiaolin Qin, Sheng Cao
exaly +2 more sources
A new interpolation algorithm for computing dixon resultants
ACM Communications in Computer Algebra, 2022Given a system of polynomial equations with parameters, we present a new interpolation algorithm for computing its Dixon resultant R. Our algorithm interpolates the monic square-free factors of R one at a time from monic univariate polynomial images of R using sparse ...
Ayoola Jinadu, Michael B. Monagan
openaire +2 more sources