Search results

The purpose of this paper is to find the best solver for parallelizing particle methods based on solving Pressure Poisson Equation (PPE) by taking Moving Particle Semi-Implicit (MPS) method as an example because the solution for PPE is usually the most time-consuming part difficult to parallelize.

To find the best solver, the authors compare six Krylov solvers, namely, Conjugate Gradient method (CG), Scaled Conjugate Gradient method (SCG), Bi-Conjugate Gradient Stabilized (BiCGStab) method, Conjugate Gradient Squared (CGS) method with Symmetric Lanczos Algorithm (SLA) method and Incomplete Cholesky Conjugate Gradient method (ICCG) in terms of convergence, time consumption, parallel efficiency and memory consumption for the semi-implicit particle method. The MPS method is parallelized by the hybrid Open Multi-Processing (OpenMP)/Message Passing Interface (MPI) model. The dam-break flow and channel flow simulations are used to evaluate the performance of different solvers.

It is found that CG converges stably, runs fastest in the serial way, uses the least memory and has highest OpenMP parallel efficiency, but its MPI parallel efficiency is lower than SLA because SLA requires less synchronization than CG.

With all these criteria considered and weighed, the recommended parallel solver for the MPS method is CG.

The purpose of this paper is to find out which algorithm, among Genetic Algorithm (GA), Particle Swarm Optimizer (PSO), the novel Grey Wolf Optimizer (GWO) and the novel Ant Lion Optimizer (ALO), is the best to obtain the optimal value of the nonlinear parameter γ of nonlinear grey Bernoulli model (NGBM(1,1)) under different situations.

The optimization of γ has been attributed to a nonlinear programming problem at first. The convergence, convergence rate, time consuming and stability of GA, PSO, GWO and ALO are compared in the numerical experiments, and in each subcase the criteria are set to be the same. Over 10,000 iterations have been run on the same environment in order to guarantee the reliability of the results.

All the selected algorithms can converge to the same optimal value with sufficient iterations. But the best algorithm should be chose under different situations.

The optimal value of γ seems to exist uniquely due to the empirical results. And there does not exist a best algorithm for all the cases. The researchers and commercial software developers should choose a proper algorithm due to different cases.

The performance of GA, PSO, GWO and ALO to compute the optimal γ of NGBM(1,1) has been compared for the first time. And it is the original work which uses the GWO and ALO to optimize the NGBM(1,1).

The approximate factorisation‐conjugate gradient squared (AF‐CGS) method has been successfully demonstrated for unsteady turbulent aerofoil flows and transonic inviscid flows in two and three dimensions. The method consists of a conjugate gradient solution of the linear system at each step with the ADI approximate factorisation as a preconditioner. In the present paper the method is adapted to obtain rapid convergence for steady aerofoil flows when compared to the basic explicit method. Modifications to the original method are described, convergence criteria are examined and the method is demonstrated for transonic flow including AGARD test case 9 for the RAE2822 aerofoil.

A fast assembly scheme for FEM sparse matrices is given. For the solution we compare the conjugate gradient and two preconditionings for this method in the case of plane strain elasticity and orthotropic materials with very stiff coefficients. The influence of fibre orientation on the number of iterations is tested. It is suggested to use the simple incomplete Crout scheme even when the resulting preconditioning matrix is not positive definite.

Financial distress is the most notable distress for companies. During the past four decades, predicting corporate bankruptcy and financial distress has become a significant concern for the various stakeholders in firms. This paper aims to predict financial distress of Iranian firms, with four techniques: support vector machines, artificial neural networks (ANN), k-nearest neighbor and na

ve bayesian classifier by using accounting information of the firms for two years prior to financial distress.

The distressed companies in this study are chosen based on Article 141 of Iranian Commercial Codes, i.e. accumulated losses exceeds half of equity, based on which 117 companies qualified for the current study. The research population includes all the companies listed on Tehran Stock Exchange during the financial period from 2011-2012 to 2013-2014, that is, three consecutive periods.

By making a comparison between performances of models, it is concluded that ANN outperforms other techniques.

The current study is almost the first study in Iran which used such methods to analyzing the data. So, the results may be helpful in the Iranian condition as well for other developing nations.

