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 127 records · Page 7

In Situ Measurements of N2O and CH4 During SOLVE on the ER-2 Using a New Tunable Diode Laser Instrument

This report is the final report for Cooperative Agreement NCC2-1105: 'In Situ Measurements of N2O and CH4 during SOLVE on the ER-2 using a new tunable diode laser instrument.' The tasks outlined in the proposal are listed below with a brief comment. The publications and the conference presentations are listed. Finally the important publications are attached. The Cooperative Agreement made possible a research effort to produce high precision and high accuracy in situ measurements of methane and nitrous oxide on the ER-2 during the SOLVE field campaign and to analyze these measurements. These measurements of CH4 and N2O were of utmost importance to studies of the ozone losses in the Arctic winter and spring. The concentrations measured over a large spatial and temporal range allowed the separation of the dynamical and chemical ozone loss. The most important results of the SOLVE program were contained in two scientific papers. This Cooperative Agreement allowed the participation of the Argus instrument in the program and the analysis of the data.

Jost, Hansjurg↗

Retrieval of Ozone Column Content from Airborne Sun Photometer Measurements During SOLVE II: Comparison with SAGE III, POAM III,THOMAS and GOME Measurements

During the Second SAGE 111 Ozone Loss and Validation Experiment (SOLVE II), the 14- channel NASA Ames Airborne Trackmg Sunphotometer (AATS-14) was mounted on the NASA DC-8 and successfully measured spectra of total and aerosol optical depth (TOD and AOD) during the sunlit portions of eight science flights. Values of ozone column content above the aircraft have been derived from the AATS-14 data by using a linear least squares method. For each AATS-14 measured TOD spectrum, this method iteratively finds the ozone column content that yields the best match between measured and calculated TOD. The calculations assume the known Chappuis ozone band shape and a three-parameter AOD shape (quadratic in log-log space). Seven of the AATS-14 channels (each employing an interference filter with a nominal full-width at half maximum bandpass of -5 nm) are within the Chappuis band, with center wavelengths between 452.9 nm and 864.5 nm. One channel (604.4 nm) is near the peak, and three channels (499.4, 519.4 and 675.1 nm) have ozone absorption within 30-40% of that at the peak. For the typical DC-8 SOLVE II cruising altitudes of approx. 8-12 km and the background stratospheric aerosol conditions that prevailed during SOLVE 11, absorption of incoming solar radiation by ozone comprised a significant fraction of the aerosol-plus-ozone optical depth measured in the four AATS-14 channels centered between 499.4 and 675.1 nm. Typical AODs above the DC-8 ranged from 0.003-0.008 in these channels. For comparison, an ozone overburden of 0.3 atm-cm (300 DU) translates to ozone optical depths of 0.009,0.014, 0.041, and 0.012, respectively, at these same wavelengths. In this paper, we compare AATS-14 values of ozone column content with temporally and spatially near-coincident values derived from measurements acquired by the Stratospheric Aerosol and Gas Experiment III (SAGE III) and the Polar Ozone and Aerosol Measurement 111 (POAM III) satellite sensors. We also compare AATS-14 ozone retrievals during selected DC-8 latitudinal and longitudinal transects with total column ozone data acquired by the Total Ozone Mapping Spectrometer (TOMS) and the Global Ozone Monitoring Experiment (GOME) satellite sensors. To enable this comparison, the amount of ozone in the column below the aircraft is estimated by combining SAGE and/or POAM data with high resolution, fast response in-situ ozone measurements acquired during the DC-8 ascent at the start of each science flight.

Livingston, J.↗

Optimal Planning and Problem-Solving

CTAEMS MDP Optimal Planner is a problem-solving software designed to command a single spacecraft/rover, or a team of spacecraft/rovers, to perform the best action possible at all times according to an abstract model of the spacecraft/rover and its environment. It also may be useful in solving logistical problems encountered in commercial applications such as shipping and manufacturing. The planner reasons around uncertainty according to specified probabilities of outcomes using a plan hierarchy to avoid exploring certain kinds of suboptimal actions. Also, planned actions are calculated as the state-action space is expanded, rather than afterward, to reduce by an order of magnitude the processing time and memory used. The software solves planning problems with actions that can execute concurrently, that have uncertain duration and quality, and that have functional dependencies on others that affect quality. These problems are modeled in a hierarchical planning language called C_TAEMS, a derivative of the TAEMS language for specifying domains for the DARPA Coordinators program. In realistic environments, actions often have uncertain outcomes and can have complex relationships with other tasks. The planner approaches problems by considering all possible actions that may be taken from any state reachable from a given, initial state, and from within the constraints of a given task hierarchy that specifies what tasks may be performed by which team member.

