نتایج جستجو برای: pseudo jacobian

تعداد نتایج: 54547  

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

2007
Andreas Griewank

All methods for solving linear or nonlinear systems of equations require the evaluation of residual vectors, most algorithms are based on Jacobian-vector products and many schemes involve vector-Jacobian products. Moreover, while only exact Newton methods form and factor the Jacobian explicitly, some information about the size of its elements or the structure of its spectrum appears to be indes...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سیستان و بلوچستان - دانشکده ادبیات و علوم انسانی 1388

abstract: the present thesis includes ; one preface and 11speeches , that each speech considered in different researches . the prefact part , studied grammer back ground , the first speech considered a brief description about grammatical credits . the second speech considered the different typs of sentences , from structure and meaning points of view . the third speech considered the verb es...

Journal: :international journal of advanced design and manufacturing technology 0
mir amin hosseini hamidreza mohammadi daniali

in the research, six degrees of freedom hexapod parallel machine tool is studied and investigated. jacobian matrix is developed by cinematic relations differentiation and using weighted coefficient method, dimensional analysis operation is carried out on jacobian matrix. geometric parameters of cartesian robot workspace are optimized, considering a minimum allowable rotation about three axes, a...

2012
Michael Lülfesmann

Simulations and optimizations are carried out to investigate real-world problems in science and engineering. For instance, solving systems of linear equations with sparse Jacobian matrices is mandatory when using a Newton-type algorithm. The sparsity of Jacobian matrices is exploited and only a subset of the nonzero elements is determined to successfully reduce the usage of the restricting reso...

2007
Fredrik Larsson Erik Jonsson Michael Felsberg

We have combined inverse kinematics learned by LWPR with visual servoing to correct for inaccuracies in a low cost robotic arm. By low cost we mean weak inaccurate servos and no available joint-feedback. We show that from the trained LWPR model the Jacobian can be estimated. The Jacobian maps wanted changes in position to corresponding changes in control signals. Estimating the Jacobian for the...

2004
SHIGEKI MATSUTANI

The sine-Gordon equation has hyperelliptic al function solutions over a hyperelliptic Jacobian for y = f(x) of arbitrary genus g. This article gives an extension of the sine-Gordon equation to that over subvarieties of the hyperelliptic Jacobian. We also obtain the condition that the sine-Gordon equation in a proper subvariety of the Jacobian is defined.

2009
Jin-Gen Yang

Any endomorphism of Cn defined by n polynomials with everywhere non-vanishing Jacobian is an automorphism. The Jacobian conjecture originated fromKeller ([5]). Let F1, . . . , Fn ∈ C[x1, . . . , xn] be a set of n polynomials in n variables with n ≥ 1 such that the Jacobian of these polynomials is a nonzero constant. The Jacobian conjecture says that the subalgebra C[F1, . . . , Fn] of C[x1, . ....

Journal: :IACR Cryptology ePrint Archive 2007
Christian Robenhagen Ravnshøj

Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication. In this paper we show that if the l-Sylow subgroup of the Jacobian is not cyclic, then the embedding degree of the Jacobian with respect to l is one.

Journal: :SIAM J. Scientific Computing 2011
Stefania Bellavia Daniele Bertaccini Benedetta Morini

Newton-Krylov methods, combination of Newton-like methods and Krylov subspace methods for solving the Newton equations, often need adequate preconditioning in order to be successful. Approximations of the Jacobian matrices are required to form preconditioners and this step is very often the dominant cost of Newton-Krylov methods. Therefore, working with preconditioners destroys in principle the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید