A sparse counterpart of Reichel and Gragg's package QRUP

DOI10.1016/j.cam.2007.04.051zbMath1187.65037OpenAlexW2026041537MaRDI QIDQ1044853

Ángel Santos-Palomo, Pablo Guerrero-García

Publication date: 15 December 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2007.04.051

zbMATH Keywords

\texttt{Matlab}sparse QR factorizationGivens' rotationssparse orthogonalization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (1)

QRUP

Uses Software

• Matlab
• TRON
• TOMS-686
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A direct active set algorithm for large sparse quadratic programs with simple bounds
• Active set algorithms for isotonic regression; a unifying framework
• A direct method for sparse least squares problems with lower and upper bounds
• A numerically stable form of the simplex algorithm
• On the Use of Structural Zeros in Orthogonal Factorization
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Sparse Matrices in MATLAB: Design and Implementation
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Algorithm 686: FORTRAN subroutines for updating the QR decomposition
• Newton's Method for Large Bound-Constrained Optimization Problems
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Row Modifications of a Sparse Cholesky Factorization

This page was built for publication: A sparse counterpart of Reichel and Gragg's package QRUP