Results 171 to 180 of about 33,431,346 (225)
Some of the next articles are maybe not open access.
Polynomial Methods For Structure From Motion
[1988 Proceedings] Second International Conference on Computer Vision, 1990The authors analyze the limitations of structure from motion (SFM) methods presented in the literature and propose the use of a polynomial system of equations, with the unit quaternions representing rotation, to recover SFM under perspective projection.
C. Jerian, R. Jain
openaire +1 more source
2017
Separation of variables is a powerful idea in the study of partial differential equations, and the polynomial chaos method is a particular implementation of this idea for stochastic equations. While the elementary outcome ω is typically never mentioned explicitly in the notation of random objects, it is a variable that can potentially be separated from
Sergey V. Lototsky, Boris L. Rozovsky
openaire +1 more source
Separation of variables is a powerful idea in the study of partial differential equations, and the polynomial chaos method is a particular implementation of this idea for stochastic equations. While the elementary outcome ω is typically never mentioned explicitly in the notation of random objects, it is a variable that can potentially be separated from
Sergey V. Lototsky, Boris L. Rozovsky
openaire +1 more source
Gröbner Basis Methods in Polynomial Modelling
1998The Grobner basis (G-basis) method in the design of experiments was introduced by Pistone & Wynn (1996) and followed up by several strands of work one in particular addressing real practical applications: Holliday, Pistone, Riccomagno & Wynn (1997). This paper continues this latter series.
R. A. BATES +3 more
openaire +2 more sources
A Study on Homotopy Analysis Method and Clique Polynomial Method
, 2021S. Kumbinarasaiah, P. PreethamM.
semanticscholar +1 more source
A Method to Compute Minimal Polynomials
SIAM Journal on Algebraic Discrete Methods, 1985Let f(X) and g(X) be polynomials with coefficients in an arbitrary field K. Assume that f(X) is irreducible and let r be a root of f(X). We describe a new algorithm for computing the minimal polynomial of g(r) over K. The novelty of our algorithm is that it begins by computing the polynomial p(X,Y) of smallest degree such that \(p(f,g)=0\).
Peskin, Barbara R., Richman, David R.
openaire +2 more sources
Digit-by-Digit Methods for Polynomials
IBM Journal of Research and Development, 1963This paper presents a general system configuration for an arithmetic unit of a computer, which is used to solve polynomial problems efficiently. The technique is based on a digit-by-digit computation of the coefficients of the given polynomial, after the origin has been displaced systematically.
openaire +1 more source
Modal Reconstruction Methods With Zernike Polynomials
Journal of Refractive Surgery, 2005ABSTRACT PURPOSE: To compare the advantages and disadvantages of different techniques for fitting Zernike polynomials to surfaces. METHODS: Two different methods, Orthogonal Projection and Gram-Schmidt orthogonalization, are compared in terms of speed and performance at fitting a complex object.
openaire +2 more sources