Jim E. Jones
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jim E. Jones has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
Robert D. Falgout
Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA
4 shared publicationsJohn W. Ruge
University of Colorado at Boulder
2 shared publicationsPanayot S. Vassilevski
UC Lawrence Livermore National Laboratory
2 shared publicationsPeter N. Brown
2 shared publicationsR. D. Falgout
2 shared publicationsRobert Falgout
UC Lawrence Livermore National Laboratory
2 shared publications
Latest Publications
- 1 June 2016
- Published by IOP Publishing in Modelling and Simulation in Materials Science and Engineering
- Vol. 24 (5) , 055016
Large-scale three-dimensional phase-field simulations for phase coarsening at ultrahigh volume fraction on high-performance architectures
A parallel algorithm for large-scale three-dimensional phase-field simulations of phase coarsening is developed and implemented on high-performance architectures. From the large-scale simulations, a new kinetics in phase coarsening in the region of ultrahigh volume fraction is found. The parallel implementation is capable of harnessing the greater computer power available from high-performance architectures. The parallelized code enables increase in three-dimensional simulation system size up to a 5123 grid cube. Through the parallelized code, practical runtime can be achieved for three-dimensional large-scale simulations, and the statistical significance of the results from these high resolution parallel simulations are greatly improved over those obtainable from serial simulations. A detailed performance analysis on speed-up and scalability is presented, showing good scalability which improves with increasing problem size. In addition, a model for prediction of runtime is developed, which shows a good agreement with actual run time from numerical tests.
- 1 June 2016
- Published by IOP Publishing in Modelling and Simulation in Materials Science and Engineering
- Vol. 24 (5) , 055016
Large-scale three-dimensional phase-field simulations for phase coarsening at ultrahigh volume fraction on high-performance architectures
A parallel algorithm for large-scale three-dimensional phase-field simulations of phase coarsening is developed and implemented on high-performance architectures. From the large-scale simulations, a new kinetics in phase coarsening in the region of ultrahigh volume fraction is found. The parallel implementation is capable of harnessing the greater computer power available from high-performance architectures. The parallelized code enables increase in three-dimensional simulation system size up to a 5123 grid cube. Through the parallelized code, practical runtime can be achieved for three-dimensional large-scale simulations, and the statistical significance of the results from these high resolution parallel simulations are greatly improved over those obtainable from serial simulations. A detailed performance analysis on speed-up and scalability is presented, showing good scalability which improves with increasing problem size. In addition, a model for prediction of runtime is developed, which shows a good agreement with actual run time from numerical tests.
- 4 March 2006
- Published by Springer Nature
- p. 267-294
The Design and Implementation of hypre, a Library of Parallel High Performance Preconditioners
- 4 March 2006
- Published by Springer Nature
- p. 267-294
The Design and Implementation of hypre, a Library of Parallel High Performance Preconditioners
- 1 January 2006
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 27 (5) , 1689-1708
A Multigrid Method for Variable Coefficient Maxwell's Equations
This paper presents a multigrid method for solving variable coefficient Maxwell's equations. The noveltyin this method is the use of interpolation operators that do not produce multilevel commutativity complexes that lead to multilevel exactness. Rather, the effects of multilevel exactness are built into the level equations themselves---on the finest level using a discrete $T-V$ formulation and on the coarser grids through the Galerkin coarsening procedure of a $T-V$ formulation. These built-in structures permit the levelwise use of an effective hybrid smoother on the curl-free near-nullspace components and permit the development of interpolation operators for handling the curl-free and divergence-free error components separately. The resulting block-diagonal interpolation operator does not satisfy multilevel commutativity but has good approximation properties for both of these error components. Applying operator-dependent interpolation for each of these error components leads to an effective multigrid scheme for variable coefficient Maxwell's equations, where multilevel commutativity-based methods can degrade. Numerical results are presented to verify the effectiveness of this new scheme.- 1 January 2006
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 27 (5) , 1689-1708
A Multigrid Method for Variable Coefficient Maxwell's Equations
This paper presents a multigrid method for solving variable coefficient Maxwell's equations. The noveltyin this method is the use of interpolation operators that do not produce multilevel commutativity complexes that lead to multilevel exactness. Rather, the effects of multilevel exactness are built into the level equations themselves---on the finest level using a discrete $T-V$ formulation and on the coarser grids through the Galerkin coarsening procedure of a $T-V$ formulation. These built-in structures permit the levelwise use of an effective hybrid smoother on the curl-free near-nullspace components and permit the development of interpolation operators for handling the curl-free and divergence-free error components separately. The resulting block-diagonal interpolation operator does not satisfy multilevel commutativity but has good approximation properties for both of these error components. Applying operator-dependent interpolation for each of these error components leads to an effective multigrid scheme for variable coefficient Maxwell's equations, where multilevel commutativity-based methods can degrade. Numerical results are presented to verify the effectiveness of this new scheme.- 1 January 2006
- Published by Elsevier in Future Generation Computer Systems
- Vol. 22 (1-2) , 239-251
Conceptual interfaces in hypre
- 1 January 2006
- Published by Elsevier in Future Generation Computer Systems
- Vol. 22 (1-2) , 239-251
Conceptual interfaces in hypre
- Open Access
- 1 September 2005
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 31 (3) , 326-350
Pursuing scalability for hypre 's conceptual interfaces
The software library hypre provides high-performance preconditioners and solvers for the solution of large, sparse linear systems on massively parallel computers as well as conceptual interfaces that allow users to access the library in the way they naturally think about their problems. These interfaces include a stencil-based structured interface (Struct); a semistructured interface (semiStruct), which is appropriate for applications that are mostly structured, for example, block structured grids, composite grids in structured adaptive mesh refinement applications, and overset grids; and a finite element interface (FEI) for unstructured problems, as well as a conventional linear-algebraic interface (IJ). It is extremely important to provide an efficient, scalable implementation of these interfaces in order to support the scalable solvers of the library, especially when using tens of thousands of processors. This article describes the data structures, parallel implementation, and resulting performance of the IJ, Struct and semiStruct interfaces. It investigates their scalability, presents successes as well as pitfalls of some of the approaches and suggests ways of dealing with them.
- 1 September 2005
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 31 (3) , 326-350
Open AccessPursuing scalability for hypre 's conceptual interfaces
The software library hypre provides high-performance preconditioners and solvers for the solution of large, sparse linear systems on massively parallel computers as well as conceptual interfaces that allow users to access the library in the way they naturally think about their problems. These interfaces include a stencil-based structured interface (Struct); a semistructured interface (semiStruct), which is appropriate for applications that are mostly structured, for example, block structured grids, composite grids in structured adaptive mesh refinement applications, and overset grids; and a finite element interface (FEI) for unstructured problems, as well as a conventional linear-algebraic interface (IJ). It is extremely important to provide an efficient, scalable implementation of these interfaces in order to support the scalable solvers of the library, especially when using tens of thousands of processors. This article describes the data structures, parallel implementation, and resulting performance of the IJ, Struct and semiStruct interfaces. It investigates their scalability, presents successes as well as pitfalls of some of the approaches and suggests ways of dealing with them.
- 1 January 2003
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 25 (1) , 1-26
Spectral AMGe ($\rho$AMGe)
We introduce spectral element-based algebraic multigrid ($\rho$AMGe), a new algebraic multigrid method for solving systems of algebraic equations that arise in Ritz-type finite element discretizations of partial differential equations. The method requires access to the element stiffness matrices, which enables accurate approximation of algebraically "smooth" vectors (i.e., error components that relaxation cannot effectively eliminate). Most other algebraic multigrid methods are based in some manner on predefined concepts of smoothness. Coarse-grid selection and prolongation, for example, are often defined assuming that smooth errors vary slowly in the direction of "strong" connections (relatively large coefficients in the operator matrix). One aim of $\rho$AMGe is to broaden the range of problems to which the method can be successfully applied by avoiding any implicit premise about the nature of the smooth error. $\rho$AMGe uses the spectral decomposition of small collections of element stiffness matrices to determine local representations of algebraically smooth error components. This provides a foundation for generating the coarse level and for defining effective interpolation. This paper presents a theoretical foundation for $\rho$AMGe along with numerical experiments demonstrating its robustness.
- 1 January 2003
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 25 (1) , 1-26
Spectral AMGe ($\rho$AMGe)
We introduce spectral element-based algebraic multigrid ($\rho$AMGe), a new algebraic multigrid method for solving systems of algebraic equations that arise in Ritz-type finite element discretizations of partial differential equations. The method requires access to the element stiffness matrices, which enables accurate approximation of algebraically "smooth" vectors (i.e., error components that relaxation cannot effectively eliminate). Most other algebraic multigrid methods are based in some manner on predefined concepts of smoothness. Coarse-grid selection and prolongation, for example, are often defined assuming that smooth errors vary slowly in the direction of "strong" connections (relatively large coefficients in the operator matrix). One aim of $\rho$AMGe is to broaden the range of problems to which the method can be successfully applied by avoiding any implicit premise about the nature of the smooth error. $\rho$AMGe uses the spectral decomposition of small collections of element stiffness matrices to determine local representations of algebraically smooth error components. This provides a foundation for generating the coarse level and for defining effective interpolation. This paper presents a theoretical foundation for $\rho$AMGe along with numerical experiments demonstrating its robustness.
- 1 July 2001
- Published by Elsevier in Advances in Water Resources
- Vol. 24 (7) , 763-774
Newton–Krylov-multigrid solvers for large-scale, highly heterogeneous, variably saturated flow problems
- 1 July 2001
- Published by Elsevier in Advances in Water Resources
- Vol. 24 (7) , 763-774
Newton–Krylov-multigrid solvers for large-scale, highly heterogeneous, variably saturated flow problems
- 1 January 2001
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 22 (5) , 1570-1592
Algebraic Multigrid Based on Element Interpolation (AMGe)
We introduce AMGe, an algebraic multigrid method for solving the discrete equations that arise in Ritz-type finite element methods for partial differential equations. Assuming access to the element stiffness matrices, we have that AMGe is based on the use of two local measures, which are derived from global measures that appear in existing multigrid theory. These new measures are used to determine local representations of algebraically "smooth" error components that provide the basis for constructing effective interpolation and, hence, the coarsening process for AMG. Here, we focus on the interpolation process; choice of the coarse "grids" based on these measures is the subject of current research. We develop a theoretical foundation for AMGe and present numerical results that demonstrate the efficacy of the method.
- 1 January 2001
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 22 (5) , 1570-1592
Algebraic Multigrid Based on Element Interpolation (AMGe)
We introduce AMGe, an algebraic multigrid method for solving the discrete equations that arise in Ritz-type finite element methods for partial differential equations. Assuming access to the element stiffness matrices, we have that AMGe is based on the use of two local measures, which are derived from global measures that appear in existing multigrid theory. These new measures are used to determine local representations of algebraically "smooth" error components that provide the basis for constructing effective interpolation and, hence, the coarsening process for AMG. Here, we focus on the interpolation process; choice of the coarse "grids" based on these measures is the subject of current research. We develop a theoretical foundation for AMGe and present numerical results that demonstrate the efficacy of the method.
- 1 January 2001
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 23 (1) , 109-133
AMGE Based on Element Agglomeration
This paper contains the main ideas for an AMGe (algebraic multigrid for finite elements) method based on element agglomeration. In the method, coarse grid elements are formed by agglomerating fine grid elements. Compatible interpolation operators are constructed which yield coarse grid basis functions with a minimal energy property. Heuristics based on interpolation quality measures are used to guide the agglomeration procedure. The performance of the resulting method is demonstrated in two-level numerical experiments.
- 1 January 2001
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 23 (1) , 109-133
AMGE Based on Element Agglomeration
This paper contains the main ideas for an AMGe (algebraic multigrid for finite elements) method based on element agglomeration. In the method, coarse grid elements are formed by agglomerating fine grid elements. Compatible interpolation operators are constructed which yield coarse grid basis functions with a minimal energy property. Heuristics based on interpolation quality measures are used to guide the agglomeration procedure. The performance of the resulting method is demonstrated in two-level numerical experiments.