Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
نویسندگان
چکیده
منابع مشابه
LARGE SCALE GEODETIC LEAST SQUARES ADJUSTMENT BY DISSECTION AND ORTHOGONAL DECOMPOSITION Gene
Very large seal@ matrix problems currently arise in the context of accurately computing the coordinates of points on the surface of the earth. Here g.eodesists adjust the approximate values of these coordinates by computing least squares solutions to large sparse systems of equations which result from relating the coordinates to certain observations such as distances or angles between points. T...
متن کاملSpectrophotometric simultaneous determination of nickel, cobalt and copper by orthogonal signal correction–partial least squares
A method for the simultaneous spectrophotometric determination of nickel, cobalt and copper based on theformation of their complexes with 2-(2-Thiazolylazo)-p-Cresol (TAC) in micellar media of Triton X-100 isproposed. The absorbance spectra were recorded in the range of 500 to 800 nm. The linear concentrationrange for nickel, cobalt and copper in solution calibration sets were 0.05–1.80, 0.10–6...
متن کاملGeocoding Sar-interferograms by Least Squares Adjustment
Several geocoding methods for SAR interferometry are compared. The discussion results in the proposal of a new geocoding model. It is based on a least squares adjustment combining interferometric phase, range, Doppler centroid frequency, flight path and control point data. A complete mathematical framework for the computation of object space coordinates without approximations is presented. This...
متن کاملModel reduction of large-scale systems by least squares
In this paper we introduce an approximation method for model reduction of large-scale dynamical systems. This is a projection which combines aspects of the SVD and Krylov based reduction methods. This projection can be efficiently computed using tools from numerical analysis, namely the rational Krylov method for the Krylov side of the projection and a lowrank Smith type iteration to solve a Ly...
متن کاملLeast-Squares Covariance Matrix Adjustment
We consider the problem of finding the smallest adjustment to a given symmetric n × n matrix, as measured by the Euclidean or Frobenius norm, so that it satisfies some given linear equalities and inequalities, and in addition is positive semidefinite. This least-squares covariance adjustment problem is a convex optimization problem, and can be efficiently solved using standard methods when the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1980
ISSN: 0024-3795
DOI: 10.1016/0024-3795(80)90156-1