\begin{thebibliography}{100}

\bibitem{ANSI85}
American National Standards Institute.
\newblock {\em {IEEE} Standard for Binary Floating-Point Arithmetic}, 1985.

\bibitem{PPC94}
Apple Computer, Inc., Reading, MA.
\newblock {\em Inside Macintosh: PowerPC Numerics}, 1994.

\bibitem{Ascher91}
Marcia Ascher.
\newblock {\em Ethnomathematics}.
\newblock Chapman and Hall, New York, NY, 1991.

\bibitem{benbow99}
S.~J. Benbow.
\newblock Solving generalized least-squares problems with lsqr.
\newblock {\em SIMAX}, 21:165--177, 1999.

\bibitem{Calamai80}
P.H. Calamai and A.R. Conn.
\newblock A stable algorithm for solving the multifacility location problem
  involving euclidean distances.
\newblock {\em SIAM Journal on Scientific and Statistical Computing},
  1:512--526, 1980.

\bibitem{cggs}
S.~Chandrasekaran, G.~H. Golub, M.~Gu, and A.~H. Sayed.
\newblock Parameter estimation in the presence of bounded data uncertainties.
\newblock {\em SIMAX}, 19(1):235--252, 1998.

\bibitem{cgs99}
S.~Chandrasekaran, G.~H. Golub, M.~Gu, and A.~H. Sayed.
\newblock An efficient algorithm for a bounded errors-in-variables model.
\newblock {\em SIMAX}, 20(4):839--859, 1999.

\bibitem{Keith01}
S.~Chandrasekaran, M.~Gu, A.~H. Sayed, and K.~E. Schubert.
\newblock The degenerate bounded errors-in-variables model.
\newblock {\em SIMAX}, 23(1):138--166, 2001.

\bibitem{cline73}
A.~K. Cline.
\newblock An elimination method for the solution of linear least squares
  problems.
\newblock {\em SINUM}, 10:283--289, 1973.

\bibitem{Cordellier78}
F.~Cordellier and J.Ch. Giorot.
\newblock On the fermat-weber problem with convex cost functionals.
\newblock {\em Mathematical Programming}, 14:295--311, 1978.

\bibitem{cox81}
M.~G. Cox.
\newblock The least squares solution of overdetermined linear equations having
  gand or augmented band structure.
\newblock {\em IMA J. Numer. Anal.}, 1:3--22, 1981.

\bibitem{Cull80}
J.~Cullum.
\newblock Ill-posed deconvolutions: Regularization and singular value
  decompositions.
\newblock In {\em Proceedings 19th IEEE Conference on Decision and Control},
  volume~1, pages 29--35, 1980.

\bibitem{cyb84}
G.~Cybenko.
\newblock The numerical stability of the lattice algorithm for least squares
  linear prediction problems.
\newblock {\em BIT}, 24:441--455, 1984.

\bibitem{Scott-Kakures93}
H.~Benson W.~Taschek D.~Scott-Kakures, S.~Castagnetto and P.~Hurley.
\newblock {\em History of Philosophy}.
\newblock HarperCollins, New York, NY, 1993.

\bibitem{duff74}
I.~S. Duff.
\newblock Pivot selection and row ordering in givens reduction on sparse
  matrices.
\newblock {\em Computing}, 13:239--248, 1974.

\bibitem{Eckhardt75}
U.~Eckhardt.
\newblock On an optimization problem related to minimal surfaces with
  obstacles.
\newblock In R.~Bulirsch, W.~Oettli, and J.~Stoer, editors, {\em Optimization
  and optimal control}. Springer-Verlag, 1975.

\bibitem{Eckhardt80}
U.~Eckhardt.
\newblock Weber's problem and weiszfeld's algorithm in general spaces.
\newblock {\em Mathematical Programming}, 18:186--196, 1980.

\bibitem{ER74}
M.~P. Ekstrom and R.~L. Rhoads.
\newblock On the application of eigenvector expansions to numerical
  deconvolutions.
\newblock {\em J. of Comp. Phys.}, 14:395--417, 1974.

