Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “general linear 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 145 records · Page 8

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

HUB LOADS↗

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show how the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of some biased estimation methods (including ordinary subset regression) in the linear model

Ridge, Marquardt's generalized inverse, shrunken, and principal components estimators are discussed in terms of the objectives of point estimation of parameters, estimation of the predictive regression function, and hypothesis testing. It is found that as the normal equations approach singularity, more consideration must be given to estimable functions of the parameters as opposed to estimation of the full parameter vector; that biased estimators all introduce constraints on the parameter space; that adoption of mean squared error as a criterion of goodness should be independent of the degree of singularity; and that ordinary least-squares subset regression is the best overall method.

Sidik, S. M.↗

A new approach to the design of time varying control systems with application to the space shuttle booster

A general approach toward the analysis and design of closed loop control for slowly time-varying linear systems was investigated. The approach is by the method of generalized multiple scales, in which slow and fast dynamics are systematically separated by employing different clocks which measure time at varying rates. The clocks, which are necessarily nonlinear functions of time, so that the system dynamics are asymptotically invariant with respect to the new time scale. A transfer function relating the output to the input for general linear slowly time-varying systems is developed and represents the actual system under certain conditions. The clock functions are shown to satisfy an algebraic characteristic equation and can be determined in general in terms of the coefficients.

Ramnath, R. V.↗

Lightning Radio Source Retrieval Using Advanced Lightning Direction Finder (ALDF) Networks

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing and arrival time of lightning radio emissions. Solutions for the plane (i.e., no Earth curvature) are provided that implement all of tile measurements mentioned above. Tests of the retrieval method are provided using computer-simulated data sets. We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. In the absence of measurement errors, quadratic root degeneracy (no source location ambiguity) is shown to exist exactly on the outer sensor baselines for arbitrary non-collinear network geometries. The accuracy of the quadratic planar method is tested with computer generated data sets. The results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 deg. We also note some of the advantages and disadvantages of these methods over the nonlinear method of chi(sup 2) minimization employed by the National Lightning Detection Network (NLDN) and discussed in Cummins et al.(1993, 1995, 1998).

Koshak, William J.↗

A Generalized Stress Inversion Approach With Application to Residual Stress Estimation

In this work develop a generalized stress inversion technique (or the generalized inversion method) capable of recovering stresses in linear elastic bodies subjected to arbitrary cuts. Specifically, given a set of displacement measurements found experimentally from digital image correlation (DIC), we formulate a stress estimation inverse problem as a partial differential equation-constrained optimization problem. We use gradient-based optimization methods, and we accordingly derive the necessary gradient and Hessian information in a matrix-free form to allow for parallel, large-scale operations. By using a combination of finite elements, DIC, and a matrix-free optimization framework, the generalized inversion method can be used on any arbitrary geometry, provided that the DIC camera can view a sufficient part of the surface. We present numerical simulations and experiments, and we demonstrate that the generalized inversion method can be applied to estimate residual stress.

42 ENGINEERING↗

Line-vortex theory for calculation of supersonic downwash

The perturbation field induced by a line vortex in a supersonic stream and the downwash behind a supersonic lifting surface are examined to establish approximate methods for determining the downwash behind supersonic wings. Lifting-lines methods are presented for calculating supersonic downwash. A bent lifting-line method is proposed for computing the downwash field behind swept wings. When applied to triangular wings with subsonic leading edges, this method gives results that, in general, are in good agreement with the exact linearized solution. An unbent lifting-line method (horseshoe-vortex system) is proposed for unswept wings. This method is applied to determine downwash behind rectangular wings with aspect ratios of 2 and 4. Excellent agreement with exact linearized theory is obtained for both aspect ratios by placing the lifting line at the 1/2-chord point. The use of lifting-lines therefore appears promising for obtaining estimates of the downwash behind supersonic wings.

Mirels, Harold↗

ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

Koshak, W. J.↗

A simple, stable, and accurate linear tetrahedral finite element for transient, nearly, and fully incompressible solid dynamics: A dynamic variational multiscale approach [A simple, stable, and accurate tetrahedral finite element for transient, nearly incompressible, linear and nonlinear elasticity: A dynamic variational multiscale approach]

Here, we propose a new approach for the stabilization of linear tetrahedral finite elements in the case of nearly incompressible transient solid dynamics computations. Our method is based on a mixed formulation, in which the momentum equation is complemented by a rate equation for the evolution of the pressure field, approximated with piece-wise linear, continuous finite element functions. The pressure equation is stabilized to prevent spurious pressure oscillations in computations. Incidentally, it is also shown that many stabilized methods previously developed for the static case do not generalize easily to transient dynamics. Extensive tests in the context of linear and nonlinear elasticity are used to corroborate the claim that the proposed method is robust, stable, and accurate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A general panel method for the analysis and design of arbitrary configurations in incompressible flows

