Abstract
Techniques will be presented for the design of one-dimensional gravity nets by means of given variance-covariance matrices. After a critical review of the methods for the solution of the matrix equation (ĀTP̄Ā)−1 = Q̄X, we shall compare different numerical results in order to judge the quality of the designs carried out by means of anSVD criterion matrix, by a criterion matrix created according to an assumed distance-dependence of the mean errors of the grid points, and by means of an iteratively improved criterion matrix respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. I. Hedberg, Two approximation problems in function spaces, Ark. Mat. 16 (1978}), 51–81.
L. I. Hedberg, Approximation in LP by analytic and harmonic functions, Proc. Symp. Pure Math. (1978 Summer Institute on Harmonic Analysis in Euc1idiean Spaces and Related Topics), Amer. Math. Soc., Providence, R.I., 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sárhidai, A. Design of fundamental gravity networks based on the approximation of the given variance-covariance matrix. Bull. Geodesique 60, 355–376 (1986). https://doi.org/10.1007/BF02522343
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02522343