How to handle colored observation noise in large least-squares problems

Journal article (2003)

Authors

R. Klees

P. Ditmar

P. Broersen

Department

Remote Sensing (Aerospace Engineering) (TU Delft)

DOI: https://doi.org/doi:10.1007/s00190-002-0291-4

Large least-squares problems Auto regressive moving-average process Noise power spectral density function Satellite gravity gradiometry

More Info

expand_more

To reference this document use:

http://resolver.tudelft.nl/uuid:261e7eca-e195-4de0-a6e5-17b1377af0e9

Published Date

01-01-2003

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

Journal of Geodesy, 76 (11-12), 2003

ISSN:

0949-7714

Faculty

Aerospace Engineering

Department

Remote Sensing

Abstract

An approach to handling colored observation noise in large least-squares (LS) problems is presented. The handling of colored noise is reduced to the problem of solving a Toeplitz system of linear equations. The colored noise is represented as an auto regressive moving-average (ARMA) process. Stability and invertability of the ARMA model allows the solution of the Toeplitz system to be reduced to two successive filtering operations using the inverse transfer function of the ARMA model. The numerical complexity of the algorithm scales proportionally to the order of the ARMA model times the number of observations. This makes the algorithm particularly suited for LS problems with millions of observations. It can be used in combination with direct and iterative algorithms for the solution of the normal equations. The performance of the algorithm is demonstrated for the computation of a model of the Earth’s gravity field from simulated satellite-derived gravity gradients up to spherical harmonic degree 300.

Files

Klees_2003.pdf

(pdf | 0.475 Mb)