The Experts below are selected from a list of 43242 Experts worldwide ranked by ideXlab platform
John Nord - One of the best experts on this subject based on the ideXlab platform.
-
The global positioning system and the Implicit Function theorem
Siam Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
-
Classroom Note: The Global Positioning System and the Implicit Function Theorem
SIAM Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
Gail Nord - One of the best experts on this subject based on the ideXlab platform.
-
The global positioning system and the Implicit Function theorem
Siam Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
-
Classroom Note: The Global Positioning System and the Implicit Function Theorem
SIAM Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
David Jabon - One of the best experts on this subject based on the ideXlab platform.
-
The global positioning system and the Implicit Function theorem
Siam Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
-
Classroom Note: The Global Positioning System and the Implicit Function Theorem
SIAM Review, 1998Co-Authors: Gail Nord, David Jabon, John NordAbstract:This paper provides an example of the Implicit Function theorem to the accuracy of global positioning system (GPS) navigation. The Implicit Function theorem allows one to approximate the timing accuracy required by the GPS navigation system to locate a user within a certain degree of precision.
V M Miklyukov - One of the best experts on this subject based on the ideXlab platform.
-
piecewise smooth version of the Implicit Function theorem
Ukrainian Mathematical Journal, 2008Co-Authors: V M MiklyukovAbstract:We introduce a class of piecewise-smooth + mappings and prove the Implicit-Function theorem for this class. The proof is based on the theorem on global homeomorphism, which follows from the well-known Chernavskii theorem.
-
Piecewise-smooth + version of the Implicit-Function theorem
Ukrainian Mathematical Journal, 2008Co-Authors: V M MiklyukovAbstract:We introduce a class of piecewise-smooth + mappings and prove the Implicit-Function theorem for this class. The proof is based on the theorem on global homeomorphism, which follows from the well-known Chernavskii theorem.
R T Rockafellar - One of the best experts on this subject based on the ideXlab platform.
-
newton s method for generalized equations a sequential Implicit Function theorem
Mathematical Programming, 2010Co-Authors: Asen L. Dontchev, R T RockafellarAbstract:In an extension of Newton’s method to generalized equations, we carry further the Implicit Function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space. An inverse Function version of this result shows that the strong regularity of the mapping associated with the Newton sequences is equivalent to the strong regularity of the generalized equation mapping.
-
Newton’s method for generalized equations: a sequential Implicit Function theorem
Mathematical Programming, 2009Co-Authors: Asen L. Dontchev, R T RockafellarAbstract:In an extension of Newton’s method to generalized equations, we carry further the Implicit Function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space. An inverse Function version of this result shows that the strong regularity of the mapping associated with the Newton sequences is equivalent to the strong regularity of the generalized equation mapping.
-
robinson s Implicit Function theorem and its extensions
Mathematical Programming, 2008Co-Authors: Asen L. Dontchev, R T RockafellarAbstract:S. M. Robinson published in 1980 a powerful theorem about solutions to certain “generalized equations” corresponding to parameterized variational inequalities which could represent the first-order optimality conditions in nonlinear programming, in particular. In fact, his result covered much of the classical Implicit Function theorem, if not quite all, but went far beyond that in ideas and format. Here, Robinson’s theorem is viewed from the perspective of more recent developments in variational analysis as well as some lesser-known results in the Implicit Function literature on equations, prior to the advent of generalized equations. Extensions are presented which fully cover such results, translating them at the same time to generalized equations broader than variational inequalities. Robinson’s notion of first-order approximations in the absence of differentiability is utilized in part, but even looser forms of approximation are shown to furnish significant information about solutions.
