Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Jacobi”

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.

At least 271 records · Page 15

Deformed $w_{1+\infty}$ Algebras in the Celestial CFT

We compute the modification of the w 1+∞ algebra of soft graviton, gluon and scalar currents in the celestial CFT due to non-minimal couplings. We find that the Jacobi identity is satisfied only when the spectrum and couplings of the theory obey certain constraints. We comment on the similarities and essential differences of this algebra to W 1+∞ .

97 MATHEMATICS AND COMPUTING↗

Chemical Abundances of Planetary Nebulae in the Bulge and Disk of M31

We derive abundances and central star parameters for 15 planetary nebulae (PNe) in M31: 12 in the bulge and 3 in a disk field 14 kpc from the nucleus. No single abundance value characterizes the bulge stars: although the median abundances of the sample are similar to those seen for PNe in the LMC, the distribution of abundances is several times broader, spanning over 1 decade. None of the PNe in our sample approach the super metal-rich ([Fe/H] approximately 0.25) expectations for the bulge of M31, although a few PNe in the sample of Stasinska, Richer, & Mc Call (1998) come close. This [O/H] vs [Fe/H] discrepancy is likely due to a combination of factors, including an inability of metal-rich stars to produce bright PNe, a luminosity selection effect, and an abundance gradient in the bulge of M31. We show that PNe that are near the bright limit of the [O III] lambda.5007 planetary nebula luminosity function (PNLF) span nearly a decade in oxygen abundance, and thus, support the use of the PNLF for deriving distances to galaxies (Jacoby 1996) with differing metallicities. We also identify a correlation between central star mass and PN dust formation that partially alleviates any dependence of the PNLF maximum magnitude on population age. Additionally, we identify a spatially compact group of 5 PNe having unusually high O/H; this subgroup may arise from a recent merger, but velocity information is needed to assess the true nature of the objects.

Jacoby, George H.↗

Actively Cooled SLMS(TM) Technology for HEL Applications

Mr. Jacoby is the Chief Scientist for Schafer's Lightweight Optical Systems business area with twenty four years experience in laser and optical systems for space and military applications. He and colleague Dr. Goodman conceived and developed Silicon Lightweight Mirrors (SLMS(TM)) technologies for space applications from the extreme UV to FAR IR wavelengths. Schafer has demonstrated two different methods for actively cooling our Silicon Lightweight Mirrors (SLMS(TM)) technology. Direct internal cooling was accomplished by flowing liquid nitrogen through the continuous open cell core of the SLMS(TM) mirror. Indirect external cooling was accomplished by flowing liquid nitrogen through a CTE matched Cesic square-tube manifold that was bonded to the back of the mirror in the center. Testing was done in the small 4-foot thermal/vacuum chamber located at the NASA/MSFC X-Ray Calibration Facility. Seven thermal diodes were located over the front side of the 5 inch diameter mirror and one was placed on the outlet side of the Cesic manifold. Results indicate that the mirror reaches steady state at 82K in less than four minutes for both cooling methods. The maximum temperature difference of the eight diodes was less than 200 mK when the mirror was internally cooled and covered with MLI to insulate it from the large 300 K aluminum plate that was used to mount it.

Jacoby, Marc T.↗

Nonlinear integrable ion traps

Quadrupole ion traps can be transformed into nonlinear traps with integrable motion by adding special electrostatic potentials. This can be done with both stationary potentials (electrostatic plus a uniform magnetic field) and with time-dependent electric potentials. These potentials are chosen such that the single particle Hamilton-Jacobi equations of motion are separable in some coordinate systems. The electrostatic potentials have several free adjustable parameters allowing for a quadrupole trap to be transformed into, for example, a double-well or a toroidal-well system. The particle motion remains regular, non-chaotic, integrable in quadratures, and stable for a wide range of parameters. We present two examples of how to realize such a system in case of a time-independent (the Penning trap) as well as a time-dependent (the Paul trap) configuration.

43 PARTICLE ACCELERATORS↗

Large language model evaluation for high–performance computing software development

We apply AI-assisted large language model (LLM) capabilities of GPT-3 targeting high-performance computing (HPC) kernels for (i) code generation, and (ii) auto-parallelization of serial code in C ++, Fortran, Python and Julia. Our scope includes the following fundamental numerical kernels: AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG, and language/programming models: (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). Kernel implementations are generated using GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code given simple + + prompt variants. To quantify and compare the generated results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. For auto-parallelization, we use ChatGPT interactively giving simple prompts as in a dialogue with another human including simple “prompt engineering” follow ups. Results suggest that correct outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding language keywords, while Julia prompts perform acceptably well for its Threads and CUDA.jl programming models. Finally, we expect to provide an initial quantifiable point of reference for code generation in each programming model using a state-of-the-art LLM. Overall, understanding the convergence of LLMs, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

97 MATHEMATICS AND COMPUTING↗

Smoothed aggregation for difficult stretched mesh and coefficient variation problems

Abstract Four adaptations of the smoothed aggregation algebraic multigrid (SA‐AMG) method are proposed with an eye toward improving the convergence and robustness of the solver in situations when the discretization matrix contains many weak connections. These weak connections can cause higher than expected levels of fill‐in within the coarse discretization matrices and can also give rise to suboptimal smoothing within the prolongator smoothing phase. These smoothing drawbacks are due to the relatively small size of some diagonal entries within the filtered matrix that one obtains after dropping the weak connections. The new algorithms consider modifications to the Jacobi‐like step that defines the prolongator smoother, modifications to the filtered matrix, and also direct modifications to the resulting grid transfer operators. Numerical results are given illustrating the potential benefits of the proposed adaptations.

Hu, Jonathan J.↗

Weighted relaxation for multigrid reduction in time

Current trends in computer architectures now mean that faster computation speed must come primarily from increased concurrency, not faster clock speeds, which are stagnating. Thus, this situation creates bottlenecks for serial algorithms, including the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. Here, in this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that by choosing appropriate non-unitary relaxation weights, one can achieve faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%–20% saving in iterations, which is significant when using large high-performance computers. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.

97 MATHEMATICS AND COMPUTING↗

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗

Modeling curved interfaces without element‐partitioning in the extended finite element method

Summary In this paper, we model holes and material interfaces (weak discontinuities) in two‐dimensional linear elastic continua using the extended finite element method on higher‐order (spectral) finite element meshes. Arbitrary parametric curves such as rational Bézier curves and cubic Hermite curves are adopted in conjunction with the level set method to represent curved interfaces. Efficient computation of weak form integrals with polynomial integrands is realized via the homogeneous numerical integration scheme—a method that uses Euler's homogeneous function theorem and Stokes' theorem to reduce integration to the boundary of the domain. Numerical integration on cut elements requires the evaluation of a one‐dimensional integral over a parametric curve, and hence, the need to partition curved elements is eliminated. To improve stiffness matrix conditioning, ghost penalty stabilization and the Jacobi preconditioner are used. For material interface problems, we develop an enrichment function that captures weak discontinuities on spectral meshes. Taken together, we show through numerical experiments that these advances deliver optimal algebraic rates of convergence with h ‐refinement ( p =1,2,…,5) and exponential rates of convergence with p ‐refinement ( p =1,2,…,7) for elastostatic problems with holes and material inclusions on Cartesian p th‐order spectral finite element meshes.

Chin, Eric B.↗