Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 181 records · Page 10

A Heuristic Fast Method to Solve the Nonlinear Schroedinger Equation in Fiber Bragg Gratings with Arbitrary Shape Input Pulse

Using a combination of Runge-Kutta and Jacobi iterative method, we could solve the nonlinear Schroedinger equation describing the pulse propagation in FBGs. By decomposing the electric field to forward and backward components in fiber Bragg grating and utilizing the Fourier series analysis technique, the boundary value problem of a set of coupled equations governing the pulse propagation in FBG changes to an initial condition coupled equations which can be solved by simple Runge-Kutta method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A weighted reverse Cuthill-McKee procedure for finite element method algorithms to solve strongly anisotropic electrodynamic problems

This paper presents a technique for improving the convergence rate of a generalized minimum residual (GMRES) algorithm applied for the solution of a algebraic system produced by the discretization of an electrodynamic problem with a tensorial electrical conductivity. The electrodynamic solver considered in this work is a part of a magnetohydrodynamic (MHD) code in the low magnetic Reynolds number approximation. The code has been developed for the analysis of MHD interaction during the re-entry phase of a space vehicle. This application is a promising technique intensively investigated for the shock mitigation and the vehicle control in the higher layers of a planetary atmosphere. The medium in the considered application is a low density plasma, characterized by a tensorial conductivity. This is a result of the behavior of the free electric charges, which tend to drift in a direction perpendicular both to the electric field and to the magnetic field. In the given approximation, the electrodynamics is described by an elliptical partial differential equation, which is solved by means of a finite element approach. The linear system obtained by discretizing the problem is solved by means of a GMRES iterative method with an incomplete LU factorization threshold preconditioning. The convergence of the solver appears to be strongly affected by the tensorial characteristic of the conductivity. In order to deal with this feature, the bandwidth reduction in the coefficient matrix is considered and a novel technique is proposed and discussed. First, the standard reverse Cuthill-McKee (RCM) procedure has been applied to the problem. Then a modification of the RCM procedure (the weighted RCM procedure, WRCM) has been developed. In the last approach, the reordering is performed taking into account the relation between the mesh geometry and the magnetic field direction. In order to investigate the effectiveness of the methods, two cases are considered. The RCM and WRCM procedures has successfully improved the convergence rate of the GMRES solver. For strong anisotropies, the WRCM procedure appears to have a higher convergence rate. The same behavior is shown when applying the methods to the rebuilding of an hypersonic MHD experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

SGRAPH program is considered one of the seismological programs that maintain seismic data. SGRAPH is considered unique for being able to read a wide range of data formats and manipulate complementary tools in different seismological subjects in a stand-alone Windows-based application. SGRAPH efficiently performs the basic waveform analysis and solves advanced seismological problems. The graphical user interface (GUI) utilities and the Windows facilities such as, dialog boxes, menus, and toolbars simplified the user interaction with data. SGRAPH supported the common data formats like, SAC, SEED, GSE, ASCII, and Nanometrics Y-format, and others. It provides the facilities to solve many seismological problems with the built-in inversion and modeling tools. In this paper, I discuss some of the inversion tools built-in SGRAPH related to source parameters and hypocentral location estimation. Firstly, a description of the SGRAPH program is given discussing some of its features. Secondly, the inversion tools are applied to some selected events of the Dahshour earthquakes as an example of estimating the spectral and source parameters of local earthquakes. In addition, the hypocentral location of these events are estimated using the Hypoinverse 2000 program operated by SGRAPH.

58 GEOSCIENCES↗

Solving the hard problem of Bertrand's paradox

Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article, we show that Bertrand's paradox contains two different problems: an “easy” problem and a “hard” problem. The easy problem can be solved by formulating Bertrand's question in sufficiently precise terms, so allowing for a non-ambiguous modelization of the entity subjected to the randomization. We then show that once the easy problem is settled, also the hard problem becomes solvable, provided Laplace's principle of insufficient reason is applied not to the outcomes of the experiment, but to the different possible “ways of selecting” an interaction between the entity under investigation and that producing the randomization. This consists in evaluating a huge average over all possible “ways of selecting” an interaction, which we call a universal average. Following a strategy similar to that used in the definition of the Wiener measure, we calculate such universal average and therefore solve the hard problem of Bertrand's paradox. The link between Bertrand's problem of probability theory and the measurement problem of quantum mechanics is also briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Maze solving automatons for self-healing of open interconnects: Modular add-on for circuit boards

