Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Jacobi Method”

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 73 records · Page 4

Compiler-Directed Transformation for Higher-Order Stencils

As the cost of data movement increasingly dominates performance, developers of finite-volume and finite-difference solutions for partial differential equations (PDEs) are exploring novel higher-order stencils that increase numerical accuracy and computational intensity. This paper describes a new compiler reordering transformation applied to stencil operators that performs partial sums in buffers, and reuses the partial sums in computing multiple results. This optimization has multiple effect son improving stencil performance that are particularly important to higher-order stencils: exploits data reuse, reduces floating-point operations, and exposes efficient SIMD parallelism to backend compilers. We study the benefit of this optimization in the context of Geometric Multigrid (GMG), a widely used method to solvePDEs, using four different Jacobi smoothers built from 7-, 13-, 27-and 125-point stencils. We quantify performance, speedup, andnumerical accuracy, and use the Roofline model to qualify our results. Ultimately, we obtain over 4× speedup on the smoothers themselves and up to a 3× speedup on the multigrid solver. Finally, we demonstrate that high-order multigrid solvers have the potential of reducing total data movement and energy by several orders of magnitude.

97 MATHEMATICS AND COMPUTING↗

Calculation of Higher Eigenpairs of the Transport Equation Using IRAM Based on Domain Decomposition

The higher eigenpairs of the neutron transport (or diffusion) equation are useful in core flux distribution reconstruction, transient analysis, stability analysis, and loading pattern optimization. There are various methods for the calculation of higher eigenpairs, such as the power iteration method with filtering technique, the Generalized Modified Power Method (GMPM), the power iteration method with innovative boundary conditions for symmetric cores, and Krylov subspace methods. In regard to Krylov subspace methods, the Implicitly Restarted Arnoldi Method (IRAM) and ORTHOMIN were implemented to calculate higher eigenpairs for both transport and diffusion equations. In Warsa's work, however, there was a significant drawback that problems with energy upscatter could not be treated efficiently. In Modak's work, the mode to which his method was likely to converge depended on the shape of initial guess flux, and only one mode could be computed each time, making it impractical for real use. Furthermore, the computational burden for higher eigenpairs is generally much larger than for only the first eigenpair, especially for neutron transport equations. Therefore, the implementation of parallel computation for higher eigenpairs is essential to improve the efficiency, and no such work has been reported in literature so far. In this summary, we propose an innovative method to calculate higher eigenpairs of the neutron transport equation based on high performance computation. In this method, 2D Matrix Method of Characteristic (MMOC) is used to discretize the neutron transport equation; IRAM is used to evaluate higher eigenpairs; spatial domain decomposition is used to realize parallel computation. The highlight of this method is using the MGMD PGMRES (Multi-Group and Multi-Domain coupled Parallel Generalized Minimal Residual Method) algorithm to simultaneously accelerate the upscatter iterations and the inner interface angular fluxes iterations, avoiding the drawback in Warsa's method and the efficiency problem of conventional Jacobi iteration. To the best of our knowledge, our work represents the first application of IRAM based on domain decomposition for higher eigenpairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The use of Jacobi wavelets for constrained approximation of rational Bézier curves

This paper presents an efficient method to solve the approximation problem of the rational Bézier curve by continuous piecewise polynomial curve in L{sub 2}-norm. For this purpose, extended Jacobi wavelets together with the Gauss–Jacobi quadrature rules are employed. The proposed technique has some advantages such as: simplicity, high accuracy and fast computation. Also, the method in the paper performs multi-degree reduction at one time and does not need the stepwise computing. Several examples are given to illustrate the effectiveness of the algorithm.

97 MATHEMATICS AND COMPUTING↗

A Block-Asynchronous Relaxation Method for Graphics Processing Units

In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time then Gauss- Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes – using multiple iterations within the ”subdomain” handled by a GPU thread block and Jacobi-like asynchronous updates across the ”boundaries”, subject to tuning various parameters – we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the effective but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.

97 MATHEMATICS AND COMPUTING↗

Rotational excitation and de-excitation of magnesium mono-sulphide (MgS) by He collisions

ABSTRACT Magnesium mono-sulphide (MgS) plays a crucial role in astrochemical processes, particularly in the interstellar medium (ISM), where metal-sulphur chemistry influences molecular formation and evolution. This work presents a detailed study of the rotational excitation and de-excitation of MgS through collisions with helium (He) atoms, the second most abundant species in the ISM after hydrogen, which includes both atomic (H) and molecular forms (H2). The focus on MgS–He collisions arises from He's high abundance, chemical inertness, and simpler electronic structure, which make it well suited for quantum scattering calculations. These characteristics establish He as an ideal candidate for initial studies, providing fundamental data for future investigations involving H2. The study uses quantum scattering methods to calculate the collisional rate coefficients over a broad temperature range. These rates are critical for interpreting observational data on MgS and predicting its abundance in space. The interaction potential between MgS and He is calculated using the rigid rotor approximation and the Jacobi coordinate system, employing the CCSD(T)-F12a/aug-cc-pVTZ method for accurate two-dimensional potential energy surface. The study explores the anisotropic nature of the MgS–He interaction, which favours odd Δj rotational transitions at low collision energies. The inelastic cross-sections for rotational transitions involving up to 16 rotational levels of MgS were computed up to 1000 cm−1, enabling the calculation of rate coefficients up to 150 K for Δj = ±1, ±2, and ± 3 rotational transitions. The results show that Δj = 1 transitions dominate at low temperatures, while Δj = 2 transitions become more significant at higher temperatures. This study provides valuable data for interpreting future astrophysical observations of MgS. The findings also propose new rotational transitions for MgS detection in space, enhancing our ability to track and study this molecule in various cosmic environments.

