CAE-based compensation methods of non-uniform pulse laser beam profiles

Applying the pulse laser to speckle methods, non-uniformities of the laser beam profiles and the intensities between each laser pulse have unpleasant consequences on the intensity distribution of the recorded images and following on the assigned fringes of the corresponding subtractive result. This contribution introduces a computer-based technique for compensating this technical and physical problem, so that the fringe quality is improved, even if the homogeneity of the laser beam profiles is on such low level, that the conventional (subtractive) technique fails. The solution is based on algorithms, which refines each intensity distribution and is comparable with the known shading correction.     

迭代法求算精馏塔的理论塔板数

在解析法和图解法求算精馏塔理论塔板数的基础上,提出了迭代法求算理论塔板数.本方法概念清晰,过程简练,结果准确,避免了解析法计算过程繁杂、手算工作量大和图解法在塔板数较多时误差过大的缺点,若利用计算机求算,其算法十分简便.     

Calculating particle pair potentials from fluid‐state pair correlations: Iterative ornstein–zernike inversion

An iterative Monte Carlo inversion method for the calculation of particle pair potentials from given particle pair correlations is proposed in this article. The new method, which is best referred to as Iterative Ornstein–Zernike Inversion, represents a generalization and an improvement of the established Iterative Boltzmann Inversion technique (Reith, Pütz and Müller‐Plathe, J. Comput. Chem. 2003, 24, 1624). Our modification of Iterative Boltzmann Inversion consists of replacing the potential of mean force as an approximant for the pair potential with another, generally more accurate approximant that is based on a trial bridge function in the Ornstein–Zernike integral equation formalism. As an input, the new method requires the particle pair correlations both in real space and in the Fourier conjugate wavenumber space. An accelerated iteration method is included in the discussion, by which the required number of iterations can be greatly reduced below that of the simple Picard iteration that underlies most common implementations of Iterative Boltzmann Inversion. Comprehensive tests with various pair potentials show that the new method generally surpasses the Iterative Boltzmann Inversion method in terms of reliability of the numerical solution for the particle pair potential. © 2018 Wiley Periodicals, Inc.     

Adaptive solution of infinite linear systems by Krylov subspace methods

In this paper we consider the problem of approximating the solution of infinite linear systems, finitely expressed by a sparse coefficient matrix. We analyse an algorithm based on Krylov subspace methods embedded in an adaptive enlargement scheme. The management of the algorithm is not trivial, due to the irregular convergence behaviour frequently displayed by Krylov subspace methods for nonsymmetric systems. Numerical experiments, carried out on several test problems, indicate that the more robust methods, such as GMRES and QMR, embedded in the adaptive enlargement scheme, exhibit good performances.     

Vickrey–Dutch procurement auction for multiple items

We consider a setting where there is a manufacturer who wants to procure multiple items from a set of suppliers each of whom can supply one or more of these items (bundles). We design an ascending price auction for such a setting which implements the Vickrey–Clarke–Groves outcome and truthful bidding is an ex post Nash equilibrium. Our auction maintains non-linear and non-anonymous prices throughout the auction. This auction has a simple price adjustment step and is easy to implement in practice. As offshoots of this auction, we also suggest other simple auctions (in which truthful bidding is not an equilibrium by suppliers) which may be suitable where incentives to suppliers are not a big concern. Computer simulations of our auction show that it is scalable for the multi-unit case, and has better information revelation properties than its descending auction counterpart.     

一类抽象算子方程组的迭代解及其应用

在Banach空间中, 利用半序方法讨论了一类抽象算子方程组解的存在唯一性, 推广和统一了以前的一些结果. 然后应用到 Banach 空间非线性积分方程组, 得到了方程组的唯一解, 构造了收敛于方程组唯一解的迭代序列并给出了相应的误差估计.     

A two-echelon inventory model with lost sales

This paper considers a single-item, two-echelon, continuous-review inventory model. A number of retailers have their stock replenished from a central warehouse. The warehouse in turn replenishes stock from an external supplier. The demand processes on the retailers are independent Poisson. Demand not met at a retailer is lost. The order quantity from each retailer on the warehouse and from the warehouse on the supplier takes the same fixed value Q, an exogenous variable determined by packaging and handling constraints. Retailer i follows a (Q, R_i) control policy. The warehouse operates an (SQ, (S − 1)Q) policy, with non-negative integer S. If the warehouse is in stock then the lead time for retailer i is the fixed transportation time L_i from the warehouse to that retailer. Otherwise retailer orders are met, after a delay, on a first-come first-served basis. The lead time on a warehouse order is fixed. Two further assumptions are made: that each retailer may only have one order outstanding at any time and that the transportation time from the warehouse to a retailer is not less than the warehouse lead time. The performance measures of interest are the average total stock in the system and the fraction of demand met in the retailers. Procedures for determining these performance measures and optimising the behaviour of the system are developed.     

A new family of iterative methods for solving system of nonlinear algebric equations

Homotopy perturbation method (HPM) is applied to construct a new iterative method for solving system of nonlinear algebric equations. Comparison of the result obtained by the present method with that obtained by revised Adomian decomposition method [Hossein Jafari, Varsha Daftardar-Gejji, Appl. Math. Comput. 175 (2006) 1–7] reveals that the accuracy and fast convergence of the new method.     

A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems

In recent years, competitive domain-decomposed preconditioned iterative techniques of Krylov-Schwarz type have been developed for nonsymmetric linear elliptic systems. Such systems arise when convection-diffusion-reaction problems from computational fluid dynamics or heat and mass transfer are linearized for iterative solution. Through domain decomposition, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow effective solution on parallel machines. A central question is how to choose these small problems and how to arrange the order of their solution. Different specifications of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the classical multiplicative Schwarz algorithm, an accelerated multiplicative Schwarz algorithm, the tile algorithm, the CGK algorithm, the CSPD algorithm, and also the popular global ILU-family of preconditioners, on some nonsymmetric or indefinite elliptic model problems discretized by finite difference methods. The preconditioned problems are solved by the unrestarted GMRES method. A version of the accelerated multiplicative Schwarz method is a consistently good performer.     

Iterative method for solving a nonlinear boundary value problem

In this paper, a boundary value problem for a nonlinear second-order ordinary differential equation is studied. By means of the maximum principle we established the existence and the uniqueness of a solution of the problem. Then for finding the solution an iterative method is proposed. It is proved that this method converges much faster than the Picar successive approximations and in a particular case it gives two-sided monotone approximations to the exact solution of the problem. Finally, some illustrative examples are considered to confirm the efficiency of the method.