Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation
HTML articles powered by AMS MathViewer

by Don R. Wilhelmsen PDF
Math. Comp. 30 (1976), 48-57 Request permission


Suppose K is a convex polyhedral cone in ${E_n}$ and is defined in terms of some generating set $\{ {e_1},{e_2}, \ldots ,{e_N}\}$. A procedure is devised so that, given any point $q \in {E_n}$, the nearest point p in K to q can be found as a positive linear sum of ${N^\ast } \leqslant n$ points from the generating set. The procedure requires at most finitely many linear steps. The algorithm is then applied to find a positive representation \[ Lf = \sum \limits _{i = 1}^{{N^\ast }} {{\lambda _i}f({x_i}),} \quad {\lambda _i} > 0,f \in \Phi ,\] for a positive linear functional L acting on a suitable finite-dimensional function space $\Phi$.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 52A25, 65D99
  • Retrieve articles in all journals with MSC: 52A25, 65D99
Additional Information
  • © Copyright 1976 American Mathematical Society
  • Journal: Math. Comp. 30 (1976), 48-57
  • MSC: Primary 52A25; Secondary 65D99
  • DOI:
  • MathSciNet review: 0394439