Todd Arbogast

Prof. Todd Arbogast

Mathematics, University of Texas at Austin, Austin, Texas, USA
orcid

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

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

Representative Publications

View All Publications
1 April 1997 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
TATodd Arbogast
Todd Arbogast
MWMary F. Wheeler
Mary F. Wheeler
IYIvan Yotov
Ivan Yotov
We present an expanded mixed finite element approximation of second-order elliptic problems containing a tensor coefficient. The mixed method is expanded in the sense that three variables are explicitly approximated, namely, the scalar unknown, the negative of its gradient, and its flux (the tensor coefficient times the negative gradient). The resulting linear system is a saddle point problem. In the case of the lowest order Raviart--Thomas elements on rectangular parallelepipeds, we approximate this expanded mixed method by incorporating certain quadrature rules. This enables us to write the system as a simple, cell-centered finite difference method requiring the solution of a sparse, positive semidefinite linear system for the scalar unknown. For a general tensor coefficient, the sparsity pattern for the scalar unknown is a 9-point stencil in two dimensions and 19 points in three dimensions. Existing theory shows that the expanded mixed method gives optimal order approximations in the $L^2$- and $H^{-s}$-norms (and superconvergence is obtained between the $L^2$-projection of the scalar variable and its approximation). We show that these rates of convergence are retained for the finite difference method. If h denotes the maximal mesh spacing, then the optimal rate is $O(h)$. The superconvergence rate $O(h^{2})$ is obtained for the scalar unknown and rate $O(h^{3/2})$ for its gradient and flux in certain discrete norms; moreover, the full $O(h^{2})$ is obtained in the strict interior of the domain. Computational results illustrate these theoretical results.

1 January 2007 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
TATodd Arbogast
Todd Arbogast
GPGergina Pencheva
Gergina Pencheva
MWMary F. Wheeler
Mary F. Wheeler
IYIvan Yotov
Ivan Yotov
We develop multiscale mortar mixed finite element discretizations for second order elliptic equations. The continuity of flux is imposed via a mortar finite element space on a coarse grid scale, while the equations in the coarse elements (or subdomains) are discretized on a fine grid scale. The polynomial degree of the mortar and subdomain approximation spaces may differ; in fact, the mortar space achieves approximation comparable to the fine scale on its coarse grid by using higher order polynomials. Our formulation is related to, but more flexible than, existing multiscale finite element and variational multiscale methods. We derive a priori error estimates and show, with appropriate choice of the mortar space, optimal order convergence and some superconvergence on the fine scale for both the solution and its flux. We also derive efficient and reliable a posteriori error estimators, which are used in an adaptive mesh refinement algorithm to obtain appropriate subdomain and mortar grids. Numerical experiments are presented in confirmation of the theory.

21 February 2007 in Computational Geosciences
Verified
Journal Article
Closed access
PDF file
TATodd Arbogast
Todd Arbogast
DBDana S. Brunson
Dana S. Brunson

1 January 2000 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
TATodd Arbogast
Todd Arbogast
LCLawrence C. Cowsar
Lawrence C. Cowsar
MWMary F. Wheeler
Mary F. Wheeler
IYIvan Yotov
Ivan Yotov
We consider mixed finite element methods for second order elliptic equations on nonmatching multiblock grids. A mortar finite element space is introduced on the nonmatching interfaces. We approximate in this mortar space the trace of the solution, and we impose weakly a continuity of flux condition. A standard mixed finite element method is used within the blocks. Optimal order convergence is shown for both the solution and its flux. Moreover, at certain discrete points, superconvergence is obtained for the solution and also for the flux in special cases. Computational results using an efficient parallel domain decomposition algorithm are presented in confirmation of the theory.

1 August 1996 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
TATodd Arbogast
Todd Arbogast
MWMary F. Wheeler
Mary F. Wheeler
We study a model nonlinear, degenerate, advection-diffusion equation having application in petroleum reservoir and groundwater aquifer simulation. The main difficulty is that the true solution is typically lacking in regularity; therefore, we consider the problem from the point of view of optimal approximation. Through time integration, we develop a mixed variational form that respects the known minimal regularity, and then we develop and analyze two versions of a mixed finite element approximation, a simpler semidiscrete (time-continuous) version and a fully discrete version. Our error bounds are optimal in the sense that all but one of the bounding terms reduce to standard approximation error. The exceptional term is a nonstandard approximation error term. We also consider our new formulation for the nondegenerate problem, showing the usual optimal $L^2 $-error bounds; moreover, superconvergence is obtained under special circumstances.

1 July 2006 in Computational Geosciences
Verified
Journal Article
Closed access
PDF file
TATodd Arbogast
Todd Arbogast
HLHeather L. Lehr
Heather L. Lehr