Catherine E. Powell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Catherine E. Powell has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Arbaz Khan
Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India
6 shared publications - David J. Silvester
Department of Mathematics University of Manchester Oxford Road M13 9PL Manchester UK
5 shared publications - Alex Bespalov
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
3 shared publications - Howard C. Elman
Univ. of Maryland, College Park, MD (United States)
2 shared publications - Adam J. Crowder
School of Mathematics, University of Manchester, Manchester, UK
1 shared publication - Adam J. Crowder
School of Mathematics University of Manchester Oxford Road M13 9PL Manchester United Kingdom
1 shared publication
Latest Publications
- 3 January 2022
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (3) , 965-994
Enhanced alternating energy minimization methods for stochastic galerkin matrix equations
- 3 January 2022
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (3) , 965-994
Enhanced alternating energy minimization methods for stochastic galerkin matrix equations
- 16 November 2020
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 90 (328) , 613-636
Robust a posteriori error estimation for parameter-dependent linear elasticity equations
The focus of this work is a posteriori error estimation for stochastic Galerkin approximations of parameter-dependent linear elasticity equations. The starting point is a three-field partial differential equation model with the Young modulus represented as an affine function of a countable set of parameters. We introduce a weak formulation, establish its stability with respect to a weighted norm and discuss its approximation using stochastic Galerkin mixed finite element methods. We motivate an a posteriori error estimation scheme and establish upper and lower bounds for the approximation error. The constants in the bounds are independent of the Poisson ratio as well as the spatial and parametric discretisation parameters. We also discuss proxies for the error reduction associated with enrichments of the approximation spaces and we develop an adaptive algorithm that terminates when the estimated error falls below a user-prescribed tolerance. The error reduction proxies are shown to be reliable and efficient in the incompressible limit case. Numerical results are presented to supplement the theory. All experiments were performed using open source (IFISS) software that is available online.
- 16 November 2020
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 90 (328) , 613-636
Robust a posteriori error estimation for parameter-dependent linear elasticity equations
The focus of this work is a posteriori error estimation for stochastic Galerkin approximations of parameter-dependent linear elasticity equations. The starting point is a three-field partial differential equation model with the Young modulus represented as an affine function of a countable set of parameters. We introduce a weak formulation, establish its stability with respect to a weighted norm and discuss its approximation using stochastic Galerkin mixed finite element methods. We motivate an a posteriori error estimation scheme and establish upper and lower bounds for the approximation error. The constants in the bounds are independent of the Poisson ratio as well as the spatial and parametric discretisation parameters. We also discuss proxies for the error reduction associated with enrichments of the approximation spaces and we develop an adaptive algorithm that terminates when the estimated error falls below a user-prescribed tolerance. The error reduction proxies are shown to be reliable and efficient in the incompressible limit case. Numerical results are presented to supplement the theory. All experiments were performed using open source (IFISS) software that is available online.
- Open Access
Parameter-robust Stochastic Galerkin mixed approximation for linear poroelasticity with uncertain inputs
Linear poroelasticity models have a number of important applications in biology and geophysics. In particular, Biot's consolidation model is a well-known model that describes the coupled interaction between the linear response of a porous elastic medium and a diffusive fluid flow within it, assuming small deformations. Although deterministic linear poroelasticity models and finite element methods for solving them numerically have been well studied, there is little work to date on robust algorithms for solving poroelasticity models with uncertain inputs and for performing uncertainty quantification (UQ). The Biot model has a number of important physical parameters and inputs whose precise values are often uncertain in real world scenarios. In this work, we introduce and analyse the well-posedness of a new five-field model with uncertain and spatially varying Young's modulus and hydraulic conductivity field. By working with a properly weighted norm, we establish that the weak solution is stable with respect to variations in key physical parameters, including the Poisson ratio. We then introduce a novel locking-free stochastic Galerkin mixed finite element method that is robust in the incompressible limit. Armed with the `right' norm, we construct a parameter-robust preconditioner for the associated discrete systems. Our new method facilitates forward UQ, allowing efficient calculation of statistical quantities of interest and is provably robust with respect to variations in the Poisson ratio, the Biot--Willis constant and the storage coefficient, as well as the discretization parameters.
Open AccessParameter-robust Stochastic Galerkin mixed approximation for linear poroelasticity with uncertain inputs
Linear poroelasticity models have a number of important applications in biology and geophysics. In particular, Biot's consolidation model is a well-known model that describes the coupled interaction between the linear response of a porous elastic medium and a diffusive fluid flow within it, assuming small deformations. Although deterministic linear poroelasticity models and finite element methods for solving them numerically have been well studied, there is little work to date on robust algorithms for solving poroelasticity models with uncertain inputs and for performing uncertainty quantification (UQ). The Biot model has a number of important physical parameters and inputs whose precise values are often uncertain in real world scenarios. In this work, we introduce and analyse the well-posedness of a new five-field model with uncertain and spatially varying Young's modulus and hydraulic conductivity field. By working with a properly weighted norm, we establish that the weak solution is stable with respect to variations in key physical parameters, including the Poisson ratio. We then introduce a novel locking-free stochastic Galerkin mixed finite element method that is robust in the incompressible limit. Armed with the `right' norm, we construct a parameter-robust preconditioner for the associated discrete systems. Our new method facilitates forward UQ, allowing efficient calculation of statistical quantities of interest and is provably robust with respect to variations in the Poisson ratio, the Biot--Willis constant and the storage coefficient, as well as the discretization parameters.
- Open Access
Robust a posteriori error estimation for stochastic Galerkin formulations of parameter-dependent linear elasticity equations
The focus of this work is a posteriori error estimation for stochastic Galerkin approximations of parameter-dependent linear elasticity equations. The starting point is a three-field PDE model in which the Young's modulus is an affine function of a countable set of parameters. We analyse the weak formulation, its stability with respect to a weighted norm and discuss approximation using stochastic Galerkin mixed finite element methods (SG-MFEMs). We introduce a novel a posteriori error estimation scheme and establish upper and lower bounds for the SG-MFEM error. The constants in the bounds are independent of the Poisson ratio as well as the SG-MFEM discretisation parameters. In addition, we discuss proxies for the error reduction associated with certain enrichments of the SG-MFEM spaces and we use these to develop an adaptive algorithm that terminates when the estimated error falls below a user-prescribed tolerance. We prove that both the a posteriori error estimate and the error reduction proxies are reliable and efficient in the incompressible limit case. Numerical results are presented to validate the theory. All experiments were performed using open source (IFISS) software that is available online.
Open AccessRobust a posteriori error estimation for stochastic Galerkin formulations of parameter-dependent linear elasticity equations
The focus of this work is a posteriori error estimation for stochastic Galerkin approximations of parameter-dependent linear elasticity equations. The starting point is a three-field PDE model in which the Young's modulus is an affine function of a countable set of parameters. We analyse the weak formulation, its stability with respect to a weighted norm and discuss approximation using stochastic Galerkin mixed finite element methods (SG-MFEMs). We introduce a novel a posteriori error estimation scheme and establish upper and lower bounds for the SG-MFEM error. The constants in the bounds are independent of the Poisson ratio as well as the SG-MFEM discretisation parameters. In addition, we discuss proxies for the error reduction associated with certain enrichments of the SG-MFEM spaces and we use these to develop an adaptive algorithm that terminates when the estimated error falls below a user-prescribed tolerance. We prove that both the a posteriori error estimate and the error reduction proxies are reliable and efficient in the incompressible limit case. Numerical results are presented to validate the theory. All experiments were performed using open source (IFISS) software that is available online.
- Open Access
Robust preconditioning for stochastic Galerkin formulations of parameter-dependent nearly incompressible linear elasticity equations
We consider the nearly incompressible linear elasticity problem with an uncertain spatially varying Young's modulus. The uncertainty is modelled with a finite set of parameters with prescribed probability distribution. We introduce a novel three-field mixed variational formulation of the PDE model and discuss its approximation by stochastic Galerkin mixed finite element techniques. First, we establish the well posedness of the proposed variational formulation and the associated finite-dimensional approximation. Second, we focus on the efficient solution of the associated large and indefinite linear system of equations. A new preconditioner is introduced for use with the minimal residual method (MINRES). Eigenvalue bounds for the preconditioned system are established and shown to be independent of the discretisation parameters and the Poisson ratio. The S-IFISS software used for computation is available online.
Open AccessRobust preconditioning for stochastic Galerkin formulations of parameter-dependent nearly incompressible linear elasticity equations
We consider the nearly incompressible linear elasticity problem with an uncertain spatially varying Young's modulus. The uncertainty is modelled with a finite set of parameters with prescribed probability distribution. We introduce a novel three-field mixed variational formulation of the PDE model and discuss its approximation by stochastic Galerkin mixed finite element techniques. First, we establish the well posedness of the proposed variational formulation and the associated finite-dimensional approximation. Second, we focus on the efficient solution of the associated large and indefinite linear system of equations. A new preconditioner is introduced for use with the minimal residual method (MINRES). Eigenvalue bounds for the preconditioned system are established and shown to be independent of the discretisation parameters and the Poisson ratio. The S-IFISS software used for computation is available online.
- Open Access
Efficient adaptive multilevel stochastic Galerkin approximation using implicit a posteriori error estimation
Partial differential equations (PDEs) with inputs that depend on infinitely many parameters pose serious theoretical and computational challenges. Sophisticated numerical algorithms that automatically determine which parameters need to be activated in the approximation space in order to estimate a quantity of interest to a prescribed error tolerance are needed. For elliptic PDEs with parameter-dependent coefficients, stochastic Galerkin finite element methods (SGFEMs) have been well studied. Under certain assumptions, it can be shown that there exists a sequence of SGFEM approximation spaces for which the energy norm of the error decays to zero at a rate that is independent of the number of input parameters. However, it is not clear how to adaptively construct these spaces in a practical and computationally efficient way. We present a new adaptive SGFEM algorithm that tackles elliptic PDEs with parameter-dependent coefficients quickly and efficiently. We consider approximation spaces with a multilevel structure---where each solution mode is associated with a finite element space on a potentially different mesh---and use an implicit a posteriori error estimation strategy to steer the adaptive enrichment of the space. At each step, the components of the error estimator are used to assess the potential benefits of a variety of enrichment strategies, including whether or not to activate more parameters. No marking or tuning parameters are required. Numerical experiments for a selection of test problems demonstrate that the new method performs optimally in that it generates a sequence of approximations for which the estimated energy error decays to zero at the same rate as the error for the underlying finite element method applied to the associated parameter-free problem.
Open AccessEfficient adaptive multilevel stochastic Galerkin approximation using implicit a posteriori error estimation
Partial differential equations (PDEs) with inputs that depend on infinitely many parameters pose serious theoretical and computational challenges. Sophisticated numerical algorithms that automatically determine which parameters need to be activated in the approximation space in order to estimate a quantity of interest to a prescribed error tolerance are needed. For elliptic PDEs with parameter-dependent coefficients, stochastic Galerkin finite element methods (SGFEMs) have been well studied. Under certain assumptions, it can be shown that there exists a sequence of SGFEM approximation spaces for which the energy norm of the error decays to zero at a rate that is independent of the number of input parameters. However, it is not clear how to adaptively construct these spaces in a practical and computationally efficient way. We present a new adaptive SGFEM algorithm that tackles elliptic PDEs with parameter-dependent coefficients quickly and efficiently. We consider approximation spaces with a multilevel structure---where each solution mode is associated with a finite element space on a potentially different mesh---and use an implicit a posteriori error estimation strategy to steer the adaptive enrichment of the space. At each step, the components of the error estimator are used to assess the potential benefits of a variety of enrichment strategies, including whether or not to activate more parameters. No marking or tuning parameters are required. Numerical experiments for a selection of test problems demonstrate that the new method performs optimally in that it generates a sequence of approximations for which the estimated energy error decays to zero at the same rate as the error for the underlying finite element method applied to the associated parameter-free problem.
- Open Access
Robust a posteriori error estimators for mixed approximation of nearly incompressible elasticity
This paper is concerned with the analysis and implementation of robust finite element approximation methods for mixed formulations of linear elasticity problems where the elastic solid is almost incompressible. Several novel a posteriori error estimators for the energy norm of the finite element error are proposed and analysed. We establish upper and lower bounds for the energy error in terms of the proposed error estimators and prove that the constants in the bounds are independent of the Lam\'{e} coefficients: thus the proposed estimators are robust in the incompressible limit. Numerical results are presented that validate the theoretical estimates. The software used to generate these results is available online.
Open AccessRobust a posteriori error estimators for mixed approximation of nearly incompressible elasticity
This paper is concerned with the analysis and implementation of robust finite element approximation methods for mixed formulations of linear elasticity problems where the elastic solid is almost incompressible. Several novel a posteriori error estimators for the energy norm of the finite element error are proposed and analysed. We establish upper and lower bounds for the energy error in terms of the proposed error estimators and prove that the constants in the bounds are independent of the Lam\'{e} coefficients: thus the proposed estimators are robust in the incompressible limit. Numerical results are presented that validate the theoretical estimates. The software used to generate these results is available online.
- Open Access
- 19 May 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 77 (2) , 1030-1054
CBS Constants & Their Role in Error Estimation for Stochastic Galerkin Finite Element Methods
- 19 May 2018
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 77 (2) , 1030-1054
Open AccessCBS Constants & Their Role in Error Estimation for Stochastic Galerkin Finite Element Methods
- Open Access
Robust error estimation for lowest-order approximation of nearly incompressible elasticity
We consider so-called Herrmann and Hydrostatic mixed formulations of classical linear elasticity and analyse the error associated with locally stabilised $P_1-P_0$ finite element approximation. First, we prove a stability estimate for the discrete problem and establish an a priori estimate for the associated energy error. Second, we consider a residual-based a posteriori error estimator as well as a local Poisson problem estimator. We establish bounds for the energy error that are independent of the Lam\'{e} coefficients and prove that the estimators are robust in the incompressible limit. A key issue to be addressed is the requirement for pressure stabilisation. Numerical results are presented that validate the theory. The software used is available online.Open AccessRobust error estimation for lowest-order approximation of nearly incompressible elasticity
We consider so-called Herrmann and Hydrostatic mixed formulations of classical linear elasticity and analyse the error associated with locally stabilised $P_1-P_0$ finite element approximation. First, we prove a stability estimate for the discrete problem and establish an a priori estimate for the associated energy error. Second, we consider a residual-based a posteriori error estimator as well as a local Poisson problem estimator. We establish bounds for the energy error that are independent of the Lam\'{e} coefficients and prove that the estimators are robust in the incompressible limit. A key issue to be addressed is the requirement for pressure stabilisation. Numerical results are presented that validate the theory. The software used is available online. - Open Access
- 20 October 2011
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 32 (3) , 1051-1070
On solving stochastic collocation systems with algebraic multigrid
Stochastic collocation methods facilitate the numerical solution of partial differential equations (PDEs) with random data and give rise to long sequences of similar linear systems. When elliptic PDEs with random diffusion coefficients are discretized with mixed finite element methods in the physical domain we obtain saddle point systems. These are trivial to solve when considered individually; the challenge lies in exploiting their similarities to recycle information and minimize the cost of solving the entire sequence. We apply stochastic collocation to a model stochastic elliptic problem and discretize in physical space using Raviart–Thomas elements. We propose an efficient solution strategy for the resulting linear systems that is more robust than any other in the literature. In particular, we show that it is feasible to use finely-tuned algebraic multigrid preconditioning if key set-up information is reused. The proposed solver is robust with respect to variations in the discretization and statistical parameters for stochastically linear and nonlinear data.
- 20 October 2011
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 32 (3) , 1051-1070
Open AccessOn solving stochastic collocation systems with algebraic multigrid
Stochastic collocation methods facilitate the numerical solution of partial differential equations (PDEs) with random data and give rise to long sequences of similar linear systems. When elliptic PDEs with random diffusion coefficients are discretized with mixed finite element methods in the physical domain we obtain saddle point systems. These are trivial to solve when considered individually; the challenge lies in exploiting their similarities to recycle information and minimize the cost of solving the entire sequence. We apply stochastic collocation to a model stochastic elliptic problem and discretize in physical space using Raviart–Thomas elements. We propose an efficient solution strategy for the resulting linear systems that is more robust than any other in the literature. In particular, we show that it is feasible to use finely-tuned algebraic multigrid preconditioning if key set-up information is reused. The proposed solver is robust with respect to variations in the discretization and statistical parameters for stochastically linear and nonlinear data.