LAPLACE'S EQUATION AND NETWORK FLOWS

Abstract

This paper shows that partial differential equations may be a possible area of application of mathematical programming. The solution of Laplace's equation with Neumann's condition is shown to be a minimum cost network flow problem with cost proportional to the arc flow. An algorithm of solving minimum quadratic cost network flow is given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1965
Accession Number
AD0615815

Entities

People

  • T. C. Hu

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Boundary Value Problems
  • Computational Fluid Dynamics
  • Computational Science
  • Difference Equations
  • Differential Equations
  • Engineering
  • Equations
  • Flow
  • Fluid Mechanics
  • Mathematical Programming
  • Operations Research
  • Quadratic Programming
  • Shipping
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Fluid Dynamics.
  • Graph Algorithms and Convex Optimization.