An adaptive volumetric flux boundary condition for lattice Boltzmann methods
Not Available
SEARCH · Engineering Papers
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.
Not Available
In this study, a phase fault detection algorithm is developed by employing the envelope detector method. The proposed method diagnoses faults among phases and defines fault areas in the incoming signal. The designed algorithm consists of three steps: analytical signal conversion, complex magnitude, and fault detection. Initially, an analytical signal is obtained from the incoming power signal to determine the instantaneous amplitude and phase of the signal. A complex magnitude operation is applied to analytical signals to display changes in amplitude. On the basis of the threshold values specified by the user, the last step identifies the distortion signal in terms of the type of error and size. The proposed method is tested with realistically simulated substation power signal data and real power system data from the Grid Event Signature Library. The obtained results revealed that the proposed method detects distortions accurately.
In this paper, a novel methodology for modeling ice-ice aggregation is presented. This methodology combines a modified hydrodynamic collection algorithm with bulk aggregate characteristic information from an offline simulator that collects ice particles, namely, the Ice Particle and Aggregate Simulator, and has been implemented into the Adaptive Habit Microphysics scheme in the Weather Research and Forecasting Model. Aggregates, or snow, are formed via collection of cloud ice particles, where initial ice characteristics and the resulting geometry determine aggregate characteristics. Upon implementation, idealized squall-line simulations are performed to examine the new methodology in comparison with commonly used bulk microphysics schemes. It is found that the adaptive habit aggregation parameterization develops snow and reduces ice mass and number concentrations compared to other schemes. The development of aggregates through the new methodology cascades into other interesting effects, including enhancements in ice and snow growth, as well as homogeneous freezing. Further microphysical analyses reveal varying sensitivities, where snow processes are most sensitive to the new parameterization, followed by ice, then cloud, rain, and graupel processes. Further, the new scheme results in enhancements in surface precipitation due to the persistence of snow at lower altitudes. This persistence is a result of shape-dependent melting and sublimation, increasing the residence time. Moreover, these low-level enhancements are reflected in increases in radar reflectivity at the surface and its spatial distribution. Finally, the ability to predict snow shape and density allows for the simulation of polarimetric radar quantities, resulting in signature enhancements compared to schemes that do not consider spatial and temporal variations in snow shape and density.
Linear discrete time stochastic system with unknown gain parameters, interpreting open loop feedback optimal control identifier and controller equations
Two basic factors influence the design of highly reliable computer systems: the amount of failures required to be tol erated and the reliability or MTBF required. A computer system designed to tolerate any three single failures in a fail-operational-fail-operational-fail-safe manner for a real-time control application is presented. The design approach uses adaptive majority voting in both hardware and software with a four-level redundant system. Various methods of performing the adaptive majority voting functions were evaluated with the selected approach using a special module termed a voter-comparator switch (VCS). The VCS module allows the computer system to be operated in a variety of redundant modes, depending on the failure tolerance required at any particular time.
The problem of position and force control for the compliant motion of the manipulators is considered. The external force and the position of the end-effector are related by a second order impedance function. The force control problem is then translated into a position control problem. For that, an adaptive controller is designed to achieve the compliant motion. The design uses the Liapunov's direct method to derive the adaptation law. The stability of the process is guaranteed from the Liapunov's stability theory. The controller does not require the knowledge of the system parameters for the implementation, and hence is easy for applications.
One difficulty in using Kalman filters in real world situations is the selection of the correct process noise, measurement noise, and initial state estimate and covariance. These parameters are commonly referred to as tuning parameters. Multiple methods have been developed to estimate these parameters. Most of those methods such as maximum likelihood, subspace, and observer Kalman Identification require extensive offline processing and are not suitable for real time processing. One technique, which is suitable for real time processing, is the residual tuning method. Any mismodeling of the filter tuning parameters will result in a non-white sequence for the filter measurement residuals. The residual tuning technique uses this information to estimate corrections to those tuning parameters. The actual implementation results in a set of sequential equations that run in parallel with the Kalman filter. A. H. Jazwinski developed a specialized version of this technique for estimation of process noise. Equations for the estimation of the measurement noise have also been developed. These algorithms are used to estimate the process noise and measurement noise for the Wide Field Infrared Explorer star tracker and gyro.
One difficulty in using Kalman filters in real world situations is the selection of the correct process noise, measurement noise, and initial state estimate and covariance. These parameters are commonly referred to as tuning parameters. Multiple methods have been developed to estimate these parameters. Most of those methods such as maximum likelihood, subspace, and observer Kalman Identification require extensive offline processing and are not suitable for real time processing. One technique, which is suitable for real time processing, is the residual tuning method. Any mismodeling of the filter tuning parameters will result in a non-white sequence for the filter measurement residuals. The residual tuning technique uses this information to estimate corrections to those tuning parameters. The actual implementation results in a set of sequential equations that run in parallel with the Kalman filter. Equations for the estimation of the measurement noise have also been developed. These algorithms are used to estimate the process noise and measurement noise for the Wide Field Infrared Explorer star tracker and gyro.
The invention comprises a method and/or an apparatus using computer configured exercise equipment and an electric motor provided physical resistance in conjunction with a game system, such as a video game system, where the exercise system provides real physical resistance to a user interface. Results of user interaction with the user interface are integrated into a video game, such as running on a game console. The resistance system comprises: a subject interface, software control, a controller, an electric servo assist/resist motor, an actuator, and/or a subject sensor. The system provides actual physical interaction with a resistance device as input to the game console and game run thereon.
Using a simple dynamical model of a wind-driven ocean circulation of the Stommel type, and an analytical basis developed to objectively analyze the sea surface height residuals from an altimeter and, in the process, to determine the total flow instead of just the near surface geostrophic component associated with the given sea surface topography. The method is based on first deriving the solution to the forced problem for a given wind stress required to develop a hypothetical true or perfect data field and to establishing the basis for the objective analysis. The stream function and the surface height field for the forced problem are developed in terms of certain characteristic functions with the same expansion coefficients for both fields. These characteristic functions are simply the solutions for a homogeneous elliptic equation for the stream function and the solutions of an inhomogeneous balance equation for the height field. For the objective analysis, using a sample of randomly selected height values from the true data field, the height field characteristic functions are used to fit the given topography in a least squares sense. The resulting expansion coefficients then permit the synthesis of the total flow field via the stream function characteristic modes and the solution is perfectly well behaved even along the equator. The method of solution is easily adaptable to realistic ocean basis by straight forward numerical methods. The analytical basis of the theory and the results for an ideal rectangular basin on a beta plane are described.
The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.
This work presents a method to control the discretization error in multipoint aerodynamic shape optimization using output-based adapted meshes. The meshes are adapted via adjoint-based error estimates, taking into account both the objective and constraint output errors. A multi-fidelity optimization framework is then developed by taking advantage of the variable fidelity offered by adaptive meshes. The objective functional and its sensitivity at each design point (operating condition) are first evaluated on the same initial coarse mesh, which is then subsequently adapted for each design point individually as the shape optimization proceeds. The effort to set up the optimization is minimal since the initial mesh can be fairly coarse and easy to generate. As the shape approaches the optimal design, the mesh at each design point becomes finer, in regions necessary for that particular operating condition. The multi-fidelity framework is tightly coupled with the objective error estimation to ensure the optimization accuracy at each fidelity. Computational savings arise from a reduction of the mesh size when the design is far from optimal and avoiding an exhaustive search on low-fidelity meshes. The proposed method is demonstrated on multipoint drag minimization problems of a transonic airfoil with lift and area constraints. Improved accuracy and efficiency are shown compared to traditional fixed-fidelity optimization with a fixed computational mesh.
Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.
Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.
Adaptive unstructured mesh techniques have a limited, but growing impact on production analysis workflows to control discretization error for reliable simulation results. Multiple independent implementations of flow solvers, anisotropic metric construction methods, and anisotropic mesh adaptation mechanics have matured. Goal-based metrics target estimated error in output functions, such as lift and drag, through the guidance of an adjoint solution. A unification of goal-based anisotropic metrics is presented for steady viscous flows, which is an active area of research. These goal-based metrics drive robust and efficient anisotropic mesh adaptation for the calculation of output functions. The super-convergent functional output error behavior of stabilized finite-element methods is exploited without a formal proof, and evidence of super-convergence is shown in numerical experiments. Mesh adapted drag and lift outputs for two simple bodies in compressible viscous flow show convergence of error to less than a single drag count. Asymptotic behavior established for relatively coarse meshes shows the efficiency of this goal-based metric when compared to solution interpolation error control and expert-guided meshing. Anisotropic mesh adaptation techniques are applied to a transport aircraft in a high-lift configuration where variation between approaches decreases with mesh refinement, but asymptotic behavior is not observed with available resources.
A method is described for generating unstructured meshes of triangles or tetrahedra for computational domains of complex geometrical shape. To illustrate the power of the approach, it is applied to the solution of flows past several complete aircraft configurations. The advocated approach allows for the natural incorporation of mesh adaptivity and this is demonstrated for both inviscid and viscous computations in two and three dimensions.
Large-scale multiphysics simulations are computationally challenging due to the coupling of multiple processes with widely disparate time scales. The advent of exascale computing systems exacerbates these challenges since these systems enable ever-increasing size and complexity. In recent years, there has been renewed interest in developing multirate methods as a means to handle the large range of time scales, as these methods may afford greater accuracy and efficiency than more traditional approaches of using implicit-explicit (IMEX) and low-order operator splitting schemes. However, to date there have been few performance studies that compare different classes of multirate integrators on complex application problems. In this work, we study the performance of several newly developed multirate infinitesimal (MRI) methods, implemented in the SUNDIALS solver package, on two reacting flow model problems built on structured mesh frameworks. The first model revisits prior work on a compressible reacting flow problem with complex chemistry that is implemented using BoxLib but where we now include comparisons between a new explicit MRI scheme with the multirate spectral deferred correction (SDC) methods in the original paper. The second problem uses the same complex chemistry as the first problem, combined with a simplified flow model, but runs at a large spatial scale where explicit methods become infeasible due to stability constraints. Two recently developed IMEX MRI multirate methods are tested. These methods rely on advanced features of the AMReX framework on which the model is built, such as multilevel grids and multilevel preconditioners. The results from these two problems show that MRI multirate methods can offer significant performance benefits on complex multiphysics application problems and that these methods may be combined with advanced spatial discretization to compound the advantages of both.
To accurately model inviscid flow with shock waves using staggered-grid Lagrangian hydrodynamics, artificial viscosity is introduced to convert kinetic energy into internal energy, thereby providing a mechanism to generate the required entropy increase across shocks. In this paper, we propose a new method for constructing an adaptive, artificial viscosity in the context of one-dimensional, staggered-grid Lagrangian hydrodynamics. Our adaptive, artificial viscosity is defined in terms of two parameters that depend on density locally in a neighborhood around a shock, and hence, vary cell-by-cell. Our methodology is based on building a reference set of pre-computed optimal, globally constant artificial viscosity coefficients for a family of isolated shock test problems. For arbitrary flows, the evaluation of the unknown coefficients is automated by first estimating shock intensity locally, and second computing the corresponding adaptive parameter value via interpolation over the data from the pre-computed reference set of optimal, globally constant coefficient values. To illustrate the performance of our new approach, we compare our results against two existing methods. The first method is a limiter-based approach, which relies on estimating velocity gradients of the flow, and the second method is utilized in several commercial codes. Finally, we demonstrate that our new adaptive methodology produces more accurate results for a variety of tests with propagating shock waves, as well as for the aforementioned family of isolated shock problems.