Clemet, Bradley↗

Investment in Open Innovation Service Providers: NASA's Innovative Strategy for Solving Space Exploration Challenges

In an effort to expand routes for open communication and create additional opportunities for public involvement with NASA, Open Innovation Service Provider (OISP) methodologies have been incorporated as a tool in NASA's problem solving strategy. NASA engaged the services of two OISP providers, InnoCentive and Yet2.com, to test this novel approach and its feasibility in solving NASA s space flight challenges. The OISPs were chosen based on multiple factors including: network size and knowledge area span, established process, methodology, experience base, and cost. InnoCentive and Yet2.com each met the desired criteria; however each company s approach to Open Innovation is distinctly different. InnoCentive focuses on posting individual challenges to an established web-based network of approximately 200,000 solvers; viable solutions are sought and granted a financial award if found. Based on a specific technological need, Yet2.com acts as a talent scout providing a broad external network of experts as potential collaborators to NASA. A relationship can be established with these contacts to develop technologies and/or maintained as an established network of future collaborators. The results from the first phase of the pilot study have shown great promise for long term efficacy of utilizing the OISP methodologies. Solution proposals have been received for the challenges posted on InnoCentive and are currently under review for final disposition. In addition, Yet2.com has identified new external partners for NASA and we are in the process of understanding and acting upon these new opportunities. Compared to NASA's traditional routes for external problem solving, the OISP methodologies offered NASA a substantial savings in terms of time and resources invested. In addition, these strategies will help NASA extend beyond its current borders to build an ever expanding network of experts and global solvers.

Fogarty, Jennifer A.↗

Solving Nonlinear Euler Equations with Arbitrary Accuracy

A computer program that efficiently solves the time-dependent, nonlinear Euler equations in two dimensions to an arbitrarily high order of accuracy has been developed. The program implements a modified form of a prior arbitrary- accuracy simulation algorithm that is a member of the class of algorithms known in the art as modified expansion solution approximation (MESA) schemes. Whereas millions of lines of code were needed to implement the prior MESA algorithm, it is possible to implement the present MESA algorithm by use of one or a few pages of Fortran code, the exact amount depending on the specific application. The ability to solve the Euler equations to arbitrarily high accuracy is especially beneficial in simulations of aeroacoustic effects in settings in which fully nonlinear behavior is expected - for example, at stagnation points of fan blades, where linearizing assumptions break down. At these locations, it is necessary to solve the full nonlinear Euler equations, and inasmuch as the acoustical energy is of the order of 4 to 5 orders of magnitude below that of the mean flow, it is necessary to achieve an overall fractional error of less than 10-6 in order to faithfully simulate entropy, vortical, and acoustical waves.

Dyson, Rodger W.↗

Improve Problem Solving Skills through Adapting Programming Tools

There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

Shaykhian, Linda H.↗

Use of the NLP10x10 Sequential Quadratic Programming Algorithm To Solve Rotorcraft Hub Loads Minimisation Problems

