Engineering Papers⌕ Search

Engineering topics

Gunzburger, Max

Publications and source records attributed to Gunzburger, Max.

At least 37 records · Page 2

Numerical analyses of exponential time-differencing schemes for the solution of atmospheric models

In high-resolution numerical weather prediction models, fast-moving acoustic waves must be treated in a stable manner. Among the implicit–explicit (IMEX) schemes used for the solution of these models, horizontally explicit, vertically implicit (HEVI) methods show good stability and scalability on massively parallel machines. In this work, we present two classes of exponential time-differencing (ETD) methods for atmospheric models that use a HEVI splitting strategy, one being a three-stage method with the addition of artificial diffusion, the second based on a Strang splitting approach. Overall, the stability properties of the methods are analyzed and numerical examples are provided, which compare time-step restrictions and cost-to-accuracy ratios of the new methods with those for existing approaches.

54 ENVIRONMENTAL SCIENCES↗

Grid generation, coupling strategies, and spatially-dependent time stepping for ocean-tidal/estuary systems and other ESM components (Final Report)

There are many multiple scale issues in the ocean modeling, including different mesh resolutions (local) and different physical processes (global). In order to gain efficiency and fidelity in modern ESMs, it is vital to develop high quality, highly nonuniform meshes and spatially-dependent time stepping strategies for coupling various climate system components. The USC/FSU team has worked on the design, analysis, and implementation of fast CVT grid generation and novel time- stepping schemes that could address all the requirements for global and regional ocean models on highly nonuniform meshes.

58 GEOSCIENCES↗

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

A Second-Order Time-Stepping Scheme for Simulating Ensembles of Parameterized Flow Problems

Abstract We consider settings for which one needs to perform multiple flow simulations based on the Navier–Stokes equations, each having different initial condition data, boundary condition data, forcing functions, and/or coefficients such as the viscosity. For such settings, we propose a second-order time accurate ensemble-based method that to simulate the whole set of solutions, requires, at each time step, the solution of only a single linear system with multiple right-hand-side vectors. Rigorous analyses are given proving the conditional stability and establishing error estimates for the proposed algorithm. Numerical experiments are provided that illustrate the analyses.

Mathematics↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

The major goal of the project was to invent, analyze, implement, and apply new algorithms to speed up the computational simulation of complex systems in settings in which multiple simulations are needed. The main efforts we undertook are as follows: 1. Develop novel reduced order methods to reduce the costs of simulations, especially in settings (e.g., UQ, inference, optimization and control) for which numerous simulation are needed and also for nonlocal problems (e.g., fractional derivative, anomalous diffusion, nonlocal mechanics) for which lack of sparsity results in more expensive full-order simulation than encountered in partial differential equations settings; rigorous analyses as well as computational tests were carried out, 2. Develop multifidelity methods based on the usage of a variety of models having different fidelities and different costs to accelerate simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, 3. Develop ensemble methods to reduced the costs of simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, and 4. Analyze a model for Richardson pair dispersion in turbulent flows and develop discretization methods for the efficient and accurate approximations of the solution of the model; rigorous analyses as well as computational tests were carried out.

97 MATHEMATICS AND COMPUTING↗

A Leray regularized ensemble-proper orthogonal decomposition method for parameterized convection-dominated flows

