A new registration algorithm based on Newton-Raphson iteration is proposed to align images with rigid body transformation. A set of transformation parameters consisting of translation in x and y and rotation angle around z is calculated by optimizing a specified similarity metric using the Newton-Raphson method. This algorithm has been tested by registering and correlating pairs of topography m...

We first recall some properties of infinite tridiagonal matrices considered as matrix transformations in sequence spaces of the forms sξ , sξ , s (c) ξ , or lp(ξ). Then, we give some results on the finite section method for approximating a solution of an infinite linear system. Finally, using a quasi-Newton method, we construct a sequence that converges fast to a solution of an infinite linear ...

We consider possibly stiff and implicit systems of ordinary differential equations (ODEs). The major difficulty and computational bottleneck in the implementation of fully implicit Runge–Kutta (IRK) methods resides in the numerical solution of the resulting systems of nonlinear equations. To solve those systems we show that the use of inexact simplified Newton methods is efficient. Linear syste...

We propose an approach to solving two-dimensional linear and nonlinear boundary-value problems of statics for shallow shells based on the generalized method finite integral transformations Newton– Kantorovich–Raphson linearization. In case, application is reduced construction two with respect different variables in analyzed domain under assumption that kernels one transformation are transforms ...

The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton’s method for general quintic polynomials to the case f(x) = x − c x + 1. Then we use symbolic dynamics to consider this last case and construct a kneading sequences tree for Newton maps. Finally, we prove that ...

Recently, the globally uniquely solvable (GUS) property of the linear transformation M ∈ Rn×n in the second-order cone linear complementarity problem (SOCLCP) receives much attention and has been studied substantially. Yang and Yuan [30] contributed a new characterization of the GUS property of the linear transformation, which is formulated by basic linear-algebra-related properties. In this pa...