Return to search

An Algorithm for the Machine Calculation of Minimal Paths

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R3, but also to the general case of finding minimal functionals on hypersurfaces in Rn associated with an arbitrary metric.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etd-4521
Date01 August 2016
CreatorsWhitinger, Robert
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceElectronic Theses and Dissertations
RightsCopyright by Robert Whitinger

Page generated in 0.0023 seconds