首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 93 毫秒
1.
This presentation is a follow-up of the paper “A Few Basic Principles and Techniques of Array Algebra”, published previously in theBulletin Géodésique. The attention is focused on the use of array algebra in the problem area of multilinear least squares prediction and filtering. The prediction mathematical models are treated using the concept of the covariance function and node points. In the latter part of the paper, efficient prediction formulas in two dimensions are developed and solved through the least squares filtering process, upon specializing the results derived previously for any dimensions. (Errata Sheet for the previous paper is added). Formerly of DBA Systems, Inc. P.O. Drawer 550 Melbourne, Florida 32901.  相似文献   

2.
The Euclidean spaces with their inner products are used to describe methods of least squares adjustment as orthogonal projections on finite-dimensional subspaces. A unified Euclidean space approach to the least squares adjustment methods “observation equations” and “condition equations” is suggested. Hence not only the two adjustment solutions are treated from the view-point of Euclidean space theory in a unified frame but also the existing duality relation between the methods of “observation equations” and “condition equations” is discussed in full detail. Another purpose of this paper is to contribute to the development of some familiarity with Euclidean and Hilbert space concepts. We are convinced that Euclidean and Hilbert space techniques in least squares adjustment are elegant and powerful geodetic methods.  相似文献   

3.
A least squares solution of sequential array algebra observation equations is derived using spectral decomposition of the normal equation matrix in terms of array algebra. A new direct solution for computation of eigenvectors is derived using the theory of general matrix inverses.  相似文献   

4.
Array algebra forms the general base of fast transforms and multilinear algebra making rigorous solutions of a large number (millions) of parameters computationally feasible. Loop inverses are operators solving the problem of general matrix inverses. Their derivation starts from the inconsistent linear equations by a parameter exchangeX→L 0, where X is a set of unknown observables,A 0 forming a basis of the so called “problem space”. The resulting full rank design matrix of parameters L0 and its ℓ-inverse reveal properties speeding the computational least squares solution expressed in observed values . The loop inverses are found by the back substitution expressing ∧X in terms ofL through . Ifp=rank (A) ≤n, this chain operator creates the pseudoinverseA +. The idea of loop inverses and array algebra started in the late60's from the further specialized case,p=n=rank (A), where the loop inverse A 0 −1 (AA 0 −1 )ℓ reduces into the ℓ-inverse Aℓ=(ATA)−1AT. The physical interpretation of the design matrixA A 0 −1 as an interpolator, associated with the parametersL 0, and the consideration of its multidimensional version has resulted in extended rules of matrix and tensor calculus and mathematical statistics called array algebra.  相似文献   

5.
To apply the least squares method for the interpolation of harmonic functions is a common practice in Geodesy. Since the method of least squares can be applied only to overdetermined problem, the interpolation problem which is always under-determined, is often reduced to an overdetermined form by truncating a series of spherical harmonics. When the data points are the knots of a regular grid it is easy to see that the estimated harmonic coefficients converge to the correct theoretical values, but when the observation density is not constant a significant bias is introduced. The result is obtained by assuming that the number of observations tends to infinity with points sampled from a given distribution. Under the same conditions it is shown that quadrature and “collocation-like” formulas displays a statistically consistent behaviour.  相似文献   

6.
Principles of North determination using suspended gyrocompasses are reviewed. Accuracy is evaluated and a procedure with two series of measurements symmetrical with respect to the zero torsion tape position is mathematically proven to be the “best” (minimum variance). Our purpose is to prove that a 20″ accuracy (1 σ) instrument was brought to a level of accuracy four times better by using multiple transit times and least squares fit. Over a total of 15 North determinations based on more than a thousand transit times, an external standard error of 4″.4 was obtained using a WildGAK-1.  相似文献   

7.
In this contribution it is shown that the so-called “total least-squares estimate” (TLS) within an errors-in-variables (EIV) model can be identified as a special case of the method of least-squares within the nonlinear Gauss–Helmert model. In contrast to the EIV-model, the nonlinear GH-model does not impose any restrictions on the form of functional relationship between the quantities involved in the model. Even more complex EIV-models, which require specific approaches like “generalized total least-squares” (GTLS) or “structured total least-squares” (STLS), can be treated as nonlinear GH-models without any serious problems. The example of a similarity transformation of planar coordinates shows that the “total least-squares solution” can be obtained easily from a rigorous evaluation of the Gauss–Helmert model. In contrast to weighted TLS, weights can then be introduced without further limitations. Using two numerical examples taken from the literature, these solutions are compared with those obtained from certain specialized TLS approaches.  相似文献   

