Search NASA⌕ Search

SEARCH · Search NASA

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Finite-Strain Fractional-Order Viscoelastic (FOV) Material Models and Numerical Methods for Solving Them

Fraction-order viscoelastic (FOV) material models have been proposed and studied in 1D since the 1930's, and were extended into three dimensions in the 1970's under the assumption of infinitesimal straining. It was not until 1997 that Drozdov introduced the first finite-strain FOV constitutive equations. In our presentation, we shall continue in this tradition by extending the standard, FOV, fluid and solid, material models introduced in 1971 by Caputo and Mainardi into 3D constitutive formula applicable for finite-strain analyses. To achieve this, we generalize both the convected and co-rotational derivatives of tensor fields to fractional order. This is accomplished by defining them first as body tensor fields and then mapping them into space as objective Cartesian tensor fields. Constitutive equations are constructed using both variants for fractional rate, and their responses are contrasted in simple shear. After five years of research and development, we now possess a basic suite of numerical tools necessary to study finite-strain FOV constitutive equations and their iterative refinement into a mature collection of material models. Numerical methods still need to be developed for efficiently solving fraction al-order integrals, derivatives, and differential equations in a finite element setting where such constitutive formulae would need to be solved at each Gauss point in each element of a finite model, which can number into the millions in today's analysis.

Freed, Alan D.↗
NASA NTRS2001

Photolysis Rate Coefficient Calculations in Support of SOLVE Campaign

The objectives for this SOLVE project were 3-fold. First, we sought to calculate a complete set of photolysis rate coefficients (j-values) for the campaign along the ER-2 and DC-8 flight tracks. En route to this goal, it would be necessary to develop a comprehensive set of input geophysical conditions (e.g., ozone profiles), derived from various climatological, aircraft, and remotely sensed datasets, in order to model the radiative transfer of the atmosphere accurately. These j-values would then need validation by comparison with flux-derived j-value measurements. The second objective was to analyze chemistry along back trajectories using the NASA/Goddard chemistry trajectory model initialized with measurements of trace atmospheric constituents. This modeling effort would provide insight into the completeness of current measurements and the chemistry of Arctic wintertime ozone loss. Finally, we sought to coordinate stellar occultation measurements of ozone (and thus ozone loss) during SOLVE using the MSX/UVISI satellite instrument. Such measurements would determine ozone loss during the Arctic polar night and represent the first significant science application of space-based stellar occultation in the Earth's atmosphere.

Lloyd, Steven A.↗
NASA NTRS2002

The Space-Time CE/SE Method for Solving Maxwell's Equations in Time-Domain

An innovative finite-volume-type numerical method named as the space-time conservation element and solution element (CE/SE) method is applied to solve time-dependent Maxwell's equations in this paper. Test problems of electromagnetics scattering and antenna radiation are solved for validations. Numerical results are presented and compared with the analytical solutions, showing very good agreements.

Wang, X. Y.↗
NASA NTRS1992

Problem-Solving Software

CBR Express software solves problems by adapting sorted solutions to new problems specified by a user. It is applicable to a wide range of situations. The technology was originally developed by Inference Corporation for Johnson Space Center's Advanced Software Development Workstation. The project focused on the reuse of software designs, and Inference used CBR as part of the ACCESS prototype software. The commercial CBR Express is used as a "help desk" for customer support, enabling reuse of existing information when necessary. It has been adopted by several companies, among them American Airlines, which uses it to solve reservation system software problems.

Source record↗
NASA NTRS2004

Black Carbon Measurements in SOLVE-2

Droplet Measurement Technologies (DMT), under funding from NASA s Radiation Sciences Program, participated in the SOLVE II field campaign with measurements of light absorbing particles (black carbon and metals). These measurements were made with the Single Particle Soot Photometer (SP-2) on the NASA DC-8. The SP-2 is a new measurement technique that was developed under the SBIR program with funding from the Office of Naval Research. The original instrument suite for the DC-8 did not include the SP-2 and its addition and operation during SOLVE II was intended solely as a means to test its functionality and prepare it for future flight operations. For this reason it required several flights in the early stages of the project to tune its operation and fix some problems that arose. During the flights of January 26, 29, and 30, and February 2, 4 and 6, however, it worked as designed and acquired credible data.

