An Approximate Solution of a Variational Problem by the Shortest Path Method

  • Authors:

  • D. T. Lotarev

  • Affiliations:

  • Institute for Systems Analysis, Russian Academy of Sciences, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A special graph is used to construct a difference scheme approximating a variational problem. The difference scheme is solved by an algorithm for determining the shortest path (path of minimal weight) on the graph. This solution is taken to be the approximate solution of the variational problem.