Publications

Results 1–25 of 120
Skip to search filters

A conservative, optimization-based semi-lagrangian spectral element method for passive tracer transport

COUPLED PROBLEMS 2015 - Proceedings of the 6th International Conference on Coupled Problems in Science and Engineering

Bochev, Pavel B.; Moe, Scott A.; Peterson, Kara J.; Ridzal, Denis R.

We present a new optimization-based, conservative, and quasi-monotone method for passive tracer transport. The scheme combines high-order spectral element discretization in space with semi-Lagrangian time stepping. Solution of a singly linearly constrained quadratic program with simple bounds enforces conservation and physically motivated solution bounds. The scheme can handle efficiently a large number of passive tracers because the semi-Lagrangian time stepping only needs to evolve the grid points where the primitive variables are stored and allows for larger time steps than a conventional explicit spectral element method. Numerical examples show that the use of optimization to enforce physical properties does not affect significantly the spectral accuracy for smooth solutions. Performance studies reveal the benefits of high-order approximations, including for discontinuous solutions.

More Details

A time-parallel method for the solution of PDE-constrained optimization problems

Ridzal, Denis R.; Cyr, Eric C.; Hajghassem, Mona H.

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

More Details

A toolbox for a class of discontinuous Petrov-Galerkin methods using trilinos

Ridzal, Denis R.; Bochev, Pavel B.

The class of discontinuous Petrov-Galerkin finite element methods (DPG) proposed by L. Demkowicz and J. Gopalakrishnan guarantees the optimality of the solution in an energy norm and produces a symmetric positive definite stiffness matrix, among other desirable properties. In this paper, we describe a toolbox, implemented atop Sandia's Trilinos library, for rapid development of solvers for DPG methods. We use this toolbox to develop solvers for the Poisson and Stokes problems.

More Details

Adaptive Space-Time Methods for Large Scale Optimal Design

DiPietro, Kelsey L.; Ridzal, Denis R.; Morales, Diana M.

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

More Details
Results 1–25 of 120
Results 1–25 of 120