Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Global Positioning System
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==== Closed-form ==== One closed-form solution to the above set of equations was developed by S. Bancroft.<ref name=Bancroft /><ref name=Bancroft1985>{{cite journal |last1=Bancroft |first1=S. |date=January 1985 |title=An Algebraic Solution of the GPS Equations |journal=IEEE Transactions on Aerospace and Electronic Systems |volume=AES-21 |issue=1 |pages=56β59 |doi=10.1109/TAES.1985.310538 |bibcode=1985ITAES..21...56B|s2cid=24431129 }}</ref> Its properties are well known;<ref name="Abel1" /><ref name="Fang" /><ref name="Chaffee">Chaffee, J. and Abel, J., "On the Exact Solutions of Pseudorange Equations", ''IEEE Transactions on Aerospace and Electronic Systems'', vol:30, no:4, pp: 1021β1030, 1994</ref> in particular, proponents claim it is superior in low-[[geometric dilution of precision|GDOP]] situations, compared to iterative least squares methods.<ref name=Bancroft1985 /> Bancroft's method is algebraic, as opposed to numerical, and can be used for four or more satellites. When four satellites are used, the key steps are inversion of a 4x4 matrix and solution of a single-variable quadratic equation. Bancroft's method provides one or two solutions for the unknown quantities. When there are two (usually the case), only one is a near-Earth sensible solution.<ref name=Bancroft /> When a receiver uses more than four satellites for a solution, Bancroft uses the [[generalized inverse]] (i.e., the pseudoinverse) to find a solution. A case has been made that iterative methods, such as the GaussβNewton algorithm approach for solving over-determined [[non-linear least squares]] problems, generally provide more accurate solutions.<ref name="Sirola2010">{{cite conference |last1=Sirola |first1=Niilo |date=March 2010 |title=Closed-form algorithms in mobile positioning: Myths and misconceptions |book-title=7th Workshop on Positioning Navigation and Communication |conference=WPNC 2010 |pages=38β44 |doi=10.1109/WPNC.2010.5653789|citeseerx=10.1.1.966.9430 }}</ref> Leick et al. (2015) states that "Bancroft's (1985) solution is a very early, if not the first, closed-form solution."<ref>{{cite book|title=GNSS Positioning Approaches β GPS Satellite Surveying, Fourth Edition β Leick |publisher= Wiley Online Library|doi=10.1002/9781119018612.ch6|pages=257β399|chapter = GNSS Positioning Approaches|year = 2015|isbn = 9781119018612}}</ref> Other closed-form solutions were published afterwards,<ref name="Kleus">Alfred Kleusberg, "Analytical GPS Navigation Solution", ''University of Stuttgart Research Compendium'', 1994.</ref><ref name="Oszczak">Oszczak, B., "New Algorithm for GNSS Positioning Using System of Linear Equations", ''Proceedings of the 26th International Technical Meeting of The Satellite Division of the Institute of Navigation (ION GNSS+ 2013)'', Nashville, Tennessee, September 2013, pp. 3560β3563.</ref> although their adoption in practice is unclear.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)