Barry Smith

Barry Smith

Auto-generated profile, based on publicly available information

Barry Smith

Argonne National Laboratory

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 December 1994 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
MDMaksymilian Dryja
Maksymilian Dryja
BSBarry F. Smith
Barry F. Smith
OWOlof B. Widlund
Olof B. Widlund
Domain decomposition methods provide powerful preconditioners for the iterative solution of the large systems of algebraic equations that arise in finite element or finite difference approximations of partial differential equations. The preconditioners are constructed from exact or approximate solvers for the same partial differential equation restricted to a set of subregions into which the given region has been divided. In addition, the preconditioner is often augmented by a coarse, second-level approximation that provides additional, global exchange of information that can enhance the rate of convergence considerably. The iterative substructuring methods, based on decompositions of the region into nonoverlapping subregions, form one of the main families of such algorithms. Many domain decomposition algorithms can conveniently be described and analyzed as Schwarz methods. These algorithms are fully defined in terms of a set of subspaces and auxiliary bilinear forms. A general theoretical framework has previously been developed. In this paper, these techniques are used in an analysis of iterative substructuring methods for elliptic problems in three dimensions. A special emphasis is placed on the difficult problem of designing good coarse models and obtaining robust methods for which the rate of convergence is insensitive to large variations in the coefficients of the differential equation. Domain decomposition algorithms can conveniently be built from modules that represent local and global components of the preconditioner. In this paper, a number of such possibilities are explored, and it is demonstrated how a great variety of fast algorithms can be designed and analyzed.

1 January 1999 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
WWW. L. Wan
W. L. Wan
TCTony F. Chan
Tony F. Chan
BSBarry Smith
Barry Smith
We propose a robust interpolation for multigrid based on the concepts of energy minimization and approximation. It can handle PDE coefficients of various types on structured or unstructured grids under one framework. The formulation is general; it can be applied to any dimension. We demonstrate numerically the effectiveness of the multigrid method in two dimensions by applying it to a discontinuous coefficient problem, an oscillatory coefficient problem, and an anisotropic problem. Empirically, the convergence rate is independent of the coefficients of the underlying PDE, in addition to being independent of the mesh size. The proposed method is primarily designed for second-order elliptic PDEs, with possible extensions to other classes of problems such as integral equations.

1 April 1996 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
TCTony F. Chan
Tony F. Chan
BSBarry F. Smith
Barry F. Smith
JZJun Zou
Jun Zou

26 May 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
JZJunchao Zhang
Junchao Zhang
JBJed Brown
Jed Brown
SBSatish Balay
Satish Balay
JFJacob Faibussowitsch
Jacob Faibussowitsch
MKMatthew Knepley
Matthew Knepley
SZStefano Zampini
Stefano Zampini
PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. In this article, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.

1 January 1992 in SIAM Journal on Scientific and Statistical Computing
Verified
Journal Article
Closed access
BSBarry F. Smith
Barry F. Smith
For linear elasticity problems the finite element method is an extremely successful method to model complicated structures. The successful implementation requires the solution of very large, sparse, positive definite linear systems of algebraic equations. A new technique for solving these systems using the preconditioned conjugate gradient method is proposed. Using ideas from both additive Schwarz methods and iterative substructuring methods, it is proven that the condition number of the resulting system does not grow as the substructures are made smaller and the mesh is refined. This result holds for two and three dimensions. Numerical experiments have been performed to demonstrate the power of this method. For linear elasticity problems in two dimensions the condition numbers are observed numerically to be less than four when using a regular mesh.