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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

M-derivative applied to the soliton solutions for the Lakshmanan–Porsezian–Daniel equation with dual-dispersion for optical fibers

Optical dispersive soliton solutions for the fractional Lakshmanan–Porsezian–Daniel equation for optical fibers are studied in this paper considering the M-derivative of order χ. The analytical method considered here is based on the Jacobi elliptic function (JEF) anzätz method. We found new optical soliton solutions that are relevant for the dynamics inside optical fibers. Some constraints conditions arise between the parameters of the JEF soliton solutions. Typical behaviour of the soliton solutions obtained is depicted in some interesting simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Renormalization shielding and eikonal analysis on the atomic collision in dense partially ionized hydrogen plasmas

The renormalization plasma screening effects on the electron-ion collision are investigated in dense partially ionized hydrogen plasmas. The Hamilton-Jacobi and eikonal methods with the effective interaction potential are employed to obtain the eikonal scattering phase shift and eikonal cross section for the electron-ion collision. It is found that the influence of renormalization screening strongly suppresses the eikonal scattering phase shift as well as the eikonal cross section, especially, for small impact parameter regions. In addition, the renormalization screening effect reduces the total eikonal cross section in all energy domains. The variation of the renormalization effects on the electron-ion collision in dense partially ionized hydrogen plasmas is also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

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↗
DOE OSTI2021

Extended convex hull-based distributed optimal energy flow of integrated electricity-gas systems

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hull-based constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

Complex quantum Hamilton-Jacobi equation with Bohmian trajectories: Application to the photodissociation dynamics of NOCl

The complex quantum Hamilton-Jacobi equation-Bohmian trajectories (CQHJE-BT) method is introduced as a synthetic trajectory method for integrating the complex quantum Hamilton-Jacobi equation for the complex action function by propagating an ensemble of real-valued correlated Bohmian trajectories. Substituting the wave function expressed in exponential form in terms of the complex action into the time-dependent Schrödinger equation yields the complex quantum Hamilton-Jacobi equation. We transform this equation into the arbitrary Lagrangian-Eulerian version with the grid velocity matching the flow velocity of the probability fluid. The resulting equation describing the rate of change in the complex action transported along Bohmian trajectories is simultaneously integrated with the guidance equation for Bohmian trajectories, and the time-dependent wave function is readily synthesized. The spatial derivatives of the complex action required for the integration scheme are obtained by solving one moving least squares matrix equation. In addition, the method is applied to the photodissociation of NOCl. The photodissociation dynamics of NOCl can be accurately described by propagating a small ensemble of trajectories. This study demonstrates that the CQHJE-BT method combines the considerable advantages of both the real and the complex quantum trajectory methods previously developed for wave packet dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Iterative stability analysis of spatial domain decomposition based on block Jacobi algorithm for the diamond-difference scheme

Here, we study convergence of the integral transport matrix method (ITMM) based on a parallel block Jacobi (PBJ) iterative strategy for solving particle transport problems. The ITMM is a spatial domain decomposition method proposed for massively parallel computations. AFourier analysis of the PBJ-based iterations applied to SN diamond-difference equations in 1D slab and 2D Cartesian geometries is performed. It is carried out for infinite-medium problems with homogeneous material properties. To analyze the performance of the ITMM with the PBJ algorithm and evaluate its potential in scalability we consider a limiting case of one spatial cell per subdomain. The analysis shows that in such limit the spectral radius of the iteration method is one without regard to values of the scattering ratio and optical thickness of the spatial cells. This implies lack of convergence in infinite medium. Numerical results of finite-medium problems are presented. They demonstrate effects of finite size of spatial domain on the performance of the iteration algorithm as well as its asymptotic behavior when the extent of the spatial domain increases. Finally, these numerical experiments also show that for finite domains iterative convergence to a finite criterion is achievable in a multiple of the sum of number of cells in each dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

On spectral methods for solving variable-order fractional integro-differential equations

This paper applies the shifted Jacobi–Gauss collocation (SJ–G-C) method for solving variable-order fractional integro-differential equations (VO-FIDE) with initial conditions. The Riemann–Liouville fractional derivative, D{sup ν(x)}, and integral, I{sup ν(x)}, of variable order are combined, and the SJ–G-C applied to produce a system of algebraic equations. Numerical experiments demonstrate the applicability and reliability of the algorithm when compared with current methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Replicated Computational Results (RCR) Report for “Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software”

The article by Flegar et al. titled “Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software” presents a novel, practical implementation of an adaptive precision block-Jacobi preconditioner. Performance results using state-of-the-art GPU architectures for the block-Jacobi preconditioner generation and application demonstrate the practical usability of the method, compared to a traditional full-precision block-Jacobi preconditioner. A production-ready implementation is provided in the Ginkgo numerical linear algebra library. In this report, the Ginkgo library is reinstalled and performance results are generated to perform a comparison to the original results when using Ginkgo’s Conjugate Gradient solver with either the full or the adaptive precision block-Jacobi preconditioner for a suite of test problems on an NVIDIA GPU accelerator. After completing this process, the published results are deemed reproducible.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A Riccati Solution for the Ideal MHD Plasma Response with Applications to Real-time Stability Control

