Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

G. Alistair Watson

dblp:45/5746 · also G. A. Watson, George Alistair Watson · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 1973
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical linear algebra › generalized inverse
matrix inversion		 0.011973
An Algorithm for the Inversion of Block Matrices of Toeplitz Form · J. ACM 1973
Algorithms and data structures › numerical linear algebra › structured matrices
toeplitz matrix		 0.011973
An Algorithm for the Inversion of Block Matrices of Toeplitz Form · J. ACM 1973
YearPublicationVenuePosition
1973 On Estimating Best Approximations of Functions Defined by Integral Equations
abstract
A method for estimating best Chebyshev approximations to functions defined by integral equations, based on the use of quadrature to obtain an error estimate, is described. Numerical results are presented.
G. Alistair Watson
 Comput. J.1
1973 An Algorithm for the Inversion of Block Matrices of Toeplitz Form
abstract
An algorithm of W. F. Trench is generalized to apply to the inversion of block matrices of Toeplitz form.
G. Alistair Watson
 J. ACM1
1971 On an Algorithm for Discrete Nonlinear L1 Approximation
abstract
An algorithm for discrete nonlinear L1 approximation is shown to converge under conditions often assumed in practice. The application of the algorithm is illustrated by some examples.
Michael R. Osborne, G. Alistair Watson
 Comput. J.2
1969 An Algorithm for Minimax Approximation in the Nonlinear Case
abstract
An algorithm for nonlinear minimax approximation is described, and shown to be convergent under conditions which are often assumed in practice. The algorithm is illustrated by the calculation of several approximations to the solution of the Blasius equation.
Michael R. Osborne, G. Alistair Watson
 Comput. J.2
1968 Note on Two Methods of Solving Ordinary Linear Differential Equations
abstract
Two assumptions are formulated, based on recent results concerning two methods of approximating to the solutions of ordinary linear differential equations. They are shown to be false by means of counter examples.
Michael R. Osborne, G. Alistair Watson
 Comput. J.2
1967 On the Best Linear Chebyshev Approximation
abstract
The principal part of this paper is devoted to reworking the equivalence of the Stiefel exchange algorithm for Chebyshev approximation with the simplex algorithm applied to the dual of the linear programming formulation of the same problem. Our main concern has been the provision of algorithms free from the major restrictions of classical approximation theory, and it appears that these restrictions can be relaxed almost entirely.
Michael R. Osborne, G. Alistair Watson
 Comput. J.2