G. Alistair Watson

According to our database1, G. Alistair Watson authored at least 28 papers between 1967 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
The history and development of numerical analysis in Scotland: a personal perspective.
Proceedings of the Birth of Numerical Analysis, 2009

2007
Robust counterparts of errors-in-variables problems.
Comput. Stat. Data Anal., 2007

2006
Fitting enclosing cylinders to data in <i>R</i><sup><i>n</i></sup>.
Numer. Algorithms, 2006

An algorithm for matching point sets using the <i>l</i><sub>1</sub> norm.
Numer. Algorithms, 2006

2004
Robust Solutions to a General Class of Approximation Problems.
SIAM J. Sci. Comput., 2004

The ℓ<sub>1</sub> oblique procrustes problem.
Stat. Comput., 2004

2001
Data Fitting Problems with Bounded Uncertainties in the Data.
SIAM J. Matrix Anal. Appl., 2001

1999
Fitting Data with Errors in All Variables Using the Huber M-estimator.
SIAM J. Sci. Comput., 1999

On solutions of a class of best simultaneous approximation problems.
Int. J. Comput. Math., 1999

1998
On Computing the Least Quantile of Squares Estimate.
SIAM J. Sci. Comput., 1998

An Algorithm for Computing the Distance to Instability.
SIAM J. Matrix Anal. Appl., 1998

1994
Linear best approximation using a class of<i>k</i>-major<i>l</i><sub><i>p</i></sub> norms.
Numer. Algorithms, 1994

The solution of orthogonal Procrustes problems for a family of orthogonally invariant norms.
Adv. Comput. Math., 1994

1993
On matrix approximation problems with Ky Fan<i>k</i> norms.
Numer. Algorithms, 1993

1992
Computing the Structured Singular Value.
SIAM J. Matrix Anal. Appl., 1992

Algorithms for Minimum Trace Factor Analysis.
SIAM J. Matrix Anal. Appl., 1992

Linear best approximation using a class of polyhedral norms.
Numer. Algorithms, 1992

1985
A projected lagrangian algorithm for semi-infinite programming.
Math. Program., 1985

1981
Computational experience with an algorithm for discrete L<sub>1</sub> approximation.
Computing, 1981

1980
First and second order conditions for a class of nondifferentiable optimization problems.
Math. Program., 1980

1977
On two methods for discrete<i>L</i><sub><i>p</i></sub> approximation.
Computing, 1977

1973
An Algorithm for the Inversion of Block Matrices of Toeplitz Form.
J. ACM, 1973

On Estimating Best Approximations of Functions Defined by Integral Equations.
Comput. J., 1973

1971
On an Algorithm for Discrete Nonlinear L<sub>1</sub> Approximation.
Comput. J., 1971

1970
On an algorithm for nonlinear minimax approximation.
Commun. ACM, 1970

1969
An Algorithm for Minimax Approximation in the Nonlinear Case.
Comput. J., 1969

1968
Note on Two Methods of Solving Ordinary Linear Differential Equations.
Comput. J., 1968

1967
On the Best Linear Chebyshev Approximation.
Comput. J., 1967


  Loading...