8.
Selectivity estimation is crucial for query optimizers choosing an optimal spatial execution plan in a spatial database management system.This paper presents an Annular Bucket spatial histogram(AB histogram)that can estimate the selectivity in finer spatial selection and spatial join operations even when the spatial query has more operators or more joins.The AB histogram is represented as a set of bucket-range,bucket-count value pairs.The bucket-range often covers an annular region like a sin-gle-cell-sized photo frame.The bucket-count is the number of objects whose Minimum Bounding Rectangles(MBRs)fall between outer rectangle and inner rectangle of the bucket-range.Assuming that all MBRs in each a bucket distribute evenly,for every buck-et,we can obtain serial probabilities that satisfy a certain spatial selection or join conditions from the operations’ semantics and the spatial relations between every bucket-range and query ranges.Thus,according to some probability theories,spatial selection or join selectivity can be estimated by the every bucket-count and its probabilities.This paper also shows a way to generate an updated AB histogram from an original AB histogram and those probabilities.Our tests show that the AB histogram not only supports the selectivity estimation of spatial selection or spatial join with "disjoint","intersect","within","contains",and "overlap" operators but also provides an approach to generate a reliable updated histogram whose spatial distribution is close to the distribution of ac-tual query result.  相似文献   

9.
Calibration of satellite gradiometer data aided by ground gravity data   总被引：1，自引：0，他引：1  
Parametric least squares collocation was used in order to study the detection of systematic errors of satellite gradiometer data. For this purpose, simulated data sets with a priori known systematic errors were produced using ground gravity data in the very smooth gravity field of the Canadian plains. Experiments carried out at different satellite altitudes showed that the recovery of bias parameters from the gradiometer “measurements” is possible with high accuracy, especially in the case of crossing tracks. The mean value of the differences (original minus estimated bias parameters) was relatively large compared to the standard deviation of the corresponding second-order derivative component at the corresponding height. This mean value almost vanished when gravity data at ground level were combined with the second-order derivative data set at satellite altitude. In the case of simultaneous estimation of bias and tilt parameters from ∂2 T/∂z 2“measurements”, the recovery of both parameters agreed very well with the collocation error estimation. Received: 10 October 1996 / Accepted 25 May 1998  相似文献   

