Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1508.00505

Structure preserving integration and model order reduction of skew-gradient reaction-diffusion systems

Bülent Karasözen·Tuğba Küçükseyhan·Murat Uzunca
View original source ↗Read source document ↗Export metadata ↓

Abstract

Activator-inhibitor FitzHugh-Nagumo (FHN) equation is an example for reaction-diffusion equations with skew-gradient structure. We discretize the FHN equation using symmetric interior penalty discontinuous Galerkin (SIPG) method in space and average vector field (AVF) method in time. The AVF method is a geometric integrator, i.e. it preserves the energy of the Hamiltonian systems and energy dissipation of the gradient systems. In this work, we show that the fully discrete energy of the FHN equation satisfies the mini-maximizer property of the continuous energy for the skew-gradient systems. We present numerical results with traveling fronts and pulses for one dimensional, two coupled FHN equations and three coupled FHN equations with one activator and two inhibitors in skew-gradient form. Turing patterns are computed for fully discretized two dimensional FHN equation in the form of spots and labyrinths. Because the computation of the Turing patterns is time consuming for different parameters, we applied model order reduction with the proper orthogonal decomposition (POD). The nonlinear term in the reduced equations is computed using the discrete empirical interpolation (DEIM) with SIPG discretization. Due to the local nature of the discontinuous Galerkin (DG) method, the nonlinear terms can be computed more efficiently than for the continuous finite elements. The reduced solutions are very close to the fully discretized ones. The efficiency and accuracy of the POD and POD-DEIM reduced solutions are shown for the labyrinth-like patterns.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bülent Karasözen, Tuğba Küçükseyhan, Murat Uzunca. 2015-10-22. Structure preserving integration and model order reduction of skew-gradient reaction-diffusion systems. https://doi.org/10.1007/s10479-015-2063-6

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

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