اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدApproximate Reconstruction of Torsional Potential Energy Surface based on Voronoi Tessellation
58
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Torsional modes within a complex molecule containing various functional groups are often strongly coupled so that the harmonic approximation and one-dimensional torsional treatment are inaccurate to evaluate their partition functions. A family of multi-structural approximation methods have been proposed and applied in recent years to deal with the torsional anharmonicity.However, these methods approximate the exact almost periodic potential energy as a summation of local periodic functions with symmetric barrier positions and heights. In the present theoretical study, we illustrated that the approximation is inaccurate when torsional modes present non-uniformly distributed local minima. Thereby, we proposed an improved method to reconstruct approximate potential to replace the periodic potential by using information of the local minima and their Voronoi tessellation. First, we established asymmetric barrier heights by introducing two periodicity parameters and assuming that the exact barrier positions are at the boundaries of Voronoi cells. Second, we used multiplicatively weighted Voronoi tessellation to refine the barrier heights and positions by defining a structure-related distance metric. The proposed method has been tested for a few higher-dimensional cases, all of which show promising improved accuracy.
قيم البحث
اقرأ أيضاً
We present a new open source code for massive parallel computation of Voronoi tessellations(VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Vo
ronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid.
We present a Bayesian Voronoi image reconstruction technique (VIR) for interferometric data. Bayesian analysis applied to the inverse problem allows us to derive the a-posteriori probability of a novel parameterization of interferometric images. We u
se a variable Voronoi diagram as our model in place of the usual fixed pixel grid. A quantization of the intensity field allows us to calculate the likelihood function and a-priori probabilities. The Voronoi image is optimized including the number of polygons as free parameters. We apply our algorithm to deconvolve simulated interferometric data. Residuals, restored images and chi^2 values are used to compare our reconstructions with fixed grid models. VIR has the advantage of modeling the image with few parameters, obtaining a better image from a Bayesian point of view.
Achieving accurate and robust global situational awareness of a complex time-evolving field from a limited number of sensors has been a longstanding challenge. This reconstruction problem is especially difficult when sensors are sparsely positioned i
n a seemingly random or unorganized manner, which is often encountered in a range of scientific and engineering problems. Moreover, these sensors can be in motion and can become online or offline over time. The key leverage in addressing this scientific issue is the wealth of data accumulated from the sensors. As a solution to this problem, we propose a data-driven spatial field recovery technique founded on a structured grid-based deep-learning approach for arbitrary positioned sensors of any numbers. It should be noted that the naive use of machine learning becomes prohibitively expensive for global field reconstruction and is furthermore not adaptable to an arbitrary number of sensors. In the present work, we consider the use of Voronoi tessellation to obtain a structured-grid representation from sensor locations enabling the computationally tractable use of convolutional neural networks. One of the central features of the present method is its compatibility with deep-learning based super-resolution reconstruction techniques for structured sensor data that are established for image processing. The proposed reconstruction technique is demonstrated for unsteady wake flow, geophysical data, and three-dimensional turbulence. The current framework is able to handle an arbitrary number of moving sensors, and thereby overcomes a major limitation with existing reconstruction methods. The presented technique opens a new pathway towards the practical use of neural networks for real-time global field estimation.
The typical cell of a Voronoi tessellation generated by $n+1$ uniformly distributed random points on the $d$-dimensional unit sphere $mathbb S^d$ is studied. Its $f$-vector is identified in distribution with the $f$-vector of a beta polytope generate
d by $n$ random points in $mathbb R^d$. Explicit formulae for the expected $f$-vector are provided for any $d$ and the low-dimensional cases $din{2,3,4}$ are studied separately. This implies an explicit formula for the total number of $k$-dimensional faces in the spherical Voronoi tessellation as well.
The time-dependent radiation transport equation is discretized using the meshless-local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends o
n the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. Results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