Abstract Partial differential equations (PDEs) are often dependent on input quantities that are uncertain. To quantify this uncertainty PDEs must be solved over a large ensemble of parameters. Even for a single realization this can be a computationally intensive process. In the case of flows governed by the Navier–Stokes equations, an efficient method has been devised for computing an ensemble of solutions. To further reduce the computational cost of this method, an ensemble-proper orthogonal decomposition (POD) method was recently proposed. The main contribution of this work is the introduction of POD spatial filtering for ensemble-POD methods. The POD spatial filter makes possible the construction of the Leray ensemble-POD model, which is a regularized-reduced order model for the numerical simulation of convection-dominated flows of moderate Reynolds number. The Leray ensemble-POD model employs the POD spatial filter to smooth (regularize) the convection term in the Navier–Stokes equations, and diminishes the numerical inaccuracies produced by the ensemble-POD method in the numerical simulation of convection-dominated flows. Specifically, for the numerical simulation of a convection-dominated two-dimensional flow between two offset cylinders, we show that the Leray ensemble-POD method better reflects the dynamics of the benchmark results than the ensemble-POD scheme. The second contribution of this work is a new numerical discretization of the variable viscosity ensemble algorithm in which the average viscosity is replaced with the maximum viscosity. It is shown that this new numerical discretization is significantly more stable than those in current use. Furthermore, error estimates for the novel Leray ensemble-POD algorithm with this new numerical discretization are also proven.

Mathematics↗

Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization

In many situations across computational science and engineering, multiple computational models are available that describe a system of interest. These different models have varying evaluation costs and varying fidelities. Typically, a computationally expensive high-fidelity model describes the system with the accuracy required by the current application at hand, while lower-fidelity models are less accurate but computationally cheaper than the high-fidelity model. Outer-loop applications, such as optimization, inference, and uncertainty quantification, require multiple model evaluations at many different inputs, which often leads to computational demands that exceed available resources if only the high-fidelity model is used. This work surveys multifidelity methods that accelerate the solution of outer-loop applications by combining high-fidelity and low-fidelity model evaluations, where the low-fidelity evaluations arise from an explicit low-fidelity model (e.g., a simplified physics approximation, a reduced model, a data-fit surrogate) that approximates the same output quantity as the high-fidelity model. The overall premise of these multifidelity methods is that low-fidelity models are leveraged for speedup while the high-fidelity model is kept in the loop to establish accuracy and/or convergence guarantees. We categorize multifidelity methods according to three classes of strategies: adaptation, fusion, and filtering. The paper reviews multifidelity methods in the outer-loop contexts of uncertainty propagation, inference, and optimization.

97 MATHEMATICS AND COMPUTING↗

An efficient algorithm for simulating ensembles of parameterized flow problems

Abstract Many applications of computational fluid dynamics require multiple simulations of a flow under different input conditions. In this paper, a numerical algorithm is developed to efficiently determine a set of such simulations in which the individually independent members of the set are subject to different viscosity coefficients, initial conditions and/or body forces. The proposed scheme, when applied to the flow ensemble, needs to solve a single linear system with multiple right-hand sides, and thus is computationally more efficient than solving for all the simulations separately. We show that the scheme is nonlinearly and long-term stable under certain conditions on the time-step size and a parameter deviation ratio. A rigorous numerical error estimate shows the scheme is of first-order accuracy in time and optimally accurate in space. Several numerical experiments are presented to illustrate the theoretical results.

Mathematics↗

An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. In particular, we consider stochastic elliptic PDEs with an affine dependence on the random variable. The goal is to recover the entire solution map from the parameter space to the finite element space. To this end, first, a reduced-basis solution using a weak greedy algorithm is constructed, then a DLS approximation is determined by evaluating the reduced-basis approximation instead of the full finite element approximation. The main advantage of the new approach is that one only need apply the DLS operator to the coefficients of the reduced-basis expansion, resulting in huge savings in both the storage of the DLS coefficients and the online cost of evaluating the DLS approximation. In addition, the recently developed quasi-optimal polynomial space is also adopted in the new approach, resulting in superior convergence rates for a wider class of problems than previous analyzed. Numerical experiments are provided that illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

PISCEES: Predicting Ice Sheet and Climate Evolution at Extreme Scales

This report provides a summary of major accomplishments and activities obtained/performed by the Florida State University/University of South Carolina team participating in the PISCEES project. Major accomplishments for development and application of the prallell 3D finite element Stokes dycore "FELIX-S" of the PISCEES project are discussed in certain detail and some representative test results and findings are also provided.

54 ENVIRONMENTAL SCIENCES↗