An approximate solution of one-dimensional piston problem

A new theory of shock dynamics has been developed in the form of a finite number of compatibility conditions along shock rays. It has been used to study the growth or decay of shock strength for accelerating or decelerating piston starting with a nonzero piston velocity. The results show good agreement with those obtained by Harten's high resolution TVD scheme.     

An approximate solution for spherical and cylindrical piston problem

A new theory of shock dynamics (NTSD) has been derived in the form of a finite number of compatibility conditions along shock rays. It has been used to study the growth and decay of shock strengths for spherical and cylindrical pistons starting from a non-zero velocity. Further a weak shock theory has been derived using a simple perturbation method which admits an exact solution and also agrees with the classical decay laws for weak spherical and cylindrical shocks.     

An approximate method for solving the convex programming problem

We consider an iterative process for maximization of a convex nondifferentiable functional in a real Hilbert space. Two-sided bounds on the optimal functional value are derived. Stability of the approximate solutions is considered. Convergence of the proposed iterative process is proved.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 59, pp. 122–129, 1986     

An approximate analytic solution of the Blasius problem

The [4/3] Pade approximant for the derivative is modified so that the resulting expression has the required asymptotic behavior. This gives an analytical result which represents the solution of the classical Blasius problem on the whole domain.     

Method for finding an approximate solution of the asphericity problem for a convex body

Given a convex body, the finite-dimensional problem is considered of minimizing the ratio of its circumradius to its inradius (in an arbitrary norm) by choosing a common center of the circumscribed and inscribed balls. An approach is described for obtaining an approximate solution of the problem, whose accuracy depends on the error of a preliminary polyhedral approximation of the convex body and the unit ball of the used norm. The main result consists of developing and justifying a method for finding an approximate solution with every step involving the construction of supporting hyperplanes of the convex body and the unit ball of the used norm at some marginal points and the solution of a linear programming problem.     

An approximate solution algorithm for the one-dimensional online median problem

The online median problem consists in finding a sequence of incremental solutions of the k-median problem with k increasing. A particular case of the problem is considered: the clients and facilities are located on the real line. The best algorithm available for the one-dimensional case has competitive ratio 8. We give an improved 5.83-competitive algorithm.     

凸可行问题的平行近似次梯度投影算法

对凸可行问题提出了包括上松弛的平行近似次梯度投影算法和加速平行近似次梯度投影算法．与序列近似次梯度投影算法相比, 平行近似次梯度投影算法(每次迭代同时运用多个凸集的近似次梯度超平面上的投影)能够保证迭代序列收敛到离各个凸集最近的点． 上松弛的迭代技术和含有外推因子的加速技术的应用, 减少了数据存储量, 提高了收 敛速度. 最后在较弱的条件下证明了算法的收敛性, 数值实验结果验证了算法的有效性和优越性.     

An approximate decomposition algorithm for convex minimization

For nonsmooth convex optimization, Robert Mifflin and Claudia Sagastizábal introduce a VU-space decomposition algorithm in Mifflin and Sagastizábal (2005) [11]. An attractive property of this algorithm is that if a primal-dual track exists, this algorithm uses a bundle subroutine. With the inclusion of a simple line search, it is proved to be globally and superlinearly convergent. However, a drawback is that it needs the exact subgradients of the objective function, which is expensive to compute. In this paper an approximate decomposition algorithm based on proximal bundle-type method is introduced that is capable to deal with approximate subgradients. It is shown that the sequence of iterates generated by the resulting algorithm converges to the optimal solutions of the problem. Numerical tests emphasize the theoretical findings.     

An approximate solution of the flow-shop problem with sequence dependent setup times

The paper deals with anm machinen job flow-shop problem with sequence dependent setup times. To find an approximate solution of this model a related (additive) model was constructed and solved. The method proved to be successful to find good solutions for a variety of test problems form 8 andn 8. It guarantees optimality for the two machine case whenever the original model is additive.     

An approximate solution of the axisymmetric contact problem for an elastic sphere

An axisymmetric, fractionally non-linear contact problem for an elastic sphere with a priori unknown boundary of the contactarea is considered. An integral equation for determining the density of the contact pressures is constructed taking account of the shear displacements of the boundary points of the elastic body. An approximate solution, which refines the equations of Hertz' theory, is constructed in the case of a small contact area.     

An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem

In this paper, a new type of stepsize, approximate optimal stepsize, for gradient method is introduced to interpret the Barzilai–Borwein (BB) method, and an efficient gradient method with an approximate optimal stepsize for the strictly convex quadratic minimization problem is presented. Based on a multi-step quasi-Newton condition, we construct a new quadratic approximation model to generate an approximate optimal stepsize. We then use the two well-known BB stepsizes to truncate it for improving numerical effects and treat the resulted approximate optimal stepsize as the new stepsize for gradient method. We establish the global convergence and R-linear convergence of the proposed method. Numerical results show that the proposed method outperforms some well-known gradient methods.     

Numerical solution of a two-dimensional hyperbolic transmission problem

An initial boundary value problem for a two-dimensional hyperbolic equation in two disjoint rectangles is investigated. The existence and uniqueness and a priori estimates for weak solutions in appropriate Sobolev-like spaces are proved. Few finite difference schemes approximating this problem are proposed and analyzed.     

An approximate analytical solution of time-fractional telegraph equation

In this article, the powerful, easy-to-use and effective approximate analytical mathematical tool like homotopy analysis method (HAM) is used to solve the telegraph equation with fractional time derivative α (1 < α ? 2). By using initial values, the explicit solutions of telegraph equation for different particular cases have been derived. The numerical solutions show that only a few iterations are needed to obtain accurate approximate solutions. The method performs extremely well in terms of efficiency and simplicity to solve this historical model.     

Analytical approximate solution of the cooling problem by Adomian decomposition method

The Adomian decomposition method (ADM) can provide analytical approximation or approximated solution to a rather wide class of nonlinear (and stochastic) equations without linearization, perturbation, closure approximation, or discretization methods. In the present work, ADM is employed to solve the momentum and energy equations for laminar boundary layer flow over flat plate at zero incidences with neglecting the frictional heating. A trial and error strategy has been used to obtain the constant coefficient in the approximated solution. ADM provides an analytical solution in the form of an infinite power series. The effect of Adomian polynomial terms is considered and shows that the accuracy of results is increased with the increasing of Adomian polynomial terms. The velocity and thermal profiles on the boundary layer are calculated. Also the effect of the Prandtl number on the thermal boundary layer is obtained. Results show ADM can solve the nonlinear differential equations with negligible error compared to the exact solution.