Autocorrelation Functions in GPS Data Processing: Modeling Aspects
|
|
- Rose Nash
- 6 years ago
- Views:
Transcription
1 Autocorrelation Functions in GPS Data Processing: Modeling Aspects Kai Borre, Aalborg University Gilbert Strang, Massachusetts Institute of Technology
2 Consider a process that is actually random walk but is incorrectly modeled as a random constant c. We have then for the true model x k = x k + ɛ k, ɛ k = unity Gaussian white noise, σ 2 {x } = b k = x k + e k, k =,, 2,... σ 2 {e k } =. and for the incorrect model x k = c, c N(, ) b k = x k + e k, k =,, 2,... σ 2 {e k } =. The wrong model has F k =, ɛ,k =, A k =, e,k =., ˆx =, and P =. For the true model the parameters are the same except that ɛ,k =, rather than zero.
3 Correctly and incorrectly filtered random walk process 5 Simulated random walk process State variable 5 5 Observations Random walk process Filter for correct model Filter for incorrect model
4 Computing the Autocorrelation Function Shift = : a a a 2 a 3 a 4... a a a 2 a 3 a 4... auto() = n a i a i /n. We multiply elements a i a i above each other, and add. Now shift the lower row: Shift = : a a a 2 a 3 a 4... a a a 2 a 3 a 4... auto() = n a i a i /n.
5 Autocorrelation for random data. The peak at zero measures the variance Linear trend subtracted 4 2 spike at zero shift increasing shift 4 2 Quadratic trend subtracted spike at zero shift increasing shift
6 Ionospheric delays for one-ways, single and double differences 2 I k = ( 2,k λ 2 N 2 ) (,k λ N ) ( f /f 2 ) 2 One ways at master One ways at rover Ionospheric delay I [m] Ionospheric delay I [m] Epochs, epoch interval 2 s Epochs, epoch interval 2 s 26 Ionospheric delay I [m] Single differences Epochs, epoch interval 2 s Ionospheric delay I [m] Double differences Epochs, epoch interval 2 s
7 x 7 x One-way PRN 2 differenced in time 3 2 One-way PRN 2 m 2 m x x Single difference PRN Double difference PRN 2 PRN 26 m 2 5 m Autocorrelation for ionospheric delay to PRN 2. Upper left shows difference in time: I k I k, upper right the one-way, lower left the single difference, and lower left the double difference. Note the various orders of magnitude
8 Autocorrelation of ionosphere delay for one-ways PRN Elevation σ I (in m) Shift for first zero (in ) master rover master rover
9 Reference Borre, Kai & Gilbert Strang (997) Autocorrelation Functions in GPS Data Processing: Modeling Aspects. Pages Institute of Navigation GPS-97, September 6 9, Kansas City, Missouri
10 Kalman Filters, Correlation Functions, Power Spectrums, and Ambiguity Experiments Kai Borre, Aalborg University
11 The following matrix equation P = P 2 2 λ ( f /f 2 ) 2 ( f /f 2 ) 2 λ 2 ρ e I ɛ N e 2 N 2 ɛ 2. () can be used in various ways. One method is to solve for the 4 unknowns on an epoch-to-epoch basis. An alternative is to employ () as an observation equation in a filter. In any case we are faced with an interesting problem: ρ and I are to be estimated as reals while N and N 2 by definition are integers. This situation is difficult. One procedure is to solve for all 4 unknowns as were they reals. This gives what is called a float solution. Given the float solution we can use a smart method that estimates N and N 2 as integers. This refined solution is known as the fixed solution. A popular method is the LAMBDA method decscribed by Teunissen [4]. However, our Matlab code uses a less complicated method described in [5].
12 Computed positions for a static receiver. The present observations are taken with active SA. The variation over time is mainly due to SA 2 X, Y, Z components of receiver position relative to mean position [m] [s] Raw receiver positions relative to mean position φ [ ] λ [ ]
13 The first 3 epochs are deleted due to bad data. During epochs 3 5 the rover remains at rest, from epoch 5 it is moving a bit. During epochs it is moved in a circle with radius ca. 6 meters. Then it rests at the circumference in epochs and then makes a random movement outside the circle in epochs The difference in computed positions for a static (master) receiver and a moving (rover) receiver. Now the detailed picture of the actual movement becomes clear. The differential positions are good to within a few dm. 2 X, Y, Z components of differential vector [m] [s] Differential receiver position 2 [m] [m]
14 Double differenced code and phase observations on L from static receivers. The ambiguities N are estimated as a float solution based on observations from epochs 3 4. Next the vector components (x, y, z) are computed and the vector length. x [m] y [m] 9.95 Estimated vector, L observations only, float ambiguities z [m] 6.5 norm of vector [m]
15 The figure shows the innovation for the four satellites as computed with respect to the reference satellite, covariance function for a selected innovation component, and the corresponding power spectrum illustrating the color of the innovation noise. norm [m] innov. [mm] pow. spec. [db] Estimated vector, L observations only, float ambiguities corr. fnc. [mm 2 ] 5 4 x σ vector = 2.6 mm
16 Float and fixed values of L ambiguities: The fixed values result from a procedure given by Yang et al. [5]. The above table lists the estimated ambiguities. We observe that the rounded values of the float ambiguities deviate at most 2 from the fixed values. The standard deviation of the length of the vector between master and rover is σ vector = 6.7 mm for the float solution and σ vector = 8.3 mm for the fixed solution. We see that the vector components drift over time when incorrect ambiguities are used. Fixing the ambiguities to the correct values yields an estimate of the vector components at cm-level or even at mm-level.
17 Double differenced code and phase observations on L from static receivers. Note that the vector length is easier to estimate than its single components x, y, z. x [m] y [m] z [m] norm of vector [m].5.45 Estimated vector, L observations only, fixed ambiguities
18 The ambiguities N are estimated as a fixed solution based on observations from epochs 3 4. Note the dramatic increase in accuracy by fixing the ambiguities! Note the nice peak of the covariance function. The innovations are close to white noise. norm [m] corr. fnc. [mm 2 ] pow. spec. [db] innov. [mm] Estimated vector, L observations only, fixed ambiguities σ vector = 8.59 mm
19 The same as Figure 3, but at epoch 25 we change an ambiguity with the amount of cycle x [m] y [m] Estimated vector, L observations only, fixed ambiguities, one changed by z [m] 7 norm of vector [m]
20 innov. [mm] pow. spec. [db] Estimated vector, L observations only, fixed ambiguities, one changed by cycle norm [m]6.2 corr. fnc. [mm 2 ] 5 x σ vector = 66.2 mm
21 The length of the baseline vector v = x 2 + y 2 + z 2 = d often is easier to estimate than the components of v = (x, y, z). We illustrate this by applying the law of variance propagation: σ 2 d = [ d x d y d z ] v d x d y d z = ( d v T) ( d v v ). For the actual data and with fixed ambiguities we have σ d = 3.5 mm, σ x = 4.8 mm, σ y =.7 mm, and σ z = 3.2 mm. This partially supports our statement.
22 All M-files producing the figures in this paper can be found at kom.auc.dk/~borre/life-l99 The original Ashtech data are stored in files *.5. The M-files bdata, edata, and sdata read the binary observation files and rearrange the data into a useful MATLAB format in the *.dat files. The call rawrecpo produces our first figure. This file calls two other M-files togeod and topocent. togeod is a function that computes geodetic coordinates (φ, λ, h) given Cartesian coordinates (X, Y, Z) and the semi-major axis a and inverse flattening f for a reference ellipsoid. topocent transforms a 3-D vector dx into topocentric coordinates (Dist, Az, El) with origin at X. The main M-file makebase reads the *.dat files, estimates ambiguities for DD on L according to Yang et al. (994) and uses get_eph and nd_eph to compute satellite positions. The file get_rho computes the distance in ECEF between satellite and receiver at raw transmit time given an ephemeris. Now we can write the observation equations for the unknown vector components (x, y, z). We solve the normals on an epoch-to-epoch basis.
23 Conclusions We have given a standard presentation of GPS observations and their characteristics. With a real data set we focus on a few specific topics: float and fixed ambiguity solutions and the effect on the estimated vector. In our special case we note that the standard deviation of the vector length is halved when changing from float to fixed solution. We also note that it is easier to estimate the vector length rather than the vector components themselves. Under controlled circumstances we change an ambiguity and study the effect on the solution and observe how the innovation vector slowly strives for the correct known solution.
24 References [] Borre, Kai (995) GPS i Landmålingen. Order at borre@kom.auc.dk [2] Borre, Kai (2) The GPS Toolbox. GPS Solutions, 4:3:47 5. John Wiley & Sons, Inc. [3] Strang, Gilbert & Borre, Kai (997) Linear Algebra, Geodesy, and GPS. Wellesley-Cambridge Press. Order at [4] Teunissen, P. J. G. (993) Least-Squares Estimation of the Integer GPS Ambiguities. In: LGR-Series No. 6, Delft Geodetic Computing Center [5] Yang, Ming & Goad, Clyde & Schaffrin, Burkhard (994) Real-time On-the-Fly Ambiguity Resolution Over Short Baselines in the Presence of Anti-Spoofing. In Proceedings of ION GPS-94,
25 Block Elimination and Weight Matrices Kai Borre Aalborg University
26 Block Elimination A C I A C A I C B x = b. D x 2 b 2 B x I = b D x 2 C A I b 2 or explicitly A B x D C A = B x 2 b b 2 C A. b Final result A B C D = A (I + B(D C A B) C A ) (D C A B) C A A B(D C A B) (D C A B).
27 Schreiber's Device In 877 Schreiber described a procedure for eliminating the unknowns x (we present a formulation somewhat more general than the original one): Let be given a set of observation equations A [ x x 2 ] = b ɛ. The unknown x is eliminated if we delete the columns in A corresponding to the unknown x, and add the fictitious observational row [ a T a 2 a T a 3... a T a n ] having the negative weight /a T a.
28 We demonstrate the procedure on a numerical example: 3 4 [ x x 2 ] = The augmented left side of the normals A T A is [ ] = [ ]. The augmented right side of the normals A T b is [ ] = [ 4 ].
29 Partition of Observation Equations Let be given a set of observation equations Ax = b ɛ partitioned into A A 2 x = b b 2 ɛ ɛ 2 with weights 2. (2) The matrix A describes usual geodetic observations while A 2 exclusively deals with observations of coordinates. Considering only the first block row of observations we get the usual solution ˆx = ˆx f : ˆx f = (A T A ) A T b = f A T b. The subscript f stands for free: The ˆx f solution relates to a network not constrained to the observed coordinates b 2. Of course we suppose f exists! Next we look for the solution x c when we include the second block row, namely the coordinate observations A 2 x = b 2 ɛ 2. By adding the normals from both rows we get
30 We recall that f (A T A + A T 2 2 A 2 ) ˆx = A T b + A T 2 2 b 2. (3) = A T A and A T b = f ˆx f : ˆx c = ( f + A T ) ( 2 2 A 2 f ˆx f + A T 2 2 b 2). The common step in all derivations is our favorite matrix identity With (4) we get = (T + A T e A) = T T A T ( e + AT A T ) AT. (4) ˆx c = ( f f A T 2 ( 2 + A 2 f A T 2 ) A 2 f )( f Multiplying out yields ˆx f + A T 2 2 b 2). ˆx c = ˆx f + f A T 2 2 b 2 f A T 2 ( 2 + A 2 f A T 2 ) A 2 ˆx f f A T 2 ( 2 + A 2 f A T 2 ) A 2 f A T 2 2 b 2.
31 Rearranging we get ˆx c = ˆx f f A T 2 ( 2 + A 2 f A T 2 ) A 2 ˆx f Using (4) once again in the opposite direction we get + ( f f A T 2 ( 2 + A 2 f A T 2 ) A 2 f ) A T 2 2 b 2. ˆx c = ˆx f f A T 2 ( 2 + A 2 f A T 2 ) A 2 ˆx f + ( f Finally the matrix identity (26) takes us the last step: + A T 2 2 A 2 ) A T 2 2 b 2. ˆx c = ˆx f f A T 2 ( 2 + A 2 f A T 2 ) A 2 ˆx f + f A T 2 ( 2 + A 2 f A T 2 ) b2 or rearranged ˆx c = ˆx f + f A T 2 ( 2 + A 2 f A T 2 ) (b 2 A 2 ˆx f ). (5) From (3) we read the covariance matrix of the constrained estimate ˆx c c = (A T A + A T 2 2 A 2 ). (6)
32 We recall that f = (A T A ), so (6) can be written Using (4) we get c = ( f + A T 2 2 A 2 ). (7) c = f f A T 2 ( 2 + A 2 2 A T 2 ) A 2 f. (8) A nonnegative definite matrix is subtracted from f, so c f. (9) This says that covariances in the constrained network are smaller than or equal to those in the free network. Putting 2 = in (2) the observation error equals zero is equivalent to introduce the constraint A 2 x = b 2 : A x = b ɛ () A 2 x = b 2. ()
33 This has a large impact on formulation of filters. Krarup calls this a hard postulation of the least-squares problem, opposed to a soft postulation of the constraints with 2 >. So setting the observation error equal to zero in a Kalman filter is the same as using a constraint in a standard least-squares formulation.
34 Dependency on the Weights b = b b 2, ɛ = ɛ ɛ 2, A = A A 2, = 2. The normal equation for the original, total problem is ( A T A + A T ) 2 2 A 2 ˆx = A T b + A T 2 2 b 2. (2) The perturbed problem is ( A T A + A T 2 ( 2 + ( 2 ))A 2) ( ˆx + x) = ( A T b + A T 2 ( 2 + ( 2 ))b 2). (3) Now subtract (2) from (3) to find an equation for x: ( A T A + A T 2 ( 2 + ( 2 ))A ) 2 x + A T 2 ( 2 )A 2 ˆx = A T 2 ( 2 )b 2.
35 We set N = A T A + A T 2 2 A 2 and ˆɛ 2 = b 2 A 2 ˆx. Then the change in ˆx is x = ( N + A T 2 ( 2 )A ) 2 A T 2 ( 2 )ˆɛ 2. (4) Now (4) yields the change in the inverse: ( N + A T 2 ( 2 )A ) 2 = N N A T( 2 ( 2 ) + A 2 N A T ) 2 A2 N. For m observations, this matrix multiplies A T 2 ( 2 )ˆɛ 2 to give x. If we specialize to one single observation, a2 T is an m by vector and 2 is a by scalar. We name the product a 2 N a2 T = s and get or x = N a T 2 x = ( 2 ) + s ( 2 ) s ( 2 ) ˆɛ 2 ˆɛ 2 ( 2 ) + s ( 2 ) N a T 2. (5)
36 A First Order Derivation If we consider a small change in the weighting matrix, we can compute the corresponding small movement ˆx in the estimate. The problem is linearized and higher order terms are ignored: A T( + ( ) ) A( ˆx + ˆx) = A T( + ( ) ) b. Subtracting A T A ˆx = A T b leaves an equation for the first-order correction ˆx: A T A( ˆx) = A T ( )(b A ˆx). This correction to ˆx is small when is small, and when the residual b A ˆx is small. If we work with the covariance matrix instead of, linearization gives = ( ). This is the matrix analog of x/x 2, the first-order change in /x. Linearization also gives the change in Q = (A T A), which contains the variances and covariances of the estimate ˆx: Q = Q A T ( )AQ.
37 Useful Matrix Identities Whenever the following inverse matrices exist we have (AB) = B A (6) (I + AB) A = A(I + B A) (7) A and B may not be square (8) for vectors we especially have (I + ab T ) a = a(i + b T a) (9) (A + B ) = A(A + B) B = B(A + B) A (2) (A + B DC) = A A B(D + C A B) C A (2) DC(A + B DC) = DC A (I + B DC A ) (22) = DC(I + A B DC) A (23) = D(I + C A B D) C A (24) = (I + DC A B) DC A (25) = (D + C A B) C A. (26)
38 MATLAB Code Demonstrating the Theory A = [ 2 6; 2 3 7; 3 4 8; 4 5 ]; b = [;7;8;2]; x = A\b A = A(:,:2); A2 = A(:,3); %Projector P = eye(4) A * inv(a * A) * A ; PA = P * A; Pb = P * b; x3 = Pb(4)/PA(4,3) %Block elimination N = A * A; b = A * b; b = b(:2); b2 = b(3); A = N(:2,:2); B = N(:2,3); D = N(3,3); x3 = inv(d B * inv(a) * B) * (b2 B * inv(a) * b) %General formula M = A2 * A * inv(a * A) * A ; R = A2 M; x3 = inv(r * A2) * R * b
39 Reference Strang, Gilbert & Kai Borre (997) Linear Algebra, Geodesy, and GPS. Wellesley-Cambridge Press. Order at
Statistical characteristics of L1 carrier phase observations from four low-cost GPS receivers
58 Statistical Characteristics of L1 Carrier Phase Observations ordic Journal of Surveying and Real Estate Research 7:1 (21) 58 75 submitted on September 18, 29 revised on March 25, 21 accepted on May
More informationDerivation of the Kalman Filter
Derivation of the Kalman Filter Kai Borre Danish GPS Center, Denmark Block Matrix Identities The key formulas give the inverse of a 2 by 2 block matrix, assuming T is invertible: T U 1 L M. (1) V W N P
More informationIt is the purpose of this contribution to present the probability distribution of the 'xed' baseline. This will be done for the case the ambiguities a
THE DISTRIBUTION OF THE GPS BASELINE IN CASE OF INTEGER LEAST-SQUARES AMBIGUITY ESTIMATION P.J.G. Teunissen Delft Geodetic Computing Centre (LGR) Faculty of Geodesy Delft University of Technology Thijsseweg
More informationNoise Characteristics in High Precision GPS Positioning
Noise Characteristics in High Precision GPS Positioning A.R. Amiri-Simkooei, C.C.J.M. Tiberius, P.J.G. Teunissen, Delft Institute of Earth Observation and Space systems (DEOS), Delft University of Technology,
More informationENGR352 Problem Set 02
engr352/engr352p02 September 13, 2018) ENGR352 Problem Set 02 Transfer function of an estimator 1. Using Eq. (1.1.4-27) from the text, find the correct value of r ss (the result given in the text is incorrect).
More informationCarrier Phase Integer Ambiguity Resolution Recent results and open issues
Carrier Phase Integer Ambiguity Resolution Recent results and open issues Sandra Verhagen DEOS, Delft University of Technology, The Netherlands Kolloquium Satellitennavigation, TU München, 9 February 2010
More informationEvaluation of Two Integer Ambiguity Resolution Methods for Real Time GPS Positioning
Evaluation of Two Integer Ambiguity Resolution Methods for Real Time GPS Positioning LEANDRO BARONI, HÉLIO KOITI KUGA Space Mechanics and Control Division National Institute for Space Research 12227-010,
More informationGPS Geodesy - LAB 7. Neglecting the propagation, multipath, and receiver errors, eq.(1) becomes:
GPS Geodesy - LAB 7 GPS pseudorange position solution The pseudorange measurements j R i can be modeled as: j R i = j ρ i + c( j δ δ i + ΔI + ΔT + MP + ε (1 t = time of epoch j R i = pseudorange measurement
More informationCarrier Phase Techniques
Carrier Phase Techniques Michael P Vitus August 30, 2005 Introduction This paper provides an explanation of the methods as well as the wor performed on the GPS project under Professor Ng ding the summer
More informationESTIMATING THE RESIDUAL TROPOSPHERIC DELAY FOR AIRBORNE DIFFERENTIAL GPS POSITIONING (A SUMMARY)
ESTIMATING THE RESIDUAL TROPOSPHERIC DELAY FOR AIRBORNE DIFFERENTIAL GPS POSITIONING (A SUMMARY) J. Paul Collins and Richard B. Langley Geodetic Research Laboratory Department of Geodesy and Geomatics
More informationIonosphere influence on success rate of GPS ambiguity resolution in a satellite formation flying
Journal of Physics: Conference Series PAPER OPEN ACCESS Ionosphere influence on success rate of GPS ambiguity resolution in a satellite formation flying To cite this article: Leandro Baroni 2015 J. Phys.:
More informationEESC Geodesy with the Global Positioning System. Class 6: Point Positioning using Pseuduorange
EESC 9945 Geodesy with the Global Positioning System Class 6: Point Positioning using Pseuduorange GPS Positioning Solutions Point Positioning: Determination of the coordinates of a point with respect
More informationRegression. Oscar García
Regression Oscar García Regression methods are fundamental in Forest Mensuration For a more concise and general presentation, we shall first review some matrix concepts 1 Matrices An order n m matrix is
More information6 The SVD Applied to Signal and Image Deblurring
6 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationMatrix Algebra. Learning Objectives. Size of Matrix
Matrix Algebra 1 Learning Objectives 1. Find the sum and difference of two matrices 2. Find scalar multiples of a matrix 3. Find the product of two matrices 4. Find the inverse of a matrix 5. Solve a system
More informationKalman Filter Computer Vision (Kris Kitani) Carnegie Mellon University
Kalman Filter 16-385 Computer Vision (Kris Kitani) Carnegie Mellon University Examples up to now have been discrete (binary) random variables Kalman filtering can be seen as a special case of a temporal
More information8 The SVD Applied to Signal and Image Deblurring
8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More information8 The SVD Applied to Signal and Image Deblurring
8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More informationModern Navigation
12.215 Modern Navigation Thomas Herring (tah@mit.edu), MW 10:30-12:00 Room 54-322 http://geoweb.mit.edu/~tah/12.215 Course Overview The development of the Global Positioning System (GPS) started in the
More informationOutline. Math Numerical Analysis. Errors. Lecture Notes Linear Algebra: Part B. Joseph M. Mahaffy,
Math 54 - Numerical Analysis Lecture Notes Linear Algebra: Part B Outline Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences
More informationSparse least squares and Q-less QR
Notes for 2016-02-29 Sparse least squares and Q-less QR Suppose we want to solve a full-rank least squares problem in which A is large and sparse. In principle, we could solve the problem via the normal
More informationInfluence of ambiguity precision on the success rate of GNSS integer ambiguity bootstrapping
J Geod (007) 8:35 358 DOI 0007/s0090-006-0-3 ORIGINAL ARTICLE Influence of ambiguity precision on the success rate of GNSS integer ambiguity bootstrapping P J G Teunissen Received: March 006 / Accepted:
More informationSIGMA-F: Variances of GPS Observations Determined by a Fuzzy System
SIGMA-F: Variances of GPS Observations Determined by a Fuzzy System A. Wieser and F.K. Brunner Engineering Surveying and Metrology, Graz University of Technology, Steyrergasse 3, A-8 Graz, Austria Keywords.
More informationDynamic data processing recursive least-squares
Dynamic data processing recursive least-squares Dynamic data processing recursive least-squares Delft University of Technology Department of Mathematical Geodesy and Positioning VSSD Series on Mathematical
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationApproximation of ambiguity covariance matrix for integer de-correlation procedure in single-epoch GNSS positioning
he 9 th International Conference ENVIRONMENAL ENGINEERING 22 23 May 24, Vilnius, Lithuania SELECED PAPERS eissn 229-792 / eisbn 978-69-457-64-9 Available online at http://enviro.vgtu.lt Section: echnologies
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationMathematical preliminaries and error analysis
Mathematical preliminaries and error analysis Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Round-off errors and computer arithmetic
More informationElementary Linear Algebra
Elementary Linear Algebra Linear algebra is the study of; linear sets of equations and their transformation properties. Linear algebra allows the analysis of; rotations in space, least squares fitting,
More informationLet x be an approximate solution for Ax = b, e.g., obtained by Gaussian elimination. Let x denote the exact solution. Call. r := b A x.
ESTIMATION OF ERROR Let x be an approximate solution for Ax = b, e.g., obtained by Gaussian elimination. Let x denote the exact solution. Call the residual for x. Then r := b A x r = b A x = Ax A x = A
More informationNumerical Methods Lecture 2 Simultaneous Equations
CGN 42 - Computer Methods Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations Matrix operations: Adding / subtracting Transpose Multiplication Adding
More informationThis appendix provides a very basic introduction to linear algebra concepts.
APPENDIX Basic Linear Algebra Concepts This appendix provides a very basic introduction to linear algebra concepts. Some of these concepts are intentionally presented here in a somewhat simplified (not
More information7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.
7.5 Operations with Matrices Copyright Cengage Learning. All rights reserved. What You Should Learn Decide whether two matrices are equal. Add and subtract matrices and multiply matrices by scalars. Multiply
More informationProblem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set 2 MAS 622J/1.126J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
More informationEESC Geodesy with the Global Positioning System. Class 4: The pseudorange and phase observables
EESC 9945 Geodesy with the Global Positioning System Class 4: The pseudorange and phase observables In previous classes we had presented the equation for the pseudorange as the true range biased by the
More informationBasic Concepts in Matrix Algebra
Basic Concepts in Matrix Algebra An column array of p elements is called a vector of dimension p and is written as x p 1 = x 1 x 2. x p. The transpose of the column vector x p 1 is row vector x = [x 1
More informationLinear Algebra V = T = ( 4 3 ).
Linear Algebra Vectors A column vector is a list of numbers stored vertically The dimension of a column vector is the number of values in the vector W is a -dimensional column vector and V is a 5-dimensional
More informationPrinciples of the Global Positioning System Lecture 11
12.540 Principles of the Global Positioning System Lecture 11 Prof. Thomas Herring http://geoweb.mit.edu/~tah/12.540 Statistical approach to estimation Summary Look at estimation from statistical point
More informationPredictive Control of Gyroscopic-Force Actuators for Mechanical Vibration Damping
ARC Centre of Excellence for Complex Dynamic Systems and Control, pp 1 15 Predictive Control of Gyroscopic-Force Actuators for Mechanical Vibration Damping Tristan Perez 1, 2 Joris B Termaat 3 1 School
More informationUSING THE INTEGER DECORRELATION PROCEDURE TO INCREASE OF THE EFFICIENCY OF THE MAFA METHOD
ARIFICIAL SAELLIES, Vol. 46, No. 3 2 DOI:.2478/v8-2-2- USING HE INEGER DECORRELAION PROCEDURE O INCREASE OF HE EFFICIENCY OF HE MAFA MEHOD S. Cellmer Institute of Geodesy University of Warmia and Mazury
More informationMathematical Tools for Neuroscience (NEU 314) Princeton University, Spring 2016 Jonathan Pillow. Homework 8: Logistic Regression & Information Theory
Mathematical Tools for Neuroscience (NEU 34) Princeton University, Spring 206 Jonathan Pillow Homework 8: Logistic Regression & Information Theory Due: Tuesday, April 26, 9:59am Optimization Toolbox One
More informationVectors and Matrices Statistics with Vectors and Matrices
Vectors and Matrices Statistics with Vectors and Matrices Lecture 3 September 7, 005 Analysis Lecture #3-9/7/005 Slide 1 of 55 Today s Lecture Vectors and Matrices (Supplement A - augmented with SAS proc
More informationChapter 2. Matrix Arithmetic. Chapter 2
Matrix Arithmetic Matrix Addition and Subtraction Addition and subtraction act element-wise on matrices. In order for the addition/subtraction (A B) to be possible, the two matrices A and B must have the
More informationSatellite Navigation error sources and position estimation
Satellite Navigation error sources and position estimation Picture: ESA AE4E08 Sandra Verhagen Course 2010 2011, lecture 6 1 Today s topics Recap: GPS measurements and error sources Signal propagation
More informationARTIFICIAL SATELLITES, Vol. 41, No DOI: /v THE LAMBDA METHOD FOR THE GNSS COMPASS
ARTIFICIAL SATELLITES, Vol. 41, No. 3-2006 DOI: 10.2478/v10018-007-0009-1 THE LAMBDA METHOD FOR THE GNSS COMPASS P.J.G. Teunissen Delft Institute for Earth Observation and Space Systems (DEOS Delft University
More informationStatistical methods. Mean value and standard deviations Standard statistical distributions Linear systems Matrix algebra
Statistical methods Mean value and standard deviations Standard statistical distributions Linear systems Matrix algebra Statistical methods Generating random numbers MATLAB has many built-in functions
More informationMark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation.
CS 189 Spring 2015 Introduction to Machine Learning Midterm You have 80 minutes for the exam. The exam is closed book, closed notes except your one-page crib sheet. No calculators or electronic items.
More informationTime: 1 hour 30 minutes
Paper Reference(s) 6664/01 Edexcel GCE Core Mathematics C Silver Level S4 Time: 1 hour 0 minutes Materials required for examination Mathematical Formulae (Green) Items included with question papers Nil
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More information(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB (Mathematical Operations with Arrays) Contents Getting Started Matrices Creating Arrays Linear equations Mathematical Operations with Arrays Using Script
More informationSteven J. Leon University of Massachusetts, Dartmouth
INSTRUCTOR S SOLUTIONS MANUAL LINEAR ALGEBRA WITH APPLICATIONS NINTH EDITION Steven J. Leon University of Massachusetts, Dartmouth Boston Columbus Indianapolis New York San Francisco Amsterdam Cape Town
More informationARTIFICIAL SATELLITES, Vol. 41, No DOI: /v
ARTIFICIAL SATELLITES, Vol. 41, No. 1-006 DOI: 10.478/v10018-007-000-8 On InSAR AMBIGUITY RESOLUTION FOR DEFORMATION MONITORING P.J.G. Teunissen Department of Earth Observation and Space Sstems (DEOS)
More informationOPTIMAL ESTIMATION of DYNAMIC SYSTEMS
CHAPMAN & HALL/CRC APPLIED MATHEMATICS -. AND NONLINEAR SCIENCE SERIES OPTIMAL ESTIMATION of DYNAMIC SYSTEMS John L Crassidis and John L. Junkins CHAPMAN & HALL/CRC A CRC Press Company Boca Raton London
More informationFigure from Mike Rymer, USGS
Ge111A Winter 2009 3/5/2009 1 Figure from Mike Rymer, USGS Ge111A Winter 2009 3/5/2009 2 Ge111A Winter 2009 3/5/2009 3 SWIR image made from ASTER data Ge111A Winter 2009 3/5/2009 4 Ge111A Winter 2009 3/5/2009
More information1.1 Basic Algebra. 1.2 Equations and Inequalities. 1.3 Systems of Equations
1. Algebra 1.1 Basic Algebra 1.2 Equations and Inequalities 1.3 Systems of Equations 1.1 Basic Algebra 1.1.1 Algebraic Operations 1.1.2 Factoring and Expanding Polynomials 1.1.3 Introduction to Exponentials
More informationCITS2401 Computer Analysis & Visualisation
FACULTY OF ENGINEERING, COMPUTING AND MATHEMATICS CITS2401 Computer Analysis & Visualisation SCHOOL OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING Topic 7 Matrix Algebra Material from MATLAB for Engineers,
More informationModern Navigation. Thomas Herring
12.215 Modern Navigation Thomas Herring Basic Statistics Summary of last class Statistical description and parameters Probability distributions Descriptions: expectations, variances, moments Covariances
More informationNumerical Methods Lecture 2 Simultaneous Equations
Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations pages 58-62 are a repeat of matrix notes. New material begins on page 63. Matrix operations: Mathcad
More informationPrinciples of the Global Positioning System Lecture 14
12.540 Principles of the Global Positioning System Lecture 14 Prof. Thomas Herring http://geoweb.mit.edu/~tah/12.540 Propagation Medium Propagation: Signal propagation from satellite to receiver Light-time
More informationA TOUR OF LINEAR ALGEBRA FOR JDEP 384H
A TOUR OF LINEAR ALGEBRA FOR JDEP 384H Contents Solving Systems 1 Matrix Arithmetic 3 The Basic Rules of Matrix Arithmetic 4 Norms and Dot Products 5 Norms 5 Dot Products 6 Linear Programming 7 Eigenvectors
More informationA Review of Linear Algebra
A Review of Linear Algebra Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab: Implementations
More informationThe Matrix Algebra of Sample Statistics
The Matrix Algebra of Sample Statistics James H. Steiger Department of Psychology and Human Development Vanderbilt University James H. Steiger (Vanderbilt University) The Matrix Algebra of Sample Statistics
More informationWeek 02. Assist. Prof. Dr. Himmet KARAMAN
Week 02 Assist. Prof. Dr. Himmet KARAMAN Contents Satellite Orbits Ephemerides GPS Review Accuracy & Usage Limitation Reference Systems GPS Services GPS Segments Satellite Positioning 2 Satellite Orbits
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 2 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization 1 Outline 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization Summary 2 Outline 3.2
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationOn the realistic stochastic model of GPS observables: Implementation and Performance
he International Archives of the Photogrammetry, Remote Sensing Spatial Information Sciences, Volume XL-/W5, 05 International Conference on Sensors & Models in Remote Sensing & Photogrammetry, 3 5 Nov
More informationModern Navigation. Thomas Herring
12.215 Modern Navigation Thomas Herring Review of last Class Review of linear Algebra. Class will be based on the book Linear Algebra, Geodesy, and GPS, G. Strang and K. Borre, Wellesley-Cambridge Press,
More informationMatrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More informationChapter 8: Linear Algebraic Equations
Chapter 8: Linear Algebraic Equations Matrix Methods for Linear Equations Uniqueness and Existence of Solutions Under-Determined Systems Over-Determined Systems Linear Algebraic Equations For 2 Equations
More informationReview of matrices. Let m, n IN. A rectangle of numbers written like A =
Review of matrices Let m, n IN. A rectangle of numbers written like a 11 a 12... a 1n a 21 a 22... a 2n A =...... a m1 a m2... a mn where each a ij IR is called a matrix with m rows and n columns or an
More informationComputational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Eigenvalues and Eigenvectors Ramani Duraiswami, Dept. of Computer Science Eigen Values of a Matrix Recap: A N N matrix A has an eigenvector x (non-zero) with corresponding
More informationKinematic Monitoring for Baselines Ranging from 3m to 30km
Kinematic Monitoring for Baselines Ranging from 3m to 3km By: Colin Huber Waypoint Consulting Inc. November 23 1. INTRODUCTION This report investigates the accuracy and reliability for the continuous trajectory
More informationRECURSIVE ESTIMATION AND KALMAN FILTERING
Chapter 3 RECURSIVE ESTIMATION AND KALMAN FILTERING 3. The Discrete Time Kalman Filter Consider the following estimation problem. Given the stochastic system with x k+ = Ax k + Gw k (3.) y k = Cx k + Hv
More informationJoint GPS and Vision Estimation Using an Adaptive Filter
1 Joint GPS and Vision Estimation Using an Adaptive Filter Shubhendra Vikram Singh Chauhan and Grace Xingxin Gao, University of Illinois at Urbana-Champaign Shubhendra Vikram Singh Chauhan received his
More informationCITS2401 Computer Analysis & Visualisation
FACULTY OF ENGINEERING, COMPUTING AND MATHEMATICS CITS2401 Computer Analysis & Visualisation SCHOOL OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING Topic 7 Matrix Algebra Material from MATLAB for Engineers,
More informationModern Navigation. Thomas Herring
12.215 Modern Navigation Thomas Herring Estimation methods Review of last class Restrict to basically linear estimation problems (also non-linear problems that are nearly linear) Restrict to parametric,
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS We want to solve the linear system a, x + + a,n x n = b a n, x + + a n,n x n = b n This will be done by the method used in beginning algebra, by successively eliminating unknowns
More informationEESC Geodesy with the Global Positioning System. Class 7: Relative Positioning using Carrier-Beat Phase
EESC 9945 Geodesy with the Global Positioning System Class 7: Relative Positioning using Carrier-Beat Phase GPS Carrier Phase The model for the carrier-beat phase observable for receiver p and satellite
More informationUnderstanding the Differences between LS Algorithms and Sequential Filters
Understanding the Differences between LS Algorithms and Sequential Filters In order to perform meaningful comparisons between outputs from a least squares (LS) orbit determination algorithm and orbit determination
More information1 Cricket chirps: an example
Notes for 2016-09-26 1 Cricket chirps: an example Did you know that you can estimate the temperature by listening to the rate of chirps? The data set in Table 1 1. represents measurements of the number
More informationDesigning Information Devices and Systems I Discussion 13B
EECS 6A Fall 7 Designing Information Devices and Systems I Discussion 3B. Orthogonal Matching Pursuit Lecture Orthogonal Matching Pursuit (OMP) algorithm: Inputs: A set of m songs, each of length n: S
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationLinear Algebra and Matrices
Linear Algebra and Matrices 4 Overview In this chapter we studying true matrix operations, not element operations as was done in earlier chapters. Working with MAT- LAB functions should now be fairly routine.
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationStat 159/259: Linear Algebra Notes
Stat 159/259: Linear Algebra Notes Jarrod Millman November 16, 2015 Abstract These notes assume you ve taken a semester of undergraduate linear algebra. In particular, I assume you are familiar with the
More informationx + 2y + 3z = 8 x + 3y = 7 x + 2z = 3
Chapter 2: Solving Linear Equations 23 Elimination Using Matrices As we saw in the presentation, we can use elimination to make a system of linear equations into an upper triangular system that is easy
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationModular numbers and Error Correcting Codes. Introduction. Modular Arithmetic.
Modular numbers and Error Correcting Codes Introduction Modular Arithmetic Finite fields n-space over a finite field Error correcting codes Exercises Introduction. Data transmission is not normally perfect;
More informationCAAM 454/554: Stationary Iterative Methods
CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are
More informationSatellite Navigation PVT estimation and integrity
Satellite Navigation PVT estimation and integrity Picture: ESA AE4E8 Sandra Verhagen Course 1 11, lecture 7 1 Satellite Navigation (AE4E8 Lecture 7 Today s topics Position, Velocity and Time estimation
More informationLecture 3 Linear Algebra Background
Lecture 3 Linear Algebra Background Dan Sheldon September 17, 2012 Motivation Preview of next class: y (1) w 0 + w 1 x (1) 1 + w 2 x (1) 2 +... + w d x (1) d y (2) w 0 + w 1 x (2) 1 + w 2 x (2) 2 +...
More information9709 MATHEMATICS. 9709/33 Paper 3, maximum raw mark 75
CAMBRIDGE INTERNATIONAL EXAMINATIONS GCE Advanced Level MARK SCHEME for the May/June 04 series 9709 MATHEMATICS 9709/ Paper, maximum raw mark 75 This mark scheme is published as an aid to teachers and
More informationSTATIC AND DYNAMIC RECURSIVE LEAST SQUARES
STATC AND DYNAMC RECURSVE LEAST SQUARES 3rd February 2006 1 Problem #1: additional information Problem At step we want to solve by least squares A 1 b 1 A 1 A 2 b 2 A 2 A x b, A := A, b := b 1 b 2 b with
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More information