Search NASA⌕ Search

SEARCH · Search NASA

Results for “Standard Problem”

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 91 records · Page 5

Elastic-plastic deformations of a beam with the SD-effect

The results for the bending of a cantilever beam with the SD-effect under a concentrated load are discussed. To solve this problem, the standard Bernoulli-Euler hypotheses for beams and the Ilyushin model of perfect plasticity are used. The problem is solved analytically for structural steel A40X. The SD-effect for elastic-plastic deformations is studied. The solutions for beam made of isotropic material and material with the SD-effect are compared.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal block preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.

74 ATOMIC AND MOLECULAR PHYSICS↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

An Integrated Approach to Scaling Task-Based Runtime Systems for Next Generation Engineering problems

The need to scale next-generation industrial engineering problems to the largest computational platforms presents unique challenges. Such problems may have complex coupled multi-physics models, as well as computationally and communication intensive algorithms not often seen in standard academic problems, while also needing high-demand I/O for analysis purposes. In such cases even codes with good existing scaling properties may need significant changes, addressed in a cross-cutting way to solve such problems at extreme scales. These challenges relate to system components that were not previously problematic on less complex problems and/or at smaller computational scales. This paper illustrates these challenges for Uintah, a highly scalable asynchronous many-task runtime system being applied to the modeling of a 1000 MWe ultra-supercritical coal boiler. In order to model this formidable, production engineering problem, not only was an integrated approach needed that built upon existing scalable components in areas such as complex stencil calculations and linear algebra, but the significant challenges of high demand I/O, complex task graphs, and infrastructure inefficiencies also had to be addressed. This integrated approach allowed this problem to run on 256K CPU cores on Mira, with good weak scaling to 512K CPU cores and similar strong scaling, except for radiation. The need for strong scaling of a new ray tracing-based radiation model required substantial Uintah infrastructure improvements before 119K CPU cores and 7.5K GPUs on Titan could be used, with scaling out to 256K CPU cores and 16K GPUs. The resulting code demonstrates not only excellent overall scalability but a significant improvement in overall performance for the full-scale, production boiler problem.

97 MATHEMATICS AND COMPUTING↗

Bootstrap AMG for spectral clustering

Graph Laplacian is a popular tool for analyzing graphs, particularly in graph partitioning and clustering. Given a notion of similarity (via an adjacency matrix), graph clustering refers to identifying different groups such that vertices in the same group are more similar compared to vertices across different groups. Data clustering can be reformulated in terms of a graph clustering problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are often used to obtain a new geometric representation of the original data set that generally enhances cluster properties and improves cluster detection. Here, we apply a bootstrap algebraic multigrid (AMG) method that constructs a set of vectors associated with the graph Laplacian. These vectors, referred to as algebraically smooth ones, span a low-dimensional Euclidean space, which we use to represent the data, enabling cluster detection both in synthetic and in realistic well-clustered graphs. We show that, in the case of a good quality bootstrap AMG, the computed smooth vectors employed in the construction of the final AMG operator, which by construction is spectrally equivalent to the originally given graph Laplacian, accurately approximate the space in the lower portion of the spectrum of the preconditioned operator. Thus, our approach can be viewed as a spectral clustering technique associated with the generalized spectral problem (Laplace operator versus the final AMG operator), and hence, it can be seen as an extension of the classical spectral clustering that employs a standard eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗

Application of the Finite Element Method to Rotary Wing Aeroelasticity

A finite element method for the spatial discretization of the dynamic equations of equilibrium governing rotary-wing aeroelastic problems is presented. Formulation of the finite element equations is based on weighted Galerkin residuals. This Galerkin finite element method reduces algebraic manipulative labor significantly, when compared to the application of the global Galerkin method in similar problems. The coupled flap-lag aeroelastic stability boundaries of hingeless helicopter rotor blades in hover are calculated. The linearized dynamic equations are reduced to the standard eigenvalue problem from which the aeroelastic stability boundaries are obtained. The convergence properties of the Galerkin finite element method are studied numerically by refining the discretization process. Results indicate that four or five elements suffice to capture the dynamics of the blade with the same accuracy as the global Galerkin method.

Straub, F. K.↗

PDE Constrained Optimization for Digital Image Correlation

The purpose of this report is to investigate a partial differential equation (PDE) constrained optimization approach for estimating the velocity field given image data for use within digital image correlation (DIC). We first introduce the problem and the standard DIC approach and then demonstrate why the DIC problem is ill-posed and introduce a standard regularization of the problem. We also demonstrate that the functional used is sensitive and robust via a sequence of experiments given by a stochastic model inducing the PDE constraint.

42 ENGINEERING↗

On the linear smoothing problem.

Smoothing problem for linear discrete time system, converting problem to special case of standard linear filtering problem

Willman, W. W.↗

Full-field Strain Methods for Investigating Failure Mechanisms in Triaxial Braided Composites

