The least squares problem and pseudo-inverses
From MaRDI portal
Publication:5591854
DOI10.1093/comjnl/13.3.309zbMath0195.44804OpenAlexW2104183282MaRDI QIDQ5591854
No author found.
Publication date: 1970
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/13.3.309
Related Items
Strong rank revealing LU factorizations, Unnamed Item, A note on two block-SOR methods for sparse least squares problems, Three matrix factorizations from the steps of elimination, Strict Chebyshev approximation for general systems of linear equations, On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians, On the computation of weighted Moore-Penrose inverse using a high-order matrix method, Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks, Note on a splitting approach to ill-conditioned least squares problems, Sparse linear problems and the least squares method, Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems, Numerical aspects of the generalized CG-method applied to least squares problems, Class of optimization algorithms for the solution of large nonlinear programming problems. I, Piece wise linear least–squares approximation of planar curves, The \(l^ p\)-solution of the nonlinear matrix equation XY=A, Gram-Schmidt orthogonalization: 100 years and more, A note on the SOR and CG methods for large least squares problems, The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems, Test procedures and test problems for least squares algorithms, Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge, Computations for constrained linear models, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Computational methods of linear algebra, On rank-deficient pseudoinverses, Methods for Modifying Matrix Factorizations, Solution of sparse linear least squares problems using Givens rotations, Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition, A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations, A direct method for the solution of sparse linear least squares problems, Perturbation theory for pseudo-inverses, A variable projection method for solving separable nonlinear least squares problems, Variable Schrittweitensteuerungen für die Homotopiemethode bei adäquaten nichtlinearen Ausgleichsproblemen, The solution of large-scale least-squares problems on supercomputers, The Block Successive Relaxation Additive Tterative method for least squares problems, A direct heuristic algorithm for linear programming, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Rank revealing Gaussian elimination by the maximum volume concept, The convergence of the two-block SAOR method for least-squares problems, A survey of direct methods for sparse linear systems, Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods, On rectangular systems of differential equations and their application to circuit theory, A method for calculating the reciprocal coefficients of function matrices, On the solution of the linear least squares problems and pseudo-inverses, Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, On QR factorization updatings, An efficient LDU algorithm for the minimal least squares solution of linear systems, Efficient Numerical Simulation and Optimization of Fluid-Structure Interaction, On the \(ijk\) forms of the truncated LU decomposition, Minimum energy problem for discrete linear admissible control systems, Maintaining LU factors of a general sparse matrix, Generalized inverses of matrices: a perspective of the work of Penrose, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation., Successive pole shifting by state controllers of prescribed structure, Tensor methods for large sparse systems of nonlinear equations, Chebyshev approximation algorithm for linear inequalities and its applications to pattern classification, A local convergence analysis for the Gauss-Newton and Levenberg-Morrison- Marquardt algorithms, Algorithms for smoothing data on the sphere with tensor product splines, On the existence and computation of rank-revealing LU factorizations, An algorithm for the solution of ill-posed linear systems arising from the discretization of Fredholm integral equation of the first kind, Symbiosis between linear algebra and optimization, General scheme for solving linear algebraic problems by direct methods, Numerical computations for univariate linear models, Numerics of Gram-Schmidt orthogonalization, Concise row-pruning algorithm to invert a matrix, Rank and null space calculations using matrix decomposition without column interchanges
