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 1,459 records · Page 81

Penalized ensemble Kalman filters for high dimensional non-linear systems

The ensemble Kalman filter (EnKF) is a data assimilation technique that uses an ensemble of models, updated with data, to track the time evolution of a usually non-linear system. It does so by using an empirical approximation to the well-known Kalman filter. However, its performance can suffer when the ensemble size is smaller than the state space, as is often necessary for computationally burdensome models. This scenario means that the empirical estimate of the state covariance is not full rank and possibly quite noisy. To solve this problem in this high dimensional regime, we propose a computationally fast and easy to implement algorithm called the penalized ensemble Kalman filter (PEnKF). Under certain conditions, it can be theoretically proven that the PEnKF will be accurate (the estimation error will converge to zero) despite having fewer ensemble members than state dimensions. Further, as contrasted to localization methods, the proposed approach learns the covariance structure associated with the dynamical system. These theoretical results are supported with simulations of several non-linear and high dimensional systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution of complex nonlinear problems by a generalized application of the method of base and comparison solutions with applications to aerodynamics problems

A theory for obtaining approximate solutions to nonlinear problems whose exact solutions require the use of large computational procedures is described. The technique represents in some respects a generalization of the method of base and comparison solutions for flows depending on a parameter. For the generalized problem, the input variable is no longer a parameter but a function that is incremented over its entire domain. After performing calculations for a base configuration and a small number of variations of it, solutions for a large class of configurations can be obtained by forming linear combinations of the solution increments. For a restricted class of problems, approximate solutions can be obtained for general variations of a base configuration by using a function-space derivative estimate obtained from a base solution and a single variation.

Barger, R. L.↗

The 20 x 20 high speed microwave switches

Tests were conducted at NASA Lewis Research Center to characterize the proof-of-concept matrix switches built under NASA contract by Ford Aerospace and Aeronautics Corporation at Palo Alto, California, and the General Electric Company at Valley Forge, Pennsylvania. The contract requirements and goals are tabulated along with the results of the NASA tests. Characteristics examined are bandwidth, insertion loss, ripple, switching speed, isolation, standing wave ratio (input and output), deviation from linear phase, noise figure, reconfiguration rates, spurious responses, gain compression, and third order intermodulation distortion. A brief description of the testing method and a statistical analysis of the test results for each of the switches are provided.

Saunders, A.↗

Error control techniques for satellite and space communications

Shannon's capacity bound shows that coding can achieve large reductions in the required signal to noise ratio per information bit (E sub b/N sub 0 where E sub b is the energy per bit and (N sub 0)/2 is the double sided noise density) in comparison to uncoded schemes. For bandwidth efficiencies of 2 bit/sym or greater, these improvements were obtained through the use of Trellis Coded Modulation and Block Coded Modulation. A method of obtaining these high efficiencies using multidimensional Multiple Phase Shift Keying (MPSK) and Quadrature Amplitude Modulation (QAM) signal sets with trellis coding is described. These schemes have advantages in decoding speed, phase transparency, and coding gain in comparison to other trellis coding schemes. Finally, a general parity check equation for rotationally invariant trellis codes is introduced from which non-linear codes for two dimensional MPSK and QAM signal sets are found. These codes are fully transparent to all rotations of the signal set.

Costello, Daniel J., Jr.↗

A General Purpose Sparse Matrix Parallel Solvers Package

A general purpose solver package for constructing and solving a range of sparse linear systems arising from discretization of PDEs on unstructured meshes is developed. Once the sparse symmetric complex matrix is constructed, it can be solved by either a preconditioned bi-conjugate gradient solver, a two-stage Cholesky LDLT factorization solver, or a hybrid solver combining the above two methods.

solver sparse matrix solvers package PDE↗

A General Purpose Sparse Matrix Parallel Solvers Package

A general purpose solver package for constructing and solving a range of sparse linear systems arising from discretization of PDEs on unstructured meshes is developed. Once the sparse symmetric complex matrix is constructed, it can be solved by either a preconditioned bi-conjugate gradient solver, a two-stage Cholesky LDLT factorization solver, or a hybrid solver combining the above two methods. (More detailed than 95-0127).

solver sparse matrix solvers package PDE↗

Improvements in Iterative Convergence of FUN3D Solutions

This paper presents a hierarchical adaptive nonlinear iteration method (HANIM) implemented in the NASA computational fluid dynamics code, FUN3D, to improve robustness and computational efficiency. In contrast to the legacy FUN3D iterative solver that relies on an approximate Jacobian, a simple multicolor Gauss-Seidel point-implicit iteration scheme, and linear Courant-Friedrichs-Lewy number (CFL) ramping, HANIM is based upon a hierarchy of modules including preconditioner, generalized conjugate residual, realizability check, nonlinear control, and CFL adaption modules. HANIM performance is systematically compared with the performance of the legacy solver of FUN3D and a baseline solver based on a preconditioner alone. Iterative solutions are compared for three benchmark cases: a subsonic separated flow around a hemisphere cylinder, a supersonic flow through a long duct, and a subsonic flow over the NASA wing-fuselage juncture model. Two Reynolds-averaged Navier-Stokes turbulence models are used in these computations, namely, the negative variant of the linear one-equation Spalart-Allmaras model and its nonlinear extension based on quadratic constitutive relations.

