Displaying similar documents to “Newton iteration for the closest normal matrix of order two.”

On diagonally preconditioning the 2-steps BFGS method with accumulated steps for supra-scale linearly constrained nonlinear programming.

Laureano F. Escudero (1982)

Qüestiió

Similarity:

We present an algorithm for supra-scale linearly constrained nonlinear programming (LNCP) based on the Limited-Storage Quasi-Newton's method. In large-scale programming solving the reduced Newton equation at each iteration can be expensive and may not be justified when far from a local solution; besides, the amount of storage required by the reduced Hessian matrix, and even the computing time for its Quasi-Newton approximation, may be prohibitive. An alternative based on the reduced...

Three dimensional modelling of the peach in MAPLE

Bartoň, Stanislav

Similarity:

Linearized Gauss-Newton iteration method is used to determine main axes of the three-dimensional ellipsoid approximating a peach. Three independent photos displaying the peach as ground, side, and front view are used as data sources. System MAPLE 11 was used as a computer environment. A practical example is presented in order to demonstrate the usage of all required commands. The quality of approximation is evaluated as a final part of the paper.

On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.

Laureano F. Escudero (1982)

Qüestiió

Similarity:

We present an algorithm for super-scale linearly constrained nonlinear programming (LCNP) based on Newton's method. In large scale programming solving Newton's equation at each iteration can be expensive and may not be justified when far from a local solution; we briefly review the current existing methodologies, such that by classifying the problems in small-scale, super-scale and supra-scale problems we suggest the methods that, based on our own computational experience, are more suitable...

Newton's iteration with a conjugate gradient based decomposition method for an elliptic PDE with a nonlinear boundary condition

Jonas Koko (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

Newton's iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton's method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each...

On Newton-like methods to enclose solutions of nonlinear equations

Günter Mayer (1989)

Aplikace matematiky

Similarity:

We present a class of Newton-like methods to enclose solutions of systems of nonlinear equations. Theorems are derived concerning the feasibility of the method, its global convergence, its speed and the quality of enclosure.