The variable HSS iteration based on the bacterial foraging optimisation algorithm (Q2224046)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The variable HSS iteration based on the bacterial foraging optimisation algorithm |
scientific article |
Statements
The variable HSS iteration based on the bacterial foraging optimisation algorithm (English)
0 references
3 February 2021
0 references
Summary: In the Hermitian and skew-Hermitian splitting (HSS) iteration method, the determination of the optimal parameter is a tough task when solving a large sparse non-Hermitian positive definite linear systems. In this paper, we present the variable HSS iteration with the non-fixed positive constant. For obtaining the approximate optimal parameters of this method, we solve the minimising the optimisation model based on the bacterial foraging optimisation (BFO) algorithm. Numerical experiments have shown that the new strategy is feasible and effective than the HSS iteration method.
0 references
variable HSS iteration
0 references
optimal parameters
0 references
bacterial foraging optimisation
0 references
BFO
0 references
linear systems
0 references
Hermitian and skew-Hermitian splitting
0 references