5 research outputs found
Preconditioned iterative methods for solving linear least squares problems
New preconditioning strategies for solving m × n overdetermined large and sparse
linear least squares problems using the conjugate gradient for least squares (CGLS) method are
described. First, direct preconditioning of the normal equations by the balanced incomplete factorization (BIF) for symmetric and positive definite matrices is studied, and a new breakdown-free
strategy is proposed. Preconditioning based on the incomplete LU factors of an n × n submatrix of
the system matrix is our second approach. A new way to find this submatrix based on a specific
weighted transversal problem is proposed. Numerical experiments demonstrate different algebraic
and implementational features of the new approaches and put them into the context of current
progress in preconditioning of CGLS. It is shown, in particular, that the robustness demonstrated
earlier by the BIF preconditioning strategy transfers into the linear least squares solvers and the use
of the weighted transversal helps to improve the LU-based approach.This work was partially supported by Spanish grant MTM 2010-18674 and the project 13-06684S of the Grant agency of the Czech Republic.Bru GarcÃa, R.; MarÃn Mateos-Aparicio, J.; Mas MarÃ, J.; Tuma, M. (2014). Preconditioned iterative methods for solving linear least squares problems. SIAM Journal on Scientific Computing. 36(4):2002-2022. https://doi.org/10.1137/130931588S2002202236
Analysis of large scale linear programming problems with embedded network structures: Detection and solution algorithms
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Linear programming (LP) models that contain a (substantial) network structure frequently
arise in many real life applications. In this thesis, we investigate two main questions; i) how an embedded network structure can be detected, ii) how the network structure can be exploited to create improved sparse simplex solution algorithms. In order to extract an embedded pure network structure from a general LP problem we
develop two new heuristics. The first heuristic is an alternative multi-stage generalised upper bounds (GUB) based approach which finds as many GUB subsets as possible. In order to identify a GUB subset two different approaches are introduced; the first is based on the notion of Markowitz merit count and the second exploits an independent set in the corresponding graph. The second heuristic is based on the generalised signed graph of the coefficient matrix. This heuristic determines whether the given LP problem is an entirely pure network; this is in contrast to all previously known heuristics. Using generalised signed graphs, we prove that the problem of detecting the maximum size embedded network structure within an LP problem is NP-hard. The two detection
algorithms perform very well computationally and make positive contributions to the
known body of results for the embedded network detection. For computational solution
a decomposition based approach is presented which solves a network problem with side constraints. In this approach, the original coefficient matrix is partitioned into the network and the non-network parts. For the partitioned problem, we investigate two alternative decomposition techniques namely, Lagrangean relaxation and Benders decomposition. Active variables identified by these procedures are then used to create
an advanced basis for the original problem. The computational results of applying these techniques to a selection of Netlib models are encouraging. The development and computational investigation of this solution algorithm constitute further contribution
made by the research reported in this thesis.This study is funded by the Turkish Educational Council and Mugla University
New crash procedures for large systems of linear constraints
SIGLEAvailable from British Library Document Supply Centre- DSC:9091.9(CSS--226) / BLDSC - British Library Document Supply CentreGBUnited Kingdo