A Method of Solution for a Large-sized Least-squares Problem with a Block-diagonal Jacobian
An efficient method of solution is presented for solving a large-sized least-squares problem with a blockdiagonal Jacobian. The method is based on the QR decomposition accompanied with a technique called sequential accumulation and is able to solve a problem with thousands of unknowns on a personal computer. As a numerical example, the least-squares problem that appears in the numerical analysis of diffraction by a layered dielectric grating is solved. Comparison with a conventional QR method in storage requirement and in computation time shows the effectiveness of the present method.
M.Ohtsu Y.Okuno T.Matsuda
Kumamoto University,Japan Kumamoto National College of Technology,Japan
国际会议
Progress in Electromagnetics Research Symposium 2005(2005年电磁学研究新进展学术研讨会)(PIERS 2005)
杭州
英文
606-610
2005-08-22（万方平台首次上网日期，不代表论文的发表时间）