Back to search

East Tennessee State University

An Algorithm for the Machine Calculation of Minimal Paths

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
MS (Master of Science)
Level thesis:degree_level
Thesis - unrestricted
Discipline thesis:degree_discipline
Mathematical Sciences
Grantor dc:publisher
East Tennessee State University
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Whitinger, Robert

Subjects

dc:subject × 11

Rights

dc:rights
Statement dc:rights
  • Copyright by Robert Whitinger
Language dc:language
eng

Identifiers

dc:identifier.*
Repository record dc:identifier
https://dc.etsu.edu/etd/3119

Chain of custody

source
Harvested from
East Tennessee State University
Base URL
dc.etsu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Whitinger, Robert. An Algorithm for the Machine Calculation of Minimal Paths. Thesis - unrestricted thesis, East Tennessee State University, 2016. https://dc.etsu.edu/etd/3119