An algorithm for computing Bingham flows

DOI10.1134/S0965542509030154MaRDI QIDQ2995674zbMATH OpenOpenAlexFDO

Authors S. V. Milyutin

Publication date 4 May 2011

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0965542509030154

zbMATH Keywords

local convergenceBingham flowArrow-Hurwicz algorithmthree-parameter iterative method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Non-Newtonian fluids (76A05)

Recommendations

• An algorithm for computing a stationary flow in a binary bifurcation tree
• A bi-projection method for Bingham type flows
• A dynamic algorithm for approximate flow computations
• A parallel algorithm for computing the flow complex
• scientific article; zbMATH DE number 1490953
• Algorithms for area preserving flows
• Algorithms for flows with parametric capacities
• A trial-free-boundary method for computing Batchelor flows
• A method for designing algorithms to compute viscous incompressible flows
• Eulerian algorithms for computing some Lagrangian flow network quantities

This page was built for publication: An algorithm for computing Bingham flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995674)