An algorithm for computing Bingham flows
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 3, pp. 567-577
Voir la notice de l'article provenant de la source Math-Net.Ru
A three-parameter iterative method for computing Bingham flows is examined. The method is a generalization of the well-known Arrow–Hurwicz algorithm. The local convergence of the method is proved.
@article{ZVMMF_2009_49_3_a14,
author = {S. V. Milyutin},
title = {An algorithm for computing {Bingham} flows},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {567--577},
publisher = {mathdoc},
volume = {49},
number = {3},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a14/}
}
S. V. Milyutin. An algorithm for computing Bingham flows. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 3, pp. 567-577. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a14/