We present the circuit board integration of a self-healing mechanism to repair open faults. The electric field driven mechanism physically restores fractured interconnects in electronic circuits and has the ability to solve mazes. The repair is performed by conductive particles dispersed in an insulating fluid. We demonstrate the integration of the healing module onto printed circuit boards and the ability of maze solving. We model and perform experiments on the influence of the geometry of conductive particles as well as the terminal impedances of the route on the healing efficiency. The typical heal rate is 10 μm/s with healed route having mean resistance of 8 kΩ across a 200 micron gap and depending on the materials and concentrations used.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust determination of the chemical potential in the pole expansion and selected inversion method for solving Kohn-Sham density functional theory

Fermi operator expansion (FOE) methods are powerful alternatives to diagonalization type methods for solving Kohn-Sham density functional theory (KSDFT). One example is the pole expansion and selected inversion (PEXSI) method, which approximates the Fermi operator by rational matrix functions and reduces the computational complexity to at most quadratic scaling for solving KSDFT. Unlike diagonalization type methods, the chemical potential often cannot be directly read off from the result of a single step of evaluation of the Fermi operator. Hence multiple evaluations are needed to be sequentially performed to compute the chemical potential to ensure the correct number of electrons within a given tolerance. This hinders the performance of FOE methods in practice. In this paper, we develop an efficient and robust strategy to determine the chemical potential in the context of the PEXSI method. The main idea of the new method is not to find the exact chemical potential at each self-consistent-field (SCF) iteration but to dynamically and rigorously update the upper and lower bounds for the true chemical potential, so that the chemical potential reaches its convergence along the SCF iteration. Instead of evaluating the Fermi operator for multiple times sequentially, our method uses a two-level strategy that evaluates the Fermi operators in parallel. In the regime of full parallelization, the wall clock time of each SCF iteration is always close to the time for one single evaluation of the Fermi operator, even when the initial guess is far away from the converged solution. We demonstrate the effectiveness of the new method using examples with metallic and insulating characters, as well as results from ab initio molecular dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An implementation of a high-order generalized finite difference method for solving the time-harmonic cold plasma wave equation in toroidal geometry

A high-order physics-informed meshless finite difference numerical technique is introduced for solving the time-harmonic cold plasma wave equation in toroidal geometries, presenting a novel application of the generalized finite difference (GFD) method to plasma wave simulations. The algorithm employs an irregular distribution of computational points, with local point density informed by the shortest wavelength derived from the cold plasma dispersion relation. Numerical stability and robustness are addressed using regularization techniques. The algorithm, implemented for two spatial dimensions, solves for the wave electric field and is demonstrated to achieve convergence rates of $\mathcal{O}$($\mathcal{h}$ $\mathcal{P}$ )⁠. Verification tests reproduce plane wave solutions, and example simulations of ion cyclotron resonance heating and electron cyclotron resonance heating demonstrate its capability, approaching realistic tokamak plasma scenarios. This work contributes to laying a foundation for the GFD method to be used in more sophisticated, optimized, and physically realistic full-wave simulations in time-harmonic plasma wave research.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Introduction of the Adding and Doubling Method for Solving Bateman Equations for Nuclear Fuel Depletion

This paper introduces and evaluates the Adding and Doubling Method (ADM) for solving the Bateman equations for depletion systems with varying numbers of nuclides and compares it to the Chebyshev Rational Approximation Method (CRAM), both implemented in the reactor physics analysis application Griffin. ADM, when applied to the Crank-Nicolson Finite Difference method, can produce results comparable in accuracy and precision to CRAM with comparable run times for systems with 35 or 297 nuclides. For systems with more than 300 nuclides, the matrix-matrix operations required by ADM are significantly more costly than the matrix-vector operations required by CRAM, making CRAM the more efficient method for systems with large numbers of nuclides. ADM is an accurate method that maintains other advantages over CRAM in that it does not depend on pre-generated coefficients or require complex number operations. ADM also manages to outperform CRAM by a factor of more than 250 in terms of run time for depletion systems that require multiple Bateman solves while the depletion matrix and time step size remain constant over all depletion intervals.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

