 Publication Date:
 NSFPAR ID:
 10345726
 Journal Name:
 Computational Methods in Applied Mathematics
 Volume:
 0
 Issue:
 0
 ISSN:
 16094840
 Sponsoring Org:
 National Science Foundation
More Like this

Numerically solving partial differential equations (PDEs) remains a compelling application of supercomputing resources. The next generation of computing resources  exhibiting increased parallelism and deep memory hierarchies  provide an opportunity to rethink how to solve PDEs, especially time dependent PDEs. Here, we consider time as an additional dimension and simultaneously solve for the unknown in large blocks of time (i.e. in 4D spacetime), instead of the standard approach of sequential timestepping. We discretize the 4D spacetime domain using a meshfree kD tree construction that enables good parallel performance as well as onthefly construction of adaptive 4D meshes. To best use the 4D spacetime mesh adaptivity, we invoke concepts from PDE analysis to establish rigorous a posteriori error estimates for a general class of PDEs. We solve canonical linear as well as nonlinear PDEs (heat diffusion, advectiondiffusion, and AllenCahn) in spacetime, and illustrate the following advantages: (a) sustained scaling behavior across a larger processor count compared to sequential timestepping approaches, (b) the ability to capture "localized" behavior in space and time using the adaptive spacetime mesh, and (c) removal of any timestepping constraints like the CourantFriedrichsLewy (CFL) condition, as well as the ability to utilize spatially varying timesteps. We believemore »

Embedding properties of network realizations of dissipative reduced order models Jörn Zimmerling, Mikhail Zaslavsky,Rob Remis, Shasri Moskow, Alexander Mamonov, Murthy Guddati, Vladimir Druskin, and Liliana Borcea Mathematical Sciences Department, Worcester Polytechnic Institute https://www.wpi.edu/people/vdruskin Abstract Realizations of reduced order models of passive SISO or MIMO LTI problems can be transformed to tridiagonal and blocktridiagonal forms, respectively, via dierent modications of the Lanczos algorithm. Generally, such realizations can be interpreted as ladder resistorcapacitorinductor (RCL) networks. They gave rise to network syntheses in the rst half of the 20th century that was at the base of modern electronics design and consecutively to MOR that tremendously impacted many areas of engineering (electrical, mechanical, aerospace, etc.) by enabling ecient compression of the underlining dynamical systems. In his seminal 1950s works Krein realized that in addition to their compressing properties, network realizations can be used to embed the data back into the state space of the underlying continuum problems. In more recent works of the authors Krein's ideas gave rise to socalled nitedierence Gaussian quadrature rules (FDGQR), allowing to approximately map the ROM statespace representation to its full order continuum counterpart on a judicially chosen grid. Thus, the state variables can be accessed directly from themore »

A plethora of complex dynamical systems from disordered media to biological systems exhibit mathematical characteristics (e.g., longrange dependence, selfsimilar and power law magnitude increments) that are wellfitted by fractional partial differential equations (PDEs). For instance, some biological systems displaying an anomalous diffusion behavior, which is characterized by a nonlinear meansquare displacement relation, can be mathematically described by fractional PDEs. In general, the PDEs represent various physical laws or rules governing complex dynamical systems. Since prior knowledge about the mathematical equations describing complex dynamical systems in biology, healthcare, disaster mitigation, transportation, or environmental sciences may not be available, we aim to provide algorithmic strategies to discover the integer or fractional PDEs and their parameters from system's evolution data. Toward deciphering nontrivial mechanisms driving a complex system, we propose a datadriven approach that estimates the parameters of a fractional PDE model. We study the spacetime fractional diffusion model that describes a complex stochastic process, where the magnitude and the time increments are stable processes. Starting from limited timeseries data recorded while the system is evolving, we develop a fractionalorder momentsbased approach to determine the parameters of a generalized fractional PDE. We formulate two optimization problems to allow us to estimate the argumentsmore »

Abstract Several important PDE systems, like magnetohydrodynamics and computational electrodynamics, are known to support involutions where the divergence of a vector field evolves in divergencefree or divergence constraintpreserving fashion. Recently, new classes of PDE systems have emerged for hyperelasticity, compressible multiphase flows, socalled firstorder reductions of the Einstein field equations, or a novel firstorder hyperbolic reformulation of Schrödinger’s equation, to name a few, where the involution in the PDE supports curlfree or curl constraintpreserving evolution of a vector field. We study the problem of curl constraintpreserving reconstruction as it pertains to the design of mimetic finite volume (FV) WENOlike schemes for PDEs that support a curlpreserving involution. (Some insights into discontinuous Galerkin (DG) schemes are also drawn, though that is not the prime focus of this paper.) This is done for two and threedimensional structured mesh problems where we deliver closed form expressions for the reconstruction. The importance of multidimensional Riemann solvers in facilitating the design of such schemes is also documented. In two dimensions, a von Neumann analysis of structurepreserving WENOlike schemes that mimetically satisfy the curl constraints, is also presented. It shows the tremendous value of higher order WENOlike schemes in minimizing dissipation and dispersion for this classmore »

In uncertainty quantification, it is commonly required to solve a forward model consisting of a partial differential equation (PDE) with a spatially varying uncertain coefficient that is represented as an affine function of a set of random variables, or parameters. Discretizing such models using stochastic Galerkin finite element methods (SGFEMs) leads to very highdimensional discrete problems that can be cast as linear multiterm matrix equations (LMTMEs). We develop efficient computational methods for approximating solutions of such matrix equations in low rank. To do this, we follow an alternating energy minimization (AEM) framework, wherein the solution is represented as a product of two matrices, and approximations to each component are sought by solving certain minimization problems repeatedly. Inspired by proper generalized decomposition methods, the iterative solution algorithms we present are based on a rankadaptive variant of AEM methods that successively computes a rankone solution component at each step. We introduce and evaluate new enhancement procedures to improve the accuracy of the approximations these algorithms deliver. The efficiency and accuracy of the enhanced AEM methods is demonstrated through numerical experiments with LMTMEs associated with SGFEM discretizations of parameterized linear elliptic PDEs.