Between Dec 19, 2024 and Jan 2, 2025, datasets can be submitted to DRUM but will not be processed until after the break. Staff will not be available to answer email during this period, and will not be able to provide DOIs until after Jan 2. If you are in need of a DOI during this period, consider Dryad or OpenICPSR. Submission responses to the UDC may also be delayed during this time.

Browsing by Author "Tamma, Kumar"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning
    (2005-01-18) Liang, Yu; Kanapady, Ramdev; Tamma, Kumar
    An efficient parallel finite element-based domain decomposition iterative technique with polynomial preconditioning with particular attention to the GMRES solver is presented. Unlike the standard row-oriented partitioning of a matrix, finite element based domain decomposition with polynomial preconditioning circumvents the assembly of matrix, reordering of matrix, redundant computations associated with the interface elements, numerical problems associated with local preconditioner, and costly global preconditioner construction. A dramatic reduction in parallel overhead both in terms of computation and communication results in a highly scalable solver. The parallel performance results for large-scale static and dynamic problems on the IBM SP2 and the SGI Origin are presented.
  • Thumbnail Image
    Item
    Augmented FETI-DP Method Based on Polynomial Preconditioning
    (2005-01-20) Liang, Yu; Kanapady, Ramdev; Tamma, Kumar
    To foster the absolute scalability (A-scalability) in solving large-scale non-linear dynamic structural problem on large-processor-count high-performance computing (HPC) systems, this paper examines a scalable implementation of an augmented finite element tearing and interconnecting of dual-primal version (AFETI-DP) method based on generalized lieast-squares polynomial preconditioning. Compared to previous work, the AFETI-DP concerned is featured by utilizing finite element based iterative method to solve the coarse problem and a well load-balance general purpose (applicable to 2D and 3D problems) virtual corner selection strategy to obtain optimal computational performance. From the point of view of scalability, the corresponding experimental results for IBM-SP2 and Cray-X1 are presented and critically assessed.