Five Degree-of-Freedom Property Interpolation of Arbitrary Grain
Boundaries via Voronoi Fundamental Zone Octonion Framework
- URL: http://arxiv.org/abs/2104.06575v1
- Date: Wed, 14 Apr 2021 01:33:20 GMT
- Title: Five Degree-of-Freedom Property Interpolation of Arbitrary Grain
Boundaries via Voronoi Fundamental Zone Octonion Framework
- Authors: Sterling G. Baird, Eric R. Homer, David T. Fullwood, Oliver K. Johnson
- Abstract summary: We introduce the Voronoi fundamental zone octonion framework for grain boundary (GB) structure-property surrogates.
The VFZO framework offers an advantage over other five degree-of-freedom based property methods because it is constructed as a point set in a manifold.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce the Voronoi fundamental zone octonion interpolation framework
for grain boundary (GB) structure-property models and surrogates. The VFZO
framework offers an advantage over other five degree-of-freedom based property
interpolation methods because it is constructed as a point set in a manifold.
This means that directly computed Euclidean distances approximate the original
octonion distance with significantly reduced computation runtime (~7 CPU
minutes vs. 153 CPU days for a 50000x50000 pairwise-distance matrix). This
increased efficiency facilitates lower interpolation error through the use of
significantly more input data. We demonstrate grain boundary energy
interpolation results for a non-smooth validation function and simulated
bi-crystal datasets for Fe and Ni using four interpolation methods: barycentric
interpolation, Gaussian process regression (GPR), inverse-distance weighting,
and nearest-neighbor interpolation. These are evaluated for 50000 random input
GBs and 10 000 random prediction GBs. The best performance was achieved with
GPR, which resulted in a reduction of the root mean square error (RMSE) by
83.0% relative to RMSE of a constant, average model. Likewise, interpolation on
a large, noisy, molecular statics Fe simulation dataset improves performance by
34.4% compared to 21.2% in prior work. Interpolation on a small, low-noise MS
Ni simulation dataset is similar to interpolation results for the original
octonion metric (57.6% vs. 56.4%). A vectorized, parallelized, MATLAB
interpolation function (interp5DOF.m) and related routines are available in our
VFZO repository (github.com/sgbaird-5dof/interp) which can be applied to other
crystallographic point groups. The VFZO framework offers advantages for
computing distances between GBs, estimating property values for arbitrary GBs,
and modeling surrogates of computationally expensive 5DOF functions and
simulations.
Related papers
- Simply Trainable Nearest Neighbour Machine Translation with GPU Inference [2.3420045370973828]
This paper proposes a trainable nearest neighbor machine translation on GPU.
We first adaptively construct a small datastore for each input sentence.
Second, we train a single-layer network for the adaption between the knnMT and pre-trained result to automatically interpolate in different domains.
arXiv Detail & Related papers (2024-07-29T12:55:40Z) - Geometry-Informed Neural Operator for Large-Scale 3D PDEs [76.06115572844882]
We propose the geometry-informed neural operator (GINO) to learn the solution operator of large-scale partial differential equations.
We successfully trained GINO to predict the pressure on car surfaces using only five hundred data points.
arXiv Detail & Related papers (2023-09-01T16:59:21Z) - Spatio-temporal DeepKriging for Interpolation and Probabilistic
Forecasting [2.494500339152185]
We propose a deep neural network (DNN) based two-stage model fortemporal-temporal and forecasting.
We adopt the quant-based loss function in the processes to provide probabilistic forecasting.
It is suitable for large-scale prediction of complex-temporal processes.
arXiv Detail & Related papers (2023-06-20T11:51:44Z) - Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
We present two new classes of algorithms for efficient field integration on graphs encoding point clouds.
The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
arXiv Detail & Related papers (2023-02-02T08:33:36Z) - Bayesian phase difference estimation algorithm for direct calculation of
fine structure splitting: accelerated simulation of relativistic and quantum
many-body effects [0.0]
We implement the recently-proposed quantum algorithm, the Bayesian Phase Difference Estimation (BPDE) approach, to accurately compute fine-structure splittings.
Our numerical simulations reveal that the BPDE algorithm, can predict the fine-structure splitting to Boron-like ions to within 605.3 cm$-1$ of root mean square deviations from the experimental ones.
arXiv Detail & Related papers (2022-12-05T06:46:37Z) - Teach me how to Interpolate a Myriad of Embeddings [18.711509039868655]
Mixup refers to data-based augmentation, originally motivated as a way to go beyond empirical risk minimization.
We introduce MultiMix, which interpolates an arbitrary number $n$ of length $m$, with one vector $lambda$ per length.
Our contributions result in significant improvement over state-of-the-art mixup methods on four benchmarks.
arXiv Detail & Related papers (2022-06-29T19:16:48Z) - $\texttt{FedBC}$: Calibrating Global and Local Models via Federated
Learning Beyond Consensus [66.62731854746856]
In federated learning (FL), the objective of collaboratively learning a global model through aggregation of model updates across devices tends to oppose the goal of personalization via local information.
In this work, we calibrate this tradeoff in a quantitative manner through a multi-criterion-based optimization.
We demonstrate that $texttFedBC$ balances the global and local model test accuracy metrics across a suite datasets.
arXiv Detail & Related papers (2022-06-22T02:42:04Z) - Active Nearest Neighbor Regression Through Delaunay Refinement [79.93030583257597]
We introduce an algorithm for active function approximation based on nearest neighbor regression.
Our Active Nearest Neighbor Regressor (ANNR) relies on the Voronoi-Delaunay framework from computational geometry to subdivide the space into cells with constant estimated function value.
arXiv Detail & Related papers (2022-06-16T10:24:03Z) - Inception Convolution with Efficient Dilation Search [121.41030859447487]
Dilation convolution is a critical mutant of standard convolution neural network to control effective receptive fields and handle large scale variance of objects.
We propose a new mutant of dilated convolution, namely inception (dilated) convolution where the convolutions have independent dilation among different axes, channels and layers.
We explore a practical method for fitting the complex inception convolution to the data, a simple while effective dilation search algorithm(EDO) based on statistical optimization is developed.
arXiv Detail & Related papers (2020-12-25T14:58:35Z) - Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D
Edge Alignment [85.32080531133799]
This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO.
Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields.
3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
arXiv Detail & Related papers (2020-12-15T11:42:17Z) - Emulation as an Accurate Alternative to Interpolation in Sampling
Radiative Transfer Codes [7.79832534221102]
This work proposes to use emulation, i.e., approximating the RTM output by means of statistical analysis.
It is concluded that emulation can function as a fast and more accurate alternative to commonly used methods for reconstructing RTM spectral data.
arXiv Detail & Related papers (2020-12-07T10:04:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.