LEAST SQUARES METHODS:
Theory, Algorithms and Applications
Linköping University
January 9-10, 1995

Final Program

All 45 minute talks are in lecture hall C4. During the parallel sessions all talks in the left column are in C4, and those in the right column are in lecture hall C3 (in the entrance hall of building C, just by the Cray X-MP).

Monday, January 9.

08:50-09:00

Welcome address by the president of Linköping University,
professor Sven Erlander.

09:00-09:45

Gene H. Golub, Stanford University:
Method of Moments and Statistical Computations.

09:45-10:15

Coffee

10:15-11:00

Iain S. Duff, Rutherford Lab. and CERFACS:
The Use of Augmented Systems in the Solution of Linear Least Squares Problems

11:05-11:35

• N.J. Higham, Manchester Univ.
  Recent Results on the Accuracy and Stability of Linear Least Squares Solvers.
• J. L. Barlow, Penn State Univ.
  An Algorithm and a Stability Theory for Downdating the ULV Decomposition

11:35-12:05

• Ji-guang Sun, Umeå Univ.
  On the Variation of the Spectrum of a Normal Matrix
• O. Vaarman, Tallinn
  On Solving Nonlinear Equations in Least Squares Sense

12:05-13:15

Lunch

13:15-14:00

G.W. Stewart, University of Maryland:
Graded matrices, Schur Complements, and Projections

14:05-14:35

• A. Forsgren, KTH
  On Linear Least Squares Problems with Diagonally Dominant Weight Matrices
• J.M. Jimenez, CERFACS, Toulouse
  A Projection Method for the Solution of Linear Least Squares Problems

14:35-15:05

• J.K. Reid, Rutherford Lab.
  Infinite weights in the Powell-Reid Method for Linear Least Squares Problems
• M. Arioli, Univ. Pavia
  Least Squares Methods in a Fuzzy Context

15:05-15:30

Coffee

15:30-16:15

H. Park, University of Minnesota, and S. Van Huffel, University of Leuven:
Total least norm formulation and solution for structured problems in signal processing

16:20-16:50

• Z. Strakos, Acad. Sci. Praha
  The GMRES Method is Backward Stable
• W. Gander, ETH, Zürich
  Fitting of Circles and Ellipses, Least Squares Solution

16:50-17:20

• E. Elmroth , Umeå Univ.
  The Set of 2-3 Matrix Pencils - Kronecker Structures and their Transitions under Perturbations and Versal Deformations of Matrix Pencils
• B.L.R. De Moor, Univ. Leuven
  Weighted and Structured Total Least Squares and Riemannian SVDs

19:00

Conference dinner at Frimurarhotellet

Tuesday, January 10.

09:00-09:45

C. C. Paige, McGill University: Krylov Subspaces and Iteration Polynomials

09:45-10:15

Coffee

10:15-11:00

Jim Varah, University of British Columbia:
Data Fitting by Implicit Functions

11:05-11:35

• L. Kaufman, Bell Labs, Murray Hill
  Image Reconstruction through Regularization by Envelope Guided Conjugate Gradients
• P-Å Wedin, Umeå Univ.
  Methods for Almost Rank Deficient Nonlinear Least Squares Problems

11:35-12:05

• M. Hanke, Univ. Karlsruhe
  Regularization by Conjugate Gradients
• S. Van Huffel, Univ. Leuven
  Accurate Quantification of Near Infrared Spectroscopy Data in Newborn Infants

12:05-13:00

Lunch

13:00-13:45

Charles Van Loan, Cornell University:
Matrices With Kronecker Product Blocks

13:50-14:20

• H. Schwetlick, Univ. Dresden
  A Feasible Point Trust Region Method for Equality Constrained Nonlinear Least-Squares Problems
• C.G. Broyden, Univ. Bologna
  The Application of the Biconjugate Residual Algorithm to Least Squares Problems

14:20-14:50

• T. Steihaug , Univ. Bergen
  An Inexact Gauss-Newton Approach to mildly Non-Linear Problems
• S. Gratton CERFACS, Toulouse
  Least Squares Problems in Aero-space industry

14:50-15:15

Coffee

15:15-16:00

M. Saunders, Stanford University:
Sparse Least Squares with Regularization

16:05-16:35

• M. Neumann, Univ. Connecticut
  Bounds on the Subdominant Eigenvalue involving Group Inverses and Applications
• B. Waldén, Linköping Univ.
  Optimal Backward Perturbation Bounds for the Linear Least Squares Problem

16:35-16:40

Closing remarks