\bibitem{eld77}
L.~Eld\`en.
\newblock Algorithms for the regularization of ill-conditioned least squares
  problems.
\newblock {\em BIT}, 17:134--145, 1977.

\bibitem{eld80}
L.~Eld\`en.
\newblock Perturbation theory for the least squares problem with linear
  equality constraints.
\newblock {\em SINUM}, 17:338--350, 1980.

\bibitem{eld83}
L.~Eld\`en.
\newblock A weighted pseudoinverse, generalize singular values, and constrained
  least squares problems.
\newblock {\em BIT}, 22:487--502, 1983.

\bibitem{eld84}
L.~Eld\`en.
\newblock An algorithm for the regularization of ill-conditioned, banded least
  squares problems.
\newblock {\em SISSC}, 5:237--254, 1984.

\bibitem{eld85}
L.~Eld\`en.
\newblock A note on the computation of the generalized cross-validation
  function for ill-conditioned least squares problems.
\newblock {\em BIT}, 24:467--472, 1985.

\bibitem{EG88}
H.~W. Engl and H.~Gfrerer.
\newblock A posteriori parameter choice for general regulariztion methods for
  solving linear ill-posed problems.
\newblock {\em Appl. Numer. Math.}, 4:395--417, 1988.

\bibitem{Eyster73}
J.W. Eyster, J.A. White, and W.W. Wierwille.
\newblock On solving multifacility location problems using a hyperboloid
  approximation procedure.
\newblock {\em AIIE Transactions}, 5:1--6, 1973.

\bibitem{FGHO97}
R.~D. Fierro, G.~H. Golub, P.~C. Hansen, and D.~P. O'Leary.
\newblock Regularization by truncated total least squares.
\newblock {\em SISC}, 18:1223--1241, 1997.

\bibitem{Ford88}
W.~Ford and W.~Topp.
\newblock {\em {MC68000} Assembly Language and Systems Programming}.
\newblock D.C. Heath, Lexington, MA, 1988.

\bibitem{fg65}
G.~E. Forsythe and G.~H. Golub.
\newblock On the stationary values of a second-degree polynomial on the unit
  sphere.
\newblock {\em SIAM J. App. Math.}, 14:1050--1068, 1965.

\bibitem{Fran78}
J.~N. Franklin.
\newblock Minimum principles for ill-posed problems.
\newblock {\em SIAM J. Math. Anal.}, 9:638--650, 1978.

\bibitem{gan81}
W.~Gander.
\newblock Least squares with a quadratic constraint.
\newblock {\em Numer. Math.}, 36:291--307, 1981.

\bibitem{cfg95}
C.~F. Gauss and G.~W. Stewart.
\newblock {\em Theory of the Combination of Observations Least Subject to
  Errors}.
\newblock SIAM, Philadelphia, PA, 1995.

\bibitem{Gazale99}
Midhat Gazale.
\newblock {\em Gnomon: From Pharaohs to Fractals}.
\newblock Princeton University Press, Princeton, NJ, 1999.

\bibitem{Gazale00}
Midhat Gazale.
\newblock {\em Number: From Ahmes to Cantor}.
\newblock Princeton University Press, Princeton, NJ, 2000.

\bibitem{gehe80}
J.~A. George and M.~T. Heath.
\newblock Solution of sparse linear least squares problems using givens
  rotations.
\newblock {\em Lin. Alg. and Its Applic.}, 34:69--83, 1980.

\bibitem{Gerdes99}
Paulus Gerdes.
\newblock {\em Geometry From Africa: Mathematical and Educational
  Explorations}.
\newblock The Mathematical Association of America, Washington, DC, 1999.

\bibitem{Gfr87}
H.~Gfrerer.
\newblock An a posteriori parameter choice for ordinary and iterated tikhonov
  regularization of ill-posed problems leading to optimal convergence rates.
\newblock {\em Math. Comp.}, 49:507--522, 1987.

\bibitem{GL97}
L.~El Ghaoui. and H.~Lebret.
\newblock Robust solutions to least-squares problems with uncertain data.
\newblock {\em SIMAX}, 18(4):1035--1064, 1997.

\bibitem{GHO99}
G.~H. Golub, P.~C. Hansen, and D.~P. O'Leary.
\newblock Tikhonov regularization and total least squares.
\newblock {\em SIMAX}, 30(1):185--194, 1999.

\bibitem{ghw79}
G.~H. Golub, M.~Heath, and G.~Wahba.
\newblock Generalized cross-validation as a method for chosing a good ridge
  parameter.
\newblock {\em Technometrics}, 21:215--223, 1979.

\bibitem{govl}
G.~H. Golub and C.~F.~Van Loan.
\newblock An analysis of the total least squares problem.
\newblock {\em SIMAX}, 17:883--893, 1980.

\bibitem{gvl}
G.~H. Golub and C.~F.~Van Loan.
\newblock {\em Matrix Computations}.
\newblock The Johns Hopkins University Press, Baltimore, Md, 1996.

\bibitem{gowi66}
G.~H. Golub and J.~H. Wilkinson.
\newblock Note on iterative refinement of least squares solutions.
\newblock {\em Numerical Math.}, 9:139--148, 1966.

\bibitem{Gu98}
Ming Gu.
\newblock Backward perturbation bounds for linear least squares prolems.
\newblock {\em SIMAX}, 20:363--372, 1998.

\bibitem{HR96}
M.~Hanke and T.~Raus.
\newblock A general heuristic for choosing the regularization parameter in
  ill-posed problems.
\newblock {\em SIAM J. Sci. Comput.}, 7:956--972, 1996.

\bibitem{Han92}
P.~C. Hansen.
\newblock Analysis of discrete ill-posed problems by means of the l-curve.
\newblock {\em Siam Review}, 34:561--580, 1992.

\bibitem{Han98}
P.~C. Hansen.
\newblock {\em Rank-Deficient and Discrete Ill-Posed Problems}.
\newblock SIAM, Philadelphia, PA, 1998.

\bibitem{Haykin91}
S.~Haykin.
\newblock {\em Adaptive Filter Theory}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1991.

\bibitem{hk70}
A.~E. Hoerl and R.~W. Kennard.
\newblock Ridge regression: Biased estimation for nonorthogonal problems.
\newblock {\em Tecjmp,etrocs}, 12:55--67, 1970.

\bibitem{hv97}
P.~D. Hough and S.~A. Vavasis.
\newblock Complete orthogonal decomposition for weighted least squares.
\newblock {\em SIMAX}, 18:369--392, 1997.

\bibitem{vHv}
S.~Van Huffel and J.~Vandewalle.
\newblock {\em The Total Least Squares Problem: Computational Aspects and
  Analysis}.
\newblock SIAM, Philadelphia, PA, 1991.

\bibitem{Joseph91}
George~Gheverghese Joseph.
\newblock {\em The Crest of the Peacock: Non-European Roots of Mathematics}.
\newblock Princeton University Press, Princeton, NJ, 2000.

\bibitem{KOl98}
M.~E. Kilmer and D.~P. O'Leary.
\newblock Choosing regularization parameters in iterative methods for ill-posed
  problems.
\newblock {\em SIMAX}, 22:1204--1221, 2001.

\bibitem{kp81}
S.~Kourouklis and C.~C. Paige.
\newblock A constrained least squares approach to the general gauss-markov
  linear model.
\newblock {\em J. Amer Stat. Assoc.}, 76:620--625, 1981.

\bibitem{Kuhn73}
H.W. Kuhn.
\newblock A note on fermat's problem.
\newblock {\em Mathematical Programming}, 4:98--107, 1973.

\bibitem{Laub96}
A.J. Laub.
\newblock Computational matrix analysis.
\newblock Class notes for ECE 234 and ECE 231A.

\bibitem{lh95}
C.~L. Lawson and R.~J. Hanson.
\newblock {\em Solving Least Squares Problems}.
\newblock SIAM, Philadelphia, PA, 1995.

\bibitem{SIT91}
L.~Ljung.
\newblock {\em System Identification Toolbox User's Guide}.
\newblock The Math Works, Inc., Natick, MA, 1991.

\bibitem{Ljung96}
L.~Ljung.
\newblock System identification.
\newblock In {\em The Control Handbook}. CRC Press, 1996.

\bibitem{Ljung87}
Lenart Ljung.
\newblock {\em System Identification: Theory for the User}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1987.

\bibitem{Love69}
R.F. Love.
\newblock Locating facilities in three-dimensional space by convex programming.
\newblock {\em Naval Research Logistics Quarterly}, 16:503--516, 1969.

\bibitem{Lumpkin97}
Beatrice Lumpkin.
\newblock {\em Algebra: Activities from Many Cultures}.
\newblock J. Weston Walch, Portland, ME, 1997.

\bibitem{GenChem}
D.~A. McQuarrie and P.~A. Rock.
\newblock {\em General Chemistry}.
\newblock W. H. Freeman and Company, New York, NY, 1987.

\bibitem{Mendel95}
J.~M. Mendel.
\newblock {\em Lessons in Estimation Theory for Signal Processing,
  Communications, and Control}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1995.

\bibitem{onoffid}
M.~Moonen, B.~De Moor, L.~Vandenberghe, and J.~Vandewalle.
\newblock On- and off-line identifiation of linear state-space models.
\newblock In R.~V. Patel, A.~J. Laub, and P.~M.~Van Dooren, editors, {\em
  Numerical Linear Algebra Techniques for Systems and Control}. IEEE Press,
  1994.

\bibitem{Mor66}
V.~A. Morozov.
\newblock On the solution of functional equations by the method of
  regularization.
\newblock {\em Soviet Math. Dokl.}, 7:414--417, 1966.

\bibitem{NS98}
A.~Neubauer and O.~Scherzer.
\newblock Regularization for curve representations: Uniform convergence for
  discontinuous solutions of ill-posed problems.
\newblock {\em SIAM J. Appl. Math.}, 58:1891--1900, 1998.

\bibitem{OLeary99}
D.~P. O'Leary.
\newblock Near-optimal parameters for tikhonov and other regularization
  methods.
\newblock Technical report, CS Dept., University of Maryland, 1999.
\newblock CS-TR-4004.

\bibitem{ols81}
D.~P. O'Leary and J.~A. Simmons.
\newblock A bidiaonalization-regularization procedure for large scale
  discreizations of ill-posed problems.
\newblock {\em SISSC}, 2:474--489, 1981.

\bibitem{bjorck67}
\.A.~Bj\" orck.
\newblock Iterative refinement of linear least squares solutions i.
\newblock {\em BIT}, 7:257--278, 1967.

\bibitem{bjorck68}
\.A.~Bj\" orck.
\newblock Iterative refinement of linear least squares solutions ii.
\newblock {\em BIT}, 8:8--30, 1968.

\bibitem{bjorck84}
\.A.~Bj\" orck.
\newblock A general updating algorithm for constrained linear least squares
  problems.
\newblock {\em SISSC}, 5:394--402, 1984.

\bibitem{bjorck87}
\.A.~Bj\" orck.
\newblock Stability analysis of the method of seminormal equations for linear
  least squares problems.
\newblock {\em Linear Alg. and Its Applic.}, 88/89:31--48, 1987.

\bibitem{bjorck88}
\.A.~Bj\" orck.
\newblock {\em Least Squares Methods: Handbook of Numerical Analsis}, volume~1.
\newblock Elsiver, Holland, 1988.

\bibitem{bjorck96}
\.A.~Bj\" orck.
\newblock {\em Numerical Methods for Least Squares Problems}.
\newblock SIAM, Philadelphia, PA, 1996.

\bibitem{bjgo67}
\.A.~Bj\" orck and G.~H. Golub.
\newblock Iterative refinement of linear least squares solutions by householder
  transformation.
\newblock {\em BIT}, 7:322--337, 1967.

\bibitem{Ostrander99}
W.~J. Ostrander.
\newblock {\em Reflection Seismology}.
\newblock UCSB Bookstore Custom Publishing, Goleta, CA, 1999.

\bibitem{Overton83}
M.~L. Overton.
\newblock A quadratically convergent method for minimizing a sum of euclidean
  norms.
\newblock {\em Mathematical Programming}, 27:34--63, 1983.

\bibitem{paige79a}
C.~C. Paige.
\newblock Computer solution and perturbation analysis of generalized least
  squares problems.
\newblock {\em Math. Comp.}, 33:171--184, 1979.

\bibitem{paige79b}
C.~C. Paige.
\newblock Fast numerically stable computations for generalized linear least
  squares problems.
\newblock {\em SINUM}, 16:165--171, 1979.

\bibitem{paige85}
C.~C. Paige.
\newblock The general limit model and the generalized singular value
  decomposition.
\newblock {\em Lin. Alg. and Its Aplic.}, 70:269--284, 1985.

\bibitem{pw70}
G.~Peters and J.~H. Wilkinson.
\newblock The least squares problem and pseudo-inverses.
\newblock {\em Comp. J.}, 13:309--316, 1970.

\bibitem{PR85}
J.~E. Pierce and B.~W. Rust.
\newblock Constrained least squares interval estimation.
\newblock {\em SIAM Jour. Sci. Stat. Comput.}, 6:670--683, 1985.

\bibitem{Intro2DSP}
J.~G. Proakis and D.~G. Manolakis.
\newblock {\em Introduction to Digital Signal Processing}.
\newblock Macmillan Publishing Co., New York, NY, 1988.

\bibitem{Raus85}
T.~Raus.
\newblock The principle of the residual in the solution of ill-posed problems
  with nonselfadjoint operator.
\newblock {\em Uchen. Zap. Tartu Gos. Univ.}, 715:12--20, 1985.

\bibitem{Rudin76}
W.~Rudin.
\newblock {\em Principles of Mathematical Analysis, Third Edition}.
\newblock McGraw-Hill, New York, NY, 1976.

\bibitem{Rust98}
B.~W. Rust.
\newblock Truncating the singular value decomposition for ill-posed problems.
\newblock Technical report, National Institute of Standards and Technology,
  U.S. Dept. of Commerce, 1998.
\newblock Tech. Report NISTIR 6131.

\bibitem{sc}
A.~H. Sayed and S.~Chandrasekaran.
\newblock Estimation in the presence of multiple sources of uncertainties with
  applications.

\bibitem{Schechter70}
S.~Schechter.
\newblock Minimization of a convex function by relaxation.
\newblock In J.~Abadie, editor, {\em Integer and Nonlinear Programming}, pages
  177--190. North-Holland, 1970.

\bibitem{scst79}
K.~Schittkowski and J.~Stoer.
\newblock A factorization method for the solution of constrained linear least
  squares problems allowing for subsequent data changes.
\newblock {\em Numer. Math.}, 31:431--463, 1979.

\bibitem{Stark94}
H.~Stark and J.~W. Woods.
\newblock {\em Probability, Random Processes and Estimation Theory for
  Engineers}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1994.

\bibitem{Stewart73}
G.~W. Stewart.
\newblock {\em Introduction to Matrix Computations}.
\newblock Academic Press, New York, NY, 1973.

\bibitem{stew84}
G.~W. Stewart.
\newblock On the asymptotic behavior of scaled singular value and qr
  decompositions.
\newblock {\em Math. Comp.}, 43:483--490, 1984.

\bibitem{stew89}
G.~W. Stewart.
\newblock On scaled projections and pseudoinverses.
\newblock {\em Linear Algebra Appl.}, 112:189--193, 1989.

\bibitem{strang88}
G.~Strang.
\newblock A framework for equilibrium equations.
\newblock {\em SIREV}, 30:283--297, 1988.

\bibitem{Todd90}
M.~J. Todd.
\newblock A dantzig-wolfe-like variant of karmarkar's interior-point linear
  programming algorithm.
\newblock {\em Oper. Res.}, 38:1006--1018, 1990.

\bibitem{vav94}
S.~A. Vavasis.
\newblock Stable numerical algorithms for equilibrium systems.
\newblock {\em SIMAX}, 15:1108--1131, 1994.

\bibitem{Verhaegen97}
M.~Verhaegen.
\newblock Identification of continuous-time mimo state-space models from
  sampled data, in the presence of process and measurement noise.
\newblock In {\em Proceedings of the Workshop Mathematics for Systems}, 1997.

\bibitem{Voss80}
H.~Voss and U.~Eckhardt.
\newblock Linear convergence of generalized weiszfeld's method.
\newblock {\em Computing}, 25:243--251, 1980.

\bibitem{WKS95}
B.~Walden, R.~Karlson, and J.~Sun.
\newblock Optimal backward perturbation bounds for the linear least squares
  problem.
\newblock {\em Numerical Linear Algebra with Applications}, pages 271--286,
  1995.

\bibitem{gw01}
G.~A. Watson.
\newblock Data fitting problems with bounded uncertainties in the data.
\newblock {\em SIMAX}, 22(4):1274--1293, 2001.

\bibitem{Weiszfeld37}
E.~Weiszfeld.
\newblock Sur le point par lequel la somme des distances de n points donn�s est
  minimum.
\newblock {\em Tohoku Mathematics Journal}, 43:355--386, 1937.

\bibitem{Widrow85}
B.~Widrow and S.~D. Stearns.
\newblock {\em Adaptive Signal Processing}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1985.

\bibitem{Willsky79}
A.~S. Willsky.
\newblock {\em Digital Signal Processing and Control and Estimation Theory:
  Points of Tangency, Areas of Intersection, and Parallel Directions}.
\newblock MIT Press, Cambridge, Ma, 1979.

\bibitem{Zaslavsky73}
Claudia Zaslavsky.
\newblock {\em Africa Counts}.
\newblock Lawrence Hill Books, Brooklyn, NY, 1990.

\bibitem{Zaslavsky87}
Claudia Zaslavsky.
\newblock {\em Multicultural Mathematics}.
\newblock J. Weston Walch, Portland, ME, 1993.

\bibitem{Zaslavsky94}
Claudia Zaslavsky.
\newblock {\em Multicultural Math}.
\newblock Instructor Books, New York, NY, 1994.

\end{thebibliography}
