Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.23229

Mechanics-trained neural coordinate mapping for B-spline analysis of crack-tip and corner singularities

Hyunju Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

Near a crack tip or re-entrant corner, fractional radial powers can have unbounded derivatives and slow the convergence of high-order splines. A singular mapping grades the computational radius so that the pulled-back field is smoother without changing the physical domain. Classical maps require the singular exponent and grading in advance. Here the radial coordinate is trained from the mechanics problem. It is the normalized integral of a positive neural density, which fixes both radial boundaries and ensures r'(s)>0 away from the collapsed tip. The radial grading exponent and density-correction weights are inferred from Galerkin energies evaluated at discrete equilibrium, without exponent labels or exact interior fields. We test the mapping in scalar and plane-strain B-spline formulations and compare it with the identity map, radially graded knot vectors, prescribed power maps, and an adaptive enriched B-spline method. At 156 vector degrees of freedom, the mechanics-trained map reduces the relative energy-norm error by a factor of 33.42 compared with the identity map. The maximum error in the mixed-mode stress intensity factors recovered on 3 contours is 1.923 x 10^(-5). For the straight crack, the learned density correction vanishes, and the prescribed r=s^2 map gives the same improvement. For a nonlinear Robin family with test parameters outside the training interval, the density correction remains nonzero and gives a fixed-q incremental energy gain of at least 4.839. Thus, for the problems considered here, the neural correction is useful when the required coordinate is not represented by a prescribed power map.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyunju Kim. 2026-07-25. Mechanics-trained neural coordinate mapping for B-spline analysis of crack-tip and corner singularities. https://arxiv.org/abs/2607.23229

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↗