An algorithm for computing Bingham flows

DOI10.1134/S0965542509030154zbMATH Open1224.76003OpenAlexW2080644657MaRDI QIDQ2995674

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

Arrow-Hurwicz algorithmlocal convergenceBingham flowthree-parameter iterative method

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• A bi-projection method for Bingham type flows 👍 👎
• A trial-free-boundary method for computing Batchelor flows 👍 👎
• Eulerian algorithms for computing some Lagrangian flow network quantities 👍 👎
• An algorithm for computing a stationary flow in a binary bifurcation tree 👍 👎
• A dynamic algorithm for approximate flow computations 👍 👎
• Algorithms for Area Preserving Flows 👍 👎
• Algorithms for flows with parametric capacities 👍 👎
• A method for designing algorithms to compute viscous incompressible flows 👍 👎
• A parallel algorithm for computing the flow complex 👍 👎

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)