Scribd
Upload
6 views2 pages

Sample Problem 2 Resection

The document outlines a step-by-step procedure for solving a resection problem using least squares, focusing on the unknown point P in relation to fixed control stations. It details the setup of observation equations, the use of variation coordinates for initial estimates, and the iterative process to update coordinates until convergence. Finally, it discusses obtaining residuals and performing post-adjustment analysis to determine the standard error of the coordinates.

Uploaded by

nickodump1
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Sample Problem 2 Resection

The document outlines a step-by-step procedure for solving a resection problem using least squares, focusing on the unknown point P in relation to fixed control stations. It details the setup of observation equations, the use of variation coordinates for initial estimates, and the iterative process to update coordinates until convergence. Finally, it discusses obtaining residuals and performing post-adjustment analysis to determine the standard error of the coordinates.

Uploaded by

nickodump1
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Sample Problem 2.

Resection by Distance Observation Equations


Describe the step-by-step procedure on the least square solution of the figure below,.

Q
Control Stations
X Y
S 5,539.424 9,526.203
R 7,604.956 8,658.165
Q 6,532.742 11,638.371
P
Obs. EDM Distances (2+2ppm)
PS 1,025.245
S PR 1,260.067
PQ 2,293.481
Fig 7.2 Three Pt. resection R

Solution:
Since the occupied station P is the only unknown point and assumed to be the initial point. The
final points are fixed therefore no adjustments on their coordinates are made.
1. Set-up the system of observation equations is:
𝑥 −𝑥 𝑦 −𝑦
line 1 (PQ) : 𝑣1 + 𝑑𝑃𝑄 − 𝑃𝑄𝑜 = − 𝑄𝑄𝑃 𝑃 ∆𝑥𝑃 − 𝑄𝑄𝑃 𝑃 ∆𝑦𝑃
𝑜 𝑜
𝑥 −𝑥 𝑦 −𝑦
line 2 (PR) 𝑣2 + 𝑑𝑃𝑅 − 𝑃𝑅𝑜 = − 𝑅𝑅𝑃 𝑃 ∆𝑥𝑃 − 𝑅𝑅𝑃 𝑃 ∆𝑦𝑃
𝑜 𝑜
𝑥𝑆 −𝑥𝑃 𝑦𝑆 −𝑦𝑃
line 3 (PS) 𝑣2 + 𝑑𝑃𝑆 − 𝑃𝑆𝑜 = − 𝑆𝑃 ∆𝑥𝑃 − 𝑆𝑃 ∆𝑦𝑃
𝑜 𝑜
Each observed distance in Fig. 7.2 represents one distance observation equation.
In matrix form
𝑥𝑄 − 𝑥𝑃 𝑦𝑄 − 𝑦𝑃
− −
𝑄𝑃𝑜 𝑄𝑃𝑜
𝑣1 𝑑𝑄𝑃 − 𝑄𝑃𝑜 𝑥𝑅 − 𝑥𝑃 𝑦𝑅 − 𝑦𝑃 ∆𝑥
[𝑣2 ] + [ 𝑑𝑅𝑃 − 𝑅𝑃𝑜 ] = − − [ ] [2.1.6]
𝑣3 𝑅𝑃𝑜 𝑅𝑃𝑜 ∆𝑦
𝑑𝑆𝑃 − 𝑆𝑃𝑜 𝑥𝑆 − 𝑥𝑃 𝑦𝑆 − 𝑦𝑃
− −
[ 𝑆𝑃𝑂 𝑆𝑃𝑂 ]
𝑣 + 𝑓 = 𝐽 𝛥

2. Using the method of variation coordinates make an initial estimate of the unknown point
P(xp,yp) and evaluate:
a. the difference between the observed distance and the computed distance
b. and the coefficients of the jacobian matrix
[Link] solve for the variable vector, normalize the matrix syatem
𝐽𝑇 𝑓 = 𝐽𝑇 𝐽𝛥
or 𝐽𝑇 𝑓 = 𝑁𝛥 [𝟐. 𝟏. 𝟕]
𝑁 𝐽𝑇 𝑓 = ∆
−1

4. Solve the variable vector to obtain corrections for the approximate coordinates.

5. Update the coordinates of the unknown point based on the calculated corrections
𝑥 = 𝑥𝑜 + ∆𝑥 [2.1.8]
𝑦 = 𝑦𝑜 + ∆𝑦 [2.1.9]
6. Repeat steps 2-5 until variable vector approaches zero. The last update is the final
coordinates
7. Obtaining the residuals
𝑣 = 𝐽𝛥 − 𝑓 [2.1.10]
8. To determine the standard error of coordinates, post adjustment analysis should be done.

You might also like