Much recent attention has been devoted to gradient descent algorithms where the steepest descent step size is replaced by a similar one from a previous iteration or gets updated only once every second step, thus forming a faster gradient descent method. For unconstrained convex quadratic optimization these methods can converge much faster than steepest descent. But the context of interest here ...

Every morphism from ℙ n to

In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...

background: in most of defecography films, the symphysis pubis is obscured, especially in obese patients, and the parameters will change in values if x-ray is interpreted by different reviewers or if the patient changes his/her position between the phases. this study was carried out to determine how to do the defecography to obtain fixed parameters. â  methods: eighty patients that had been can...

In this paper, we give the rigidity theorem for a log morphism as an extension of a fixed scheme morphism. We also give several applications of the rigidity theorem.

A non-erasing morphism is weakly unambiguous with respect to a pattern if no other non-erasing morphism maps the pattern to the same image. If the size of the target alphabet is at least three, then the patterns for which there exists a length-increasing weakly unambiguous morphism can be characterized using the concept of loyal neighbors of variables. In this article this characterization is g...