Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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 451 records · Page 25

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems↗

Discontinuous Galerkin sparse grids methods for time domain Maxwell’s equations

In this paper, we present a time-explicit sparse grid discontinuous Galerkin method for solving the three-dimensional time-domain Maxwell equations. The conservation properties and convergence rates are established for different choices of numerical fluxes. The convergence rates are proved theoretically and then verified by several numerical examples. Even though our scheme does not preserve the divergence, but by implying the higher order polynomial, one can observe the same convergence rate as numerical solution. Several numerical tests are presented to validate these conclusions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Leveraging Multitime Hamilton–Jacobi PDEs for Certain Scientific Machine Learning Problems

Hamilton-Jacobi partial differential equations (HJ PDEs) have deep connections with a wide range of fields, including optimal control, differential games, and imaging sciences. By considering the time variable to be a higher dimensional quantity, HJ PDEs can be extended to the multi-time case. In this paper, we establish a novel theoretical connection between specific optimization problems arising in machine learning and the multi-time Hopf formula, which corresponds to a representation of the solution to certain multi-time HJ PDEs. Through this connection, we increase the interpretability of the training process of certain machine learning applications by showing that when we solve these learning problems, we also solve a multi-time HJ PDE and, by extension, its corresponding optimal control problem. As a first exploration of this connection, we develop the relation between the regularized linear regression problem and the Linear Quadratic Regulator (LQR). We then leverage our theoretical connection to adapt standard LQR solvers (namely, those based on the Riccati ordinary differential equations) to design new training approaches for machine learning. Lastly, we provide some numerical examples that demonstrate the versatility and possible computational advantages of our Riccati-based approach in the context of continual learning, post-training calibration, transfer learning, and sparse dynamics identification.

97 MATHEMATICS AND COMPUTING↗

Validation of a High-Order Prefactored Compact Scheme on Nonlinear Flows with Complex Geometries

Three benchmark problems are solved using a sixth-order prefactored compact scheme employing an explicit 10th-order filter with optimized fourth-order Runge-Kutta time stepping. The problems solved are the following: (1) propagation of sound waves through a transonic nozzle; (2) shock-sound interaction; and (3) single airfoil gust response. In the first two problems, the spatial accuracy of the scheme is tested on a stretched grid, and the effectiveness of boundary conditions is shown. The solution stability and accuracy near a shock discontinuity is shown as well. Also, 1-D nonlinear characteristic boundary conditions will be evaluated. In the third problem, a nonlinear Euler solver will be used that solves the equations in generalized curvilinear coordinates using the chain rule transformation. This work, continuing earlier work on flat-plate cascades and Joukowski airfoils, will focus mainly on the effect of the grid and boundary conditions on the accuracy of the solution. The grids were generated using a commercially available grid generator, GridPro/az3000.

Hixon, Ray↗

Development and verification of global/local analysis techniques for laminated composites

A two-dimensional to three-dimensional global/local finite element approach was developed, verified, and applied to a laminated composite plate of finite width and length containing a central circular hole. The resulting stress fields for axial compression loads were examined for several symmetric stacking sequences and hole sizes. Verification was based on comparison of the displacements and the stress fields with those accepted trends from previous free edge investigations and a complete three-dimensional finite element solution of the plate. The laminates in the compression study included symmetric cross-ply, angle-ply and quasi-isotropic stacking sequences. The entire plate was selected as the global model and analyzed with two-dimensional finite elements. Displacements along a region identified as the global/local interface were applied in a kinematically consistent fashion to independent three-dimensional local models. Local areas of interest in the plate included a portion of the straight free edge near the hole, and the immediate area around the hole. Interlaminar stress results obtained from the global/local analyses compares well with previously reported trends, and some new conclusions about interlaminar stress fields in plates with different laminate orientations and hole sizes are presented for compressive loading. The effectiveness of the global/local procedure in reducing the computational effort required to solve these problems is clearly demonstrated through examination of the computer time required to formulate and solve the linear, static system of equations which result for the global and local analyses to those required for a complete three-dimensional formulation for a cross-ply laminate. Specific processors used during the analyses are described in general terms. The application of this global/local technique is not limited software system, and was developed and described in as general a manner as possible.

Thompson, Danniella Muheim↗

Multistage Electrophoretic Separators

