Searcharxiv⌕ Search

arXiv subjects

Erik Wünsche

Publications and source records attributed to Erik Wünsche.

5 recordsLinked to original sources

Computing with Orientation-Dependent Vector Fields in Crystallographic Texture Analysis

We present a computational framework for representing orientation-dependent vector fields. Building on (arXiv:2608.21235), we translate the differential-geometric formulation into crystallographic notation and focus on its computational use in crystallographic texture analysis. In crystallographic applications, small orientation changes are commonly described by rotation vectors, spin tensors, or infinitesimal misorientations. By contrast, vector fields in harmonic computations are usually represented by components with respect to Euler-angle derivatives, following the classical formulation of generalized spherical harmonics. This representation is convenient but numerically unfavorable. We instead use rotation-vector components, extending a familiar description of individual orientation changes to orientation-dependent vector fields. In this representation, vector fields are described by three scalar component functions, which can be expanded into generalized spherical harmonics. We derive frequency-domain formulas for gradient, divergence, and curl, enabling their evaluation directly on harmonic coefficients. In particular, the gradient of a band-limited scalar function remains band-limited with the same bandwidth.

math.NA↗

Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares

We consider harmonic approximation on the torus $\mathbb{T}^d$, the sphere $\mathcal{S}^d$, and the rotation group $\mathrm{SO}(3)$. While several global approaches are available for computing a harmonic expansion from scattered data, their stability and, especially, their runtime depend strongly on the geometry of the nodes, in particular on a sufficiently small fill distance. Even a single large hole in the data may cause instability and long runtimes. We propose harmonic approximation via moving least squares (HAMLS), a global harmonic approximation scheme that avoids the ill-conditioned global solve and works well in both the overdetermined and the underdetermined settings. The main idea is an intermediate transition from the scattered data to a quadrature grid, which is realized via moving least squares (MLS). This replaces one large global problem by many small local ones that can be regularized individually. The global harmonic approximation is then obtained via quadrature using a fast Fourier transform. This makes the global stage fast, stable and non-iterative. For sufficiently smooth functions sampled at well-distributed nodes with small fill distance $h$, we bound the resulting $\mathrm{L}^2$-error by the error of the harmonic approximation obtained from exact values on the quadrature grid, plus a term of order $h^{K+1}$, where $K$ is the polynomial degree employed in the MLS step. Numerical experiments on $\mathcal{S}^2$ with ill-distributed nodes show that HAMLS achieves errors comparable to those of global least-squares approximation, while being significantly faster, especially for larger bandwidths.

math.NA↗

A Harmonic Framework for Vector Fields and Differential Operators on SO(3)

We present a comprehensive framework for tangent vector fields and differential operators on the rotation group $\mathrm{SO}(3)$ using harmonic series expansions, which provides a mathematical foundation for their implementation in the crystallographic texture analysis software MTEX. The central idea is to employ the standard left- and right-invariant frames as global orthonormal frames of the tangent bundle, thereby avoiding the numerical instabilities of the classical tangent space basis derived from the Jacobian of the Euler angle parametrization. While the choice of frames is primarily motivated by their geometric and numerical properties, their full potential emerges in the harmonic setting. Representing tangent vector fields through harmonic expansions of their frame components, we derive explicit frequency domain formulas for the gradient, divergence, and curl, allowing these operators to be applied directly to the harmonic coefficients. Moreover, we show that these differential operators preserve harmonic band-limitedness. In addition, the left- and right-invariant representations of tangent vector fields can be transformed into one another directly in the frequency domain, with an increase in harmonic bandwidth of at most one degree.

math.NA↗

On the Role of the Double Fourier Sphere Method in Fast Algorithms on SO(3)

We analyze the Double Fourier Sphere (DFS) method on the rotation group $\mathcal{SO}(3)$ in the frequency domain and demonstrate its central role in fast algorithms. Fast Fourier algorithms on $\mathcal{SO}(3)$ are commonly formulated as a Wigner transform - mapping harmonic to Fourier coefficients - followed by a Fourier transform. We revisit this formulation and interpret the Wigner transform as an explicit realization of the DFS method, lifting functions from $\mathcal{SO}(3)$ to $\mathbb{T}^3$. In this context, we analyze the Sobolev regularity loss induced by this lifting. Furthermore, we compare different Wigner transform implementations, examine additional symmetry enhancements, and observe that the direct method is often faster and more stable than the fast polynomial transform approaches.

math.NA↗

A unified framework for grain boundary distributions in textured materials

Grain boundary plane distributions are widely used to infer the mechanisms governing grain boundary formation in polycrystalline materials. We show that such interpretations are inherently ambiguous. Using a unified eight-parameter boundary distribution framework, we derive both the grain boundary character distribution (GBCD) and the grain boundary normal distribution (GBND) and identify two limiting cases of boundary network formation. We show that in macroscopically driven networks, the crystal-frame GBND is given by a convolution of the specimen GBND with the orientation distribution function (ODF), whereas in crystallographically driven networks the specimen GBND is obtained by convolution of the crystal GBND with the ODF. This duality implies that anisotropy in the GBND may arise from macroscopic alignment effects rather than intrinsic crystallographic selection. Conversely, this relationship may be used to identify the dominant formation process in the measured mcirostructures. Evaluation of a wide variety of simulated microstructures confirm the theoretically predicted relationships between texture, GBND and GBCD. In particular, our examples confirm that the GBND or GBCD alone are not sufficient for identifying grain boundary formation mechanisms.

cond-mat.mtrl-sci↗