The solution set of the mixed LS-TLS problem

被引：13

作者：

Yan, SJ ^{[1
]}

Fan, JY

机构：

[1] Nanjing Normal Univ, Sch Math & Comp Sci, Nanjing 210097, Peoples R China

[2] Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2001年 / 77卷 / 04期

关键词：

mixed LS-TLS problem; solvability; minimum Frobenius norm solution; solution set;

D O I：

10.1080/00207160108805084

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Although the least squares (LS) problem and the total least squares (TLS) problem have received much attention, the mixed LS-TLS problem still remains to be investigated. In this paper, we study the necessary and sufficient solvability conditions for the mixed LS-TLS problem in Frobenius norm. The solution set, the minimum Frobenius norm solution and an algorithm to obtain the solution are also given. Further we propose the mixed LS-TLS problem in spectral norm and present the solvability condition.

引用

页码：545 / 561

页数：17

共 8 条

[1] BENISRAEL A, 1974, GEN INVERSES THEORY
[2] Golub G. H., 2013, Matrix Computations
[3] AN ANALYSIS OF THE TOTAL LEAST-SQUARES PROBLEM
GOLUB, GH
VANLOAN, CF
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1980, 17 (06) : 883 - 893
[4] Van Huffel S., 1991, The Total Least Squares Problem: Computational Aspects and Analysis
[5] ALGEBRAIC RELATIONS BETWEEN THE TOTAL LEAST-SQUARES AND LEAST-SQUARES PROBLEMS WITH MORE THAN ONE SOLUTION
WEI, MS
[J]. NUMERISCHE MATHEMATIK, 1992, 62 (01) : 123 - 148
[6] The original TLS solution sets of the multidimensional TLS problem
Yan, SJ
Huang, KB
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2000, 73 (03) : 349 - 359
[7] YAN SJ, 1997, CHINESE J NUMER MATH, V19, P58
[8] YAN SJ, 1998, NUMER MATH J CHINESE, V7, P121

← 1 →