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...
Abstract. We determine all exceptional units among the elements of certain groups of units in quartic number fields. These groups arise from a oneparameter family of polynomials w...
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...
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. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
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 ...
Abstract. We consider a class of nonconforming finite element approximations of a simply laminated microstructure which minimizes the nonconvex variational problem for the deforma...
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...
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
Rong-Qing Jia, Sherman D. Riemenschneider, Ding-Xu...
Abstract. We present formulations of the Trotter-Kato theorem for approximation of linear C0-semigroups which provide very useful framework when convergence of numerical approximat...