To effectuate near real-time feedback control of ideal MHD instabilities in a tokamak geometry, a rapid solution for stability analysis is a prerequisite. Toward this end, we reformulate the δW stability method with a Hamilton-Jacobi theory, elucidating analytical and numerical features of the generic tokamak ideal MHD stability problem. The plasma response matrix is demonstrated to be the solution of an ideal MHD matrix Riccati differential equation (MRDE). Since Riccati equations are prevalent in the control theory literature, such a shift in perspective brings to bear a range of numerical methods that are well-suited to the robust, fast solution of control problems. We discuss the usefulness of Riccati techniques in solving the stiff ODEs often encountered in ideal MHD stability analyses-—for example, in tokamak edge and stellarator physics. We then demonstrate the applicability of such methods to an existing 2D ideal MHD stability code—DCON—enabling its parallel operation in near real-time. Output is shown to match with high accuracy, and with wall-clock time ≪ 1s. Such speed may help enable active feedback ideal MHD stability control, especially in tokamak plasmas whose ideal MHD equilibria evolve with inductive timescale τ > 1s-—as in ITER.

Parallel↗
DOE OSTI2024

Native frames: An approach for separating sequential and concerted three-body fragmentation

Disentangling sequential and concerted three-body fragmentation has been a longstanding endeavor in studies of molecular dynamics. To accomplish this goal, we recently introduced a novel method to separate sequential from concerted breakup, where the sequential events are analyzed in their native frames [J. Rajput et al., Phys. Rev. Lett. 120, 103001 (2018)]. The essence of this method is the use of the Jacobi coordinates' conjugate momenta to reduce the dimensionality of the multibody fragmentation in combination with a clear signature for sequential breakup. To demonstrate this method, we employ coincidence momentum imaging to study the strong-field dissociative ionization of OCS into O + +C + + S + , which typically undergoes concerted fragmentation or sequential breakup involving either a metastable CO 2+ or CS 2+ molecule. We identify sequential breakup using a uniform distribution as a function of the angle between the conjugate momenta, associated with the first and second fragmentation steps, which is due to the rotation of the intermediate molecule in the fragmentation plane. Furthermore, by exploiting this uniform distribution, we separate the sequential and concerted distributions in any plot created from the measured momenta.

Atomic & molecular processes in external fields↗
DOE OSTI2020

Simultaneous material, shape and topology optimization

Using three design fields we develop an optimization environment that can simultaneously optimize material, shape and topology. We use the implicit representation of the boundaries with level-set functions that define the shape and topology. Differentiable R-functions allow us to combine these shapes and topology descriptions with Boolean operations. Additionally, we incorporate design dependent-stiffness materials with another design field. Notably, this framework accommodates design dependent loads, has the ability to introduce holes, and ensures the satisfaction of optimality criteria. It builds upon the fictitious domain, ersatz material, material interpolation and level-set methods. Additionally, it also borrows from parameterized density-based topology optimization methods. Since analytical sensitivities can be computed, we use efficient nonlinear programming algorithms to update the design instead of the Hamilton–Jacobi’s scheme of level-set methods. We illustrate the features of our framework by designing a cantilever beam with octet truss microlattice, a dam with design-dependent loads, and a composite clevis plate.

42 ENGINEERING↗
DOE OSTI2024

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Unified treatment of the luminosity distance in cosmology

Comparing the luminosity distance measurements to its theoretical predictions is one of the cornerstones in establishing the modern cosmology. However, as shown in Biern and Yoo, its theoretical predictions in literature are often plagued with infrared divergences and gauge-dependences. This trend calls into question the sanity of the methods used to derive the luminosity distance. Here we critically investigate four different methods—the geometric approach, the Sachs approach, the Jacobi mapping approach, and the geodesic light cone (GLC) approach to modeling the luminosity distance, and we present a unified treatment of such methods, facilitating the comparison among the methods and checking their sanity. All of these four methods, if exercised properly, can be used to reproduce the correct description of the luminosity distance.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Optimal Control with Restrictions for a Diffusion Risk Model Under Constant Interest Force

In this paper, we study optimal dividend problems in a diffusion risk model for two different cases depending on whether reinsurance is incorporated. In either case, the dividend rate is bounded above by a constant, and the company earns investment income at a constant force of interest. Unlike existing approaches in the literature dealing with optimal problems with interest, we allow the force of interest to be greater than the discount factor, and we use a different method to solve the corresponding Hamilton–Jacobi–Bellman (HJB) equation instead of introducing a confluent hypergeometric function. We conclude that the optimal dividend policy is of a threshold type and show that the corresponding dividend barrier is nondecreasing in the dividend rate bound. In cases where there is no reinsurance, we construct an auxiliary reflecting control problem to find the nonzero dividend barrier. If proportional reinsurance is purchased, the optimal reinsurance strategy looks somewhat strange. The optimal retention level of risk first increases monotonically with risk reserve to some possible value (less than 1) and then stays at level 1 for a while or, if 1 has been reached, finally, it decreases to 0.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Pseudodiagonalization Method for Accelerating Nonlinear Subspace Diagonalization in Density Functional Theory

In density functional theory, each self-consistent field (SCF) nonlinear step updates the discretized Kohn-Sham orbitals by solving a linear eigenvalue problem. The concept of pseudodiagonalization is to solve this linear eigenvalue problem approximately, and specifically utilizing a method involving a small number of Jacobi rotations that takes advantage of the good initial guess to the solution given by the approximation to the orbitals from the previous SCF iteration. The approximate solution to the linear eigenvalue problem can be very rapid, particularly for those steps near SCF convergence. Here, we adapt pseudodiagonalization to finite-temperature and metallic systems, where partially-occupied orbitals must be individually resolved with some accuracy. We apply pseudodiagonalization to the subspace eigenvalue problem that arises in Chebyshev-filtered subspace iteration. In tests on metallic and other systems for a range of temperatures, we show that pseudodiagonalization achieves similar rates of SCF convergence to exact diagonalization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