Search arXiv⌕ Search

arXiv · 2610.39047

Solving the Minkowski problem by continuation from the unit sphere: spherical harmonic discretization and error estimates

Abstract

Given a positive function $ρ$ on the unit sphere $\mathbb{S}^2$, the classical Minkowski problem asks for a closed convex surface in $\mathbb{R}^3$ with Gauss curvature $1/ρ(ν)$ at the point with outer normal $ν$. In terms of the support function $h$, it is the Monge--Ampère equation $\det(\nabla^2h+hσ)=ρ$ on $\mathbb{S}^2$, uniquely solvable up to translation when $ρ$ has zero first moment. We solve it by continuation from the sphere: along the linear path $ρ_t=(1-t)+tρ$, the solution $h(t)$ evolves in the artificial time $t$, and its velocity $\partial_th$ solves a linear elliptic equation in divergence form whose kernel consists of the translations. In time we use the explicit Euler or trapezoidal method with step $τ$; in space, spherical harmonics of degree at most $L$ with a Lagrange multiplier for the kernel. For $ρ\in H^{s+2}(\mathbb{S}^2)$ with real $s\ge4$, we prove that all numerical solutions stay strictly convex, with $H^1$ errors $O(τ+L^{-(s+1)})$ for Euler and $O(τ^3+L^{-(s+1)})$ for the trapezoidal scheme, including data quadrature, under independent thresholds for $τ$ and $L$. The proof rests on a priori estimates for the perturbed equation satisfied by each iterate, which keep every step uniformly elliptic, and on the exactly quadratic determinant, which raises the trapezoidal order from two to three. The continuation thus supplies a good initial guess for Newton's method: from the final state it converges quadratically to the Galerkin solution, itself within $O(L^{-(s+1)})$ of the exact solution, whereas started directly from the sphere its first undamped step left the convex cone in our ellipsoid test. Experiments illustrate the rates, use the multiplier as a compatibility diagnostic, reconstruct convex polyhedra from facet normals and areas, and locate umbilics with indices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Buyang Li, Jian-Guo Liu, Rong Tang. 2026-10-28. Solving the Minkowski problem by continuation from the unit sphere: spherical harmonic discretization and error estimates. https://arxiv.org/abs/2610.39047

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