Kok, Gregory L.↗
NASA NTRS2003

Measuring Aerosol Size Distributions from the NASA DC-8 in SOLVE II

The University of Denver Focused Cavity Aerosol Spectrometer (FCAS 11) and Nucleation-Mode Aerosol Size Spectrometer (N-MASS) were successfully integrated and flown aboard NASA s DC-8 for the second SAGE I11 Ozone Loss and Validation Experiment (SOLVE 11). Both instruments performed well during SOLVE, with virtually complete data coverage for all mission and test flights. The few exceptions to this were the occasional simultaneous zero-check for the instruments, and some data loss for channel 4 of the N-MASS. The only consequence of the latter is reduced resolution in the 15 to 60 nm range for the affected size distributions.

Reeves, Michael↗
NASA NTRS2004

A Strategy for Improving US Middle School Student Mathematics Word Problem Solving Performance

U.S. middle school students have difficulty understanding and solving mathematics word problems. Their mathematics performance on the Third International Mathematics and Science Study (TIMMS) is far below their international peers, and minority students are less likely than high socioeconomic status (SES) White/Asian students to be exposed to higher-level mathematics concepts. Research literature also indicates that when students use both In-School and Out-of-School knowledge and experiences to create authentic mathematics word problems, student achievement improves. This researcher developed a Strategy for improving mathematics problem solving performance and a Professional Development Model (PDM) to effectively implement the Strategy.

Thomas, Valerie L.↗
NASA NTRS2003

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.

Pang, Wanlin↗
NASA NTRS2008

Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1M Unknowns

Matrix methods for solving integral equations via direct solve LU factorization are presently limited to weeks to months of very expensive supercomputer time for problems sizes of several hundred thousand unknowns. This report presents matrix LU factor solutions for electromagnetic scattering problems for problem sizes to one million unknowns with thousands of right hand sides that run in mere days on PC level hardware. This EM solution is accomplished by utilizing the numerical low rank nature of spatially blocked unknowns using the Adaptive Cross Approximation for compressing the rank deficient blocks of the system Z matrix, the L and U factors, the right hand side forcing function and the final current solution. This compressed matrix solution is applied to a frequency domain EM solution of Maxwell's equations using standard Method of Moments approach. Compressed matrix storage and operations count leads to orders of magnitude reduction in memory and run time.

Shaeffer, John↗
NASA NTRS2009

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗
NASA NTRS2007

Solving Equations of Multibody Dynamics

Darts++ is a computer program for solving the equations of motion of a multibody system or of a multibody model of a dynamic system. It is intended especially for use in dynamical simulations performed in designing and analyzing, and developing software for the control of, complex mechanical systems. Darts++ is based on the Spatial-Operator- Algebra formulation for multibody dynamics. This software reads a description of a multibody system from a model data file, then constructs and implements an efficient algorithm that solves the dynamical equations of the system. The efficiency and, hence, the computational speed is sufficient to make Darts++ suitable for use in realtime closed-loop simulations. Darts++ features an object-oriented software architecture that enables reconfiguration of system topology at run time; in contrast, in related prior software, system topology is fixed during initialization. Darts++ provides an interface to scripting languages, including Tcl and Python, that enable the user to configure and interact with simulation objects at run time.

Jain, Abhinandan↗
NASA NTRS2010

A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!

Nguyen, Duc T.↗
NASA NTRS2011

Combined fast multipole-QR compression technique for solving electrically small to large structures for broadband applications

An approach that efficiently solves for a desired parameter of a system or device that can include both electrically large fast multipole method (FMM) elements, and electrically small QR elements. The system or device is setup as an oct-tree structure that can include regions of both the FMM type and the QR type. An iterative solver is then used to determine a first matrix vector product for any electrically large elements, and a second matrix vector product for any electrically small elements that are included in the structure. These matrix vector products for the electrically large elements and the electrically small elements are combined, and a net delta for a combination of the matrix vector products is determined. The iteration continues until a net delta is obtained that is within predefined limits. The matrix vector products that were last obtained are used to solve for the desired parameter.

Jandhyala, Vikram↗
NASA NTRS2006