SOLVING THE SCHROeDINGER AND DIRAC EQUATIONS FOR A HYDROGEN ATOM IN THE UNIVERSE'S STRONGEST MAGNETIC FIELDS WITH THE FREE COMPLEMENT METHOD

The free complement method for solving the Schroedinger and Dirac equations has been applied to the hydrogen atom in extremely strong magnetic fields. For very strong fields such as those observed on the surfaces of white dwarf and neutron stars, we calculate the highly accurate non-relativistic and relativistic energies of the hydrogen atom. We extended the calculations up to field strengths that exceed the strongest magnetic field ({approx}10{sup 15} G) ever observed in the universe on a magnetar surface. These are the first reported accurate quantum mechanical calculations ever to include such strong fields. Certain excited state bands in extremely strong fields showed perfect diamagnetism with an infinite number of degenerate states with the same energies as for a hydrogen atom in the absence of a field. Our method of solving the Schroedinger and Dirac equations provides an accurate theoretical methodology for studying phenomena that occur under strong magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗

PAKAL: A THREE-DIMENSIONAL MODEL TO SOLVE THE RADIATIVE TRANSFER EQUATION

We present a new numerical model called 'Pakal' intended to solve the radiative transfer equation in a three-dimensional (3D) geometry, using the approximation for a locally plane-parallel atmosphere. Pakal uses pre-calculated radial profiles of density and temperature (based on hydrostatic, hydrodynamic, or MHD models) to compute the emission from 3D source structures with high spatial resolution. Then, Pakal solves the radiative transfer equation in a set of (3D) ray paths, going from the source to the observer. Pakal uses a new algorithm to compute the radiative transfer equation by using an intelligent system consisting of three structures: a cellular automaton; an expert system; and a program coordinator. The code outputs can be either two-dimensional maps or one-dimensional profiles, which reproduce the observations with high accuracy, giving detailed physical information about the environment where the radiation was generated and/or transmitted. We present the model applied to a 3D solar radial geometry, assuming a locally plane-parallel atmosphere, and thermal free-free radio emission from hydrogen-helium gas in thermodynamic equilibrium. We also present the convergence test of the code. We computed the synthetic spectrum of the centimetric-millimetric solar emission and found better agreement with observations (up to 10{sup 4} K at 20 GHz) than previous models reported in the literature. The stability and convergence test show the high accuracy of the code. Finally, Pakal can improve the integration time by up to an order of magnitude compared against linear integration codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

AN ALGORITHM FOR RADIATION MAGNETOHYDRODYNAMICS BASED ON SOLVING THE TIME-DEPENDENT TRANSFER EQUATION

We describe a new algorithm for solving the coupled frequency-integrated transfer equation and the equations of magnetohydrodynamics in the regime that light-crossing time is only marginally shorter than dynamical timescales. The transfer equation is solved in the mixed frame, including velocity-dependent source terms accurate to O(v/c). An operator split approach is used to compute the specific intensity along discrete rays, with upwind monotonic interpolation used along each ray to update the transport terms, and implicit methods used to compute the scattering and absorption source terms. Conservative differencing is used for the transport terms, which ensures the specific intensity (as well as energy and momentum) are conserved along each ray to round-off error. The use of implicit methods for the source terms ensures the method is stable even if the source terms are very stiff. To couple the solution of the transfer equation to the MHD algorithms in the ATHENA code, we perform direct quadrature of the specific intensity over angles to compute the energy and momentum source terms. We present the results of a variety of tests of the method, such as calculating the structure of a non-LTE atmosphere, an advective diffusion test, linear wave convergence tests, and the well-known shadow test. We use new semi-analytic solutions for radiation modified shocks to demonstrate the ability of our algorithm to capture the effects of an anisotropic radiation field accurately. Since the method uses explicit differencing of the spatial operators, it shows excellent weak scaling on parallel computers.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving large scale structure in ten easy steps with COLA

