Orthomin(k) Method for Linear Least Squares Problem
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 一般社団法人情報処理学会の論文
- 1991-07-31
著者
-
Liang Zhang
Inst. Of Computational Fluid Dynamics
-
Oyanagi Yoshio
Department Of Information Science University Of Tokyo
関連論文
- Numerical Approach to One-Loop Integrals : Particles and Fields
- Orthomin(k) Method for Linear Least Squares Problem
- Veneziano Amplitudes for First Excited Scalars
- A Kind of Bivariate Cubic Splines and Related Linear Operators on Type-1 Triangulation
- F_π/F_K Ratio and πK Scattering Amplitude of the Veneziano Type
- Veneziano-Type Formula for Pion Electromagnetic Form Factor
- Possible 27-plets in Baryon Resonances
- Weinberg Sum Rules with Veneziano Residues
- Future Trend of Parallel Computing in Computational Sciences