Vertically integrated project based method applied to small satellite technology development
Explore the source record for details and available documents.
Katherine Fowee Gasaway↗
SEARCH · Engineering Papers
Results for “projection method”
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.
An historical survey of computational methods in optimal control.
Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.
Polak, E.↗
Optimization of structures to satisfy a flutter velocity constraint by use of quadratic equation fitting
Using the first and the second derivative of flutter velocity with respect to the parameters, the velocity hypersurface is made quadratic. This greatly simplifies the numerical procedure developed for determining the values of the design parameters such that a specified flutter velocity constraint is satisfied and the total structural mass is near a relative minimum. A search procedure is presented utilizing two gradient search methods and a gradient projection method. The procedure is applied to the design of a box beam, using finite-element representation. The results indicate that the procedure developed yields substantial design improvement satisfying the specified constraint and does converge to near a local optimum.
Motiwalla, S. K.↗
Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations
Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.
Sorensen, Danny C.↗
Formal Methods Demonstration Project for Space Applications
Requirements and design specifications are a high priority candidate for better software engineering techniques. Most hazardous software safety errors found during system integration and test of two NASA spacecraft were the result of requirements discrepancies or interface specifications. The highest density of major defects found through the use of software inspections was during the requirements phase. This was seven times higher than the density of major defects found in code inspections. Requirements errors are between 10 and 100 times more costly to fix at later phases of the software lifecycle than at the requirements phase itself. One study found that early lifecycle errors are the most likely to lead to catastrophic failures.
critical↗
More About The Enhanced Projection-And-Assembly Method
Report discusses enhanced projection-and-assembly (EP&A) method and its application to Galileo spacecraft. EP&A method and its predecessor, projection-and-assembly (P&A) method, described in "Enhanced Method of Reduction of Mathematical Models" (NPO-18402), and "Two-Stage Reduction of Dynamical Models" (NPO-18723).
Lee, Allen Y.↗
Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections
Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Component model reduction via the projection and assembly method
This paper explains the projection and assembly model reduction method which has been used to derive reduced order component models for the Galileo spacecraft. Assembly of reduced order component models produces a reduced order system model which can then be used in multibody simulation codes for efficient run times. The methodology is explained and a proof is given showing the exact reproduction of selected significant system modes. Frequency bounds are obtained for all modes produced when the reduced order components are assembled. The projection and assembly method is demonstrated on two examples. The first example is a simplified model of the Galileo spacecraft, while the second example is the model of the Galileo spacecraft in its early mission configuration. When articulation of components is allowed, the method may not reproduce all system modes precisely. Remedies for this problem are suggested.
Kissel, Glen J.↗
Nonlinear, real-time optimization for actuator management in tokamaks
Experiments in DIII-D have been carried out to test a novel actuator management approach in tokamaks. Here, the actuator management scheme is posed as a nonlinear-optimization problem in which the actuator commands are calculated in real time according to the changing control priorities, plasma state, and actuator availability. Such optimization problem is solved using the augmented Lagrangian method, combined with a gradient projection method and a conjugate-gradient iteration algorithm. The algorithmic approach followed in this work does not depend on the particular control objectives or actuators considered, which facilitates its integration with other independently-designed control components within a plasma-control system. In addition, the actuator-management algorithm is able to handle the optimization problem in a computationally efficient manner, making it suitable for real-time implementations. Initial DIII-D results in the steady-state high-q min scenario have demonstrated the capabilities of the actuator manager to perform both simultaneous multiple mission and repurposing sharing, which will be required in ITER.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
A machine learning decision criterion for reducing scan time for hyperspectral neutron computed tomography systems
We present the first machine learning-based autonomous hyperspectral neutron computed tomography experiment performed at the Spallation Neutron Source. Hyperspectral neutron computed tomography allows the characterization of samples by enabling the reconstruction of crystallographic information and elemental/isotopic composition of objects relevant to materials science. High quality reconstructions using traditional algorithms such as the filtered back projection require a high signal-to-noise ratio across a wide wavelength range combined with a large number of projections. This results in scan times of several days to acquire hundreds of hyperspectral projections, during which end users have minimal feedback. To address these challenges, a golden ratio scanning protocol combined with model-based image reconstruction algorithms have been proposed. This novel approach enables high quality real-time reconstructions from streaming experimental data, thus providing feedback to users, while requiring fewer yet a fixed number of projections compared to the filtered back projection method. In this paper, we propose a novel machine learning criterion that can terminate a streaming neutron tomography scan once sufficient information is obtained based on the current set of measurements. Our decision criterion uses a quality score which combines a reference-free image quality metric computed using a pre-trained deep neural network with a metric that measures differences between consecutive reconstructions. The results show that our method can reduce the measurement time by approximately a factor of five compared to a baseline method based on filtered back projection for the samples we studied while automatically terminating the scans.
97 MATHEMATICS AND COMPUTING↗
Overview of Krylov subspace methods with applications to control problems
An overview of projection methods based on Krylov subspaces are given with emphasis on their application to solving matrix equations that arise in control problems. The main idea of Krylov subspace methods is to generate a basis of the Krylov subspace Span and seek an approximate solution the the original problem from this subspace. Thus, the original matrix problem of size N is approximated by one of dimension m typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now just becoming popular for solving nonlinear equations. It is shown how they can be used to solve partial pole placement problems, Sylvester's equation, and Lyapunov's equation.
Saad, Youcef↗
An Application of the Quadrature-Free Discontinuous Galerkin Method
The process of generating a block-structured mesh with the smoothness required for high-accuracy schemes is still a time-consuming process often measured in weeks or months. Unstructured grids about complex geometries are more easily generated, and for this reason, methods using unstructured grids have gained favor for aerodynamic analyses. The discontinuous Galerkin (DG) method is a compact finite-element projection method that provides a practical framework for the development of a high-order method using unstructured grids. Higher-order accuracy is obtained by representing the solution as a high-degree polynomial whose time evolution is governed by a local Galerkin projection. The traditional implementation of the discontinuous Galerkin uses quadrature for the evaluation of the integral projections and is prohibitively expensive. Atkins and Shu introduced the quadrature-free formulation in which the integrals are evaluated a-priori and exactly for a similarity element. The approach has been demonstrated to possess the accuracy required for acoustics even in cases where the grid is not smooth. Other issues such as boundary conditions and the treatment of non-linear fluxes have also been studied in earlier work This paper describes the application of the quadrature-free discontinuous Galerkin method to a two-dimensional shear layer problem. First, a brief description of the method is given. Next, the problem is described and the solution is presented. Finally, the resources required to perform the calculations are given.
Lockard, David P.↗
Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles
An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.
Kiris, Cetin↗
Coordinate transformation methodology for simulating quasistatic elastoplastic solids
Molecular dynamics simulations frequently employ periodic boundary conditions where the positions of the periodic images are manipulated in order to apply deformation to the material sample. For example, Lees-Edwards conditions use moving periodic images to apply simple shear. Here, we examine the problem of precisely comparing this type of simulation to continuum solid mechanics. We employ a hypo-elastoplastic mechanical model, and develop a projection method to enforce quasi-static equilibrium. We introduce a simulation framework that uses a fixed Cartesian computational grid on a reference domain, and imposes deformation via a time-dependent coordinate transformation to the physical domain. As a test case for our method, we consider the evolution of shear bands in a bulk metallic glass using the shear transformation zone theory of amorphous plasticity. We examine the growth of shear bands in simple shear and pure shear conditions as a function of the initial preparation of the bulk metallic glass.
74 ATOMIC AND MOLECULAR PHYSICS↗
Three-dimensional thermo-mechanical simulations of heterogeneous solid propellants
Here in this work, we present a numerical framework that describes thermo-mechanical deformations in a burning heterogeneous solid propellant. These deformations are quasi-static at time scales associated with combustion, and the resulting thermo-mechanical formulation is discretized on a Cartesian grid using a hypoelastic law. We use a weak form of Chorin-type projection method to deal with large difference in shear modulus of the constituent materials. Extending our previous two-dimensional work, grid convergence studies for a three-dimensional propellant configuration are presented for the stress, velocity, and reference map components. Finally, simulations are carried out for a random propellant pack that is coupled to a gas phase, and we present results for the pack undergoing combustion, with and without deformations.
simulations↗
A Parallel Incompressible Navier-Stokes Solver with Multigrid Iterations
We developed a parallel, numerically accurate and stable, and computationally efficient finate-difference incompressible Navier-Stokes (N-S) fluid flow solver. The solver runs on both sequential and massively parallel computers. The numerical method used here is a second-order projection method on a staggered grid. The code is highly modular and it can be used either as a stand-alone flow solver and or a template code which can be adapted or expanded to a specific application. Numerical results and parallel performances of our code on Intel Delta and Paragon are reported.
Navier-Stokes solver↗
A Formula for Fixing Troubled Projects: The Scientific Method Meets Leadership
This presentation focuses on project management, specifically addressing project issues using the scientific method of problem-solving. Two sample projects where this methodology has been applied are provided.
Wagner, Sandra↗
Maximum RMS error comparison of several redundancy techniques
Paper presents mathematical comparison of several techniques with the limiting slope technique for data reduction and reconstruction. Limiting slope method results in maximum possible RMS error versus data compression ratio advantage of 2-to-1 over step and fan methods and 3-to-1 over the two point projection method.
Breaux, J. N.↗