Flow and Elastic Networks on the $\mathcal{n}$-Torus: Geometry, Analysis, and Computation
Not provided.
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not provided.
We compute the quasi-normal frequencies of scalars in asymptotically-flat microstate geometries that have the same charge as a D1-D5-P black hole, but whose long BTZ-like throat ends in a smooth cap. In general the wave equation is not separable, but we find a class of geometries in which the non-separable term is negligible and we can compute the quasi-normal frequencies using WKB methods. We argue that our results are a universal property of all microstate geometries with deeply-capped BTZ throats. These throats generate large redshifts, which lead to exceptionally-low-energy states with extremely long decay times, set by the central charge of the dual CFT to the power of twice the dimension of the operator dual to the mode. While these decay times are extremely long, we also argue that the energy decay is bounded, at large t , by (log( t )) – 2 and is comparable with the behavior of ultracompact stars, as one should expect for microstate geometries.
As computing power rapidly increases, quickly creating a representative and accurate discretization of complex geometries arises as a major hurdle towards achieving a next generation simulation capability. Component definitions may be in the form of solid (CAD) models or derived from 3D computed tomography (CT) data, and creating a surface-conformal discretization may be required to resolve complex interfacial physics. Furthermore, the Conformal Decomposition Finite Element Methods (CDFEM) has been shown to be an efficient algorithm for creating conformal tetrahedral discretizations of these implicit geometries without manual mesh generation.
For approximately four decades, Z-pinches and related geometries have been computationally modeled using unique Alternating Direction Implicit (ADI) numerical methods. Computational results have provided illuminating and often provocative interpretations of experimental results. A number of past and continuing applications are reviewed and discussed.
We compute sigma model solutions for rigidly rotating open strings suspended between giant gravitons in general LLM geometries. These solutions are confined to the LLM plane. These all have a dispersion relation for Δ - J that is consistent with saturation of a BPS bound of the centrally extended spin chain. For the special case of circularly symmetric LLM geometries, we can further evaluate the amount of angular momentum J carried by these strings. This quantity diverges for string configurations that try to move between different “coloring regions” in the LLM plane. All of these quantities have a perturbative expansion in the t’Hooft coupling. For the strings suspended between AdS giants, we can compute in field theory the leading result of J carried by the string via an analytic continuation of the SU(2) result, with the help of the Bethe Ansatz for the SL(2) sector. We thus provide additional information on how the radial direction of AdS arises from (open) spin chain calculations.
We compute, for the first time, high-order entropy-based ($M_N$) models for a linear transport equation on a one-dimensional, slab geometry. We simulate two test problems from the literature: the two-beam instability and the plane-source problem. In the former case we compute solutions for systems up to order $N=5$ ; in the latter, up to $N=15$. The most notable outcome of these results is the existence of shocks in the steady-state profiles of the two-beam instability for all odd values of $N$.
Geometries for organ scale and multiscale simulations of organ function are now routinely derived from imaging data. However, medical images may also contain spatially heterogeneous information other than geometry that are relevant to such simulations either as initial conditions or in the form of model parameters. In this manuscript, we present an algorithm for the efficient and robust mapping of such data to imaging based unstructured polyhedral grids in parallel. We then illustrate the application of our mapping algorithm to three different mapping problems: 1) the mapping of MRI diffusion tensor data to an unstuctured ventricular grid; 2) the mapping of serial cyro-section histology data to an unstructured mouse brain grid; and 3) the mapping of CT-derived volumetric strain data to an unstructured multiscale lung grid. Execution times and parallel performance are reported for each case.
We compute the Casimir interaction between a plane and a sphere, the configuration employed in the most precise experiments. The scattering formula is developed by taking a suitably chosen plane-wave and multipole basis and is valid for arbitrary values of the sphere radius, interplate distance, temperature, and arbitrary dielectric functions for both sphere and plate. Our analytical and numerical results for metallic surfaces show a nontrivial interplay between the effects of curvature, temperature, finite conductivity, and dissipation.
Here, we demonstrate the possibility of achieving enhanced frequency-selective near-field radiative heat transfer between patterned (photonic-crystal) slabs at designable frequencies and separations, exploiting a general numerical approach for computing heat transfer in arbitrary geometries and materials based on the finite-difference time-domain method. Our simulations reveal a tradeoff between selectivity and near-field enhancement as the slab-slab separation decreases, with the patterned heat transfer eventually reducing to the unpatterned result multiplied by a fill factor (described by a standard proximity approximation). We also find that heat transfer can be further enhanced at selective frequencies when the slabs are brought into a glide-symmetric configuration, a consequence of the degeneracies associated with the nonsymmorphic symmetry group.
Tailoring battery geometries is essential for many applications, as geometry influences the delivered capacity value. Two geometries, frame and conventional, have been studied and, for a given scan rate of 330C, the square frame shows a capacity value of 305,52 Ahm{sup −2}, which is 527 times higher than the one for the conventional geometry for a constant the area of all components.
We present a boundary integral equation solver for computing Taylor relaxed states in non-axisymmetric solid and shell-like toroidal geometries. The computation of Taylor states in these geometries is a key element for the calculation of stepped pressure stellarator equilibria. The integral representation of the magnetic field in this work is based on the generalized Debye source formulation, and results in a well-conditioned second-kind boundary integral equation. The integral equation solver is based on a spectral discretization of the geometry and unknowns, and the computation of the associated weakly-singular integrals is performed with high-order quadrature based on a partition of unity. The resulting scheme for applying the integral operator is then coupled with an iterative solver and suitable preconditioners. Several numerical examples are provided to demonstrate the accuracy and efficiency of our method, and a direct comparison with the leading code in the field is reported.
Purpose: This study outlines the design and fabrication techniques for two portal vein flow phantoms. Methods: A materials study was performed as a precursor to this phantom fabrication effort and the desired material properties are restated for continuity. A three-dimensional portal vein pattern was created from the Visual Human database. The portal vein pattern was used to fabricate two flow phantoms by different methods with identical interior surface geometry using computer aided design software tools and rapid prototyping techniques. One portal flow phantom was fabricated within a solid block of clear silicone for use on a table with Ultrasound or within medical imaging systems such as MRI, CT, PET, or SPECT. The other portal flow phantom was fabricated as a thin walled tubular latex structure for use in water tanks with Ultrasound imaging. Both phantoms were evaluated for usability and durability. Results: Both phantoms were fabricated successfully and passed durability criteria for flow testing in the next project phase. Conclusions: The fabrication methods and materials employed for the study yielded durable portal vein phantoms.
This is my PhD dissertation that describes two computational methods, the finite-difference frequency-domain method for general bianisotropic media and the spatially-variant lattice algorithm with the finite element method.
Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.
The nearly continuous timewise coverage of recent photometric surveys is free of the large gaps that compromise attempts to follow starspot growth and decay as well as motions, thereby giving incentive to improve computational precision for modeled spots. Due to the wide variety of star systems in the surveys, such improvement should apply to light/velocity curve models that accurately include all the main phenomena of close binaries and rotating single stars. The vector fractional area (VFA) algorithm that is introduced here represents surface elements by small sets of position vectors so as to allow accurate computation of circle-triangle overlap by spherical geometry. When computed by VFA, spots introduce essentially no noticeable scatter in light curves at the level of one part in 10,000. VFA has been put into the Wilson-Devinney light/velocity curve program and all logic and mathematics are given so as to facilitate entry into other such programs. Advantages of precise spot computation include improved statistics of spot motions and aging, reduced computation time (intrinsic precision relaxes needs for grid fineness), noise-free illustration of spot effects in figures, and help in guarding against false positives in exoplanet searches, where spots could approximately mimic transiting planets in unusual circumstances. A simple spot growth and decay template quantifies time profiles, and specifics of its utilization in differential corrections solutions are given. Computational strategies are discussed, the overall process is tested in simulations via solutions of synthetic light curve data, and essential simulation results are described. An efficient time smearing facility by Gaussian quadrature can deal with Kepler mission data that are in 30 minute time bins.
As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.