A multistage electrophoresis apparatus has been invented for use in the separation of cells, protein molecules, and other particles and solutes in concentrated aqueous solutions and suspensions. The design exploits free electrophoresis but overcomes the deficiencies of prior free-electrophoretic separators by incorporating a combination of published advances in mathematical modeling of convection, sedimentation, electro-osmotic flow, and the sedimentation and aggregation of droplets. In comparison with other electrophoretic separators, these apparatuses are easier to use and are better suited to separation in relatively large quantities characterized in the art as preparative (in contradistinction to smaller quantities characterized in the art as analytical). In a multistage electrophoretic separator according to the invention, an applied vertical steady electric field draws the electrically charged particles of interest from within a cuvette to within a collection cavity that has been moved into position of the cuvette. There are multiple collection cavities arranged in a circle; each is aligned with the cuvette for a prescribed short time. The multistage, short-migration-path character of the invention solves, possibly for the first time, the fluid-instability problems associated with free electrophoresis. The figure shows a prototype multistage electrophoretic separator that includes four sample stations and five collection stages per sample. At each sample station, an aqueous solution or suspension containing charged species to be separated is loaded into a cuvette, which is machined into a top plate. The apparatus includes a lower plate, into which 20 collection cavities have been milled. Each cavity is filled with an electrophoresis buffer solution. For the collection of an electrophoretic fraction, the lower plate is rotated to move a designated collection cavity into alignment with the opening of the cuvette. An electric field is then applied between a non-gassing electrode in the collection cavity and an electrolyte compartment, which is separated from the cuvette by a semipermeable membrane. The electrolyte is refreshed by circulation by use of a peristaltic pump. In subsequent steps, the lower plate is rotated to collect other electrophoretic fractions. Later, the collected fractions are removed from the collection cavities through ports that have threaded plugs. The base of the apparatus contains power supplies and a computer interface. The design includes provisions for monitoring and feedback control of cavity position, electric field, and temperature. The operation of the apparatus can easily be automated, as demonstrated by use of software that has already been written for this purpose.

Thomas, Nathan↗

Time-domain Green's Function Method for three-dimensional nonlinear subsonic flows

The Green's Function Method for linearized 3D unsteady potential flow (embedded in the computer code SOUSSA P) is extended to include the time-domain analysis as well as the nonlinear term retained in the transonic small disturbance equation. The differential-delay equations in time, as obtained by applying the Green's Function Method (in a generalized sense) and the finite-element technique to the transonic equation, are solved directly in the time domain. Comparisons are made with both linearized frequency-domain calculations and existing nonlinear results.

Tseng, K.↗

Youth Technology Academy

One of the most important aspects of the YTA Program is that students, working with Tri-C instructors, NASA engineers, and technicians, begin to build relationships with professionals with whom they might not normally have contact. These professionals serve as role models for students and help them to apply math, science and problem-solving skills in real time to construct a competition-ready robot, allowing them to experience the satisfaction and challenges of an engineering or technical career by working diligently to solve problems that may never have been thought possible to solve. Transcending school boundaries, YTA is available to all students who are interested and qualified but who may otherwise never get an opportunity to participate because their school does not offer a robotics program. YTA fills an educational void by offering an exciting engineering and technology experience to a greater number of students than have been able to participate in the past. Our students have been working hard and see the long-term rewards for their efforts. The YTA Team 1270 was a finalist at the 2005 FIRST Robotics Florida Regional and took home second- place honors. Mark Poljak, nominated by the students of YTA Team 1270, received the Woodie Flowers Award at the FIRST 2005 Buckeye Regional competition. This award celebrates effective communication in the art and science of engineering and design. The YTA Team was also invited, as one of fifty-four teams, to participate in this year s FIRST VEX Robotics tournament representing Cuyahoga Community College and NASA GRC (Team 26), held at the FIRST Robotics National Competition in Atlanta, GA. Because of our efforts, community colleges from around the country have taken notice and have asked us to become part of the executive board of the RoboEducators, whose mission is to bring technology training to high school students in preparation for the future workforce.

Source record↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Gust Acoustic Response of a Swept Rectilinear Cascade Using The Space-Time CE/SE Method

The benchmark problem 3 in Category 3 of the third Computational Aero-Acoustics (CAA) Workshop sponsored by NASA Glenn Research Center is solved using the space-time conservation element and solution element (CE/SE) method. This problem concerns the unsteady response of a rectilinear swept cascade to an incident gust. The acoustic field generated by the interaction of the gust with swept at plates in the cascade is computed by solving the 3D nonlinear Euler equations using the space-time CE/SE method. A parallel version of the 3D CE/SE Euler solver is employed to obtain numerical solutions for several sweep angles. Numerical solutions are presented and compared with the analytical solutions.

Wang, X. Y.↗

Computational aeroacoustics on massively parallel computers

A computational fluid dynamics (CFD) technique is employed to solve aeroacoustics problems on massively parallel computers. The algorithm is based on a 4th order accurate central finite difference and 4th order accurate 4-stage Runge-Kutta time integration method that solves the 3-D full Navier-Stokes/Euler equations on a curvilinear coordinate system. The code has been developed to predict noise radiation from ducted fans. A specific application of this code is made here to the oscillating circular piston problem (Workshop Category 4, Problem 2) by solving the full Euler equations with nonreflecting boundary conditions in the axisymmetric mode. The features of the code that apply to this particular problem are described in this paper.

