A backward error analysis of a null space algorithm in sparse quadratic programming

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 2, 2002, Pages 425-442

  Arioli, Mario ^a   Baldini, Lucia ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Augmented systems; Gaussian factorization; Roundoff; Sparse matrices

Indexed keywords

EID: 0036057097     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479800375977     Document Type: Article

References (28)

1. Vector stopping criteria for iterative methods: Applications to PDE's
2. The use of QR factorization in sparse quadratic programming and backward error issues
3. Iterative methods for equality-constrained least squares problems
4. Predicting fill for sparse orthogonal factorization
5. The null space problem I. Complexity
6. Accuracy and stability of the null space method for solving the equality constrained least squares problem
7. A floating point technique for extending the available precision
8. Direct methods for sparse matrices
9. Sparse matrix test problems
10. Error analysis in equality constrained quadratic optimization problems
11. What every computer scientist should know about floating-point arithmetic
12. Matrices, moments and quadrature. II. How to compute the norm of the error in iterative methods
13. Order reducing conjugate gradients versus block AOR for constrained least-squares problems
14. Further remarks on reducing truncation errors
15. Preconditioning reduced matrices