Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition

From MaRDI portal
Publication:1156451

DOI10.1016/0024-3795(80)90156-1zbMath0468.65012OpenAlexW1981152249MaRDI QIDQ1156451

Robert J. Plemmons, Gene H. Golub

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90156-1



Related Items

Linear algebra on high performance computers, Logarithmic barriers for sparse matrix cones, Sparse linear problems and the least squares method, A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming, Least squares modifications with inverse factorizations: Parallel implications, Linear optimization over homogeneous matrix cones, Solution of sparse linear least squares problems using Givens rotations, Modified gradient method in the nonlinear least-square estimation, Systolic givens factorization of dense rectangular matrices, Differentiation of matrix functionals using triangular factorization, Computation of Huber's \(M\)-estimates for a block-angular regression problem, Smoothing noisy data with spline functions, Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing, 8 Vector fitting, A note on the computation of the generalized cross-validation function for ill-conditioned least squares problems, Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model, Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons, Convergence of block iterative methods applied to sparse least-squares problems, An algorithm to compute a sparse basis of the null space, Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\), Convergence of a direct-iterative method for large-scale least-squares problems, A pipelined Givens method for computing the QR factorization of a sparse matrix


Uses Software


Cites Work