A Newton-like method for convex functions is derived. It is shown that this method can be better than the Newton method. Especially good results can be obtained if we combine these two methods. Illustrative numerical examples are given. Mathematics Subject Classification: 65H05

Introduction This paper describes the application of Newton Method for solving strictly convex separable network quadratic programs. The authors provide a brief synopsis of separable network quadratic programming and list the various techniques for solving the same. The main thrust of the paper is succinctly identified by the following: 1. Providing a generic subroutine that can be used by vari...

For the numerical solution of time-dependent partial differential equations, a class of meshfree exponential integrators is proposed. These methods are of particular interest in situations where the solution of the differential equation concentrates on a small part of the computational domain which may vary in time. For the space discretization, radial basis functions with compact support are s...

abstract L-bases and B-bases are two important classes of polynomial bases used for representing surfaces in CAGD. The B ezier and multinomial bases are special cases of both L-bases and B-bases. We establish that certain proper subclasses of bivariate Lagrange and Newton bases are L-bases and certain proper subclasses of power and Newton dual bases are B-bases. A geometric point-line duality b...

Abstract In the present paper, we study Newton polygons for L -functions of n -variable generalized Kloosterman sums. Generally, polygon has a topological lower bound, called Hodge polygon. order to determine polygon, explicitly construct basis top-dimensional Dwork cohomology. Using Wan’s decomposition theorem and diagonal local theory, obtain when coincides with particular, concretely get slo...

A conjecture of Le says that the Deligne polytope Δd is generically ordinary if p≡1(modD(Δd)), where D(Δd) a combinatorial constant determined by Δd. In this paper counterexample given to show not true in general.