CFD↗

Fluid-powered linear motor with rotary pistons and motion rectifier

A fluid-powered linear motor with rotary pistons is disclosed. An application is for a downhole motor but it could be used in other applications. Rotational pistons provide increased torque generation as the torque generated is proportional to motor length. Since downhole drills are long (generally up to a maximum length of 30 ft.), a high-torque motor can be produced using this method. A pressurized fluid is used to drive the piston assemblies to produce bit shaft power. This concept employs rotary pistons and a mechanical rectifier to convert the rotational reciprocation produced by a reciprocating rotational piston into continuous rotary motion.

42 ENGINEERING↗

Fluid-powered linear motor with rotary pistons and motion rectifier and synthetic diamond bearing assemblies

A fluid-powered linear motor with rotary pistons is disclosed. An application is for a downhole motor but it could be used in other applications. Rotational pistons provide increased torque generation as the torque generated is proportional to motor length. Since downhole drills are long (generally up to a maximum length of 30 ft.), a high-torque motor can be produced using this method. A pressurized fluid is used to drive the piston assemblies to produce bit shaft power. This concept employs rotary pistons and a mechanical rectifier to convert the rotational reciprocation produced by a reciprocating rotational piston into continuous rotary motion. Integration of synthetic diamond bearing assemblies into the motor allows for reduced friction and abrasive drilling fluid compatibility.

Raymond, David W.↗

Nonperturbative Algorithm for the Resistive Wall Impedance of General Cross-Section Beam Pipes.

Nonperturbative algorithm for the resistive wall impedance of general cross-section beam pipes; ABSTRACT = We present an algorithm for calculating the impedance of infinitely long beam pipes with arbitrary cross section. The method is not restricted to ultrarelativistic beams or perturbative approximations with respect to the wall surface impedance or skin penetration depth. We exemplify our algorithm with a calculation of the impedance for rectangular metallic beam pipes. Unlike the situation in the perturbative regime, where the beam pipe geometry modifies the metallic resistive-wall impedances by only a multiplicative factor, the beam pipe geometry has a more complex influence on the impedance when nonultrarelativistic effects are significant and in the ultrarelativistic regime at both small and large frequencies. Since our algorithm requires the boundary conditions at the beam pipe wall to be provided as linear relations between the transverse components of the electromagnetic field, we discuss a general algorithm to calculate these boundary conditions for multilayer beam pipes with arbitrary cross section.

Macridin, Alexandru↗

Enabling in-time Prognostics with Surrogate Modeling through Physics-enhanced Dynamic Mode Decomposition Method

Computational models provide essential quantitative tools for assessing and predicting the health and performance of physical systems. However, high-fidelity models are rarely used in real-time operations or large optimization loops, due to their time-intensive nature. A common approach to improving computational efficiency of prognosis is to employ surrogate models. Such models can significantly decrease computation time for some accuracy loss. In this context, use of Dynamic Mode Decomposition (DMD) is proposed to generate surrogate models for lithium-ion (Li-ion) battery discharge. DMD has been suggested and used successfully in the area of fluid dynamics for over a decade, but it has not been applied to the PHM domain, where far-ahead prediction of nonlinear behavior is crucial to propagate faults or predict Remaining Useful Life (RUL). For Li-ion battery health management, the standard application of DMD using only the observable quantities of interest was unable to capture the nonlinear discharge of batteries exhibited in lab testing. The Koopman theory, however, provides a mechanism to tradeoff low dimensional nonlinear models with high-dimensional linear ones in a DMD framework, by augmenting nonlinear state variables into the system representation. In this way, DMD allows for configurable simulation accuracy dependent on the dimensionality of the Koopman operator. For battery health management, we augmented the observable variables with the hidden states of a higher-fidelity physics model to build the DMD surrogate. In comparison to a high-fidelity model, the surrogate improved computational efficiency with only a minimal loss of accuracy, and enabled long-term prognostics horizons. A generalized method for this was implemented in the prog models python package.

prognostics and health management↗

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Focused wave interactions with floating structures: a blind comparative study

The paper presents results from the Collaborative Computational Project in Wave Structure Interaction (CCP-WSI) Blind Test Series 2. Without prior access to the physical data, participants, with numerical methods ranging from low-fidelity linear models to fully non-linear Navier-Stokes (NS) solvers, simulate the interaction between focused wave events and two separate, taut-moored, floating structures: a hemispherical-bottomed cylinder and a cylinder with a moonpool. The ‘blind’ numerical predictions for heave, surge, pitch and mooring load, are compared against physical measurements. Dynamic time warping is used to quantify the predictive capability of participating methods. In general, NS solvers and hybrid methods give more accurate predictions; however, heave amplitude is predicted reasonably well by all methods; and a WEC-Sim implementation, with CFD-informed viscous terms, demonstrates comparable predictive capability to even the stronger NS solvers. Large variations in the solutions are observed (even among similar methods), highlighting a need for standardisation in the numerical modelling of WSI problems.

