Related papers: Parallel implementation of a compatible high-order…
In this paper, we propose a new approach for the time-discretization of the incompressible stochastic Stokes equations with multiplicative noise. Our new strategy is based on the classical Milstein method from stochastic differential…
Stochastic dynamical systems with continuous symmetries arise commonly in nature and often give rise to coherent spatio-temporal patterns. However, because of their random locations, these patterns are not well captured by current order…
In this work, we study shape optimization problems in the Stokes flows. By phase-field approaches, the resulted total objective function consists of the dissipation energy of the fluids and the Ginzburg--Landau energy functional as a…
State-based peridynamic models provide an important extension of bond-based models that allow the description of general linearly elastic materials. Meshfree discretizations of these nonlocal models are attractive due to their ability to…
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our…
Synchronizations of processing elements (PEs) in massively parallel simulations, which arise due to communication or load imbalances between PEs, significantly affect the scalability of scientific applications. We have recently proposed a…
We present an algorithm for the solution of a simultaneous space-time discretization of linear parabolic evolution equations with a symmetric differential operator in space. Building on earlier work, we recast this discretization into a…
The boundary layer represents a fundamental structure in fluid dynamics, where accurate boundary discretization significantly enhances computational efficiency. This paper presents a third-order boundary discretization for compact…
In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…
We carry out a stability and convergence analysis of a fully discrete scheme for the time-dependent Navier-Stokes equations resulting from combining an $H(\mathrm{div}, \Omega)$-conforming discontinuous Galerkin spatial discretization, and…
Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…
A new discontinuous Galerkin finite element method for the Stokes equations is developed in the primary velocity-pressure formulation. This method employs discontinuous polynomials for both velocity and pressure on general…
Computations of incompressible flows with velocity boundary conditions require solution of a Poisson equation for pressure with all Neumann boundary conditions. Discretization of such a Poisson equation results in a rank-deficient matrix of…
Numerical algorithms for solving problems of mathematical physics on modern parallel computers employ various domain decomposition techniques. Domain decomposition schemes are developed here to solve numerically initial/boundary value…
This paper introduces sTiles, a GPU-accelerated framework for factorizing sparse structured symmetric matrices. By leveraging tile algorithms for fine-grained computations, sTiles uses a structure-aware task execution flow to handle…
Vertex-patch smoothers offer an effective strategy for achieving robust geometric multigrid convergence for the Stokes equations, particularly in the context of high-order finite elements. However, their practical efficiency is often…
In this paper, we revisit an auxiliary space preconditioning method proposed by Xu [Computing 56, 1996], in which low-order finite element spaces are employed as auxiliary spaces for solving linear algebraic systems arising from high-order…
We present a scalability study of Golub-Kahan bidiagonalization for the parallel iterative solution of symmetric indefinite linear systems with a 2x2 block structure. The algorithms have been implemented within the parallel numerical…
We propose a parallel adaptive constraint-tightening approach to solve a linear model predictive control problem for discrete-time systems, based on inexact numerical optimization algorithms and operator splitting methods. The underlying…
We present a novel approach to fast on-the-fly low order finite element assembly for scalar elliptic partial differential equations of Darcy type with variable coefficients optimized for matrix-free implementations. Our approach introduces…