MS-Tu-E-26
Recent Advances in the Solution of Least Squares Problems 1
Date: August 11
Time: 16:00--18:00
Room: 110
(Note: Click title to show the abstract.)
Organizer:
Hayami, Ken (National Inst. of Informatics)
Abstract: Least squares problems appear in many important applications in science and engineering. Recently, there have been many developments in the solution of least squares problems of various kinds. Examples are fast and robust solvers for large scale least squares problems combining Krylov subspace methods with efficient preconditioners such as stationary inner iterations or balanced incomplete factorization. There are also advances in other kinds of least squares problems, such as nonnegative constrained least squares problems, nonlinear least squares problems, total least squares problems and integer least squares problems etc. This mini-symposium will address on recent advances in such areas.
MS-Tu-E-26-1
16:00--16:30
Application of inner-iteration preconditioning to general least squares problems
Morikuni, Keiichi (Univ. of Tsukuba)
Hayami, Ken (National Inst. of Informatics)
MS-Tu-E-26-2
16:30--17:00
Preconditioners for Least Squares Problems
Mas, Jose (Universitat Politecnica de Valencia)
Marin, Jose (Universitat Politecnica de Valencia)
Hayami, Ken (National Inst. of Informatics)
MS-Tu-E-26-3
17:00--17:30
Jacobian-Free Three-Level Trust Region Method
for Nonlinear Least Squares Problems
Xu, Wei (Tongji Univ.)
Hayami, Ken (National Inst. of Informatics)
Zheng, Ning (The Graduate Univ. for Advanced Studies)
MS-Tu-E-26-4
17:30--18:00
Block Gram-Schmidt Algorithms
Barlow, Jesse (The Pennsylvania State Univ.)
Footnote: Code: Type-Date-Time-Room No. Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00 Room No.: TBA |