A new modified highly accurate Laplace-Fourier method for linear neutral delay differential equations

Gilbert Kerr; Gilberto Gonzalez-Parra

Home/Archive/arXiv

arXiv · 2404.15291

A new modified highly accurate Laplace-Fourier method for linear neutral delay differential equations

Gilbert Kerr·Gilberto Gonzalez-Parra

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article, a new modified Laplace-Fourier method is developed in order to obtain the solutions of linear neutral delay differential equations. The proposed method provides a more accurate solution than the one provided by the pure Laplace method and the original Laplace-Fourier method. We develop and show the crucial modifications of the Laplace-Fourier method. As with the original Laplace-Fourier method, the new modified method combines the Laplace transform method with Fourier series theory. All of the beneficial features from the original Laplace-Fourier method are retained. The modified solution still includes a component that accounts for the terms in the tail of the infinite series, allowing one to obtain more accurate solutions. The Laplace-Fourier method requires us to approximate the formula for the residues with an asymptotic expansion. This is essential to enable us to use the Fourier series results that enable us to account for the tail. The improvement is achieved by deriving a new asymptotic expansion which minimizes the error between the actual residues and those which are obtained from this asymptotic expansion. With both the pure Laplace and improved Laplace-Fourier methods increasing the number of terms in the truncated series obviously increases the accuracy. However, with the pure Laplace, this improvement is small. As we shall show, with the improved Laplace-Fourier method the improvement is significantly larger. We show that the convergence rate of the new modified Laplace-Fourier solution has a remarkable order of convergence $O(N^{-3})$. The validity of the modified technique is corroborated by means of illustrative examples. Comparisons of the solutions of the new modified method with those generated by the pure Laplace method and the original/unmodified Laplace-Fourier approach are presented.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Gilbert Kerr, Gilberto Gonzalez-Parra. 2024-03-23. A new modified highly accurate Laplace-Fourier method for linear neutral delay differential equations. https://arxiv.org/abs/2404.15291

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↗