WEKO3
アイテム
Orthomin(k) Method for Linear Least Squares Problem
https://ipsj.ixsq.nii.ac.jp/records/59699
https://ipsj.ixsq.nii.ac.jp/records/59699037b1454-846d-429a-9688-18fd15ae5cec
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP1402001.pdf (513.9 kB)
|
Copyright (c) 1991 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1991-07-31 | |||||||
| タイトル | ||||||||
| タイトル | Orthomin(k) Method for Linear Least Squares Problem | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Orthomin(k) Method for Linear Least Squares Problem | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Doctoral Program in Engineering University of Tsukuba/Now at Inst. of Computational Fluid Dynamics | ||||||||
| 著者所属 | ||||||||
| Institute of Information Sciences University of Tsukuba Tsukuba-shi/Now at Department of Information Science University of Tokyo | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Doctoral Program in Engineering, University of Tsukuba/Now at Inst. of Computational Fluid Dynamics | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Institute of Information Sciences, University of Tsukuba, Tsukuba-shi/Now at Department of Information Science, University of Tokyo | ||||||||
| 著者名 |
ZhangShaoLiang
Yoshio, Oyanagi
× ZhangShaoLiang Yoshio, Oyanagi
|
|||||||
| 著者名(英) |
Zhang, ShaoLiang
Yoshio, Oyanagi
× Zhang, ShaoLiang Yoshio, Oyanagi
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A class of iterative algorithms for solving large-scale linear least squares problems is proposed. The algorithms are based on the conjugate residual direction and are well suited to linear least squares problems where the coefficient matrix is large and sparse. The linear convergence and the error bounds of the process are proved and the convergence condition is analyzed. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A class of iterative algorithms for solving large-scale linear least squares problems is proposed. The algorithms are based on the conjugate residual direction, and are well suited to linear least squares problems where the coefficient matrix is large and sparse. The linear convergence and the error bounds of the process are proved, and the convergence condition is analyzed. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 14, 号 2, p. 121-125, 発行日 1991-07-31 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
