Sciweavers

157 search results - page 17 / 32
» moc 2000
Sort
View
MOC
1998
111views more  MOC 1998»
13 years 10 months ago
The approximation power of moving least-squares
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...
David Levin
MOC
1998
83views more  MOC 1998»
13 years 10 months ago
A sweep-plane algorithm for generating random tuples in simple polytopes
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 ...
Josef Leydold, Wolfgang Hörmann
MOC
1998
86views more  MOC 1998»
13 years 10 months ago
Convergence analysis of a covolume scheme for Maxwell's equations in three dimensions
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...
R. A. Nicolaides, D.-Q. Wang
MOC
1998
144views more  MOC 1998»
13 years 10 months ago
Convergence of a random walk method for a partial differential equation
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...
Weidong Lu
MOC
1998
107views more  MOC 1998»
13 years 10 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
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...
Suely Oliveira