Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computational Mathematics and Mathematical Physics
Paper Title
Journal
Date
