Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Center for Advanced Computing
  4. Cornell Theory Center Technical Reports
  5. Accurate Solution of Weighted Least Squares by Iterative Methods

Accurate Solution of Weighted Least Squares by Iterative Methods

File(s)
97-268.pdf (409.4 KB)
97-268.ps (341.85 KB)
Permanent Link(s)
https://hdl.handle.net/1813/5598
Collections
Cornell Theory Center Technical Reports
Author
Bobrovnikova, Elena Y.
Vavasis, Stephen A.
Abstract

We consider the weighted least-squares (WLS) problem with a very ill-conditioned weight matrix. Weighted least-squares problems arise in many applications including linear programming, electrical networks, boundary value problems, and structures. Because of roundoff errors, standard iterative methods for solving a WLS problem with ill-conditioned weights may not give the correct answer. Indeed, the difference between the true and computed solution (forward error) may be large. We propose an iterative algorithm, called MINRES-L, for solving WLS problems. The MINRES-L method is the application of MINRES, a Krylov-space method due to Paige and Saunders, to a certain layered linear system. Using a simplified model of the effects of round off error, we prove that MINRES-L gives answers with small forward error. We present computational experiments for some applications.

Date Issued
1997-02-06
Publisher
Cornell University
Keywords
theory center
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/97-268
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance