Design of Survey Networks Using Non-linear Programming |
From inside the book
Results 1-3 of 3
Page 31
... ellipse called the error ellipse . Since • › â [ m ] = 1 = 1 Q is positive definite symmetric , from linear algebra theory it is known that there exists an orthogonal matrix P such that Q = P'DP where D is the diagonal matrix of ...
... ellipse called the error ellipse . Since • › â [ m ] = 1 = 1 Q is positive definite symmetric , from linear algebra theory it is known that there exists an orthogonal matrix P such that Q = P'DP where D is the diagonal matrix of ...
Page 33
... error ellipse are respectively equal . Since the concept of the error ellipse is slightly easier to use , it will be used throughout the remainder of this paper . The summary presented in this chapter does not purport to exhaust the ...
... error ellipse are respectively equal . Since the concept of the error ellipse is slightly easier to use , it will be used throughout the remainder of this paper . The summary presented in this chapter does not purport to exhaust the ...
Page 75
... error ellipse about any point will be less than 2 p , and thus the accuracy of the net will be specified . This approximation is further justifiable by observing that in surveying practice , seldom , if ever , will the specifications ...
... error ellipse about any point will be less than 2 p , and thus the accuracy of the net will be specified . This approximation is further justifiable by observing that in surveying practice , seldom , if ever , will the specifications ...
Common terms and phrases
A₁ accuracy approximation artificial variables assumption basic feasible solution basic solution c₁ concave functions constant control survey convex combination convex functions convex set coordinates CORN CORNELL CORNEL CORNELL CORNELL LIBRARY CORNELL CORNELL UNIVERSITY CORNELL LIBRARY UNIVERSITY CORNELL UNIVERSITY CORNELL covariance matrix Creusen curve defined derivative determined direction observations discussion distance measured distance observation error ellipse extreme point EZRA CORNELL f₁ finite number geodetic control networks global optimum inverse iteration LIBRARY CORNELL CORNELL linear manifold linear programming problem main diagonal elements maximum likelihood estimate minimize multivariate normal distribution non-linear programming problem non-negative number of pointings objective function obtained off-diagonal elements parameters positive definite probable error random variable regression sample problems set of directions set of feasible simplex algorithm simplex method solved station adjustment statistical survey networks theory triangulation UNIVERSITY CORNELL LIBRARY UNIVERSITY LIBRARY CORNELL variance-covariance matrix vector x₁ y₁ zero