Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.09021

Interface Formulation and High Order Numerical Solutions of PDEs with Low Regularity

Y. C. Zhou·Varun Gupta
View original source ↗Read source document ↗Export metadata ↓

Abstract

Linear elastic fracture mechanics admit analytic solutions that have low regularity at crack tips. Current numerical methods for partial differential equations (PDEs) of this type suffer from the constraint of such low regularity, and fail to deliver optimal high order rate of convergence. We approach the problem by (i) choosing an artificial interface to enclose the center of the low regularity; and (ii) representing the solution in the interior of artificial interface as unknown linear combination of known modes of low regular solutions. This gives rise to an interface formulation of the original PDE, and the linear combination are represented the interface conditions. By enforcing the smooth component of numerical solution in the interior domain to be approximately zero, a least square problem is obtained for the unknown coefficients. The solution of this least square problem will provide approximate interface conditions for the numerical solution of the PDE in the exterior domain. The potential of our interface formulation is favorably demonstrated by numerical experiments on 1-D and 2-D Poisson equations with low regular solutions. High order numerical solutions of unknown coefficients and PDEs are obtained. This proves the potential of the proposed interface formulation as the theoretical basis for solving linear elastic fracture mechanics problems. We indicate the relations between our interface formulation and domain decomposition methods as well as a regularization strategy for the Poisson-Boltzmann equation with singular charge density.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Y. C. Zhou, Varun Gupta. 2016-11-28. Interface Formulation and High Order Numerical Solutions of PDEs with Low Regularity. https://arxiv.org/abs/1611.09021

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↗