Previous research and experimentation on the use of a non-linear programming constrained optimisation technique to define an optimal control vector for rotorcraft applications indicated that use of this methodology was feasible and desirable in many cases. In particular, use of non-linear programming methods that solve a sequence of related quadratic-programming sub-problems were used successfully to solve these problems. Accordingly, a licence for one of the latest versions of Professor Klaus Schittkowskis very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment with and analyse typical optimisation problems of the type encountered in various rotorcraft wind tunnel and flight tests. This research resulted in the development of the general NLPQLP Computation System that could be used to solve problems of the type encountered in various rotorcraft applications where there is a linear dependence of the measurement vector on the control vector, and where equality andor inequality constraints might be imposed. This development was accomplished on a mainframe computer not part of actual wind tunnel andor flight-test experiment, but in a format which was transferable to wind tunnel lap-top computers. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.The System was developed in support of the five-bladed SMART Rotor Active Flap Rotor Hub Loads analytical minimisation research. The design and development of the Computation System was tailored to address the particular requirements of the problem to minimise a performance metric function of measured hub load harmonic angular couple components by optimising the control vector harmonic flap angular couple components subject to constraints on the amplitudes of these control vector harmonic flap angular couple components. In addition, to facilitate real time wind tunnel experimentation, the ability to rapidly selectchange the particular hub load harmonic angular couple components andor the particular control vector harmonic angular couple components to be considered in the optimisation procedure was provided in the System. This capability allows the singling out of particular hub load frequencies andor particular flap angle frequencies to be analysed during testing operations. The System was used very successfully for the SMART Active Flap Rotor Hub minimisation problems considered in the study, the results of which were presented at the American Helicopter Society Fifth Decennial Aeromechanics Specialist Conference in January 2014. Excellent agreement between cases initiated with best guess starting estimates for the control vector elements and cases initiated with zero control vector starting element estimates resulted, indicating the robustness of the NLP10x10 algorithm.

Rotorcraft Hub Loads↗

Efficient iterative method for solving the Dirac-Kohn-Sham density functional theory

We present for the first time an efficient iterative method to directly solve the four-component Dirac-Kohn-Sham (DKS) density functional theory. Due to the existence of the negative energy continuum in the DKS operator, the existing iterative techniques for solving the Kohn-Sham systems cannot be efficiently applied to solve the DKS systems. The key component of our method is a novel filtering step (F) which acts as a preconditioner in the framework of the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The resulting method, dubbed the LOBPCG-F method, is able to compute the desired eigenvalues and eigenvectors in the positive energy band without computing any state in the negative energy band. The LOBPCG-F method introduces mild extra cost compared to the standard LOBPCG method and can be easily implemented. We demonstrate our method in the pseudopotential framework with a planewave basis set which naturally satisfies the kinetic balance prescription. Numerical results for Pt$_{2}$, Au$_{2}$, TlF, and Bi$_{2}$Se$_{3}$ indicate that the LOBPCG-F method is a robust and efficient method for investigating the relativistic effect in systems containing heavy elements.

74 ATOMIC AND MOLECULAR PHYSICS↗

An efficient implementation of the Chebyshev Rational Approximation Method (CRAM) for solving the burnup equations

The Chebyshev Rational Approximation Method (CRAM) has been recently introduced by the authors for solving the burnup equations with excellent results. This method has been shown to be capable of simultaneously solving an entire burnup system with thousands of nuclides both accurately and efficiently. The method was prompted by an analysis of the spectral properties of burnup matrices and it can be characterized as the best rational approximation on the negative real axis. The coefficients of the rational approximation are fixed and have been reported for various approximation orders. In addition to these coefficients, implementing the method only requires a linear solver. This paper describes an efficient method for solving the linear systems associated with the CRAM approximation. The introduced direct method is based on sparse Gaussian elimination where the sparsity pattern of the resulting upper triangular matrix is determined before the numerical elimination phase. The stability of the proposed Gaussian elimination method is discussed based on considering the numerical properties of burnup matrices. Suitable algorithms are presented for computing the symbolic factorization and numerical elimination in order to facilitate the implementation of CRAM and its adoption into routine use. The accuracy and efficiency of the described technique are demonstrated by computing the CRAM approximations for a large test case with over 1600 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Convergence analysis of a balalncing domain decomposition method for solving interior Helmholtz equations

A variant of balancing domain decomposition method by constraints (BDDC) is proposed for solving a class of indefinite system of linear equations, which arises from the finite element discretization of the Helmholtz equation of time-harmonic wave propagation in a bounded interior domain. The proposed BDDC algorithm is closely related to the dual-primal finite element tearing and interconnecting algorithm for solving Helmholtz equations (FETI-DPH). Under the condition that the diameters of the subdomains are small enough, the rate of convergence is established which depends polylogarithmically on the dimension of the individual subdomain problems and which improves with the decrease of the subdomain diameters. These results are supported by numerical experiments of solving a Helmholtz equation on a two-dimensional square domain.

