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

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

Gene H. Golub, Robert J. Plemmons

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

zbMATH Keywords

overdetermined system; numerical stability; normal equations; nested dissection; block-orthogonal decomposition; computing the coordinates of points on the surface of the earth; large-scale matrix problems; least- squares adjustment problems; least-squares solutions; natural factor formulation

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

15A23: Factorization of matrices

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65K05: Numerical mathematical programming methods

86A30: Geodesy, mapping problems

65F25: Orthogonalization in numerical linear algebra

Related Items

Smoothing noisy data with spline functions, 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, An algorithm to compute a sparse basis of the null space, Computation of Huber's \(M\)-estimates for a block-angular regression problem, Convergence of block iterative methods applied to sparse least-squares problems, 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, Linear algebra on high performance computers, Sparse linear problems and the least squares method, Least squares modifications with inverse factorizations: Parallel implications, Solution of sparse linear least squares problems using Givens rotations, Modified gradient method in the nonlinear least-square estimation, Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons, Systolic givens factorization of dense rectangular matrices, A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On accurate stress calculation in static and dynamic problems using the natural factor approach
• Solution of sparse linear least squares problems using Givens rotations
• A direct method for the solution of sparse linear least squares problems
• The natural factor formulation of the stiffness for the matrix displacement method
• Numerical methods for solving linear least squares problems
• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
• Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
• Incomplete Nested Dissection for Solving n by n Grid Problems
• Methods for Modifying Matrix Factorizations
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• The least squares problem and pseudo-inverses
• Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
• Nested Dissection of a Regular Finite Element Mesh