A method for solving the linear integral equations of incompressible potential flow in three dimensions is presented. Both analysis (Neumann) and design (Dirichlet) boundary conditions are treated in a unified approach to the general flow problem. The method is an influence coefficient scheme which employs source and doublet panels as boundary surfaces. Curved panels possessing singularity strengths, which vary as polynomials are used, and all influence coefficients are derived in closed form. These and other features combine to produce an efficient scheme which is not only versatile but eminently suited to the practical realities of a user-oriented environment. A wide variety of numerical results demonstrating the method is presented.

Johnson, F. T.↗

Comparison of linear inversion methods by examination of the duality between iterative and inverse matrix methods

Linear numerical inversion methods applied to atmospheric remote sounding generally can be categorized in two ways: (1) iterative, and (2) inverse matrix methods. However, these two categories are not unrelated; a duality exists between them. In other words, given an iterative scheme, a corresponding inverse matrix method exists, and conversely. This duality concept is developed for the more familiar linear methods. The iterative duals are compared with the classical linear iterative approaches and their differences analyzed. The importance of the initial profile in all methods is stressed. Calculations using simulated data are made to compare accuracies and to examine the dependence of the solution on the initial profile.

Fleming, H. E.↗

The Half Monte Carlo Method: Combining Total Monte Carlo with Nuclear Data Sensitivity Profiles

Both Total Monte Carlo (TMC) and Generalized Linear Least Squares (GLLS) algorithms have been used extensively to perform nuclear uncertainty propagation. Both methods have strengths and weaknesses, for example, the time required to perform TMC limits its attractiveness, while GLLS cannot generate higher order moments of output distributions and also has trouble dealing with nonlinear distributions. This work uses a new method that overcomes many of the aforementioned limitations of TMC and GLLS, while at the same time reasonably reproduces the TMC result. The concept is a simple combination of the two methods i.e., generate the random nuclear data files using the TMC approach, and then propagate the effect on the integral parameters like k{sub eff} using sensitivity coefficients, as opposed to cumbersome neutron transport calculations. Agreement is demonstrated for the Jezebel sphere ICSBEP benchmark. Since the method is part TMC part GLLS, the term Half Monte Method (HMM) will be used.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Zhang, Hong↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

Data Retrieval Algorithms for Validating the Optical Transient Detector and the Lightning Imaging Sensor

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions. Solutions for the plane (i.e., no earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated datasets, and the relative influence of bearing and arrival time data an the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA:s Optical Transient Detector and Lightning Imaging Sensor. A quadratic planar solution that is useful when only three arrival time measurements are available is also introduced. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in sc)iirce location, Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated datasets, and the results are generally better than those obtained from the three-station linear planar method when bearing errors are about 2 deg.

Koshak, W. J.↗

The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: A careful study of the boundary error

The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: (1) impose the exact boundary condition only at the end of the complete RK cycle, (2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases, results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.

Carpenter, Mark H.↗

Density Functional Theory Study on Electronic Structures and Magnetism for Nitrogen-Doped ZnS

Using the full-potential linearized augmented plane wave method, together with the generalized gradient approximation and modified Becke-Johnson as correlation potential, the electronic structures and magnetism for nitrogen-doped ZnS are investigated. Based on the generalized gradient approximation, calculations show nitrogen-substituting sulfur (N{sub S}) would induce the ZnS to be paramagnetic metal. As the band gap increasing to the experimental results (obtained by the modified Becke-Johnson potential), the N{sub S} defects would induce the ZnS to be a ferromagnetic metal. The total magnetic moment for ZnS supercell with single N{sub S} defect is 0.85 μ{sub B}. Positive chemical pair interactions imply that N{sub S} defects would form homogeneous distribution in ZnS host. Sulfur vacancies would give rise to the ZnS with N{sub S} defects system losing the magnetism. Moderate formation energy (0.71 eV) indicates ZnS with N{sub S} defects could be fabricated experimentally.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dynamic graphs, community detection, and Riemannian geometry

A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time {dynamic community detection} and present a framework based on Riemannian geometry to aid in this task. Our framework currently supports several important operations such as interpolating between and averaging over graph snapshots. We compare these Riemannian methods with entry-wise linear interpolation and that the Riemannian methods are generally better suited to dynamic community detection. Next steps with the Riemannian framework include developing higher-order interpolation methods (e.g. the analogues of polynomial and spline interpolation) and a Riemannian least-squares regression method for working with noisy data.

dynamic community detection↗