Oezyoeruek, Yusuf↗

The LISE package: solvers for static and time-dependent superfluid local density approximation equations in three dimensions

Nuclear implementation of the density functional theory (DFT) is at present the only microscopic framework applicable to the whole nuclear landscape. The extension of DFT to superfluid systems in the spirit of the Kohn-Sham approach, the superfluid local density approximation (SLDA) and its extension to time-dependent situations, time-dependent superfluid local density ap- proximation (TDSLDA), have been extensively used to describe various static and dynamical problems in nuclear physics, neutron star crust, and cold atom systems. In this paper, we present the codes that solve the static and time-dependent SLDA equations in three-dimensional coordinate space without any symmetry restriction. These codes are fully parallelized with the message passing interface (MPI) library and take advantage of graphic processing units (GPU) for accelerating execution. The dynamic codes have checkpoint/restart capabilities and for initial conditions one can use any generalized Slater determinant type of wave function. The code can describe a large number of physical problems: nuclear fission, collisions of heavy ions, the interaction of quantized vor- tices with nuclei in the nuclear star crust, excitation of superfluid fermion systems by time dependent external fields, quantum shock waves, domain wall generation and propagation, the dynamics of the Anderson-Bogoliubov-Higgs mode, dynamics of fragmented condensates, vortex rings dynamics, generation and dynamics of quantized vortices, their crossing and recombinations and the incipient phases of quantum turbulence.

Jin, Shi↗

Laminar and turbulent flows over a spherically blunted cone with massive surface blowing

Numerical solutions are presented for the flow over a spherically blunted cone with massive surface blowing. Time-dependent viscous shock layer equations are used to describe the flowfield. The boundary conditions on the body surface include a prescribed blowing rate distribution. The governing equations are solved by a time-asymptotic finite-difference method. Results presented here are only for a perfect gas-type flow at zero angle of attack. Both laminar and turbulent flow solutions are obtained. It is found that the surface blowing smooths out the effect of the curvature discontinuity at the sphere-cone juncture point on the laminar flowfield and results in a negative pressure gradient over the body. The shock slope increases on the downstream portion of the body as the surface blowing rate is increased. The turbulent flow with surface blowing is found to redevelop a boundary-layer-like region near the surface. The effects of this boundary-layer-like region on the flowfield and heating rates are discussed.

Kumar, A.↗

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗

Circuit transients due to negative bias arcs on a high-voltage solar array in low Earth orbit

Arcing to negatively biased, exposed solar cell interconnects on solar arrays placed in plasma environments was established. Arcing, however, may cause damaging interference with the operation of electrical power systems in spacecraft planned to be driven with high-voltage solar arrays. An analytical model was developed to estimate the effects of netagive bias arcs on solar array power system performance. Solar cell characteristics, plasma interactions, and power system features are modeled by a linear, lumped element transient circuit, and the time domain equations are solved. Numerical results for solar array common mode and load voltage transients are calculated for typical conditions. Acceptable load transients are found for a range of arc current amplitudes and time constants.

Metz, R. N.↗

An adaptive grid, unsteady model for two-dimensional magnetohydrodynamic (MHD) flow

An adaptive grid finite difference method for solving multi-dimensional, time-dependent, magnetohydrodynamic (MHD) equations is developed. The method is capable of solving problems that include high gradients due to geometry, propagation of shock waves and unsteady boundary conditions. The grid generation technique is based on variational principles with direct control over grid concentration, smoothness and skewness. An example for a two-dimensional MHD simulation of the propagation of a solar-flare-generated shock wave in solar wind flow in the heliographic equatorial plane is selected for illustration of this method.

Panitchob, Supat↗

Intelligent data management for real-time spacecraft monitoring

Real-time AI systems have begun to address the challenge of restructuring problem solving to meet real-time constraints by making key trade-offs that pursue less than optimal strategies with minimal impact on system goals. Several approaches for adapting to dynamic changes in system operating conditions are known. However, simultaneously adapting system decision criteria in a principled way has been difficult. Towards this end, a general technique for dynamically making such trade-offs using a combination of decision theory and domain knowledge has been developed. Multi-attribute utility theory (MAUT), a decision theoretic approach for making one-time decisions is discussed and dynamic trade-off evaluation is described as a knowledge-based extension of MAUT that is suitable for highly dynamic real-time environments, and provides an example of dynamic trade-off evaluation applied to a specific data management trade-off in a real-world spacecraft monitoring application.

Schwuttke, Ursula M.↗