A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
This paper contains error estimates for covolume discretizations of Maxwell’s equations in three space dimensions. Several estimates are proved. First, an estimate for a semi-dis...
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...