Now showing items 61-64 of 64
Parallel scalability study of three dimensional additive Schwarz preconditioners in non-overlapping domain decomposition
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2007), TR-07-03
In this paper we study the parallel scalability of variants of additive Schwarz preconditioners for three dimensional non-overlapping domain decomposition methods. To alleviate the computational cost, both in terms of ...
Pipeline Implementation of Cellular Automata for Structural Design on Message-Passing Multiprocessors
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2003), TR-03-28
The inherent structure of cellular automata is trivially parallelizable and can directly benefit from massively parallel machines in computationally intensive problems. This paper presents both synchronous and pipeline ...
A Probability-one Homotopy Algoithm for Non-Smooth Equations and Mixed Complementarity Problems
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2000), TR-00-05
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations,where the norm of the residual has non-global local minima.The ...
Pointwise Bias Error Bounds for Response Surface Approximations and Min-Max Bias Design
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2004), TR-04-03
Two approaches addressing response surface approximation errors due to model inadequacy (bias error) are presented, and a design of experiments minimizing the maximal bias error is proposed. Both approaches assume that the ...