We present the COmoving Lagrangian Acceleration (COLA) method: an N-body method for solving for Large Scale Structure (LSS) in a frame that is comoving with observers following trajectories calculated in Lagrangian Perturbation Theory (LPT). Unlike standard N-body methods, the COLA method can straightforwardly trade accuracy at small-scales in order to gain computational speed without sacrificing accuracy at large scales. This is especially useful for cheaply generating large ensembles of accurate mock halo catalogs required to study galaxy clustering and weak lensing, as those catalogs are essential for performing detailed error analysis for ongoing and future surveys of LSS. As an illustration, we ran a COLA-based N-body code on a box of size 100 Mpc/h with particles of mass ≈ 5 × 10{sup 9}M{sub s}un/h. Running the code with only 10 timesteps was sufficient to obtain an accurate description of halo statistics down to halo masses of at least 10{sup 11}M{sub s}un/h. This is only at a modest speed penalty when compared to mocks obtained with LPT. A standard detailed N-body run is orders of magnitude slower than our COLA-based code. The speed-up we obtain with COLA is due to the fact that we calculate the large-scale dynamics exactly using LPT, while letting the N-body code solve for the small scales, without requiring it to capture exactly the internal dynamics of halos. Achieving a similar level of accuracy in halo statistics without the COLA method requires at least 3 times more timesteps than when COLA is employed.

79 ASTRONOMY AND ASTROPHYSICS↗

Standard Model–axion–seesaw–Higgs portal inflation. Five problems of particle physics and cosmology solved in one stroke

We present a minimal extension of the Standard Model (SM) providing a consistent picture of particle physics from the electroweak scale to the Planck scale and of cosmology from inflation until today. Three right-handed neutrinos N {sub i} , a new color triplet Q and a complex SM-singlet scalar σ, whose vacuum expectation value v {sub σ} ∼ 10{sup 11} GeV breaks lepton number and a Peccei-Quinn symmetry simultaneously, are added to the SM. At low energies, the model reduces to the SM, augmented by seesaw generated neutrino masses and mixing, plus the axion. The latter solves the strong CP problem and accounts for the cold dark matter in the Universe. The inflaton is comprised by a mixture of σ and the SM Higgs, and reheating of the Universe after inflation proceeds via the Higgs portal. Baryogenesis occurs via thermal leptogenesis. Thus, five fundamental problems of particle physics and cosmology are solved at one stroke in this unified Standard Model—axion—seesaw—Higgs portal inflation (SMASH) model. It can be probed decisively by upcoming cosmic microwave background and axion dark matter experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solving Newton’s equations of motion with large timesteps using recurrent neural networks based operators

Classical molecular dynamics simulations are based on solving Newton’s equations of motion. Using a small timestep, numerical integrators such as Verlet generate trajectories of particles as solutions to Newton’s equations. We introduce operators derived using recurrent neural networks that accurately solve Newton’s equations utilizing sequences of past trajectory data, and produce energy-conserving dynamics of particles using timesteps up to 4000 times larger compared to the Verlet timestep. We demonstrate significant speedup in many example problems including 3D systems of up to 16 particles.

Newton’s equations↗

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗

Solving three-body scattering problems in the momentum lattice representation

A brief description of the novel approach toward solving few-body scattering problems in a finite-dimensional functional space of the L{sub 2} type is presented. The method is based on the complete few-body continuum discretization in the basis of stationary wave packets. This basis, being transformed to the momentum representation, leads to the cell-lattice-like discretization of the momentum space. So the initial scattering problem can be formulated on the multidimensional momentum lattice, which makes it possible to reduce the solution of any scattering problem above the breakup threshold (where the integral kernels include, in general, some complicated moving singularities) to convenient simple matrix equations that can be solved on the real energy axis. The phase shifts and inelasticity parameters for the three-body nd elastic scattering with MT I-III NN potential both below and above the three-body breakup threshold calculated with the proposed wave-packet technique are in a very good agreement with the previous accurate benchmark calculation results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Solving the nuclear pairing model with neural network quantum states

In this work, we present a variational Monte Carlo method that solves the nuclear many-body problem in the occupation number formalism exploiting an artificial neural network representation of the groundstate wave function. A memory-efficient version of the stochastic reconfiguration algorithm is developed to train the network by minimizing the expectation value of the Hamiltonian. We benchmark this approach against widely used nuclear many-body methods by solving a model used to describe pairing in nuclei for different types of interaction and different values of the interaction strength. Despite its polynomial computational cost, our method outperforms coupled-cluster and provides energies that are in excellent agreement with the numerically-exact full configuration interaction values.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