Search results

1 – 2 of 2
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 18 January 2019

Khosro Sayevand and Hossein Arab

The purpose of this paper is to propose a gauge for the convergence of the deterministic particle swarm optimization (PSO) algorithm to obtain an optimum upper bound for PSO…

153

Abstract

Purpose

The purpose of this paper is to propose a gauge for the convergence of the deterministic particle swarm optimization (PSO) algorithm to obtain an optimum upper bound for PSO algorithm and also developing a precise equation for predicting the rock fragmentation, as important aims in surface mines.

Design/methodology/approach

In this study, a database including 80 sets of data was collected from 80 blasting events in Shur river dam region, in Iran. The values of maximum charge per delay (W), burden (B), spacing (S), stemming (ST), powder factor (PF), rock mass rating (RMR) and D80, as a standard for evaluating the fragmentation, were measured. To check the performance of the proposed PSO models, artificial neural network was also developed. Accuracy of the developed models was evaluated using several statistical evaluation criteria, such as variance account for, R-square (R2) and root mean square error.

Findings

Finding the upper bounds for the difference between the position and the best position of particles in PSO algorithm and also developing a precise equation for predicting the rock fragmentation, as important aims in surface mines.

Originality/value

For the first time, the convergence of the deterministic PSO is studied in this study without using the stagnation or the weak chaotic assumption. The authors also studied application of PSO inpredicting rock fragmentation.

Details

Engineering Computations, vol. 36 no. 2
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 29 November 2024

Raziyeh Erfanifar, Khosro Sayevand and Masoud Hajarian

In this study, we present a novel parametric iterative method for computing the polar decomposition and determining the matrix sign function.

26

Abstract

Purpose

In this study, we present a novel parametric iterative method for computing the polar decomposition and determining the matrix sign function.

Design/methodology/approach

This method demonstrates exceptional efficiency, requiring only two matrix-by-matrix multiplications and one matrix inversion per iteration. Additionally, we establish that the convergence order of the proposed method is three and four, and confirm that it is asymptotically stable.

Findings

In conclusion, we extend the iterative method to solve the Yang-Baxter-like matrix equation. The efficiency indices of the proposed methods are shown to be superior compared to previous approaches.

Originality/value

The efficiency and accuracy of our proposed methods are demonstrated through various high-dimensional numerical examples, highlighting their superiority over established methods.

Details

Engineering Computations, vol. 42 no. 1
Type: Research Article
ISSN: 0264-4401

Keywords

1 – 2 of 2
Per page
102050