Sciweavers

157 search results - page 26 / 32
» moc 2000
Sort
View
MOC
2000
80views more  MOC 2000»
13 years 9 months ago
A modification of Shanks' baby-step giant-step algorithm
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...
David C. Terr
MOC
2000
96views more  MOC 2000»
13 years 9 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie
MOC
2000
85views more  MOC 2000»
13 years 9 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun
MOC
2000
124views more  MOC 2000»
13 years 9 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
MOC
2000
126views more  MOC 2000»
13 years 9 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion