In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...

In this paper, an approximate solution of sensitivity matrix of required velocity with final velocity constraint is derived using a piecewise linear gravity assumption. The total flight time is also fixed for the problem. Simulation results show the accuracy of the method. Increasing the midway points for linearization, increases the accuracy of the solution, which this, in turn, depends on the...

Introduction 3D reconstruction of an object from its 2D cross-sections (slices) has many applications in different fields of sciences such as medical physics and biomedical engineering. In order to perform 3D reconstruction, at first, desired boundaries at each slice are detected and then using a correspondence between points of successive slices surface of desired object is reconstructed. Mate...

Applying standard dimensionality reduction techniques, we show how to perform approximate range searching in higher dimension while avoiding the curse of dimensionality. Given points in a unit ball in , an approximate halfspace range query counts (or reports) the points in a query halfspace; the qualifier “approximate” indicates that points within distance of the boundary of the halfspace might...

It is of interest in various contexts to find approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization, it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feas...

It is of interest in various contexts to nd approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization , it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feasi...

In this paper, we establish some best proximity point theorems using new proximal contractive mappings in asymmetric $G_{p}$-metric spaces. Our motive is to find an optimal approximate solution of a fixed point equation. We provide best proximity points for cyclic contractive mappings in $G_{p}$-metric spaces. As consequences of these results, we deduce fixed point results in $G_{p}$-metric spa...