Properties of a class of preconditioners for weighted least squares problems

dc.contributor.authorBaryamureeba, Venansius
dc.contributor.authorSteihaug, Trond
dc.contributor.authorZhan, Yin
dc.date.accessioned2022-07-12T11:53:18Z
dc.date.available2022-07-12T11:53:18Z
dc.date.issued1999
dc.description.abstractA sequence of weighted linear least squares problems arises from interior-point methods for linear programming where the changes from one problem to the next are the weights and the right hand side One approach for solving such a weighted linear least squares problem is to apply a preconditioned conjugate gradient method to the normal equations where the preconditioner is based on a low rank correction to the Cholesky factorization of a previous coefficient matrix In this paper, we establish theoretical results for such preconditioners that provide guidelines for the construction of preconditioners of this kind We also present preliminary numerical experiments to validate our theoretical results and to demonstrate the effectiveness of this approachen_US
dc.identifier.citationBaryamureeba, V., Steihaug, T., & Zhang, Y. (1999). Properties of a class of preconditioners for weighted least squares problems.en_US
dc.identifier.urihttps://nru.uncst.go.ug/handle/123456789/4205
dc.language.isoenen_US
dc.publisherUniversity of Bergen_US
dc.subjectWeighted linear least squaresen_US
dc.subjectPreconditioneren_US
dc.subjectPreconditioned conjugate gradient methoden_US
dc.subjectLinear programmingen_US
dc.subjectInterior-point algorithmsen_US
dc.titleProperties of a class of preconditioners for weighted least squares problemsen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Properties of a class of preconditioners.pdf
Size:
280.07 KB
Format:
Adobe Portable Document Format
Description:
Technical Report
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: