Minimal Transport Networks with General Boundary Conditions

DOI10.1137/17M1136717zbMATH Open1395.49016arXiv1709.00694OpenAlexW2964280303MaRDI QIDQ4577211FDOQ4577211

Authors: Shyr-Shea Chang, Marcus Roper 

Publication date: 17 July 2018

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Abstract: Vascular networks are used across the kingdoms of life to transport fluids, nutrients and cellular material. A popular unifying idea for understanding the diversity and constraints of these networks is that the conduits making up the network are organized to optimize dissipation or other functions within the network. However the general principles governing the optimal networks remain unknown. In particular Durand showed that under Neumann boundary conditions networks, that minimize dissipation should be trees. Yet many real transport networks, including capillary beds, are not simply connected. Previously multiconnectedness in a network has been assumed to provide evidence that the network is not simply minimizing dissipation. Here we show that if the boundary conditions on the flows within the network are enlarged to include physical reasonable Neumann and Dirichlet boundary conditions (i.e. constraints on either pressure or flow) then minimally dissipative networks need not be trees. To get to this result we show that two methods of producing optimal networks, namely enforcing constraints via Lagrange multipliers or via penalty methods, are equivalent for tree networks.

Full work available at URL: https://arxiv.org/abs/1709.00694

Recommendations

• Transport and network problems with the minimax criterion
• scientific article; zbMATH DE number 997341
• Optimal Transport on Networks
• Optimal transportation networks. Models and theory
• Optimal transport networks in spatial equilibrium
• Optimal transportation networks as flat chains
• Optimal channel networks, landscape function and branched transport
• Generic uniqueness of optimal transportation networks
• SOME PROBLEMS CONCERNING MINIMAL NETWORKS

zbMATH Keywords

Murray's lawoptimal networkminimal transport

Mathematics Subject Classification ID

Optimality conditions for problems involving relations other than differential equations (49K21) Physiological flows (76Z05) Flow control and optimization for incompressible viscous fluids (76D55)

Cites Work

• Probability on trees and networks
• Title not available (Why is that?)
• Rules for biologically inspired adaptive network design
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Cyclic structure induced by load fluctuations in adaptive transportation networks
• Flow Distribution in Closed Networks: Minimal Sets of Measuring Sites
• Adaptive Hagen-Poiseuille flows on graphs
• Optimisation of biological transport networks
• Microvascular networks with uniform flow
• Optimal mixing in transport networks: numerical optimization and analysis
• Topology optimization of flow networks.
• MINIMUM ENERGY DISSIPATION AND FRACTAL STRUCTURES OF VASCULAR SYSTEMS

This page was built for publication: Minimal Transport Networks with General Boundary Conditions

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