A simple second-order nonstandard numerical method for a general class of dynamical systems and its applications

Manh Tuan Hoang

Home/Archive/arXiv

arXiv · 2608.09141

A simple second-order nonstandard numerical method for a general class of dynamical systems and its applications

Manh Tuan Hoang

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, we consider a class of continuous-time autonomous dynamical systems that model various important phenomena and processes encountered in real-world situations. We construct a second-order nonstandard finite difference (NSFD) method that simultaneously preserves two essential properties of the dynamical systems for all finite step sizes, namely the positivity of the solutions, the set of equilibrium points and their asymptotic stability. This NSFD method is constructed based on an appropriate choice of nonstandard denominator functions and a weighted discretization of the right-hand side functions. Under easily-verified conditions, the denominator functions guarantee second-order convergence, whereas the weights ensure the dynamic consistency. By taking advantage of the specific structure of the right-hand side functions, a simple discretization is utilized instead of the nonlocal discretization approaches commonly used in previous works. This simplifies the construction of the proposed NSFD method and, in particular, makes its asymptotic stability analysis easier. As an illustration and an important application, we apply the constructed second-order NSFD method to a well-known two-stage structured species model with recruitment. Consequently, a simple second-order NSFD scheme for the considered two-stage structured species model is derived, improving upon a first-order NSFD scheme constructed in a previous work. Numerical experiments demonstrate the advantages of the second-order NSFD scheme over a standard second-order numerical method, namely, the explicit trapezoidal method. The proposed NSFD method is simple and can be applied to a broad class of dynamical system models arising in both theory and applications. Moreover, it can be readily combined with the Richardson extrapolation technique to improve its accuracy.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Manh Tuan Hoang. 2026-08-10. A simple second-order nonstandard numerical method for a general class of dynamical systems and its applications. https://arxiv.org/abs/2608.09141

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↗