| 关于TLS问题的可解性 |
| |
| 引用本文： | 刘新国. 关于TLS问题的可解性[J]. 计算数学, 1992, 14(2): 140-146 |
| |
| 作者姓名： | 刘新国 |
| |
| 作者单位： | 中国科学院计算中心 |
| |
| 摘 要： | §1.引言如无特殊说明,本文沿用[4]中的记号和术语.Golub和Van Loan于1980年引入了下述完全最小二乘问题(简称TLS问题):
|
| 关 键 词： | TLS问题 可解性 |
ON THE SOLVABILITY OF TLS PROBLEM |
| |
| Affiliation: | Liu Xin-guo Computing Center,Academia Sinica |
| |
| Abstract: | The total least square (TLS for short) technique is an important method instatistics, nonlinear programming and numerical fittings. In, by using SVD, Goluband Van Loan obtained sufficient conditions for the solvability of the TLS problem.In this paper, the solvability of the TLS problem is discussed completely. Necessaryand sufficient conditions for the solvability are established. Also, a residual expressionis given. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
|
点击此处可从《计算数学》下载全文 |
|
