Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.3230

A monolithic multi-time-step computational framework for first-order transient systems with disparate scales

S. Karimi·K. B. Nakshatrala
View original source ↗Read source document ↗Export metadata ↓

Abstract

Developing robust simulation tools for problems involving multiple mathematical scales has been a subject of great interest in computational mathematics and engineering. A desirable feature to have in a numerical formulation for multiscale transient problems is to be able to employ different time-steps (multi-time-step coupling), and different time integrators and different numerical formulations (mixed methods) in different regions of the computational domain. We present two new monolithic multi-time-step mixed coupling methods for first-order transient systems. We shall employ unsteady advection-diffusion-reaction equation with linear decay as the model problem, which offers several unique challenges in terms of non-self-adjoint spatial operator and rich features in the solutions. We shall employ the dual Schur domain decomposition technique to handle the decomposition of domain into subdomains. Two different methods of enforcing compatibility along the subdomain interface will be used in the time discrete setting. A systematic theoretical analysis (which includes numerical stability, influence of perturbations, bounds on drift along the subdomain interface) will be performed. The first coupling method ensures that there is no drift along the subdomain interface but does not facilitate explicit/implicit coupling. The second coupling method allows explicit/implicit coupling with controlled (but non-zero) drift in the solution along the subdomain interface. Several canonical problems will be solved to numerically verify the theoretical predictions, and to illustrate the overall performance of the proposed coupling methods. Finally, we shall illustrate the robustness of the proposed coupling methods using a multi-time-step transient simulation of a fast bimolecular advective-diffusive-reactive system.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Karimi, K. B. Nakshatrala. 2014-05-13. A monolithic multi-time-step computational framework for first-order transient systems with disparate scales. https://doi.org/10.1016/j.cma.2014.10.003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Stress-divergence, Laplacian, and rotational forms of the incompressible Navier--Stokes equations with variable viscosity

In the Navier--Stokes equations, incompressibility allows rewriting the viscous term in various forms leading to distinct numerical properties and flow descriptions. Furthermore, models accounting for non-Newtonian, thermal or turbulent effects often break the constant-viscosity assumption, thereby producing additional consistency terms. In this context, the present work compares the classical symmetric-gradient diffusion term with more recent variable-viscosity generalizations of the Laplacian and rotational forms. We discuss, analyze and test their differences with respect to implementation, efficiency, numerical stability and outflow boundary conditions. With a focus on time-dependent flows, we consider second-order implicit-explicit (IMEX) temporal discretizations aimed at improving efficiency and numerical stability. Through a rigorous stability analysis, we show how selected explicit treatments can bypass algorithmic nonlinearities without inducing CFL conditions. Our numerical results highlight important differences between the three viscous formulations---especially in the presence of outflow boundaries, for which the generalized Laplacian form proves more suitable in diffusion-dominated regimes. %(as widely known for constant viscosity).

math.NA↗
arXiv2026

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.

math.NA↗
arXiv2026

A variational physics-informed graph neural network for heterogeneous solid mechanics

Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($\sigma_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

math.NA↗