97 MATHEMATICS AND COMPUTING↗

Improving solve time of aggregation-based adaptive AMG

In this paper, we propose improving the solve time of a bootstrap algebraic multigrid (AMG) designed previously by the authors. This is achieved by incorporating the information, a set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by using sufficiently large aggregates, and these aggregates are compositions of aggregates already built throughout the bootstrap algorithm. The modified AMG method has good convergence properties and shows significant reduction in both memory and solve time. These savings with respect to the original bootstrap AMG are illustrated on some difficult (for standard AMG) linear systems arising from discretization of scalar and vector function elliptic partial differential equations in both 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm

Abstract Today's intermediate‐scale quantum computers, although imperfect, already perform computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, so far, quantum‐enabled large‐scale solutions have been realized only for limited set of problems. Here a hybrid algorithm based on phase estimation and classical optimization of the circuit width and depth is employed for solving a specific class of large linear systems of equations ubiquitous to many areas of science and engineering. A classification of linear systems based on the entanglement properties of the associated phase‐estimation unitary operation is introduced, enabling a highly efficient search for solutions that is facilitated by a straightforward matrix‐to‐circuit map. A 2 17 ‐dimensional problem is implemented on several IBM quantum computer superconducting quantum processors, a record‐breaking result for a linear system solved by a quantum computer. Demonstrated realisation sets a clear benchmark in the quest for the future quantum speedup in the linear systems of equations solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasks without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.

97 MATHEMATICS AND COMPUTING↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

What can solve the strong CP problem?

Three possible strategies have been advocated to solve the strong CP problem. The first is the axion, a dynamical mechanism that relaxes any initial value of the CP violating angle $\overline{θ}$ to zero. The second is the imposition of new symmetries that are believed to set $\overline{θ}$ to zero in the UV. The third is the acceptance of the fine tuning of parameters. We argue that the latter two solutions do not solve the strong CP problem. The θ term of QCD is not a parameter — it does not exist in the Hamiltonian. Rather, it is a property of the quantum state that our universe finds itself in, arising from the fact that there are CP violating states of a CP preserving Hamiltonian. It is not eliminated by imposing parity as a symmetry since the underlying theory is already parity symmetric and that does not preclude the existence of CP violating states. Moreover, since the value of θ realized in our universe is a consequence of measurement, it is inherently random and cannot be fine tuned by choice of parameters. Rather any fine tuning would require a tuning between parameters in the theory and the random outcome of measurement. Our results considerably strengthen the case for the existence of the axion and axion dark matter. The confusion around θ arises from the fact that unlike classical mechanics, the Hamiltonian and Lagrangian are not equivalent in quantum mechanics. The Hamiltonian defines the differential time evolution, whereas the Lagrangian is a solution to this evolution. Consequently, initial conditions could in principle appear in the Lagrangian but not in the Hamiltonian. This results in aspects of the initial condition such as θ misleadingly appearing in the Lagrangian as parameters. We comment on the similarity between the θ vacua and the violations of the constraint equations of classical gauge theories in quantum mechanics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

97 MATHEMATICS AND COMPUTING↗

Solving larger maximum clique problems using parallel quantum annealing

Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we consider in this work, is sparsely connected and moderately sized (on the order of thousands of qubits), thus necessitating a minor-embedding of a logical problem onto the physical qubit hardware. The combination of relatively small hardware sizes and the necessity of a minor-embedding can mean that solving large optimization problems is not possible on current quantum annealers. In this research, we show that a hybrid approach combining parallel quantum annealing with graph decomposition allows one to solve larger optimization problem accurately. We apply the approach to the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using a meshless kernel-based method to solve the Black–Scholes variational inequality of American options

Under the Black–Scholes model, the value of an American option solves a free boundary problem which is equivalent to a variational inequality problem. Using positive definite kernels, we discretize the variational inequality problem in spatial direction and derive a sequence of linear complementarity problems (LCPs) in a finite-dimensional euclidean space. We use special kind of kernels to impose homogeneous boundary conditions and to obtain LCPs with positive definite coefficient matrices to guarantee the existence and uniqueness of the solution. The LCPs are then successfully solved iteratively by the projected SOR algorithm.

97 MATHEMATICS AND COMPUTING↗