The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools to prove the symmetric Jacobian Conjecture for the case F = X−H with H homogeneous and JH = 0. Other special results are also derived. We pose a combinatorial...

Numerical examples demonstrated that a prescribed positive Jacobian determinant alone can not uniquely determine a diffeomorphism. It is conjectured that the uniqueness of a transformation can be assured by its Jacobian determinant and the curl-vector. In this work, we study the uniqueness problem analytically and propose an approach to the proof of the uniqueness of a transformation with presc...

A class of trust-region algorithms is developed and analyzed for the solution of optimization problems with nonlinear equality and inequality constraints. Based on composite-step trust region methods and a filter approach, the resulting algorithm also does not require the computation of exact Jacobians; only Jacobian vector products are used along with approximate Jacobian matrices. As demonstr...

Many ordinary diierential equation and diierential algebraic equation codes terminate the nonlinear iteration for the corrector equation when the diierence between successive iterates (the step) is suuciently small. This termination criterion avoids the expense of evaluating the non-linear residual at the nal iterate. Similarly, Jacobian information is not usually computed at every time step, b...

In the early 1990s, Flynn gave an explicit description of the Jacobian of a genus 2 hyperelliptic curve to perform efficient arithmetic on these objects. In this paper, we give a generalization of Flynn’s work when the ground field has characteristic 2. More precisely, we give an explicit description of both the Jacobian and the Kummer surface. We also give (and explain how we found) explicit f...