%N llsquacc %F $MIR/src/subs/lsqu1.for
%D Accumulate info for the "large" linear least square routines.
%P rjs
%: least-squares, fitting
%B
        subroutine LlsquAcc(f,A,x,B,m,n)

        implicit none
        integer n,m
        real B(n,n),x(n),A(n,m),f(m)

  This accumulates info for the "large" least squares routines. The routine
  is called with a number of equations, that we eventually want to solve,
  in a least squares sense. LlsquAcc accumulates the necessary info about
  these equations, and then routines. LlsquAcc will generally be called
  many times, so that effectively more and more equations are given to
  contrain the solution. For more information on general usage, see the
  preamble comments to LlsquIni.

  The system of equations for which we are looking for a least square solution is:
       f = Ax

  Input:
    f          The left hand side
    A          The coefficients of the unknowns.
    n          Number of unknowns.
    m          Number of equations. This will typically be 1, but several
               eqautions can be given on one call.
  Input/Output:
    B          The statistics used to solve the problem.
    c          Eventually this will contain the solution.
