Condition numbers for a linear function of the solution of the linear least squares problem with equality constraints

被引:12
作者
Diao, Huai-An [1 ]
机构
[1] Northeast Normal Univ, Sch Math & Stat, 5268 Renmin St, Changchun 130024, Peoples R China
关键词
Linear least squares problem with equality constraints; Linear least squares; Componentwise perturbation; Condition number; Hager-Higham algorithm; PERTURBATION-THEORY; COMPONENTWISE; STABILITY; MATRIX; NORM;
D O I
10.1016/j.cam.2018.05.050
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we consider the normwise, mixed and componentwise condition numbers for a linear function Lx of the solution x to the linear least squares problem with equality constraints (LSE). The explicit expressions of the normwise, mixed and componentwise condition numbers are derived. Also, we revisit some previous results on the condition numbers of linear least squares problem (LS) and LSE. It is shown that some previous explicit condition number expressions on LS and LSE can be recovered from our new derived condition numbers' formulas. The sharp upper bounds for the derived normwise, mixed and componentwise condition numbers are obtained, which can be estimated efficiently by means of the classical Hager Higham algorithm for estimating matrix one norm. Moreover, the proposed condition estimation methods can be incorporated into the generalized QR factorization method for solving LSE. The numerical examples show that when the coefficient matrices of LSE are sparse and badly-scaled, the mixed and componentwise condition numbers can give sharp perturbation bounds, on the other hand normwise condition numbers can severely overestimate the exact relative errors because normwise condition numbers ignore the data sparsity and scaling. However, from the numerical experiments for random LSE problems, if the data is not either sparse or badly scaled, it is more suitable to adopt the normwise condition number to measure the conditioning of LSE since the explicit formula of the normwise condition number is more compact. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:640 / 656
页数:17
相关论文
共 32 条
[1]   GENERALIZED QR FACTORIZATION AND ITS APPLICATIONS [J].
ANDERSON, E ;
BAI, Z ;
DONGARRA, J .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1992, 162 :243-271
[2]  
[Anonymous], 2013, Matrix Computations
[3]  
[Anonymous], 2017, INTRO APPL LINEAR AL
[4]   A partial condition number for linear least squares problems [J].
Arioli, Mario ;
Baboulin, Marc ;
Gratton, Serge .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2007, 29 (02) :413-433
[5]   A CONTRIBUTION TO THE CONDITIONING OF THE TOTAL LEAST-SQUARES PROBLEM [J].
Baboulin, Marc ;
Gratton, Serge .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2011, 32 (03) :685-699
[6]   Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution [J].
Baboulin, Marc ;
Gratton, Serge .
BIT NUMERICAL MATHEMATICS, 2009, 49 (01) :3-19
[7]   ITERATIVE METHODS FOR EQUALITY-CONSTRAINED LEAST-SQUARES PROBLEMS [J].
BARLOW, JL ;
NICHOLS, NK ;
PLEMMONS, RJ .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (05) :892-906
[8]  
Bjorck A, 1996, NUMERICAL METHODS LE
[9]  
Burgisser P., 2013, Condition: The Geometry of Numerical Algorithms
[10]   Accuracy and stability of the null space method for solving the equality constrained least squares problem [J].
Cox, AJ ;
Higham, NJ .
BIT NUMERICAL MATHEMATICS, 1999, 39 (01) :34-50