Solves the inverse problem of estimating the wall heat flux in a parallel plate channel, by using the conjugate gradient method with adjoint equation. The unknown heat flux is supposed to vary in time and along the channel flow direction. Examines the accuracy of the present function estimation approach, by using transient simulated measurements of several sensors located inside the channel. The inverse problem is solved for different functional forms of the unknown wall heat flux, including those containing sharp corners and discontinuities, which are the most difficult to be recovered by an inverse analysis. Addresses the effects on the inverse problem solution of the number of sensors, as well as their locations.

The purpose of this paper is to present a novel gradient‐based iterative algorithm for the joint diagonalization of a set of real symmetric matrices. The approximate joint diagonalization of a set of matrices is an important tool for solving stochastic linear equations. As an application, reliability analysis of structures by using the stochastic finite element analysis based on the joint diagonalization approach is also introduced in this paper, and it provides useful references to practical engineers.

By starting with a least squares (LS) criterion, the authors obtain a classical nonlinear cost‐function and transfer the joint diagonalization problem into a least squares like minimization problem. A gradient method for minimizing such a cost function is derived and tested against other techniques in engineering applications.

A novel approach is presented for joint diagonalization for a set of real symmetric matrices. The new algorithm works on the numerical gradient base, and solves the problem with iterations. Demonstrated by examples, the new algorithm shows the merits of simplicity, effectiveness, and computational efficiency.

A novel algorithm for joint diagonalization of real symmetric matrices is presented in this paper. The new algorithm is based on the least squares criterion, and it iteratively searches for the optimal transformation matrix based on the gradient of the cost function, which can be computed in a closed form. Numerical examples show that the new algorithm is efficient and robust. The new algorithm is applied in conjunction with stochastic finite element methods, and very promising results are observed which match very well with the Monte Carlo method, but with higher computational efficiency. The new method is also tested in the context of structural reliability analysis. The reliability index obtained with the joint diagonalization approach is compared with the conventional Hasofer Lind algorithm, and again good agreement is achieved.

The linear regression technique is widely used to determine empirical parameters of fatigue life profile while the results may not continuously depend on experimental data. Thus Tikhonov-Morozov method is utilized here to regularize the linear regression results and consequently reduces the influence of measurement noise without notably distorting the fatigue life distribution. The paper aims to discuss these issues.

Tikhonov-Morozov regularization method would be shown to effectively reduce the influences of measurement noise without distorting the fatigue life distribution. Moreover since iterative regularization methods are known to be an attractive alternative to Tikhonov regularization, four gradient iterative methods called as simple iteration, minimum error, steepest descent and conjugate gradient methods are examined with an appropriate initial guess of regularized coefficients.

It has been shown that in case of sparse fatigue life measurements, linear regression results may not have continuous dependence on experimental data and measurement error could lead to misinterpretations of the solution. Therefore from engineering safety point of view, utilizing regularization method could successfully reduce the influence of measurement noise without significantly distorting the fatigue life distribution.

An excellent initial guess for mixed iterative-direct algorithm is introduced and it has been shown that the combination of Newton iterative approach and Morozov discrepancy principle is one of the interesting strategies for determination of regularization parameter having an excellent rate of convergence. Moreover since iterative methods are known to be an attractive alternative to Tikhonov regularization, four gradient descend methods are examined here for regularization of the linear regression problem. It has been found that all of gradient decent methods with an appropriate initial guess of regularized coefficients have an excellent convergence to Tikhonov-Morozov regularization results.

Finite element discretizations of low‐frequency, time‐harmonic magnetic problems lead to sparse, complex symmetric systems of linear equations. The question arises which Krylov subspace methods are appropriate to solve such systems. The quasi minimal residual method combines a constant amount of work and storage per iteration step with a smooth convergence history. These advantages are obtained by building a quasi minimal residual approach on top of a Lanczos process to construct the search space. Solving the complex systems by transforming them to equivalent real ones of double dimension has to be avoided as such real systems have spectra that are less favourable for the convergence of Krylov‐based methods. Numerical experiments are performed on electromagnetic engineering problems to compare the quasi minimal residual method to the bi‐conjugate gradient method and the generalized minimal residual method.

Presents a review on implementing finite element methods on supercomputers, workstations and PCs and gives main trends in hardware and software developments. An appendix included at the end of the paper presents a bibliography on the subjects retrospectively to 1985 and approximately 1,100 references are listed.