The greatest common divisor of and is , which divides . Divide the linear Diophantine equation by to obtainReducing modulo gives , so . Substitution gives the complete family of integer solutionsEvery such pair satisfies the equation, and every solution must have this residue for , so none are omitted. Positivity requires and . For integer these are exactly . Thus the pairs with both entries positive are
To find a critical point, apply multivariable Newton iteration to the gradient, rather than to the scalar value . The gradient and Hessian matrix areWrite the correction as . At , Newton's method in optimization requiresSubtracting the second equation from the first gives , so and . HenceThe gradient there isA critical point has not been found after one iteration.
At the alternative starting point , the Hessian matrix and gradient areThe correction would need to satisfy and simultaneously. This linear system is inconsistent. The standard iteration cannot take even its first step: the Hessian matrix is a singular matrix, and the required correction does not exist. This is a Newton correction compatibility condition failure, not merely an ambiguity between several corrections.
For multivariable Newton iteration, use the Jacobian matrixAt , direct evaluation givesWith , the required linear system is thereforeAfter solving this linear system, form . To get the second iterate, evaluate both the Jacobian matrix and the residual anew at , solveand set . Reusing the initial Jacobian matrix would define a different iteration. The requested linear system has deliberately been left unsolved.
Articles by others on the same topic
There are currently no matching articles.