Solving the Swath Segment Selection Problem

Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) -- a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic-aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for "nondeterministic polynomial time complete" -- characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time).

Knight, Russell↗
NASA NTRS2013

On Spurious Numerics in Solving Reactive Equations

The objective of this study is to gain a deeper understanding of the behavior of high order shock-capturing schemes for problems with stiff source terms and discontinuities and on corresponding numerical prediction strategies. The studies by Yee et al. (2012) and Wang et al. (2012) focus only on solving the reactive system by the fractional step method using the Strang splitting (Strang 1968). It is a common practice by developers in computational physics and engineering simulations to include a cut off safeguard if densities are outside the permissible range. Here we compare the spurious behavior of the same schemes by solving the fully coupled reactive system without the Strang splitting vs. using the Strang splitting. Comparison between the two procedures and the effects of a cut off safeguard is the focus the present study. The comparison of the performance of these schemes is largely based on the degree to which each method captures the correct location of the reaction front for coarse grids. Here "coarse grids" means standard mesh density requirement for accurate simulation of typical non-reacting flows of similar problem setup. It is remarked that, in order to resolve the sharp reaction front, local refinement beyond standard mesh density is still needed.

Numerics↗
NASA NTRS2016

Use of the NLPQLP Sequential Quadratic Programming Algorithm to Solve Rotorcraft Aeromechanical Constrained Optimisation Problems

Optimization of the control vector, configuration and aerodynamic surface design potentially offers significant performance enhancement to rotorcraft systems. These analyses indicated that non-linear programming methods that solve a sequence of related quadratic-programming sub-problems could be used successfully to solve these problems. Accordingly, a license for one of the latest versions of Professor Schittkowski's very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment and analyze typical optimization problems of the type encountered in various rotorcraft wind tunnel and flight tests. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.

Use of the NLPQLP↗
NASA NTRSDate not supplied

Extreme Problem Solving II: How Can 4 Astronauts do the Jobs of 80 Experts?

On past and present space missions, resilience is largely dependent on the problem-solving expertise of flight controllers at Mission Control on the ground. Missions to Mars will instead experience long communication delays and blackouts that require a small crew to detect, diagnose, and respond to critical events with only intermittent and limited real-time ground support. Our 2021 SpaceCHI paper “Extreme Problem Solving: The New Challenges of Deep Space Exploration” introduced the paradigm shift of increasingly Earth-independent mission operations and identified the capabilities that are not currently available on-board but will be needed to enable safe exploration beyond low-Earth orbit [1]. This paper investigates how the ground team achieves resilience today to inform what will be needed to achieve human-systems resilience on future long duration exploration missions – how can a crew of four generalists achieve the same outcomes as a team of 80+ experts? An actual ISS anomaly is analyzed and then reimagined under Mars transit conditions, to reveal critical decision-points and the onboard capabilities that will be needed for successful resolution. This paper also presents criteria for what makes urgent, unanticipated events so challenging to resolve.

human-systems integration architecture↗
NASA NTRS2022

A Novel Approach to Solve Forward/Inverse Problems in Remote Sensing Applications

Inversion of electromagnetic (EM) signals reflected from or transmitted through a medium, or emitted by it due to internal sources can be used to investigate the optical and physical properties of a variety of scattering/absorbing/emitting materials. Such media encompass planetary atmospheres and surfaces (including water/snow/ice), and plant canopies. In many situations the signals emerging from such media can be described by a linear transport equation which in the case of EM radiation is the radiative transfer equation (RTE). Solutions of the RTE can be used as a forward model to solve the inverse problem to determine the medium state parameters giving rise to the emergent (reflected/transmitted/emitted) EM signals. A novel method is developed to determine layer-by-layer contributions to the emergent signals from such stratified, multilayered media based on the solution of the pertinent RTE. As a specific example of how this approach may be applied, the radiation reflected from a multilayered atmosphere is used to solve the problem relevant for EM probing by a space-based lidar system. The solutions agree with those obtained using the standard lidar approach for situations in which single scattering prevails, but this novel approach also yields reliable results for optically thick, multiple scattering aerosol and cloud layers that cannot be provided by the traditional lidar approach.

forward modeling↗