Abstract: In this paper, we present a class of multistep methods for the numerical solution of stiff ordinary differential equations. In these methods the first, second and third derivatives of the solution are used to improve the accuracy and absolute stability regions of the methods. The constructed methods are A-stable up to order 6 and A(α)-stable up to order 8 so that, as it is shown in th...

There have been interesting recent developments in methods for solving optimization problems without making use of derivative (sensitivity) information. While calculus based methods that employ derivative information can be extremely eecient and very eeec-tive, they are not applicable to all MDO problems, for instance, when the function to be optimized is nondiierentiable, when sensitivity info...

We propose feasible descent methods for constrained minimization that do not make explicit use of objective derivative information. The methods at each iteration sample the objective function value along a finite set of feasible search arcs and decrease the sampling stepsize if an improved objective function value is not sampled. The search arcs are obtained by projecting search direction rays ...

Following the work of Enright [3] there has been interest in studying second derivative methods for solving stiff ordinary differential equations. Successful implementations of second derivative methods have been reported by Enright [3], Sacks-Davis [9], [10] and Addison[l]. Wallace and Gupta [13] have suggested a polynomial formulation of the usual first-derivative multistep methods. Recently ...

In this study, a derivative method is applied for the determination of dye concentration in fabrics dyed with tricomponent dye mixtures. The reflectance of spectra of the samples were recorded between 400 and 700 nm. Initially, the obtained (K/S) spectra were divided by the spectrum of a standard sample dyed with two of the components in the ternary mixture and the derivative spectra were calcu...

In this paper, two different approaches to solve underdetermined nonlinear system of equations are proposed. In one of them, the derivative-free method defined by La Cruz, Martínez and Raydan for solving square nonlinear systems is modified and extended to cope with the underdetermined case. The other approach is a Quasi-Newton method that uses the Broyden update formula and the globalized line...

We consider a fully implicit formulation for two-phase flow in a porous medium with capillarity, gravity, and compressibility in three dimensions. The method is implicit in time and uses the multiscale mortar mixed finite element method for a spatial discretization in a nonoverlapping domain decomposition context. The interface conditions between subdomains are enforced in terms of Lagrange mul...

In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...

Two families of derivative free two-point iterative methods for solving nonlinear equations are constructed. These methods use a suitable parametric function and an arbitrary real parameter. It is proved that the first family has the convergence order four requiring only three function evaluations per iteration. In this way it is demonstrated that the proposed family without memory supports the...