Clark R. Dohrmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Clark R. Dohrmann has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
S. W. Key
Engineering and Manufacturing Mechanics Department, Sandia National Laboratories, MS 0847, Albuquerque, NM 87185‐0847, U.S.A.
5 shared publicationsM. W. Heinstein
Engineering and Manufacturing Mechanics Department, Sandia National Laboratories, MS 0847, Albuquerque, NM 87185‐0847, U.S.A.
4 shared publicationsOlof B. Widlund
Courant Institute
3 shared publications- Olof B. Widlund
Courant Institute
3 shared publications J. Jung
Engineering and Manufacturing Mechanics Department, Sandia National Laboratories, MS 0847, Albuquerque, 87185‐0847, U.S.A.
2 shared publications- Pavel Bochev
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
2 shared publications
Latest Publications
- 1 January 2022
- Published by Springer Nature
- p. 213-220
Spectral Equivalence Properties of Higher-Order Tensor Product Finite Elements
- 1 January 2022
- Published by Springer Nature
- p. 213-220
Spectral Equivalence Properties of Higher-Order Tensor Product Finite Elements
- 25 October 2020
- Published by Springer Nature
- p. 117-124
On Inexact Solvers for the Coarse Problem of BDDC
- 25 October 2020
- Published by Springer Nature
- p. 117-124
On Inexact Solvers for the Coarse Problem of BDDC
- 1 January 2018
- Published by Springer Nature
- p. 553-560
Small Coarse Spaces for Overlapping Schwarz Algorithms with Irregular Subdomains
- 1 January 2018
- Published by Springer Nature
- p. 553-560
Small Coarse Spaces for Overlapping Schwarz Algorithms with Irregular Subdomains
- Open Access
- 21 June 2017
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 87 (310) , 659-692
BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a deluxe type of weighted average and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced. Under the assumption that the subdomains are all built from elements of a coarse triangulation of the given domain, that the meshes of each subdomain are quasi uniform and that the material parameters are constant in each subdomain, a bound is obtained for the condition number of the preconditioned linear system which is independent of the values and the jumps of these parameters across the interface between the subdomains as well as the number of subdomains. Numerical experiments, using the PETSc library, are also presented which support the theory and show the effectiveness of the algorithms even for problems not covered by the theory. Included are also experiments with Brezzi-Douglas-Marini finite element approximations.
- 21 June 2017
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 87 (310) , 659-692
Open AccessBDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a deluxe type of weighted average and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced. Under the assumption that the subdomains are all built from elements of a coarse triangulation of the given domain, that the meshes of each subdomain are quasi uniform and that the material parameters are constant in each subdomain, a bound is obtained for the condition number of the preconditioned linear system which is independent of the values and the jumps of these parameters across the interface between the subdomains as well as the number of subdomains. Numerical experiments, using the PETSc library, are also presented which support the theory and show the effectiveness of the algorithms even for problems not covered by the theory. Included are also experiments with Brezzi-Douglas-Marini finite element approximations.
- 21 April 2014
- Published by Springer Nature
- p. 527-535
Lower Dimensional Coarse Spaces for Domain Decomposition
- 21 April 2014
- Published by Springer Nature
- p. 527-535
Lower Dimensional Coarse Spaces for Domain Decomposition
- 9 May 2013
- Published by Springer Nature
- p. 15-25
Some Recent Tools and a BDDC Algorithm for 3D Problems in H(curl)
- 9 May 2013
- Published by Springer Nature
- p. 15-25
Some Recent Tools and a BDDC Algorithm for 3D Problems in H(curl)
- 15 October 2009
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 82 (2) , 157-183
Hybrid domain decomposition algorithms for compressible and almost incompressible elasticity
Overlapping Schwarz methods are considered for mixed finite element approximations of linear elasticity, with discontinuous pressure spaces, as well as for compressible elasticity approximated by standard conforming finite elements. The coarse components of the preconditioners are based on spaces, with a number of degrees of freedom per subdomain which are uniformly bounded, which are similar to those previously developed for scalar elliptic problems and domain decomposition methods of iterative substructuring type, i.e. methods based on nonoverlapping decompositions of the domain. The local components of the new preconditioners are based on solvers on a set of overlapping subdomains.In the current study, the dimension of the coarse spaces is smaller than in recently developed algorithms; in the compressible case all independent face degrees of freedom have been eliminated while in the almost incompressible case five out of six are not needed. In many cases, this will result in a reduction of the dimension of the coarse space by about one half compared with that of the algorithm previously considered. In addition, in spite of using overlapping subdomains to define the local components of the preconditioner, values of the residual and the approximate solution need only to be retained on the interface between the subdomains in the iteration of the new hybrid Schwarz algorithm. The use of discontinuous pressures makes it possible to work exclusively with symmetric, positive‐definite problems and the standard preconditioned conjugate gradient method.Bounds are established for the condition number of the preconditioned operators. The bound for the almost incompressible case grows in proportion to the square of the logarithm of the number of degrees of freedom of individual subdomains and the third power of the relative overlap between the overlapping subdomains, and it is independent of the Poisson ratio as well as jumps in the Lamé parameters across the interface between the subdomains. Numerical results illustrate the findings. Copyright © 2009 John Wiley & Sons, Ltd.
- 15 October 2009
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 82 (2) , 157-183
Hybrid domain decomposition algorithms for compressible and almost incompressible elasticity
Overlapping Schwarz methods are considered for mixed finite element approximations of linear elasticity, with discontinuous pressure spaces, as well as for compressible elasticity approximated by standard conforming finite elements. The coarse components of the preconditioners are based on spaces, with a number of degrees of freedom per subdomain which are uniformly bounded, which are similar to those previously developed for scalar elliptic problems and domain decomposition methods of iterative substructuring type, i.e. methods based on nonoverlapping decompositions of the domain. The local components of the new preconditioners are based on solvers on a set of overlapping subdomains.In the current study, the dimension of the coarse spaces is smaller than in recently developed algorithms; in the compressible case all independent face degrees of freedom have been eliminated while in the almost incompressible case five out of six are not needed. In many cases, this will result in a reduction of the dimension of the coarse space by about one half compared with that of the algorithm previously considered. In addition, in spite of using overlapping subdomains to define the local components of the preconditioner, values of the residual and the approximate solution need only to be retained on the interface between the subdomains in the iteration of the new hybrid Schwarz algorithm. The use of discontinuous pressures makes it possible to work exclusively with symmetric, positive‐definite problems and the standard preconditioned conjugate gradient method.Bounds are established for the condition number of the preconditioned operators. The bound for the almost incompressible case grows in proportion to the square of the logarithm of the number of degrees of freedom of individual subdomains and the third power of the relative overlap between the overlapping subdomains, and it is independent of the Poisson ratio as well as jumps in the Lamé parameters across the interface between the subdomains. Numerical results illustrate the findings. Copyright © 2009 John Wiley & Sons, Ltd.
- 25 September 2008
- Published by Springer Nature in Computing
- Vol. 83 (2-3) , 55-85
Multispace and multilevel BDDC
- 25 September 2008
- Published by Springer Nature in Computing
- Vol. 83 (2-3) , 55-85
Multispace and multilevel BDDC
- 9 January 2007
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 14 (2) , 149-168
An approximate BDDC preconditioner
The balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each substructure and one linear system for a global coarse problem. The computations and memory needed for these solutions can be prohibitive if any one system is too large. We investigate an approach for addressing this issue based on approximating the direct solutions using preconditioners. In order to retain the attractive numerical properties of the exact version of BDDC, some of the preconditioners must possess a property related to the substructure null spaces. We describe a simple method to equip preconditioners with this property. Numerical results demonstrate the usefulness of the approach and confirm the theory. Published in 2006 by John Wiley & Sons, Ltd.
- 9 January 2007
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 14 (2) , 149-168
An approximate BDDC preconditioner
The balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each substructure and one linear system for a global coarse problem. The computations and memory needed for these solutions can be prohibitive if any one system is too large. We investigate an approach for addressing this issue based on approximating the direct solutions using preconditioners. In order to retain the attractive numerical properties of the exact version of BDDC, some of the preconditioners must possess a property related to the substructure null spaces. We describe a simple method to equip preconditioners with this property. Numerical results demonstrate the usefulness of the approach and confirm the theory. Published in 2006 by John Wiley & Sons, Ltd.
- 11 February 2006
- Published by Springer Nature in Computational Mechanics
- Vol. 38 (4-5) , 323-333
A Computational Study of Stabilized, Low-order C 0 Finite Element Approximations of Darcy Equations
- 11 February 2006
- Published by Springer Nature in Computational Mechanics
- Vol. 38 (4-5) , 323-333
A Computational Study of Stabilized, Low-order C 0 Finite Element Approximations of Darcy Equations