Show simple item record

dc.contributor.authorFaulkner, Frank D.
dc.date.accessioned2018-09-28T19:06:04Z
dc.date.available2018-09-28T19:06:04Z
dc.date.issued1963
dc.identifier.citationFaulkner, Frank D. "Numerical methods for determining optimum ship routes." Navigation 10.4 (1963): 351-367.
dc.identifier.urihttp://hdl.handle.net/10945/60168
dc.description.abstractthe paper is divided into four parts. The first treats a general numerical method for obtaining the minimum time route from one place to another when the speed of the ship is a known function of time and position. The second part treats various other phases of minimum time routes including the generation of isochrones which form the boundary of the region where a ship can be at any given time, rendezvous between ships, and problems wherein the speed does not change with time. The third treats minimum cost routing and optimum correction of perturbed routes. The last part is a discussion of a comparison with various other numerical routines, particularly with the method of gradients or steepest ascent.en_US
dc.description.sponsorshipOffice Naval Researchen_US
dc.description.sponsorshipFleet Numerical Weather Facility, through Stanford Research Institute.
dc.format.extent16 p.
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
dc.titleNumerical Methods for Determining Optimum Ship Routesen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentApplied Mathematicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record