Hendaoui, Hamza (ORCID:0000000218641872)↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

Stochastic quasi-steady state approximations for asymptotic solutions of the chemical master equation

In this paper, we propose two methods to carry out the quasi-steady state approximation in stochastic models of enzyme catalytic regulation, based on WKB asymptotics of the chemical master equation or of the corresponding partial differential equation for the generating function. The first of the methods we propose involves the development of multiscale generalisation of a WKB approximation of the solution of the master equation, where the separation of time scales is made explicit which allows us to apply the quasi-steady state approximation in a straightforward manner. To the lowest order, the multi-scale WKB method provides a quasi-steady state, Gaussian approximation of the probability distribution. The second method is based on the Hamilton-Jacobi representation of the stochastic process where, as predicted by large deviation theory, the solution of the partial differential equation for the corresponding characteristic function is given in terms of an effective action functional. The optimal transition paths between two states are then given by those paths that maximise the effective action. Such paths are the solutions of the Hamilton equations for the Hamiltonian associated to the effective action functional. The quasi-steady state approximation is applied to the Hamilton equations thus providing an approximation to the optimal transition paths and the transition time between two states. Using this approximation we predict that, unlike the mean-field quasi-steady approximation result, the rate of enzyme catalysis depends explicitly on the initial number of enzyme molecules. The accuracy and validity of our approximated results as well as that of our predictions regarding the behaviour of the stochastic enzyme catalytic models are verified by direct simulation of the stochastic model using Gillespie stochastic simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State-resolved differential and integral cross sections for the Ne + H{sub 2}{sup +} (v = 0–2, j = 0) → NeH{sup +} + H reaction

State-to-state quantum dynamic calculations for the proton transfer reaction Ne + H{sub 2}{sup +} (v = 0–2, j = 0) are performed on the most accurate LZHH potential energy surface, with the product Jacobi coordinate based time-dependent wave packet method including the Coriolis coupling. The J = 0 reaction probabilities for the title reaction agree well with previous results in a wide range of collision energy of 0.2-1.2 eV. Total integral cross sections are in reasonable agreement with the available experiment data. Vibrational excitation of the reactant is much more efficient in enhancing the reaction cross sections than translational and rotational excitation. Total differential cross sections are found to be forward-backward peaked with strong oscillations, which is the indication of the complex-forming mechanism. As the collision energy increases, state-resolved differential cross section changes from forward-backward symmetric peaked to forward scattering biased. This forward bias can be attributed to the larger J partial waves, which makes the reaction like an abstraction process. Differential cross sections summed over two different sets of J partial waves for the v = 0 reaction at the collision energy of 1.2 eV are plotted to illustrate the importance of large J partial waves in the forward bias of the differential cross sections.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-gaussian signatures of general inflationary trajectories

We carry out a numerical calculation of the bispectrum in generalised trajectories of canonical, single-field inflation. The trajectories are generated in the Hamilton-Jacobi (HJ) formalism based on Hubble Slow Roll (HSR) parameters. The calculation allows generally shape and scale dependent bispectra, or dimensionless f{sub NL}, in the out-of-slow-roll regime. The distributions of f{sub NL} for various shapes and HSR proposals are shown as an example of how this procedure can be used within the context of Monte Carlo exploration of inflationary trajectories. We also show how allowing out-of-slow-roll behaviour can lead to a bispectrum that is relatively large for equilateral shapes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ZERNIPAX: A fast and accurate Zernike polynomial calculator in Python

Zernike polynomials serve as an orthogonal basis on the unit disc, and have proven to be effective in optics simulations, astrophysics, and more recently in plasma simulations. Unlike Bessel functions, Zernike polynomials are inherently finite and smooth at the disc center (r=0), ensuring continuous differentiability along the axis. This property makes them particularly suitable for simulations, requiring no additional handling at the origin. We developed ZERNIPAX, an open-source Python package capable of utilizing CPU/GPUs, leveraging Google's JAX package and available on GitHub as well as the Python software repository PyPI. Furthermore, our implementation of the recursion relation between Jacobi polynomials significantly improves computation time compared to alternative methods by use of parallel computing while still performing more accurately for high-mode numbers.

Astrophysics↗

Physics Integration KErnels (PIKE)

