Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring methods”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Use of global functions for improvement in efficiency of nonlinear analysis

A method for improving the efficiency of nonlinear structural analysis by the use of global displacement functions is presented. The computer programs include options to define the global functions as input or let the program automatically select and update these functions. The program was applied to a number of structures: (1) 'pear-shaped cylinder' in compression, (2) bending of a long cylinder, (3) spherical shell subjected to point force, (4) panel with initial imperfections, (5) cylinder with cutouts. The sample cases indicate the usefulness of the procedure in the solution of nonlinear structural shell problems by the finite element method. It is concluded that the use of global functions for extrapolation will lead to savings in computer time.

Almroth, B. O.↗
NASA NTRS1990

Accumulated approximation: A new method for structural optimization by iterative improvement

A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.

Rasmussen, John↗
NASA NTRS1980

Discrete-continuous variable structural synthesis using dual methods

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Schmit, L. A.↗
NASA NTRS1990

Computational structural mechanics methods research using an evolving framework

Advanced structural analysis and computational methods that exploit high-performance computers are being developed in a computational structural mechanics research activity sponsored by the NASA Langley Research Center. These new methods are developed in an evolving framework and applied to representative complex structural analysis problems from the aerospace industry. An overview of the methods development environment is presented, and methods research areas are described. Selected application studies are also summarized.

Knight, N. F., Jr.↗
NASA NTRS1995

Structural design using equilibrium programming formulations

Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.

Scotti, Stephen J.↗
NASA NTRS1993

Sensitivity analysis of discrete systems

A selection is presented of methods used in the calculation of sensitivity derivatives of behavior and response of discretely modeled structure. Attention is given to methods for the selection of finite-difference step sizes for structural constraint derivatives, and techniques for finite difference derivatives in iteratively-solved problems. Also noted are methods for sensitivity of linear static response, and methods for second derivatives of structural response, derivatives of stresses, and nonlinear response; an emerging area of interest concerns the derivatives of transient response.

Adelman, Howard M.↗
NASA NTRS1984

Control of large flexible spacecraft by the independent modal-space control method

The problem of control of a large-order flexible structure in the form of a plate-like lattice by the Independent Modal-Space Control (IMSC) method is presented. The equations of motion are first transformed to the modal space, thus obtaining internal (plant) decoupling of the system. Then, the control laws are designed in the modal space for each mode separately, so that the modal equations of motion are rendered externally (controller) decoupled. This complete decoupling applies both to rigid-body modes and elastic modes. The application of linear optimal control, in conjunction with a quadratic performance index, is first reviewed. A solution for high-order systems is proposed here by the IMSC method, whereby the problem is reduced to a number of modal minimum-fuel problems for the controlled modes.

Meirovitch, L.↗
NASA NTRS1990

Application of global sensitivity equations in multidisciplinary aircraft synthesis

The present paper investigates the applicability of the Global Sensitivity Equation (GSE) method in the multidisciplinary synthesis of aeronautical vehicles. The GSE method provides an efficient approach for representing a large coupled system by smaller subsystems and accounts for the subsystem interactions by means of first-order behavior sensitivities. This approach was applied in an aircraft synthesis problem with performance constraints stemming from the disciplines of structures, aerodynamics, and flight mechanics. Approximation methods were considered in an attempt to reduce problem dimensionality and to improve the efficiency of the optimization process. The influence of efficient constraint representations, the choice of design variables, and design variable scaling on the conditioning of the system matrix was also investigated.

Hajela, P.↗
NASA NTRS2004

Finite Element Analysis in Concurrent Processing: Computational Issues

The purpose of this research is to investigate the potential application of new methods for solving large-scale static structural problems on concurrent computers. It is well known that traditional single-processor computational speed will be limited by inherent physical limits. The only path to achieve higher computational speeds lies through concurrent processing. Traditional factorization solution methods for sparse matrices are ill suited for concurrent processing because the null entries get filled, leading to high communication and memory requirements. The research reported herein investigates alternatives to factorization that promise a greater potential to achieve high concurrent computing efficiency. Two methods, and their variants, based on direct energy minimization are studied: a) minimization of the strain energy using the displacement method formulation; b) constrained minimization of the complementary strain energy using the force method formulation. Initial results indicated that in the context of the direct energy minimization the displacement formulation experienced convergence and accuracy difficulties while the force formulation showed promising potential.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS1988

Reliable use of determinants to solve nonlinear structural eigenvalue problems efficiently

