In this paper, a new family of Dai-Liao–type conjugate gradient methods are proposed for unconstrained optimization problem. the methods, modified secant equation used in [H. Yabe and M. Takano, Comput. Optim. Appl. 28 (2004) 203–225] is considered Dai Liao’s conjugacy condition. Under some certain assumptions, we show that our globally convergent general functions with strong Wolfe line search...

Most of the nonlinear equation solvers do not converge always or they use the derivatives of the function to approximate the root of such equations. Here, we give a derivative-free algorithm that guarantees the convergence. The proposed two-step method, which is to some extent like the secant method, is accompanied with some numerical examples. The illustrative instances manifest that the rate ...

In this paper we propose a learning based iterative numerical method for computing a rootξ of a non-linear equation of the form f(x) = 0 in the interval [a,b]. Lag based method through Hermite interpolation modeled root discovery approach is developed and demonstrated in this paper. The new method has been tested for a series of functions considered by several researchers. The numerical experim...

This paper considers local convergence of secant methods for a nonlinear system of equations. The well-known local convergence theory has been developed by Broyden, Dennis and Moré (1973). They used a norm inequality such that the difference between two vectors transformed by some matrix is bounded above by an order of one of the two. Instead, in the present paper, we use an inequality that bou...

Damage evolution in heterogeneous solids is modeled using transformation field analysis and imperfect interface model. Stress changes caused by local debonding are simulated by residual stresses generated by equivalent transformation strains or eigenstrains. Decohesion and both overall and local stress and strain rates are derived from thermodynamics of irreversible processes, which provide an ...

We consider the computation of Bernoulli, Tangent (zag), and Secant (zig or Euler) numbers. In particular, we give asymptotically fast algorithms for computing the first n such numbers in O(n2(logn)2+o(1)) bit-operations. We also give very short in-place algorithms for computing the first n Tangent or Secant numbers in O(n2) integer operations. These algorithms are extremely simple, and fast fo...

in this paper, modified simple equation method has been applied to ob-tain generalized solutions of burgers, huxley equations and combined forms of these equations. the new exact solutions of these equations have been obtained. it has been shown that the proposed method provides a very effective, and powerful mathematical tool for solving nonlinear partial differential equations.

Let X (n,m) (1,d) denote the Segre-Veronese embedding of Pn×Pm via the sections of the sheaf O(1, d). We study the dimensions of higher secant varieties of X (n,m) (1,d) and we prove that there is no defective sth secant variety, except possibly for n values of s. Moreover when (m+d d ) is a multiple of (m+ n+ 1), the sth secant variety of X (n,m) (1,d) has the expected dimension for every s.

Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate polynomial equations. Our algorithms combine Newton’s method and the secant method to bound the unique solution in an interval of a monotonic convex isolati...