Pike is a software library for coupling and solving multiphysics applications. It provides basic interfaces and utilities for performing code-to-code coupling. It provides simple "black-box" Picard iteration methods for solving the coupled system of equations including Jacobi and Gauss-Seidel solvers. Pike was developed originally to couple neutronics and thermal fluids codes to simulate a light water nuclear reactor for the Consortium for Simulation of Light-water Reactors (CASL) DOE Energy Innovation Hub. The Pike library contains no physics and just provides interfaces and utilities for coupling codes. It will be released open source under a BSD license as part of the Trilinos solver framework (trilinos.org) which is also BSD. This code provides capabilities similar to other open source multiphysics coupling libraries such as LIME, AMP, and MOOSE.

Pawlowski, Roger↗

Physics Integration KErnels (PIKE)

Pike is a software library for coupling and solving multiphysics applications. It provides basic interfaces and utilities for performing code-to-code coupling. It provides simple "black-box" Picard iteration methods for solving the coupled system of equations including Jacobi and Gauss-Seidel solvers. Pike was developed originally to couple neutronics and thermal fluids codes to simulate a light water nuclear reactor for the Consortium for Simulation of Light-water Reactors (CASL) DOE Energy Innovation Hub. The Pike library contains no physics and just provides interfaces and utilities for coupling codes. It will be released open source under a BSD license as part of the Trilinos solver framework (trilinos.org) which is also BSD. This code provides capabilities similar to other open source multiphysics coupling libraries such as LIME, AMP, and MOOSE.

Pawlowski, Roger↗

An updated Lagrangian discontinuous Galerkin hydrodynamic method for gas dynamics

Here, we present a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method for gas dynamics. The new method evolves conserved unknowns in the current configuration, which obviates the Jacobi matrix that maps the element in a reference coordinate system or the initial coordinate system to the current configuration. The density, momentum, and total energy (ρ, ρu, E ) are approximated with conservative higher-order Taylor expansions over the element and are limited toward a piecewise constant field near discontinuities using a limiter. Two new limiting methods are presented for enforcing the bounds on the primitive variables of density, velocity, and specific internal energy (ρ, u, e). The nodal velocity, and the corresponding forces, are calculated by solving an approximate Riemann problem at the element nodes. An explicit second-order method is used to temporally advance the solution. This new Lagrangian DG hydrodynamic method conserves mass, momentum, and total energy. 1D Cartesian coordinates test problem results are presented to demonstrate the accuracy and convergence order of the new DG method with the new limiters.

97 MATHEMATICS AND COMPUTING↗

Hamilton–Jacobi analysis for three dimensional gravity without dynamics

Highlights: •We report the HJ. analysis for three dimensional gravity without dynamics. •We report the complete set of Hamiltonians. •The characteristic equations are reported. •The canonical covariant method is performed. •A closed and gauge invariant symplectic structure is constructed. -- Abstract: The Hamilton–Jacobi analysis for gravity without dynamics is performed. We report a detailed analysis where the complete set of Hamilton–Jacobi constraints, the characteristic equations and the gauge transformations of the theory are found. We compare our results with those reported in the literature where alternative approaches are used. In addition, we complete our work by performing the canonical covariant analysis by constructing a gauge invariant symplectic structure, and we find a full consistency between the results obtained from both approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Full-sky formulae for weak lensing power spectra from total angular momentum method

We systematically derive full-sky formulae for the weak lensing power spectra generated by scalar, vector and tensor perturbations from the total angular momentum (TAM) method. Based on both the geodesic and geodesic deviation equations, we first give the gauge-invariant expressions for the deflection angle and Jacobi map as observables of the CMB lensing and cosmic shear experiments. We then apply the TAM method, originally developed in the theoretical studies of CMB, to a systematic derivation of the angular power spectra. The TAM representation, which characterizes the total angular dependence of the spatial modes projected along a line-of-sight, can carry all the information of the lensing modes generated by scalar, vector, and tensor metric perturbations. This greatly simplifies the calculation, and we present a complete set of the full-sky formulae for angular power spectra in both the E-/B-mode cosmic shear and gradient-/curl-mode lensing potential of deflection angle. Based on the formulae, we give illustrative examples of non-vanishing B-mode cosmic shear and curl-mode of deflection angle in the presence of the vector and tensor perturbations, and explicitly compute the power spectra.

79 ASTRONOMY AND ASTROPHYSICS↗

Large Deviations and Importance Sampling for Systems of Slow-Fast Motion

In this paper we develop the large deviations principle and a rigorous mathematical framework for asymptotically efficient importance sampling schemes for general, fully dependent systems of stochastic differential equations of slow and fast motion with small noise in the slow component. We assume periodicity with respect to the fast component. Depending on the interaction of the fast scale with the smallness of the noise, we get different behavior. We examine how one range of interaction differs from the other one both for the large deviations and for the importance sampling. We use the large deviations results to identify asymptotically optimal importance sampling schemes in each case. Standard Monte Carlo schemes perform poorly in the small noise limit. In the presence of multiscale aspects one faces additional difficulties and straightforward adaptation of importance sampling schemes for standard small noise diffusions will not produce efficient schemes. It turns out that one has to consider the so called cell problem from the homogenization theory for Hamilton-Jacobi-Bellman equations in order to guarantee asymptotic optimality. We use stochastic control arguments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