42 ENGINEERING↗

Generalization of mixed multiscale finite element methods with applications

Many science and engineering problems exhibit scale disparity and high contrast. The small scale features cannot be omitted in the physical models because they can affect the macroscopic behavior of the problems. However, resolving all the scales in these problems can be prohibitively expensive. As a consequence, some types of model reduction techniques are required to design efficient solution algorithms. For practical purpose, we are interested in mixed finite element problems as they produce solutions with certain conservative properties. Existing multiscale methods for such problems include the mixed multiscale finite element methods. We show that for complicated problems, the mixed multiscale finite element methods may not be able to produce reliable approximations. This motivates the need of enrichment for coarse spaces. Two enrichment approaches are proposed, one is based on generalized multiscale finte element metthods (GMsFEM), while the other is based on spectral element-based algebraic multigrid (rAMGe). The former one, which is called mixed GMsFEM, is developed for both Darcy’s flow and linear elasticity. Application of the algorithm in two-phase flow simulations are demonstrated. For linear elasticity, the algorithm is subtly modified due to the symmetry requirement of the stress tensor. The latter enrichment approach is based on rAMGe. The algorithm differs from GMsFEM in that both of the velocity and pressure spaces are coarsened. Due the multigrid nature of the algorithm, recursive application is available, which results in an efficient multilevel construction of the coarse spaces. Stability, convergence analysis, and exhaustive numerical experiments are carried out to validate the proposed enrichment approaches. iii

97 MATHEMATICS AND COMPUTING↗

Designing linear lattices for round beam in electron storage rings using the solution by linear matrices analysis

For some synchrotron light source beamline applications, a round beam is preferable to a flat one. A conventional method of obtaining round beam in an electron storage ring is to shift its tune close to a linear difference resonance. The linearly coupled beam dynamics is analyzed with perturbation theories, which have certain limitations. In this paper, we adopt the Solution by LInear Matrices (SLIM) analysis to calculate exact beam sizes to design round beam lattices. The SLIM analysis can deal with a generally linearly coupled accelerator lattice. The effects of various coupling sources on beam emittances and sizes can be studied within a self-consistent frame. Both the on- and off-resonance schemes to obtain round beams are explained with examples. The SLIM formalism for two widely used magnet models: combined-function bending magnets, and planar wigglers and undulators, is also derived.

43 PARTICLE ACCELERATORS↗

Plasmoid Instability in Forming Current Sheets

The plasmoid instability has revolutionized our understanding of magnetic reconnection in astrophysical environments. By preventing the formation of highly elongated reconnection layers, it is crucial in enabling the rapid energy conversion rates that are characteristic of many astrophysical phenomena. Most previous studies have focused on Sweet–Parker current sheets, which are unattainable in typical astrophysical systems. Here we derive a general set of scaling laws for the plasmoid instability in resistive and visco-resistive current sheets that evolve over time. Our method relies on a principle of least time that enables us to determine the properties of the reconnecting current sheet (aspect ratio and elapsed time) and the plasmoid instability (growth rate, wavenumber, inner layer width) at the end of the linear phase. After this phase the reconnecting current sheet is disrupted and fast reconnection can occur. The scaling laws of the plasmoid instability are not simple power laws, and they depend on the Lundquist number (S), the magnetic Prandtl number (P m ), the noise of the system (${\psi }_{0}$), the characteristic rate of current sheet evolution ($1/\tau $), and the thinning process. We also demonstrate that previous scalings are inapplicable to the vast majority of astrophysical systems. Furthermore, we explore the implications of the new scaling relations in astrophysical systems such as the solar corona and the interstellar medium. In both of these systems, we show that our scaling laws yield values for the growth rate, wavenumber, and aspect ratio that are much smaller than the Sweet–Parker–based scalings.

Sun: flares↗

Refining Linear Fuzzy Rules by Reinforcement Learning

Linear fuzzy rules are increasingly being used in the development of fuzzy logic systems. Radial basis functions have also been used in the antecedents of the rules for clustering in product space which can automatically generate a set of linear fuzzy rules from an input/output data set. Manual methods are usually used in refining these rules. This paper presents a method for refining the parameters of these rules using reinforcement learning which can be applied in domains where supervised input-output data is not available and reinforcements are received only after a long sequence of actions. This is shown for a generalization of radial basis functions. The formation of fuzzy rules from data and their automatic refinement is an important step in closing the gap between the application of reinforcement learning methods in the domains where only some limited input-output data is available.

Berenji, Hamid R.↗