Least Squares Computations by Givens Transformations Without Square Roots
From MaRDI portal
Publication:4778229
DOI10.1093/imamat/12.3.329zbMath0289.65020OpenAlexW2036050714MaRDI QIDQ4778229
Publication date: 1973
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/12.3.329
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
Factorized Variable Metric Methods for Unconstrained Optimization, Résolution systolique de systèmes linéaires denses, A real algorithm for the Hermitian eigenvalue decomposition, Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization, Systolic array implementation of the square-root Chandrasekhar filter, Bidiagonalization and diagonalization, On-line structure detection and parameter estimation with exponential windowing for nonlinear systems, A survey of the advances in the exploitation of the sparsity in the solution of large problems, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, A modification to the LINPACK downdating algorithm, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Stability analysis of a general Toeplitz system solver, A SYSTOLIC ARCHITECTURE FOR CAPON'S DIRECTIONS-OF-ARRIVAL (DOA) ESTIMATION METHOD, Self-scaling fast rotations for stiff and equality-constrained linear least squares problems, Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure, Globally optimal univariate spline approximations, Square-root RTS smoothing algorithms, Computational methods of linear algebra, Methods for Modifying Matrix Factorizations, Solution of sparse linear least squares problems using Givens rotations, Parallel algorithms for solving linear equations using givens transformations, Alternating sequential-parallel calculation of eigenvalues for symmetric matrices, Updating conjugate directions by the BFGS formula, A fast implementation for GMRES method, Accuracy of preconditioned CG-type methods for least squares problems., Fast givens rotations for orthogonal similarity transformations, A fast algorithm for clusterwise linear regression, Comparison of two pivotal strategies in sparse plane rotations, A systolic architecture for iterative LQ optimization, The influence of orthogonality on the Arnoldi method, Estimation in mixed models via layer triangular transformation, Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization, Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression, Computationally efficient generation of Gaussian conditional simulations over regular sample grids, Pivot selection and row ordering in Givens reduction on sparse matrices, Error analysis of QR decompositions by Givens transformations, Least squares computations based on the cholesky decomposition of the correlation matrix, The economical storage of plane rotations, Product-form Cholesky factorization in interior point methods for second-order cone programming, Measurement updating using the U-D factorization, Computational aspects of kalman filtering with a diffuse prior distribution*, A self-scaling G-transformation for weighted least squares problems, An algorithm for least-squares fitting of cubic spline surfaces to functions on a rectilinear mesh over a rectangle, Linear systems with a large number of sparse constraints with applications to incompressible materials, Fast qz decomposition and its applications, A numerically expedient scheme for elastic-plastic calculations in incremental finite element analysis, Performing armchair roundoff analyses of statistical algorithms, Fast Givens transformtions applied to the homogeneous optimization method, On the natural factor in nonlinear analysis, INITIALIZATION OF THE KALMAN FILTER WITH PARTIALLY DIFFUSE INITIAL CONDITIONS, On a modification of the QZ algorithm with fast Givens rotations, Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model, An algorithm for fitting data over a circle using tensor product splines, An algorithm for linear least squares problems with equality and nonnegativity constraints, Extended model set, global data and threshold model identification of severely non-linear systems, Orthogonal least squares methods and their application to non-linear system identification, Fast Toeplitz orthogonalization, Smoothing for signals with discontinuities using higher order Mumford-Shah models, A comparison of algorithms for forming the QR decomposition for use in regression, Newton's method for linear inequality systems, Algorithms for smoothing data on the sphere with tensor product splines, An algorithm for experimental data deconvolution using spline functions, Modifications and implementation of the ellipsoid algorithm for linear programming, Procedures for optimization problems with a mixture of bounds and general linear constraints, Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems, Systolic Array Synthesis using SFG Representations, A parallel architecture for Kalman filter measurement update and parameter estimation