Composite materials made with triaxial braid architecture and large tow size carbon fibers are beginning to be used in many applications, including composite aircraft and engine structures. Recent advancements in braiding technology have led to commercially viable manufacturing approaches for making large structures with complex shape. Although the large unit cell size of these materials is an advantage for manufacturing efficiency, the fiber architecture presents some challenges for materials characterization, design, and analysis. In some cases, the static load capability of structures made using these materials has been higher than expected based on material strength properties measured using standard coupon tests. A potential problem with using standard tests methods for these materials is that the unit cell size can be an unacceptably large fraction of the specimen dimensions. More detailed investigation of deformation and failure processes in large unit cell size triaxial braid composites is needed to evaluate the applicability of standard test methods for these materials and to develop alternative testing approaches. In recent years, commercial equipment has become available that enables digital image correlation to be used on a more routine basis for investigation of full field 3D deformation in materials and structures. In this paper, some new techniques that have been developed to investigate local deformation and failure using digital image correlation techniques are presented. The methods were used to measure both local and global strains during standard straight-sided coupon tensile tests on composite materials made with 12 and 24 k yarns and a 0/+60/-60 triaxial braid architecture. Local deformation and failure within fiber bundles was observed, and this local failure had a significant effect on global stiffness and strength. The matrix material had a large effect on local damage initiation for the two matrix materials used in this investigation. Premature failure in regions of the unit cell near the edge of the straight-sided specimens was observed for transverse tensile tests in which the braid axial fibers were perpendicular to the specimen axis and the bias fibers terminated on the cut edges in the specimen gage section. This edge effect is one factor that could contribute to a measured strength that is lower than the actual material strength in a structure without edge effects.

Littell, Justin D.↗

Avoiding the blue spectrum and the fine-tuning of initial conditions in hybrid inflation

Hybrid inflation faces two well-known problems: the blue spectrum of the nonsupersymmetric version of the model and the fine-tuning of the initial conditions of the fields leading to sufficient inflation to account for the standard cosmological problems. They are investigated by studying the exact two-fields dynamics instead of assuming slow-roll. When the field values are restricted to be less than the reduced Planck mass, a non-negligible part of the initial condition space (around 15% depending on potential parameters) leads to successful inflation. Most of it is located outside the usual inflationary valley and organized in continuous patterns instead of being isolated as previously found. Their existence is explained and their properties are studied. This shows that no excessive fine-tuning is required for successful hybrid inflation. Moreover, by extending the initial condition space to Planckian-like or super-Planckian values, inflation becomes generically sufficiently long and can produce a red-tilted scalar power spectrum due to slow-roll violations. The robustness of these properties is confirmed by conducting our analysis on three other models of hybrid-type inflation in various framework: 'smooth' and 'shifted' inflation in SUSY and SUGRA, and 'radion assisted' gauge inflation. A high percentage of successful inflation for smooth hybrid inflation (up to 80%) is observed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A fully implicit method for 3D quasi-steady state magnetic advection-diffusion.

We describe the implementation of a prototype fully implicit method for solving three-dimensional quasi-steady state magnetic advection-diffusion problems. This method allows us to solve the magnetic advection diffusion equations in an Eulerian frame with a fixed, user-prescribed velocity field. We have verified the correctness of method and implementation on two standard verification problems, the Solberg-White magnetic shear problem and the Perry-Jones-White rotating cylinder problem.

97 MATHEMATICS AND COMPUTING↗

Aircraft Engine Gas Path Diagnostic Methods: Public Benchmarking Results

Recent technology reviews have identified the need for objective assessments of aircraft engine health management (EHM) technologies. To help address this issue, a gas path diagnostic benchmark problem has been created and made publicly available. This software tool, referred to as the Propulsion Diagnostic Method Evaluation Strategy (ProDiMES), has been constructed based on feedback provided by the aircraft EHM community. It provides a standard benchmark problem enabling users to develop, evaluate and compare diagnostic methods. This paper will present an overview of ProDiMES along with a description of four gas path diagnostic methods developed and applied to the problem. These methods, which include analytical and empirical diagnostic techniques, will be described and associated blind-test-case metric results will be presented and compared. Lessons learned along with recommendations for improving the public benchmarking processes will also be presented and discussed.

Simon, Donald L.↗

Optimal rejection of bounded persistent disturbances in periodic systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time period systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint ensures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem.

Dahleh, Munther A.↗

Optimal and robust controllers for periodic and multirate systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time periodic systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint assures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem. Also, it is shown that the method of solution presented applies exactly to the problem of disturbance rejection in the case of multirate sampled data systems. Finally, the results are applied to the problem of robust stabilization of periodic and multirate systems.

Dahleh, Munther A.↗

COYOTE : a finite element computer program for nonlinear heat conduction problems. Part I, theoretical background.

The need for the engineering analysis of systems in which the transport of thermal energy occurs primarily through a conduction process is a common situation. For all but the simplest geometries and boundary conditions, analytic solutions to heat conduction problems are unavailable, thus forcing the analyst to call upon some type of approximate numerical procedure. A wide variety of numerical packages currently exist for such applications, ranging in sophistication from the large, general purpose, commercial codes, such as COMSOL, COSMOSWorks, ABAQUS and TSS to codes written by individuals for specific problem applications. The original purpose for developing the finite element code described here, COYOTE, was to bridge the gap between the complex commercial codes and the more simplistic, individual application programs. COYOTE was designed to treat most of the standard conduction problems of interest with a user-oriented input structure and format that was easily learned and remembered. Because of its architecture, the code has also proved useful for research in numerical algorithms and development of thermal analysis capabilities. This general philosophy has been retained in the current version of the program, COYOTE, Version 5.0, though the capabilities of the code have been significantly expanded. A major change in the code is its availability on parallel computer architectures and the increase in problem complexity and size that this implies. The present document describes the theoretical and numerical background for the COYOTE program. This volume is intended as a background document for the user's manual. Potential users of COYOTE are encouraged to become familiar with the present report and the simple example analyses reported in before using the program. The theoretical and numerical background for the finite element computer program, COYOTE, is presented in detail. COYOTE is designed for the multi-dimensional analysis of nonlinear heat conduction problems. A general description of the boundary value problems treated by the program is presented. The finite element formulation and the associated numerical methods used in COYOTE are also outlined. Instructions for use of the code are documented in SAND2010-0714.

99 GENERAL AND MISCELLANEOUS↗

Quantum Interior Point Methods for Semidefinite Optimization

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

Augustino, Brandon↗

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