The analytical derivation, numerical implementation, and performance of a multiple-determinant parabolic interpolation method (MDPIM) for use in solving transcendental eigenvalue (critical buckling or undamped free vibration) problems in structural mechanics are presented. The overall bounding, eigenvalue-separation, qualified parabolic interpolation, accuracy-confirmation, and convergence-recovery stages of the MDPIM are described in detail, and the numbers of iterations required to solve sample plane-frame problems using the MDPIM are compared with those for a conventional bisection method and for the Newtonian method of Simpson (1984) in extensive tables. The MDPIM is shown to use 31 percent less computation time than bisection when accuracy of 0.0001 is required, but 62 percent less when accuracy of 10 to the -8th is required; the time savings over the Newtonian method are about 10 percent.

Williams, F. W.↗
NASA NTRS1989

A Transient Response Method for Linear Coupled Substructures

A method is presented for determining the transient response of a discrete coordinate model of a linear structural system composed of substructures. The method is applicable to systems consisting of any number of substructures, both determinate and indeterminate interface boundaries, and any topological arrangement of the substructures. The method is simple to implement from a computational point of view because the equations of motion of each of the substructures are solved independently, and the interface boundary compatibility conditions are enforced at each integration time step by a matrix multiplication. The method is demonstrated for a structural system consisting of two beam segments and acted upon by a time dependent force. The numerical results from the demonstration problem validates the accuracy of the method. The application of this method to structural systems with changing interface boundary conditions between substructures is discussed.

Admire, J. R.↗
NASA NTRS1988

Tracing structural optima as a function of available resources by a homotopy method

Optimization problems are typically solved by starting with an initial estimate and proceeding iteratively to improve it until the optimum is found. The design points along the path from the initial estimate to the optimum are usually of no value. The present work proposes a strategy for tracing a path of optimum solutions parameterized by the amount of available resources. The paper specifically treats the optimum design of a structure to maximize its buckling load. Equations for the optimum path are obtained using Lagrange multipliers, and solved by a homotopy method. The solution path has several transitions from unimodal to bimodal solutions. The Lagrange multipliers and second-order optimality conditions are used to detect branching points and to switch to the optimum solution path. The procedure is applied to the design of a foundation which supports a column for maximum buckling load. Using the total available foundation stiffness as a homotopy parameter, a set of optimum foundation designs is obtained.

Haftka, Raphael T.↗
DOE OSTI2023

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Quantum Monte Carlo benchmarking of large noncovalent complexes in the L7 benchmark set

We have used diffusion Monte Carlo (DMC) to perform calculations on the L7 benchmark set. DMC is a stochastic numerical integration scheme in real-space and part of a larger set of quantum Monte Carlo methods. The L7 set was designed to test the ability of electronic structure methods to include dispersive interactions. While the agreement between DMC and quantum-chemical state-of-the-art methods is excellent for some of the structures, there are significant differences in others. In contrast to wavefunction-based quantum chemical methods, DMC is a first-principle many-body method with the many-body wavefunction evolving in real space. It includes explicitly all electron–electron interactions and is relatively insensitive to the size of the basis set.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Transferability of data-driven, many-body models for CO 2 simulations in the vapor and liquid phases

Here, extending on the previous work by Riera et al. [J. Chem. Theory Comput. 16, 2246–2257 (2020)], we introduce a second generation family of data-driven many-body MB-nrg models for CO 2 and systematically assess how the strength and anisotropy of the CO 2 –CO 2 interactions affect the models’ ability to predict vapor, liquid, and vapor–liquid equilibrium properties. Building upon the many-body expansion formalism, we construct a series of MB-nrg models by fitting one-body and two-body reference energies calculated at the coupled cluster level of theory for large monomer and dimer training sets. Advancing from the first generation models, we employ the charge model 5 scheme to determine the atomic charges and systematically scale the two-body energies to obtain more accurate descriptions of vapor, liquid, and vapor–liquid equilibrium properties. Challenges in model construction arise due to the anisotropic nature and small magnitude of the interaction energies in CO 2 , calling for the necessity of highly accurate descriptions of the multidimensional energy landscape of liquid CO 2 . These findings emphasize the key role played by the training set quality in the development of transferable, data-driven models, which, accurately representing high-dimensional many-body effects, can enable predictive computer simulations of molecular fluids across the entire phase diagram.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1975

An improved method for optimum design of mechanically and thermally loaded structures

The problem of obtaining the minimum-mass design of mechanically and thermally loaded structures is presented. The special nature of thermal stresses with regard to their response to resizing of structural members is discussed. It is shown that conventional resizing procedures which are based on driving the total stress to its allowable value may be inefficient when the thermal stress in an element makes up a significant fraction of the total stress. An improved algorithm for resizing of structures subjected to thermal stresses is treated. In this algorithm the mechanical portions of the stresses were driven to their maximum allowable values. The thermal stresses were used to adjust the allowable values of the mechanical stresses. The new algorithm was exercised for a number of truss structures of varying complexity and compared with ordinary fully stressed design.

Adelman, H. M.↗