Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.21888

Semi Analytical Solution of a Nonlinear Oblique Boundary Value Problem

Mriganka Shekhar Chaki·Maria C. Jorge
View original source ↗Read source document ↗Export metadata ↓

Abstract

A new numerical method is developed to approximate the solution of Laplace's equation in the exterior of the sphere with a strongly nonlinear boundary value of oblique type. A functional analysis attempt to solve this type of boundary condition is not straight forward since results about existence and uniqueness of solution are still limited. Hence, a semi analytical method is described here to approach a solution. A perturbation solution around the monopole converts the nonlinear oblique problem into a series of known Neumann problems in the exterior of the sphere. The corresponding Green's function representation for the exterior Neumann problem gives an exact analytic solution for each perturbation step as an integral on the surface of the sphere. Nevertheless, the boundary conditions become very complicated and require to be approximated numerically. The perturbation solutions given by integrals of the Green's function on the sphere are computed at each perturbation step using different subdivisions of the surface integrals with the help of adaptive quadrature method. We call icosahedron method to the integration on the sphere with an icosahedron mesh using Gauss 5-point or adaptive quadrature, according to the integration parameter. This method was very effective to deal with the singularity of the Green's function successfully avoiding inaccuracies on the numerical approximation and is an important contribution of this work. The numerical perturbation scheme is performed for two given exact solutions. The icosahedron method is found to be very precise. The approximations show the desired properties: they get closer to the exact solutions as the perturbation parameter gets smaller, show rapid convergence in the exterior of the unit sphere and converge to zero as the radius grows.

Explore related subjects

math.NAcs.NAmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mriganka Shekhar Chaki, Maria C. Jorge. 2025-06-27. Semi Analytical Solution of a Nonlinear Oblique Boundary Value Problem. https://arxiv.org/abs/2506.21888

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↗