10.
In order to achieve to GPS solutions of first-order accuracy and integrity, carrier phase observations as well as pseudorange observations have to be adjusted with respect to a linear/linearized model. Here the problem of mixed integer-real valued parameter adjustment (IRA) is met. Indeed, integer cycle ambiguity unknowns have to be estimated and tested. At first we review the three concepts to deal with IRA: (i) DDD or triple difference observations are produced by a properly chosen difference operator and choice of basis, namely being free of integer-valued unknowns (ii) The real-valued unknown parameters are eliminated by a Gauss elimination step while the remaining integer-valued unknown parameters (initial cycle ambiguities) are determined by Quadratic Programming and (iii) a RA substitute model is firstly implemented (real-valued estimates of initial cycle ambiguities) and secondly a minimum distance map is designed which operates on the real-valued approximation of integers with respect to the integer data in a lattice. This is the place where the integer Gram-Schmidt orthogonalization by means of the LLL algorithm (modified LLL algorithm) is applied being illustrated by four examples. In particular, we prove that in general it is impossible to transform an oblique base of a lattice to an orthogonal base by Gram-Schmidt orthogonalization where its matrix enties are integer. The volume preserving Gram-Schmidt orthogonalization operator constraint to integer entries produces “almost orthogonal” bases which, in turn, can be used to produce the integer-valued unknown parameters (initial cycle ambiguities) from the LLL algorithm (modified LLL algorithm). Systematic errors generated by “almost orthogonal” lattice bases are quantified by A. K. Lenstra et al. (1982) as well as M. Pohst (1987). The solution point of Integer Least Squares generated by the LLL algorithm is = (L')−1[L'◯] ∈ ℤ m where L is the lower triangular Gram-Schmidt matrix rounded to nearest integers, [L], and = [L'◯] are the nearest integers of L'◯, ◯ being the real valued approximation of z ∈ ℤ m , the m-dimensional lattice space Λ. Indeed due to “almost orthogonality” of the integer Gram-Schmidt procedure, the solution point is only suboptimal, only close to “least squares.” ? 2000 John Wiley & Sons, Inc.  相似文献   

11.
Summary A datum change between two geodetic systems with points in common may be derived in three stages; slight adjustments of coordinates to make the networks of common points geometrically similar in the two systems; a scale factor to make them geometrically congruent; finally, an orthogonal transformation to swing them into coincidence. The geometrical concept is developed of a “datum screw”, not arbitrarily chosen as is the “origin” or “datum point” of a geodetic survey, but intrinsic to the geometry. The conditions under which it degenerates to a simple “datum shift” are discussed. Differential and other formulae for changes of spheroid and of datum are given, together with a set of tables of coefficients.  相似文献   

12.
This paper is to construct a “digital local, regional, region“ information framework based on the technology of “SIG“ and its significance and application to the regional sustainable development evaluation system. First, the concept of the “grid computing“ and “SIG“ is interpreted and discussed, then the relationship between the “grid computing“ and “digital region“ is analyzed, and the framework of the “digital region“ is put forward. Finally, the significance and application of “grid computing“ to the “region sustainable development evaluation system“ are discussed.  相似文献   

13.
顾及像点观测方程的系数矩阵中存在随机误差,提出了基于总体最小二乘的线阵卫星遥感影像光束法平差模型。在假定像点观测误差和系数矩阵误差均为独立、等精度分布的基础上,利用拉格朗日条件极值法推导了包含外方位元素虚拟观测方程和控制点误差方程的总体最小二乘光束法平差算法的具体公式和计算方法。该方法利用方差分量估计确定各类虚拟观测值的方差,可求解包含多类虚拟观测量的平差问题,并可用先验信息或岭迹法确定系数矩阵观测值的权比例系数,从而克服了现有总体最小二乘虚拟观测方法不能处理多类虚拟观测值的不足,确保了光束法平差可正确有效求解。分别利用模拟算例与两组真实影像进行了试验验证。结果表明,相比于常规最小二乘虚拟观测法以及现有总体最小二乘虚拟观测方法,本文方法具有更高的求解精度与适应性。相较于传统线阵卫星遥感影像光束法平差方法,本文方法可以获得更高的平差计算精度。  相似文献   

14.
GNSS data management and processing with the GPSTk   总被引：2，自引：0，他引：2  
We organize complex problems in simple ways using a GNSS data management strategy based on “GNSS Data Structures” (GDS), coupled with the open source “GPS Toolkit” (GPSTk) suite. The code resulting from using the GDS and their associated “processing paradigm” is remarkably compact and easy to follow, yielding better code maintainability. Furthermore, the data abstraction allows flexible handling of concepts beyond mere data encapsulation, including programmable general solvers. An existing GPSTk class can be modified to achieve the goal. We briefly describe the “GDS paradigm” and show how the different GNSS data processing “objects” may be combined in a flexible way to develop data processing strategies such as Precise Point Positioning (PPP) and network-based PPP that computes satellite clock offsets on-the-fly.  相似文献   

15.
The resolution of a nonlinear parametric adjustment model is addressed through an isomorphic geometrical setup with tensor structure and notation, represented by a u-dimensional “model surface” embedded in a flat n-dimensional “observational space”. Then observations correspond to the observational-space coordinates of the pointQ, theu initial parameters correspond to the model-surface coordinates of the “initial” pointP, and theu adjusted parameters correspond to the model-surface coordinates of the “least-squares” point . The least-squares criterion results in a minimum-distance property implying that the vector Q must be orthogonal to the model surface. The geometrical setup leads to the solution of modified normal equations, characterized by a positive-definite matrix. The latter contains second-order and, optionally, thirdorder partial derivatives of the observables with respect to the parameters. This approach significantly shortens the convergence process as compared to the standard (linearized) method.  相似文献   

16.
Pseudo-Satellite Applications in Deformation Monitoring   总被引：4，自引：1，他引：4  
In this article, three general classes of potential pseudolite applications for deformation monitoring are described. The first is GPS augmentation with pseudolite(s), which is suitable for circumstances such as urban canyons, or for monitoring in valleys and deep open-cut mines. The second is indoor applications of pseudolite deformation monitoring systems. Pseudolite arrays can, in principle, completely replace the GPS satellite constellation. This could extend the “satellite-based” deformation monitoring applications into tunnels or underground, where GPS satellite signals cannot be tracked. The last case is an inverted pseudolite-based deformation monitoring system, where a “constellation” of GPS receivers with precisely known “orbits” track a mobile pseudolite. The system consists of an array of GPS receivers, the base reference pseudolite, the mobile pseudolite, and a central processing system. However, in the case of such pseudolite-only or hybrid pseudolite-GPS deformation monitoring systems, some additional issues need to be addressed. These include multipath, atmospheric delay effects, and pseudolite location-dependent biases. To address deformation monitoring applications, some practical procedures to mitigate or eliminate their influence are suggested. Some experiments were carried out using NovAtel GPS receivers and IntegriNautics IN200CXL pseudolite instruments. The experimental results indicate that the accuracy of the height component can indeed be significantly improved – the RMS of the vertical component has been reduced by a factor of 4, to the same level as the horizontal components. Their performance will be demonstrated through case study example. ? 2002 Wiley Periodicals, Inc.  相似文献   

17.
Summary.  GFZ Potsdam and GRGS Toulouse/Grasse jointly developed a new pair of global models of the Earth's gravity field to satisfy the requirements of the recent and future geodetic and altimeter satellite missions. A precise gravity model is a prerequisite for precise satellite orbit restitution, tracking station positioning and altimeter data reduction. According to different applications envisaged, the new model exists in two parallel versions: the first one being derived exclusively from satellite tracking data acquired on 34 satellites, the second one further incorporating satellite altimeter data over the oceans and terrestrial gravity data. The most recent “satellite-only” gravity model is labelled GRIM4-S4 and the “combined” gravity model GRIM4-C4. The models are solutions in spherical harmonics and have a resolution up to degree and order 60 plus a few resonance terms in the case of GRIM4-S4, and up to degree/order 72 in the case of GRIM4-C4, corresponding to a spatial resolution of 555 km at the Earth's surface. The gravitational coefficients were estimated in a rigorous least squares adjustment simultaneously with ocean tidal terms and tracking station position parameters, so that each gravity model is associated with a consistent ocean tide model and a terrestrial reference frame built up by over 300 optical, laser and Doppler tracking stations. Comprehensive quality tests with external data and models, and test arc computations over a wide range of satellites have demonstrated the state-of-the-art capabilities of both solutions in long-wavelength geoid representation and in precise orbit computation. Received 1 February 1996; Accepted 17 July 1996  相似文献   

18.
The term “entity” covers, when used in the field of electronic data processing, the meaning of words like “thing”, “being”, “event”, or “concept”. Each entity is characterized by a set of properties. An information element is a triple consisting of an entity, a property and the value of a property. Geodetic information is sets of information elements with entities being related to geodesy. This information may be stored in the form ofdata and is called ageodetic data base provided (1) it contains or may contain all data necessary for the operations of a particular geodetic organization, (2) the data is stored in a form suited for many different applications and (3) that unnecessary duplications of data have been avoided. The first step to be taken when establishing a geodetic data base is described, namely the definition of the basic entities of the data base (such as trigonometric stations, astronomical stations, gravity stations, geodetic reference-system parameters, etc...). Presented at the “International Symposium on Optimization of Design and Computation of Control Networks”, Sopron, Hungary, July 1977.  相似文献   

19.
 Links between socio-economic units have been studied by means of various techniques. This study analyses networks that take on a permanently growing importance in evolutionary economics. The analysis is conducted in a sequential way on matrices picturing the intensities of certain relations; the technique used is linear assignment. The latter is first applied to matrices of socio-economic relations set up for the Netherlands and Portugal; the various types of “networking” present could be revealed and compared. Medical activities, taken in their socio-economic setting, rest also on various networks ; available matrices for the Netherlands are submitted to the above method of analysis. Moreover, a classical input-output matrix for the United Kingdom is used as a last test for the validity of the method. Received: 1 March 2002 / Accepted: 19 November 2002  相似文献   

20.
Summary The “true” geocentric position of any terrestrial triangulation can be reached to a certain degree of approximation only. Every claimed “geocentric” terrestrial system, therefore, must be capable of undergoing some minor shifts and minor rotations. In a two dimensional solution which provides the best combination of the two systems in question, three degrees of freedom are open and must be filled by corresponding statements or conditions. But the parameters so obtained are of relative value only. Thus, every two-dimensional solution must be followed by a three-dimensional solution in order to obtain the best external parameters and the best internal consistency. This sequential processing is legitimate because an alteration of the values of the external parameters no longer changes the inner shape of the combined network. All decisions made about the model have the character of hypotheses and must be tested statistically.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号