#### Sample records for adaptive grid method

1. Structured adaptive grid generation using algebraic methods

NASA Technical Reports Server (NTRS)

Yang, Jiann-Cherng; Soni, Bharat K.; Roger, R. P.; Chan, Stephen C.

1993-01-01

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration

2. An Adaptive Unstructured Grid Method by Grid Subdivision, Local Remeshing, and Grid Movement

NASA Technical Reports Server (NTRS)

1999-01-01

An unstructured grid adaptation technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The approach is based on a combination of grid subdivision, local remeshing, and grid movement. For solution adaptive grids, the surface triangulation is locally refined by grid subdivision, and the tetrahedral grid in the field is partially remeshed at locations of dominant flow features. A grid redistribution strategy is employed for geometric adaptation of volume grids to moving or deforming surfaces. The method is automatic and fast and is designed for modular coupling with different solvers. Several steady state test cases with different inviscid flow features were tested for grid/solution adaptation. In all cases, the dominant flow features, such as shocks and vortices, were accurately and efficiently predicted with the present approach. A new and robust method of moving tetrahedral "viscous" grids is also presented and demonstrated on a three-dimensional example.

3. Moving and adaptive grid methods for compressible flows

NASA Technical Reports Server (NTRS)

Trepanier, Jean-Yves; Camarero, Ricardo

1995-01-01

This paper describes adaptive grid methods developed specifically for compressible flow computations. The basic flow solver is a finite-volume implementation of Roe's flux difference splitting scheme or arbitrarily moving unstructured triangular meshes. The grid adaptation is performed according to geometric and flow requirements. Some results are included to illustrate the potential of the methodology.

4. Comparing Anisotropic Output-Based Grid Adaptation Methods by Decomposition

NASA Technical Reports Server (NTRS)

Park, Michael A.; Loseille, Adrien; Krakos, Joshua A.; Michal, Todd

2015-01-01

Anisotropic grid adaptation is examined by decomposing the steps of flow solution, ad- joint solution, error estimation, metric construction, and simplex grid adaptation. Multiple implementations of each of these steps are evaluated by comparison to each other and expected analytic results when available. For example, grids are adapted to analytic metric fields and grid measures are computed to illustrate the properties of multiple independent implementations of grid adaptation mechanics. Different implementations of each step in the adaptation process can be evaluated in a system where the other components of the adaptive cycle are fixed. Detailed examination of these properties allows comparison of different methods to identify the current state of the art and where further development should be targeted.

5. Workshop on adaptive grid methods for fusion plasmas

SciTech Connect

Wiley, J.C.

1995-07-01

The author describes a general `hp` finite element method with adaptive grids. The code was based on the work of Oden, et al. The term `hp` refers to the method of spatial refinement (h), in conjunction with the order of polynomials used as a part of the finite element discretization (p). This finite element code seems to handle well the different mesh grid sizes occuring between abuted grids with different resolutions.

6. Grid adaptation and remapping for arbitrary lagrangian eulerian (ALE) methods

SciTech Connect

Lapenta, G. M.

2002-01-01

Methods to include automatic grid adaptation tools within the Arbitrary Lagrangian Eulerian (ALE) method are described. Two main developments will be described. First, a new grid adaptation approach is described, based on an automatic and accurate estimate of the local truncation error. Second, a new method to remap the information between two grids is presented, based on the MPDATA approach. The Arbitrary Lagrangian Eulerian (ALE) method solves hyperbolic equations by splitting the operators is two phases. First, in the Lagrangian phase, the equations under consideration are written in a Lagrangian frame and are discretized. In this phase, the grid moves with the solution, the velocity of each node being the local fluid velocity. Second, in the Eulerian phase, a new grid is generated and the information is transferred to the new grid. The advantage of considering this second step is the possibility of avoiding mesh distortion and tangling typical of pure Lagrangian methods. The second phase of the ALE method is the primary topic of the present communication. In the Eulerian phase two tasks need to be completed. First, a new grid need to be created (we will refer to this task as rezoning). Second, the information is transferred from the grid available at the end of the Lagrangian phase to the new grid (we will refer to this task as remapping). New techniques are presented for the two tasks of the Eulerian phase: rezoning and remapping.

7. An adaptive Cartesian grid generation method for Dirty geometry

Wang, Z. J.; Srinivasan, Kumar

2002-07-01

Traditional structured and unstructured grid generation methods need a water-tight boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if non-water-tight geometries are given. Significant user time can be taken to repair or clean a dirty geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently connected to the boundary, and the boundary grid is a result of this connection. A significant advantage of the I2B approach is that dirty geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle dirty geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright

8. Methods for prismatic/tetrahedral grid generation and adaptation

NASA Technical Reports Server (NTRS)

Kallinderis, Y.

1995-01-01

The present work involves generation of hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is a method for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A High Speed Civil Transport (HSCT) type of aircraft geometry is considered. The generated hybrid grid required only 170 K tetrahedra instead of an estimated two million had a tetrahedral mesh been used in the prisms region as well. A solution adaptive scheme for viscous computations on hybrid grids is also presented. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples 3-D, isotropic division of tetrahedra and 2-D, directional division of prisms.

9. Efficient Unstructured Grid Adaptation Methods for Sonic Boom Prediction

NASA Technical Reports Server (NTRS)

Campbell, Richard L.; Carter, Melissa B.; Deere, Karen A.; Waithe, Kenrick A.

2008-01-01

This paper examines the use of two grid adaptation methods to improve the accuracy of the near-to-mid field pressure signature prediction of supersonic aircraft computed using the USM3D unstructured grid flow solver. The first method (ADV) is an interactive adaptation process that uses grid movement rather than enrichment to more accurately resolve the expansion and compression waves. The second method (SSGRID) uses an a priori adaptation approach to stretch and shear the original unstructured grid to align the grid with the pressure waves and reduce the cell count required to achieve an accurate signature prediction at a given distance from the vehicle. Both methods initially create negative volume cells that are repaired in a module in the ADV code. While both approaches provide significant improvements in the near field signature (< 3 body lengths) relative to a baseline grid without increasing the number of grid points, only the SSGRID approach allows the details of the signature to be accurately computed at mid-field distances (3-10 body lengths) for direct use with mid-field-to-ground boom propagation codes.

10. Methods for prismatic/tetrahedral grid generation and adaptation

Kallinderis, Y.

1995-10-01

The present work involves generation of hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is a method for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A High Speed Civil Transport (HSCT) type of aircraft geometry is considered. The generated hybrid grid required only 170 K tetrahedra instead of an estimated two million had a tetrahedral mesh been used in the prisms region as well. A solution adaptive scheme for viscous computations on hybrid grids is also presented. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples 3-D, isotropic division of tetrahedra and 2-D, directional division of prisms.

11. ICASE/LaRC Workshop on Adaptive Grid Methods

NASA Technical Reports Server (NTRS)

South, Jerry C., Jr. (Editor); Thomas, James L. (Editor); Vanrosendale, John (Editor)

1995-01-01

Solution-adaptive grid techniques are essential to the attainment of practical, user friendly, computational fluid dynamics (CFD) applications. In this three-day workshop, experts gathered together to describe state-of-the-art methods in solution-adaptive grid refinement, analysis, and implementation; to assess the current practice; and to discuss future needs and directions for research. This was accomplished through a series of invited and contributed papers. The workshop focused on a set of two-dimensional test cases designed by the organizers to aid in assessing the current state of development of adaptive grid technology. In addition, a panel of experts from universities, industry, and government research laboratories discussed their views of needs and future directions in this field.

12. A simplified self-adaptive grid method, SAGE

NASA Technical Reports Server (NTRS)

Davies, C.; Venkatapathy, E.

1989-01-01

The formulation of the Self-Adaptive Grid Evolution (SAGE) code, based on the work of Nakahashi and Deiwert, is described in the first section of this document. The second section is presented in the form of a user guide which explains the input and execution of the code, and provides many examples. Application of the SAGE code, by Ames Research Center and by others, in the solution of various flow problems has been an indication of the code's general utility and success. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for single, zonal, and multiple grids. Modifications to the methodology and the simplified input options make this current version a flexible and user-friendly code.

13. On Accuracy of Adaptive Grid Methods for Captured Shocks

NASA Technical Reports Server (NTRS)

Yamaleev, Nail K.; Carpenter, Mark H.

2002-01-01

The accuracy of two grid adaptation strategies, grid redistribution and local grid refinement, is examined by solving the 2-D Euler equations for the supersonic steady flow around a cylinder. Second- and fourth-order linear finite difference shock-capturing schemes, based on the Lax-Friedrichs flux splitting, are used to discretize the governing equations. The grid refinement study shows that for the second-order scheme, neither grid adaptation strategy improves the numerical solution accuracy compared to that calculated on a uniform grid with the same number of grid points. For the fourth-order scheme, the dominant first-order error component is reduced by the grid adaptation, while the design-order error component drastically increases because of the grid nonuniformity. As a result, both grid adaptation techniques improve the numerical solution accuracy only on the coarsest mesh or on very fine grids that are seldom found in practical applications because of the computational cost involved. Similar error behavior has been obtained for the pressure integral across the shock. A simple analysis shows that both grid adaptation strategies are not without penalties in the numerical solution accuracy. Based on these results, a new grid adaptation criterion for captured shocks is proposed.

14. Adaptive grid methods for RLV environment assessment and nozzle analysis

NASA Technical Reports Server (NTRS)

Thornburg, Hugh J.

1996-01-01

Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation

15. Parallel architectures for iterative methods on adaptive, block structured grids

NASA Technical Reports Server (NTRS)

Gannon, D.; Vanrosendale, J.

1983-01-01

A parallel computer architecture well suited to the solution of partial differential equations in complicated geometries is proposed. Algorithms for partial differential equations contain a great deal of parallelism. But this parallelism can be difficult to exploit, particularly on complex problems. One approach to extraction of this parallelism is the use of special purpose architectures tuned to a given problem class. The architecture proposed here is tuned to boundary value problems on complex domains. An adaptive elliptic algorithm which maps effectively onto the proposed architecture is considered in detail. Two levels of parallelism are exploited by the proposed architecture. First, by making use of the freedom one has in grid generation, one can construct grids which are locally regular, permitting a one to one mapping of grids to systolic style processor arrays, at least over small regions. All local parallelism can be extracted by this approach. Second, though there may be a regular global structure to the grids constructed, there will be parallelism at this level. One approach to finding and exploiting this parallelism is to use an architecture having a number of processor clusters connected by a switching network. The use of such a network creates a highly flexible architecture which automatically configures to the problem being solved.

16. A wavelet-optimized, very high order adaptive grid and order numerical method

NASA Technical Reports Server (NTRS)

Jameson, Leland

1996-01-01

Differencing operators of arbitrarily high order can be constructed by interpolating a polynomial through a set of data followed by differentiation of this polynomial and finally evaluation of the polynomial at the point where a derivative approximation is desired. Furthermore, the interpolating polynomial can be constructed from algebraic, trigonometric, or, perhaps exponential polynomials. This paper begins with a comparison of such differencing operator construction. Next, the issue of proper grids for high order polynomials is addressed. Finally, an adaptive numerical method is introduced which adapts the numerical grid and the order of the differencing operator depending on the data. The numerical grid adaptation is performed on a Chebyshev grid. That is, at each level of refinement the grid is a Chebvshev grid and this grid is refined locally based on wavelet analysis.

17. Three-dimensional self-adaptive grid method for complex flows

NASA Technical Reports Server (NTRS)

Djomehri, M. Jahed; Deiwert, George S.

1988-01-01

A self-adaptive grid procedure for efficient computation of three-dimensional complex flow fields is described. The method is based on variational principles to minimize the energy of a spring system analogy which redistributes the grid points. Grid control parameters are determined by specifying maximum and minimum grid spacing. Multidirectional adaptation is achieved by splitting the procedure into a sequence of successive applications of a unidirectional adaptation. One-sided, two-directional constraints for orthogonality and smoothness are used to enhance the efficiency of the method. Feasibility of the scheme is demonstrated by application to a multinozzle, afterbody, plume flow field. Application of the algorithm for initial grid generation is illustrated by constructing a three-dimensional grid about a bump-like geometry.

18. A time-accurate adaptive grid method and the numerical simulation of a shock-vortex interaction

NASA Technical Reports Server (NTRS)

Bockelie, Michael J.; Eiseman, Peter R.

1990-01-01

A time accurate, general purpose, adaptive grid method is developed that is suitable for multidimensional steady and unsteady numerical simulations. The grid point movement is performed in a manner that generates smooth grids which resolve the severe solution gradients and the sharp transitions in the solution gradients. The temporal coupling of the adaptive grid and the PDE solver is performed with a grid prediction correction method that is simple to implement and ensures the time accuracy of the grid. Time accurate solutions of the 2-D Euler equations for an unsteady shock vortex interaction demonstrate the ability of the adaptive method to accurately adapt the grid to multiple solution features.

19. A multigrid method for steady Euler equations on unstructured adaptive grids

NASA Technical Reports Server (NTRS)

Riemslagh, Kris; Dick, Erik

1993-01-01

A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.

Rosen, A. L.; Krumholz, M. R.; Oishi, J. S.; Lee, A. T.; Klein, R. I.

2017-02-01

We present a highly-parallel multi-frequency hybrid radiation hydrodynamics algorithm that combines a spatially-adaptive long characteristics method for the radiation field from point sources with a moment method that handles the diffuse radiation field produced by a volume-filling fluid. Our Hybrid Adaptive Ray-Moment Method (HARM2) operates on patch-based adaptive grids, is compatible with asynchronous time stepping, and works with any moment method. In comparison to previous long characteristics methods, we have greatly improved the parallel performance of the adaptive long-characteristics method by developing a new completely asynchronous and non-blocking communication algorithm. As a result of this improvement, our implementation achieves near-perfect scaling up to O (103) processors on distributed memory machines. We present a series of tests to demonstrate the accuracy and performance of the method.

1. A self-adaptive-grid method with application to airfoil flow

NASA Technical Reports Server (NTRS)

Nakahashi, K.; Deiwert, G. S.

1985-01-01

A self-adaptive-grid method is described that is suitable for multidimensional steady and unsteady computations. Based on variational principles, a spring analogy is used to redistribute grid points in an optimal sense to reduce the overall solution error. User-specified parameters, denoting both maximum and minimum permissible grid spacings, are used to define the all-important constants, thereby minimizing the empiricism and making the method self-adaptive. Operator splitting and one-sided controls for orthogonality and smoothness are used to make the method practical, robust, and efficient. Examples are included for both steady and unsteady viscous flow computations about airfoils in two dimensions, as well as for a steady inviscid flow computation and a one-dimensional case. These examples illustrate the precise control the user has with the self-adaptive method and demonstrate a significant improvement in accuracy and quality of the solutions.

2. A Hyperspherical Adaptive Sparse-Grid Method for High-Dimensional Discontinuity Detection

SciTech Connect

Zhang, Guannan; Webster, Clayton G.; Gunzburger, Max D.; Burkardt, John V.

2015-06-24

This study proposes and analyzes a hyperspherical adaptive hierarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces. The method is motivated by the theoretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a function representation of the discontinuity hypersurface of an N-dimensional discontinuous quantity of interest, by virtue of a hyperspherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyperspherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smoothness of the hypersurface, the new technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. In addition, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous complexity analyses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.

3. New method adaptive to geospatial information acquisition and share based on grid

Fu, Yingchun; Yuan, Xiuxiao

2005-11-01

As we all know, it is difficult and time-consuming to acquire and share multi-source geospatial information in grid computing environment, especially for the data of different geo-reference benchmark. Although middleware for data format transformation has been applied by many grid applications and GIS software systems, it remains difficult to on demand realize spatial data assembly jobs among various geo-reference benchmarks because of complex computation of rigorous coordinate transformation model. To address the problem, an efficient hierarchical quadtree structure referred as multi-level grids is designed and coded to express the multi-scale global geo-space. The geospatial objects located in a certain grid of multi-level grids may be expressed as an increment value which is relative to the grid central point and is constant in different geo-reference benchmark. A mediator responsible for geo-reference transformation function with multi-level grids has been developed and aligned with grid service. With help of the mediator, a map or query spatial data sets from individual source of different geo-references can be merged into an uniform composite result. Instead of complex data pre-processing prior to compatible spatial integration, the introduced method is adaptive to be integrated with grid-enable service.

4. The use of the spectral method within the fast adaptive composite grid method

SciTech Connect

McKay, S.M.

1994-12-31

The use of efficient algorithms for the solution of partial differential equations has been sought for many years. The fast adaptive composite grid (FAC) method combines an efficient algorithm with high accuracy to obtain low cost solutions to partial differential equations. The FAC method achieves fast solution by combining solutions on different grids with varying discretizations and using multigrid like techniques to find fast solution. Recently, the continuous FAC (CFAC) method has been developed which utilizes an analytic solution within a subdomain to iterate to a solution of the problem. This has been shown to achieve excellent results when the analytic solution can be found. The CFAC method will be extended to allow solvers which construct a function for the solution, e.g., spectral and finite element methods. In this discussion, the spectral methods will be used to provide a fast, accurate solution to the partial differential equation. As spectral methods are more accurate than finite difference methods, the ensuing accuracy from this hybrid method outside of the subdomain will be investigated.

5. Application of a self-adaptive grid method to complex flows

NASA Technical Reports Server (NTRS)

Deiwert, G. S.; Venkatapathy, E.; Davies, C.; Djomehri, J.; Abrahamson, K.

1989-01-01

A directional-split, modular, user-friendly grid point distribution code is applied to several test problems. The code is self-adaptive in the sense that grid point spacing is determined by user-specified constants denoting maximum and minimum grid spacings and constants relating the relative influence of smoothness and orthogonality. Estimates of truncation error, in terms of flow-field gradients and/or geometric features, are used to determine the point distribution. Points are redistributed along grid lines in a specified direction in an elliptic manner over a user-specified subdomain, while orthogonality and smoothness are controlled in a parabolic (marching) manner in the remaining directions. Multidirectional adaption is achieved by sequential application of the method in each coordinate direction. The flow-field solution is redistributed onto the newly distributed grid points after each unidirectional adaption by a simple one-dimensional interpolation scheme. For time-accurate schemes such interpolation is not necessary and time-dependent metrics are carried in the fluid dynamic equations to account for grid movement.

6. Stability of a modified Peaceman-Rachford method for the paraxial Helmholtz equation on adaptive grids

Sheng, Qin; Sun, Hai-wei

2016-11-01

This study concerns the asymptotic stability of an eikonal, or ray, transformation based Peaceman-Rachford splitting method for solving the paraxial Helmholtz equation with high wave numbers. Arbitrary nonuniform grids are considered in transverse and beam propagation directions. The differential equation targeted has been used for modeling propagations of high intensity laser pulses over a long distance without diffractions. Self-focusing of high intensity beams may be balanced with the de-focusing effect of created ionized plasma channel in the situation, and applications of grid adaptations are frequently essential. It is shown rigorously that the fully discretized oscillation-free decomposition method on arbitrary adaptive grids is asymptotically stable with a stability index one. Simulation experiments are carried out to illustrate our concern and conclusions.

7. Staggered grid lagrangian method with local structured adaptive mesh refinement for modeling shock hydrodynamics

SciTech Connect

Anderson, R W; Pember, R B; Elliot, N S

2000-09-26

A new method for the solution of the unsteady Euler equations has been developed. The method combines staggered grid Lagrangian techniques with structured local adaptive mesh refinement (AMR). This method is a precursor to a more general adaptive arbitrary Lagrangian Eulerian (ALE-AMR) algorithm under development, which will facilitate the solution of problems currently at and beyond the boundary of soluble problems by traditional ALE methods by focusing computational resources where they are required. Many of the core issues involved in the development of the ALE-AMR method hinge upon the integration of AMR with a Lagrange step, which is the focus of the work described here. The novel components of the method are mainly driven by the need to reconcile traditional AMR techniques, which are typically employed on stationary meshes with cell-centered quantities, with the staggered grids and grid motion employed by Lagrangian methods. These new algorithmic components are first developed in one dimension and are then generalized to two dimensions. Solutions of several model problems involving shock hydrodynamics are presented and discussed.

8. LAPS Grid generation and adaptation

Pagliantini, Cecilia; Delzanno, Gia Luca; Guo, Zehua; Srinivasan, Bhuvana; Tang, Xianzhu; Chacon, Luis

2011-10-01

LAPS uses a common-data framework in which a general purpose grid generation and adaptation package in toroidal and simply connected domains is implemented. The initial focus is on implementing the Winslow/Laplace-Beltrami method for generating non-overlapping block structured grids. This is to be followed by a grid adaptation scheme based on Monge-Kantorovich optimal transport method [Delzanno et al., J. Comput. Phys,227 (2008), 9841-9864], that equidistributes application-specified error. As an initial set of applications, we will lay out grids for an axisymmetric mirror, a field reversed configuration, and an entire poloidal cross section of a tokamak plasma reconstructed from a CMOD experimental shot. These grids will then be used for computing the plasma equilibrium and transport in accompanying presentations. A key issue for Monge-Kantorovich grid optimization is the choice of error or monitor function for equi-distribution. We will compare the Operator Recovery Error Source Detector (ORESD) [Lapenta, Int. J. Num. Meth. Eng,59 (2004) 2065-2087], the Tau method and a strategy based on the grid coarsening [Zhang et al., AIAA J,39 (2001) 1706-1715] to find an ``optimal'' grid. Work supported by DOE OFES.

9. A Hyperspherical Adaptive Sparse-Grid Method for High-Dimensional Discontinuity Detection

DOE PAGES

Zhang, Guannan; Webster, Clayton G.; Gunzburger, Max D.; ...

2015-06-24

This study proposes and analyzes a hyperspherical adaptive hierarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces. The method is motivated by the theoretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a function representation of the discontinuity hypersurface of an N-dimensional discontinuous quantity of interest, by virtue of a hyperspherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyperspherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smoothness of the hypersurface, the newmore » technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. In addition, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous complexity analyses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.« less

10. A hyper-spherical adaptive sparse-grid method for high-dimensional discontinuity detection

SciTech Connect

Zhang, Guannan; Webster, Clayton G; Gunzburger, Max D; Burkardt, John V

2014-03-01

This work proposes and analyzes a hyper-spherical adaptive hi- erarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces is proposed. The method is motivated by the the- oretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a func- tion representation of the discontinuity hyper-surface of an N-dimensional dis- continuous quantity of interest, by virtue of a hyper-spherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyper-spherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smooth- ness of the hyper-surface, the new technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. Moreover, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous error estimates and complexity anal- yses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.

11. A numerical study of 2D detonation waves with adaptive finite volume methods on unstructured grids

Hu, Guanghui

2017-02-01

In this paper, a framework of adaptive finite volume solutions for the reactive Euler equations on unstructured grids is proposed. The main ingredients of the algorithm include a second order total variation diminishing Runge-Kutta method for temporal discretization, and the finite volume method with piecewise linear solution reconstruction of the conservative variables for the spatial discretization in which the least square method is employed for the reconstruction, and weighted essentially nonoscillatory strategy is used to restrain the potential numerical oscillation. To resolve the high demanding on the computational resources due to the stiffness of the system caused by the reaction term and the shock structure in the solutions, the h-adaptive method is introduced. OpenMP parallelization of the algorithm is also adopted to further improve the efficiency of the implementation. Several one and two dimensional benchmark tests on the ZND model are studied in detail, and numerical results successfully show the effectiveness of the proposed method.

12. Parallel level-set methods on adaptive tree-based grids

2016-10-01

We present scalable algorithms for the level-set method on dynamic, adaptive Quadtree and Octree Cartesian grids. The algorithms are fully parallelized and implemented using the MPI standard and the open-source p4est library. We solve the level set equation with a semi-Lagrangian method which, similar to its serial implementation, is free of any time-step restrictions. This is achieved by introducing a scalable global interpolation scheme on adaptive tree-based grids. Moreover, we present a simple parallel reinitialization scheme using the pseudo-time transient formulation. Both parallel algorithms scale on the Stampede supercomputer, where we are currently using up to 4096 CPU cores, the limit of our current account. Finally, a relevant application of the algorithms is presented in modeling a crystallization phenomenon by solving a Stefan problem, illustrating a level of detail that would be impossible to achieve without a parallel adaptive strategy. We believe that the algorithms presented in this article will be of interest and useful to researchers working with the level-set framework and modeling multi-scale physics in general.

13. Adaptive-Grid Methods for Phase Field Models of Microstructure Development

NASA Technical Reports Server (NTRS)

Provatas, Nikolas; Goldenfeld, Nigel; Dantzig, Jonathan A.

1999-01-01

In this work the authors show how the phase field model can be solved in a computationally efficient manner that opens a new large-scale simulational window on solidification physics. Our method uses a finite element, adaptive-grid formulation, and exploits the fact that the phase and temperature fields vary significantly only near the interface. We illustrate how our method allows efficient simulation of phase-field models in very large systems, and verify the predictions of solvability theory at intermediate undercooling. We then present new results at low undercoolings that suggest that solvability theory may not give the correct tip speed in that regime. We model solidification using the phase-field model used by Karma and Rappel.

14. The fundamentals of adaptive grid movement

NASA Technical Reports Server (NTRS)

Eiseman, Peter R.

1990-01-01

Basic grid point movement schemes are studied. The schemes are referred to as adaptive grids. Weight functions and equidistribution in one dimension are treated. The specification of coefficients in the linear weight, attraction to a given grid or a curve, and evolutionary forces are considered. Curve by curve and finite volume methods are described. The temporal coupling of partial differential equations solvers and grid generators was discussed.

NASA Technical Reports Server (NTRS)

Banks, D. W.; Hafez, M. M.

1996-01-01

Grid adaptation for structured meshes is the art of using information from an existing, but poorly resolved, solution to automatically redistribute the grid points in such a way as to improve the resolution in regions of high error, and thus the quality of the solution. This involves: (1) generate a grid vis some standard algorithm, (2) calculate a solution on this grid, (3) adapt the grid to this solution, (4) recalculate the solution on this adapted grid, and (5) repeat steps 3 and 4 to satisfaction. Steps 3 and 4 can be repeated until some 'optimal' grid is converged to but typically this is not worth the effort and just two or three repeat calculations are necessary. They also may be repeated every 5-10 time steps for unsteady calculations.

16. A Freestream-Preserving High-Order Finite-Volume Method for Mapped Grids with Adaptive-Mesh Refinement

SciTech Connect

Guzik, S; McCorquodale, P; Colella, P

2011-12-16

A fourth-order accurate finite-volume method is presented for solving time-dependent hyperbolic systems of conservation laws on mapped grids that are adaptively refined in space and time. Novel considerations for formulating the semi-discrete system of equations in computational space combined with detailed mechanisms for accommodating the adapting grids ensure that conservation is maintained and that the divergence of a constant vector field is always zero (freestream-preservation property). Advancement in time is achieved with a fourth-order Runge-Kutta method.

17. Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

NASA Technical Reports Server (NTRS)

Yang, Jiann-Cherng; Soni, B. K.

1992-01-01

An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

18. A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

NASA Technical Reports Server (NTRS)

Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.

2000-01-01

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

19. A two-stage adaptive stochastic collocation method on nested sparse grids for multiphase flow in randomly heterogeneous porous media

Liao, Qinzhuo; Zhang, Dongxiao; Tchelepi, Hamdi

2017-02-01

A new computational method is proposed for efficient uncertainty quantification of multiphase flow in porous media with stochastic permeability. For pressure estimation, it combines the dimension-adaptive stochastic collocation method on Smolyak sparse grids and the Kronrod-Patterson-Hermite nested quadrature formulas. For saturation estimation, an additional stage is developed, in which the pressure and velocity samples are first generated by the sparse grid interpolation and then substituted into the transport equation to solve for the saturation samples, to address the low regularity problem of the saturation. Numerical examples are presented for multiphase flow with stochastic permeability fields to demonstrate accuracy and efficiency of the proposed two-stage adaptive stochastic collocation method on nested sparse grids.

20. A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

NASA Technical Reports Server (NTRS)

Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.; Nixon, David (Technical Monitor)

1998-01-01

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

1. Grid generation and adaptation for the Direct Simulation Monte Carlo Method. [for complex flows past wedges and cones

NASA Technical Reports Server (NTRS)

Olynick, David P.; Hassan, H. A.; Moss, James N.

1988-01-01

A grid generation and adaptation procedure based on the method of transfinite interpolation is incorporated into the Direct Simulation Monte Carlo Method of Bird. In addition, time is advanced based on a local criterion. The resulting procedure is used to calculate steady flows past wedges and cones. Five chemical species are considered. In general, the modifications result in a reduced computational effort. Moreover, preliminary results suggest that the simulation method is time step dependent if requirements on cell sizes are not met.

2. Adaptive analog-SSOR iterative method for solving grid equations with nonselfadjoint operators

Alekseenko, Elena; Sukhinov, Alexander; Chistyakov, Alexander; Shishenya, Alexander; Roux, Bernard

2013-04-01

Motion models of wave processes in the coastal zone are highly demanded in the projection and construction of coastal surface structures and breakwaters, and also as a component of other models. The most common of the grid approaches is currently vof-method. A significant drawback of this method is in the necessity to solve the convection equation to find fullness of cells. The numerical solution of this equation leads to a strong grid viscosity and "smearing" of the interface. In this paper, we propose a method, which is based on the idea of using a fill, as in vof method, but its conversion is not required to solve the equation of convection. Thus in this work, a mathematical model for the wave hydrodynamics problem, describing wash ashore and taking into account such physical parameters as turbulent exchange, complexity of domain and coastal line geometry, and bottom friction is developed. For the given mathematical model a discrete model is constructed, taking into account dynamical changing of the calculation domain. Discretization of the model is performed on the structured rectangular grid with a new developed finite-volume technique that takes into account fullness of the grid cells that allows describing geometry more accurate. Proposed technique allows improving the real accuracy of a solution in case of complex domain geometry, by improving approximation of the boundary. A software implementation and numerical experiments of the posed problem of the wave hydrodynamics is performed. The results of numerical experiments show the feasibility of using discrete mathematical models of processes that take into account fullness of grid cells, for the simulation of systems with complex geometry of the border. Numerical experiments show that the use of this technique sufficiently smooth solutions are obtained even on coarse grids.

3. Grid adaption using Chimera composite overlapping meshes

NASA Technical Reports Server (NTRS)

Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

1993-01-01

The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.

4. Grid adaptation using chimera composite overlapping meshes

NASA Technical Reports Server (NTRS)

Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

1994-01-01

The objective of this paper is to perform grid adaptation using composite overlapping meshes in regions of large gradient to accurately capture the salient features during computation. The chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using trilinear interpolation. Application to the Euler equations for shock reflections and to shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well-resolved.

5. Grid adaptation using Chimera composite overlapping meshes

NASA Technical Reports Server (NTRS)

Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

1993-01-01

The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.

6. 3D Composite Grids Using Bezier Curves and Surfaces in Component Adaptive Methods

DTIC Science & Technology

1993-08-01

bounding curves, an algebraic grid generation method, such as transfinite interpolation of these curves, results in a definition of the interior of...dependent variables is assembled and solved iteratively. The interior generated by the transfinite interpolation technique is used as the initial guess...The boundaries of the face are first parameterized in this fashion Transfinite interpolation is then employed first to obtain a parameterization of

7. Anisotropic grid adaptation in LES

2016-11-01

The modeling errors depend directly on the grid (or filter) spacing in turbulence-resolving simulations (LES, DNS, DES, etc), and are typically at least as significant as the numerical errors. This makes adaptive grid-refinement complicated, since it prevents the estimation of the local error sources through numerical analysis. The present work attempts to address this difficulty with a physics-based error-source indicator that accounts for the anisotropy in the smallest resolved scales, which can thus be used to drive an anisotropic grid-adaptation process. The proposed error indicator is assessed on a sequence of problems, including turbulent channel flow and flows in more complex geometries. The formulation is geometrically general and applicable to complex geometries.

8. Method of grid generation

DOEpatents

Barnette, Daniel W.

2002-01-01

The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.

9. Near-Body Grid Adaption for Overset Grids

NASA Technical Reports Server (NTRS)

Buning, Pieter G.; Pulliam, Thomas H.

2016-01-01

A solution adaption capability for curvilinear near-body grids has been implemented in the OVERFLOW overset grid computational fluid dynamics code. The approach follows closely that used for the Cartesian off-body grids, but inserts refined grids in the computational space of original near-body grids. Refined curvilinear grids are generated using parametric cubic interpolation, with one-sided biasing based on curvature and stretching ratio of the original grid. Sensor functions, grid marking, and solution interpolation tasks are implemented in the same fashion as for off-body grids. A goal-oriented procedure, based on largest error first, is included for controlling growth rate and maximum size of the adapted grid system. The adaption process is almost entirely parallelized using MPI, resulting in a capability suitable for viscous, moving body simulations. Two- and three-dimensional examples are presented.

10. SAGE - MULTIDIMENSIONAL SELF-ADAPTIVE GRID CODE

NASA Technical Reports Server (NTRS)

Davies, C. B.

1994-01-01

NASA Technical Reports Server (NTRS)

Luong, Phu Vinh; Thompson, J. F.; Gatlin, B.; Mastin, C. W.; Kim, H. J.

1992-01-01

In the effort described here, the elliptic grid generation procedure in the EAGLE grid code was separated from the main code into a subroutine, and a new subroutine which evaluates several grid quality measures at each grid point was added. The elliptic grid routine can now be called, either by a computational fluid dynamics (CFD) code to generate a new adaptive grid based on flow variables and quality measures through multiple adaptation, or by the EAGLE main code to generate a grid based on quality measure variables through static adaptation. Arrays of flow variables can be read into the EAGLE grid code for use in static adaptation as well. These major changes in the EAGLE adaptive grid system make it easier to convert any CFD code that operates on a block-structured grid (or single-block grid) into a multiple adaptive code.

12. The fluid dynamic approach to equidistribution methods for grid generation and adaptation

SciTech Connect

Delzanno, Gian Luca; Finn, John M

2009-01-01

The equidistribution methods based on L{sub p} Monge-Kantorovich optimization [Finn and Delzanno, submitted to SISC, 2009] and on the deformation [Moser, 1965; Dacorogna and Moser, 1990, Liao and Anderson, 1992] method are analyzed primarily in the context of grid generation. It is shown that the first class of methods can be obtained from a fluid dynamic formulation based on time-dependent equations for the mass density and the momentum density, arising from a variational principle. In this context, deformation methods arise from a fluid formulation by making a specific assumption on the time evolution of the density (but with some degree of freedom for the momentum density). In general, deformation methods do not arise from a variational principle. However, it is possible to prescribe an optimal deformation method, related to L{sub 1} Monge-Kantorovich optimization, by making a further assumption on the momentum density. Some applications of the L{sub p} fluid dynamic formulation to imaging are also explored.

13. Fast 3-D large-scale gravity and magnetic modeling using unstructured grids and an adaptive multilevel fast multipole method

Ren, Zhengyong; Tang, Jingtian; Kalscheuer, Thomas; Maurer, Hansruedi

2017-01-01

A novel fast and accurate algorithm is developed for large-scale 3-D gravity and magnetic modeling problems. An unstructured grid discretization is used to approximate sources with arbitrary mass and magnetization distributions. A novel adaptive multilevel fast multipole (AMFM) method is developed to reduce the modeling time. An observation octree is constructed on a set of arbitrarily distributed observation sites, while a source octree is constructed on a source tetrahedral grid. A novel characteristic is the independence between the observation octree and the source octree, which simplifies the implementation of different survey configurations such as airborne and ground surveys. Two synthetic models, a cubic model and a half-space model with mountain-valley topography, are tested. As compared to analytical solutions of gravity and magnetic signals, excellent agreements of the solutions verify the accuracy of our AMFM algorithm. Finally, our AMFM method is used to calculate the terrain effect on an airborne gravity data set for a realistic topography model represented by a triangular surface retrieved from a digital elevation model. Using 16 threads, more than 5800 billion interactions between 1,002,001 observation points and 5,839,830 tetrahedral elements are computed in 453.6 s. A traditional first-order Gaussian quadrature approach requires 3.77 days. Hence, our new AMFM algorithm not only can quickly compute the gravity and magnetic signals for complicated problems but also can substantially accelerate the solution of 3-D inversion problems.

14. An adaptive sparse-grid high-order stochastic collocation method for Bayesian inference in groundwater reactive transport modeling

SciTech Connect

Zhang, Guannan; Webster, Clayton G; Gunzburger, Max D

2012-09-01

Although Bayesian analysis has become vital to the quantification of prediction uncertainty in groundwater modeling, its application has been hindered due to the computational cost associated with numerous model executions needed for exploring the posterior probability density function (PPDF) of model parameters. This is particularly the case when the PPDF is estimated using Markov Chain Monte Carlo (MCMC) sampling. In this study, we develop a new approach that improves computational efficiency of Bayesian inference by constructing a surrogate system based on an adaptive sparse-grid high-order stochastic collocation (aSG-hSC) method. Unlike previous works using first-order hierarchical basis, we utilize a compactly supported higher-order hierar- chical basis to construct the surrogate system, resulting in a significant reduction in the number of computational simulations required. In addition, we use hierarchical surplus as an error indi- cator to determine adaptive sparse grids. This allows local refinement in the uncertain domain and/or anisotropic detection with respect to the random model parameters, which further improves computational efficiency. Finally, we incorporate a global optimization technique and propose an iterative algorithm for building the surrogate system for the PPDF with multiple significant modes. Once the surrogate system is determined, the PPDF can be evaluated by sampling the surrogate system directly with very little computational cost. The developed method is evaluated first using a simple analytical density function with multiple modes and then using two synthetic groundwater reactive transport models. The groundwater models represent different levels of complexity; the first example involves coupled linear reactions and the second example simulates nonlinear ura- nium surface complexation. The results show that the aSG-hSC is an effective and efficient tool for Bayesian inference in groundwater modeling in comparison with conventional

15. Interactive solution-adaptive grid generation procedure

NASA Technical Reports Server (NTRS)

Henderson, Todd L.; Choo, Yung K.; Lee, Ki D.

1992-01-01

TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

16. Two general methods for population pharmacokinetic modeling: non-parametric adaptive grid and non-parametric Bayesian.

PubMed

Tatarinova, Tatiana; Neely, Michael; Bartroff, Jay; van Guilder, Michael; Yamada, Walter; Bayard, David; Jelliffe, Roger; Leary, Robert; Chubatiuk, Alyona; Schumitzky, Alan

2013-04-01

Population pharmacokinetic (PK) modeling methods can be statistically classified as either parametric or nonparametric (NP). Each classification can be divided into maximum likelihood (ML) or Bayesian (B) approaches. In this paper we discuss the nonparametric case using both maximum likelihood and Bayesian approaches. We present two nonparametric methods for estimating the unknown joint population distribution of model parameter values in a pharmacokinetic/pharmacodynamic (PK/PD) dataset. The first method is the NP Adaptive Grid (NPAG). The second is the NP Bayesian (NPB) algorithm with a stick-breaking process to construct a Dirichlet prior. Our objective is to compare the performance of these two methods using a simulated PK/PD dataset. Our results showed excellent performance of NPAG and NPB in a realistically simulated PK study. This simulation allowed us to have benchmarks in the form of the true population parameters to compare with the estimates produced by the two methods, while incorporating challenges like unbalanced sample times and sample numbers as well as the ability to include the covariate of patient weight. We conclude that both NPML and NPB can be used in realistic PK/PD population analysis problems. The advantages of one versus the other are discussed in the paper. NPAG and NPB are implemented in R and freely available for download within the Pmetrics package from www.lapk.org.

17. Two general methods for population pharmacokinetic modeling: non-parametric adaptive grid and non-parametric Bayesian

PubMed Central

Neely, Michael; Bartroff, Jay; van Guilder, Michael; Yamada, Walter; Bayard, David; Jelliffe, Roger; Leary, Robert; Chubatiuk, Alyona; Schumitzky, Alan

2013-01-01

Population pharmacokinetic (PK) modeling methods can be statistically classified as either parametric or nonparametric (NP). Each classification can be divided into maximum likelihood (ML) or Bayesian (B) approazches. In this paper we discuss the nonparametric case using both maximum likelihood and Bayesian approaches. We present two nonparametric methods for estimating the unknown joint population distribution of model parameter values in a pharmacokinetic/pharmacodynamic (PK/PD) dataset. The first method is the NP Adaptive Grid (NPAG). The second is the NP Bayesian (NPB) algorithm with a stick-breaking process to construct a Dirichlet prior. Our objective is to compare the performance of these two methods using a simulated PK/PD dataset. Our results showed excellent performance of NPAG and NPB in a realistically simulated PK study. This simulation allowed us to have benchmarks in the form of the true population parameters to compare with the estimates produced by the two methods, while incorporating challenges like unbalanced sample times and sample numbers as well as the ability to include the covariate of patient weight. We conclude that both NPML and NPB can be used in realistic PK/PD population analysis problems. The advantages of one versus the other are discussed in the paper. NPAG and NPB are implemented in R and freely available for download within the Pmetrics package from www.lapk.org. PMID:23404393

18. Automatic adaptive grid refinement for the Euler equations

NASA Technical Reports Server (NTRS)

Berger, M. J.; Jameson, A.

1983-01-01

A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented. Algorithm automatically decides where the coarse grid accuracy is insufficient, and creates locally uniform refined grids in these regions. This typically occurs at the leading and trailing edges. The solution is then integrated to steady state using the same integrator (FLO52) in the interior of each grid. The boundary conditions needed on the fine grids are examined and the importance of treating the fine/coarse grid inerface conservatively is discussed. Numerical results are presented.

19. Elliptic Solvers for Adaptive Mesh Refinement Grids

SciTech Connect

Quinlan, D.J.; Dendy, J.E., Jr.; Shapira, Y.

1999-06-03

We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms and the inclusion of our black-box multigrid techniques into this new setting. The approach applies the Los Alamos object-oriented class libraries that greatly simplify the development of serial and parallel adaptive mesh refinement applications. In the final year of this LDRD, we focused on putting the software together; in particular we completed the final AMR++ library, we wrote tutorials and manuals, and we built example applications. We implemented the Fast Adaptive Composite Grid method as the principal elliptic solver. We presented results at the Overset Grid Conference and other more AMR specific conferences. We worked on optimization of serial and parallel performance and published several papers on the details of this work. Performance remains an important issue and is the subject of continuing research work.

20. Conservative treatment of boundary interfaces for overlaid grids and multi-level grid adaptations

NASA Technical Reports Server (NTRS)

Moon, Young J.; Liou, Meng-Sing

1989-01-01

Conservative algorithms for boundary interfaces of overlaid grids are presented. The basic method is zeroth order, and is extended to a higher order method using interpolation and subcell decomposition. The present method, strictly based on a conservative constraint, is tested with overlaid grids for various applications of unsteady and steady supersonic inviscid flows with strong shock waves. The algorithm is also applied to a multi-level grid adaptation in which the next level finer grid is overlaid on the coarse base grid with an arbitrary orientation.

1. MRAG-I2D: Multi-resolution adapted grids for remeshed vortex methods on multicore architectures

Rossinelli, Diego; Hejazialhosseini, Babak; van Rees, Wim; Gazzola, Mattia; Bergdorf, Michael; Koumoutsakos, Petros

2015-05-01

We present MRAG-I2D, an open source software framework, for multiresolution simulations of two-dimensional, incompressible, viscous flows on multicore architectures. The spatiotemporal scales of the flow field are captured by remeshed vortex methods enhanced by high order average-interpolating wavelets and local time-stepping. The multiresolution solver of the Poisson equation relies on the development of a novel, tree-based multipole method. MRAG-I2D implements a number of HPC strategies to map efficiently the irregular computational workload of wavelet-adapted grids on multicore nodes. The capabilities of the present software are compared to the current state-of-the-art in terms of accuracy, compression rates and time-to-solution. Benchmarks include the inviscid evolution of an elliptical vortex, flow past an impulsively started cylinder at Re = 40- 40 000 and simulations of self-propelled anguilliform swimmers. The results indicate that the present software has the same or better accuracy than state-of-the-art solvers while it exhibits unprecedented performance in terms of time-to-solution.

2. Rapid Structured Volume Grid Smoothing and Adaption Technique

NASA Technical Reports Server (NTRS)

Alter, Stephen J.

2006-01-01

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reductions in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

3. Rapid Structured Volume Grid Smoothing and Adaption Technique

NASA Technical Reports Server (NTRS)

Alter, Stephen J.

2004-01-01

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reduction in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

4. Topology and grid adaption for high-speed flow computations

Abolhassani, Jamshid S.; Tiwari, Surendra N.

1989-03-01

This study investigates the effects of grid topology and grid adaptation on numerical solutions of the Navier-Stokes equations. In the first part of this study, a general procedure is presented for computation of high-speed flow over complex three-dimensional configurations. The flow field is simulated on the surface of a Butler wing in a uniform stream. Results are presented for Mach number 3.5 and a Reynolds number of 2,000,000. The O-type and H-type grids have been used for this study, and the results are compared together and with other theoretical and experimental results. The results demonstrate that while the H-type grid is suitable for the leading and trailing edges, a more accurate solution can be obtained for the middle part of the wing with an O-type grid. In the second part of this study, methods of grid adaption are reviewed and a method is developed with the capability of adapting to several variables. This method is based on a variational approach and is an algebraic method. Also, the method has been formulated in such a way that there is no need for any matrix inversion. This method is used in conjunction with the calculation of hypersonic flow over a blunt-nose body. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

5. Topology and grid adaption for high-speed flow computations

NASA Technical Reports Server (NTRS)

Abolhassani, Jamshid S.; Tiwari, Surendra N.

1989-01-01

This study investigates the effects of grid topology and grid adaptation on numerical solutions of the Navier-Stokes equations. In the first part of this study, a general procedure is presented for computation of high-speed flow over complex three-dimensional configurations. The flow field is simulated on the surface of a Butler wing in a uniform stream. Results are presented for Mach number 3.5 and a Reynolds number of 2,000,000. The O-type and H-type grids have been used for this study, and the results are compared together and with other theoretical and experimental results. The results demonstrate that while the H-type grid is suitable for the leading and trailing edges, a more accurate solution can be obtained for the middle part of the wing with an O-type grid. In the second part of this study, methods of grid adaption are reviewed and a method is developed with the capability of adapting to several variables. This method is based on a variational approach and is an algebraic method. Also, the method has been formulated in such a way that there is no need for any matrix inversion. This method is used in conjunction with the calculation of hypersonic flow over a blunt-nose body. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

6. New multigrid approach for three-dimensional unstructured, adaptive grids

NASA Technical Reports Server (NTRS)

Parthasarathy, Vijayan; Kallinderis, Y.

1994-01-01

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

7. New multigrid approach for three-dimensional unstructured, adaptive grids

Parthasarathy, Vijayan; Kallinderis, Y.

1994-05-01

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coarser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

8. New multigrid approach for three-dimensional unstructured, adaptive grids

Parthasarathy, Vijayan; Kallinderis, Y.

1994-05-01

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

9. Time-splitting finite difference method with the wavelet-adaptive grids for semiclassical Gross-Pitaevskii equation in supercritical case

Li, Xueyang; Xiao, Aiguo

2014-06-01

The Gross-Pitaevskii equation is the model equation of the single-particle wave function in a Bose-Einstein condensation. A computation difficulty of the Gross-Pitaevskii equation comes from the semiclassical problem in supercritical case. In this paper, we apply a diffeomorphism to transform the original one-dimensional Gross-Pitaevskii equation into a modified equation. The adaptive grids are constructed through the interpolating wavelet method. Then, we use the time-splitting finite difference method with the wavelet-adaptive grids to solve the modified Gross-Pitaevskii equation, where the approximation to the second-order derivative is given by the Lagrange interpolation method. At last, the numerical results are given. It is shown that the obtained time-splitting finite difference method with the wavelet-adaptive grids is very efficient for solving the one-dimensional semiclassical Gross-Pitaevskii equation in supercritical case and it is suitable to deal with the local high oscillation of the solution.

10. Three-dimensional Navier-Stokes calculations using solution-adapted grids

NASA Technical Reports Server (NTRS)

Henderson, T. L.; Huang, W.; Lee, K. D.; Choo, Y. K.

1993-01-01

A three-dimensional solution-adaptive grid generation technique is presented. The adaptation technique redistributes grid points to improve the accuracy of a flow solution without increasing the number of grid points. It is applicable to structured grids with a multiblock topology. The method uses a numerical mapping and potential theory to modify the initial grid distribution based on the properties of the flow solution on the initial grid. The technique is demonstrated with two examples - a transonic finite wing and a supersonic blunt fin. The advantages are shown by comparing flow solutions on the adapted grids with those on the initial grids.

11. A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods

Chen, Peng; Quarteroni, Alfio

2015-10-01

In this work we develop an adaptive and reduced computational algorithm based on dimension-adaptive sparse grid approximation and reduced basis methods for solving high-dimensional uncertainty quantification (UQ) problems. In order to tackle the computational challenge of "curse of dimensionality" commonly faced by these problems, we employ a dimension-adaptive tensor-product algorithm [16] and propose a verified version to enable effective removal of the stagnation phenomenon besides automatically detecting the importance and interaction of different dimensions. To reduce the heavy computational cost of UQ problems modelled by partial differential equations (PDE), we adopt a weighted reduced basis method [7] and develop an adaptive greedy algorithm in combination with the previous verified algorithm for efficient construction of an accurate reduced basis approximation. The efficiency and accuracy of the proposed algorithm are demonstrated by several numerical experiments.

12. Adaptive refinement tools for tetrahedral unstructured grids

NASA Technical Reports Server (NTRS)

Pao, S. Paul (Inventor); Abdol-Hamid, Khaled S. (Inventor)

2011-01-01

An exemplary embodiment providing one or more improvements includes software which is robust, efficient, and has a very fast run time for user directed grid enrichment and flow solution adaptive grid refinement. All user selectable options (e.g., the choice of functions, the choice of thresholds, etc.), other than a pre-marked cell list, can be entered on the command line. The ease of application is an asset for flow physics research and preliminary design CFD analysis where fast grid modification is often needed to deal with unanticipated development of flow details.

13. An adaptive grid algorithm for one-dimensional nonlinear equations

NASA Technical Reports Server (NTRS)

Gutierrez, William E.; Hills, Richard G.

1990-01-01

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

14. SAGE: The Self-Adaptive Grid Code. 3

NASA Technical Reports Server (NTRS)

Davies, Carol B.; Venkatapathy, Ethiraj

1999-01-01

The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

15. Grid crusher apparatus and method

SciTech Connect

McDaniels, J.D. Jr.

1994-01-11

A grid crusher apparatus and method are provided for a nuclear fuel rod consolidation system. Spacer grids are crushed within a basket which is then placed in a storage canister. The grid crusher apparatus has a ram assembly and a basket driving mechanism. The ram assembly has a sleeve ram and a central ram. The sleeve ram surrounds the central ram which is longitudinally movable within the sleeve ram. The central ram protrudes from the sleeve ram at a ram contact end and is retractable upon application of a preselected force to the central ram so that the central ram is flush with the sleeve ram at the ram contact end. The basket driving mechanism is configured to move the basket containing a spacer grid towards the ram contact end so that the spacer grid is crushed within the basket. The spacer grid is crushed by the combination of successive forces from the central ram and the sleeve ram, respectively. Essentially, the central portion of the spacer grid is crushed first, and then the remaining outer portion of the spacer grid is crushed to complete the crushing action of the spacer grid. The foregoing process is repeated for other spacer grids until the basket reaches a predetermined allowable capacity, and then the basket is stored in a storage canister. 11 figs.

16. Adaptive grids and implicit differencing applied to plasma simulation

SciTech Connect

Brackbill, J.U.; Forslund, D.W.; Vu, Hoanh.

1990-01-01

To understand the kinetic processes that determine energy confinement and impurity production in magnetic confinement experiments, we are developing methods to model kinetic effects on magnetohydrodynamic time scales in realistic geometries. We are using implicit methods and adaptive grids to achieve this goal. 9 refs., 2 figs.

17. Cartesian-cell based grid generation and adaptive mesh refinement

NASA Technical Reports Server (NTRS)

Coirier, William J.; Powell, Kenneth G.

1993-01-01

Viewgraphs on Cartesian-cell based grid generation and adaptive mesh refinement are presented. Topics covered include: grid generation; cell cutting; data structures; flow solver formulation; adaptive mesh refinement; and viscous flow.

18. Adaptive hybrid prismatic-tetrahedral grids for viscous flows

NASA Technical Reports Server (NTRS)

Kallinderis, Yannis; Khawaja, Aly; Mcmorris, Harlan

1995-01-01

The paper presents generation of adaptive hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is an Automatic Receding Method (ARM) for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples division of tetrahedra, as well as 2-D directional division of prisms.

19. Adaptive hybrid prismatic-tetrahedral grids for viscous flows

Kallinderis, Yannis; Khawaja, Aly; McMorris, Harlan

1995-03-01

The paper presents generation of adaptive hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is an Automatic Receding Method (ARM) for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples division of tetrahedra, as well as 2-D directional division of prisms.

20. Transonic airfoil calculations using solution-adaptive grids

NASA Technical Reports Server (NTRS)

Holst, T. L.; Brown, D.

1981-01-01

A new algorithm for generating solution-adaptive grids (SAG) about airfoil configurations embedded in transonic flow is presented. The present SAG approach uses only the airfoil surface solution to recluster grid points on the airfoil surface, i.e., the reclustering problem is one dimension smaller than the flow-field calculation problem. Special controls automatically built into the elliptic grid generation procedure are then used to obtain grids with suitable interior behavior. This concept of redistributing grid points greatly simplifies the idea of solution-adaptive grids. Numerical results indicate significant improvements in accuracy for SAG grids relative to standard grids using the same number of points.

1. A Grid Sourcing and Adaptation Study Using Unstructured Grids for Supersonic Boom Prediction

NASA Technical Reports Server (NTRS)

Carter, Melissa B.; Deere, Karen A.

2008-01-01

NASA created the Supersonics Project as part of the NASA Fundamental Aeronautics Program to advance technology that will make a supersonic flight over land viable. Computational flow solvers have lacked the ability to accurately predict sonic boom from the near to far field. The focus of this investigation was to establish gridding and adaptation techniques to predict near-to-mid-field (<10 body lengths below the aircraft) boom signatures at supersonic speeds using the USM3D unstructured grid flow solver. The study began by examining sources along the body the aircraft, far field sourcing and far field boundaries. The study then examined several techniques for grid adaptation. During the course of the study, volume sourcing was introduced as a new way to source grids using the grid generation code VGRID. Two different methods of using the volume sources were examined. The first method, based on manual insertion of the numerous volume sources, made great improvements in the prediction capability of USM3D for boom signatures. The second method (SSGRID), which uses an a priori adaptation approach to stretch and shear the original unstructured grid to align the grid and pressure waves, showed similar results with a more automated approach. Due to SSGRID s results and ease of use, the rest of the study focused on developing a best practice using SSGRID. The best practice created by this study for boom predictions using the CFD code USM3D involved: 1) creating a small cylindrical outer boundary either 1 or 2 body lengths in diameter (depending on how far below the aircraft the boom prediction is required), 2) using a single volume source under the aircraft, and 3) using SSGRID to stretch and shear the grid to the desired length.

2. The multidimensional Self-Adaptive Grid code, SAGE, version 2

NASA Technical Reports Server (NTRS)

Davies, Carol B.; Venkatapathy, Ethiraj

1995-01-01

This new report on Version 2 of the SAGE code includes all the information in the original publication plus all upgrades and changes to the SAGE code since that time. The two most significant upgrades are the inclusion of a finite-volume option and the ability to adapt and manipulate zonal-matching multiple-grid files. In addition, the original SAGE code has been upgraded to Version 1.1 and includes all options mentioned in this report, with the exception of the multiple grid option and its associated features. Since Version 2 is a larger and more complex code, it is suggested (but not required) that Version 1.1 be used for single-grid applications. This document contains all the information required to run both versions of SAGE. The formulation of the adaption method is described in the first section of this document. The second section is presented in the form of a user guide that explains the input and execution of the code. The third section provides many examples. Successful application of the SAGE code in both two and three dimensions for the solution of various flow problems has proven the code to be robust, portable, and simple to use. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for complex grid structures. Modifications to the method and the simple but extensive input options make this a flexible and user-friendly code. The SAGE code can accommodate two-dimensional and three-dimensional, finite-difference and finite-volume, single grid, and zonal-matching multiple grid flow problems.

3. A novel hyperbolic grid generation procedure with inherent adaptive dissipation

SciTech Connect

Tai, C.H.; Yin, S.L.; Soong, C.Y.

1995-01-01

This paper reports a novel hyperbolic grid-generation with an inherent adaptive dissipation (HGAD), which is capable of improving the oscillation and overlapping of grid lines. In the present work upwinding differencing is applied to discretize the hyperbolic system and, thereby, to develop the adaptive dissipation coefficient. Complex configurations with the features of geometric discontinuity, exceptional concavity and convexity are used as the test cases for comparison of the present HGAD procedure with the conventional hyerbolic and elliptic ones. The results reveal that the HGAD method is superior in orthogonality and smoothness of the grid system. In addition, the computational efficiency of the flow solver may be improved by using the present HGAD procedure. 15 refs., 8 figs.

NASA Technical Reports Server (NTRS)

Oliker, Leonid; Biswas, Rupak

1997-01-01

Mesh adaption is a powerful tool for efficient unstructured- grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads with a global view. This paper presents, for the first time, the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. Previous results indicated that mesh repartitioning and data remapping are potential bottlenecks for performing large-scale scientific calculations. We resolve these issues and demonstrate that our framework remains viable on a large number of processors.

5. Hierarchy-Direction Selective Approach for Locally Adaptive Sparse Grids

SciTech Connect

Stoyanov, Miroslav K

2013-09-01

We consider the problem of multidimensional adaptive hierarchical interpolation. We use sparse grids points and functions that are induced from a one dimensional hierarchical rule via tensor products. The classical locally adaptive sparse grid algorithm uses an isotropic refinement from the coarser to the denser levels of the hierarchy. However, the multidimensional hierarchy provides a more complex structure that allows for various anisotropic and hierarchy selective refinement techniques. We consider the more advanced refinement techniques and apply them to a number of simple test functions chosen to demonstrate the various advantages and disadvantages of each method. While there is no refinement scheme that is optimal for all functions, the fully adaptive family-direction-selective technique is usually more stable and requires fewer samples.

6. Three-dimensional adaptive grid generation for body-fitted coordinate system

NASA Technical Reports Server (NTRS)

Chen, S. C.

1988-01-01

This report describes a numerical method for generating 3-D grids for general configurations. The basic method involves the solution of a set of quasi-linear elliptic partial differential equations via pointwise relaxation with a local relaxation factor. It allows specification of the grid spacing off the boundary surfaces and the grid orthogonality at the boundary surfaces. It includes adaptive mechanisms to improve smoothness, orthogonality, and flow resolution in the grid interior.

7. Techniques for grid manipulation and adaptation. [computational fluid dynamics

NASA Technical Reports Server (NTRS)

Choo, Yung K.; Eisemann, Peter R.; Lee, Ki D.

1992-01-01

Two approaches have been taken to provide systematic grid manipulation for improved grid quality. One is the control point form (CPF) of algebraic grid generation. It provides explicit control of the physical grid shape and grid spacing through the movement of the control points. It works well in the interactive computer graphics environment and hence can be a good candidate for integration with other emerging technologies. The other approach is grid adaptation using a numerical mapping between the physical space and a parametric space. Grid adaptation is achieved by modifying the mapping functions through the effects of grid control sources. The adaptation process can be repeated in a cyclic manner if satisfactory results are not achieved after a single application.

8. Unstructured Adaptive Grid Computations on an Array of SMPs

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Pramanick, Ira; Sohn, Andrew; Simon, Horst D.

1996-01-01

Dynamic load balancing is necessary for parallel adaptive methods to solve unsteady CFD problems on unstructured grids. We have presented such a dynamic load balancing framework called JOVE, in this paper. Results on a four-POWERnode POWER CHALLENGEarray demonstrated that load balancing gives significant performance improvements over no load balancing for such adaptive computations. The parallel speedup of JOVE, implemented using MPI on the POWER CHALLENCEarray, was significant, being as high as 31 for 32 processors. An implementation of JOVE that exploits 'an array of SMPS' architecture was also studied; this hybrid JOVE outperformed flat JOVE by up to 28% on the meshes and adaption models tested. With large, realistic meshes and actual flow-solver and adaption phases incorporated into JOVE, hybrid JOVE can be expected to yield significant advantage over flat JOVE, especially as the number of processors is increased, thus demonstrating the scalability of an array of SMPs architecture.

9. A Solution Adaptive Technique Using Tetrahedral Unstructured Grids

NASA Technical Reports Server (NTRS)

2000-01-01

An adaptive unstructured grid refinement technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The method is based on a combination of surface mesh subdivision and local remeshing of the volume grid Simple functions of flow quantities are employed to detect dominant features of the flowfield The method is designed for modular coupling with various error/feature analyzers and flow solvers. Several steady-state, inviscid flow test cases are presented to demonstrate the applicability of the method for solving practical three-dimensional problems. In all cases, accurate solutions featuring complex, nonlinear flow phenomena such as shock waves and vortices have been generated automatically and efficiently.

10. The multidimensional self-adaptive grid code, SAGE

NASA Technical Reports Server (NTRS)

Davies, Carol B.; Venkatapathy, Ethiraj

1992-01-01

This report describes the multidimensional self-adaptive grid code SAGE. A two-dimensional version of this code was described in an earlier report by the authors. The formulation of the multidimensional version is described in the first section of this document. The second section is presented in the form of a user guide that explains the input and execution of the code and provides many examples. Successful application of the SAGE code in both two and three dimensions for the solution of various flow problems has proven the code to be robust, portable, and simple to use. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for complex grid structures. Modifications to the method and the simplified input options make this a flexible and user-friendly code. The new SAGE code can accommodate both two-dimensional and three-dimensional flow problems.

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Oliker, Leonid

1996-01-01

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adaption, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartitioning. If so, the adapted mesh is repartitioned, with new partitions assigned to processors so that the redistribution cost is minimized. The new partitions are accepted only if the remapping cost is compensated by the improved load balance. Results indicate that this strategy is effective for large-scale scientific computations on distributed-memory multiprocessors.

12. Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation

NASA Technical Reports Server (NTRS)

Buning, Pieter G.; Pulliam, Thomas H.

2011-01-01

An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.

13. OMEGA: The operational multiscale environment model with grid adaptivity

SciTech Connect

Bacon, D.P.

1995-07-01

This review talk describes the OMEGA code, used for weather simulation and the modeling of aerosol transport through the atmosphere. Omega employs a 3D mesh of wedge shaped elements (triangles when viewed from above) that adapt with time. Because wedges are laid out in layers of triangular elements, the scheme can utilize structured storage and differencing techniques along the elevation coordinate, and is thus a hybrid of structured and unstructured methods. The utility of adaptive gridding in this moded, near geographic features such as coastlines, where material properties change discontinuously, is illustrated. Temporal adaptivity was used additionally to track moving internal fronts, such as clouds of aerosol contaminants. The author also discusses limitations specific to this problem, including manipulation of huge data bases and fixed turn-around times. In practice, the latter requires a carefully tuned optimization between accuracy and computation speed.

14. Multiprocessor computer overset grid method and apparatus

DOEpatents

Barnette, Daniel W.; Ober, Curtis C.

2003-01-01

A multiprocessor computer overset grid method and apparatus comprises associating points in each overset grid with processors and using mapped interpolation transformations to communicate intermediate values between processors assigned base and target points of the interpolation transformations. The method allows a multiprocessor computer to operate with effective load balance on overset grid applications.

15. A generic efficient adaptive grid scheme for rocket propulsion modeling

NASA Technical Reports Server (NTRS)

Mo, J. D.; Chow, Alan S.

1993-01-01

The objective of this research is to develop an efficient, time-accurate numerical algorithm to discretize the Navier-Stokes equations for the predictions of internal one-, two-dimensional and axisymmetric flows. A generic, efficient, elliptic adaptive grid generator is implicitly coupled with the Lower-Upper factorization scheme in the development of ALUNS computer code. The calculations of one-dimensional shock tube wave propagation and two-dimensional shock wave capture, wave-wave interactions, shock wave-boundary interactions show that the developed scheme is stable, accurate and extremely robust. The adaptive grid generator produced a very favorable grid network by a grid speed technique. This generic adaptive grid generator is also applied in the PARC and FDNS codes and the computational results for solid rocket nozzle flowfield and crystal growth modeling by those codes will be presented in the conference, too. This research work is being supported by NASA/MSFC.

16. Cosmos++: Relativistic Magnetohydrodynamics on Unstructured Grids with Local Adaptive Refinement

SciTech Connect

Anninos, P; Fragile, P C; Salmonson, J D

2005-05-06

A new code and methodology are introduced for solving the fully general relativistic magnetohydrodynamic (GRMHD) equations using time-explicit, finite-volume discretization. The code has options for solving the GRMHD equations using traditional artificial-viscosity (AV) or non-oscillatory central difference (NOCD) methods, or a new extended AV (eAV) scheme using artificial-viscosity together with a dual energy-flux-conserving formulation. The dual energy approach allows for accurate modeling of highly relativistic flows at boost factors well beyond what has been achieved to date by standard artificial viscosity methods. it provides the benefit of Godunov methods in capturing high Lorentz boosted flows but without complicated Riemann solvers, and the advantages of traditional artificial viscosity methods in their speed and flexibility. Additionally, the GRMHD equations are solved on an unstructured grid that supports local adaptive mesh refinement using a fully threated oct-tree (in three dimensions) network to traverse the grid hierarchy across levels and immediate neighbors. A number of tests are presented to demonstrate robustness of the numerical algorithms and adaptive mesh framework over a wide spectrum of problems, boosts, and astrophysical applications, including relativistic shock tubes, shock collisions, magnetosonic shocks, Alfven wave propagation, blast waves, magnetized Bondi flow, and the magneto-rotational instability in Kerr black hole spacetimes.

17. SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM

EPA Science Inventory

A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme?the piecewise parabolic method (PPM)?for computing advective solution fields; a weight function capable of promoting grid node clustering ...

18. 3-D adaptive grid Navier-Stokes rocket plume calculations

Holcomb, J. Eric

1991-01-01

Three-dimensional adaptive-grid full Navier-Stokes calculations performed for the base region and plume of the Minuteman first stage and a simplified version of the Titan first stage are used to demonstrate the applicability of the Navier-Stokes flow solver, EAGLE adaptive grid generator, and k-epsilon turbulence model to rocket plume flowfields. The calculations include realistic exhaust gas thermodynamic properties, with frozen chemistry.

19. Adaptive Mesh Refinement in Curvilinear Body-Fitted Grid Systems

NASA Technical Reports Server (NTRS)

Steinthorsson, Erlendur; Modiano, David; Colella, Phillip

1995-01-01

To be truly compatible with structured grids, an AMR algorithm should employ a block structure for the refined grids to allow flow solvers to take advantage of the strengths of unstructured grid systems, such as efficient solution algorithms for implicit discretizations and multigrid schemes. One such algorithm, the AMR algorithm of Berger and Colella, has been applied to and adapted for use with body-fitted structured grid systems. Results are presented for a transonic flow over a NACA0012 airfoil (AGARD-03 test case) and a reflection of a shock over a double wedge.

20. Adaptive sparse grid expansions of the vibrational Hamiltonian

SciTech Connect

Strobusch, D.; Scheurer, Ch.

2014-02-21

The vibrational Hamiltonian involves two high dimensional operators, the kinetic energy operator (KEO), and the potential energy surface (PES). Both must be approximated for systems involving more than a few atoms. Adaptive approximation schemes are not only superior to truncated Taylor or many-body expansions (MBE), they also allow for error estimates, and thus operators of predefined precision. To this end, modified sparse grids (SG) are developed that can be combined with adaptive MBEs. This MBE/SG hybrid approach yields a unified, fully adaptive representation of the KEO and the PES. Refinement criteria, based on the vibrational self-consistent field (VSCF) and vibrational configuration interaction (VCI) methods, are presented. The combination of the adaptive MBE/SG approach and the VSCF plus VCI methods yields a black box like procedure to compute accurate vibrational spectra. This is demonstrated on a test set of molecules, comprising water, formaldehyde, methanimine, and ethylene. The test set is first employed to prove convergence for semi-empirical PM3-PESs and subsequently to compute accurate vibrational spectra from CCSD(T)-PESs that agree well with experimental values.

1. Hybrid lattice Boltzmann method on overlapping grids

Di Ilio, G.; Chiappini, D.; Ubertini, S.; Bella, G.; Succi, S.

2017-01-01

In this work, a hybrid lattice Boltzmann method (HLBM) is proposed, where the standard lattice Boltzmann implementation based on the Bhatnagar-Gross-Krook (LBGK) approximation is combined together with an unstructured finite-volume lattice Boltzmann model. The method is constructed on an overlapping grid system, which allows the coexistence of a uniform lattice nodes spacing and a coordinate-free lattice structure. The natural adaptivity of the hybrid grid system makes the method particularly suitable to handle problems involving complex geometries. Moreover, the provided scheme ensures a high-accuracy solution near walls, given the capability of the unstructured submodel of achieving the desired level of refinement in a very flexible way. For these reasons, the HLBM represents a prospective tool for solving multiscale problems. The proposed method is here applied to the benchmark problem of a two-dimensional flow past a circular cylinder for a wide range of Reynolds numbers and its numerical performances are measured and compared with the standard LBGK ones.

2. Three-dimensional adaptive grid-embedding Euler technique

Davis, Roger L.; Dannenhoffer, John F., III

1994-06-01

A new three-dimensional adaptive-grid Euler procedure is presented that automatically detects high-gradient regions in the flow and locally subdivides the computational grid in these regions to provide a uniform, high level of accuracy over the entire domain. A tunable, semistructured data system is utilized that provides global topological unstructured-grid flexibility along with the efficiency of a local, structured-grid system. In addition, this structure data allows for the flow solution algorithm to be executed on a wide variety of parallel/vector computing platforms. An explicit, time-marching, control volume procedure is used to integrate the Euler equations to a steady state. In addition, a multiple-grid procedure is used throughout the embedded-grid regions as well as on subgrids coarser than the initial grid to accelerate convergence and properly propagate disturbance waves through refined-grid regions. Upon convergence, high flow gradient regions, where it is assumed that large truncation errors in the solution exist, are detected using a combination of directional refinement vectors that have large components in areas of these gradients. The local computational grid is directionally subdivided in these regions and the flow solution is reinitiated. Overall convergence occurs when a prespecified level of accuracy is reached. Solutions are presented that demonstrate the efficiency and accuracy of the present procedure.

3. Adaptivity via mesh movement with three-dimensional block-structured grids

SciTech Connect

Catherall, D.

1996-12-31

The method described here is one in which grid nodes are redistributed so that they are attracted towards regions of high solution activity. The major difficulty in attempting this arises from the degree of grid smoothness and orthogonality required by the flow solver. These requirements are met by suitable choice of grid equations, to be satisfied by the adapted grid, and by the inclusion of certain source terms, for added control in regions where grid movement is limited by the local geometry. The method has been coded for multiblock grids, so that complex configurations may be treated. It is demonstrated here for inviscid supercritical flow with two test cases: an ONERA M6 wing with a rounded tip, and a forward-swept wing/fuselage configuration (M151).

4. Anisotropic Solution Adaptive Unstructured Grid Generation Using AFLR

NASA Technical Reports Server (NTRS)

Marcum, David L.

2007-01-01

An existing volume grid generation procedure, AFLR3, was successfully modified to generate anisotropic tetrahedral elements using a directional metric transformation defined at source nodes. The procedure can be coupled with a solver and an error estimator as part of an overall anisotropic solution adaptation methodology. It is suitable for use with an error estimator based on an adjoint, optimization, sensitivity derivative, or related approach. This offers many advantages, including more efficient point placement along with robust and efficient error estimation. It also serves as a framework for true grid optimization wherein error estimation and computational resources can be used as cost functions to determine the optimal point distribution. Within AFLR3 the metric transformation is implemented using a set of transformation vectors and associated aspect ratios. The modified overall procedure is presented along with details of the anisotropic transformation implementation. Multiple two-and three-dimensional examples are also presented that demonstrate the capability of the modified AFLR procedure to generate anisotropic elements using a set of source nodes with anisotropic transformation metrics. The example cases presented use moderate levels of anisotropy and result in usable element quality. Future testing with various flow solvers and methods for obtaining transformation metric information is needed to determine practical limits and evaluate the efficacy of the overall approach.

5. A well-balanced numerical scheme for shallow water simulation on adaptive grids

Zhang, H. J.; Zhou, J. Z.; Bi, S.; Li, Q. Q.; Fan, Y.

2014-04-01

The efficiency of solving two-dimensional shallow-water equations (SWEs) is vital for simulation of large-scale flood inundation. For flood flows over real topography, local high-resolution method, which uses adaptable grids, is required in order to prevent the loss of accuracy of the flow pattern while saving computational cost. This paper introduces an adaptive grid model, which uses an adaptive criterion calculated on the basis of the water lever. The grid adaption is performed by manipulating subdivision levels of the computation grids. As the flow feature varies during the shallow wave propagation, the local grid density changes adaptively and the stored information of neighbor relationship updates correspondingly, achieving a balance between the model accuracy and running efficiency. In this work, a well-balanced (WB) scheme for solving SWEs is introduced. In reconstructions of Riemann state, the definition of the unique bottom elevation on grid interfaces is modified, and the numerical scheme is pre-balanced automatically. By the validation against two idealist test cases, the proposed model is applied to simulate flood inundation due to a dam-break of Zhanghe Reservoir, Hubei province, China. The results show that the presented model is robust and well-balanced, has nice computational efficiency and numerical stability, and thus has bright application prospects.

6. Visual Methods for Model and Grid Validation

NASA Technical Reports Server (NTRS)

Pang, Alex

1998-01-01

This joint research interchange proposal allowed us to contribute in two directions that are of interest to NASA. These are: (a) data level comparative visualization of experimental and computational fluid flow, and (b) visualization tools for analysis of adaptively refined Cartesian grids.

7. A chimera grid scheme. [multiple overset body-conforming mesh system for finite difference adaptation to complex aircraft configurations

NASA Technical Reports Server (NTRS)

Steger, J. L.; Dougherty, F. C.; Benek, J. A.

1983-01-01

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

8. Adaptively-refined overlapping grids for the numerical solution of systems of hyperbolic conservation laws

NASA Technical Reports Server (NTRS)

Brislawn, Kristi D.; Brown, David L.; Chesshire, Geoffrey S.; Saltzman, Jeffrey S.

1995-01-01

Adaptive mesh refinement (AMR) in conjunction with higher-order upwind finite-difference methods have been used effectively on a variety of problems in two and three dimensions. In this paper we introduce an approach for resolving problems that involve complex geometries in which resolution of boundary geometry is important. The complex geometry is represented by using the method of overlapping grids, while local resolution is obtained by refining each component grid with the AMR algorithm, appropriately generalized for this situation. The CMPGRD algorithm introduced by Chesshire and Henshaw is used to automatically generate the overlapping grid structure for the underlying mesh.

9. Adaptive local grid refinement for the compressible 3-D Euler equations

Schoenfeld, Thilo

A method is presented based on a three-dimensional Euler code, using the explicit finite volume technique and a Runge-Kutta scheme, and applied in an adaptive version for the transonic flow around wings. The method allows embedded subgrids at two levels of refinement. Computations are performed with both various fixed refined grids and in an adaptive version applying a pressure or density gradient sensor. When comparing the results of embedded grid computations with calculations on only a total coarse or fine mesh, it can be stated that the local grid refinement technique is an effective framework to obtain well-resolved solutions with, at the same time, a minimum of grid points.

10. FLAG: A multi-dimensional adaptive free-Lagrange code for fully unstructured grids

SciTech Connect

Burton, D.E.; Miller, D.S.; Palmer, T.

1995-07-01

The authors describe FLAG, a 3D adaptive free-Lagrange method for unstructured grids. The grid elements were 3D polygons, which move with the flow, and are refined or reconnected as necessary to achieve uniform accuracy. The authors stressed that they were able to construct a 3D hydro version of this code in 3 months, using an object-oriented FORTRAN approach.

11. High order finite volume methods on wavelet-adapted grids with local time-stepping on multicore architectures for the simulation of shock-bubble interactions

Hejazialhosseini, Babak; Rossinelli, Diego; Bergdorf, Michael; Koumoutsakos, Petros

2010-11-01

We present a space-time adaptive solver for single- and multi-phase compressible flows that couples average interpolating wavelets with high-order finite volume schemes. The solver introduces the concept of wavelet blocks, handles large jumps in resolution and employs local time-stepping for efficient time integration. We demonstrate that the inherently sequential wavelet-based adaptivity can be implemented efficiently in multicore computer architectures using task-based parallelism and introducing the concept of wavelet blocks. We validate our computational method on a number of benchmark problems and we present simulations of shock-bubble interaction at different Mach numbers, demonstrating the accuracy and computational performance of the method.

12. An adaptive grid/Navier-Stokes methodology for the calculation of nozzle afterbody base flows with a supersonic freestream

NASA Technical Reports Server (NTRS)

Williams, Morgan; Lim, Dennis; Ungewitter, Ronald

1993-01-01

This paper describes an adaptive grid method for base flows in a supersonic freestream. The method is based on the direct finite-difference statement of the equidistribution principle. The weighting factor is a combination of the Mach number, density, and velocity first-derivative gradients in the radial direction. Two key ideas of the method are to smooth the weighting factor by using a type of implicit smoothing and to allow boundary points to move in the grid adaptation process. An AGARD nozzle afterbody base flow configuration is used to demonstrate the performance of the adaptive grid methodology. Computed base pressures are compared to experimental data. The adapted grid solutions offer a dramatic improvement in base pressure prediction compared to solutions computed on a nonadapted grid. A total-variation-diminishing (TVD) Navier-Stokes scheme is used to solve the governing flow equations.

13. Grid generation strategies for turbomachinery configurations

NASA Technical Reports Server (NTRS)

Lee, K. D.; Henderson, T. L.

1991-01-01

Turbomachinery flow fields involve unique grid generation issues due to their geometrical and physical characteristics. Several strategic approaches are discussed to generate quality grids. The grid quality is further enhanced through blending and adapting. Grid blending smooths the grids locally through averaging and diffusion operators. Grid adaptation redistributes the grid points based on a grid quality assessment. These methods are demonstrated with several examples.

14. Error sensitivity to refinement: a criterion for optimal grid adaptation

Luchini, Paolo; Giannnetti, Flavio; Citro, Vincenzo

2016-11-01

Most indicators used for automatic grid refinement are suboptimal, in the sense that they do not really minimize the global solution error. This paper concerns with a new indicator, related to the sensitivity map of global stability problems, suitable for an optimal grid refinement that minimizes the global solution error. The new criterion is derived from the properties of the adjoint operator and provides a map of the sensitivity of the global error (or its estimate) to a local mesh refinement. Examples are presented for both a scalar partial differential equation and for the system of Navier-Stokes equations. In the last case, we also present a grid-adaptation algorithm based on the new estimator and on the FreeFem++ software that improves the accuracy of the solution of almost two order of magnitude by redistributing the nodes of the initial computational mesh.

15. Solution adaptive grids applied to low Reynolds number flow

de With, G.; Holdø, A. E.; Huld, T. A.

2003-08-01

A numerical study has been undertaken to investigate the use of a solution adaptive grid for flow around a cylinder in the laminar flow regime. The main purpose of this work is twofold. The first aim is to investigate the suitability of a grid adaptation algorithm and the reduction in mesh size that can be obtained. Secondly, the uniform asymmetric flow structures are ideal to validate the mesh structures due to mesh refinement and consequently the selected refinement criteria. The refinement variable used in this work is a product of the rate of strain and the mesh cell size, and contains two variables Cm and Cstr which determine the order of each term. By altering the order of either one of these terms the refinement behaviour can be modified.

16. On the dynamics of some grid adaption schemes

NASA Technical Reports Server (NTRS)

Sweby, Peter K.; Yee, Helen C.

1994-01-01

The dynamics of a one-parameter family of mesh equidistribution schemes coupled with finite difference discretisations of linear and nonlinear convection-diffusion model equations is studied numerically. It is shown that, when time marched to steady state, the grid adaption not only influences the stability and convergence rate of the overall scheme, but can also introduce spurious dynamics to the numerical solution procedure.

17. A grid spacing control technique for algebraic grid generation methods

NASA Technical Reports Server (NTRS)

Smith, R. E.; Kudlinski, R. A.; Everton, E. L.

1982-01-01

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

18. An assessment of the adaptive unstructured tetrahedral grid, Euler Flow Solver Code FELISA

NASA Technical Reports Server (NTRS)

Djomehri, M. Jahed; Erickson, Larry L.

1994-01-01

A three-dimensional solution-adaptive Euler flow solver for unstructured tetrahedral meshes is assessed, and the accuracy and efficiency of the method for predicting sonic boom pressure signatures about simple generic models are demonstrated. Comparison of computational and wind tunnel data and enhancement of numerical solutions by means of grid adaptivity are discussed. The mesh generation is based on the advancing front technique. The FELISA code consists of two solvers, the Taylor-Galerkin and the Runge-Kutta-Galerkin schemes, both of which are spacially discretized by the usual Galerkin weighted residual finite-element methods but with different explicit time-marching schemes to steady state. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry adaptive procedure is also incorporated.

19. Grid generation and flow solution method for Euler equations on unstructured grids

NASA Technical Reports Server (NTRS)

Anderson, W. Kyle

1992-01-01

A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme, which uses Delaunay triangulation, generates the field points for the mesh based on cell aspect ratios and allows clustering of grid points near solid surfaces. The flow solution method is an implicit algorithm in which the linear set of equations arising at each time step is solved using a Gauss-Seidel procedure that is completely vectorizable. Also, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for an NACA 0012 airfoil as well as a two element configuration. Flow solution results are shown for a two dimensional flow over the NACA 0012 airfoil and for a two element configuration in which the solution was obtained through an adaptation procedure and compared with an exact solution. Preliminary three dimensional results also are shown in which the subsonic flow over a business jet is computed.

20. Adaptive Discontinuous Galerkin Methods in Multiwavelets Bases

SciTech Connect

Archibald, Richard K; Fann, George I; Shelton Jr, William Allison

2011-01-01

We use a multiwavelet basis with the Discontinuous Galerkin (DG) method to produce a multi-scale DG method. We apply this Multiwavelet DG method to convection and convection-diffusion problems in multiple dimensions. Merging the DG method with multiwavelets allows the adaptivity in the DG method to be resolved through manipulation of multiwavelet coefficients rather than grid manipulation. Additionally, the Multiwavelet DG method is tested on non-linear equations in one dimension and on the cubed sphere.

1. SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM. (R827028)

EPA Science Inventory

A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme––the piecewise parabolic method (PPM)––for computing advective solution fields; a weight function capable o...

2. A geometry-based adaptive unstructured grid generation algorithm for complex geological media

Bahrainian, Seyed Saied; Dezfuli, Alireza Daneh

2014-07-01

In this paper a novel unstructured grid generation algorithm is presented that considers the effect of geological features and well locations in grid resolution. The proposed grid generation algorithm presents a strategy for definition and construction of an initial grid based on the geological model, geometry adaptation of geological features, and grid resolution control. The algorithm is applied to seismotectonic map of the Masjed-i-Soleiman reservoir. Comparison of grid results with the “Triangle” program shows a more suitable permeability contrast. Immiscible two-phase flow solutions are presented for a fractured porous media test case using different grid resolutions. Adapted grid on the fracture geometry gave identical results with that of a fine grid. The adapted grid employed 88.2% less CPU time when compared to the solutions obtained by the fine grid.

3. Composite-Grid Techniques and Adaptive Mesh Refinement in Computational Fluid Dynamics

DTIC Science & Technology

1990-01-01

the equations govern- ing the flow. The patched adaptive mesh refinement technique, devised at Stanford by Oliger, et al ., copes with these sources of...patched adaptive mesh refinement technique, devised at Stanford by Oliger et al . [OL184], copes with these sources of error efficiently by refining...differential equation, as in the numerical grid generation methods proposed by Thompson et al . [THO85], or simply a list of pairs of points in

4. Generalized Monge-Kantorovich optimization for grid generation and adaptation in LP

SciTech Connect

Delzanno, G L; Finn, J M

2009-01-01

The Monge-Kantorovich grid generation and adaptation scheme of is generalized from a variational principle based on L{sub 2} to a variational principle based on L{sub p}. A generalized Monge-Ampere (MA) equation is derived and its properties are discussed. Results for p > 1 are obtained and compared in terms of the quality of the resulting grid. We conclude that for the grid generation application, the formulation based on L{sub p} for p close to unity leads to serious problems associated with the boundary. Results for 1.5 {approx}< p {approx}< 2.5 are quite good, but there is a fairly narrow range around p = 2 where the results are close to optimal with respect to grid distortion. Furthermore, the Newton-Krylov methods used to solve the generalized MA equation perform best for p = 2.

5. A transonic rectangular grid embedded panel method

NASA Technical Reports Server (NTRS)

Johnson, F. T.; Bussoletti, J. E.; James, R. M.; Young, D. P.; Woo, A. C.

1982-01-01

A method is presented that has the potential for solving transonic flow problems about the same complex aircraft configurations currently being analyzed by subsonic panel methods. This method does not require the generation of surface fitted grids. Instead it uses rectangular grids and subgrids together with embedded surface panels on which boundary conditions are imposed. Both the Euler and full potential equations are considered. The method of least squares is used to reduce the solution of these equations to the solution of a sequence of Poisson problems. The Poisson problems are solved using fast Fourier transforms and panel influence coefficient techniques. The overall method is still in its infancy but some two dimensional results are shown illustrating various key features.

6. A grid generation and flow solution method for the Euler equations on unstructured grids

SciTech Connect

Anderson, W.K. )

1994-01-01

A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme utilizes Delaunay triangulation and self-generates the field points for the mesh based on cell aspect ratios and allows for clustering near solid surfaces. The flow solution method is an implicit algorithm in which the linear set or equations arising at each time step is solved using a Gauss Seidel procedure which is completely vectorizable. In addition, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for a NACA 0012 airfoil as well as two-element configuration. Flow solution results are shown for two-dimensional flow over the NACA 0012 airfoil and for a two-element configuration in which the solution has been obtained through an adaptation procedure and compared to an exact solution. Preliminary three-dimensional results are also shown in which subsonic flow over a business jet is computed. 31 refs. 30 figs.

SciTech Connect

Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J

2004-04-09

Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.

8. Self-Avoiding Walks over Adaptive Triangular Grids

NASA Technical Reports Server (NTRS)

Heber, Gerd; Biswas, Rupak; Gao, Guang R.; Saini, Subhash (Technical Monitor)

1998-01-01

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

9. Structured background grids for generation of unstructured grids by advancing front method

NASA Technical Reports Server (NTRS)

1991-01-01

A new method of background grid construction is introduced for generation of unstructured tetrahedral grids using the advancing-front technique. Unlike the conventional triangular/tetrahedral background grids which are difficult to construct and usually inadequate in performance, the new method exploits the simplicity of uniform Cartesian meshes and provides grids of better quality. The approach is analogous to solving a steady-state heat conduction problem with discrete heat sources. The spacing parameters of grid points are distributed over the nodes of a Cartesian background grid by interpolating from a few prescribed sources and solving a Poisson equation. To increase the control over the grid point distribution, a directional clustering approach is used. The new method is convenient to use and provides better grid quality and flexibility. Sample results are presented to demonstrate the power of the method.

10. Advancing-layers method for generation of unstructured viscous grids

NASA Technical Reports Server (NTRS)

1993-01-01

A novel approach for generating highly stretched grids which is based on a modified advancing-front technique and benefits from the generality, flexibility, and grid quality of the conventional advancing-front-based Euler grid generators is presented. The method is self-sufficient for the insertion of grid points in the boundary layer and beyond. Since it is based on a totally unstructured grid strategy, the method alleviates the difficulties stemming from the structural limitations of the prismatic techniques.

11. Locally adapted space-wise grids from GOCE data

Reguzzoni, Mirko; Gatti, Andrea; De Gaetani, Carlo; Migliaccio, Federica; Sansò, Fernando

2014-05-01

GOCE data are usually translated into a spherical harmonic global model that can be used to generate various functionals of the Earth's gravitational field. An alternative representation of the information coming from GOCE is to project the observed along-track gradients onto a spherical grid at mean satellite altitude. This is the solution pursued in this work by exploiting the so called space-wise approach. In particular, once the data are filtered along the orbit in order to reduce variance and correlation of the observation noise, a gridding procedure is implemented by least-squares collocation on local data patches. Crucial points are the new way in which data are subdivided and local covariances are modeled. Basically the idea is to consider clouds of observation points around each grid knot reducing as much as possible the data undersampling in order to catch their local information. Inside the point cloud a signal covariance model based on local degree variances is used. The method has been applied on a subset of GOCE data. The resulting grid values are compared with those synthesized from a global model based on the same observation time span, showing the differences between the two representations.

12. An adaptive grid for graph-based segmentation in retinal OCT

PubMed Central

Lang, Andrew; Carass, Aaron; Calabresi, Peter A.; Ying, Howard S.; Prince, Jerry L.

2016-01-01

Graph-based methods for retinal layer segmentation have proven to be popular due to their efficiency and accuracy. These methods build a graph with nodes at each voxel location and use edges connecting nodes to encode the hard constraints of each layer’s thickness and smoothness. In this work, we explore deforming the regular voxel grid to allow adjacent vertices in the graph to more closely follow the natural curvature of the retina. This deformed grid is constructed by fixing node locations based on a regression model of each layer’s thickness relative to the overall retina thickness, thus we generate a subject specific grid. Graph vertices are not at voxel locations, which allows for control over the resolution that the graph represents. By incorporating soft constraints between adjacent nodes, segmentation on this grid will favor smoothly varying surfaces consistent with the shape of the retina. Our final segmentation method then follows our previous work. Boundary probabilities are estimated using a random forest classifier followed by an optimal graph search algorithm on the new adaptive grid to produce a final segmentation. Our method is shown to produce a more consistent segmentation with an overall accuracy of 3.38 μm across all boundaries. PMID:27773959

13. Wing tip vortex calculations with an unstructured adaptive-grid Euler solver

NASA Technical Reports Server (NTRS)

Strawn, Roger C.

1991-01-01

A solution-adaptive grid method has been developed for computing tip-vortex flowfields around rectangular wings. This method uses subdivision in order to locally refine the grid in regions with high vorticity. Two different flow solvers are used. Each solves the three-dimensional Euler equations on unstructured grids. Computed results are compared to experimentally measured surface pressures and vortex velocities on a NACA 0015 rectangular wing. Predicted results for surface pressures and integrated lift agree well with the experimental data. The predicted size of the rotational vortex core is larger than the experimentally-measured value and the peak velocities are less. This discrepancy appears to be caused by deficiencies in the inviscid Euler-equation model. This model cannot capture the complex viscous effects at the tip that determine the detailed structure of the resulting vortex. In spite of this limitation, the present Euler unstructured adaptive-grid method demonstrates the ability to convert vortical flows with low numerical diffusion. Applications for modeling helicopter rotor wake systems are discussed.

PubMed Central

2015-01-01

Conformational changes that occur upon ligand binding may be too slow to observe on the time scales routinely accessible using molecular dynamics simulations. The adaptive integration method (AIM) leverages the notion that when a ligand is either fully coupled or decoupled, according to λ, barrier heights may change, making some conformational transitions more accessible at certain λ values. AIM adaptively changes the value of λ in a single simulation so that conformations sampled at one value of λ seed the conformational space sampled at another λ value. Adapting the value of λ throughout a simulation, however, does not resolve issues in sampling when barriers remain high regardless of the λ value. In this work, we introduce a new method, called Accelerated AIM (AcclAIM), in which the potential energy function is flattened at intermediate values of λ, promoting the exploration of conformational space as the ligand is decoupled from its receptor. We show, with both a simple model system (Bromocyclohexane) and the more complex biomolecule Thrombin, that AcclAIM is a promising approach to overcome high barriers in the calculation of free energies, without the need for any statistical reweighting or additional processors. PMID:24780083

15. Parallel computation of three-dimensional flows using overlapping grids with adaptive mesh refinement

Henshaw, William D.; Schwendeman, Donald W.

2008-08-01

This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the accuracy of the numerical solutions is assessed quantitatively through an estimation of the errors from a grid convergence study. The parallel performance of the

16. Parallel Computation of Three-Dimensional Flows using Overlapping Grids with Adaptive Mesh Refinement

SciTech Connect

Henshaw, W; Schwendeman, D

2007-11-15

This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the solutions are shown to be well resolved on the finest grid. The parallel performance of the approach is examined in detail for the shock diffraction problem.

PubMed

Khooban, Mohammad-Hassan; Niknam, Taher; Blaabjerg, Frede; Davari, Pooya; Dragicevic, Tomislav

2016-11-01

The goal of this study is to introduce a novel robust load frequency control (LFC) strategy for micro-grid(s) (MG(s)) in islanded mode operation. Admittedly, power generators in MG(s) cannot supply steady electric power output and sometimes cause unbalance between supply and demand. Battery energy storage system (BESS) is one of the effective solutions to these problems. Due to the high cost of the BESS, a new idea of Vehicle-to-Grid (V2G) is that a battery of Electric-Vehicle (EV) can be applied as a tantamount large-scale BESS in MG(s). As a result, a new robust control strategy for an islanded micro-grid (MG) is introduced that can consider electric vehicles׳ (EV(s)) effect. Moreover, in this paper, a new combination of the General Type II Fuzzy Logic Sets (GT2FLS) and the Modified Harmony Search Algorithm (MHSA) technique is applied for adaptive tuning of proportional-integral (PI) controller. Implementing General Type II Fuzzy Systems is computationally expensive. However, using a recently introduced α-plane representation, GT2FLS can be seen as a composition of several Interval Type II Fuzzy Logic Systems (IT2FLS) with a corresponding level of α for each. Real-data from an offshore wind farm in Sweden and solar radiation data in Aberdeen (United Kingdom) was used in order to examine the performance of the proposed novel controller. A comparison is made between the achieved results of Optimal Fuzzy-PI (OFPI) controller and those of Optimal Interval Type II Fuzzy-PI (IT2FPI) controller, which are of most recent advances in the area at hand. The Simulation results prove the successfulness and effectiveness of the proposed controller.

18. Comparison tomography relocation hypocenter grid search and guided grid search method in Java island

Nurdian, S. W.; Adu, N.; Palupi, I. R.; Raharjo, W.

2016-11-01

The main data in this research is earthquake data recorded from 1952 to 2012 with 9162 P wave and 2426 events are recorded by 30 stations located around Java island. Relocation hypocenter processed using grid search and guidded grid search method. Then the result of relocation hypocenter become input for tomography pseudo bending inversion process. It can be used to identification the velocity distribution in subsurface. The result of relocation hypocenter by grid search and guided grid search method after tomography process shown in locally and globally. In locally area grid search method result is better than guided grid search according to geological reseach area. But in globally area the result of guided grid search method is better for a broad area because the velocity variation is more diverse than the other one and in accordance with local geological research conditions.

19. Adaptive grid finite element model of the tokamak scrapeoff layer

SciTech Connect

Kuprat, A.P.; Glasser, A.H.

1995-07-01

The authors discuss unstructured grids for application to transport in the tokamak edge SOL. They have developed a new metric with which to judge element elongation and resolution requirements. Using this method, the authors apply a standard moving finite element technique to advance the SOL equations while inserting/deleting dynamically nodes that violate an elongation criterion. In a tokamak plasma, this method achieves a more uniform accuracy, and results in highly stretched triangular finite elements, except near separatrix X-point where transport is more isotropic.

20. Unstructured viscous grid generation by advancing-front method

NASA Technical Reports Server (NTRS)

1993-01-01

A new method of generating unstructured triangular/tetrahedral grids with high-aspect-ratio cells is proposed. The method is based on new grid-marching strategy referred to as 'advancing-layers' for construction of highly stretched cells in the boundary layer and the conventional advancing-front technique for generation of regular, equilateral cells in the inviscid-flow region. Unlike the existing semi-structured viscous grid generation techniques, the new procedure relies on a totally unstructured advancing-front grid strategy resulting in a substantially enhanced grid flexibility and efficiency. The method is conceptually simple but powerful, capable of producing high quality viscous grids for complex configurations with ease. A number of two-dimensional, triangular grids are presented to demonstrate the methodology. The basic elements of the method, however, have been primarily designed with three-dimensional problems in mind, making it extendible for tetrahedral, viscous grid generation.

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2009-01-01

This poster presentation describes recent advances in adaptive control technology developed by NASA. Optimal Control Modification is a novel adaptive law that can improve performance and robustness of adaptive control systems. A new technique has been developed to provide an analytical method for computing time delay stability margin for adaptive control systems.

2. Adaptive 3D single-block grids for the computation of viscous flows around wings

SciTech Connect

Hagmeijer, R.; Kok, J.C.

1996-12-31

A robust algorithm for the adaption of a 3D single-block structured grid suitable for the computation of viscous flows around a wing is presented and demonstrated by application to the ONERA M6 wing. The effects of grid adaption on the flow solution and accuracy improvements is analyzed. Reynolds number variations are studied.

3. FUN3D Grid Refinement and Adaptation Studies for the Ares Launch Vehicle

NASA Technical Reports Server (NTRS)

Bartels, Robert E.; Vasta, Veer; Carlson, Jan-Renee; Park, Mike; Mineck, Raymond E.

2010-01-01

This paper presents grid refinement and adaptation studies performed in conjunction with computational aeroelastic analyses of the Ares crew launch vehicle (CLV). The unstructured grids used in this analysis were created with GridTool and VGRID while the adaptation was performed using the Computational Fluid Dynamic (CFD) code FUN3D with a feature based adaptation software tool. GridTool was developed by ViGYAN, Inc. while the last three software suites were developed by NASA Langley Research Center. The feature based adaptation software used here operates by aligning control volumes with shock and Mach line structures and by refining/de-refining where necessary. It does not redistribute node points on the surface. This paper assesses the sensitivity of the complex flow field about a launch vehicle to grid refinement. It also assesses the potential of feature based grid adaptation to improve the accuracy of CFD analysis for a complex launch vehicle configuration. The feature based adaptation shows the potential to improve the resolution of shocks and shear layers. Further development of the capability to adapt the boundary layer and surface grids of a tetrahedral grid is required for significant improvements in modeling the flow field.

4. A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics

SciTech Connect

Anderson, R W; Pember, R B; Elliott, N S

2002-10-19

A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.

5. A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics

SciTech Connect

Anderson, R W; Pember, R B; Elliott, N S

2004-01-28

A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.

6. Analysis of a Major Electric Grid -- Stability and Adaptive Protection

Alanzi, Sultan

7. P-SV-wave propagation in heterogeneous media: grid method

Jianfeng, Zhang; Tielin, Liu

1999-02-01

We present a new numerical modelling algorithm for P-SV-wave propagation in heterogeneous media, which is named the grid method in this paper. Similar to the finite-element method in the discretization of a numerical mesh, the grid method is flexible in incorporating surface topography and curved interfaces. The grid method, in the same way as the staggered-grid finite-difference scheme, is developed from the first-order velocity-stress hyperbolic system of elastic wave equations. The free-surface conditions are satisfied naturally for the grid method. The method, with its small numerical dispersion and good stability, is of high accuracy and low computational cost. Each time step needs 34M+N multiplication operations and 26M+N addition operations for N nodes and M triangular grids. In this paper, the triangular grid method is discussed in detail, and the numerical dispersion, stability criterion and numerical simulations are presented. The grid method based on triangular grids and quadrangular grids is also studied here.

8. Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

SciTech Connect

Perkó, Zoltán Gilli, Luca Lathouwers, Danny Kloosterman, Jan Leen

2014-03-01

The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both

9. Automated Grid Disruption Response System: Robust Adaptive Topology Control (RATC)

SciTech Connect

2012-03-01

GENI Project: The RATC research team is using topology control as a mechanism to improve system operations and manage disruptions within the electric grid. The grid is subject to interruption from cascading faults caused by extreme operating conditions, malicious external attacks, and intermittent electricity generation from renewable energy sources. The RATC system is capable of detecting, classifying, and responding to grid disturbances by reconfiguring the grid in order to maintain economically efficient operations while guaranteeing reliability. The RATC system would help prevent future power outages, which account for roughly \$80 billion in losses for businesses and consumers each year. Minimizing the time it takes for the grid to respond to expensive interruptions will also make it easier to integrate intermittent renewable energy sources into the grid.

10. Aeroacoustic Simulation of Nose Landing Gear on Adaptive Unstructured Grids With FUN3D

NASA Technical Reports Server (NTRS)

Vatsa, Veer N.; Khorrami, Mehdi R.; Park, Michael A.; Lockhard, David P.

2013-01-01

Numerical simulations have been performed for a partially-dressed, cavity-closed nose landing gear configuration that was tested in NASA Langley s closed-wall Basic Aerodynamic Research Tunnel (BART) and in the University of Florida's open-jet acoustic facility known as the UFAFF. The unstructured-grid flow solver FUN3D, developed at NASA Langley Research center, is used to compute the unsteady flow field for this configuration. Starting with a coarse grid, a series of successively finer grids were generated using the adaptive gridding methodology available in the FUN3D code. A hybrid Reynolds-averaged Navier-Stokes/large eddy simulation (RANS/LES) turbulence model is used for these computations. Time-averaged and instantaneous solutions obtained on these grids are compared with the measured data. In general, the correlation with the experimental data improves with grid refinement. A similar trend is observed for sound pressure levels obtained by using these CFD solutions as input to a FfowcsWilliams-Hawkings noise propagation code to compute the farfield noise levels. In general, the numerical solutions obtained on adapted grids compare well with the hand-tuned enriched fine grid solutions and experimental data. In addition, the grid adaption strategy discussed here simplifies the grid generation process, and results in improved computational efficiency of CFD simulations.

11. TWO-GRID METHODS FOR MAXWELL EIGENVALUE PROBLEMS

PubMed Central

ZHOU, J.; HU, X.; ZHONG, L.; SHU, S.; CHEN, L.

2015-01-01

Two new two-grid algorithms are proposed for solving the Maxwell eigenvalue problem. The new methods are based on the two-grid methodology recently proposed by Xu and Zhou [Math. Comp., 70 (2001), pp. 17–25] and further developed by Hu and Cheng [Math. Comp., 80 (2011), pp. 1287–1301] for elliptic eigenvalue problems. The new two-grid schemes reduce the solution of the Maxwell eigenvalue problem on a fine grid to one linear indefinite Maxwell equation on the same fine grid and an original eigenvalue problem on a much coarser grid. The new schemes, therefore, save total computational cost. The error estimates reveals that the two-grid methods maintain asymptotically optimal accuracy, and the numerical experiments presented confirm the theoretical results. PMID:26190866

12. Parallel adaptive wavelet collocation method for PDEs

SciTech Connect

Nejadmalayeri, Alireza; Vezolainen, Alexei; Brown-Dymkoski, Eric; Vasilyev, Oleg V.

2015-10-01

A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 2048{sup 3} using as many as 2048 CPU cores.

13. Parallel adaptive wavelet collocation method for PDEs

Nejadmalayeri, Alireza; Vezolainen, Alexei; Brown-Dymkoski, Eric; Vasilyev, Oleg V.

2015-10-01

A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 20483 using as many as 2048 CPU cores.

14. Adaptive finite-volume WENO schemes on dynamically redistributed grids for compressible Euler equations

Pathak, Harshavardhana S.; Shukla, Ratnesh K.

2016-08-01

A high-order adaptive finite-volume method is presented for simulating inviscid compressible flows on time-dependent redistributed grids. The method achieves dynamic adaptation through a combination of time-dependent mesh node clustering in regions characterized by strong solution gradients and an optimal selection of the order of accuracy and the associated reconstruction stencil in a conservative finite-volume framework. This combined approach maximizes spatial resolution in discontinuous regions that require low-order approximations for oscillation-free shock capturing. Over smooth regions, high-order discretization through finite-volume WENO schemes minimizes numerical dissipation and provides excellent resolution of intricate flow features. The method including the moving mesh equations and the compressible flow solver is formulated entirely on a transformed time-independent computational domain discretized using a simple uniform Cartesian mesh. Approximations for the metric terms that enforce discrete geometric conservation law while preserving the fourth-order accuracy of the two-point Gaussian quadrature rule are developed. Spurious Cartesian grid induced shock instabilities such as carbuncles that feature in a local one-dimensional contact capturing treatment along the cell face normals are effectively eliminated through upwind flux calculation using a rotated Hartex-Lax-van Leer contact resolving (HLLC) approximate Riemann solver for the Euler equations in generalized coordinates. Numerical experiments with the fifth and ninth-order WENO reconstructions at the two-point Gaussian quadrature nodes, over a range of challenging test cases, indicate that the redistributed mesh effectively adapts to the dynamic flow gradients thereby improving the solution accuracy substantially even when the initial starting mesh is non-adaptive. The high adaptivity combined with the fifth and especially the ninth-order WENO reconstruction allows remarkably sharp capture of

15. Time-dependent grid adaptation for meshes of triangles and tetrahedra

NASA Technical Reports Server (NTRS)

Rausch, Russ D.

1993-01-01

This paper presents in viewgraph form a method of optimizing grid generation for unsteady CFD flow calculations that distributes the numerical error evenly throughout the mesh. Adaptive meshing is used to locally enrich in regions of relatively large errors and to locally coarsen in regions of relatively small errors. The enrichment/coarsening procedures are robust for isotropic cells; however, enrichment of high aspect ratio cells may fail near boundary surfaces with relatively large curvature. The enrichment indicator worked well for the cases shown, but in general requires user supervision for a more efficient solution.

NASA Technical Reports Server (NTRS)

Dowell, B.; Govett, M.; Mccormick, S.; Quinlan, D.

1989-01-01

The progress of a project for the design and analysis of a multilevel adaptive algorithm (AFAC/HM/) targeted for the Navier Stokes Computer is discussed. The results of initial timing tests of AFAC, coupled with multigrid and an efficient load balancer, on a 16-node Intel iPSC/2 hypercube are included. The results of timing tests are presented.

17. Hyperbolic Methods for Surface and Field Grid Generation

NASA Technical Reports Server (NTRS)

Chan, William M.; VanDalsem, William R. (Technical Monitor)

1996-01-01

This chapter describes the use of hyperbolic partial differential equation methods for structured surface grid generation and field grid generation. While the surface grid generation equations are inherently three dimensional, the field grid generation equations can be formulated in two or three dimensions. The governing equations are derived from orthogonality relations and cell area/volume constraints; and are solved numerically by marching from an initial curve or surface. The marching step size and marching distance can be prescribedly the user. Exact specifications of the side and outer boundaries are not possible with a one sweep marching scheme but limited control is achievable. Excellent orthogonality and grid clustering characteristics are provided by hyperbolic methods with one to two orders of magnitude savings in time over typical elliptic methods. Since hyperbolic grid generation methods do not require the exact specifications of the side and outer boundaries of a grid, these methods are particularly well suited for the overlapping grid approach for solving problems on complex configurations. Grid generation software based on hyperbolic methods and their applications on several complex configurations will be described.

18. Adaptive Grid Generation for Numerical Solution of Partial Differential Equations.

DTIC Science & Technology

1983-12-01

RETURN 65 Bibliography 1. Thompson , J . F ., "A Survey of Grid Generation Tecniques in Computational Fluid Dynamics," AIAA Paper No. 83-0447, 1-36...edited by K. N. Ghia and U. Ghia. ASME FED, 5: 35-47 (1983). 3. Thompson , J . F ., Thames, F. C., and Mastin, C. W., "Automated Numerical Generation...Equations," Numerical Grid Generation, Edited by J. F. Thompson. New York: North Holland, 1982. 10. Thompson , J . F ., and Mastin, C. W., "Grid Generation

19. Adaptive Energy Forecasting and Information Diffusion for Smart Power Grids

SciTech Connect

Simmhan, Yogesh; Agarwal, Vaibhav; Aman, Saim; Kumbhare, Alok; Natarajan, Sreedhar; Rajguru, Nikhil; Robinson, Ian; Stevens, Samuel; Yin, Wei; Zhou, Qunzhi; Prasanna, Viktor

2012-05-16

Smart Power Grids exemplify an emerging class of Cyber Physical Applications that exhibit dynamic, distributed and data intensive (D3) characteristics along with an always-on paradigm to support operational needs. Smart Grids are an outcome of instrumentation, such as Phasor Measurement Units and Smart Power Meters, that is being deployed across the transmission and distribution network of electric grids. These sensors provide utilities with improved situation awareness on near-realtime electricity usage by individual consumers, and the power quality and stability of the transmission network.

20. Hybrid-CVFE method for flexible-grid reservoir simulation

SciTech Connect

Fung, L.S.K.; Buchanan, L.; Sharma, R. )

1994-08-01

Well flows and pressures are the most important boundary conditions in reservoir simulation. In a typical simulation, rapid changes and large pressure, temperature, saturation, and composition gradients occur in near-well regions. Treatment of these near-well phenomena significantly affects the accuracy of reservoir simulation results; therefore, extensive efforts have been devoted to the numerical treatment of wells and near-well flows. The flexible control-volume finite-element (CVFE) method is used to construct hybrid grids. The method involves use of a local cylindrical or elliptical grid to represent near-well flow accurately while honoring complex reservoir boundaries. The grid transition is smooth without any special discretization approximation, which eliminates the grid transition problem experienced with Cartesian local grid refinement and hybrid Cartesian gridding techniques.

1. Adaptive numerical methods for partial differential equations

SciTech Connect

Cololla, P.

1995-07-01

This review describes a structured approach to adaptivity. The Automated Mesh Refinement (ARM) algorithms developed by M Berger are described, touching on hyperbolic and parabolic applications. Adaptivity is achieved by overlaying finer grids only in areas flagged by a generalized error criterion. The author discusses some of the issues involved in abutting disparate-resolution grids, and demonstrates that suitable algorithms exist for dissipative as well as hyperbolic systems.

2. An adaptive remeshing scheme for vortex dominated flows using three-dimensional unstructured grids

Parikh, Paresh

1995-10-01

An adaptive remeshing procedure for vortex dominated flows is described, which uses three-dimensional unstructured grids. Surface grid adaptation is achieved using the static pressure as an adaptation parameter, while entropy is used in the field to accurately identify high vorticity regions. An emphasis has been placed in making the scheme as automatic as possible so that a minimum user interaction is required between remeshing cycles. Adapted flow solutions are obtained on two sharp-edged configurations at low speed, high angle-of-attack flow conditions. The results thus obtained are compared with fine grid CFD solutions and experimental data, and conclusions are drawn as to the efficiency of the adaptive procedure.

3. Moving Overlapping Grids with Adaptive Mesh Refinement for High-Speed Reactive and Non-reactive Flow

SciTech Connect

Henshaw, W D; Schwendeman, D W

2005-08-30

We consider the solution of the reactive and non-reactive Euler equations on two-dimensional domains that evolve in time. The domains are discretized using moving overlapping grids. In a typical grid construction, boundary-fitted grids are used to represent moving boundaries, and these grids overlap with stationary background Cartesian grids. Block-structured adaptive mesh refinement (AMR) is used to resolve fine-scale features in the flow such as shocks and detonations. Refinement grids are added to base-level grids according to an estimate of the error, and these refinement grids move with their corresponding base-level grids. The numerical approximation of the governing equations takes place in the parameter space of each component grid which is defined by a mapping from (fixed) parameter space to (moving) physical space. The mapped equations are solved numerically using a second-order extension of Godunov's method. The stiff source term in the reactive case is handled using a Runge-Kutta error-control scheme. We consider cases when the boundaries move according to a prescribed function of time and when the boundaries of embedded bodies move according to the surface stress exerted by the fluid. In the latter case, the Newton-Euler equations describe the motion of the center of mass of the each body and the rotation about it, and these equations are integrated numerically using a second-order predictor-corrector scheme. Numerical boundary conditions at slip walls are described, and numerical results are presented for both reactive and non-reactive flows in order to demonstrate the use and accuracy of the numerical approach.

4. Evaluating two sparse grid surrogates and two adaptation criteria for groundwater Bayesian uncertainty quantification

Zeng, Xiankui; Ye, Ming; Burkardt, John; Wu, Jichun; Wang, Dong; Zhu, Xiaobin

2016-04-01

5. A hybrid grid method in an auxiliary coordinate system for irregular fluid-solid interface modeling

Qu, Yingming; Huang, Jianping; Li, Zhenchun; Li, Jinli

2016-11-01

Seismic wave propagation in a fluid-solid environment cannot be simulated with a single wave equation, but can be described by use of the acoustic and viscoelastic wave equations for their respective fluid and solid parts. Proper boundary conditions at the fluid-solid interface based on the relationship between pressure and stress are crucial when combining the two different wave equations. Traditional finite difference methods (FDM) have had difficulties in dealing with the irregular fluid-solid interface topography. The Cartesian grids discretization leads to artificial reflections and diffractions during the conversion between acoustic wave and elastic waves. We propose a variable coordinate transformation methodology to simulate seismic waves in a fluid-solid environment. An irregular fluid-solid interface can be transformed into a horizontal interface, so that pressure and stress can be well converted. We also introduce a multi-block coordinate transformation (MCT) method which meshes each layer with curvilinear grids to transform the interface topography into a horizontal one, thereby allocating vertical sampling points adaptively. The grid size is determined adaptively based on the shape and the parameters of the target area, which reduces in size in when the layers are thin or exhibit low velocities. A Lebedev-standard staggered grid (LSSG) scheme is applied to the MCT method to reduce both the computational cost associated with the Lebedev grid (LG) scheme and the instability in the auxiliary coordinate system when using a standard staggered grid scheme.

6. A hybrid grid method in an auxiliary coordinate system for irregular fluid-solid interface modelling

Qu, Yingming; Huang, Jianping; Li, Zhenchun; Li, Jinli

2017-03-01

Seismic wave propagation in a fluid-solid environment cannot be simulated with a single wave equation, but can be described by use of the acoustic and viscoelastic wave equations for their respective fluid and solid parts. Proper boundary conditions at the fluid-solid interface based on the relationship between pressure and stress are crucial when combining the two different wave equations. Traditional finite difference methods have had difficulties in dealing with the irregular fluid-solid interface topography. The Cartesian grids discretization leads to artificial reflections and diffractions during the conversion between acoustic wave and elastic waves. We propose a variable coordinate transformation methodology to simulate seismic waves in a fluid-solid environment. An irregular fluid-solid interface can be transformed into a horizontal interface, so that pressure and stress can be well converted. We also introduce a multiblock coordinate transformation (MCT) method which meshes each layer with curvilinear grids to transform the interface topography into a horizontal one, thereby allocating vertical sampling points adaptively. The grid size is determined adaptively based on the shape and the parameters of the target area, which reduces in size in when the layers are thin or exhibit low velocities. A Lebedev-standard staggered grid scheme is applied to the MCT method to reduce both the computational cost associated with the Lebedev grid scheme and the instability in the auxiliary coordinate system when using a standard staggered grid scheme.

7. Adaptive reconnection-based arbitrary Lagrangian Eulerian method

DOE PAGES

Bo, Wurigen; Shashkov, Mikhail

2015-07-21

We present a new adaptive Arbitrary Lagrangian Eulerian (ALE) method. This method is based on the reconnection-based ALE (ReALE) methodology of Refs. [35], [34] and [6]. The main elements in a standard ReALE method are: an explicit Lagrangian phase on an arbitrary polygonal (in 2D) mesh in which the solution and positions of grid nodes are updated; a rezoning phase in which a new grid is defined by changing the connectivity (using Voronoi tessellation) but not the number of cells; and a remapping phase in which the Lagrangian solution is transferred onto the new grid. Furthermore, in the standard ReALEmore » method, the rezoned mesh is smoothed by using one or several steps toward centroidal Voronoi tessellation, but it is not adapted to the solution in any way.« less

8. Adaptive reconnection-based arbitrary Lagrangian Eulerian method

SciTech Connect

Bo, Wurigen; Shashkov, Mikhail

2015-07-21

We present a new adaptive Arbitrary Lagrangian Eulerian (ALE) method. This method is based on the reconnection-based ALE (ReALE) methodology of Refs. [35], [34] and [6]. The main elements in a standard ReALE method are: an explicit Lagrangian phase on an arbitrary polygonal (in 2D) mesh in which the solution and positions of grid nodes are updated; a rezoning phase in which a new grid is defined by changing the connectivity (using Voronoi tessellation) but not the number of cells; and a remapping phase in which the Lagrangian solution is transferred onto the new grid. Furthermore, in the standard ReALE method, the rezoned mesh is smoothed by using one or several steps toward centroidal Voronoi tessellation, but it is not adapted to the solution in any way.

9. Emergent Adaptive Noise Reduction from Communal Cooperation of Sensor Grid

NASA Technical Reports Server (NTRS)

Jones, Kennie H.; Jones, Michael G.; Nark, Douglas M.; Lodding, Kenneth N.

2010-01-01

In the last decade, the realization of small, inexpensive, and powerful devices with sensors, computers, and wireless communication has promised the development of massive sized sensor networks with dense deployments over large areas capable of high fidelity situational assessments. However, most management models have been based on centralized control and research has concentrated on methods for passing data from sensor devices to the central controller. Most implementations have been small but, as it is not scalable, this methodology is insufficient for massive deployments. Here, a specific application of a large sensor network for adaptive noise reduction demonstrates a new paradigm where communities of sensor/computer devices assess local conditions and make local decisions from which emerges a global behaviour. This approach obviates many of the problems of centralized control as it is not prone to single point of failure and is more scalable, efficient, robust, and fault tolerant

10. Adaptive Grid Techniques for Elliptic Fluid-Flow Problems,

DTIC Science & Technology

1985-12-01

J . F . (1984), "Grid Generation Techniques in Computational Fluid Dynamics," AIAA Jnl., Vol. 22, No. 11, pp. 1505-1523. Thompson , J . F . (1983...Procedure," Ph.D. Thesis, Dept. of Computer Science, Stanford University, Calif. Tang, W. P., W. Skamarock, and J. Oliger (1985). To appear. Thompson

11. Application of adaptive hierarchical sparse grid collocation to the uncertainty quantification of nuclear reactor simulators

SciTech Connect

Yankov, A.; Downar, T.

2013-07-01

Recent efforts in the application of uncertainty quantification to nuclear systems have utilized methods based on generalized perturbation theory and stochastic sampling. While these methods have proven to be effective they both have major drawbacks that may impede further progress. A relatively new approach based on spectral elements for uncertainty quantification is applied in this paper to several problems in reactor simulation. Spectral methods based on collocation attempt to couple the approximation free nature of stochastic sampling methods with the determinism of generalized perturbation theory. The specific spectral method used in this paper employs both the Smolyak algorithm and adaptivity by using Newton-Cotes collocation points along with linear hat basis functions. Using this approach, a surrogate model for the outputs of a computer code is constructed hierarchically by adaptively refining the collocation grid until the interpolant is converged to a user-defined threshold. The method inherently fits into the framework of parallel computing and allows for the extraction of meaningful statistics and data that are not within reach of stochastic sampling and generalized perturbation theory. This paper aims to demonstrate the advantages of spectral methods-especially when compared to current methods used in reactor physics for uncertainty quantification-and to illustrate their full potential. (authors)

12. Scenario generation for stochastic optimization problems via the sparse grid method

SciTech Connect

Chen, Michael; Mehrotra, Sanjay; Papp, David

2015-04-19

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

13. Cartesian Grid Methods for Moving Geometries

DTIC Science & Technology

2006-07-27

Technology transfer is facilitated by our Cart3D code, which is used by over 100 groups around the country. Introduction Cartesian grids have proven themselves...efforts are summarized below. Limiters for Finite Volume Schemes The Cart3D steady state flow solver has some stalling of convergence due to cut... Cart3D by my collaborator Scott Murman. One-dimensional Model Problem The simplest setting to study the accuracy and stability of flow with a moving

14. Adaptive grid embedding for the two-dimensional flux-split Euler equations. M.S. Thesis

NASA Technical Reports Server (NTRS)

Warren, Gary Patrick

1990-01-01

A numerical algorithm is presented for solving the 2-D flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for a subcritical airfoil and a transonic airfoil with 3 levels of adaptation. Comparisons are made with a structured upwind Euler code which uses the same flux integration techniques of the present algorithm. Good agreement is obtained with converged surface pressure coefficients. The lift coefficients of the adaptive code are within 2 1/2 percent of the structured code for the sub-critical case and within 4 1/2 percent of the structured code for the transonic case using approximately one-third the number of grid points.

15. Staggered-grid split-node method for spontaneous rupture simulation

Dalguer, Luis A.; Day, Steven M.

2007-02-01

We adapt the traction-at-split-node method for spontaneous rupture simulations to the velocity-stress staggered-grid finite difference scheme. The staggered-grid implementation introduces both velocity and stress discontinuities via split nodes. The staggered traction components on the fault plane are interpolated to form the traction vector at split nodes, facilitating alignment of the vectors of sliding friction and slip velocity. To simplify the split-node partitioning of the equations of motion, spatial differencing is reduced from fourth to second order along the fault plane, but in the remainder of the grid the spatial differencing scheme remains identical to conventional spatially fourth-order three-dimensional staggered-grid schemes. The resulting staggered-grid split node (SGSN) method has convergence rates relative to rupture-time, final-slip, and peak-slip-velocity metrics that are very similar to the corresponding rates for both a partly staggered split-node code (DFM) and the boundary integral method. The SGSN method gives very accurate solutions (in the sense that errors are comparable to the uncertainties in the reference solution) when the median resolution of the cohesive zone is 4.4 grid points. Combined with previous results for other grid types and other fault-discontinuity approximations, the SGSN results demonstrate that accuracy in finite difference solutions to the spontaneous rupture problem is controlled principally by the scheme used to represent the fault discontinuity, and is relatively insensitive to the grid geometry used to represent the continuum. The method provides an efficient and accurate means of adding spontaneous rupture capability to velocity-stress staggered-grid finite difference codes, while retaining the computational advantages of those codes for problems of wave propagation in complex media.

16. Elastic finite-difference method for irregular grids

SciTech Connect

1999-01-01

Finite-difference (FD) modeling of complicated structures requires simple algorithms. This paper presents a new elastic FD method for spatially irregular grids that is simple and, at the same time, saves considerable memory and computing time. Features like faults, low-velocity layers, cavities, and/or nonplanar surfaces are treated on a fine grid, while the remaining parts of the model are, with equal accuracy, represented on a coarse grid. No interpolation is needed between the fine and coarse parts due to the rectangular grid cells. Relatively abrupt transitions between the small and large grid steps produce no numerical artifacts in the present method. Planar or nonplanar free surfaces, including underground cavities, are treated in a way similar to internal grid points but with consideration of the zero-valued elastic parameters and density outside the free surface (vacuum formalism). A theoretical proof that vacuum formalism fulfills the free-surface conditions is given. Numerical validation is performed through comparison with independent methods, comparing FD with explicitly prescribed boundary conditions and finite elements. Memory and computing time needed in the studied models was only about 10 to 40% of that employing regular square grids of equal accuracy. A practical example of a synthetic seismic section, showing clear signatures of a coal seam and cavity, is presented. The method can be extended to three dimensions.

17. Adaptive Unstructured Grid Generation for Modeling of Coastal Margins

DTIC Science & Technology

1999-09-30

applied to the 2+1D simulations of the barotropic circulation in the Tagus estuary (Fortunato et al. 1997). The approach, denoted localized sigma...analysis. Application to the Tagus does not appear to have produced new pathologies relative to a conventional sigma-coordinate discretization, and reduced...particular, adopt and provide additional testbeds and technical feedback for our grid generation software. The Columbia River estuary and plume have provided

18. 3D magnetospheric parallel hybrid multi-grid method applied to planet–plasma interactions

SciTech Connect

Leclercq, L.; Mancini, M.

2016-03-15

We present a new method to exploit multiple refinement levels within a 3D parallel hybrid model, developed to study planet–plasma interactions. This model is based on the hybrid formalism: ions are kinetically treated whereas electrons are considered as a inertia-less fluid. Generally, ions are represented by numerical particles whose size equals the volume of the cells. Particles that leave a coarse grid subsequently entering a refined region are split into particles whose volume corresponds to the volume of the refined cells. The number of refined particles created from a coarse particle depends on the grid refinement rate. In order to conserve velocity distribution functions and to avoid calculations of average velocities, particles are not coalesced. Moreover, to ensure the constancy of particles' shape function sizes, the hybrid method is adapted to allow refined particles to move within a coarse region. Another innovation of this approach is the method developed to compute grid moments at interfaces between two refinement levels. Indeed, the hybrid method is adapted to accurately account for the special grid structure at the interfaces, avoiding any overlapping grid considerations. Some fundamental test runs were performed to validate our approach (e.g. quiet plasma flow, Alfven wave propagation). Lastly, we also show a planetary application of the model, simulating the interaction between Jupiter's moon Ganymede and the Jovian plasma.

19. The Neural Network Method of Corrosion Diagnosis for Grounding Grid

SciTech Connect

Hou Zaien; Duan Fujian; Zhang Kecun

2008-11-06

Safety of persons, protection of equipment and continuity of power supply are the main objectives of the grounding system of a large electrical installation. For its accurate working status, it is essential to determine every branch resistance in the system. In this paper, we present a neural network method of corrosion diagnosis for the grounding grid based on the neural network theory. The feasibility of this method is discussed by means of its application to a simulant grounding grid.

20. Unstructured Grid Adaptation: Status, Potential Impacts, and Recommended Investments Toward CFD Vision 2030

NASA Technical Reports Server (NTRS)

Park, Michael A.; Krakos, Joshua A.; Michal, Todd; Loseille, Adrien; Alonso, Juan J.

2016-01-01

Unstructured grid adaptation is a powerful tool to control discretization error for Computational Fluid Dynamics (CFD). It has enabled key increases in the accuracy, automation, and capacity of some fluid simulation applications. Slotnick et al. provides a number of case studies in the CFD Vision 2030 Study: A Path to Revolutionary Computational Aerosciences to illustrate the current state of CFD capability and capacity. The authors forecast the potential impact of emerging High Performance Computing (HPC) environments forecast in the year 2030 and identify that mesh generation and adaptivity continue to be significant bottlenecks in the CFD work flow. These bottlenecks may persist because very little government investment has been targeted in these areas. To motivate investment, the impacts of improved grid adaptation technologies are identified. The CFD Vision 2030 Study roadmap and anticipated capabilities in complementary disciplines are quoted to provide context for the progress made in grid adaptation in the past fifteen years, current status, and a forecast for the next fifteen years with recommended investments. These investments are specific to mesh adaptation and impact other aspects of the CFD process. Finally, a strategy is identified to diffuse grid adaptation technology into production CFD work flows.

1. Comparison of local grid refinement methods for MODFLOW.

PubMed

Mehl, Steffen; Hill, Mary C; Leake, Stanley A

2006-01-01

Many ground water modeling efforts use a finite-difference method to solve the ground water flow equation, and many of these models require a relatively fine-grid discretization to accurately represent the selected process in limited areas of interest. Use of a fine grid over the entire domain can be computationally prohibitive; using a variably spaced grid can lead to cells with a large aspect ratio and refinement in areas where detail is not needed. One solution is to use local-grid refinement (LGR) whereby the grid is only refined in the area of interest. This work reviews some LGR methods and identifies advantages and drawbacks in test cases using MODFLOW-2000. The first test case is two dimensional and heterogeneous; the second is three dimensional and includes interaction with a meandering river. Results include simulations using a uniform fine grid, a variably spaced grid, a traditional method of LGR without feedback, and a new shared node method with feedback. Discrepancies from the solution obtained with the uniform fine grid are investigated. For the models tested, the traditional one-way coupled approaches produced discrepancies in head up to 6.8% and discrepancies in cell-to-cell fluxes up to 7.1%, while the new method has head and cell-to-cell flux discrepancies of 0.089% and 0.14%, respectively. Additional results highlight the accuracy, flexibility, and CPU time trade-off of these methods and demonstrate how the new method can be successfully implemented to model surface water-ground water interactions.

2. Comparison of local grid refinement methods for MODFLOW

USGS Publications Warehouse

Mehl, S.; Hill, M.C.; Leake, S.A.

2006-01-01

Many ground water modeling efforts use a finite-difference method to solve the ground water flow equation, and many of these models require a relatively fine-grid discretization to accurately represent the selected process in limited areas of interest. Use of a fine grid over the entire domain can be computationally prohibitive; using a variably spaced grid can lead to cells with a large aspect ratio and refinement in areas where detail is not needed. One solution is to use local-grid refinement (LGR) whereby the grid is only refined in the area of interest. This work reviews some LGR methods and identifies advantages and drawbacks in test cases using MODFLOW-2000. The first test case is two dimensional and heterogeneous; the second is three dimensional and includes interaction with a meandering river. Results include simulations using a uniform fine grid, a variably spaced grid, a traditional method of LGR without feedback, and a new shared node method with feedback. Discrepancies from the solution obtained with the uniform fine grid are investigated. For the models tested, the traditional one-way coupled approaches produced discrepancies in head up to 6.8% and discrepancies in cell-to-cell fluxes up to 7.1%, while the new method has head and cell-to-cell flux discrepancies of 0.089% and 0.14%, respectively. Additional results highlight the accuracy, flexibility, and CPU time trade-off of these methods and demonstrate how the new method can be successfully implemented to model surface water-ground water interactions. Copyright ?? 2006 The Author(s).

3. Dynamic response of shock waves in transonic diffuser and supersonic inlet - An analysis with the Navier-Stokes equations and adaptive grid

NASA Technical Reports Server (NTRS)

Liu, N.-S.; Shamroth, S. J.; Mcdonald, H.

1984-01-01

An existing method which solves the multi-dimensional ensemble-averaged compressible time-dependent Navier-Stokes equations in conjunction with mixing length turbulence model and shock capturing technique has been extended to include the shock-tracking adaptive grid systems. The numerical scheme for solving the governing equations is based on a linearized block implicit approach. The effects of grid-motion and grid-distribution on the calculated flow solutions have been studied in relative detail and this is carried out in the context of physically steady, shocked flows computed with non-stationary grids. Subsequently, the unsteady dynamics of the flows occurring in a supercritically operated transonic diffuser and a mixed compression supersonic inlet have been investigated with the adaptive grid systems by solving the Navier-Stokes equations.

4. A 3D finite-volume scheme for the Euler equations on adaptive tetrahedral grids

SciTech Connect

Vijayan, P.; Kallinderis, Y. )

1994-08-01

The paper describes the development and application of a new Euler solver for adaptive tetrahedral grids. Spatial discretization uses a finite-volume, node-based scheme that is of central-differencing type. A second-order Taylor series expansion is employed to march the solution in time according to the Lax-Wendroff approach. Special upwind-like smoothing operators for unstructured grids are developed for shock-capturing, as well as for suppression of solution oscillations. The scheme is formulated so that all operations are edge-based, which reduces the computational effort significantly. An adaptive grid algorithm is employed in order to resolve local flow features. This is achieved by dividing the tetrahedral cells locally, guided by a flow feature detection algorithm. Application cases include transonic flow around the ONERA M6 wing and transonic flow past a transport aircraft configuration. Comparisons with experimental data evaluate accuracy of the developed adaptive solver. 31 refs., 33 figs.

5. Adaptive Local Grid Refinement in Computational Fluid Mechanics.

DTIC Science & Technology

1987-11-01

Adaptive mesh refinements in reservoir simulation applications (R.E. Ew- ing), Proceedings Intl. Conference on Accuracy Est. and Adaptive Refine... reservoir simulation (R.E. Ewing and .J.V. 1{oebbe), Innovati’ve Numerical Mlethods in Engineering, (R.P. Shaw, J. Pc- riaux, A. Chaudouet, J. Wu...Universities, Cheyenne, Wyoming, February 21, 1986, O 9. Finite element techniques for reservoir simulation , Fourth International Sym- posium on Numerical

6. An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

NASA Technical Reports Server (NTRS)

Lemke, Max; Witsch, Kristian; Quinlan, Daniel

1993-01-01

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

7. Bayesian strong gravitational-lens modelling on adaptive grids: objective detection of mass substructure in Galaxies

Vegetti, S.; Koopmans, L. V. E.

2009-01-01

We introduce a new adaptive and fully Bayesian grid-based method to model strong gravitational lenses with extended images. The primary goal of this method is to quantify the level of luminous and dark mass substructure in massive galaxies, through their effect on highly magnified arcs and Einstein rings. The method is adaptive on the source plane, where a Delaunay tessellation is defined according to the lens mapping of a regular grid on to the source plane. The Bayesian penalty function allows us to recover the best non-linear potential-model parameters and/or a grid-based potential correction and to objectively quantify the level of regularization for both the source and potential. In addition, we implement a Nested-Sampling technique to quantify the errors on all non-linear mass model parameters - marginalized over all source and regularization parameters - and allow an objective ranking of different potential models in terms of the marginalized evidence. In particular, we are interested in comparing very smooth lens mass models with ones that contain mass substructures. The algorithm has been tested on a range of simulated data sets, created from a model of a realistic lens system. One of the lens systems is characterized by a smooth potential with a power-law density profile, 12 include a Navarro, Frenk and White (NFW) dark matter substructure of different masses and at different positions and one contains two NFW dark substructures with the same mass but with different positions. Reconstruction of the source and lens potential for all of these systems shows the method is able, in a realistic scenario, to identify perturbations with masses >~107Msolar when located on the Einstein ring. For positions both inside and outside of the ring, masses of at least 109Msolar are required (i.e. roughly the Einstein ring of the perturber needs to overlap with that of the main lens). Our method provides a fully novel and objective test of mass substructure in massive

8. Supersampling method for efficient grid-based electronic structure calculations.

PubMed

Ryu, Seongok; Choi, Sunghwan; Hong, Kwangwoo; Kim, Woo Youn

2016-03-07

The egg-box effect, the spurious variation of energy and force due to the discretization of continuous space, is an inherent vexing problem in grid-based electronic structure calculations. Its effective suppression allowing for large grid spacing is thus crucial for accurate and efficient computations. We here report that the supersampling method drastically alleviates it by eliminating the rapidly varying part of a target function along both radial and angular directions. In particular, the use of the sinc filtering function performs best because as an ideal low pass filter it clearly cuts out the high frequency region beyond allowed by a given grid spacing.

9. Network gateway security method for enterprise Grid: a literature review

Sujarwo, A.; Tan, J.

2017-03-01

The computational Grid has brought big computational resources closer to scientists. It enables people to do a large computational job anytime and anywhere without any physical border anymore. However, the massive and spread of computer participants either as user or computational provider arise problems in security. The challenge is on how the security system, especially the one which filters data in the gateway could works in flexibility depends on the registered Grid participants. This paper surveys what people have done to approach this challenge, in order to find the better and new method for enterprise Grid. The findings of this paper is the dynamically controlled enterprise firewall to secure the Grid resources from unwanted connections with a new firewall controlling method and components.

Luo, Xisheng; Wang, Luying; Ran, Wei; Qin, Fenghua

2016-10-01

A GPU accelerated inviscid flow solver is developed on an unstructured quadrilateral grid in the present work. For the first time, the cell-based adaptive mesh refinement (AMR) is fully implemented on GPU for the unstructured quadrilateral grid, which greatly reduces the frequency of data exchange between GPU and CPU. Specifically, the AMR is processed with atomic operations to parallelize list operations, and null memory recycling is realized to improve the efficiency of memory utilization. It is found that results obtained by GPUs agree very well with the exact or experimental results in literature. An acceleration ratio of 4 is obtained between the parallel code running on the old GPU GT9800 and the serial code running on E3-1230 V2. With the optimization of configuring a larger L1 cache and adopting Shared Memory based atomic operations on the newer GPU C2050, an acceleration ratio of 20 is achieved. The parallelized cell-based AMR processes have achieved 2x speedup on GT9800 and 18x on Tesla C2050, which demonstrates that parallel running of the cell-based AMR method on GPU is feasible and efficient. Our results also indicate that the new development of GPU architecture benefits the fluid dynamics computing significantly.

11. Application of unstructured grid methods to steady and unsteady aerodynamic problems

NASA Technical Reports Server (NTRS)

Batina, John T.

1989-01-01

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

12. A Cartesian grid embedded boundary method for Poisson`s equation on irregular domains

SciTech Connect

Johansen, H.; Colella, P.

1997-01-31

The authors present a numerical method for solving Poisson`s equation, with variable coefficients and Dirichlet boundary conditions, on two-dimensional regions. The approach uses a finite-volume discretization, which embeds the domain in a regular Cartesian grid. They treat the solution as a cell-centered quantity, even when those centers are outside the domain. Cells that contain a portion of the domain boundary use conservation differencing of second-order accurate fluxes, on each cell volume. The calculation of the boundary flux ensures that the conditioning of the matrix is relatively unaffected by small cell volumes. This allows them to use multi-grid iterations with a simple point relaxation strategy. They have combined this with an adaptive mesh refinement (AMR) procedure. They provide evidence that the algorithm is second-order accurate on various exact solutions, and compare the adaptive and non-adaptive calculations.

13. A Hybrid Solar Wind Model of the CESE+HLL Method with a Yin-Yang Overset Grid and an AMR Grid

Feng, Xueshang; Zhang, Shaohua; Xiang, Changqing; Yang, Liping; Jiang, Chaowei; Wu, S. T.

2011-06-01

A hybrid three-dimensional (3D) MHD model for solar wind study is proposed in the present paper with combined grid systems and solvers. The computational domain from the Sun to Earth space is decomposed into the near-Sun and off-Sun domains, which are respectively constructed with a Yin-Yang overset grid system and a Cartesian adaptive mesh refinement (AMR) grid system and coupled with a domain connection interface in the overlapping region between the near-Sun and off-Sun domains. The space-time conservation element and solution element method is used in the near-Sun domain, while the Harten-Lax-Leer method is employed in the off-Sun domain. The Yin-Yang overset grid can avoid well-known singularity and polar grid convergence problems and its body-fitting property helps achieve high-quality resolution near the solar surface. The block structured AMR Cartesian grid can automatically capture far-field plasma flow features, such as heliospheric current sheets and shock waves, and at the same time, it can save significant computational resources compared to the uniformly structured Cartesian grid. A numerical study of the solar wind structure for Carrington rotation 2069 shows that the newly developed hybrid MHD solar wind model successfully produces many realistic features of the background solar wind, in both the solar corona and interplanetary space, by comparisons with multiple solar and interplanetary observations.

14. A HYBRID SOLAR WIND MODEL OF THE CESE+HLL METHOD WITH A YIN-YANG OVERSET GRID AND AN AMR GRID

SciTech Connect

Feng Xueshang; Zhang Shaohua; Xiang Changqing; Yang Liping; Jiang Chaowei; Wu, S. T.

2011-06-10

A hybrid three-dimensional (3D) MHD model for solar wind study is proposed in the present paper with combined grid systems and solvers. The computational domain from the Sun to Earth space is decomposed into the near-Sun and off-Sun domains, which are respectively constructed with a Yin-Yang overset grid system and a Cartesian adaptive mesh refinement (AMR) grid system and coupled with a domain connection interface in the overlapping region between the near-Sun and off-Sun domains. The space-time conservation element and solution element method is used in the near-Sun domain, while the Harten-Lax-Leer method is employed in the off-Sun domain. The Yin-Yang overset grid can avoid well-known singularity and polar grid convergence problems and its body-fitting property helps achieve high-quality resolution near the solar surface. The block structured AMR Cartesian grid can automatically capture far-field plasma flow features, such as heliospheric current sheets and shock waves, and at the same time, it can save significant computational resources compared to the uniformly structured Cartesian grid. A numerical study of the solar wind structure for Carrington rotation 2069 shows that the newly developed hybrid MHD solar wind model successfully produces many realistic features of the background solar wind, in both the solar corona and interplanetary space, by comparisons with multiple solar and interplanetary observations.

15. Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

NASA Technical Reports Server (NTRS)

Oliker, Leonid; Biswas, Rupak; Strawn, Roger C.

1996-01-01

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

16. Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2

NASA Technical Reports Server (NTRS)

Strawn, Roger C.; Oliker, Leonid; Biswas, Rupak

1996-01-01

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.0X speedup on 64 processors when 10 percent of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all the mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

17. Grid-Adapted FUN3D Computations for the Second High Lift Prediction Workshop

NASA Technical Reports Server (NTRS)

Lee-Rausch, E. M.; Rumsey, C. L.; Park, M. A.

2014-01-01

Contributions of the unstructured Reynolds-averaged Navier-Stokes code FUN3D to the 2nd AIAA CFD High Lift Prediction Workshop are described, and detailed comparisons are made with experimental data. Using workshop-supplied grids, results for the clean wing configuration are compared with results from the structured code CFL3D Using the same turbulence model, both codes compare reasonably well in terms of total forces and moments, and the maximum lift is similarly over-predicted for both codes compared to experiment. By including more representative geometry features such as slat and flap brackets and slat pressure tube bundles, FUN3D captures the general effects of the Reynolds number variation, but under-predicts maximum lift on workshop-supplied grids in comparison with the experimental data, due to excessive separation. However, when output-based, off-body grid adaptation in FUN3D is employed, results improve considerably. In particular, when the geometry includes both brackets and the pressure tube bundles, grid adaptation results in a more accurate prediction of lift near stall in comparison with the wind-tunnel data. Furthermore, a rotation-corrected turbulence model shows improved pressure predictions on the outboard span when using adapted grids.

18. An immersed boundary method for non-uniform Cartesian grids

Jang, Juwon; Lee, Changhoon

2016-11-01

Many kinds of immersed boundary method have been developed, but most of them have been used in uniform grids with discrete Dirac delta functions. Therefore, the distribution of Lagrangian points over the immersed surface is usually made uniformly. However, when any immersed boundary method is to be applied to non-uniform grids, uniform distribution might not be optimum for good performance. Recently, Akiki and Balachandar (2016) proposed a method to distribute the Lagrangian points nonuniformly over the surface of a sphere near the wall, but it cannot not be extended to more general shape of immersed surface. We propose a method that is capable for properly distributing the Lagrangian points over any kind of surface by considering the size of nearby Eulerian grids. Present method first finds intersection points between immersed surface and nonuniform Cartesian grids. Then, the centroid of the intersection points is projected on the immersed surface to be designated by Lagrangian point. This procedure guarantees one Lagrangian point per the Eulerian grid cell. This method is validated for various problems such as flows around a settling sphere, a moving sphere in the near-wall region and a tilted ellipsoid near the wall.

19. An adaptive level set method

SciTech Connect

Milne, Roger Brent

1995-12-01

This thesis describes a new method for the numerical solution of partial differential equations of the parabolic type on an adaptively refined mesh in two or more spatial dimensions. The method is motivated and developed in the context of the level set formulation for the curvature dependent propagation of surfaces in three dimensions. In that setting, it realizes the multiple advantages of decreased computational effort, localized accuracy enhancement, and compatibility with problems containing a range of length scales.

20. Preliminary Benchmarking of Plinian Eruption Simulations Using an Adaptive Grid Eulerian Technique

Peterson, A. H.; Ogden, D. E.; Wohletz, K. H.; Gisler, G.; Glatzmaier, G. A.

2005-12-01

The SAGE (SAIC Adaptive Grid Eulerian) code is an Eulerian hydrodynamics numerical technique employing adaptive mesh refinement at each cycle for every cell in 1-, 2-, and 3-D grids. It is primarily designed to solve high deformation flow of multiple materials and thus provides important capabilities for simulating volcanic eruption phenomena. Its multimaterial equation of state libraries includes a comprehensive coverage of water from solid ice through two-phase liquid and vapor to supercritical states approaching the Hugoniot, and extremely important aspect for simulating volcanic gases in general. In development are strength and failure rules that model non-Newtonian fluid/solid deformation. Because of the low effective sound speeds of eruptive mixtures, the facts that SAGE uses a piecewise, linear, multi-material, Gudonov numerical method to resolve shocks with second-order precision and exactly conserves mass, momentum, and energy, are a highly desirable attributes. Although this code has been previously used to simulate a volcanic eruption (i.e., eruption through a crater lake at Ruapehu volcano by Morrissey and Gisler), we are embarking in an effort to benchmark the code with CFDLib, a well-validated arbitrary Lagrangian-Eulerian code developed at Los Alamos National Laboratory. Through this effort we expect to better understand the strengths and weaknesses, the limitations, and provide direction for important enhancement of SAGE, and potentially provide the volcanological community with a powerful alternative to numerical codes currently available. At this point in our benchmarking, we demonstrate some results for fluid convection within a chamber and fluid jetting through a conduit.

1. Method of adaptive artificial viscosity

Popov, I. V.; Fryazinov, I. V.

2011-09-01

A new finite-difference method for the numerical solution of gas dynamics equations is proposed. This method is a uniform monotonous finite-difference scheme of second-order approximation on time and space outside of domains of shock and compression waves. This method is based on inputting adaptive artificial viscosity (AAV) into gas dynamics equations. In this paper, this method is analyzed for 2D geometry. The testing computations of the movement of contact discontinuities and shock waves and the breakup of discontinuities are demonstrated.

2. Integration of hp-Adaptivity and a Two Grid Solver. II. Electromagnetic Problems

DTIC Science & Technology

2005-01-01

for lower order FE spaces. More precisely, let T be a grid,M the associated lowest order Nedelec subspaces ofHD(curl; Ω) of the first kind [24], and W... Nedelec , Mixed finite elements in IR3., Numer. Math., 35 (1980), pp. 315–341. [25] D. Pardo and L. Demkowicz, Integration of hp-adaptivity with a two

3. White Light Schlieren Optics Using Bacteriorhodopsin as an Adaptive Image Grid

NASA Technical Reports Server (NTRS)

Peale, Robert; Ruffin, Boh; Donahue, Jeff; Barrett, Carolyn

1996-01-01

A Schlieren apparatus using a bacteriorhodopsin film as an adaptive image grid with white light illumination is demonstrated for the first time. The time dependent spectral properties of the film are characterized. Potential applications include a single-ended Schlieren system for leak detection.

4. Variable High Order Multiblock Overlapping Grid Methods for Mixed Steady and Unsteady Multiscale Viscous Flows

SciTech Connect

Sjogreen, B; Yee, H C

2007-12-12

Flows containing steady or nearly steady strong shocks in parts of the flow field, and unsteady turbulence with shocklets on other parts of the flow field are difficult to capture accurately and efficiently employing the same numerical scheme even under the multiblock grid or adaptive grid refinement framework. On one hand, sixth-order or higher shock-capturing methods are appropriate for unsteady turbulence with shocklets. On the other hand, lower order shock-capturing methods are more effective for strong steady shocks in terms of convergence. In order to minimize the shortcomings of low order and high order shock-capturing schemes for the subject flows, a multi-block overlapping grid with different orders of accuracy on different blocks is proposed. Test cases to illustrate the performance of the new solver are included.

5. Re-architecting flow-control adaptation for grid environments

SciTech Connect

Engelhart, A.; Gardner, M. K.; Feng, W. C.

2004-01-01

The performance of TCP in wide-area networks (WANs) is becoming increasingly important with the deployment of computational and data grids. At WAN speeds, TCP does not provide good performance for data-intensive applications without the tuning of flow-control buffer sizes. Manual adjustment of buffer sizes is tedious even for network experts. For scientists, tuning is often an impediment to getting work done. Thus, buffer tuning should be automated. Existing techniques for automatic buffer tuning only measure the bandwidth-delay product (BDP) during connection establishment. This ignores the (large) fluctuation of the BDP over the lifetime of the connection. In contrast, the Dynamic Right-Sizing algorithm dynamically changes buffer sizes in response to changing network conditions. In this paper, we describe a new user-space implementation of Dynamic Right-Sizing in FTP (drsFTP) that supports third-party data transfers, a mainstay of scientific computing. In addition to comparing the performance of the new implementation with the old, we give performance results over a live WAN. The new implementation gives transfer rates of up to five times higher than untuned FTP.

6. Structure overset grid method and its applications to simulation of multi-body separation

Zhang, HaiRui; Fan, JingJing; Yuan, Wu; Zhang, WeiHua

2015-09-01

This paper proposes an automatic structure overset grid method, which utilizes the hole-surface optimization with one-step searching, wall-surface grid oversetting, and dynamic overset grid approaches to achieve the high adaptability of overset grids for complex multi-body aircrafts. Specifically, based on the automatic structure overset grids, the method first solves the coupling of Navier-Stokes (N-S) unsteady flow equation and 6DOF motion equation, and establishes the multi-body collision model. Then, the numerical simulation of unsteady flow for complex aircrafts' multi-body separation, the simulation of multi-body separating trajectory and the separation safety analysis are accomplished. Thus, the method can properly handle practical engineering problems including the wing/drop tank separation, aircraft/mount separation, and cluster bomb projection. Experiments show that our numerical results match well with experimental results, which demonstrates the effectiveness of our methods in solving the multi-body separation problem for aircrafts with complex shapes.

7. An adaptive discretization of compressible flow using a multitude of moving Cartesian grids

Qiu, Linhai; Lu, Wenlong; Fedkiw, Ronald

2016-01-01

We present a novel method for simulating compressible flow on a multitude of Cartesian grids that can rotate and translate. Following previous work, we split the time integration into an explicit step for advection followed by an implicit solve for the pressure. A second order accurate flux based scheme is devised to handle advection on each moving Cartesian grid using an effective characteristic velocity that accounts for the grid motion. In order to avoid the stringent time step restriction imposed by very fine grids, we propose strategies that allow for a fluid velocity CFL number larger than 1. The stringent time step restriction related to the sound speed is alleviated by formulating an implicit linear system in order to find a pressure consistent with the equation of state. This implicit linear system crosses overlapping Cartesian grid boundaries by utilizing local Voronoi meshes to connect the various degrees of freedom obtaining a symmetric positive-definite system. Since a straightforward application of this technique contains an inherent central differencing which can result in spurious oscillations, we introduce a new high order diffusion term similar in spirit to ENO-LLF but solved for implicitly in order to avoid any associated time step restrictions. The method is conservative on each grid, as well as globally conservative on the background grid that contains all other grids. Moreover, a conservative interpolation operator is devised for conservatively remapping values in order to keep them consistent across different overlapping grids. Additionally, the method is extended to handle two-way solid fluid coupling in a monolithic fashion including cases (in the appendix) where solids in close proximity do not properly allow for grid based degrees of freedom in between them.

8. A general hybrid radiation transport scheme for star formation simulations on an adaptive grid

SciTech Connect

Klassen, Mikhail; Pudritz, Ralph E.; Kuiper, Rolf; Peters, Thomas; Banerjee, Robi; Buntemeyer, Lars

2014-12-10

9. A General Hybrid Radiation Transport Scheme for Star Formation Simulations on an Adaptive Grid

Klassen, Mikhail; Kuiper, Rolf; Pudritz, Ralph E.; Peters, Thomas; Banerjee, Robi; Buntemeyer, Lars

2014-12-01

10. Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

Péron, Stéphanie; Benoit, Christophe

2013-01-01

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

11. An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.; Lu, James; Park, Michael A.; Darmofal, David L.

2003-01-01

An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

12. Operational adaptability evaluation index system of pumped storage in UHV receiving-end grids

Yuan, Bo; Zong, Jin; Feng, Junshu

2017-01-01

Pumped storage is an effective solution to deal with the emergency reserve shortage, renewable energy accommodating and peak-shaving problems in ultra-high voltage (UHV) transmission receiving-end grids. However, governments and public opinion in China tend to evaluate the operational effectiveness of pumped storage using annual utilization hour, which may result in unreasonable and unnecessary dispatch of pumped storage. This paper built an operational adaptability evaluation index system for pumped storage in UHV-receiving end grids from three aspects: security insurance, peak-shaving and renewable energy accommodating, which can provide a comprehensive and objective way to evaluate the operational performance of a pumped storage station.

13. Adapting implicit methods to parallel processors

SciTech Connect

Reeves, L.; McMillin, B.; Okunbor, D.; Riggins, D.

1994-12-31

When numerically solving many types of partial differential equations, it is advantageous to use implicit methods because of their better stability and more flexible parameter choice, (e.g. larger time steps). However, since implicit methods usually require simultaneous knowledge of the entire computational domain, these methods axe difficult to implement directly on distributed memory parallel processors. This leads to infrequent use of implicit methods on parallel/distributed systems. The usual implementation of implicit methods is inefficient due to the nature of parallel systems where it is common to take the computational domain and distribute the grid points over the processors so as to maintain a relatively even workload per processor. This creates a problem at the locations in the domain where adjacent points are not on the same processor. In order for the values at these points to be calculated, messages have to be exchanged between the corresponding processors. Without special adaptation, this will result in idle processors during part of the computation, and as the number of idle processors increases, the lower the effective speed improvement by using a parallel processor.

14. On the Quality of Velocity Interpolation Schemes for Marker-in-Cell Method and Staggered Grids

Pusok, Adina E.; Kaus, Boris J. P.; Popov, Anton A.

2016-11-01

The marker-in-cell method is generally considered a flexible and robust method to model the advection of heterogenous non-diffusive properties (i.e., rock type or composition) in geodynamic problems. In this method, Lagrangian points carrying compositional information are advected with the ambient velocity field on an Eulerian grid. However, velocity interpolation from grid points to marker locations is often performed without considering the divergence of the velocity field at the interpolated locations (i.e., non-conservative). Such interpolation schemes can induce non-physical clustering of markers when strong velocity gradients are present (Journal of Computational Physics 166:218-252, 2001) and this may, eventually, result in empty grid cells, a serious numerical violation of the marker-in-cell method. To remedy this at low computational costs, Jenny et al. (Journal of Computational Physics 166:218-252, 2001) and Meyer and Jenny (Proceedings in Applied Mathematics and Mechanics 4:466-467, 2004) proposed a simple, conservative velocity interpolation scheme for 2-D staggered grid, while Wang et al. (Geochemistry, Geophysics, Geosystems 16(6):2015-2023, 2015) extended the formulation to 3-D finite element methods. Here, we adapt this formulation for 3-D staggered grids (correction interpolation) and we report on the quality of various velocity interpolation methods for 2-D and 3-D staggered grids. We test the interpolation schemes in combination with different advection schemes on incompressible Stokes problems with strong velocity gradients, which are discretized using a finite difference method. Our results suggest that a conservative formulation reduces the dispersion and clustering of markers, minimizing the need of unphysical marker control in geodynamic models.

15. On the Quality of Velocity Interpolation Schemes for Marker-in-Cell Method and Staggered Grids

Pusok, Adina E.; Kaus, Boris J. P.; Popov, Anton A.

2017-03-01

The marker-in-cell method is generally considered a flexible and robust method to model the advection of heterogenous non-diffusive properties (i.e., rock type or composition) in geodynamic problems. In this method, Lagrangian points carrying compositional information are advected with the ambient velocity field on an Eulerian grid. However, velocity interpolation from grid points to marker locations is often performed without considering the divergence of the velocity field at the interpolated locations (i.e., non-conservative). Such interpolation schemes can induce non-physical clustering of markers when strong velocity gradients are present (Journal of Computational Physics 166:218-252, 2001) and this may, eventually, result in empty grid cells, a serious numerical violation of the marker-in-cell method. To remedy this at low computational costs, Jenny et al. (Journal of Computational Physics 166:218-252, 2001) and Meyer and Jenny (Proceedings in Applied Mathematics and Mechanics 4:466-467, 2004) proposed a simple, conservative velocity interpolation scheme for 2-D staggered grid, while Wang et al. (Geochemistry, Geophysics, Geosystems 16(6):2015-2023, 2015) extended the formulation to 3-D finite element methods. Here, we adapt this formulation for 3-D staggered grids (correction interpolation) and we report on the quality of various velocity interpolation methods for 2-D and 3-D staggered grids. We test the interpolation schemes in combination with different advection schemes on incompressible Stokes problems with strong velocity gradients, which are discretized using a finite difference method. Our results suggest that a conservative formulation reduces the dispersion and clustering of markers, minimizing the need of unphysical marker control in geodynamic models.

16. Scenario generation for stochastic optimization problems via the sparse grid method

DOE PAGES

Chen, Michael; Mehrotra, Sanjay; Papp, David

2015-04-19

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid methodmore » can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.« less

17. The development and application of the self-adaptive grid code, SAGE

NASA Technical Reports Server (NTRS)

Davies, Carol B.

1993-01-01

The multidimensional self-adaptive grid code, SAGE, has proven to be a flexible and useful tool in the solution of complex flow problems. Both 2- and 3-D examples given in this report show the code to be reliable and to substantially improve flowfield solutions. Since the adaptive procedure is a marching scheme the code is extremely fast and uses insignificant CPU time compared to the corresponding flow solver. The SAGE program is also machine and flow solver independent. Significant effort was made to simplify user interaction, though some parameters still need to be chosen with care. It is also difficult to tell when the adaption process has provided its best possible solution. This is particularly true if no experimental data are available or if there is a lack of theoretical understanding of the flow. Another difficulty occurs if local features are important but missing in the original grid; the adaption to this solution will not result in any improvement, and only grid refinement can result in an improved solution. These are complex issues that need to be explored within the context of each specific problem.

NASA Technical Reports Server (NTRS)

Nguyen, Nhan T.

2009-01-01

19. Adaptive Methods for Compressible Flow

DTIC Science & Technology

1994-03-01

convergence while requiring little additional storage. In addition, multigrid can be used in conjunction with any convergent base scheme, with adequate care ...coarse grids can be obtained with the agglomeration technique, although care must be taken to ensure that the coarse grid operator is convergent on these... care - those cells that intersect the surface. DT- ful programming, many of these geometri- NURBS does not currently provide the ca- cal computations can

20. Parallel 3D Mortar Element Method for Adaptive Nonconforming Meshes

NASA Technical Reports Server (NTRS)

Feng, Huiyu; Mavriplis, Catherine; VanderWijngaart, Rob; Biswas, Rupak

2004-01-01

High order methods are frequently used in computational simulation for their high accuracy. An efficient way to avoid unnecessary computation in smooth regions of the solution is to use adaptive meshes which employ fine grids only in areas where they are needed. Nonconforming spectral elements allow the grid to be flexibly adjusted to satisfy the computational accuracy requirements. The method is suitable for computational simulations of unsteady problems with very disparate length scales or unsteady moving features, such as heat transfer, fluid dynamics or flame combustion. In this work, we select the Mark Element Method (MEM) to handle the non-conforming interfaces between elements. A new technique is introduced to efficiently implement MEM in 3-D nonconforming meshes. By introducing an "intermediate mortar", the proposed method decomposes the projection between 3-D elements and mortars into two steps. In each step, projection matrices derived in 2-D are used. The two-step method avoids explicitly forming/deriving large projection matrices for 3-D meshes, and also helps to simplify the implementation. This new technique can be used for both h- and p-type adaptation. This method is applied to an unsteady 3-D moving heat source problem. With our new MEM implementation, mesh adaptation is able to efficiently refine the grid near the heat source and coarsen the grid once the heat source passes. The savings in computational work resulting from the dynamic mesh adaptation is demonstrated by the reduction of the the number of elements used and CPU time spent. MEM and mesh adaptation, respectively, bring irregularity and dynamics to the computer memory access pattern. Hence, they provide a good way to gauge the performance of computer systems when running scientific applications whose memory access patterns are irregular and unpredictable. We select a 3-D moving heat source problem as the Unstructured Adaptive (UA) grid benchmark, a new component of the NAS Parallel

1. Final Report: Symposium on Adaptive Methods for Partial Differential Equations

SciTech Connect

Pernice, M.; Johnson, C.R.; Smith, P.J.; Fogelson, A.

1998-12-10

OAK-B135 Final Report: Symposium on Adaptive Methods for Partial Differential Equations. Complex physical phenomena often include features that span a wide range of spatial and temporal scales. Accurate simulation of such phenomena can be difficult to obtain, and computations that are under-resolved can even exhibit spurious features. While it is possible to resolve small scale features by increasing the number of grid points, global grid refinement can quickly lead to problems that are intractable, even on the largest available computing facilities. These constraints are particularly severe for three dimensional problems that involve complex physics. One way to achieve the needed resolution is to refine the computational mesh locally, in only those regions where enhanced resolution is required. Adaptive solution methods concentrate computational effort in regions where it is most needed. These methods have been successfully applied to a wide variety of problems in computational science and engineering. Adaptive methods can be difficult to implement, prompting the development of tools and environments to facilitate their use. To ensure that the results of their efforts are useful, algorithm and tool developers must maintain close communication with application specialists. Conversely it remains difficult for application specialists who are unfamiliar with the methods to evaluate the trade-offs between the benefits of enhanced local resolution and the effort needed to implement an adaptive solution method.

2. Development of the Finite Difference Time Domain Method on a Lebedev Grid for Anisotropic Materials

Nauta, Marcel D.

The finite-difference time-domain (FDTD) method is derived on a Lebedev grid, instead of the standard Yee grid, to better represent the constitutive relations in anisotropic materials. The Lebedev grid extends the Yee grid by approximating Maxwell's equations with tensor constitutive relations using only central differences. A dispersion relation with stability criteria is derived and it is proven that the Lebedev grid has a consistent calculus. An integral derivation of the update equations illustrates how to appropriately excite the grid. This approach is also used to derive the update equations at planar material interfaces and domain edge PEC. Lebedev grid results are compared with analytical and Yee grid solutions using an equal memory comparison. Numerical results show that the Lebedev grid suffers greater dispersion error but better represents material interfaces. Focus is given to generalizing the concepts that make the Yee grid robust for isotropic materials. Keywords: FDTD, anisotropic materials, Lebedev grid, collocated grids.

3. Arbitrary Lagrangian-Eulerian Method with Local Structured Adaptive Mesh Refinement for Modeling Shock Hydrodynamics

SciTech Connect

Anderson, R W; Pember, R B; Elliott, N S

2001-10-22

A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. This method facilitates the solution of problems currently at and beyond the boundary of soluble problems by traditional ALE methods by focusing computational resources where they are required through dynamic adaption. Many of the core issues involved in the development of the combined ALEAMR method hinge upon the integration of AMR with a staggered grid Lagrangian integration method. The novel components of the method are mainly driven by the need to reconcile traditional AMR techniques, which are typically employed on stationary meshes with cell-centered quantities, with the staggered grids and grid motion employed by Lagrangian methods. Numerical examples are presented which demonstrate the accuracy and efficiency of the method.

4. Multilayer neural network models based on grid methods

Lazovskaya, T.; Tarkhov, D.

2016-11-01

The article discusses building hybrid models relating classical numerical methods for solving ordinary and partial differential equations and the universal neural network approach being developed by D Tarkhov and A Vasilyev. The different ways of constructing multilayer neural network structures based on grid methods are considered. The technique of building a continuous approximation using one simple modification of classical schemes is presented. Introduction non-linear relationships into the classic models with and without posterior learning are investigated. The numerical experiments are conducted.

5. The spectral element method on variable resolution grids: evaluating grid sensitivity and resolution-aware numerical viscosity

DOE PAGES

Guba, O.; Taylor, M. A.; Ullrich, P. A.; ...

2014-06-25

We evaluate the performance of the Community Atmosphere Model's (CAM) spectral element method on variable resolution grids using the shallow water equations in spherical geometry. We configure the method as it is used in CAM, with dissipation of grid scale variance implemented using hyperviscosity. Hyperviscosity is highly scale selective and grid independent, but does require a resolution dependent coefficient. For the spectral element method with variable resolution grids and highly distorted elements, we obtain the best results if we introduce a tensor-based hyperviscosity with tensor coefficients tied to the eigenvalues of the local element metric tensor. The tensor hyperviscosity ismore » constructed so that for regions of uniform resolution it matches the traditional constant coefficient hyperviscsosity. With the tensor hyperviscosity the large scale solution is almost completely unaffected by the presence of grid refinement. This later point is important for climate applications where long term climatological averages can be imprinted by stationary inhomogeneities in the truncation error. We also evaluate the robustness of the approach with respect to grid quality by considering unstructured conforming quadrilateral grids generated with a well-known grid-generating toolkit and grids generated by SQuadGen, a new open source alternative which produces lower valence nodes.« less

6. The spectral element method (SEM) on variable-resolution grids: evaluating grid sensitivity and resolution-aware numerical viscosity

DOE PAGES

Guba, O.; Taylor, M. A.; Ullrich, P. A.; ...

2014-11-27

We evaluate the performance of the Community Atmosphere Model's (CAM) spectral element method on variable-resolution grids using the shallow-water equations in spherical geometry. We configure the method as it is used in CAM, with dissipation of grid scale variance, implemented using hyperviscosity. Hyperviscosity is highly scale selective and grid independent, but does require a resolution-dependent coefficient. For the spectral element method with variable-resolution grids and highly distorted elements, we obtain the best results if we introduce a tensor-based hyperviscosity with tensor coefficients tied to the eigenvalues of the local element metric tensor. The tensor hyperviscosity is constructed so that, formore » regions of uniform resolution, it matches the traditional constant-coefficient hyperviscosity. With the tensor hyperviscosity, the large-scale solution is almost completely unaffected by the presence of grid refinement. This later point is important for climate applications in which long term climatological averages can be imprinted by stationary inhomogeneities in the truncation error. We also evaluate the robustness of the approach with respect to grid quality by considering unstructured conforming quadrilateral grids generated with a well-known grid-generating toolkit and grids generated by SQuadGen, a new open source alternative which produces lower valence nodes.« less

7. Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

NASA Technical Reports Server (NTRS)

Liu, Yen; Vinokur, Marcel; Wang, Z. J.

2004-01-01

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. A discussion on the Discontinuous Spectral Difference (SD) Method, locations of the unknowns and flux points and numerical results are also presented.

8. Estimation of Model's Marginal likelihood Using Adaptive Sparse Grid Surrogates in Bayesian Model Averaging

Zeng, X.

2015-12-01

A large number of model executions are required to obtain alternative conceptual models' predictions and their posterior probabilities in Bayesian model averaging (BMA). The posterior model probability is estimated through models' marginal likelihood and prior probability. The heavy computation burden hinders the implementation of BMA prediction, especially for the elaborated marginal likelihood estimator. For overcoming the computation burden of BMA, an adaptive sparse grid (SG) stochastic collocation method is used to build surrogates for alternative conceptual models through the numerical experiment of a synthetical groundwater model. BMA predictions depend on model posterior weights (or marginal likelihoods), and this study also evaluated four marginal likelihood estimators, including arithmetic mean estimator (AME), harmonic mean estimator (HME), stabilized harmonic mean estimator (SHME), and thermodynamic integration estimator (TIE). The results demonstrate that TIE is accurate in estimating conceptual models' marginal likelihoods. The BMA-TIE has better predictive performance than other BMA predictions. TIE has high stability for estimating conceptual model's marginal likelihood. The repeated estimated conceptual model's marginal likelihoods by TIE have significant less variability than that estimated by other estimators. In addition, the SG surrogates are efficient to facilitate BMA predictions, especially for BMA-TIE. The number of model executions needed for building surrogates is 4.13%, 6.89%, 3.44%, and 0.43% of the required model executions of BMA-AME, BMA-HME, BMA-SHME, and BMA-TIE, respectively.

9. Features of CPB: a Poisson-Boltzmann solver that uses an adaptive Cartesian grid.

PubMed

Fenley, Marcia O; Harris, Robert C; Mackoy, Travis; Boschitsch, Alexander H

2015-02-05

The capabilities of an adaptive Cartesian grid (ACG)-based Poisson-Boltzmann (PB) solver (CPB) are demonstrated. CPB solves various PB equations with an ACG, built from a hierarchical octree decomposition of the computational domain. This procedure decreases the number of points required, thereby reducing computational demands. Inside the molecule, CPB solves for the reaction-field component (ϕrf ) of the electrostatic potential (ϕ), eliminating the charge-induced singularities in ϕ. CPB can also use a least-squares reconstruction method to improve estimates of ϕ at the molecular surface. All surfaces, which include solvent excluded, Gaussians, and others, are created analytically, eliminating errors associated with triangulated surfaces. These features allow CPB to produce detailed surface maps of ϕ and compute polar solvation and binding free energies for large biomolecular assemblies, such as ribosomes and viruses, with reduced computational demands compared to other Poisson-Boltzmann equation solvers. The reader is referred to http://www.continuum-dynamics.com/solution-mm.html for how to obtain the CPB software.

10. Multi-off-grid methods in multi-step integration of ordinary differential equations

NASA Technical Reports Server (NTRS)

Beaudet, P. R.

1974-01-01

Description of methods of solving first- and second-order systems of differential equations in which all derivatives are evaluated at off-grid locations in order to circumvent the Dahlquist stability limitation on the order of on-grid methods. The proposed multi-off-grid methods require off-grid state predictors for the evaluation of the n derivatives at each step. Progressing forward in time, the off-grid states are predicted using a linear combination of back on-grid state values and off-grid derivative evaluations. A comparison is made between the proposed multi-off-grid methods and the corresponding Adams and Cowell on-grid integration techniques in integrating systems of ordinary differential equations, showing a significant reduction in the error at larger step sizes in the case of the multi-off-grid integrator.

11. A cartesian grid embedded boundary method for hyperbolic conservation laws

SciTech Connect

Colella, Phillip; Graves, Daniel T.; Keen, Benjamin J.; Modiano, David

2004-10-03

We present a second-order Godunov algorithm to solve time-dependent hyperbolic systems of conservation laws on irregular domains. Our approach is based on a formally consistent discretization of the conservation laws on a finite-volume grid obtained from intersecting the domain with a Cartesian grid. We address the small-cell stability problem associated with such methods by hybridizing our conservative discretization with a stable, nonconservative discretization at irregular control volumes, and redistributing the difference in the mass increments to nearby cells in a way that preserves stability and local conservation. The resulting method is second-order accurate in L{sup 1} for smooth problems, and is robust in the presence of large-amplitude discontinuities intersecting the irregular boundary.

NASA Technical Reports Server (NTRS)

Park, Michael A.

2002-01-01

Engineering computational fluid dynamics (CFD) analysis and design applications focus on output functions (e.g., lift, drag). Errors in these output functions are generally unknown and conservatively accurate solutions may be computed. Computable error estimates can offer the possibility to minimize computational work for a prescribed error tolerance. Such an estimate can be computed by solving the flow equations and the linear adjoint problem for the functional of interest. The computational mesh can be modified to minimize the uncertainty of a computed error estimate. This robust mesh-adaptation procedure automatically terminates when the simulation is within a user specified error tolerance. This procedure for estimating and adapting to error in a functional is demonstrated for three-dimensional Euler problems. An adaptive mesh procedure that links to a Computer Aided Design (CAD) surface representation is demonstrated for wing, wing-body, and extruded high lift airfoil configurations. The error estimation and adaptation procedure yielded corrected functions that are as accurate as functions calculated on uniformly refined grids with ten times as many grid points.

13. Cartesian grid method for gas kinetic scheme on irregular geometries

Chen, Songze; Xu, Kun; Li, Zhihui

2016-12-01

A Cartesian grid method combined with a simplified gas kinetic scheme is presented for subsonic and supersonic viscous flow simulation on complex geometries. Under the Cartesian mesh, the boundaries are represented by a set of direction-oriented boundary points, and the computational grid points are classified into four different categories, the fluid point, the solid point, the drop point, and the interpolation point. A constrained weighted least square method is employed to evaluate the physical quantities at the interpolation points. Different boundary conditions, including isothermal boundary, adiabatic boundary, and Euler slip boundary, are presented by different interpolation strategies. We adopt a simplified gas kinetic scheme as the flux solver for both subsonic and supersonic flow computations. The methodology of constructing a simplified kinetic flux function can be extended to other flow systems. A few numerical examples are used to validate the Cartesian grid method and the simplified flux solver. The reconstruction scheme for recovering the boundary conditions of compressible viscous and heat conducting flow with a Cartesian mesh can provide a smooth distribution of physical quantities at solid boundary, and present an accurate solution for the flow study with complex geometry.

14. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT

SciTech Connect

Gutowski, William J.; Prusa, Joseph M.; Smolarkiewicz, Piotr K.

2012-05-08

This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the "physics" of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited. 3a. EULAG Advances EULAG is a non-hydrostatic, parallel computational model for all-scale geophysical flows. EULAG's name derives from its two computational options: EULerian (flux form) or semi-LAGrangian (advective form). The model combines nonoscillatory forward-in-time (NFT) numerical algorithms with a robust elliptic Krylov solver. A signature feature of EULAG is that it is formulated in generalized time-dependent curvilinear coordinates. In particular, this enables grid adaptivity. In total, these features give EULAG novel advantages over many existing dynamical cores. For EULAG itself, numerical advances included refining boundary conditions and filters for optimizing model performance in polar regions. We also added flexibility to the model's underlying formulation, allowing it to work with the pseudo-compressible equation set of Durran in addition to EULAG's standard anelastic formulation. Work in collaboration with others also extended the demonstrated range of

15. Hydrologic extremes - an intercomparison of multiple gridded statistical downscaling methods

Werner, Arelia T.; Cannon, Alex J.

2016-04-01

Gridded statistical downscaling methods are the main means of preparing climate model data to drive distributed hydrological models. Past work on the validation of climate downscaling methods has focused on temperature and precipitation, with less attention paid to the ultimate outputs from hydrological models. Also, as attention shifts towards projections of extreme events, downscaling comparisons now commonly assess methods in terms of climate extremes, but hydrologic extremes are less well explored. Here, we test the ability of gridded downscaling models to replicate historical properties of climate and hydrologic extremes, as measured in terms of temporal sequencing (i.e. correlation tests) and distributional properties (i.e. tests for equality of probability distributions). Outputs from seven downscaling methods - bias correction constructed analogues (BCCA), double BCCA (DBCCA), BCCA with quantile mapping reordering (BCCAQ), bias correction spatial disaggregation (BCSD), BCSD using minimum/maximum temperature (BCSDX), the climate imprint delta method (CI), and bias corrected CI (BCCI) - are used to drive the Variable Infiltration Capacity (VIC) model over the snow-dominated Peace River basin, British Columbia. Outputs are tested using split-sample validation on 26 climate extremes indices (ClimDEX) and two hydrologic extremes indices (3-day peak flow and 7-day peak flow). To characterize observational uncertainty, four atmospheric reanalyses are used as climate model surrogates and two gridded observational data sets are used as downscaling target data. The skill of the downscaling methods generally depended on reanalysis and gridded observational data set. However, CI failed to reproduce the distribution and BCSD and BCSDX the timing of winter 7-day low-flow events, regardless of reanalysis or observational data set. Overall, DBCCA passed the greatest number of tests for the ClimDEX indices, while BCCAQ, which is designed to more accurately resolve event

16. Hydrologic extremes - an intercomparison of multiple gridded statistical downscaling methods

Werner, A. T.; Cannon, A. J.

2015-06-01

Gridded statistical downscaling methods are the main means of preparing climate model data to drive distributed hydrological models. Past work on the validation of climate downscaling methods has focused on temperature and precipitation, with less attention paid to the ultimate outputs from hydrological models. Also, as attention shifts towards projections of extreme events, downscaling comparisons now commonly assess methods in terms of climate extremes, but hydrologic extremes are less well explored. Here, we test the ability of gridded downscaling models to replicate historical properties of climate and hydrologic extremes, as measured in terms of temporal sequencing (i.e., correlation tests) and distributional properties (i.e., tests for equality of probability distributions). Outputs from seven downscaling methods - bias correction constructed analogues (BCCA), double BCCA (DBCCA), BCCA with quantile mapping reordering (BCCAQ), bias correction spatial disaggregation (BCSD), BCSD using minimum/maximum temperature (BCSDX), climate imprint delta method (CI), and bias corrected CI (BCCI) - are used to drive the Variable Infiltration Capacity (VIC) model over the snow-dominated Peace River basin, British Columbia. Outputs are tested using split-sample validation on 26 climate extremes indices (ClimDEX) and two hydrologic extremes indices (3 day peak flow and 7 day peak flow). To characterize observational uncertainty, four atmospheric reanalyses are used as climate model surrogates and two gridded observational datasets are used as downscaling target data. The skill of the downscaling methods generally depended on reanalysis and gridded observational dataset. However, CI failed to reproduce the distribution and BCSD and BCSDX the timing of winter 7 day low flow events, regardless of reanalysis or observational dataset. Overall, DBCCA passed the greatest number of tests for the ClimDEX indices, while BCCAQ, which is designed to more accurately resolve event

17. Exploring virtualisation tools with a new virtualisation provisioning method to test dynamic grid environments for ALICE grid jobs over ARC grid middleware

Wagner, B.; Kileng, B.; Alice Collaboration

2014-06-01

The Nordic Tier-1 centre for LHC is distributed over several computing centres. It uses ARC as the internal computing grid middleware. ALICE uses its own grid middleware AliEn to distribute jobs and the necessary software application stack. To make use of most of the AliEn infrastructure and software deployment methods for running ALICE grid jobs on ARC, we are investigating different possible virtualisation technologies. For this a testbed and possible framework for bridging different middleware systems is under development. It allows us to test a variety of virtualisation methods and software deployment technologies in the form of different virtual machines.

18. Methods for Procuring Power System Flexibility, Greening the Grid

SciTech Connect

Katz, Jessica; Cochran, Jaquelin; Miller, Mackay

2015-05-01

Greening the Grid provides technical assistance to energy system planners, regulators, and grid operators to overcome challenges associated with integrating variable renewable energy into the grid. This document, part of a Greening the Grid toolkit, introduces administrative and incentive-based mechanisms for procuring a cost-effective mix of flexibility sources.

19. Final Report: Symposium on Adaptive Methods for Partial Differential Equations

SciTech Connect

Pernice, Michael; Johnson, Christopher R.; Smith, Philip J.; Fogelson, Aaron

1998-12-08

Complex physical phenomena often include features that span a wide range of spatial and temporal scales. Accurate simulation of such phenomena can be difficult to obtain, and computations that are under-resolved can even exhibit spurious features. While it is possible to resolve small scale features by increasing the number of grid points, global grid refinement can quickly lead to problems that are intractable, even on the largest available computing facilities. These constraints are particularly severe for three dimensional problems that involve complex physics. One way to achieve the needed resolution is to refine the computational mesh locally, in only those regions where enhanced resolution is required. Adaptive solution methods concentrate computational effort in regions where it is most needed. These methods have been successfully applied to a wide variety of problems in computational science and engineering. Adaptive methods can be difficult to implement, prompting the development of tools and environments to facilitate their use. To ensure that the results of their efforts are useful, algorithm and tool developers must maintain close communication with application specialists. Conversely it remains difficult for application specialists who are unfamiliar with the methods to evaluate the trade-offs between the benefits of enhanced local resolution and the effort needed to implement an adaptive solution method.

20. Damping of spurious numerical reflections off of coarse-fine adaptive mesh refinement grid boundaries

Chilton, Sven; Colella, Phillip

2010-11-01

Adaptive mesh refinement (AMR) is an efficient technique for solving systems of partial differential equations numerically. The underlying algorithm determines where and when a base spatial and temporal grid must be resolved further in order to achieve the desired precision and accuracy in the numerical solution. However, propagating wave solutions prove problematic for AMR. In systems with low degrees of dissipation (e.g. the Maxwell-Vlasov system) a wave traveling from a finely resolved region into a coarsely resolved region encounters a numerical impedance mismatch, resulting in spurious reflections off of the coarse-fine grid boundary. These reflected waves then become trapped inside the fine region. Here, we present a scheme for damping these spurious reflections. We demonstrate its application to the scalar wave equation and an implementation for Maxwell's Equations. We also discuss a possible extension to the Maxwell-Vlasov system.

1. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

DOE PAGES

Jakeman, J. D.; Wildey, T.

2015-01-01

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this papermore » we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.« less

2. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

SciTech Connect

Jakeman, J. D.; Wildey, T.

2015-01-01

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

3. Unstructured-grid methods development: Lessons le arned

NASA Technical Reports Server (NTRS)

Batina, John T.

1991-01-01

The development is summarized of unstructured grid methods for the solution of the equations of fluid flow and some of the lessons learned are shared. The 3-D Euler equations are solved, including spatial discretizations, temporal discretizations, and boundary conditions. An example calculation with an upwind implicit method using a CFL (Courant Friedricks Lewy) number of infinity is presented for the Boeing 747 aircraft. The results obtained in less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the present capability.

4. Numerical Modeling of Spray Combustion with an Unstructured-Grid Method

NASA Technical Reports Server (NTRS)

Shang, H. M.; Chen, Y. S.; Liaw, P.; Shih, M. H.; Wang, T. S.

1996-01-01

The present unstructured-grid method follows strictly the basic finite volume forms of the conservation laws of the governing equations for the entire flow domain. High-order spatially accurate formulation has been employed for the numerical solutions of the Navier-Stokes equations. A two-equation k-epsilon turbulence model is also incorporated in the unstructured-grid solver. The convergence of the resulted linear algebraic equation is accelerated with preconditioned Conjugate Gradient method. A statistical spray combustion model has been incorporated into the present unstructured-grid solver. In this model, spray is represented by discrete particles, rather than by continuous distributions. A finite number of computational particles are used to predict a sample of total population of particles. Particle trajectories are integrated using their momentum and motion equations and particles exchange mass, momentum and energy with the gas within the computational cell in which they are located. The interaction calculations are performed simultaneously and eliminate global iteration for the two-phase momentum exchange. A transient spray flame in a high pressure combustion chamber is predicted and then the solution of liquid-fuel combusting flow with a rotating cup atomizer is presented and compared with the experimental data. The major conclusion of this investigation is that the unstructured-grid method can be employed to study very complicated flow fields of turbulent spray combustion. Grid adaptation can be easily achieved in any flow domain such as droplet evaporation and combustion zone. Future applications of the present model can be found in the full three-dimensional study of flow fields of gas turbine and liquid propulsion engine combustion chambers with multi-injectors.

5. Adaptive Hierarchical Voltage Control of a DFIG-Based Wind Power Plant for a Grid Fault

SciTech Connect

Kim, Jinho; Muljadi, Eduard; Park, Jung-Wook; Kang, Yong Cheol

2016-11-01

This paper proposes an adaptive hierarchical voltage control scheme of a doubly-fed induction generator (DFIG)-based wind power plant (WPP) that can secure more reserve of reactive power (Q) in the WPP against a grid fault. To achieve this, each DFIG controller employs an adaptive reactive power to voltage (Q-V) characteristic. The proposed adaptive Q-V characteristic is temporally modified depending on the available Q capability of a DFIG; it is dependent on the distance from a DFIG to the point of common coupling (PCC). The proposed characteristic secures more Q reserve in the WPP than the fixed one. Furthermore, it allows DFIGs to promptly inject up to the Q limit, thereby improving the PCC voltage support. To avert an overvoltage after the fault clearance, washout filters are implemented in the WPP and DFIG controllers; they can prevent a surplus Q injection after the fault clearance by eliminating the accumulated values in the proportional-integral controllers of both controllers during the fault. Test results demonstrate that the scheme can improve the voltage support capability during the fault and suppress transient overvoltage after the fault clearance under scenarios of various system and fault conditions; therefore, it helps ensure grid resilience by supporting the voltage stability.

6. An overset grid method for global geomagnetic induction

Weiss, Chester J.

2014-07-01

A new finite difference solution to the global geomagnetic induction problem is developed and tested, based on a modified Lorenz gauge of the magnetic vector and electric scalar potentials and implementing a novel, overset `Yin-Yang' grid that avoids unnecessary mesh refinement at the geographic poles. Previously used in whole-earth mantle convection models, the overset grid is built from a pair of partially overlapping mid-latitude latitude-longitude (lat/lon) grids, one of which is rotated with respect to the other for complete coverage of the sphere. Because of this symmetry, only one set of finite difference templates is required for global discretization of the governing Maxwell equations, a redundancy that is exploited for computational efficiency and multithreaded parallelization. Comparisons between solutions obtained by the proposed method show excellent agreement with those obtained by independent integral equation methods for 1-D, 2-D and 3-D problem geometries. The computational footprint of the method is minimized through a (non-symmetric) matrix-free BiCG-STAB iterative solver which computes finite difference matrix coefficients `on the fly' as needed, rather than pulling stored values from memory. Scaling of the matrix-free BiCG-STAB algorithm with problem size shows behaviour similar to that seen with the (symmetric) QMR algorithm used in the Cartesian case from which the present algorithm is based. The proposed method may therefore provide a competitive addition to the existing body of global-scale geomagnetic induction modelling algorithms, allowing for resource-efficient forward modelling as the kernel for large-scale computing such as inversion of geomagnetic response functions, computational hypothesis testing and parametric studies of mantle geodynamics and physiochemical state.

7. A multiscale restriction-smoothed basis method for high contrast porous media represented on unstructured grids

SciTech Connect

Møyner, Olav Lie, Knut-Andreas

2016-01-01

A wide variety of multiscale methods have been proposed in the literature to reduce runtime and provide better scaling for the solution of Poisson-type equations modeling flow in porous media. We present a new multiscale restricted-smoothed basis (MsRSB) method that is designed to be applicable to both rectilinear grids and unstructured grids. Like many other multiscale methods, MsRSB relies on a coarse partition of the underlying fine grid and a set of local prolongation operators (multiscale basis functions) that map unknowns associated with the fine grid cells to unknowns associated with blocks in the coarse partition. These mappings are constructed by restricted smoothing: Starting from a constant, a localized iterative scheme is applied directly to the fine-scale discretization to compute prolongation operators that are consistent with the local properties of the differential operators. The resulting method has three main advantages: First of all, both the coarse and the fine grid can have general polyhedral geometry and unstructured topology. This means that partitions and good prolongation operators can easily be constructed for complex models involving high media contrasts and unstructured cell connections introduced by faults, pinch-outs, erosion, local grid refinement, etc. In particular, the coarse partition can be adapted to geological or flow-field properties represented on cells or faces to improve accuracy. Secondly, the method is accurate and robust when compared to existing multiscale methods and does not need expensive recomputation of local basis functions to account for transient behavior: Dynamic mobility changes are incorporated by continuing to iterate a few extra steps on existing basis functions. This way, the cost of updating the prolongation operators becomes proportional to the amount of change in fluid mobility and one reduces the need for expensive, tolerance-based updates. Finally, since the MsRSB method is formulated on top of a cell

8. Fully Isotropic Fast Marching Methods on Cartesian Grids.

PubMed

Appia, Vikram; Yezzi, Anthony

2010-01-01

The existing Fast Marching methods which are used to solve the Eikonal equation use a locally continuous model to estimate the accumulated cost, but a discontinuous (discretized) model for the traveling cost around each grid point. Because the accumulated cost and the traveling (local) cost are treated differently, the estimate of the accumulated cost at any point will vary based on the direction of the arriving front. Instead we propose to estimate the traveling cost at each grid point based on a locally continuous model, where we will interpolate the traveling cost along the direction of the propagating front. We further choose an interpolation scheme that is not biased by the direction of the front. Thus making the fast marching process truly isotropic. We show the significance of removing the directional bias in the computation of the cost in certain applications of fast marching method. We also compare the accuracy and computation times of our proposed methods with the existing state of the art fast marching techniques to demonstrate the superiority of our method.

9. A reconstructed discontinuous Galerkin method for magnetohydrodynamics on arbitrary grids

Karami Halashi, Behrouz; Luo, Hong

2016-12-01

A reconstructed discontinuous Galerkin (rDG) method, designed not only to enhance the accuracy of DG methods but also to ensure the nonlinear stability of the rDG method, is developed for solving the Magnetohydrodynamics (MHD) equations on arbitrary grids. In this rDG(P1P2) method, a quadratic polynomial solution (P2) is first obtained using a Hermite Weighted Essentially Non-oscillatory (WENO) reconstruction from the underlying linear polynomial (P1) discontinuous Galerkin solution to ensure linear stability of the rDG method and to improves efficiency of the underlying DG method. By taking advantage of handily available and yet invaluable information, namely the first derivatives in the DG formulation, the stencils used in reconstruction involve only Von Neumann neighborhood (adjacent face-neighboring cells) and thus are compact. The first derivatives of the quadratic polynomial solution are then reconstructed using a WENO reconstruction in order to eliminate spurious oscillations in the vicinity of strong discontinuities, thus ensuring the nonlinear stability of the rDG method. The HLLD Riemann solver introduced in the literature for one-dimensional MHD problems is adopted in normal direction to compute numerical fluxes. The divergence free constraint is satisfied using the Locally Divergence Free (LDF) approach. The developed rDG method is used to compute a variety of 2D and 3D MHD problems on arbitrary grids to demonstrate its accuracy, robustness, and non-oscillatory property. Our numerical experiments indicate that the rDG(P1P2) method is able to capture shock waves sharply essentially without any spurious oscillations, and achieve the designed third-order of accuracy: one order accuracy higher than the underlying DG method.

10. Method and system for managing power grid data

DOEpatents

Yin, Jian; Akyol, Bora A.; Gorton, Ian

2015-11-10

A system and method of managing time-series data for smart grids is disclosed. Data is collected from a plurality of sensors. An index is modified for a newly created block. A one disk operation per read or write is performed. The one disk operation per read includes accessing and looking up the index to locate the data without movement of an arm of the disk, and obtaining the data. The one disk operation per write includes searching the disk for free space, calculating an offset, modifying the index, and writing the data contiguously into a block of the disk the index points to.

11. Fair Energy Scheduling for Vehicle-to-Grid Networks Using Adaptive Dynamic Programming.

PubMed

Xie, Shengli; Zhong, Weifeng; Xie, Kan; Yu, Rong; Zhang, Yan

2016-08-01

Research on the smart grid is being given enormous supports worldwide due to its great significance in solving environmental and energy crises. Electric vehicles (EVs), which are powered by clean energy, are adopted increasingly year by year. It is predictable that the huge charge load caused by high EV penetration will have a considerable impact on the reliability of the smart grid. Therefore, fair energy scheduling for EV charge and discharge is proposed in this paper. By using the vehicle-to-grid technology, the scheduler controls the electricity loads of EVs considering fairness in the residential distribution network. We propose contribution-based fairness, in which EVs with high contributions have high priorities to obtain charge energy. The contribution value is defined by both the charge/discharge energy and the timing of the action. EVs can achieve higher contribution values when discharging during the load peak hours. However, charging during this time will decrease the contribution values seriously. We formulate the fair energy scheduling problem as an infinite-horizon Markov decision process. The methodology of adaptive dynamic programming is employed to maximize the long-term fairness by processing online network training. The numerical results illustrate that the proposed EV energy scheduling is able to mitigate and flatten the peak load in the distribution network. Furthermore, contribution-based fairness achieves a fast recovery of EV batteries that have deeply discharged and guarantee fairness in the full charge time of all EVs.

12. On the applications of algebraic grid generation methods based on transfinite interpolation

NASA Technical Reports Server (NTRS)

Nguyen, Hung Lee

1989-01-01

Algebraic grid generation methods based on transfinite interpolation called the two-boundary and four-boundary methods are applied for generating grids with highly complex boundaries. These methods yield grid point distributions that allow for accurate application to regions of sharp gradients in the physical domain or time-dependent problems with small length scale phenomena. Algebraic grids are derived using the two-boundary and four-boundary methods for applications in both two- and three-dimensional domains. Grids are developed for distinctly different geometrical problems and the two-boundary and four-boundary methods are demonstrated to be applicable to a wide class of geometries.

13. Risky Group Decision-Making Method for Distribution Grid Planning

Li, Cunbin; Yuan, Jiahang; Qi, Zhiqiang

2015-12-01

With rapid speed on electricity using and increasing in renewable energy, more and more research pay attention on distribution grid planning. For the drawbacks of existing research, this paper proposes a new risky group decision-making method for distribution grid planning. Firstly, a mixing index system with qualitative and quantitative indices is built. On the basis of considering the fuzziness of language evaluation, choose cloud model to realize "quantitative to qualitative" transformation and construct interval numbers decision matrices according to the "3En" principle. An m-dimensional interval numbers decision vector is regarded as super cuboids in m-dimensional attributes space, using two-level orthogonal experiment to arrange points uniformly and dispersedly. The numbers of points are assured by testing numbers of two-level orthogonal arrays and these points compose of distribution points set to stand for decision-making project. In order to eliminate the influence of correlation among indices, Mahalanobis distance is used to calculate the distance from each solutions to others which means that dynamic solutions are viewed as the reference. Secondly, due to the decision-maker's attitude can affect the results, this paper defines the prospect value function based on SNR which is from Mahalanobis-Taguchi system and attains the comprehensive prospect value of each program as well as the order. At last, the validity and reliability of this method is illustrated by examples which prove the method is more valuable and superiority than the other.

Davis, B. N.; LeVeque, R. J.

2016-12-01

One difficulty in developing numerical methods for tsunami modeling is the fact that solutions contain time-varying regions where much higher resolution is required than elsewhere in the domain, particularly when tracking a tsunami propagating across the ocean. The open source GeoClaw software deals with this issue by using block-structured adaptive mesh refinement to selectively refine around propagating waves. For problems where only a target area of the total solution is of interest (e.g., one coastal community), a method that allows identifying and refining the grid only in regions that influence this target area would significantly reduce the computational cost of finding a solution. In this work, we show that solving the time-dependent adjoint equation and using a suitable inner product with the forward solution allows more precise refinement of the relevant waves. We present the adjoint methodology first in one space dimension for illustration and in a broad context since it could also be used in other adaptive software, and potentially for other tsunami applications beyond adaptive refinement. We then show how this adjoint method has been integrated into the adaptive mesh refinement strategy of the open source GeoClaw software and present tsunami modeling results showing that the accuracy of the solution is maintained and the computational time required is significantly reduced through the integration of the adjoint method into adaptive mesh refinement.

15. Parallel grid library with adaptive mesh refinement for development of highly scalable simulations

Honkonen, I.; von Alfthan, S.; Sandroos, A.; Janhunen, P.; Palmroth, M.

2012-04-01

As the single CPU core performance is saturating while the number of cores in the fastest supercomputers increases exponentially, the parallel performance of simulations on distributed memory machines is crucial. At the same time, utilizing efficiently the large number of available cores presents a challenge, especially in simulations with run-time adaptive mesh refinement. We have developed a generic grid library (dccrg) aimed at finite volume simulations that is easy to use and scales well up to tens of thousands of cores. The grid has several attractive features: It 1) allows an arbitrary C++ class or structure to be used as cell data; 2) provides a simple interface for adaptive mesh refinement during a simulation; 3) encapsulates the details of MPI communication when updating the data of neighboring cells between processes; and 4) provides a simple interface to run-time load balancing, e.g. domain decomposition, through the Zoltan library. Dccrg is freely available for anyone to use, study and modify under the GNU Lesser General Public License v3. We will present the implementation of dccrg, simple and advanced usage examples and scalability results on various supercomputers and problems.

16. GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

NASA Technical Reports Server (NTRS)

Shih, T. I.-P.; Bailey, R. T.; Nguyen, H. L.; Roelke, R. J.

1990-01-01

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no

17. An Adaptive Integration Model of Vector Polyline to DEM Data Based on Spherical Degeneration Quadtree Grids

Zhao, X. S.; Wang, J. J.; Yuan, Z. Y.; Gao, Y.

2013-10-01

Traditional geometry-based approach can maintain the characteristics of vector data. However, complex interpolation calculations limit its applications in high resolution and multi-source spatial data integration at spherical scale in digital earth systems. To overcome this deficiency, an adaptive integration model of vector polyline and spherical DEM is presented. Firstly, Degenerate Quadtree Grid (DQG) which is one of the partition models for global discrete grids, is selected as a basic framework for the adaptive integration model. Secondly, a novel shift algorithm is put forward based on DQG proximity search. The main idea of shift algorithm is that the vector node in a DQG cell moves to the cell corner-point when the displayed area of the cell is smaller or equal to a pixel of screen in order to find a new vector polyline approximate to the original one, which avoids lots of interpolation calculations and achieves seamless integration. Detailed operation steps are elaborated and the complexity of algorithm is analyzed. Thirdly, a prototype system has been developed by using VC++ language and OpenGL 3D API. ASTER GDEM data and DCW roads data sets of Jiangxi province in China are selected to evaluate the performance. The result shows that time consumption of shift algorithm decreased about 76% than that of geometry-based approach. Analysis on the mean shift error from different dimensions has been implemented. In the end, the conclusions and future works in the integration of vector data and DEM based on discrete global grids are also given.

18. Application of the multigrid approach for solving 3D Navier-Stokes equations on hexahedral grids using the discontinuous Galerkin method

Wolkov, A. V.

2010-03-01

The Galerkin method with discontinuous basis functions is adapted for solving the Euler and Navier-Stokes equations on unstructured hexahedral grids. A hybrid multigrid algorithm involving the finite element and grid stages is used as an iterative solution method. Numerical results of calculating the sphere inviscid flow, viscous flow in a bent pipe, and turbulent flow past a wing are presented. The numerical results and the computational cost are compared with those obtained using the finite volume method.

19. A sparse grid based method for generative dimensionality reduction of high-dimensional data

Bohn, Bastian; Garcke, Jochen; Griebel, Michael

2016-03-01

Generative dimensionality reduction methods play an important role in machine learning applications because they construct an explicit mapping from a low-dimensional space to the high-dimensional data space. We discuss a general framework to describe generative dimensionality reduction methods, where the main focus lies on a regularized principal manifold learning variant. Since most generative dimensionality reduction algorithms exploit the representer theorem for reproducing kernel Hilbert spaces, their computational costs grow at least quadratically in the number n of data. Instead, we introduce a grid-based discretization approach which automatically scales just linearly in n. To circumvent the curse of dimensionality of full tensor product grids, we use the concept of sparse grids. Furthermore, in real-world applications, some embedding directions are usually more important than others and it is reasonable to refine the underlying discretization space only in these directions. To this end, we employ a dimension-adaptive algorithm which is based on the ANOVA (analysis of variance) decomposition of a function. In particular, the reconstruction error is used to measure the quality of an embedding. As an application, the study of large simulation data from an engineering application in the automotive industry (car crash simulation) is performed.

20. Grid Convergence of High Order Methods for Multiscale Complex Unsteady Viscous Compressible Flows

NASA Technical Reports Server (NTRS)

Sjoegreen, B.; Yee, H. C.

2001-01-01

Grid convergence of several high order methods for the computation of rapidly developing complex unsteady viscous compressible flows with a wide range of physical scales is studied. The recently developed adaptive numerical dissipation control high order methods referred to as the ACM and wavelet filter schemes are compared with a fifth-order weighted ENO (WENO) scheme. The two 2-D compressible full Navier-Stokes models considered do not possess known analytical and experimental data. Fine grid solutions from a standard second-order TVD scheme and a MUSCL scheme with limiters are used as reference solutions. The first model is a 2-D viscous analogue of a shock tube problem which involves complex shock/shear/boundary-layer interactions. The second model is a supersonic reactive flow concerning fuel breakup. The fuel mixing involves circular hydrogen bubbles in air interacting with a planar moving shock wave. Both models contain fine scale structures and are stiff in the sense that even though the unsteadiness of the flows are rapidly developing, extreme grid refinement and time step restrictions are needed to resolve all the flow scales as well as the chemical reaction scales.

1. PDEs on moving surfaces via the closest point method and a modified grid based particle method

Petras, A.; Ruuth, S. J.

2016-05-01

Partial differential equations (PDEs) on surfaces arise in a wide range of applications. The closest point method (Ruuth and Merriman (2008) [20]) is a recent embedding method that has been used to solve a variety of PDEs on smooth surfaces using a closest point representation of the surface and standard Cartesian grid methods in the embedding space. The original closest point method (CPM) was designed for problems posed on static surfaces, however the solution of PDEs on moving surfaces is of considerable interest as well. Here we propose solving PDEs on moving surfaces using a combination of the CPM and a modification of the grid based particle method (Leung and Zhao (2009) [12]). The grid based particle method (GBPM) represents and tracks surfaces using meshless particles and an Eulerian reference grid. Our modification of the GBPM introduces a reconstruction step into the original method to ensure that all the grid points within a computational tube surrounding the surface are active. We present a number of examples to illustrate the numerical convergence properties of our combined method. Experiments for advection-diffusion equations that are strongly coupled to the velocity of the surface are also presented.

2. Application of multi-grid methods for solving the Navier-Stokes equations

Demuren, A. O.

This paper presents the application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems. The methods consists of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line- or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to those of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.

3. Application of multi-grid methods for solving the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Demuren, A. O.

1989-01-01

The application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems is discussed. The methods consist of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line-, or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to that of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.

4. Application of multi-grid methods for solving the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Demuren, A. O.

1989-01-01

This paper presents the application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems. The methods consists of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line- or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to those of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.

5. Numerical Analysis of Maneuvering Rotorcraft Using Moving Overlapped Grid Method

Yang, Choongmo; Aoyama, Takashi

In transient flight, rotor wakes and tip vortex generated by unsteady blade air-loads and blade motions are fully unsteady and 3-dimensionally-aperiodic, giving rise to significant complicity in accurate analysis compared to steady flight. We propose a hybrid approach by splitting the motions of a maneuvering helicopter into translation and rotation. Translation is simulated using a non-inertial moving (translating) coordinate for which new governing equations are derived, and rotations are simulated by moving each grid in the frame. A flow simulation (CFD) code is constructed by using the hybrid approach, then two simple cases (accelerating/decelerating flight and right-turn flight) for maneuvering helicopter are calculated using the moving overlapped grid method, which is now one of the most advanced techniques for tip-vortex capture. The vortex bundling phenomena, which is a main characteristic of right-turn flight, is well captured by the simulation code. The results of the present study provide better understanding of the characteristics for maneuvering rotorcraft, which can be valuable in full helicopter design.

6. Specialized CFD Grid Generation Methods for Near-Field Sonic Boom Prediction

NASA Technical Reports Server (NTRS)

Park, Michael A.; Campbell, Richard L.; Elmiligui, Alaa; Cliff, Susan E.; Nayani, Sudheer N.

2014-01-01

Ongoing interest in analysis and design of low sonic boom supersonic transports re- quires accurate and ecient Computational Fluid Dynamics (CFD) tools. Specialized grid generation techniques are employed to predict near- eld acoustic signatures of these con- gurations. A fundamental examination of grid properties is performed including grid alignment with ow characteristics and element type. The issues a ecting the robustness of cylindrical surface extrusion are illustrated. This study will compare three methods in the extrusion family of grid generation methods that produce grids aligned with the freestream Mach angle. These methods are applied to con gurations from the First AIAA Sonic Boom Prediction Workshop.

7. Complex Volume Grid Generation Through the Use of Grid Reusability

NASA Technical Reports Server (NTRS)

Alter, Stephen J.

1997-01-01

This paper presents a set of surface and volume grid generation techniques which reuse existing surface and volume grids. These methods use combinations of data manipulations to reduce grid generation time, improve grid characteristics, and increase the capabilities of existing domain discretization software. The manipulation techniques utilize physical and computational domains to produce basis function on which to operate and modify grid character and smooth grids using Trans-Finite Interpolation, a vector interpolation method and parametric re-mapping technique. With these new techniques, inviscid grids can be converted to viscous grids, multiple zone grid adaption can be performed to improve CFD solver efficiency, and topological changes to improve modeling of flow fields can be done simply and quickly. Examples of these capabilities are illustrated as applied to various configurations.

8. A solution-adaptive mesh algorithm for dynamic/static refinement of two and three dimensional grids

NASA Technical Reports Server (NTRS)

Benson, Rusty A.; Mcrae, D. S.

1991-01-01

An adaptive grid algorithm has been developed in two and three dimensions that can be used dynamically with a solver or as part of a grid refinement process. The algorithm employs a transformation from the Cartesian coordinate system to a general coordinate space, which is defined as a parallelepiped in three dimensions. A weighting function, independent for each coordinate direction, is developed that will provide the desired refinement criteria in regions of high solution gradient. The adaptation is performed in the general coordinate space and the new grid locations are returned to the Cartesian space via a simple, one-step inverse mapping. The algorithm for relocation of the mesh points in the parametric space is based on the center of mass for distributed weights. Dynamic solution-adaptive results are presented for laminar flows in two and three dimensions.

9. The block adaptive multigrid method applied to the solution of the Euler equations

NASA Technical Reports Server (NTRS)

Pantelelis, Nikos

1993-01-01

In the present study, a scheme capable of solving very fast and robust complex nonlinear systems of equations is presented. The Block Adaptive Multigrid (BAM) solution method offers multigrid acceleration and adaptive grid refinement based on the prediction of the solution error. The proposed solution method was used with an implicit upwind Euler solver for the solution of complex transonic flows around airfoils. Very fast results were obtained (18-fold acceleration of the solution) using one fourth of the volumes of a global grid with the same solution accuracy for two test cases.

10. Investigation of advancing front method for generating unstructured grid

Thomas, A. M.; Tiwari, S. N.

1992-06-01

The advancing front technique is used to generate an unstructured grid about simple aerodynamic geometries. Unstructured grids are generated using VGRID2D and VGRID3D software. Specific problems considered are a NACA 0012 airfoil, a bi-plane consisting of two NACA 0012 airfoil, a four element airfoil in its landing configuration, and an ONERA M6 wing. Inviscid time dependent solutions are computed on these geometries using USM3D and the results are compared with standard test results obtained by other investigators. A grid convergence study is conducted for the NACA 0012 airfoil and compared with a structured grid. A structured grid is generated using GRIDGEN software and inviscid solutions computed using CFL3D flow solver. The results obtained by unstructured grid for NACA 0012 airfoil showed an asymmetric distribution of flow quantities, and a fine distribution of grid was required to remove this asymmetry. On the other hand, the structured grid predicted a very symmetric distribution, but when the total number of points were compared to obtain the same results it was seen that structured grid required more grid points.

11. Investigation of advancing front method for generating unstructured grid

NASA Technical Reports Server (NTRS)

Thomas, A. M.; Tiwari, S. N.

1992-01-01

The advancing front technique is used to generate an unstructured grid about simple aerodynamic geometries. Unstructured grids are generated using VGRID2D and VGRID3D software. Specific problems considered are a NACA 0012 airfoil, a bi-plane consisting of two NACA 0012 airfoil, a four element airfoil in its landing configuration, and an ONERA M6 wing. Inviscid time dependent solutions are computed on these geometries using USM3D and the results are compared with standard test results obtained by other investigators. A grid convergence study is conducted for the NACA 0012 airfoil and compared with a structured grid. A structured grid is generated using GRIDGEN software and inviscid solutions computed using CFL3D flow solver. The results obtained by unstructured grid for NACA 0012 airfoil showed an asymmetric distribution of flow quantities, and a fine distribution of grid was required to remove this asymmetry. On the other hand, the structured grid predicted a very symmetric distribution, but when the total number of points were compared to obtain the same results it was seen that structured grid required more grid points.

12. Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

NASA Technical Reports Server (NTRS)

Liu, Yen; Vinokur, Marcel

2004-01-01

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of

13. A new orientation-adaptive interpolation method.

PubMed

Wang, Qing; Ward, Rabab Kreidieh

2007-04-01

We propose an isophote-oriented, orientation-adaptive interpolation method. The proposed method employs an interpolation kernel that adapts to the local orientation of isophotes, and the pixel values are obtained through an oriented, bilinear interpolation. We show that, by doing so, the curvature of the interpolated isophotes is reduced, and, thus, zigzagging artifacts are largely suppressed. Analysis and experiments show that images interpolated using the proposed method are visually pleasing and almost artifact free.

14. The Method of Adaptive Comparative Judgement

ERIC Educational Resources Information Center

Pollitt, Alastair

2012-01-01

Adaptive Comparative Judgement (ACJ) is a modification of Thurstone's method of comparative judgement that exploits the power of adaptivity, but in scoring rather than testing. Professional judgement by teachers replaces the marking of tests; a judge is asked to compare the work of two students and simply to decide which of them is the better.…

15. TranAir: A full-potential, solution-adaptive, rectangular grid code for predicting subsonic, transonic, and supersonic flows about arbitrary configurations. Theory document

NASA Technical Reports Server (NTRS)

Johnson, F. T.; Samant, S. S.; Bieterman, M. B.; Melvin, R. G.; Young, D. P.; Bussoletti, J. E.; Hilmes, C. L.

1992-01-01

A new computer program, called TranAir, for analyzing complex configurations in transonic flow (with subsonic or supersonic freestream) was developed. This program provides accurate and efficient simulations of nonlinear aerodynamic flows about arbitrary geometries with the ease and flexibility of a typical panel method program. The numerical method implemented in TranAir is described. The method solves the full potential equation subject to a set of general boundary conditions and can handle regions with differing total pressure and temperature. The boundary value problem is discretized using the finite element method on a locally refined rectangular grid. The grid is automatically constructed by the code and is superimposed on the boundary described by networks of panels; thus no surface fitted grid generation is required. The nonlinear discrete system arising from the finite element method is solved using a preconditioned Krylov subspace method embedded in an inexact Newton method. The solution is obtained on a sequence of successively refined grids which are either constructed adaptively based on estimated solution errors or are predetermined based on user inputs. Many results obtained by using TranAir to analyze aerodynamic configurations are presented.

16. An Adaptive Reputation-Based Algorithm for Grid Virtual Organization Formation

Cui, Yongrui; Li, Mingchu; Ren, Yizhi; Sakurai, Kouichi

A novel adaptive reputation-based virtual organization formation is proposed. It restrains the bad performers effectively based on the consideration of the global experience of the evaluator and evaluates the direct trust relation between two grid nodes accurately by consulting the previous trust value rationally. It also consults and improves the reputation evaluation process in PathTrust model by taking account of the inter-organizational trust relationship and combines it with direct and recommended trust in a weighted way, which makes the algorithm more robust against collusion attacks. Additionally, the proposed algorithm considers the perspective of the VO creator and takes required VO services as one of the most important fine-grained evaluation criterion, which makes the algorithm more suitable for constructing VOs in grid environments that include autonomous organizations. Simulation results show that our algorithm restrains the bad performers and resists against fake transaction attacks and badmouth attacks effectively. It provides a clear advantage in the design of a VO infrastructure.

17. A Parallel Adaptive Wavelet Method for the Simulation of Compressible Reacting Flows

Zikoski, Zachary; Paolucci, Samuel

2011-11-01

The Wavelet Adaptive Multiresolution Representation (WAMR) method provides a robust method for controlling spatial grid adaption--fine grid spacing in regions of a solution requiring high resolution (i.e. near steep gradients, singularities, or near- singularities) and using much coarser grid spacing where the solution is slowly varying. The sparse grids produced using the WAMR method exhibit very high compression ratios compared to uniform grids of equivalent resolution. Subsequently, a wide range of spatial scales often occurring in continuum physics models can be captured efficiently. Furthermore, the wavelet transform provides a direct measure of local error at each grid point, effectively producing automatically verified solutions. The algorithm is parallelized using an MPI-based domain decomposition approach suitable for a wide range of distributed-memory parallel architectures. The method is applied to the solution of the compressible, reactive Navier-Stokes equations and includes multi-component diffusive transport and chemical kinetics models. Results for the method's parallel performance are reported, and its effectiveness on several challenging compressible reacting flow problems is highlighted.

18. Advanced Overset Grid Methods For Massively Parallel Rotary Wing Computations

DTIC Science & Technology

2014-08-18

in 2- D for cell-centered unstructured grid show feasibility of this approach and improvements in predictions when compared with conventional... D for cell-centered unstructured grid show feasibility of this approach and improvements in predictions when compared with conventional overset...Proceeding publications (other than abstracts): ( d ) Manuscripts Received Paper TOTAL: Received Paper TOTAL: Received Paper TOTAL: Received Book TOTAL

19. Adaptive computational methods for aerothermal heating analysis

NASA Technical Reports Server (NTRS)

Price, John M.; Oden, J. Tinsley

1988-01-01

The development of adaptive gridding techniques for finite-element analysis of fluid dynamics equations is described. The developmental work was done with the Euler equations with concentration on shock and inviscid flow field capturing. Ultimately this methodology is to be applied to a viscous analysis for the purpose of predicting accurate aerothermal loads on complex shapes subjected to high speed flow environments. The development of local error estimate strategies as a basis for refinement strategies is discussed, as well as the refinement strategies themselves. The application of the strategies to triangular elements and a finite-element flux-corrected-transport numerical scheme are presented. The implementation of these strategies in the GIM/PAGE code for 2-D and 3-D applications is documented and demonstrated.

20. QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

PubMed

Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

2016-02-01

As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

NASA Technical Reports Server (NTRS)

Gombosi, Tamas I.; Powell, Kenneth G.; De Zeeuw, Darren L.

1994-01-01

The first results of an axisymmetric magnetohydrodynamic (MHD) model of the interaction of an expanding cometary atmosphere with the solar wind are presented. The model assumes that far upstream the plasma flow lines are parallel to the magnetic field vector. The effects of mass loading and ion-neutral friction are taken into account by the governing equations, whcih are solved on an adaptively refined unstructured grid using a Monotone Upstream Centered Schemes for Conservative Laws (MUSCL)-type numerical technique. The combination of the adaptive refinement with the MUSCL-scheme allows the entire cometary atmosphere to be modeled, while still resolving both the shock and the near nucleus of the comet. The main findingsare the following: (1) A shock is formed approximately = 0.45 Mkm upstream of the comet (its location is controlled by the sonic and Alfvenic Mach numbers of the ambient solar wind flow and by the cometary mass addition rate). (2) A contact surface is formed approximately = 5,600 km upstream of the nucleus separating an outward expanding cometary ionosphere from the nearly stagnating solar wind flow. The location of the contact surface is controlled by the upstream flow conditions, the mass loading rate and the ion-neutral drag. The contact surface is also the boundary of the diamagnetic cavity. (3) A closed inner shock terminates the supersonic expansion of the cometary ionosphere. This inner shock is closer to the nucleus on dayside than on the nightside.

2. Machine Learning Methods for Attack Detection in the Smart Grid.

PubMed

Ozay, Mete; Esnaola, Inaki; Yarman Vural, Fatos Tunay; Kulkarni, Sanjeev R; Poor, H Vincent

2016-08-01

Attack detection problems in the smart grid are posed as statistical learning problems for different attack scenarios in which the measurements are observed in batch or online settings. In this approach, machine learning algorithms are used to classify measurements as being either secure or attacked. An attack detection framework is provided to exploit any available prior knowledge about the system and surmount constraints arising from the sparse structure of the problem in the proposed approach. Well-known batch and online learning algorithms (supervised and semisupervised) are employed with decision- and feature-level fusion to model the attack detection problem. The relationships between statistical and geometric properties of attack vectors employed in the attack scenarios and learning algorithms are analyzed to detect unobservable attacks using statistical learning methods. The proposed algorithms are examined on various IEEE test systems. Experimental analyses show that machine learning algorithms can detect attacks with performances higher than attack detection algorithms that employ state vector estimation methods in the proposed attack detection framework.

3. Method for the depth corrected detection of ionizing events from a co-planar grids sensor

DOEpatents

De Geronimo, Gianluigi; Bolotnikov, Aleksey E.; Carini, Gabriella

2009-05-12

A method for the detection of ionizing events utilizing a co-planar grids sensor comprising a semiconductor substrate, cathode electrode, collecting grid and non-collecting grid. The semiconductor substrate is sensitive to ionizing radiation. A voltage less than 0 Volts is applied to the cathode electrode. A voltage greater than the voltage applied to the cathode is applied to the non-collecting grid. A voltage greater than the voltage applied to the non-collecting grid is applied to the collecting grid. The collecting grid and the non-collecting grid are summed and subtracted creating a sum and difference respectively. The difference and sum are divided creating a ratio. A gain coefficient factor for each depth (distance between the ionizing event and the collecting grid) is determined, whereby the difference between the collecting electrode and the non-collecting electrode multiplied by the corresponding gain coefficient is the depth corrected energy of an ionizing event. Therefore, the energy of each ionizing event is the difference between the collecting grid and the non-collecting grid multiplied by the corresponding gain coefficient. The depth of the ionizing event can also be determined from the ratio.

4. A High-Resolution Godunov Method for Compressible Multi-Material Flow on Overlapping Grids

SciTech Connect

Banks, J W; Schwendeman, D W; Kapila, A K; Henshaw, W D

2006-02-13

A numerical method is described for inviscid, compressible, multi-material flow in two space dimensions. The flow is governed by the multi-material Euler equations with a general mixture equation of state. Composite overlapping grids are used to handle complex flow geometry and block-structured adaptive mesh refinement (AMR) is used to locally increase grid resolution near shocks and material interfaces. The discretization of the governing equations is based on a high-resolution Godunov method, but includes an energy correction designed to suppress numerical errors that develop near a material interface for standard, conservative shock-capturing schemes. The energy correction is constructed based on a uniform pressure-velocity flow and is significant only near the captured interface. A variety of two-material flows are presented to verify the accuracy of the numerical approach and to illustrate its use. These flows assume an equation of state for the mixture based on Jones-Wilkins-Lee (JWL) forms for the components. This equation of state includes a mixture of ideal gases as a special case. Flow problems considered include unsteady one-dimensional shock-interface collision, steady interaction of an planar interface and an oblique shock, planar shock interaction with a collection of gas-filled cylindrical inhomogeneities, and the impulsive motion of the two-component mixture in a rigid cylindrical vessel.

5. Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

NASA Technical Reports Server (NTRS)

Golik, W. L.

1996-01-01

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

6. Divergence preserving discrete surface integral methods for Maxwell's curl equations using non-orthogonal unstructured grids

NASA Technical Reports Server (NTRS)

1992-01-01

Several new discrete surface integral (DSI) methods for solving Maxwell's equations in the time-domain are presented. These methods, which allow the use of general nonorthogonal mixed-polyhedral unstructured grids, are direct generalizations of the canonical staggered-grid finite difference method. These methods are conservative in that they locally preserve divergence or charge. Employing mixed polyhedral cells, (hexahedral, tetrahedral, etc.) these methods allow more accurate modeling of non-rectangular structures and objects because the traditional stair-stepped boundary approximations associated with the orthogonal grid based finite difference methods can be avoided. Numerical results demonstrating the accuracy of these new methods are presented.

7. Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids

Langer, Stefan

2014-11-01

For unstructured finite volume methods an agglomeration multigrid with an implicit multistage Runge-Kutta method as a smoother is developed for solving the compressible Reynolds averaged Navier-Stokes (RANS) equations. The implicit Runge-Kutta method is interpreted as a preconditioned explicit Runge-Kutta method. The construction of the preconditioner is based on an approximate derivative. The linear systems are solved approximately with a symmetric Gauss-Seidel method. To significantly improve this solution method grid anisotropy is treated within the Gauss-Seidel iteration in such a way that the strong couplings in the linear system are resolved by tridiagonal systems constructed along these directions of strong coupling. The agglomeration strategy is adapted to this procedure by taking into account exactly these anisotropies in such a way that a directional coarsening is applied along these directions of strong coupling. Turbulence effects are included by a Spalart-Allmaras model, and the additional transport-type equation is approximately solved in a loosely coupled manner with the same method. For two-dimensional and three-dimensional numerical examples and a variety of differently generated meshes we show the wide range of applicability of the solution method. Finally, we exploit the GMRES method to determine approximate spectral information of the linearized RANS equations. This approximate spectral information is used to discuss and compare characteristics of multistage Runge-Kutta methods.

8. A software package using a mesh-grid method for simulating HPGe detector efficiencies

SciTech Connect

Gritzo, Russell E; Jackman, Kevin R; Biegalski, Steven R

2009-01-01

Traditional ways of determining the absolute full-energy peak efficiencies of high-purity germanium (HPGe) detectors are often time consuming, cost prohibitive, or not feasible. A software package, KMESS (Kevin's Mesh Efficiency Simulator Software), was developed to assist in predicting these efficiencies. It uses a semiempirical mesh-grid method and works for arbitrary source shapes and counting geometries. The model assumes that any gamma-ray source shape can be treated as a large enough collection of point sources. The code is readily adaptable, has a web-based graphical front-end. and could easily be coupled to a 3D scanner. As will be shown. this software can estimate absolute full-energy peak efficiencies with good accuracy in reasonable computation times. It has applications to the field of gamma-ray spectroscopy because it is a quick and accurate way to assist in performing quantitative analyses using HPGe detectors.

9. A Software Package Using a Mesh-grid Method for Simulating HPGe Detector Efficiencies

SciTech Connect

Kevin Jackman

2009-10-01

Traditional ways of determining the absolute full-energy peak efficiencies of high-purity germanium (HPGe) detectors are often time consuming, cost prohibitive, or not feasible. A software package, KMESS (Kevin’s Mesh Efficiency Simulator Software), was developed to assist in predicting these efficiencies. It uses a semiempirical mesh-grid method and works for arbitrary source shapes and counting geometries. The model assumes that any gamma-ray source shape can be treated as a large enough collection of point sources. The code is readily adaptable, has a web-based graphical front-end, and could easily be coupled to a 3D scanner. As will be shown, this software can estimate absolute full-energy peak efficiencies with good accuracy in reasonable computation times. It has applications to the field of gamma-ray spectroscopy because it is a quick and accurate way to assist in performing quantitative analyses using HPGe detectors.

10. Fast multipole and space adaptive multiresolution methods for the solution of the Poisson equation

Bilek, Petr; Duarte, Max; Nečas, David; Bourdon, Anne; Bonaventura, Zdeněk

2016-09-01

This work focuses on the conjunction of the fast multipole method (FMM) with the space adaptive multiresolution (MR) technique for grid adaptation. Since both methods, MR and FMM provide a priori error estimates, both achieve O(N) computational complexity, and both operate on the same hierarchical space division, their conjunction represents a natural choice when designing a numerically efficient and robust strategy for time dependent problems. Special attention is given to the use of these methods in the simulation of streamer discharges in air. We have designed a FMM Poisson solver on multiresolution adapted grid in 2D. The accuracy and the computation complexity of the solver has been verified for a set of manufactured solutions. We confirmed that the developed solver attains desired accuracy and this accuracy is controlled only by the number of terms in the multipole expansion in combination with the multiresolution accuracy tolerance. The implementation has a linear computation complexity O(N).

11. Validation of elastic registration algorithms based on adaptive irregular grids for medical applications

Franz, Astrid; Carlsen, Ingwer C.; Renisch, Steffen; Wischmann, Hans-Aloys

2006-03-01

Elastic registration of medical images is an active field of current research. Registration algorithms have to be validated in order to show that they fulfill the requirements of a particular clinical application. Furthermore, validation strategies compare the performance of different registration algorithms and can hence judge which algorithm is best suited for a target application. In the literature, validation strategies for rigid registration algorithms have been analyzed. For a known ground truth they assess the displacement error at a few landmarks, which is not sufficient for elastic transformations described by a huge number of parameters. Hence we consider the displacement error averaged over all pixels in the whole image or in a region-of-interest of clinical relevance. Using artificially, but realistically deformed images of the application domain, we use this quality measure to analyze an elastic registration based on transformations defined on adaptive irregular grids for the following clinical applications: Magnetic Resonance (MR) images of freely moving joints for orthopedic investigations, thoracic Computed Tomography (CT) images for the detection of pulmonary embolisms, and transmission images as used for the attenuation correction and registration of independently acquired Positron Emission Tomography (PET) and CT images. The definition of a region-of-interest allows to restrict the analysis of the registration accuracy to clinically relevant image areas. The behaviour of the displacement error as a function of the number of transformation control points and their placement can be used for identifying the best strategy for the initial placement of the control points.

12. Adaptive control paradigm for photovoltaic and solid oxide fuel cell in a grid-integrated hybrid renewable energy system

PubMed Central

Khan, Laiq

2017-01-01

The hybrid power system (HPS) is an emerging power generation scheme due to the plentiful availability of renewable energy sources. Renewable energy sources are characterized as highly intermittent in nature due to meteorological conditions, while the domestic load also behaves in a quite uncertain manner. In this scenario, to maintain the balance between generation and load, the development of an intelligent and adaptive control algorithm has preoccupied power engineers and researchers. This paper proposes a Hermite wavelet embedded NeuroFuzzy indirect adaptive MPPT (maximum power point tracking) control of photovoltaic (PV) systems to extract maximum power and a Hermite wavelet incorporated NeuroFuzzy indirect adaptive control of Solid Oxide Fuel Cells (SOFC) to obtain a swift response in a grid-connected hybrid power system. A comprehensive simulation testbed for a grid-connected hybrid power system (wind turbine, PV cells, SOFC, electrolyzer, battery storage system, supercapacitor (SC), micro-turbine (MT) and domestic load) is developed in Matlab/Simulink. The robustness and superiority of the proposed indirect adaptive control paradigm are evaluated through simulation results in a grid-connected hybrid power system testbed by comparison with a conventional PI (proportional and integral) control system. The simulation results verify the effectiveness of the proposed control paradigm. PMID:28329015

13. Adaptive control paradigm for photovoltaic and solid oxide fuel cell in a grid-integrated hybrid renewable energy system.

PubMed

Mumtaz, Sidra; Khan, Laiq

2017-01-01

The hybrid power system (HPS) is an emerging power generation scheme due to the plentiful availability of renewable energy sources. Renewable energy sources are characterized as highly intermittent in nature due to meteorological conditions, while the domestic load also behaves in a quite uncertain manner. In this scenario, to maintain the balance between generation and load, the development of an intelligent and adaptive control algorithm has preoccupied power engineers and researchers. This paper proposes a Hermite wavelet embedded NeuroFuzzy indirect adaptive MPPT (maximum power point tracking) control of photovoltaic (PV) systems to extract maximum power and a Hermite wavelet incorporated NeuroFuzzy indirect adaptive control of Solid Oxide Fuel Cells (SOFC) to obtain a swift response in a grid-connected hybrid power system. A comprehensive simulation testbed for a grid-connected hybrid power system (wind turbine, PV cells, SOFC, electrolyzer, battery storage system, supercapacitor (SC), micro-turbine (MT) and domestic load) is developed in Matlab/Simulink. The robustness and superiority of the proposed indirect adaptive control paradigm are evaluated through simulation results in a grid-connected hybrid power system testbed by comparison with a conventional PI (proportional and integral) control system. The simulation results verify the effectiveness of the proposed control paradigm.

14. Domain Decomposition By the Advancing-Partition Method for Parallel Unstructured Grid Generation

NASA Technical Reports Server (NTRS)

2009-01-01

A new method of domain decomposition has been developed for generating unstructured grids in subdomains either sequentially or using multiple computers in parallel. Domain decomposition is a crucial and challenging step for parallel grid generation. Prior methods are generally based on auxiliary, complex, and computationally intensive operations for defining partition interfaces and usually produce grids of lower quality than those generated in single domains. The new technique, referred to as "Advancing Partition," is based on the Advancing-Front method, which partitions a domain as part of the volume mesh generation in a consistent and "natural" way. The benefits of this approach are: 1) the process of domain decomposition is highly automated, 2) partitioning of domain does not compromise the quality of the generated grids, and 3) the computational overhead for domain decomposition is minimal. The new method has been implemented in NASA's unstructured grid generation code VGRID.

15. Domain decomposition by the advancing-partition method for parallel unstructured grid generation

NASA Technical Reports Server (NTRS)

Pirzadeh, Shahyar Z. (Inventor); Banihashemi, legal representative, Soheila (Inventor)

2012-01-01

In a method for domain decomposition for generating unstructured grids, a surface mesh is generated for a spatial domain. A location of a partition plane dividing the domain into two sections is determined. Triangular faces on the surface mesh that intersect the partition plane are identified. A partition grid of tetrahedral cells, dividing the domain into two sub-domains, is generated using a marching process in which a front comprises only faces of new cells which intersect the partition plane. The partition grid is generated until no active faces remain on the front. Triangular faces on each side of the partition plane are collected into two separate subsets. Each subset of triangular faces is renumbered locally and a local/global mapping is created for each sub-domain. A volume grid is generated for each sub-domain. The partition grid and volume grids are then merged using the local-global mapping.

16. A unidirectional approach for d-dimensional finite element methods for higher order on sparse grids

SciTech Connect

Bungartz, H.J.

1996-12-31

In the last years, sparse grids have turned out to be a very interesting approach for the efficient iterative numerical solution of elliptic boundary value problems. In comparison to standard (full grid) discretization schemes, the number of grid points can be reduced significantly from O(N{sup d}) to O(N(log{sub 2}(N)){sup d-1}) in the d-dimensional case, whereas the accuracy of the approximation to the finite element solution is only slightly deteriorated: For piecewise d-linear basis functions, e. g., an accuracy of the order O(N{sup - 2}(log{sub 2}(N)){sup d-1}) with respect to the L{sub 2}-norm and of the order O(N{sup -1}) with respect to the energy norm has been shown. Furthermore, regular sparse grids can be extended in a very simple and natural manner to adaptive ones, which makes the hierarchical sparse grid concept applicable to problems that require adaptive grid refinement, too. An approach is presented for the Laplacian on a uinit domain in this paper.

17. Optimal grids for generalized finite basis and discrete variable representations: definition and method of calculation.

PubMed

Szalay, Viktor

2006-10-21

The method of optimal generalized finite basis and discrete variable representations (FBR and DVR) generalizes the standard, Gaussian quadrature grid-classical orthonormal polynomial basis-based FBR/DVR method to general sets of grid points and to general, nondirect product, and/or nonpolynomial bases. Here, it is shown how an optimal set of grid points can be obtained for an optimal generalized FBR/DVR calculation with a given truncated basis. Basis set optimized and potential optimized grids are defined. The optimized grids are shown to minimize a function of grid points derived by relating the optimal generalized FBR of a Hamiltonian operator to a non-Hermitian effective Hamiltonian matrix. Locating the global minimum of this function can be reduced to finding the zeros of a function in the case of one dimensional problems and to solving a system of D nonlinear equations repeatedly in the case of D>1 dimensional problems when there is an equal number of grid points and basis functions. Gaussian quadrature grids are shown to be basis optimized grids. It is demonstrated by a numerical example that an optimal generalized FBR/DVR calculation of the eigenvalues of a Hamiltonian operator with potential optimized grids can have orders of magnitude higher accuracy than a variational calculation employing the same truncated basis. Nevertheless, for numerical integration with the optimal generalized FBR quadrature rule basis optimized grids are the best among grids of the same number of points. The notions of Gaussian quadrature and Gaussian quadrature accuracy are extended to general, multivariable basis functions.

18. Euler Technology Assessment program for preliminary aircraft design employing SPLITFLOW code with Cartesian unstructured grid method

NASA Technical Reports Server (NTRS)

Finley, Dennis B.

1995-01-01

This report documents results from the Euler Technology Assessment program. The objective was to evaluate the efficacy of Euler computational fluid dynamics (CFD) codes for use in preliminary aircraft design. Both the accuracy of the predictions and the rapidity of calculations were to be assessed. This portion of the study was conducted by Lockheed Fort Worth Company, using a recently developed in-house Cartesian-grid code called SPLITFLOW. The Cartesian grid technique offers several advantages for this study, including ease of volume grid generation and reduced number of cells compared to other grid schemes. SPLITFLOW also includes grid adaptation of the volume grid during the solution convergence to resolve high-gradient flow regions. This proved beneficial in resolving the large vortical structures in the flow for several configurations examined in the present study. The SPLITFLOW code predictions of the configuration forces and moments are shown to be adequate for preliminary design analysis, including predictions of sideslip effects and the effects of geometry variations at low and high angles of attack. The time required to generate the results from initial surface definition is on the order of several hours, including grid generation, which is compatible with the needs of the design environment.

19. FLIP: A method for adaptively zoned, particle-in-cell calculations of fluid in two dimensions

SciTech Connect

Brackbill, J.U.; Ruppel, H.M.

1986-08-01

A method is presented for calculating fluid flow in two dimensions using a full particle-in-cell representation on an adaptively zoned grid. The method has many interesting properties, among them an almost total absence of numerical dissipation and the ability to represent large variations in the data. The method is described using a standard formalism and its properties are illustrated by supersonic flow over a step and the interaction of a shock with a thin foil.

20. A finite volume method for solving the Navier-Stokes equations on composite overlapping grids

SciTech Connect

Brown, D.L.

1990-01-01

The simulation of compressible fluid flows describing engineering applications using finite difference or finite volume methods is complicated by both the difficulty in representing complex geometries using rectangular grids and by the memory size and speed of modern supercomputers. The composite overlapping grid approach can be used to represent complicated geometries using a set of logically rectangular grids, thus allowing the use of finite difference or finite volume methods to approximate the partial differential equations. This approach can also be used to accomplish local mesh refinement for the purpose of resolving locally detailed behavior in the flow fields. This paper discusses the composite overlapping grid method, in particular presenting the modifications necessary to the standard finite volume approach in order to use these grids. Computed examples from compressible hypersonic flow are present as well. 15 refs., 4 figs.

1. An algebraic homotopy method for generating quasi-three-dimensional grids for high-speed configurations

NASA Technical Reports Server (NTRS)

Moitra, Anutosh

1989-01-01

A fast and versatile procedure for algebraically generating boundary conforming computational grids for use with finite-volume Euler flow solvers is presented. A semi-analytic homotopic procedure is used to generate the grids. Grids generated in two-dimensional planes are stacked to produce quasi-three-dimensional grid systems. The body surface and outer boundary are described in terms of surface parameters. An interpolation scheme is used to blend between the body surface and the outer boundary in order to determine the field points. The method, albeit developed for analytically generated body geometries is equally applicable to other classes of geometries. The method can be used for both internal and external flow configurations, the only constraint being that the body geometries be specified in two-dimensional cross-sections stationed along the longitudinal axis of the configuration. Techniques for controlling various grid parameters, e.g., clustering and orthogonality are described. Techniques for treating problems arising in algebraic grid generation for geometries with sharp corners are addressed. A set of representative grid systems generated by this method is included. Results of flow computations using these grids are presented for validation of the effectiveness of the method.

2. Method and apparatus for detecting cyber attacks on an alternating current power grid

DOEpatents

McEachern, Alexander; Hofmann, Ronald

2017-04-11

A method and apparatus for detecting cyber attacks on remotely-operable elements of an alternating current distribution grid. Two state estimates of the distribution grid are prepared, one of which uses micro-synchrophasors. A difference between the two state estimates indicates a possible cyber attack.

3. Action Research to Improve Methods of Delivery and Feedback in an Access Grid Room Environment

ERIC Educational Resources Information Center

McArthur, Lynne C.; Klass, Lara; Eberhard, Andrew; Stacey, Andrew

2011-01-01

This article describes a qualitative study which was undertaken to improve the delivery methods and feedback opportunity in honours mathematics lectures which are delivered through Access Grid Rooms. Access Grid Rooms are facilities that provide two-way video and audio interactivity across multiple sites, with the inclusion of smart boards. The…

4. Qualitative Life-Grids: A Proposed Method for Comparative European Educational Research

ERIC Educational Resources Information Center

Abbas, Andrea; Ashwin, Paul; McLean, Monica

2013-01-01

Drawing upon their large three-year mixed-method study comparing four English university sociology departments, the authors demonstrate the benefits to be gained from concisely recording biographical stories on life-grids. They argue that life-grids have key benefits which are important for comparative European educational research. Some of these…

5. Domain adaptive boosting method and its applications

Geng, Jie; Miao, Zhenjiang

2015-03-01

Differences of data distributions widely exist among datasets, i.e., domains. For many pattern recognition, nature language processing, and content-based analysis systems, a decrease in performance caused by the domain differences between the training and testing datasets is still a notable problem. We propose a domain adaptation method called domain adaptive boosting (DAB). It is based on the AdaBoost approach with extensions to cover the domain differences between the source and target domains. Two main stages are contained in this approach: source-domain clustering and source-domain sample selection. By iteratively adding the selected training samples from the source domain, the discrimination model is able to achieve better domain adaptation performance based on a small validation set. The DAB algorithm is suitable for the domains with large scale samples and easy to extend for multisource adaptation. We implement this method on three computer vision systems: the skin detection model in single images, the video concept detection model, and the object classification model. In the experiments, we compare the performances of several commonly used methods and the proposed DAB. Under most situations, the DAB is superior.

6. An equatorially enhanced grid with smooth resolution distribution generated by a spring dynamics method

Iga, Shin-ichi

2017-02-01

An equatorially enhanced grid is applicable to atmospheric general circulation simulations with better representations of the cumulus convection active in the tropics. This study improved the topology of previously proposed equatorially enhanced grids (Iga, 2015) [1], which had extremely large grid intervals around the poles. The proposed grids in this study are of a triangular mesh and are generated by a spring dynamics method with stretching around singular points, which are connected to five or seven neighboring grid points. The latitudinal distribution of resolution is nearly proportional to the combination of the map factors of the Mercator, Lambert conformal conic, and polar stereographic projections. The resolution contrast between the equator and pole is 2.3 ∼ 4.5 for the sampled cases, which is much smaller than that for the LML grids. This improvement requires only a small amount of additional grid resources, less than 11% of the total. The proposed grids are also examined with shallow water tests, and were found to perform better than the previous LML grids.

7. Smart electric vehicle (EV) charging and grid integration apparatus and methods

DOEpatents

Gadh, Rajit; Mal, Siddhartha; Prabhu, Shivanand; Chu, Chi-Cheng; Sheikh, Omar; Chung, Ching-Yen; He, Lei; Xiao, Bingjun; Shi, Yiyu

2015-05-05

An expert system manages a power grid wherein charging stations are connected to the power grid, with electric vehicles connected to the charging stations, whereby the expert system selectively backfills power from connected electric vehicles to the power grid through a grid tie inverter (if present) within the charging stations. In more traditional usage, the expert system allows for electric vehicle charging, coupled with user preferences as to charge time, charge cost, and charging station capabilities, without exceeding the power grid capacity at any point. A robust yet accurate state of charge (SOC) calculation method is also presented, whereby initially an open circuit voltage (OCV) based on sampled battery voltages and currents is calculated, and then the SOC is obtained based on a mapping between a previously measured reference OCV (ROCV) and SOC. The OCV-SOC calculation method accommodates likely any battery type with any current profile.

8. An operational power management method for the grid containing renewable power systems utilizing short-term weather and load forecasting data

Aula, Fadhil T.; Lee, Samuel C.

2013-04-01

This paper addresses the problems associated with power management of the grid containing renewable power systems and proposes a method for enhancing its operational power management. Since renewable energy provides uncertain and uncontrollable energy resources, the renewable power systems can only generate irregular power. This power irregularity creates problems affecting the grid power management process and influencing the parallel operations of conventional power plants on the grid. To demonstrate this power management method for this type of grid, weatherdependent wind and photovoltaic power systems are chosen an example. This study also deals with other uncertain quantities which are system loads. In this example, the management method is based on adapting short-term weather and load forecasting data. The new load demand curve (NLDC) can be produced by merging the loads with the power generated from the renewable power systems. The NLDC is used for setting the loads for the baseload power plants and knowing when other plants are needed to increase or decrease their supplies to the grid. This will decrease the irregularity behavior effects of the renewable power system and at the same time will enhance the smoothing of the power management for the grid. The aim of this paper is to show the use of the weather and load forecasting data to achieve the optimum operational power management of the grid contains renewable power systems. An illustrative example of such a power system is presented and verified by simulation.

9. MAGNETIC GRID

DOEpatents

Post, R.F.

1960-08-01

An electronic grid is designed employing magnetic forces for controlling the passage of charged particles. The grid is particularly applicable to use in gas-filled tubes such as ignitrons. thyratrons, etc., since the magnetic grid action is impartial to the polarity of the charged particles and, accordingly. the sheath effects encountered with electrostatic grids are not present. The grid comprises a conductor having sections spaced apart and extending in substantially opposite directions in the same plane, the ends of the conductor being adapted for connection to a current source.

10. Adapting a commercial power system simulator for smart grid based system study and vulnerability assessment

Navaratne, Uditha Sudheera

The smart grid is the future of the power grid. Smart meters and the associated network play a major role in the distributed system of the smart grid. Advance Metering Infrastructure (AMI) can enhance the reliability of the grid, generate efficient energy management opportunities and many innovations around the future smart grid. These innovations involve intense research not only on the AMI network itself but as also on the influence an AMI network can have upon the rest of the power grid. This research describes a smart meter testbed with hardware in loop that can facilitate future research in an AMI network. The smart meters in the testbed were developed such that their functionality can be customized to simulate any given scenario such as integrating new hardware components into a smart meter or developing new encryption algorithms in firmware. These smart meters were integrated into the power system simulator to simulate the power flow variation in the power grid on different AMI activities. Each smart meter in the network also provides a communication interface to the home area network. This research delivers a testbed for emulating the AMI activities and monitoring their effect on the smart grid.

11. Using specific and adaptive arrangement of grid-type pilot in channel estimation for white-lightLED-based OFDM visible light communication system

Lin, Wan-Feng; Chow, Chi-Wai; Yeh, Chien-Hung

2015-03-01

Orthogonal frequency division multiplexing (OFDM) is a promising candidate for light emitting diode (LED)-based optical wireless communication (OWC); however, precise channel estimation is required for synchronization and equalization. In this work, we study and discover that the channel response of the white-lightLED-based OWC was smooth and stable. Hence we propose and demonstrate using a specific and adaptive arrangement of grid-type pilot scheme to estimate the LED OWC channel response. Experimental results show that our scheme can achieve better transmission performance and with some transmission capacity enhancement when compared with the method using training-symbol scheme (also called block-type pilot scheme).

12. Adaptive Method for Nonsmooth Nonnegative Matrix Factorization.

PubMed

Yang, Zuyuan; Xiang, Yong; Xie, Kan; Lai, Yue

2017-04-01

Nonnegative matrix factorization (NMF) is an emerging tool for meaningful low-rank matrix representation. In NMF, explicit constraints are usually required, such that NMF generates desired products (or factorizations), especially when the products have significant sparseness features. It is known that the ability of NMF in learning sparse representation can be improved by embedding a smoothness factor between the products. Motivated by this result, we propose an adaptive nonsmooth NMF (Ans-NMF) method in this paper. In our method, the embedded factor is obtained by using a data-related approach, so it matches well with the underlying products, implying a superior faithfulness of the representations. Besides, due to the usage of an adaptive selection scheme to this factor, the sparseness of the products can be separately constrained, leading to wider applicability and interpretability. Furthermore, since the adaptive selection scheme is processed through solving a series of typical linear programming problems, it can be easily implemented. Simulations using computer-generated data and real-world data show the advantages of the proposed Ans-NMF method over the state-of-the-art methods.

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.

2006-01-01

Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

14. Achete grilles et methodes pour recherche d'idees sans peine (Buy Grids and Painless Methods for Finding Ideas).

ERIC Educational Resources Information Center

Yaiche, Francis

1986-01-01

Proposes tools and methods for teachers and students to use in the classroom to organize and stimulate ideas, imagination, memory, improvisation, and writing. Sample outlines and grids serve as methods for helping learners understand specific concepts. (MSE)

15. An adaptive wavelet stochastic collocation method for irregular solutions of stochastic partial differential equations

SciTech Connect

Webster, Clayton G; Zhang, Guannan; Gunzburger, Max D

2012-10-01

Accurate predictive simulations of complex real world applications require numerical approximations to first, oppose the curse of dimensionality and second, converge quickly in the presence of steep gradients, sharp transitions, bifurcations or finite discontinuities in high-dimensional parameter spaces. In this paper we present a novel multi-dimensional multi-resolution adaptive (MdMrA) sparse grid stochastic collocation method, that utilizes hierarchical multiscale piecewise Riesz basis functions constructed from interpolating wavelets. The basis for our non-intrusive method forms a stable multiscale splitting and thus, optimal adaptation is achieved. Error estimates and numerical examples will used to compare the efficiency of the method with several other techniques.

16. Elastic wave modelling in 3D heterogeneous media: 3D grid method

Jianfeng, Zhang; Tielin, Liu

2002-09-01

We present a new numerical technique for elastic wave modelling in 3D heterogeneous media with surface topography, which is called the 3D grid method in this paper. This work is an extension of the 2D grid method that models P-SV wave propagation in 2D heterogeneous media. Similar to the finite-element method in the discretization of a numerical mesh, the proposed scheme is flexible in incorporating surface topography and curved interfaces; moreover it satisfies the free-surface boundary conditions of 3D topography naturally. The algorithm, developed from a parsimonious staggered-grid scheme, solves the problem using integral equilibrium around each node, instead of satisfying elastodynamic differential equations at each node as in the conventional finite-difference method. The computational cost and memory requirements for the proposed scheme are approximately the same as those used by the same order finite-difference method. In this paper, a mixed tetrahedral and parallelepiped grid method is presented; and the numerical dispersion and stability criteria on the tetrahedral grid method and parallelepiped grid method are discussed in detail. The proposed scheme is successfully tested against an analytical solution for the 3D Lamb problem and a solution of the boundary method for the diffraction of a hemispherical crater. Moreover, examples of surface-wave propagation in an elastic half-space with a semi-cylindrical trench on the surface and 3D plane-layered model are presented.

17. The Stagger-grid: A grid of 3D stellar atmosphere models. I. Methods and general properties

Magic, Z.; Collet, R.; Asplund, M.; Trampedach, R.; Hayek, W.; Chiavassa, A.; Stein, R. F.; Nordlund, Å.

2013-09-01

Aims: We present the Stagger-grid, a comprehensive grid of time-dependent, three-dimensional (3D), hydrodynamic model atmospheres for late-type stars with realistic treatment of radiative transfer, covering a wide range in stellar parameters. This grid of 3D models is intended for various applications besides studies of stellar convection and atmospheres per se, including stellar parameter determination, stellar spectroscopy and abundance analysis, asteroseismology, calibration of stellar evolution models, interferometry, and extrasolar planet search. In this introductory paper, we describe the methods we applied for the computation of the grid and discuss the general properties of the 3D models as well as of their temporal and spatial averages (here denoted ⟨3D⟩ models). Methods: All our models were generated with the Stagger-code, using realistic input physics for the equation of state (EOS) and for continuous and line opacities. Our ~ 220 grid models range in effective temperature, Teff, from 4000 to 7000 K in steps of 500 K, in surface gravity, log g, from 1.5 to 5.0 in steps of 0.5 dex, and metallicity, [Fe/H], from - 4.0 to + 0.5 in steps of 0.5 and 1.0 dex. Results: We find a tight scaling relation between the vertical velocity and the surface entropy jump, which itself correlates with the constant entropy value of the adiabatic convection zone. The range in intensity contrast is enhanced at lower metallicity. The granule size correlates closely with the pressure scale height sampled at the depth of maximum velocity. We compare the ⟨3D⟩ models with currently widely applied one-dimensional (1D) atmosphere models, as well as with theoretical 1D hydrostatic models generated with the same EOS and opacity tables as the 3D models, in order to isolate the effects of using self-consistent and hydrodynamic modeling of convection, rather than the classical mixing length theory approach. For the first time, we are able to quantify systematically over a broad

18. Three-dimensional computational fluid dynamics modeling of particle uptake by an occupational air sampler using manually-scaled and adaptive grids.

PubMed

Landázuri, Andrea C; Sáez, A Eduardo; Anthony, T Renée

2016-05-01

This work presents fluid flow and particle trajectory simulation studies to determine the aspiration efficiency of a horizontally oriented occupational air sampler using computational fluid dynamics (CFD). Grid adaption and manual scaling of the grids were applied to two sampler prototypes based on a 37-mm cassette. The standard k-ε model was used to simulate the turbulent air flow and a second order streamline-upwind discretization scheme was used to stabilize convective terms of the Navier-Stokes equations. Successively scaled grids for each configuration were created manually and by means of grid adaption using the velocity gradient in the main flow direction. Solutions were verified to assess iterative convergence, grid independence and monotonic convergence. Particle aspiration efficiencies determined for both prototype samplers were undistinguishable, indicating that the porous filter does not play a noticeable role in particle aspiration. Results conclude that grid adaption is a powerful tool that allows to refine specific regions that require lots of detail and therefore better resolve flow detail. It was verified that adaptive grids provided a higher number of locations with monotonic convergence than the manual grids and required the least computational effort.

19. Determining displacement and strain maps immune from aliasing effect with the grid method

Sur, Frédéric; Blaysat, Benoît; Grédiac, Michel

2016-11-01

Spatial aliasing may affect methods based on grid image processing to retrieve displacement and strain maps in experimental mechanics. Such methods aim at estimating these maps on the surface of a specimen subjected to a loading test. Aliasing, which is often not noticeable to the naked eye in the grid images, may give spurious fringes in the strain maps. This paper presents an analysis of aliasing in this context and provides the reader with simple guidelines to minimize the effect of aliasing on strain maps extracted from grid images.

20. Integrated Design Engineering Analysis (IDEA) Environment Automated Generation of Structured CFD Grids using Topology Methods

NASA Technical Reports Server (NTRS)

Kamhawi, Hilmi N.

2012-01-01

This report documents the work performed from March 2010 to March 2012. The Integrated Design and Engineering Analysis (IDEA) environment is a collaborative environment based on an object-oriented, multidisciplinary, distributed framework using the Adaptive Modeling Language (AML) as a framework and supporting the configuration design and parametric CFD grid generation. This report will focus on describing the work in the area of parametric CFD grid generation using novel concepts for defining the interaction between the mesh topology and the geometry in such a way as to separate the mesh topology from the geometric topology while maintaining the link between the mesh topology and the actual geometry.

1. Adaptive envelope protection methods for aircraft

Unnikrishnan, Suraj

Carefree handling refers to the ability of a pilot to operate an aircraft without the need to continuously monitor aircraft operating limits. At the heart of all carefree handling or maneuvering systems, also referred to as envelope protection systems, are algorithms and methods for predicting future limit violations. Recently, envelope protection methods that have gained more acceptance, translate limit proximity information to its equivalent in the control channel. Envelope protection algorithms either use very small prediction horizon or are static methods with no capability to adapt to changes in system configurations. Adaptive approaches maximizing prediction horizon such as dynamic trim, are only applicable to steady-state-response critical limit parameters. In this thesis, a new adaptive envelope protection method is developed that is applicable to steady-state and transient response critical limit parameters. The approach is based upon devising the most aggressive optimal control profile to the limit boundary and using it to compute control limits. Pilot-in-the-loop evaluations of the proposed approach are conducted at the Georgia Tech Carefree Maneuver lab for transient longitudinal hub moment limit protection. Carefree maneuvering is the dual of carefree handling in the realm of autonomous Uninhabited Aerial Vehicles (UAVs). Designing a flight control system to fully and effectively utilize the operational flight envelope is very difficult. With the increasing role and demands for extreme maneuverability there is a need for developing envelope protection methods for autonomous UAVs. In this thesis, a full-authority automatic envelope protection method is proposed for limit protection in UAVs. The approach uses adaptive estimate of limit parameter dynamics and finite-time horizon predictions to detect impending limit boundary violations. Limit violations are prevented by treating the limit boundary as an obstacle and by correcting nominal control

2. 3-D grid refinement using the University of Michigan adaptive mesh library for a pure advective test

Oehmke, R.; Vandenberg, D.; Andronova, N.; Penner, J.; Stout, Q.; Zubov, V.; Jablonowski, C.

2008-05-01

The numerical representation of the partial differential equations (PDE) for high resolution atmospheric dynamical and physical features requires division of the atmospheric volume into a set of 3D grids, each of which has a not quite rectangular form. Each location on the grid contains multiple data that together represent the state of Earth's atmosphere. For successful numerical integration of the PDEs the size of each grid box is used to define the Courant-Friedrichs-Levi criterion in setting the time step. 3D adaptive representations of a sphere are needed to represent the evolution of clouds. In this paper we present the University of Michigan adaptive mesh library - a library that supports the production of parallel codes with use of adaptation on a sphere. The library manages the block-structured data layout, handles ghost cell updates among neighboring blocks and splits blocks as refinements occur. The library has several modules that provide a layer of abstraction for adaptive refinement: blocks, which contain individual cells of user data; shells — the global geometry for the problem, including a sphere, reduced sphere, and now a 3D sphere; a load balancer for placement of blocks onto processors; and a communication support layer which encapsulates all data movement. Users provide data manipulation functions for performing interpolation of user data when refining blocks. We rigorously test the library using refinement of the modeled vertical transport of a tracer with prescribed atmospheric sources and sinks. It is both a 2 and a 3D test, and bridges the performance of the model's dynamics and physics needed for inclusion of cloud formation.

3. Strain analysis by mismatch moire method and grid method using Fourier transform

Morimoto, Y.; Seguchi, Y.; Higashi, T.

1990-01-01

We have formerly presented a new method of the moire analysis of strain using the Fourier transform. It uses the phase information of the moire fringe brightness. By shifting the Fourier spectrum of the image of deformed grating lines, we obtain the “complex moire pattern”. Strain distribution is given as the derivatives of the phases of the complex moire fringes. The analysis is completely automated by digital image processing. All of the laborious and subjective procedures required in the conventional analysis such as fringe sign determination, fringe ordering and fringe interpolation are thus eliminated, and objective, fast and accurate analysis can be made. In this paper, we develop the method to a mismatch method and a grid method. We show some applications for analyzing strain distribution by using this method.

4. Efficient Combustion Simulation via the Adaptive Wavelet Collocation Method

Lung, Kevin; Brown-Dymkoski, Eric; Guerrero, Victor; Doran, Eric; Museth, Ken; Balme, Jo; Urberger, Bob; Kessler, Andre; Jones, Stephen; Moses, Billy; Crognale, Anthony

Rocket engine development continues to be driven by the intuition and experience of designers, progressing through extensive trial-and-error test campaigns. Extreme temperatures and pressures frustrate direct observation, while high-fidelity simulation can be impractically expensive owing to the inherent muti-scale, multi-physics nature of the problem. To address this cost, an adaptive multi-resolution PDE solver has been designed which targets the high performance, many-core architecture of GPUs. The adaptive wavelet collocation method is used to maintain a sparse-data representation of the high resolution simulation, greatly reducing the memory footprint while tightly controlling physical fidelity. The tensorial, stencil topology of wavelet-based grids lends itself to highly vectorized algorithms which are necessary to exploit the performance of GPUs. This approach permits efficient implementation of direct finite-rate kinetics, and improved resolution of steep thermodynamic gradients and the smaller mixing scales that drive combustion dynamics. Resolving these scales is crucial for accurate chemical kinetics, which are typically degraded or lost in statistical modeling approaches.

5. Evaluation of Grid Modification Methods for On- and Off-Track Sonic Boom Analysis

NASA Technical Reports Server (NTRS)

Nayani, Sudheer N.; Campbell, Richard L.

2013-01-01

Grid modification methods have been under development at NASA to enable better predictions of low boom pressure signatures from supersonic aircraft. As part of this effort, two new codes, Stretched and Sheared Grid - Modified (SSG) and Boom Grid (BG), have been developed in the past year. The CFD results from these codes have been compared with ones from the earlier grid modification codes Stretched and Sheared Grid (SSGRID) and Mach Cone Aligned Prism (MCAP) and also with the available experimental results. NASA's unstructured grid suite of software TetrUSS and the automatic sourcing code AUTOSRC were used for base grid generation and flow solutions. The BG method has been evaluated on three wind tunnel models. Pressure signatures have been obtained up to two body lengths below a Gulfstream aircraft wind tunnel model. Good agreement with the wind tunnel results have been obtained for both on-track and off-track (up to 53 degrees) cases. On-track pressure signatures up to ten body lengths below a Straight Line Segmented Leading Edge (SLSLE) wind tunnel model have been extracted. Good agreement with the wind tunnel results have been obtained. Pressure signatures have been obtained at 1.5 body lengths below a Lockheed Martin aircraft wind tunnel model. Good agreement with the wind tunnel results have been obtained for both on-track and off-track (up to 40 degrees) cases. Grid sensitivity studies have been carried out to investigate any grid size related issues. Methods have been evaluated for fully turbulent, mixed laminar/turbulent and fully laminar flow conditions.

6. On the Quality of Velocity Interpolation Schemes for Marker-In-Cell Methods on 3-D Staggered Grids

Kaus, B.; Pusok, A. E.; Popov, A.

2015-12-01

The marker-in-cell method is generally considered to be a flexible and robust method to model advection of heterogenous non-diffusive properties (i.e. rock type or composition) in geodynamic problems or incompressible Stokes problems. In this method, Lagrangian points carrying compositional information are advected with the ambient velocity field on an immobile, Eulerian grid. However, velocity interpolation from grid points to marker locations is often performed without preserving the zero divergence of the velocity field at the interpolated locations (i.e. non-conservative). Such interpolation schemes can induce non-physical clustering of markers when strong velocity gradients are present (Jenny et al., 2001) and this may, eventually, result in empty grid cells, a serious numerical violation of the marker-in-cell method. Solutions to this problem include: using larger mesh resolutions and/or marker densities, or repeatedly controlling the marker distribution (i.e. inject/delete), but which does not have an established physical background. To remedy this at low computational costs, Jenny et al. (2001) and Meyer and Jenny (2004) proposed a simple, conservative velocity interpolation (CVI) scheme for 2-D staggered grid, while Wang et al. (2015) extended the formulation to 3-D finite element methods. Here, we follow up with these studies and report on the quality of velocity interpolation methods for 2-D and 3-D staggered grids. We adapt the formulations from both Jenny et al. (2001) and Wang et al. (2015) for use on 3-D staggered grids, where the velocity components have different node locations as compared to finite element, where they share the same node location. We test the different interpolation schemes (CVI and non-CVI) in combination with different advection schemes (Euler, RK2 and RK4) and with/out marker control on Stokes problems with strong velocity gradients, which are discretized using a finite difference method. We show that a conservative formulation

7. Computations of Unsteady Viscous Compressible Flows Using Adaptive Mesh Refinement in Curvilinear Body-fitted Grid Systems

NASA Technical Reports Server (NTRS)

Steinthorsson, E.; Modiano, David; Colella, Phillip

1994-01-01

A methodology for accurate and efficient simulation of unsteady, compressible flows is presented. The cornerstones of the methodology are a special discretization of the Navier-Stokes equations on structured body-fitted grid systems and an efficient solution-adaptive mesh refinement technique for structured grids. The discretization employs an explicit multidimensional upwind scheme for the inviscid fluxes and an implicit treatment of the viscous terms. The mesh refinement technique is based on the AMR algorithm of Berger and Colella. In this approach, cells on each level of refinement are organized into a small number of topologically rectangular blocks, each containing several thousand cells. The small number of blocks leads to small overhead in managing data, while their size and regular topology means that a high degree of optimization can be achieved on computers with vector processors.

8. Accurate Adaptive Level Set Method and Sharpening Technique for Three Dimensional Deforming Interfaces

NASA Technical Reports Server (NTRS)

Kim, Hyoungin; Liou, Meng-Sing

2011-01-01

In this paper, we demonstrate improved accuracy of the level set method for resolving deforming interfaces by proposing two key elements: (1) accurate level set solutions on adapted Cartesian grids by judiciously choosing interpolation polynomials in regions of different grid levels and (2) enhanced reinitialization by an interface sharpening procedure. The level set equation is solved using a fifth order WENO scheme or a second order central differencing scheme depending on availability of uniform stencils at each grid point. Grid adaptation criteria are determined so that the Hamiltonian functions at nodes adjacent to interfaces are always calculated by the fifth order WENO scheme. This selective usage between the fifth order WENO and second order central differencing schemes is confirmed to give more accurate results compared to those in literature for standard test problems. In order to further improve accuracy especially near thin filaments, we suggest an artificial sharpening method, which is in a similar form with the conventional re-initialization method but utilizes sign of curvature instead of sign of the level set function. Consequently, volume loss due to numerical dissipation on thin filaments is remarkably reduced for the test problems

9. New ghost-node method for linking different models with varied grid refinement

USGS Publications Warehouse

James, S.C.; Dickinson, J.E.; Mehl, S.W.; Hill, M.C.; Leake, S.A.; Zyvoloski, G.A.; Eddebbarh, A.-A.

2006-01-01

A flexible, robust method for linking grids of locally refined ground-water flow models constructed with different numerical methods is needed to address a variety of hydrologic problems. This work outlines and tests a new ghost-node model-linking method for a refined "child" model that is contained within a larger and coarser "parent" model that is based on the iterative method of Steffen W. Mehl and Mary C. Hill (2002, Advances in Water Res., 25, p. 497-511; 2004, Advances in Water Res., 27, p. 899-912). The method is applicable to steady-state solutions for ground-water flow. Tests are presented for a homogeneous two-dimensional system that has matching grids (parent cells border an integer number of child cells) or nonmatching grids. The coupled grids are simulated by using the finite-difference and finite-element models MODFLOW and FEHM, respectively. The simulations require no alteration of the MODFLOW or FEHM models and are executed using a batch file on Windows operating systems. Results indicate that when the grids are matched spatially so that nodes and child-cell boundaries are aligned, the new coupling technique has error nearly equal to that when coupling two MODFLOW models. When the grids are nonmatching, model accuracy is slightly increased compared to that for matching-grid cases. Overall, results indicate that the ghost-node technique is a viable means to couple distinct models because the overall head and flow errors relative to the analytical solution are less than if only the regional coarse-grid model was used to simulate flow in the child model's domain.

10. Ensemble transform sensitivity method for adaptive observations

Zhang, Yu; Xie, Yuanfu; Wang, Hongli; Chen, Dehui; Toth, Zoltan

2016-01-01

The Ensemble Transform (ET) method has been shown to be useful in providing guidance for adaptive observation deployment. It predicts forecast error variance reduction for each possible deployment using its corresponding transformation matrix in an ensemble subspace. In this paper, a new ET-based sensitivity (ETS) method, which calculates the gradient of forecast error variance reduction in terms of analysis error variance reduction, is proposed to specify regions for possible adaptive observations. ETS is a first order approximation of the ET; it requires just one calculation of a transformation matrix, increasing computational efficiency (60%-80% reduction in computational cost). An explicit mathematical formulation of the ETS gradient is derived and described. Both the ET and ETS methods are applied to the Hurricane Irene (2011) case and a heavy rainfall case for comparison. The numerical results imply that the sensitive areas estimated by the ETS and ET are similar. However, ETS is much more efficient, particularly when the resolution is higher and the number of ensemble members is larger.

11. A Mass Conservation Algorithm for Adaptive Unrefinement Meshes Used by Finite Element Methods

DTIC Science & Technology

2012-01-01

dimensional mesh generation. In: Proc. 4th ACM-SIAM Symp. on Disc. Algorithms. (1993) 83–92 [9] Weatherill, N., Hassan, O., Marcum, D., Marchant, M.: Grid ...Conference on Computational Science, ICCS 2012 A Mass Conservation Algorithm For Adaptive Unrefinement Meshes Used By Finite Element Methods Hung V. Nguyen...velocity fields, and chemical distribution, as well as conserve mass, especially for water quality applications. Solution accuracy depends highly on mesh

12. Hydrophobic grid membrane filter method for aerobic plate count in foods: collaborative study.

PubMed

Entis, P

1986-01-01

Twenty-one laboratories participated in a collaborative study to validate a hydrophobic grid membrane filter (HGMF) method for aerobic plate count by comparing its performance against the AOAC/APHA pour plate method. Raw milk, raw poultry, whole egg powder, flours, and spices were included in the study. Counts obtained by the HGMF and pour plate methods did not differ significantly, except in the case of whole egg powder, for which the HGMF method produced significantly higher counts. The hydrophobic grid membrane filter method for aerobic plate count in foods has been adopted official first action.

13. An adaptive multifluid interface-capturing method for compressible flow in complex geometries

SciTech Connect

Greenough, J.A.; Beckner, V.; Pember, R.B.; Crutchfield, W.Y.; Bell, J.B.; Colella, P.

1995-04-01

We present a numerical method for solving the multifluid equations of gas dynamics using an operator-split second-order Godunov method for flow in complex geometries in two and three dimensions. The multifluid system treats the fluid components as thermodynamically distinct entities and correctly models fluids with different compressibilities. This treatment allows a general equation-of-state (EOS) specification and the method is implemented so that the EOS references are minimized. The current method is complementary to volume-of-fluid (VOF) methods in the sense that a VOF representation is used, but no interface reconstruction is performed. The Godunov integrator captures the interface during the solution process. The basic multifluid integrator is coupled to a Cartesian grid algorithm that also uses a VOF representation of the fluid-body interface. This representation of the fluid-body interface allows the algorithm to easily accommodate arbitrarily complex geometries. The resulting single grid multifluid-Cartesian grid integration scheme is coupled to a local adaptive mesh refinement algorithm that dynamically refines selected regions of the computational grid to achieve a desired level of accuracy. The overall method is fully conservative with respect to the total mixture. The method will be used for a simple nozzle problem in two-dimensional axisymmetric coordinates.

14. Full multi grid method for electric field computation in point-to-plane streamer discharge in air at atmospheric pressure

Kacem, S.; Eichwald, O.; Ducasse, O.; Renon, N.; Yousfi, M.; Charrada, K.

2012-01-01

Streamers dynamics are characterized by the fast propagation of ionized shock waves at the nanosecond scale under very sharp space charge variations. The streamer dynamics modelling needs the solution of charged particle transport equations coupled to the elliptic Poisson's equation. The latter has to be solved at each time step of the streamers evolution in order to follow the propagation of the resulting space charge electric field. In the present paper, a full multi grid (FMG) and a multi grid (MG) methods have been adapted to solve Poisson's equation for streamer discharge simulations between asymmetric electrodes. The validity of the FMG method for the computation of the potential field is first shown by performing direct comparisons with analytic solution of the Laplacian potential in the case of a point-to-plane geometry. The efficiency of the method is also compared with the classical successive over relaxation method (SOR) and MUltifrontal massively parallel solver (MUMPS). MG method is then applied in the case of the simulation of positive streamer propagation and its efficiency is evaluated from comparisons to SOR and MUMPS methods in the chosen point-to-plane configuration. Very good agreements are obtained between the three methods for all electro-hydrodynamics characteristics of the streamer during its propagation in the inter-electrode gap. However in the case of MG method, the computational time to solve the Poisson's equation is at least 2 times faster in our simulation conditions.

15. On the diffuse interface method using a dual-resolution Cartesian grid

Ding, Hang; Yuan, Cheng-jun

2014-09-01

We investigate the applicability and performance of diffuse interface methods on a dual-resolution grid in solving two-phase flows. In the diffuse interface methods, the interface thickness represents a cut-off length scale in resolving the interfacial dynamics, and it was found that an apparent loss of mass occurs when the interface thickness is comparable to the length scale of flows [24]. From the accuracy and mass conservation point of view, it is desirable to have a thin interface in simulations. We propose to use a dual-resolution Cartesian grid, on which a finer resolution is applied to the volume fraction C than that for the velocity and pressure fields. Because the computation of C field is rather inexpensive compared to that required by velocity and pressure fields, dual-resolution grids can significantly increase the resolution of the interface with only a slight increase of computational cost, as compared to the single-resolution grid. The solution couplings between the fine grid for C and the coarse grid (for velocity and pressure) are delicately designed, to make sure that the interpolated velocity is divergence-free at a discrete level and that the mass and surface tension force are conserved. A variety of numerical tests have been performed to validate the method and check its performance. The dual-resolution grid appears to save nearly 70% of the computational time in two-dimensional simulations and 80% in three-dimensional simulations, and produces nearly the same results as the single-resolution grid. Quantitative comparisons are made with previous studies, including Rayleigh Taylor instability, steadily rising bubble, and partial coalescence of a drop into a pool, and good agreement has been achieved. Finally, results are presented for the deformation and breakup of three-dimensional drops in simple shear flows.

16. A Comprehensive Study of Gridding Methods for GPS Horizontal Velocity Fields

Wu, Yanqiang; Jiang, Zaisen; Liu, Xiaoxia; Wei, Wenxin; Zhu, Shuang; Zhang, Long; Zou, Zhenyu; Xiong, Xiaohui; Wang, Qixin; Du, Jiliang

2017-03-01

Four gridding methods for GPS velocities are compared in terms of their precision, applicability and robustness by analyzing simulated data with uncertainties from 0.0 to ±3.0 mm/a. When the input data are 1° × 1° grid sampled and the uncertainty of the additional error is greater than ±1.0 mm/a, the gridding results show that the least-squares collocation method is highly robust while the robustness of the Kriging method is low. In contrast, the spherical harmonics and the multi-surface function are moderately robust, and the regional singular values for the multi-surface function method and the edge effects for the spherical harmonics method become more significant with increasing uncertainty of the input data. When the input data (with additional errors of ±2.0 mm/a) are decimated by 50% from the 1° × 1° grid data and then erased in three 6° × 12° regions, the gridding results in these three regions indicate that the least-squares collocation and the spherical harmonics methods have good performances, while the multi-surface function and the Kriging methods may lead to singular values. The gridding techniques are also applied to GPS horizontal velocities with an average error of ±0.8 mm/a over the Chinese mainland and the surrounding areas, and the results show that the least-squares collocation method has the best performance, followed by the Kriging and multi-surface function methods. Furthermore, the edge effects of the spherical harmonics method are significantly affected by the sparseness and geometric distribution of the input data. In general, the least-squares collocation method is superior in terms of its robustness, edge effect, error distribution and stability, while the other methods have several positive features.

17. A Comprehensive Study of Gridding Methods for GPS Horizontal Velocity Fields

Wu, Yanqiang; Jiang, Zaisen; Liu, Xiaoxia; Wei, Wenxin; Zhu, Shuang; Zhang, Long; Zou, Zhenyu; Xiong, Xiaohui; Wang, Qixin; Du, Jiliang

2016-12-01

Four gridding methods for GPS velocities are compared in terms of their precision, applicability and robustness by analyzing simulated data with uncertainties from 0.0 to ±3.0 mm/a. When the input data are 1° × 1° grid sampled and the uncertainty of the additional error is greater than ±1.0 mm/a, the gridding results show that the least-squares collocation method is highly robust while the robustness of the Kriging method is low. In contrast, the spherical harmonics and the multi-surface function are moderately robust, and the regional singular values for the multi-surface function method and the edge effects for the spherical harmonics method become more significant with increasing uncertainty of the input data. When the input data (with additional errors of ±2.0 mm/a) are decimated by 50% from the 1° × 1° grid data and then erased in three 6° × 12° regions, the gridding results in these three regions indicate that the least-squares collocation and the spherical harmonics methods have good performances, while the multi-surface function and the Kriging methods may lead to singular values. The gridding techniques are also applied to GPS horizontal velocities with an average error of ±0.8 mm/a over the Chinese mainland and the surrounding areas, and the results show that the least-squares collocation method has the best performance, followed by the Kriging and multi-surface function methods. Furthermore, the edge effects of the spherical harmonics method are significantly affected by the sparseness and geometric distribution of the input data. In general, the least-squares collocation method is superior in terms of its robustness, edge effect, error distribution and stability, while the other methods have several positive features.

18. Adaptive method with intercessory feedback control for an intelligent agent

DOEpatents

Goldsmith, Steven Y.

2004-06-22

An adaptive architecture method with feedback control for an intelligent agent provides for adaptively integrating reflexive and deliberative responses to a stimulus according to a goal. An adaptive architecture method with feedback control for multiple intelligent agents provides for coordinating and adaptively integrating reflexive and deliberative responses to a stimulus according to a goal. Re-programming of the adaptive architecture is through a nexus which coordinates reflexive and deliberator components.

19. Adaptive Accommodation Control Method for Complex Assembly

Kang, Sungchul; Kim, Munsang; Park, Shinsuk

Robotic systems have been used to automate assembly tasks in manufacturing and in teleoperation. Conventional robotic systems, however, have been ineffective in controlling contact force in multiple contact states of complex assemblythat involves interactions between complex-shaped parts. Unlike robots, humans excel at complex assembly tasks by utilizing their intrinsic impedance, forces and torque sensation, and tactile contact clues. By examining the human behavior in assembling complex parts, this study proposes a novel geometry-independent control method for robotic assembly using adaptive accommodation (or damping) algorithm. Two important conditions for complex assembly, target approachability and bounded contact force, can be met by the proposed control scheme. It generates target approachable motion that leads the object to move closer to a desired target position, while contact force is kept under a predetermined value. Experimental results from complex assembly tests have confirmed the feasibility and applicability of the proposed method.

20. The adaptive EVP method for solving the sea ice momentum equation

Kimmritz, Madlen; Danilov, Sergey; Losch, Martin

2016-04-01

Most dynamic sea ice models for climate-type simulations are based on the viscous-plastic (VP) rheology. The resulting stiff system of partial differential equations for the sea ice velocity is either solved implicitly at great computational cost, or explicitly with added pseudo-elasticity (elastic-viscous-plastic, EVP). Bouillon et al. (Ocean Modell., 2013) reinterpreted the EVP method for solving the sea ice momentum equation as an iterative pseudotime VP solver with improved convergence properties. In Kimmritz et al. (J. Comput. Physics, 2015) we showed that this modified EVP (mEVP) scheme should warrant converging solutions if its stability is maintained and the number of pseudotime iterations is sufficiently high. Here, we focus on the role of spatial discretizations. We analyze stability and convergence of mEVP on B- and C-grids. We show that the implementation on B-grids is less restrictive with respect to stability constraints than on C-grids. Additionally, convergence on C-grids is sensitive to the discretization of the viscosities and can be lost for some variants of discretization. Building on these findings we present an adaptive version of the mEVP scheme, which satisfies local stability constraints and aims to accelerate convergence where possible. This is achieved by local adaptation of the parameters governing the pseudotime subcycling of the scheme. We analyze the performance of this new ``adaptive EVP'' approach in a series of experiments with the sea ice component of the general circulation model MITgcm, which is formulated on a C-grid. We show that convergence in realistic settings is sensitive to the details of the implementation of the rheology. In particular, the use of the pressure replacement method deteriorates convergence.

1. A Comparison of Spectral Element and Finite Difference Methods Using Statically Refined Nonconforming Grids for the MHD Island Coalescence Instability Problem

Ng, C. S.; Rosenberg, D.; Pouquet, A.; Germaschewski, K.; Bhattacharjee, A.

2009-04-01

A recently developed spectral-element adaptive refinement incompressible magnetohydrodynamic (MHD) code [Rosenberg, Fournier, Fischer, Pouquet, J. Comp. Phys. 215, 59-80 (2006)] is applied to simulate the problem of MHD island coalescence instability (\\ci) in two dimensions. \\ci is a fundamental MHD process that can produce sharp current layers and subsequent reconnection and heating in a high-Lundquist number plasma such as the solar corona [Ng and Bhattacharjee, Phys. Plasmas, 5, 4028 (1998)]. Due to the formation of thin current layers, it is highly desirable to use adaptively or statically refined grids to resolve them, and to maintain accuracy at the same time. The output of the spectral-element static adaptive refinement simulations are compared with simulations using a finite difference method on the same refinement grids, and both methods are compared to pseudo-spectral simulations with uniform grids as baselines. It is shown that with the statically refined grids roughly scaling linearly with effective resolution, spectral element runs can maintain accuracy significantly higher than that of the finite difference runs, in some cases achieving close to full spectral accuracy.

2. Progress in Grid Generation: From Chimera to DRAGON Grids

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing; Kao, Kai-Hsiung

1994-01-01

Hybrid grids, composed of structured and unstructured grids, combines the best features of both. The chimera method is a major stepstone toward a hybrid grid from which the present approach is evolved. The chimera grid composes a set of overlapped structured grids which are independently generated and body-fitted, yielding a high quality grid readily accessible for efficient solution schemes. The chimera method has been shown to be efficient to generate a grid about complex geometries and has been demonstrated to deliver accurate aerodynamic prediction of complex flows. While its geometrical flexibility is attractive, interpolation of data in the overlapped regions - which in today's practice in 3D is done in a nonconservative fashion, is not. In the present paper we propose a hybrid grid scheme that maximizes the advantages of the chimera scheme and adapts the strengths of the unstructured grid while at the same time keeps its weaknesses minimal. Like the chimera method, we first divide up the physical domain by a set of structured body-fitted grids which are separately generated and overlaid throughout a complex configuration. To eliminate any pure data manipulation which does not necessarily follow governing equations, we use non-structured grids only to directly replace the region of the arbitrarily overlapped grids. This new adaptation to the chimera thinking is coined the DRAGON grid. The nonstructured grid region sandwiched between the structured grids is limited in size, resulting in only a small increase in memory and computational effort. The DRAGON method has three important advantages: (1) preserving strengths of the chimera grid; (2) eliminating difficulties sometimes encountered in the chimera scheme, such as the orphan points and bad quality of interpolation stencils; and (3) making grid communication in a fully conservative and consistent manner insofar as the governing equations are concerned. To demonstrate its use, the governing equations are

3. Grid-based precision aim system and method for disrupting suspect objects

DOEpatents

Gladwell, Thomas Scott; Garretson, Justin; Hobart, Clinton G.; Monda, Mark J.

2014-06-10

A system and method for disrupting at least one component of a suspect object is provided. The system has a source for passing radiation through the suspect object, a grid board positionable adjacent the suspect object (the grid board having a plurality of grid areas, the radiation from the source passing through the grid board), a screen for receiving the radiation passing through the suspect object and generating at least one image, a weapon for deploying a discharge, and a targeting unit for displaying the image of the suspect object and aiming the weapon according to a disruption point on the displayed image and deploying the discharge into the suspect object to disable the suspect object.

4. Semi-implicit Integration Factor Methods on Sparse Grids for High-Dimensional Systems

PubMed Central

Wang, Dongyong; Chen, Weitao; Nie, Qing

2015-01-01

Numerical methods for partial differential equations in high-dimensional spaces are often limited by the curse of dimensionality. Though the sparse grid technique, based on a one-dimensional hierarchical basis through tensor products, is popular for handling challenges such as those associated with spatial discretization, the stability conditions on time step size due to temporal discretization, such as those associated with high-order derivatives in space and stiff reactions, remain. Here, we incorporate the sparse grids with the implicit integration factor method (IIF) that is advantageous in terms of stability conditions for systems containing stiff reactions and diffusions. We combine IIF, in which the reaction is treated implicitly and the diffusion is treated explicitly and exactly, with various sparse grid techniques based on the finite element and finite difference methods and a multi-level combination approach. The overall method is found to be efficient in terms of both storage and computational time for solving a wide range of PDEs in high dimensions. In particular, the IIF with the sparse grid combination technique is flexible and effective in solving systems that may include cross-derivatives and non-constant diffusion coefficients. Extensive numerical simulations in both linear and nonlinear systems in high dimensions, along with applications of diffusive logistic equations and Fokker-Planck equations, demonstrate the accuracy, efficiency, and robustness of the new methods, indicating potential broad applications of the sparse grid-based integration factor method. PMID:25897178

5. Control Dynamics of Adaptive and Scalable Power and Energy Systems for Military Micro Grids

DTIC Science & Technology

2006-12-01

quality at the levels required for Army installations ( Fairley 2004; Apt et al. 2004; Sheblé 2006; Weaver 2004; EPRI 2003; Silberman 2001; Blum 2004; Behr...Challenges of the 21st Century: 2003 Summary and Synthesis. Report # 1010929. Fairley , P. 2004. The unruly power grid. IEEE Spectrum 41(8): 16-21

6. NEW GHOST-NODE METHOD FOR LINKING DIFFERENT MODELS WITH VARIED GRID REFINEMENT

SciTech Connect

S.C. James; J.E. Dickinson; S.W. Mehl; M.C. Hill; S.A. Leake; G.A. zyvoloski; A. Eddebbarh

2006-02-15

A flexible, robust method for linking grids of locally refined models constructed with different numerical methods is needed to address a variety of hydrologic problems. This work outlines and tests a new ghost-node model-linking method for a refined ''child'' model that is contained within a larger and coarser ''parent'' model that is based on the iterative method of Mehl and Hill (2002, 2004). The method is applicable to steady-state solutions for ground-water flow. Tests are presented for a homogeneous two-dimensional system that has either matching grids (parent cells border an integer number of child cells; Figure 2a) or non-matching grids (parent cells border a non-integer number of child cells; Figure 2b). The coupled grids are simulated using the finite-difference and finite-element models MODFLOW and FEHM, respectively. The simulations require no alteration of the MODFLOW or FEHM models and are executed using a batch file on Windows operating systems. Results indicate that when the grids are matched spatially so that nodes and child cell boundaries are aligned, the new coupling technique has error nearly equal to that when coupling two MODFLOW models (Mehl and Hill, 2002). When the grids are non-matching, model accuracy is slightly increased over matching-grid cases. Overall, results indicate that the ghost-node technique is a viable means to accurately couple distinct models because the overall error is less than if only the regional model was used to simulate flow in the child model's domain.

7. New Ghost-node method for linking different models with varied grid refinement.

SciTech Connect

Mehl, Steffen W.; Hill, Mary Catherine.; James, Scott Carlton; Leake, Stanley A.; Zyvoloski, George A.; Dickinson, Jesse E.; Eddebbarh, Al A.

2006-01-01

A flexible, robust method for linking grids of locally refined models constructed with different numerical methods is needed to address a variety of hydrologic problems. This work outlines and tests a new ghost-node model-linking method for a refined 'child' model that is contained within a larger and coarser 'parent' model that is based on the iterative method of Mehl and Hill (2002, 2004). The method is applicable to steady-state solutions for ground-water flow. Tests are presented for a homogeneous two-dimensional system that has either matching grids (parent cells border an integer number of child cells; Figure 2a) or non-matching grids (parent cells border a non-integer number of child cells; Figure 2b). The coupled grids are simulated using the finite-difference and finite-element models MODFLOW and FEHM, respectively. The simulations require no alteration of the MODFLOW or FEHM models and are executed using a batch file on Windows operating systems. Results indicate that when the grids are matched spatially so that nodes and child cell boundaries are aligned, the new coupling technique has error nearly equal to that when coupling two MODFLOW models (Mehl and Hill, 2002). When the grids are non-matching, model accuracy is slightly increased over matching-grid cases. Overall, results indicate that the ghost-node technique is a viable means to accurately couple distinct models because the overall error is less than if only the regional model was used to simulate flow in the child model's domain.

8. A high-precision calculation method for interface normal and curvature on an unstructured grid

Ito, Kei; Kunugi, Tomoaki; Ohno, Shuji; Kamide, Hideki; Ohshima, Hiroyuki

2014-09-01

In the volume-of-fluid algorithm, the calculations of the interface normal and curvature are crucially important for accurately simulating interfacial flows. However, few methods have been proposed for the high-precision interface calculation on an unstructured grid. In this paper, the authors develop a height function method that works appropriately on an unstructured grid. In the process, the definition of the height function is discussed, and the high-precision calculation method of the interface normal is developed to meet the necessary condition for a second-order method. This new method has highly reduced computational cost compared with a conventional high-precision method because the interface normal calculation is completed by solving relatively simple algebraic equations. The curvature calculation method is also discussed and the approximated quadric curve of an interface is employed to calculate the curvature. Following a basic verification, the developed height function method is shown to successfully provide superior calculation accuracy and highly reduced computational cost compared with conventional calculation methods in terms of the interface normal and curvature. In addition, the height function method succeeds in calculating accurately the slotted-disk revolution problem and the oscillating drop on unstructured grids. Therefore, the developed height function method is confirmed to be an efficient technique for the high-precision numerical simulation of interfacial flows on an unstructured grid.

9. Rupture Dynamics Simulation for Non-Planar fault by a Curved Grid Finite Difference Method

Zhang, Z.; Zhu, G.; Chen, X.

2011-12-01

We first implement the non-staggered finite difference method to solve the dynamic rupture problem, with split-node, for non-planar fault. Split-node method for dynamic simulation has been used widely, because of that it's more precise to represent the fault plane than other methods, for example, thick fault, stress glut and so on. The finite difference method is also a popular numeric method to solve kinematic and dynamic problem in seismology. However, previous works focus most of theirs eyes on the staggered-grid method, because of its simplicity and computational efficiency. However this method has its own disadvantage comparing to non-staggered finite difference method at some fact for example describing the boundary condition, especially the irregular boundary, or non-planar fault. Zhang and Chen (2006) proposed the MacCormack high order non-staggered finite difference method based on curved grids to precisely solve irregular boundary problem. Based upon on this non-staggered grid method, we make success of simulating the spontaneous rupture problem. The fault plane is a kind of boundary condition, which could be irregular of course. So it's convinced that we could simulate rupture process in the case of any kind of bending fault plane. We will prove this method is valid in the case of Cartesian coordinate first. In the case of bending fault, the curvilinear grids will be used.

10. A measurement method for micro 3D shape based on grids-processing and stereovision technology

Li, Chuanwei; Liu, Zhanwei; Xie, Huimin

2013-04-01

An integrated measurement method for micro 3D surface shape by a combination of stereovision technology in a scanning electron microscope (SEM) and grids-processing methodology is proposed. The principle of the proposed method is introduced in detail. By capturing two images of the tested specimen with grids on the surface at different tilt angles in an SEM, the 3D surface shape of the specimen can be obtained. Numerical simulation is applied to analyze the feasibility of the proposed method. A validation experiment is performed here. The surface shape of the metal-wire/polymer-membrane structures with thermal deformation is reconstructed. By processing the surface grids of the specimen, the out-of-plane displacement field of the specimen surface is also obtained. Compared with the measurement results obtained by a 3D digital microscope, the experimental error of the proposed method is discussed

11. Adaptive Generation of Multimaterial Grids from imaging data for Biomedical Lagrangian Fluid-Structure Simulations

SciTech Connect

Carson, James P.; Kuprat, Andrew P.; Jiao, Xiangmin; Dyedov, Volodymyr; del Pin, Facundo; Guccione, Julius M.; Ratcliffe, Mark B.; Einstein, Daniel R.

2010-04-01

Spatial discretization of complex imaging-derived fluid-solid geometries, such as the cardiac environment, is a critical but often overlooked challenge in biomechanical computations. This is particularly true in problems with Lagrangian interfaces, where, the fluid and solid phases must match geometrically. For simplicity and better accuracy, it is also highly desirable for the two phases to share the same surface mesh at the interface between them. We outline a method for solving this problem, and illustrate the approach with a 3D fluid-solid mesh of the mouse heart. An MRI perfusion-fixed dataset of a mouse heart with 50μm isotropic resolution was semi-automatically segmented using a customized multimaterial connected-threshold approach that divided the volume into non-overlapping regions of blood, tissue and background. Subsequently, a multimaterial marching cubes algorithm was applied to the segmented data to produce two detailed, compatible isosurfaces, one for blood and one for tissue. Both isosurfaces were simultaneously smoothed with a multimaterial smoothing algorithm that exactly conserves the volume for each phase. Using these two isosurfaces, we developed and applied novel automated meshing algorithms to generate anisotropic hybrid meshes on arbitrary biological geometries with the number of layers and the desired element anisotropy for each phase as the only input parameters. Since our meshes adapt to the local feature sizes and include boundary layer prisms, they are more efficient and accurate than non-adaptive, isotropic meshes, and the fluid-structure interaction computations will tend to have relative error equilibrated over the whole mesh.

12. Self-adjusting grid methods for one-dimensional hyperbolic conservation laws

NASA Technical Reports Server (NTRS)

Harten, A.; Hyman, J. M.

1983-01-01

The automatic adjustment of a grid which follows the dynamics of the numerical solution of hyperbolic conservation laws is given. The grid motion is determined by averaging the local characteristic velocities of the equations with respect to the amplitudes of the signals. The resulting algorithm is a simple extension of many currently popular Godunov-type methods. Computer codes using one of these methods can be easily modified to add the moving mesh as an option. Numerical examples are given that illustrate the improved accuracy of Godunov's and Roe's methods on a self-adjusting mesh. Previously announced in STAR as N83-15008

13. Adaptive model training system and method

DOEpatents

Bickford, Randall L; Palnitkar, Rahul M; Lee, Vo

2014-04-15

An adaptive model training system and method for filtering asset operating data values acquired from a monitored asset for selectively choosing asset operating data values that meet at least one predefined criterion of good data quality while rejecting asset operating data values that fail to meet at least the one predefined criterion of good data quality; and recalibrating a previously trained or calibrated model having a learned scope of normal operation of the asset by utilizing the asset operating data values that meet at least the one predefined criterion of good data quality for adjusting the learned scope of normal operation of the asset for defining a recalibrated model having the adjusted learned scope of normal operation of the asset.

14. Adaptive model training system and method

DOEpatents

Bickford, Randall L; Palnitkar, Rahul M

2014-11-18

An adaptive model training system and method for filtering asset operating data values acquired from a monitored asset for selectively choosing asset operating data values that meet at least one predefined criterion of good data quality while rejecting asset operating data values that fail to meet at least the one predefined criterion of good data quality; and recalibrating a previously trained or calibrated model having a learned scope of normal operation of the asset by utilizing the asset operating data values that meet at least the one predefined criterion of good data quality for adjusting the learned scope of normal operation of the asset for defining a recalibrated model having the adjusted learned scope of normal operation of the asset.

15. Adaptive filtering for the lattice Boltzmann method

Marié, Simon; Gloerfelt, Xavier

2017-03-01

In this study, a new selective filtering technique is proposed for the Lattice Boltzmann Method. This technique is based on an adaptive implementation of the selective filter coefficient σ. The proposed model makes the latter coefficient dependent on the shear stress in order to restrict the use of the spatial filtering technique in sheared stress region where numerical instabilities may occur. Different parameters are tested on 2D test-cases sensitive to numerical stability and on a 3D decaying Taylor-Green vortex. The results are compared to the classical static filtering technique and to the use of a standard subgrid-scale model and give significant improvements in particular for low-order filter consistent with the LBM stencil.

16. Introducing Enabling Computational Tools to the Climate Sciences: Multi-Resolution Climate Modeling with Adaptive Cubed-Sphere Grids

SciTech Connect

Jablonowski, Christiane

2015-07-14

The research investigates and advances strategies how to bridge the scale discrepancies between local, regional and global phenomena in climate models without the prohibitive computational costs of global cloud-resolving simulations. In particular, the research explores new frontiers in computational geoscience by introducing high-order Adaptive Mesh Refinement (AMR) techniques into climate research. AMR and statically-adapted variable-resolution approaches represent an emerging trend for atmospheric models and are likely to become the new norm in future-generation weather and climate models. The research advances the understanding of multi-scale interactions in the climate system and showcases a pathway how to model these interactions effectively with advanced computational tools, like the Chombo AMR library developed at the Lawrence Berkeley National Laboratory. The research is interdisciplinary and combines applied mathematics, scientific computing and the atmospheric sciences. In this research project, a hierarchy of high-order atmospheric models on cubed-sphere computational grids have been developed that serve as an algorithmic prototype for the finite-volume solution-adaptive Chombo-AMR approach. The foci of the investigations have lied on the characteristics of both static mesh adaptations and dynamically-adaptive grids that can capture flow fields of interest like tropical cyclones. Six research themes have been chosen. These are (1) the introduction of adaptive mesh refinement techniques into the climate sciences, (2) advanced algorithms for nonhydrostatic atmospheric dynamical cores, (3) an assessment of the interplay between resolved-scale dynamical motions and subgrid-scale physical parameterizations, (4) evaluation techniques for atmospheric model hierarchies, (5) the comparison of AMR refinement strategies and (6) tropical cyclone studies with a focus on multi-scale interactions and variable-resolution modeling. The results of this research project

17. Ghost-Cell Method for Inviscid Three-Dimensional Flows with Moving Body on Cartesian Grids

Liu, Jianming; Zhao, Ning; Hu, Ou

This paper depicts a ghost cell method to solve the three dimensional compressible time-dependent Euler equations using Cartesian grids for static or moving bodies. In this method, there is no need for special treatment corresponding to cut cells, which complicate other Cartesian mesh methods, and the method avoids the small cell problem. As an application, we present some numerical results for a special moving body using this method, which demonstrates the efficiency of the proposed method.

18. A NEW GHOST-NODE METHOD FOR LINKING DIFFERENT MODELS WITH VARIED GRID REFINEMENT

SciTech Connect

J. dickinson; S.C. James; S. Mehl; M.C. Hill; S. Leake; G.A. Zyvoloski

2005-10-18

A flexible, robust method for linking grids of locally refined models that may be constructed using different types of numerical methods is needed to address a variety of hydrologic problems. This work outlines and tests a new ghost-node model-linking method based on the iterative method of Mehl and Hill (2002, 2004). It is applicable to steady-state solutions for ground-water flow. Tests are presented for a homogeneous two-dimensional system that facilitates clear analysis of typical problems. The coupled grids are simulated using the finite-difference and finite-element models MODFLOW and FEHM. Results indicate that when the grids are matched spatially so that nodes and control volume boundaries are aligned, the new coupling technique has approximately twice the error as coupling using two MODFLOW models. When the grids are non-matching; model accuracy is slightly increased over matching grid cases. Overall, results indicate that the ghost-node technique is a viable means to accurately couple distinct models.

Schneider, Kai; Kolomenskiy, Dmitry; Nave, Jean-Chtristophe

2014-11-01

Advection problems are encountered in many applications, such as transport of passive scalars modeling pollution or mixing in chemical engineering. In some problems, the solution develops small-scale features localized in a part of the computational domain. If the location of these features changes in time, the efficiency of the numerical method can be significantly improved by adapting the partition dynamically to the solution. We present a space-time adaptive scheme for solving advection equations in two space dimensions. The third order accurate gradient-augmented level set method using a semi-Lagrangian formulation with backward time integration is coupled with a point value multiresolution analysis using Hermite interpolation. Thus locally refined dyadic spatial grids are introduced which are efficiently implemented with dynamic quad-tree data structures. For adaptive time integration, an embedded Runge-Kutta method is employed. The precision of the new fully adaptive method is analysed and speed up of CPU time and memory compression with respect to the uniform grid discretization are reported.

20. Feasibility of a simple method of hybrid collimation for megavoltage grid therapy

SciTech Connect

Almendral, Pedro; Mancha, Pedro J.; Roberto, Daniel

2013-05-15

Purpose: Megavoltage grid therapy is currently delivered with step-and-shoot multisegment techniques or using a high attenuation block with divergent holes. However, the commercial availability of grid blocks is limited, their construction is difficult, and step-and-shoot techniques require longer treatment times and are not practical with some multileaf collimators. This work studies the feasibility of a hybrid collimation system for grid therapy that does not require multiple segments and can be easily implemented with widely available technical means. Methods: The authors have developed a system to generate a grid of beamlets by the simultaneous use of two perpendicular sets of equally spaced leaves that project stripe patterns in orthogonal directions. One of them is generated with the multileaf collimator integrated in the accelerator and the other with an in-house made collimator constructed with a low melting point alloy commonly available at radiation oncology departments. The characteristics of the grid fields for 6 and 18 MV have been studied with a shielded diode, an unshielded diode, and radiochromic film. Results: The grid obtained with the hybrid collimation is similar to some of the grids used clinically with respect to the beamlet size (about 1 cm) and the percentage of open beam (1/4 of the total field). The grid fields are less penetrating than the open fields of the same energy. Depending on the depth and the direction of the profiles (diagonal or along the principal axes), the measured valley-to-peak dose ratios range from 5% to 16% for 6 MV and from 9% to 20% for 18 MV. All the detectors yield similar results in the measurement of profiles and percent depth dose, but the shielded diode seems to overestimate the output factors. Conclusions: The combination of two stripe pattern collimators in orthogonal directions is a feasible method to obtain two-dimensional arrays of beamlets and has potential usefulness as an efficient way to deliver grid

1. A direct discontinuous Galerkin method for the compressible Navier-Stokes equations on arbitrary grids

Cheng, Jian; Yang, Xiaoquan; Liu, Xiaodong; Liu, Tiegang; Luo, Hong

2016-12-01

A Direct Discontinuous Galerkin (DDG) method is developed for solving the compressible Navier-Stokes equations on arbitrary grids in the framework of DG methods. The DDG method, originally introduced for scalar diffusion problems on structured grids, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations. Two approaches of implementing the DDG method to compute numerical diffusive fluxes for the Navier-Stokes equations are presented: one is based on the conservative variables, and the other is based on the primitive variables. The importance of the characteristic cell size used in the DDG formulation on unstructured grids is examined. The numerical fluxes on the boundary by the DDG method are discussed. A number of test cases are presented to assess the performance of the DDG method for solving the compressible Navier-Stokes equations. Based on our numerical results, we observe that DDG method can achieve the designed order of accuracy and is able to deliver the same accuracy as the widely used BR2 method at a significantly reduced cost, clearly demonstrating that the DDG method provides an attractive alternative for solving the compressible Navier-Stokes equations on arbitrary grids owning to its simplicity in implementation and its efficiency in computational cost.

2. Method of Quantifying Size of Retinal Hemorrhages in Eyes with Branch Retinal Vein Occlusion Using 14-Square Grid: Interrater and Intrarater Reliability.

PubMed

Takashima, Yuko; Sugimoto, Masahiko; Kato, Kumiko; Kozawa, Maki; Ikesugi, Kengo; Matsubara, Hisashi; Kondo, Mineo

2016-01-01

Purpose. To describe a method of quantifying the size of the retinal hemorrhages in branch retinal vein occlusion (BRVO) and to determine the interrater and intrarater reliabilities of these measurements. Methods. Thirty-five fundus photographs from 35 consecutive eyes with BRVO were studied. The fundus images were analyzed with Power-Point® software, and a grid of 14 squares was laid over the fundus image. Raters were asked to judge the percentage of each of the 14 squares that was covered by the hemorrhages, and the average of the 14 squares was taken to be the relative size of the retinal hemorrhage. Results. Interrater reliability between three raters was higher when a grid with 14 squares was used (intraclass correlation coefficient (ICC), 0.96) than that when a box with no grid was used (ICC, 0.78). Intrarater reliability, which was calculated by the retinal hemorrhage area measured on two different days, was also higher (ICC, 0.97) than that with no grid (ICC, 0.86). Interrater reliability for five fundus pictures with poor image quality was also good when a grid with 14 squares was used (ICC, 0.88). Conclusions. Although our method is subjective, excellent interrater and intrarater reliabilities indicate that this method can be adapted for clinical use.

3. Method of Quantifying Size of Retinal Hemorrhages in Eyes with Branch Retinal Vein Occlusion Using 14-Square Grid: Interrater and Intrarater Reliability

PubMed Central

Takashima, Yuko; Sugimoto, Masahiko; Kato, Kumiko; Kozawa, Maki; Ikesugi, Kengo

2016-01-01

Purpose. To describe a method of quantifying the size of the retinal hemorrhages in branch retinal vein occlusion (BRVO) and to determine the interrater and intrarater reliabilities of these measurements. Methods. Thirty-five fundus photographs from 35 consecutive eyes with BRVO were studied. The fundus images were analyzed with Power-Point® software, and a grid of 14 squares was laid over the fundus image. Raters were asked to judge the percentage of each of the 14 squares that was covered by the hemorrhages, and the average of the 14 squares was taken to be the relative size of the retinal hemorrhage. Results. Interrater reliability between three raters was higher when a grid with 14 squares was used (intraclass correlation coefficient (ICC), 0.96) than that when a box with no grid was used (ICC, 0.78). Intrarater reliability, which was calculated by the retinal hemorrhage area measured on two different days, was also higher (ICC, 0.97) than that with no grid (ICC, 0.86). Interrater reliability for five fundus pictures with poor image quality was also good when a grid with 14 squares was used (ICC, 0.88). Conclusions. Although our method is subjective, excellent interrater and intrarater reliabilities indicate that this method can be adapted for clinical use. PMID:27867657

4. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT

SciTech Connect

Prusa, Joseph

2012-05-08

This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the physics of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer- reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited.

5. Parallel Domain Connectivity Algorithm for Unsteady Flow Computations using Overlapping and Adaptive Grids

DTIC Science & Technology

2010-01-01

ARC3DC code employs third-order temporal discretizations using a multi-stage Runge – Kutta time-stepping framework and is capable of up to fifth-order...lean cache-friendly data structure and flow solution procedures for isotropic Carte- sian grids and (2) explicit time stepping (using 3-stage Runge ...fringes and holes (termed hole-cutting) can be done in one of two ways, explicitly or implicitly. Explicit hole cutting means the hole boundaries are

6. Parallel Unsteady Overset Mesh Methodology for Adaptive and Moving Grids with Multiple Solvers

DTIC Science & Technology

2010-01-01

Runge - Kutta time-stepping framework and is capable of up to fifth-order accurate spatial discretizations. Further, the Cartesian grids in the off-body are...no user intervention or explicit hole-map specification is necessary. The capabilities and performance of the package are presented for several test...connectivity approaches have been investigated in the past by various research groups . The prominent among them are PEGASUS5 [5], OVERFLOW-DCF [6, 7], SUGGAR

DTIC Science & Technology

2008-08-21

a multi-stage Runge - Kutta time-stepping framework and is capable of up to fifth-order accurate spatial discretizations. Further, the Cartesian grids...cutting methodology such that no user inter- vention or explicit hole-map specification is necessary. The capabilities and performance of the package are...application to rotorcraft aerodynamics. Several Domain-Connectivity approaches have been investigated in the past by various research groups . The

8. Newton-Krylov-Schwarz methods in unstructured grid Euler flow

SciTech Connect

Keyes, D.E.

1996-12-31

Newton-Krylov methods and Krylov-Schwarz (domain decomposition) methods have begun to become established in computational fluid dynamics (CFD) over the past decade. The former employ a Krylov method inside of Newton`s method in a Jacobian-free manner, through directional differencing. The latter employ an overlapping Schwarz domain decomposition to derive a preconditioner for the Krylov accelerator that relies primarily on local information, for data-parallel concurrency. They may be composed as Newton-Krylov-Schwarz (NKS) methods, which seem particularly well suited for solving nonlinear elliptic systems in high-latency, distributed-memory environments. We give a brief description of this family of algorithms, with an emphasis on domain decomposition iterative aspects. We then describe numerical simulations with Newton-Krylov-Schwarz methods on an aerodynamic application emphasizing comparisons with a standard defect-correction approach and subdomain preconditioner consistency.

9. Franck-Condon Factors for Diatomics: Insights and Analysis Using the Fourier Grid Hamiltonian Method

ERIC Educational Resources Information Center

Ghosh, Supriya; Dixit, Mayank Kumar; Bhattacharyya, S. P.; Tembe, B. L.

2013-01-01

Franck-Condon factors (FCFs) play a crucial role in determining the intensities of the vibrational bands in electronic transitions. In this article, a relatively simple method to calculate the FCFs is illustrated. An algorithm for the Fourier Grid Hamiltonian (FGH) method for computing the vibrational wave functions and the corresponding energy…

10. A Cartesian grid method for simulation of the unsteady aerodynamics of microscale flapping flight

Emblemsvag, Jo-Einar

Recent improvements in MEMS technology is making it possible to develop microscale mechanical devices capable of operating in gases and liquids at low Reynolds number. In the current work a method has been developed to be able to simulate the operation of such devices computationally. The method imposes arbitrary solid/fluid boundaries on Cartesian grids, thus avoiding complexities with body-fitted grid methods. This thesis explains the numerical approximations used for solving the governing equations, the discretization of the equations, and the implementation of the immersed fluid/solid boundary conditions. The method is validated by comparing computed results of flows over an infinitely thin plate, a cylinder, and a sphere, and it is found that the method predicts both steady and unsteady flows with sufficient accuracy. The method performs similarly whether the solid objects translates through the grid or remains fixed in the grid with an imposed flow field. The method was then used to compute the fluid dynamics and force generation of a microscale flapping cantilever beam propulsion device. Both two-dimensional and three-dimensional flow features were explored, and the investigation showed that the cantilever produces thrust and can therefore potentially be used as a simple propulsion mechanism. Finally, the method was used to simulate an idealized model of fruit fly wing in hovering flight. The computed flow fields and force dynamics compared well with an equivalent experimental model, although some discrepancies were found due to a thicker wing being used in the computations for numerical reasons.

11. Online Optimization Method for Operation of Generators in a Micro Grid

Hayashi, Yasuhiro; Miyamoto, Hideki; Matsuki, Junya; Iizuka, Toshio; Azuma, Hitoshi

Recently a lot of studies and developments about distributed generator such as photovoltaic generation system, wind turbine generation system and fuel cell have been performed under the background of the global environment issues and deregulation of the electricity market, and the technique of these distributed generators have progressed. Especially, micro grid which consists of several distributed generators, loads and storage battery is expected as one of the new operation system of distributed generator. However, since precipitous load fluctuation occurs in micro grid for the reason of its smaller capacity compared with conventional power system, high-accuracy load forecasting and control scheme to balance of supply and demand are needed. Namely, it is necessary to improve the precision of operation in micro grid by observing load fluctuation and correcting start-stop schedule and output of generators online. But it is not easy to determine the operation schedule of each generator in short time, because the problem to determine start-up, shut-down and output of each generator in micro grid is a mixed integer programming problem. In this paper, the authors propose an online optimization method for the optimal operation schedule of generators in micro grid. The proposed method is based on enumeration method and particle swarm optimization (PSO). In the proposed method, after picking up all unit commitment patterns of each generators satisfied with minimum up time and minimum down time constraint by using enumeration method, optimal schedule and output of generators are determined under the other operational constraints by using PSO. Numerical simulation is carried out for a micro grid model with five generators and photovoltaic generation system in order to examine the validity of the proposed method.

12. Reducing the dimensionality of grid based methods for electron-atom scattering calculations below ionization threshold

Benda, Jakub; Houfek, Karel

2017-04-01

For total energies below the ionization threshold it is possible to dramatically reduce the computational burden of the solution of the electron-atom scattering problem based on grid methods combined with the exterior complex scaling. As in the R-matrix method, the problem can be split into the inner and outer problem, where the outer problem considers only the energetically accessible asymptotic channels. The (N + 1)-electron inner problem is coupled to the one-electron outer problems for every channel, resulting in a matrix that scales only linearly with size of the outer grid.

13. An h-adaptive finite element method for turbulent heat transfer

SciTech Connect

Carriington, David B

2009-01-01

A two-equation turbulence closure model (k-{omega}) using an h-adaptive grid technique and finite element method (FEM) has been developed to simulate low Mach flow and heat transfer. These flows are applicable to many flows in engineering and environmental sciences. Of particular interest in the engineering modeling areas are: combustion, solidification, and heat exchanger design. Flows for indoor air quality modeling and atmospheric pollution transport are typical types of environmental flows modeled with this method. The numerical method is based on a hybrid finite element model using an equal-order projection process. The model includes thermal and species transport, localized mesh refinement (h-adaptive) and Petrov-Galerkin weighting for the stabilizing the advection. This work develops the continuum model of a two-equation turbulence closure method. The fractional step solution method is stated along with the h-adaptive grid method (Carrington and Pepper, 2002). Solutions are presented for 2d flow over a backward-facing step.

14. A Multi-Grid Iterative Method for Photoacoustic Tomography.

PubMed

Javaherian, Ashkan; Holman, Sean

2016-11-04

Inspired by the recent advances on minimizing nonsmooth or bound-constrained convex functions on models using varying degrees of fidelity, we propose a line search multigrid (MG) method for full-wave iterative image reconstruction in photoacoustic tomography (PAT) in heterogeneous media. To compute the search direction at each iteration, we decide between the gradient at the target level, or alternatively an approximate error correction at a coarser level, relying on some predefined criteria. To incorporate absorption and dispersion, we derive the analytical adjoint directly from the first-order acoustic wave system. The effectiveness of the proposed method is tested on a total-variation penalized Iterative Shrinkage Thresholding algorithm (ISTA) and its accelerated variant (FISTA), which have been used in many studies of image reconstruction in PAT. The results show the great potential of the proposed method in improving speed of iterative image reconstruction.

15. Adaptive eigenspace method for inverse scattering problems in the frequency domain

Grote, Marcus J.; Kray, Marie; Nahum, Uri

2017-02-01

A nonlinear optimization method is proposed for the solution of inverse scattering problems in the frequency domain, when the scattered field is governed by the Helmholtz equation. The time-harmonic inverse medium problem is formulated as a PDE-constrained optimization problem and solved by an inexact truncated Newton-type iteration. Instead of a grid-based discrete representation, the unknown wave speed is projected to a particular finite-dimensional basis of eigenfunctions, which is iteratively adapted during the optimization. Truncating the adaptive eigenspace (AE) basis at a (small and slowly increasing) finite number of eigenfunctions effectively introduces regularization into the inversion and thus avoids the need for standard Tikhonov-type regularization. Both analytical and numerical evidence underpins the accuracy of the AE representation. Numerical experiments demonstrate the efficiency and robustness to missing or noisy data of the resulting adaptive eigenspace inversion method.

16. Adaptive Transmission Planning: Implementing a New Paradigm for Managing Economic Risks in Grid Expansion

SciTech Connect

Hobbs, Benjamin F.; Xu, Qingyu; Ho, Jonathan; Donohoo, Pearl; Kasina, Saamrat; Ouyang, Jasmine; Park, Sang Woo; Eto, Joseph; Satyal, Vijay

2016-07-01

The problem of whether, where, when, and what types of transmission facilities to build in terms of minimizing costs and maximizing net economic benefits has been a challenge for the power industry from the beginning-ever since Thomas Edison debated whether to create longer dc distribution lines (with their high losses) or build new power stations in expanding his urban markets. Today's planning decisions are far more complex, as grids cover the continent and new transmission, generation, and demand-side technologies emerge.

17. High resolution finite volume methods on arbitrary grids via wave propagation

NASA Technical Reports Server (NTRS)

Leveque, Randall J.

1987-01-01

A generalization of Godunov's method for systems of conservation laws has been developed and analyzed that can be applied with arbitrary time steps on arbitrary grids in one space dimension. Stability for arbitrary time steps is achieved by allowing waves to propagate through more than one mesh cell in a time step. The method is extended here to second order accuracy and to a finite volume method in two space dimensions. This latter method is based on solving one dimensional normal and tangential Riemann problems at cell interfaces and again propagating waves through one or more mesh cells. By avoiding the usual time step restriction of explicit methods, it is possible to use reasonable time steps on irregular grids where the minimum cell area is much smaller than the average cell. Boundary conditions for the Euler equations are discussed and special attention is given to the case of a Cartesian grid cut by an irregular boundary. In this case small grid cells arise only near the boundary, and it is desirable to use a time step appropriate for the regular interior cells. Numerical results in two dimensions show that this can be achieved.

18. A staggered overset grid method for resolved simulation of incompressible flow around moving spheres

Vreman, A. W.

2017-03-01

An overset grid method for resolved simulation of incompressible (turbulent) flows around moving spherical particles is presented. The Navier-Stokes equations in spherical coordinates are solved on body-fitted spherical polar grids attached to the moving spheres. These grids are overset on a fixed Cartesian background grid, where the Navier-Stokes equations in Cartesian coordinates are solved. The standard second-order staggered finite difference scheme is used on each grid. The velocities and pressures on different grids are coupled by third-order Lagrange interpolations. The method, implemented in the form of a Message Passing Interface parallel program, has been validated for a range of flows around spheres. In a first validation section, the results of simulations of four Stokes flows around a single moving sphere are compared with classical analytical results. The first three cases are the flows due to a translating, an oscillating sphere and a rotating sphere. The numerically produced velocity and pressure fields appear to converge to the corresponding (transient) analytical solutions in the maximum norm. The fourth Stokes case is the flow due to an instantaneously accelerated sphere. For this case, the results are compared with the corresponding numerical solution of the Basset-Boussinesq-Oseen equation. In a second validation section, results of three Navier-Stokes flows around one or more moving spheres are presented. These test configurations are a moving face-centered cubic array of spheres, laminar channel flow with a falling a sphere, and freely moving small spheres in a Taylor-Green flow. Results for the flow with the falling sphere are compared with the results from the literature on immersed boundary methods.

19. A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Solution of the Euler Equations

SciTech Connect

Anderson, R W; Elliott, N S; Pember, R B

2003-02-14

A new method that combines staggered grid arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. The novel components of the methods are driven by the need to reconcile traditional AMR techniques with the staggered variables and moving, deforming meshes associated with Lagrange based ALE schemes. We develop interlevel solution transfer operators and interlevel boundary conditions first in the case of purely Lagrangian hydrodynamics, and then extend these ideas into an ALE method by developing adaptive extensions of elliptic mesh relaxation techniques. Conservation properties of the method are analyzed, and a series of test problem calculations are presented which demonstrate the utility and efficiency of the method.

20. High-order finite-volume methods for hyperbolic conservation laws on mapped multiblock grids

McCorquodale, P.; Dorr, M. R.; Hittinger, J. A. F.; Colella, P.

2015-05-01

We present an approach to solving hyperbolic conservation laws by finite-volume methods on mapped multiblock grids, extending the approach of Colella, Dorr, Hittinger, and Martin (2011) [10] for grids with a single mapping. We consider mapped multiblock domains for mappings that are conforming at inter-block boundaries. By using a smooth continuation of the mapping into ghost cells surrounding a block, we reduce the inter-block communication problem to finding an accurate, robust interpolation into these ghost cells from neighboring blocks. We demonstrate fourth-order accuracy for the advection equation for multiblock coordinate systems in two and three dimensions.

1. High-order finite-volume methods for hyperbolic conservation laws on mapped multiblock grids

DOE PAGES

McCorquodale, P. W.; Colella, P.; Dorr, M. R.; ...

2015-01-13

We present an approach to solving hyperbolic conservation laws by finite-volume methods on mapped multiblock grids, extending the approach of Colella, Dorr, Hittinger, and Martin (2011) [10] for grids with a single mapping. We consider mapped multiblock domains for mappings that are conforming at inter-block boundaries. By using a smooth continuation of the mapping into ghost cells surrounding a block, we reduce the inter-block communication problem to finding an accurate, robust interpolation into these ghost cells from neighboring blocks. Lastly, we demonstrate fourth-order accuracy for the advection equation for multiblock coordinate systems in two and three dimensions.

2. Slat Noise Predictions Using Higher-Order Finite-Difference Methods on Overset Grids

NASA Technical Reports Server (NTRS)

Housman, Jeffrey A.; Kiris, Cetin

2016-01-01

Computational aeroacoustic simulations using the structured overset grid approach and higher-order finite difference methods within the Launch Ascent and Vehicle Aerodynamics (LAVA) solver framework are presented for slat noise predictions. The simulations are part of a collaborative study comparing noise generation mechanisms between a conventional slat and a Krueger leading edge flap. Simulation results are compared with experimental data acquired during an aeroacoustic test in the NASA Langley Quiet Flow Facility. Details of the structured overset grid, numerical discretization, and turbulence model are provided.

3. A comparison between different fractal grid generation methods coupled with lattice Boltzmann approach

Chiappini, D.; Donno, A.

2016-06-01

In this paper we present a comparison of three different grids generated with a fractal method and used for fluid dynamic simulations through a kinetic approach. We start from the theoretical element definition and we introduce some optimizations in order to fulfil requirements. The study is performed with analysing results both in terms of friction factor at different Reynolds regimes and streamlines paths.

4. Calculation method for line loss in 10kV distribution grid planning

Xiao, Ming-hui; Lin, Ling-xue; Liu, Si-yuan

2017-01-01

Distribution grid line loss index is an important indicator of running and managing a distribution grid. A general feature in distribution network is its difficulty in gathering data about structure and operation. Based on its feature, this paper proposed a method for calculating line loss in 10kV distribution grid from the perspective of planning. According to the characteristics of power consumption on different location of the feeder, line loss can be divided into three parts, including the main line loss, the loss of branch line and the loss of distribution transformer. The proposed method achieved quick calculation and component analysis. Distributed coefficient was calculated by analyzing different distributed situation of load on feeder and the equivalent loss power on main line was calculated. Branch line and distribution transformer were equivalent to a resistance located at the head of the line to match the real power consumption. With the data acquirement, accuracy can be improved. Finally, the example of different power supply zone was calculated based on the method. The comparison between the calculated results and technical guidelines of southern power grid indicated the components of the line loss and put forward solutions for loss reduction. The method proposed overcame disadvantage of strong dependence on complete and precise data, which fits for planning work.

5. Comments on numerical solution of boundary value problems of the Laplace equation and calculation of eigenvalues by the grid method

NASA Technical Reports Server (NTRS)

Lyusternik, L. A.

1980-01-01

The mathematics involved in numerically solving for the plane boundary value of the Laplace equation by the grid method is developed. The approximate solution of a boundary value problem for the domain of the Laplace equation by the grid method consists of finding u at the grid corner which satisfies the equation at the internal corners (u=Du) and certain boundary value conditions at the boundary corners.

6. Impact of Load Balancing on Unstructured Adaptive Grid Computations for Distributed-Memory Multiprocessors

NASA Technical Reports Server (NTRS)

Sohn, Andrew; Biswas, Rupak; Simon, Horst D.

1996-01-01

The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn, requires significant data movement at runtime. We present a new dynamic load-balancing framework, called JOVE, that balances the workload across all processors with a global view. Whenever the computational mesh is adapted, JOVE is activated to eliminate the load imbalance. JOVE has been implemented on an IBM SP2 distributed-memory machine in MPI for portability. Experimental results for two model meshes demonstrate that mesh adaption with load balancing gives more than a sixfold improvement over one without load balancing. We also show that JOVE gives a 24-fold speedup on 64 processors compared to sequential execution.

7. Predictive uncertainty analysis of plume distribution for geological carbon sequestration using sparse-grid Bayesian method

Shi, X.; Zhang, G.

2013-12-01

Because of the extensive computational burden, parametric uncertainty analyses are rarely conducted for geological carbon sequestration (GCS) process based multi-phase models. The difficulty of predictive uncertainty analysis for the CO2 plume migration in realistic GCS models is not only due to the spatial distribution of the caprock and reservoir (i.e. heterogeneous model parameters), but also because the GCS optimization estimation problem has multiple local minima due to the complex nonlinear multi-phase (gas and aqueous), and multi-component (water, CO2, salt) transport equations. The geological model built by Doughty and Pruess (2004) for the Frio pilot site (Texas) was selected and assumed to represent the 'true' system, which was composed of seven different facies (geological units) distributed among 10 layers. We chose to calibrate the permeabilities of these facies. Pressure and gas saturation values from this true model were then extracted and used as observations for subsequent model calibration. Random noise was added to the observations to approximate realistic field conditions. Each simulation of the model lasts about 2 hours. In this study, we develop a new approach that improves computational efficiency of Bayesian inference by constructing a surrogate system based on an adaptive sparse-grid stochastic collocation method. This surrogate response surface global optimization algorithm is firstly used to calibrate the model parameters, then prediction uncertainty of the CO2 plume position is quantified due to the propagation from parametric uncertainty in the numerical experiments, which is also compared to the actual plume from the 'true' model. Results prove that the approach is computationally efficient for multi-modal optimization and prediction uncertainty quantification for computationally expensive simulation models. Both our inverse methodology and findings can be broadly applicable to GCS in heterogeneous storage formations.

8. A conservative staggered-grid Chebyshev multidomain method for compressible flows

NASA Technical Reports Server (NTRS)

Kopriva, David A.; Kolias, John H.

1995-01-01

We present a new multidomain spectral collocation method that uses staggered grids for the solution of compressible flow problems. The solution unknowns are defined at the nodes of a Gauss quadrature rule. The fluxes are evaluated at the nodes of a Gauss-Lobatto rule. The method is conservative, free-stream preserving, and exponentially accurate. A significant advantage of the method is that subdomain corners are not included in the approximation, making solutions in complex geometries easier to compute.

9. A User's Guide to AMR1D: An Instructional Adaptive Mesh Refinement Code for Unstructured Grids

NASA Technical Reports Server (NTRS)

deFainchtein, Rosalinda

1996-01-01

This report documents the code AMR1D, which is currently posted on the World Wide Web (http://sdcd.gsfc.nasa.gov/ESS/exchange/contrib/de-fainchtein/adaptive _mesh_refinement.html). AMR1D is a one-dimensional finite element fluid-dynamics solver, capable of adaptive mesh refinement (AMR). It was written as an instructional tool for AMR on unstructured mesh codes. It is meant to illustrate the minimum requirements for AMR on more than one dimension. For that purpose, it uses the same type of data structure that would be necessary on a two-dimensional AMR code (loosely following the algorithm described by Lohner).

10. A Load Frequency Control in an Off-Grid Sustainable Power System Based on a Parameter Adaptive PID-Type Fuzzy Controller

Ronilaya, Ferdian; Miyauchi, Hajime

2014-10-01

This paper presents a new implementation of a parameter adaptive PID-type fuzzy controller (PAPIDfc) for a grid-supporting inverter of battery to alleviate frequency fluctuations in a wind-diesel power system. A variable speed wind turbine that drives a permanent magnet synchronous generator is assumed for demonstrations. The PAPIDfc controller is built from a set of control rules that adopts the droop method and uses only locally measurable frequency signal. The output control signal is determined from the knowledge base and the fuzzy inference. The input-derivative gain and the output-integral gain of the PAPIDfc are tuned online. To ensure safe battery operating limits, we also propose a protection scheme called intelligent battery protection (IBP). Several simulation experiments are performed by using MATLAB®/SimPowersystems™. Next, to verify the scheme's effectiveness, the simulation results are compared with the results of conventional controllers. The results demonstrate the effectiveness of the PAPIDfc scheme to control a grid-supporting inverter of the battery in the reduction of frequency fluctuations.

11. A Reconstructed Discontinuous Galerkin Method for the Compressible Flows on Unstructured Tetrahedral Grids

SciTech Connect

Hong Luo; Yidong Xia; Robert Nourgaliev; Chunpei Cai

2011-06-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on unstructured tetrahedral grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on unstructured grids. The preliminary results indicate that this RDG method is stable on unstructured tetrahedral grids, and provides a viable and attractive alternative for the discretization of the viscous and heat fluxes in the Navier-Stokes equations.

12. Some advanced parametric methods for assessing waveform distortion in a smart grid with renewable generation

Alfieri, Luisa

2015-12-01

Power quality (PQ) disturbances are becoming an important issue in smart grids (SGs) due to the significant economic consequences that they can generate on sensible loads. However, SGs include several distributed energy resources (DERs) that can be interconnected to the grid with static converters, which lead to a reduction of the PQ levels. Among DERs, wind turbines and photovoltaic systems are expected to be used extensively due to the forecasted reduction in investment costs and other economic incentives. These systems can introduce significant time-varying voltage and current waveform distortions that require advanced spectral analysis methods to be used. This paper provides an application of advanced parametric methods for assessing waveform distortions in SGs with dispersed generation. In particular, the Standard International Electrotechnical Committee (IEC) method, some parametric methods (such as Prony and Estimation of Signal Parameters by Rotational Invariance Technique (ESPRIT)), and some hybrid methods are critically compared on the basis of their accuracy and the computational effort required.

13. ADAPTIVE-GRID SIMULATION OF GROUNDWATER FLOW IN HETEROGENEOUS AQUIFERS. (R825689C068)

EPA Science Inventory

## Abstract

The prediction of contaminant transport in porous media requires the computation of the flow velocity. This work presents a methodology for high-accuracy computation of flow in a heterogeneous isotropic formation, employing a dual-flow formulation and adaptive...

14. Grid-based methods for biochemical ab initio quantum chemical applications

SciTech Connect

Colvin, M.E.; Nelson, J.S.; Mori, E.

1997-01-01

A initio quantum chemical methods are seeing increased application in a large variety of real-world problems including biomedical applications ranging from drug design to the understanding of environmental mutagens. The vast majority of these quantum chemical methods are {open_quotes}spectral{close_quotes}, that is they describe the charge distribution around the nuclear framework in terms of a fixed analytic basis set. Despite the additional complexity they bring, methods involving grid representations of the electron or solvent charge can provide more efficient schemes for evaluating spectral operators, inexpensive methods for calculating electron correlation, and methods for treating the electrostatic energy of salvation in polar solvents. The advantage of mixed or {open_quotes}pseudospectral{close_quotes} methods is that they allow individual non-linear operators in the partial differential equations, such as coulomb operators, to be calculated in the most appropriate regime. Moreover, these molecular grids can be used to integrate empirical functionals of the electron density. These so-called density functional methods (DFT) are an extremely promising alternative to conventional post-Hartree Fock quantum chemical methods. The introduction of a grid at the molecular solvent-accessible surface allows a very sophisticated treatment of a polarizable continuum solvent model (PCM). Where most PCM approaches use a truncated expansion of the solute`s electric multipole expansion, e.g. net charge (Born model) or dipole moment (Onsager model), such a grid-based boundary-element method (BEM) yields a nearly exact treatment of the solute`s electric field. This report describes the use of both DFT and BEM methods in several biomedical chemical applications.

15. Vertical Scan (V-SCAN) for 3-D Grid Adaptive Mesh Refinement for an atmospheric Model Dynamical Core

Andronova, N. G.; Vandenberg, D.; Oehmke, R.; Stout, Q. F.; Penner, J. E.

2009-12-01

One of the major building blocks of a rigorous representation of cloud evolution in global atmospheric models is a parallel adaptive grid MPI-based communication library (an Adaptive Blocks for Locally Cartesian Topologies library -- ABLCarT), which manages the block-structured data layout, handles ghost cell updates among neighboring blocks and splits a block as refinements occur. The library has several modules that provide a layer of abstraction for adaptive refinement: blocks, which contain individual cells of user data; shells - the global geometry for the problem, including a sphere, reduced sphere, and now a 3D sphere; a load balancer for placement of blocks onto processors; and a communication support layer which encapsulates all data movement. A major performance concern with adaptive mesh refinement is how to represent calculations that have need to be sequenced in a particular order in a direction, such as calculating integrals along a specific path (e.g. atmospheric pressure or geopotential in the vertical dimension). This concern is compounded if the blocks have varying levels of refinement, or are scattered across different processors, as can be the case in parallel computing. In this paper we describe an implementation in ABLCarT of a vertical scan operation, which allows computing along vertical paths in the correct order across blocks transparent to their resolution and processor location. We test this functionality on a 2D and a 3D advection problem, which tests the performance of the model’s dynamics (transport) and physics (sources and sinks) for different model resolutions needed for inclusion of cloud formation.

16. The multigrid POTFIT (MGPF) method: grid representations of potentials for quantum dynamics of large systems.

PubMed

Peláez, Daniel; Meyer, Hans-Dieter

2013-01-07

In this article, a new method, multigrid POTFIT (MGPF), is presented. MGPF is a grid-based algorithm which transforms a general potential energy surface into product form, that is, a sum of products of one-dimensional functions. This form is necessary to profit from the computationally advantageous multiconfiguration time-dependent Hartree method for quantum dynamics. MGPF circumvents the dimensionality related issues present in POTFIT [A. Jäckle and H.-D. Meyer, J. Chem. Phys. 104, 7974 (1996)], allowing quantum dynamical studies of systems up to about 12 dimensions. MGPF requires the definition of a fine grid and a coarse grid, the latter being a subset of the former. The MGPF approximation relies on a series of underlying POTFIT calculations on grids which are smaller than the fine one and larger than or equal to the coarse one. This aspect makes MGPF a bit less accurate than POTFIT but orders of magnitude faster and orders of magnitude less memory demanding than POTFIT. Moreover, like POTFIT, MGPF is variational and provides an efficient error control.

17. Application of multi-grid method on the simulation of incremental forging processes

2016-10-01

Numerical simulation becomes essential in manufacturing large part by incremental forging processes. It is a splendid tool allowing to show physical phenomena however behind the scenes, an expensive bill should be paid, that is the computational time. That is why many techniques are developed to decrease the computational time of numerical simulation. Multi-Grid method is a numerical procedure that permits to reduce computational time of numerical calculation by performing the resolution of the system of equations on several mesh of decreasing size which allows to smooth faster the low frequency of the solution as well as its high frequency. In this paper a Multi-Grid method is applied to cogging process in the software Forge 3. The study is carried out using increasing number of degrees of freedom. The results shows that calculation time is divide by two for a mesh of 39,000 nodes. The method is promising especially if coupled with Multi-Mesh method.

18. Comparison of Kriging and LOCFIT methods for interpolating gridded passive microwave brightness temperatures

Brodzik, M. J.; Savoie, M. H.; Armstrong, R. L.

2007-12-01

Satellite passive microwave brightness temperatures (TBs) are used as the basis for measuring various land surface properties, including soil moisture and snow water equivalent. The current satellite record of brightness temperatures includes data from the SMMR, SSM/I and AMSR-E instruments, beginning in 1978 and continuing to the present day. These sensors fly on satellite platforms in sun-synchronous, polar orbits, providing near-daily global coverage of the Earth. Due to the satellite geometry, surface locations at high latitudes receive better than daily coverage, while locations at lower latitudes are observed less frequently. We have compiled a nearly 30- year record of daily, gridded passive microwave temperatures, but the lack of daily coverage from the respective sensors makes the compilation of daily derived products complicated. Techniques we have used in the past have been performed after deriving the desired geophysical parameter, and have included last-in compilations and piecewise, linear interpolation of missing snow water equivalent between days with legitimate observations. The advantages of these methods are that they are relatively simple to implement, but they suffer from not making use of any known physical spatial correlations at the brightness temperature level with neighboring locations for the data being interpolated. Our study will compare two spatial interpolation methods at the gridded brightness temperature level that take advantage of spatial and temporal correlation: kriging methods and local polynomial (LOCFIT) fitting. Our study area includes a subset of Equal-Area Scalable Earth Grid (EASE-Grid) brightness temperatures, for a region that includes portions of the Western United States and Canada, for two weeks in both January and July, for the period of record. Results of this analysis will ultimately increase our skill in filling in the gaps in microwave coverage, thus improving existing gridded brightness temperature data sets

19. MANGO – Modal Analysis for Grid Operation: A Method for Damping Improvement through Operating Point Adjustment

SciTech Connect

Huang, Zhenyu; Zhou, Ning; Tuffner, Francis K.; Chen, Yousu; Trudnowski, Daniel J.; Diao, Ruisheng; Fuller, Jason C.; Mittelstadt, William A.; Hauer, John F.; Dagle, Jeffery E.

2010-10-18

Small signal stability problems are one of the major threats to grid stability and reliability in the U.S. power grid. An undamped mode can cause large-amplitude oscillations and may result in system breakups and large-scale blackouts. There have been several incidents of system-wide oscillations. Of those incidents, the most notable is the August 10, 1996 western system breakup, a result of undamped system-wide oscillations. Significant efforts have been devoted to monitoring system oscillatory behaviors from measurements in the past 20 years. The deployment of phasor measurement units (PMU) provides high-precision, time-synchronized data needed for detecting oscillation modes. Measurement-based modal analysis, also known as ModeMeter, uses real-time phasor measurements to identify system oscillation modes and their damping. Low damping indicates potential system stability issues. Modal analysis has been demonstrated with phasor measurements to have the capability of estimating system modes from both oscillation signals and ambient data. With more and more phasor measurements available and ModeMeter techniques maturing, there is yet a need for methods to bring modal analysis from monitoring to actions. The methods should be able to associate low damping with grid operating conditions, so operators or automated operation schemes can respond when low damping is observed. The work presented in this report aims to develop such a method and establish a Modal Analysis for Grid Operation (MANGO) procedure to aid grid operation decision making to increase inter-area modal damping. The procedure can provide operation suggestions (such as increasing generation or decreasing load) for mitigating inter-area oscillations.

20. A METHOD OF TREATING UNSTRUCTURED CONCAVE CELLS IN STAGGERED-GRID LAGRANGIAN HYDRODYNAMICS

SciTech Connect

C. ROUSCULP; D. BURTON

2000-12-01

A method is proposed for the treatment of concave cells in staggered-grid Lagrangian hydrodynamics. The method is general enough to be applied to two- and three-dimensional unstructured cells. Instead of defining a cell-point as the geometric average of its nodes (a cell-center), the cell-point is that which equalizes the triangular/tetrahedral area/volume in two/three dimensions. Examples are given.

1. Grid flexibility and patching techniques

NASA Technical Reports Server (NTRS)

Keith, T. G.; Smith, L. W.; Yung, C. N.; Barthelson, S. H.; Dewitt, K. J.

1984-01-01

The numerical determination of combustor flowfields is of great value to the combustor designer. An a priori knowledge of the flow behavior can speed the combustor design process and reduce the number of experimental test rigs required to arrive at an optimal design. Even 2-D steady incompressible isothermal flow predictions are of use; many codes of this kind are available, each employing different techniques to surmount the difficulties arising from the nonlinearity of the governing equations and from typically irregular combustor geometries. Mapping techniques (algebraic and elliptic PDE), and adaptive grid methods (both multi-grid and grid embedding) as applied to axisymmetric combustors are discussed.

2. An Adaptive and Implicit Immersed Boundary Method for Cardiovascular Device Modeling

Bhalla, Amneet Pal S.; Griffith, Boyce E.

2015-11-01

Computer models and numerical simulations are playing an increasingly important role in understanding the mechanics of fluid-structure interactions (FSI) in cardiovascular devices. To model cardiac devices realistically, there is a need to solve the classical fluid-structure interaction equations efficiently. Peskin's explicit immersed boundary method is one such approach to model FSI equations for elastic structures efficiently. However, in the presence of rigid structures the IB method faces a severe timestep restriction. To overcome this limitation, we are developing an implicit version of immersed boundary method on adaptive Cartesian grids. Higher grid resolution is employed in spatial regions occupying the structure while relatively coarser discretization is used elsewhere. The resulting discrete system is solved using geometric multigrid solver for the combined Stokes and elasticity operators. We use a rediscretization approach for standard finite difference approximations to the divergence, gradient, and viscous stress. In contrast, coarse grid versions of the Eulerian elasticity operator are constructed via a Galerkin approach. The implicit IB method is tested for a pulse duplicator cardiac device system that consists of both rigid mountings and elastic membrane.

3. A Method for Severely Constrained Item Selection in Adaptive Testing.

ERIC Educational Resources Information Center

Stocking, Martha L.; Swanson, Len

1993-01-01

A method is presented for incorporating a large number of constraints on adaptive item selection in the construction of computerized adaptive tests. The method, which emulates practices of expert test specialists, is illustrated for verbal and quantitative measures. Its foundation is application of a weighted deviations model and algorithm. (SLD)

4. Solution-adaptive finite element method in computational fracture mechanics

NASA Technical Reports Server (NTRS)

Min, J. B.; Bass, J. M.; Spradley, L. W.

1993-01-01

Some recent results obtained using solution-adaptive finite element method in linear elastic two-dimensional fracture mechanics problems are presented. The focus is on the basic issue of adaptive finite element method for validating the applications of new methodology to fracture mechanics problems by computing demonstration problems and comparing the stress intensity factors to analytical results.

5. Adaptive method for electron bunch profile prediction

SciTech Connect

Scheinker, Alexander; Gessner, Spencer

2015-10-01

We report on an experiment performed at the Facility for Advanced Accelerator Experimental Tests (FACET) at SLAC National Accelerator Laboratory, in which a new adaptive control algorithm, one with known, bounded update rates, despite operating on analytically unknown cost functions, was utilized in order to provide quasi-real-time bunch property estimates of the electron beam. Multiple parameters, such as arbitrary rf phase settings and other time-varying accelerator properties, were simultaneously tuned in order to match a simulated bunch energy spectrum with a measured energy spectrum. The simple adaptive scheme was digitally implemented using matlab and the experimental physics and industrial control system. The main result is a nonintrusive, nondestructive, real-time diagnostic scheme for prediction of bunch profiles, as well as other beam parameters, the precise control of which are important for the plasma wakefield acceleration experiments being explored at FACET. © 2015 authors. Published by the American Physical Society.

6. Adaptive method for electron bunch profile prediction

Scheinker, Alexander; Gessner, Spencer

2015-10-01

We report on an experiment performed at the Facility for Advanced Accelerator Experimental Tests (FACET) at SLAC National Accelerator Laboratory, in which a new adaptive control algorithm, one with known, bounded update rates, despite operating on analytically unknown cost functions, was utilized in order to provide quasi-real-time bunch property estimates of the electron beam. Multiple parameters, such as arbitrary rf phase settings and other time-varying accelerator properties, were simultaneously tuned in order to match a simulated bunch energy spectrum with a measured energy spectrum. The simple adaptive scheme was digitally implemented using matlab and the experimental physics and industrial control system. The main result is a nonintrusive, nondestructive, real-time diagnostic scheme for prediction of bunch profiles, as well as other beam parameters, the precise control of which are important for the plasma wakefield acceleration experiments being explored at FACET.

7. Adaptive finite element methods in electrochemistry.

PubMed

Gavaghan, David J; Gillow, Kathryn; Süli, Endre

2006-12-05

In this article, we review some of our previous work that considers the general problem of numerical simulation of the currents at microelectrodes using an adaptive finite element approach. Microelectrodes typically consist of an electrode embedded (or recessed) in an insulating material. For all such electrodes, numerical simulation is made difficult by the presence of a boundary singularity at the electrode edge (where the electrode meets the insulator), manifested by the large increase in the current density at this point, often referred to as the edge effect. Our approach to overcoming this problem has involved the derivation of an a posteriori bound on the error in the numerical approximation for the current that can be used to drive an adaptive mesh-generation algorithm, allowing calculation of the quantity of interest (the current) to within a prescribed tolerance. We illustrate the generic applicability of the approach by considering a broad range of steady-state applications of the technique.

8. A Cartesian Grid Generation Method Considering a Complicated Cell Geometry at the Body Surface

Lahur, Paulus R.; Nakamura, Yoshiaki

A cell-splitting method for Cartesian grid generation that has the capability of taking into account the cases of thin body and sharp edge is proposed in this paper. Such cases are frequently found when solving the flow around a very thin wing, such as that of a supersonic transport (SST). The method has also been extended to treat the problem of multiple solid regions within a cell, which is sometimes encountered at a highly curved body surface. Validation of the method proposed here is carried out on a sharp, thin double wedge in a supersonic flow, where significant improvements in accuracy are achieved at the cost of a small increase in the number of cells. Furthermore, application of the present method to a model of SST shows its effectiveness on a three-dimensional, realistic geometry. As a result of making a pseudo-planar approximation for body surface elements, the total number of body surface elements was reduced by a factor of about 3.2 in this application. Local grid refinement by relocating grid cells to a curved surface is also proposed, so that a more accurate solution is obtained with a reasonable number of cells.

9. The direct Discontinuous Galerkin method for the compressible Navier-Stokes equations on arbitrary grids

Yang, Xiaoquan; Cheng, Jian; Liu, Tiegang; Luo, Hong

2015-11-01

The direct discontinuous Galerkin (DDG) method based on a traditional discontinuous Galerkin (DG) formulation is extended and implemented for solving the compressible Navier-Stokes equations on arbitrary grids. Compared to the widely used second Bassi-Rebay (BR2) scheme for the discretization of diffusive fluxes, the DDG method has two attractive features: first, it is simple to implement as it is directly based on the weak form, and therefore there is no need for any local or global lifting operator; second, it can deliver comparable results, if not better than BR2 scheme, in a more efficient way with much less CPU time. Two approaches to perform the DDG flux for the Navier- Stokes equations are presented in this work, one is based on conservative variables, the other is based on primitive variables. In the implementation of the DDG method for arbitrary grid, the definition of mesh size plays a critical role as the formation of viscous flux explicitly depends on the geometry. A variety of test cases are presented to demonstrate the accuracy and efficiency of the DDG method for discretizing the viscous fluxes in the compressible Navier-Stokes equations on arbitrary grids.

10. Parallel-wire grid assembly with method and apparatus for construction thereof

DOEpatents

Lewandowski, Edward F.; Vrabec, John

1984-01-01

Disclosed is a parallel wire grid and an apparatus and method for making the same. The grid consists of a generally coplanar array of parallel spaced-apart wires secured between metallic frame members by an electrically conductive epoxy. The method consists of continuously winding a wire about a novel winding apparatus comprising a plurality of spaced-apart generally parallel spindles. Each spindle is threaded with a number of predeterminedly spaced-apart grooves which receive and accurately position the wire at predetermined positions along the spindle. Overlying frame members coated with electrically conductive epoxy are then placed on either side of the wire array and are drawn together. After the epoxy hardens, portions of the wire array lying outside the frame members are trimmed away.

11. Parallel-wire grid assembly with method and apparatus for construction thereof

DOEpatents

Lewandowski, E.F.; Vrabec, J.

1981-10-26

Disclosed is a parallel wire grid and an apparatus and method for making the same. The grid consists of a generally coplanar array of parallel spaced-apart wires secured between metallic frame members by an electrically conductive epoxy. The method consists of continuously winding a wire about a novel winding apparatus comprising a plurality of spaced-apart generally parallel spindles. Each spindle is threaded with a number of predeterminedly spaced-apart grooves which receive and accurately position the wire at predetermined positions along the spindle. Overlying frame members coated with electrically conductive epoxy are then placed on either side of the wire array and are drawn together. After the epoxy hardens, portions of the wire array lying outside the frame members are trimmed away.

12. Action research to improve methods of delivery and feedback in an Access Grid Room environment

McArthur, Lynne C.; Klass, Lara; Eberhard, Andrew; Stacey, Andrew

2011-12-01

This article describes a qualitative study which was undertaken to improve the delivery methods and feedback opportunity in honours mathematics lectures which are delivered through Access Grid Rooms. Access Grid Rooms are facilities that provide two-way video and audio interactivity across multiple sites, with the inclusion of smart boards. The principal aim was to improve the student learning experience, given the new environment. The specific aspects of the course delivery that the study focused on included presentation of materials and provision of opportunities for interaction between the students and between students and lecturers. The practical considerations in the delivery of distance learning are well documented in the literature, and similar problems arise in the Access Grid Room environment; in particular, those of limited access to face-to-face interaction and the reduction in peer support. The nature of the Access Grid Room classes implies that students studying the same course can be physically situated in different cities, and possibly in different countries. When studying, it is important that students have opportunity to discuss new concepts with others; particularly their peers and their lecturer. The Access Grid Room environment also presents new challenges for the lecturer, who must learn new skills in the delivery of materials. The unique nature of Access Grid Room technology offers unprecedented opportunity for effective course delivery and positive outcomes for students, and was developed in response to a need to be able to interact with complex data, other students and the instructor, in real-time, at a distance and from multiple sites. This is a relatively new technology and as yet there has been little or no studies specifically addressing the use and misuse of the technology. The study found that the correct placement of cameras and the use of printed material and smart boards were all crucial to the student experience. In addition, the

13. Adaptive methods, rolling contact, and nonclassical friction laws

NASA Technical Reports Server (NTRS)

Oden, J. T.

1989-01-01

Results and methods on three different areas of contemporary research are outlined. These include adaptive methods, the rolling contact problem for finite deformation of a hyperelastic or viscoelastic cylinder, and non-classical friction laws for modeling dynamic friction phenomena.

14. Precision grid survey apparatus and method for the mapping of hidden ferromagnetic structures

DOEpatents

von Wimmerspeg, Udo

2004-11-16

The present invention is for a precision grid surveyor having a stationary unit and a roving unit. The stationary unit has a light source unit that emits a light beam and a rotator to project the light beam toward detectors on a roving unit. The roving unit moves over an area to be surveyed. Further the invention is for a method of mapping details of hidden underground iron pipelines, and more particularly the location of bell joints.

NASA Technical Reports Server (NTRS)

Stowers, S. T.; Bass, J. M.; Oden, J. T.

1993-01-01

A phase 2 research and development effort was conducted in area transonic, compressible, inviscid flows with an ultimate goal of numerically modeling complex flows inherent in advanced helicopter blade designs. The algorithms and methodologies therefore are classified as adaptive methods, which are error estimation techniques for approximating the local numerical error, and automatically refine or unrefine the mesh so as to deliver a given level of accuracy. The result is a scheme which attempts to produce the best possible results with the least number of grid points, degrees of freedom, and operations. These types of schemes automatically locate and resolve shocks, shear layers, and other flow details to an accuracy level specified by the user of the code. The phase 1 work involved a feasibility study of h-adaptive methods for steady viscous flows, with emphasis on accurate simulation of vortex initiation, migration, and interaction. Phase 2 effort focused on extending these algorithms and methodologies to a three-dimensional topology.

16. A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

SciTech Connect

Hong Luo; Luqing Luo; Robert Nourgaliev; Vincent A. Mousseau

2010-09-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier–Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier–Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi–Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier–Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier–Stokes equations.

17. A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

SciTech Connect

Hong Luo; Luqing Luo; Robert Nourgaliev; Vincent A. Mousseau

2010-01-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi-Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier-Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier-Stokes equations.

18. A conservative finite volume method for incompressible Navier-Stokes equations on locally refined nested Cartesian grids

Sifounakis, Adamandios; Lee, Sangseung; You, Donghyun

2016-12-01

A second-order-accurate finite-volume method is developed for the solution of incompressible Navier-Stokes equations on locally refined nested Cartesian grids. Numerical accuracy and stability on locally refined nested Cartesian grids are achieved using a finite-volume discretization of the incompressible Navier-Stokes equations based on higher-order conservation principles - i.e., in addition to mass and momentum conservation, kinetic energy conservation in the inviscid limit is used to guide the selection of the discrete operators and solution algorithms. Hanging nodes at the interface are virtually slanted to improve the pressure-velocity projection, while the other parts of the grid maintain an orthogonal Cartesian grid topology. The present method is straight-forward to implement and shows superior conservation of mass, momentum, and kinetic energy compared to the conventional methods employing interpolation at the interface between coarse and fine grids.

19. B-spline methods and zonal grids for numerical simulations of turbulent flows

Kravchenko, Arthur Grigorievich

1998-12-01

A novel numerical technique is developed for simulations of complex turbulent flows on zonal embedded grids. This technique is based on the Galerkin method with basis functions constructed using B-splines. The technique permits fine meshes to be embedded in physically significant flow regions without placing a large number of grid points in the rest of the computational domain. The numerical technique has been tested successfully in simulations of a fully developed turbulent channel flow. Large eddy simulations of turbulent channel flow at Reynolds numbers up to Rec = 110,000 (based on centerline velocity and channel half-width) show good agreement with the existing experimental data. These tests indicate that the method provides an efficient information transfer between zones without accumulation of errors in the regions of sudden grid changes. The numerical solutions on multi-zone grids are of the same accuracy as those on a single-zone grid but require less computer resources. The performance of the numerical method in a generalized coordinate system is assessed in simulations of laminar flows over a circular cylinder at low Reynolds numbers and three-dimensional simulations at ReD = 300 (based on free-stream velocity and cylinder diameter). The drag coefficients, the size of the recirculation region, and the vortex shedding frequency all agree well with the experimental data and previous simulations of these flows. Large eddy simulations of a flow over a circular cylinder at a sub-critical Reynolds number, ReD = 3900, are performed and compared with previous upwind-biased and central finite-difference computations. In the very near-wake, all three simulations are in agreement with each other and agree fairly well with the PIV experimental data of Lourenco & Shih (1993). Farther downstream, the results of the B- spline computations are in better agreement with the hot- wire experiment of Ong & Wallace (1996) than those obtained in finite-difference simulations

20. An Adaptive Discontinuous Galerkin Method for Modeling Atmospheric Convection (Preprint)

DTIC Science & Technology

2011-04-13

Giraldo and Volkmar Wirth 5 SENSITIVITY STUDIES One important question for each adaptive numerical model is: how accurate is the adaptive method? For...this criterion that is used later for some sensitivity studies . These studies include a comparison between a simulation on an adaptive mesh with a...simulation on a uniform mesh and a sensitivity study concerning the size of the refinement region. 5.1 Comparison Criterion For comparing different

1. Application of Parallel Adjoint-Based Error Estimation and Anisotropic Grid Adaptation for Three-Dimensional Aerospace Configurations

NASA Technical Reports Server (NTRS)

Lee-Rausch, E. M.; Park, M. A.; Jones, W. T.; Hammond, D. P.; Nielsen, E. J.

2005-01-01

2. Numerical Simulation of Unsteady Flow Field around Helicopter in Forward Flight Using a Parallel Dynamic Overset Unstructured Grids Method

Tian, Shuling; Wu, Yizhao; Xia, Jian

A parallel Navier-Stokes solver based on dynamic overset unstructured grids method is presented to simulate the unsteady turbulent flow field around helicopter in forward flight. The grid method has the advantages of unstructured grid and Chimera grid and is suitable to deal with multiple bodies in relatively moving. Unsteady Navier-Stokes equations are solved on overset unstructured grids by an explicit dual time-stepping, finite volume method. Preconditioning method applied to inner iteration of the dual-time stepping is used to speed up the convergence of numerical simulation. The Spalart-Allmaras one-equation turbulence model is used to evaluate the turbulent viscosity. Parallel computation is based on the dynamic domain decomposition method in overset unstructured grids system at each physical time step. A generic helicopter Robin with a four-blade rotor in forward flight is considered to validate the method presented in this paper. Numerical simulation results show that the parallel dynamic overset unstructured grids method is very efficient for the simulation of helicopter flow field and the results are reliable.

3. A conservative staggered-grid Chebyshev multidomain method for compressible flows

SciTech Connect

Kopriva, D.A.; Kolias, J.H.

1996-04-01

The authors present a new multidomain spectral collocation method that uses a staggered grid for the solution of compressible flow problems. The solution unknowns are defined at the nodes of a Gauss quadrature rule. The fluxes are evaluated at the nodes of a Gauss-Lobatto rule. The method is conservative, free-stream preserving, and exponentially accurate. A significant advantage of the method is that subdomain corners are not included in the approximation, making solutions in complex geometries easier to compute. 41 refs., 23 figs., 1 tab.

4. Prediction and Control of Network Cascade: Example of Power Grid or Networking Adaptability from WMD Disruption and Cascading Failures

SciTech Connect

Chertkov, Michael

2012-07-24

The goal of the DTRA project is to develop a mathematical framework that will provide the fundamental understanding of network survivability, algorithms for detecting/inferring pre-cursors of abnormal network behaviors, and methods for network adaptability and self-healing from cascading failures.

DOEpatents

Archer, Daniel E.; Beauchamp, Brock R.; Mauger, G. Joseph; Nelson, Karl E.; Mercer, Michael B.; Pletcher, David C.; Riot, Vincent J.; Schek, James L.; Knapp, David A.

2006-06-20

A portable radioactive-material detection system capable of detecting radioactive sources moving at high speeds. The system has at least one radiation detector capable of detecting gamma-radiation and coupled to an MCA capable of collecting spectral data in very small time bins of less than about 150 msec. A computer processor is connected to the MCA for determining from the spectral data if a triggering event has occurred. Spectral data is stored on a data storage device, and a power source supplies power to the detection system. Various configurations of the detection system may be adaptably arranged for various radiation detection scenarios. In a preferred embodiment, the computer processor operates as a server which receives spectral data from other networked detection systems, and communicates the collected data to a central data reporting system.

6. An adaptive pseudospectral method for discontinuous problems

NASA Technical Reports Server (NTRS)

Augenbaum, Jeffrey M.

1988-01-01

The accuracy of adaptively chosen, mapped polynomial approximations is studied for functions with steep gradients or discontinuities. It is shown that, for steep gradient functions, one can obtain spectral accuracy in the original coordinate system by using polynomial approximations in a transformed coordinate system with substantially fewer collocation points than are necessary using polynomial expansion directly in the original, physical, coordinate system. It is also shown that one can avoid the usual Gibbs oscillation associated with steep gradient solutions of hyperbolic pde's by approximation in suitably chosen coordinate systems. Continuous, high gradient solutions are computed with spectral accuracy (as measured in the physical coordinate system). Discontinuous solutions associated with nonlinear hyperbolic equations can be accurately computed by using an artificial viscosity chosen to smooth out the solution in the mapped, computational domain. Thus, shocks can be effectively resolved on a scale that is subgrid to the resolution available with collocation only in the physical domain. Examples with Fourier and Chebyshev collocation are given.

7. On the Analysis of Multistep-Out-of-Grid Method for Celestial Mechanics Tasks

Olifer, L.; Choliy, V.

2016-09-01

Occasionally, there is a necessity in high-accurate prediction of celestial body trajectory. The most common way to do that is to solve Kepler's equation analytically or to use Runge-Kutta or Adams integrators to solve equation of motion numerically. For low-orbit satellites, there is a critical need in accounting geopotential and another forces which influence motion. As the result, the right side of equation of motion becomes much bigger, and classical integrators will not be quite effective. On the other hand, there is a multistep-out-of-grid (MOG) method which combines Runge-Kutta and Adams methods. The MOG method is based on using m on-grid values of the solution and n × m off-grid derivative estimations. Such method could provide stable integrators of maximum possible order, O (hm+mn+n-1). The main subject of this research was to implement and analyze the MOG method for solving satellite equation of motion with taking into account Earth geopotential model (ex. EGM2008 (Pavlis at al., 2008)) and with possibility to add other perturbations such as atmospheric drag or solar radiation pressure. Simulations were made for satellites on low orbit and with various eccentricities (from 0.1 to 0.9). Results of the MOG integrator were compared with results of Runge-Kutta and Adams integrators. It was shown that the MOG method has better accuracy than classical ones of the same order and less right-hand value estimations when is working on high orders. That gives it some advantage over "classical" methods.

8. A High-Order Method Using Unstructured Grids for the Aeroacoustic Analysis of Realistic Aircraft Configurations

NASA Technical Reports Server (NTRS)

Atkins, Harold L.; Lockard, David P.

1999-01-01

A method for the prediction of acoustic scatter from complex geometries is presented. The discontinuous Galerkin method provides a framework for the development of a high-order method using unstructured grids. The method's compact form contributes to its accuracy and efficiency, and makes the method well suited for distributed memory parallel computing platforms. Mesh refinement studies are presented to validate the expected convergence properties of the method, and to establish the absolute levels of a error one can expect at a given level of resolution. For a two-dimensional shear layer instability wave and for three-dimensional wave propagation, the method is demonstrated to be insensitive to mesh smoothness. Simulations of scatter from a two-dimensional slat configuration and a three-dimensional blended-wing-body demonstrate the capability of the method to efficiently treat realistic geometries.

9. Adaptive mesh strategies for the spectral element method

NASA Technical Reports Server (NTRS)

Mavriplis, Catherine

1992-01-01

An adaptive spectral method was developed for the efficient solution of time dependent partial differential equations. Adaptive mesh strategies that include resolution refinement and coarsening by three different methods are illustrated on solutions to the 1-D viscous Burger equation and the 2-D Navier-Stokes equations for driven flow in a cavity. Sharp gradients, singularities, and regions of poor resolution are resolved optimally as they develop in time using error estimators which indicate the choice of refinement to be used. The adaptive formulation presents significant increases in efficiency, flexibility, and general capabilities for high order spectral methods.

10. Three-Dimensional High-Order Spectral Finite Volume Method for Unstructured Grids

NASA Technical Reports Server (NTRS)

Liu, Yen; Vinokur, Marcel; Wang, Z. J.; Kwak, Dochan (Technical Monitor)

2002-01-01

Many areas require a very high-order accurate numerical solution of conservation laws for complex shapes. This paper deals with the extension to three dimensions of the Spectral Finite Volume (SV) method for unstructured grids, which was developed to solve such problems. We first summarize the limitations of traditional methods such as finite-difference, and finite-volume for both structured and unstructured grids. We then describe the basic formulation of the spectral finite volume method. What distinguishes the SV method from conventional high-order finite-volume methods for unstructured triangular or tetrahedral grids is the data reconstruction. Instead of using a large stencil of neighboring cells to perform a high-order reconstruction, the stencil is constructed by partitioning each grid cell, called a spectral volume (SV), into 'structured' sub-cells, called control volumes (CVs). One can show that if all the SV cells are partitioned into polygonal or polyhedral CV sub-cells in a geometrically similar manner, the reconstructions for all the SVs become universal, irrespective of their shapes, sizes, orientations, or locations. It follows that the reconstruction is reduced to a weighted sum of unknowns involving just a few simple adds and multiplies, and those weights are universal and can be pre-determined once for all. The method is thus very efficient, accurate, and yet geometrically flexible. The most critical part of the SV method is the partitioning of the SV into CVs. In this paper we present the partitioning of a tetrahedral SV into polyhedral CVs with one free parameter for polynomial reconstructions up to degree of precision five. (Note that the order of accuracy of the method is one order higher than the reconstruction degree of precision.) The free parameter will be determined by minimizing the Lebesgue constant of the reconstruction matrix or similar criteria to obtain optimized partitions. The details of an efficient, parallelizable code to solve

11. LDRD Final Report: Adaptive Methods for Laser Plasma Simulation

SciTech Connect

Dorr, M R; Garaizar, F X; Hittinger, J A

2003-01-29

The goal of this project was to investigate the utility of parallel adaptive mesh refinement (AMR) in the simulation of laser plasma interaction (LPI). The scope of work included the development of new numerical methods and parallel implementation strategies. The primary deliverables were (1) parallel adaptive algorithms to solve a system of equations combining plasma fluid and light propagation models, (2) a research code implementing these algorithms, and (3) an analysis of the performance of parallel AMR on LPI problems. The project accomplished these objectives. New algorithms were developed for the solution of a system of equations describing LPI. These algorithms were implemented in a new research code named ALPS (Adaptive Laser Plasma Simulator) that was used to test the effectiveness of the AMR algorithms on the Laboratory's large-scale computer platforms. The details of the algorithm and the results of the numerical tests were documented in an article published in the Journal of Computational Physics [2]. A principal conclusion of this investigation is that AMR is most effective for LPI systems that are ''hydrodynamically large'', i.e., problems requiring the simulation of a large plasma volume relative to the volume occupied by the laser light. Since the plasma-only regions require less resolution than the laser light, AMR enables the use of efficient meshes for such problems. In contrast, AMR is less effective for, say, a single highly filamented beam propagating through a phase plate, since the resulting speckle pattern may be too dense to adequately separate scales with a locally refined mesh. Ultimately, the gain to be expected from the use of AMR is highly problem-dependent. One class of problems investigated in this project involved a pair of laser beams crossing in a plasma flow. Under certain conditions, energy can be transferred from one beam to the other via a resonant interaction with an ion acoustic wave in the crossing region. AMR provides an

12. A hybrid wavelet-based adaptive immersed boundary finite-difference lattice Boltzmann method for two-dimensional fluid-structure interaction

Cui, Xiongwei; Yao, Xiongliang; Wang, Zhikai; Liu, Minghao

2017-03-01

A second generation wavelet-based adaptive finite-difference Lattice Boltzmann method (FD-LBM) is developed in this paper. In this approach, the adaptive wavelet collocation method (AWCM) is firstly, to the best of our knowledge, incorporated into the FD-LBM. According to the grid refinement criterion based on the wavelet amplitudes of density distribution functions, an adaptive sparse grid is generated by the omission and addition of collocation points. On the sparse grid, the finite differences are used to approximate the derivatives. To eliminate the special treatments in using the FD-based derivative approximation near boundaries, the immersed boundary method (IBM) is also introduced into FD-LBM. By using the adaptive technique, the adaptive code requires much less grid points as compared to the uniform-mesh code. As a consequence, the computational efficiency can be improved. To justify the proposed method, a series of test cases, including fixed boundary cases and moving boundary cases, are invested. A good agreement between the present results and the data in previous literatures is obtained, which demonstrates the accuracy and effectiveness of the present AWCM-IB-LBM.

13. Computation of variably saturated subsurface flow by adaptive mixed hybrid finite element methods

Bause, M.; Knabner, P.

2004-06-01

We present adaptive mixed hybrid finite element discretizations of the Richards equation, a nonlinear parabolic partial differential equation modeling the flow of water into a variably saturated porous medium. The approach simultaneously constructs approximations of the flux and the pressure head in Raviart-Thomas spaces. The resulting nonlinear systems of equations are solved by a Newton method. For the linear problems of the Newton iteration a multigrid algorithm is used. We consider two different kinds of error indicators for space adaptive grid refinement: superconvergence and residual based indicators. They can be calculated easily by means of the available finite element approximations. This seems attractive for computations since no additional (sub-)problems have to be solved. Computational experiments conducted for realistic water table recharge problems illustrate the effectiveness and robustness of the approach.

14. Grid Effect on Spherical Shallow Water Jets Using Continuous and Discontinuous Galerkin Methods

DTIC Science & Technology

2013-01-01

set of common grids used in global circulation models (GCMs). Specifically, we study 1) the cubed-sphere ( Hex ) (Sadourny 1972), 2) the icosahedron (Ico...dimensional model NUMA. The logically structured Hex and Lat-Lon grids can be advantageous for a finite difference based solver, and are generally usable by...grid to grid. The gnomonic projection by Ronchi et al. (1996) was used to build the high order grids. In what follows, we describe how the RLL, Hex

15. A ROBUST ARBITRARILY HIGH ORDER TRANSPORT METHOD OF THE CHARACTERISTIC TYPE FOR UNSTRUCTURED TETRAHEDRAL GRIDS

SciTech Connect

R. M. Ferrer; Y. Y. Azmy

2009-05-01

We present a robust arbitrarily high order transport method of the characteristic type for unstructured tetrahedral grids. Previously encountered difficulties have been addressed through the reformulation of the method based on coordinate transformations, evaluation of the moments balance relation as a linear system of equations involving the expansion coefficients of the projected basis, and the asymptotic expansion of the integral kernels in the thin cell limit. The proper choice of basis functions for the high-order spatial expansion of the solution is discussed and its effect on problems involving scattering discussed. Numerical tests are presented to illustrate the beneficial effect of these improvements, and the improved robustness they yield.

16. An Adaptive Finite Difference Method for Hyperbolic Systems in OneSpace Dimension

SciTech Connect

1982-06-01

Many problems of physical interest have solutions which are generally quite smooth in a large portion of the region of interest, but have local phenomena such as shocks, discontinuities or large gradients which require much more accurate approximations or finer grids for reasonable accuracy. Examples are atmospheric fronts, ocean currents, and geological discontinuities. In this thesis we develop and partially analyze an adaptive finite difference mesh refinement algorithm for the initial boundary value problem for hyperbolic systems in one space dimension. The method uses clusters of uniform grids which can ''move'' along with pulses or steep gradients appearing in the calculation, and which are superimposed over a uniform coarse grid. Such refinements are created, destroyed, merged, separated, recursively nested or moved based on estimates of the local truncation error. We use a four-way linked tree and sequentially allocated deques (double-ended queues) to perform these operations efficiently. The local truncation error in the interior of the region is estimated using a three-step Richardson extrapolation procedure, which can also be considered a deferred correction method. At the boundaries we employ differences to estimate the error. Our algorithm was implemented using a portable, extensible Fortran preprocessor, to which we added records and pointers. The method is applied to three model problems: the first order wave equation, the second order wave equation, and the inviscid Burgers equation. For the first two model problems our algorithm is shown to be three to five times more efficient (in computing time) than the use of a uniform coarse mesh, for the same accuracy. Furthermore, to our knowledge, our algorithm is the only one which adaptively treats time-dependent boundary conditions for hyperbolic systems.

17. Advanced Unstructured Grid Generation for Complex Aerodynamic Applications

NASA Technical Reports Server (NTRS)

2008-01-01

A new approach for distribution of grid points on the surface and in the volume has been developed and implemented in the NASA unstructured grid generation code VGRID. In addition to the point and line sources of prior work, the new approach utilizes surface and volume sources for automatic curvature-based grid sizing and convenient point distribution in the volume. A new exponential growth function produces smoother and more efficient grids and provides superior control over distribution of grid points in the field. All types of sources support anisotropic grid stretching which not only improves the grid economy but also provides more accurate solutions for certain aerodynamic applications. The new approach does not require a three-dimensional background grid as in the previous methods. Instead, it makes use of an efficient bounding-box auxiliary medium for storing grid parameters defined by surface sources. The new approach is less memory-intensive and more efficient computationally. The grids generated with the new method either eliminate the need for adaptive grid refinement for certain class of problems or provide high quality initial grids that would enhance the performance of many adaptation methods.

18. GridMan: A grid manipulation system

NASA Technical Reports Server (NTRS)

Eiseman, Peter R.; Wang, Zhu

1992-01-01

GridMan is an interactive grid manipulation system. It operates on grids to produce new grids which conform to user demands. The input grids are not constrained to come from any particular source. They may be generated by algebraic methods, elliptic methods, hyperbolic methods, parabolic methods, or some combination of methods. The methods are included in the various available structured grid generation codes. These codes perform the basic assembly function for the various elements of the initial grid. For block structured grids, the assembly can be quite complex due to a large number of clock corners, edges, and faces for which various connections and orientations must be properly identified. The grid generation codes are distinguished among themselves by their balance between interactive and automatic actions and by their modest variations in control. The basic form of GridMan provides a much more substantial level of grid control and will take its input from any of the structured grid generation codes. The communication link to the outside codes is a data file which contains the grid or section of grid.

19. The adaptive EVP method for solving the sea ice momentum equation

Kimmritz, Madlen; Danilov, Sergey; Losch, Martin

2016-05-01

Stability and convergence of the modified EVP implementation of the visco-plastic sea ice rheology by Bouillon et al., Ocean Modell., 2013, is analyzed on B- and C-grids. It is shown that the implementation on a B-grid is less restrictive with respect to stability requirements than on a C-grid. On C-grids convergence is sensitive to the discretization of the viscosities. We suggest to adaptively vary the parameters of pseudotime subcycling of the modified EVP scheme in time and space to satisfy local stability constraints. This new approach generally improves the convergence of the modified EVP scheme and hence its numerical efficiency. The performance of the new "adaptive EVP" approach is illustrated in a series of experiments with the sea ice component of the MIT general circulation model (MITgcm) that is formulated on a C-grid.

20. Adaptive Kernel Based Machine Learning Methods

DTIC Science & Technology

2012-10-15

multiscale collocation method with a matrix compression strategy to discretize the system of integral equations and then use the multilevel...augmentation method to solve the resulting discrete system. A priori and a posteriori 1 parameter choice strategies are developed for thesemethods. The...performance of the proximity algo- rithms for the L1/TV denoising model. This leads us to a new characterization of all solutions to the L1/TV model via fixed

1. An adaptive, formally second order accurate version of the immersed boundary method

Griffith, Boyce E.; Hornung, Richard D.; McQueen, David M.; Peskin, Charles S.

2007-04-01

Like many problems in biofluid mechanics, cardiac mechanics can be modeled as the dynamic interaction of a viscous incompressible fluid (the blood) and a (visco-)elastic structure (the muscular walls and the valves of the heart). The immersed boundary method is a mathematical formulation and numerical approach to such problems that was originally introduced to study blood flow through heart valves, and extensions of this work have yielded a three-dimensional model of the heart and great vessels. In the present work, we introduce a new adaptive version of the immersed boundary method. This adaptive scheme employs the same hierarchical structured grid approach (but a different numerical scheme) as the two-dimensional adaptive immersed boundary method of Roma et al. [A multilevel self adaptive version of the immersed boundary method, Ph.D. Thesis, Courant Institute of Mathematical Sciences, New York University, 1996; An adaptive version of the immersed boundary method, J. Comput. Phys. 153 (2) (1999) 509-534] and is based on a formally second order accurate (i.e., second order accurate for problems with sufficiently smooth solutions) version of the immersed boundary method that we have recently described [B.E. Griffith, C.S. Peskin, On the order of accuracy of the immersed boundary method: higher order convergence rates for sufficiently smooth problems, J. Comput. Phys. 208 (1) (2005) 75-105]. Actual second order convergence rates are obtained for both the uniform and adaptive methods by considering the interaction of a viscous incompressible flow and an anisotropic incompressible viscoelastic shell. We also present initial results from the application of this methodology to the three-dimensional simulation of blood flow in the heart and great vessels. The results obtained by the adaptive method show good qualitative agreement with simulation results obtained by earlier non-adaptive versions of the method, but the flow in the vicinity of the model heart valves

2. A Cartesian Adaptive Level Set Method for Two-Phase Flows

NASA Technical Reports Server (NTRS)

Ham, F.; Young, Y.-N.

2003-01-01

In the present contribution we develop a level set method based on local anisotropic Cartesian adaptation as described in Ham et al. (2002). Such an approach should allow for the smallest possible Cartesian grid capable of resolving a given flow. The remainder of the paper is organized as follows. In section 2 the level set formulation for free surface calculations is presented and its strengths and weaknesses relative to the other free surface methods reviewed. In section 3 the collocated numerical method is described. In section 4 the method is validated by solving the 2D and 3D drop oscilation problem. In section 5 we present some results from more complex cases including the 3D drop breakup in an impulsively accelerated free stream, and the 3D immiscible Rayleigh-Taylor instability. Conclusions are given in section 6.

3. Adaptive upscaling with the dual mesh method

SciTech Connect

Guerillot, D.; Verdiere, S.

1997-08-01

The objective of this paper is to demonstrate that upscaling should be calculated during the flow simulation instead of trying to enhance the a priori upscaling methods. Hence, counter-examples are given to motivate our approach, the so-called Dual Mesh Method. The main steps of this numerical algorithm are recalled. Applications illustrate the necessity to consider different average relative permeability values depending on the direction in space. Moreover, these values could be different for the same average saturation. This proves that an a priori upscaling cannot be the answer even in homogeneous cases because of the {open_quotes}dynamical heterogeneity{close_quotes} created by the saturation profile. Other examples show the efficiency of the Dual Mesh Method applied to heterogeneous medium and to an actual field case in South America.

4. Study on model current predictive control method of PV grid- connected inverters systems with voltage sag

Jin, N.; Yang, F.; Shang, S. Y.; Tao, T.; Liu, J. S.

2016-08-01

According to the limitations of the LVRT technology of traditional photovoltaic inverter existed, this paper proposes a low voltage ride through (LVRT) control method based on model current predictive control (MCPC). This method can effectively improve the photovoltaic inverter output characteristics and response speed. The MCPC method of photovoltaic grid-connected inverter designed, the sum of the absolute value of the predictive current and the given current error is adopted as the cost function with the model predictive control method. According to the MCPC, the optimal space voltage vector is selected. Photovoltaic inverter has achieved automatically switches of priority active or reactive power control of two control modes according to the different operating states, which effectively improve the inverter capability of LVRT. The simulation and experimental results proves that the proposed method is correct and effective.

5. Adaptive Finite Element Methods for Continuum Damage Modeling

NASA Technical Reports Server (NTRS)

Min, J. B.; Tworzydlo, W. W.; Xiques, K. E.

1995-01-01

The paper presents an application of adaptive finite element methods to the modeling of low-cycle continuum damage and life prediction of high-temperature components. The major objective is to provide automated and accurate modeling of damaged zones through adaptive mesh refinement and adaptive time-stepping methods. The damage modeling methodology is implemented in an usual way by embedding damage evolution in the transient nonlinear solution of elasto-viscoplastic deformation problems. This nonlinear boundary-value problem is discretized by adaptive finite element methods. The automated h-adaptive mesh refinements are driven by error indicators, based on selected principal variables in the problem (stresses, non-elastic strains, damage, etc.). In the time domain, adaptive time-stepping is used, combined with a predictor-corrector time marching algorithm. The time selection is controlled by required time accuracy. In order to take into account strong temperature dependency of material parameters, the nonlinear structural solution a coupled with thermal analyses (one-way coupling). Several test examples illustrate the importance and benefits of adaptive mesh refinements in accurate prediction of damage levels and failure time.

6. Optimized Equivalent Staggered-grid FD Method for Elastic Wave Modeling Based on Plane Wave Solutions

Yong, Peng; Huang, Jianping; Li, Zhenchun; Liao, Wenyuan; Qu, Luping; Li, Qingyang; Liu, Peijun

2016-12-01

In finite difference (FD) method, numerical dispersion is the dominant factor influencing the accuracy of seismic modeling. Various optimized FD schemes for scalar wave modeling have been proposed to reduce grid dispersion, while the optimized time-space domain FD schemes for elastic wave modeling have not been fully investigated yet. In this paper, an optimized FD scheme with Equivalent Staggered Grid (ESG) for elastic modelling has been developed. We start from the constant P- and S-wave speed elastic wave equations and then deduce analytical plane wave solutions in the wavenumber domain with eigenvalue decomposition method. Based on the elastic plane wave solutions, three new time-space domain dispersion relations of ESG elastic modeling are obtained, which are represented by three equations corresponding to P-, S- and converted wave terms in the elastic equations, respectively. By using these new relations, we can study the dispersion errors of different spatial FD terms independently. The dispersion analysis showed that different spatial FD terms have different errors. It is therefore suggested that different FD coefficients to be used to approximate the three spatial derivative terms. In addition, the relative dispersion error in L2-norm is minimized through optimizing FD coefficients using Newton's method. Synthetic examples have demonstrated that this new optimal FD schemes have superior accuracy for elastic wave modeling compared to Taylor-series expansion and optimized space domain FD schemes.

7. Optimized equivalent staggered-grid FD method for elastic wave modelling based on plane wave solutions

Yong, Peng; Huang, Jianping; Li, Zhenchun; Liao, Wenyuan; Qu, Luping; Li, Qingyang; Liu, Peijun

2017-02-01

In finite-difference (FD) method, numerical dispersion is the dominant factor influencing the accuracy of seismic modelling. Various optimized FD schemes for scalar wave modelling have been proposed to reduce grid dispersion, while the optimized time-space domain FD schemes for elastic wave modelling have not been fully investigated yet. In this paper, an optimized FD scheme with Equivalent Staggered Grid (ESG) for elastic modelling has been developed. We start from the constant P- and S-wave speed elastic wave equations and then deduce analytical plane wave solutions in the wavenumber domain with eigenvalue decomposition method. Based on the elastic plane wave solutions, three new time-space domain dispersion relations of ESG elastic modelling are obtained, which are represented by three equations corresponding to P-, S- and converted-wave terms in the elastic equations, respectively. By using these new relations, we can study the dispersion errors of different spatial FD terms independently. The dispersion analysis showed that different spatial FD terms have different errors. It is therefore suggested that different FD coefficients to be used to approximate the three spatial derivative terms. In addition, the relative dispersion error in L2-norm is minimized through optimizing FD coefficients using Newton's method. Synthetic examples have demonstrated that this new optimal FD schemes have superior accuracy for elastic wave modelling compared to Taylor-series expansion and optimized space domain FD schemes.

8. A Higher-Order Boundary Treatment for Cartesian-Grid Methods

Forrer, Hans; Jeltsch, Rolf

1998-03-01

The Euler equations describe the flow phenomena of compressible inviscid gas dynamics. We simulate such flows using a higher-order Cartesian-grid method, together with a special treatment for the cells cut by the boundary of an object. A new method for the treatment of the boundary is described where these cut boundary cells are maintained as whole cells rather than as cut cells, thus avoiding stability problems. The method is second-order accurate in one dimension and higher-order accurate in two dimensions but not strictly conservative; however, we show that this error in the conservation does not lead to spurious phenomena on some representative test calculations. The advantages of the new boundary treatment are that it is higher-order accurate, that it is independent of the applied method, and that it is simple.

9. An efficient overset grid technique for computational fluid dynamics based on method coupling and feature tracking

Snyder, Richard Dean

A new overset grid method that permits different fluid models to be coupled in a single simulation is presented. High fidelity methods applied in regions of complex fluid flow can be coupled with simpler methods to save computer simulation time without sacrificing accuracy. A mechanism for automatically moving grid zones to track unsteady flow features complements the method. The coupling method is quite general and will support a variety of governing equations and discretization methods. Furthermore, there are no restrictions on the geometrical layout of the coupling. Four sets of governing equations have been implemented to date: the Navier-Stokes, full Euler, Cartesian Euler, and linearized Euler equations. In all cases, the MacCormack explicit predictor-corrector scheme was used to discretize the equations. The overset coupling technique was applied to a variety of configurations in one, two, and three dimensions. Steady configurations include the flow over a bump, a NACA0012 airfoil, and an F-5 wing. Unsteady configurations include two aeroacoustic benchmark problems and a NACA64A006 airfoil with an oscillating simple flap. Solutions obtained with the overset coupling method are compared with other numerical results and, when available, with experimental data. Results from the NACA0012 airfoil and F-5 wing show a 30% reduction in simulation time without a loss of accuracy when the linearized Euler equations were coupled with the full Euler equations. A 25% reduction was recorded for the NACA0012 airfoil when the Euler equations were solved together with the Navier-Stokes equations. Feature tracking was used in the aeroacoustic benchmark and NACA64A006 problems and was found to be very effective in minimizing the dispersion error in the vicinity of shocks. The computer program developed to implement the overset grid method coupling technique was written entirely in C++, an object-oriented programming language. The principles of object-oriented programming were

10. A mass-conserving lattice Boltzmann method with dynamic grid refinement for immiscible two-phase flows

SciTech Connect

Fakhari, Abbas; Geier, Martin; Lee, Taehun

2016-06-15

A mass-conserving lattice Boltzmann method (LBM) for multiphase flows is presented in this paper. The proposed LBM improves a previous model (Lee and Liu, 2010 [21]) in terms of mass conservation, speed-up, and efficiency, and also extends its capabilities for implementation on non-uniform grids. The presented model consists of a phase-field lattice Boltzmann equation (LBE) for tracking the interface between different fluids and a pressure-evolution LBM for recovering the hydrodynamic properties. In addition to the mass conservation property and the simplicity of the algorithm, the advantages of the current phase-field LBE are that it is an order of magnitude faster than the previous interface tracking LBE proposed by Lee and Liu (2010) [21] and it requires less memory resources for data storage. Meanwhile, the pressure-evolution LBM is equipped with a multi-relaxation-time (MRT) collision operator to facilitate attainability of small relaxation rates thereby allowing simulation of multiphase flows at higher Reynolds numbers. Additionally, we reformulate the presented MRT-LBM on nonuniform grids within an adaptive mesh refinement (AMR) framework. Various benchmark studies such as a rising bubble and a falling drop under buoyancy, droplet splashing on a wet surface, and droplet coalescence onto a fluid interface are conducted to examine the accuracy and versatility of the proposed AMR-LBM. The proposed model is further validated by comparing the results with other LB models on uniform grids. A factor of about 20 in savings of computational resources is achieved by using the proposed AMR-LBM. As a more demanding application, the Kelvin–Helmholtz instability (KHI) of a shear-layer flow is investigated for both density-matched and density-stratified binary fluids. The KHI results of the density-matched fluids are shown to be in good agreement with the benchmark AMR results based on the sharp-interface approach. When a density contrast between the two fluids exists, a

11. A mass-conserving lattice Boltzmann method with dynamic grid refinement for immiscible two-phase flows

Fakhari, Abbas; Geier, Martin; Lee, Taehun

2016-06-01

A mass-conserving lattice Boltzmann method (LBM) for multiphase flows is presented in this paper. The proposed LBM improves a previous model (Lee and Liu, 2010 [21]) in terms of mass conservation, speed-up, and efficiency, and also extends its capabilities for implementation on non-uniform grids. The presented model consists of a phase-field lattice Boltzmann equation (LBE) for tracking the interface between different fluids and a pressure-evolution LBM for recovering the hydrodynamic properties. In addition to the mass conservation property and the simplicity of the algorithm, the advantages of the current phase-field LBE are that it is an order of magnitude faster than the previous interface tracking LBE proposed by Lee and Liu (2010) [21] and it requires less memory resources for data storage. Meanwhile, the pressure-evolution LBM is equipped with a multi-relaxation-time (MRT) collision operator to facilitate attainability of small relaxation rates thereby allowing simulation of multiphase flows at higher Reynolds numbers. Additionally, we reformulate the presented MRT-LBM on nonuniform grids within an adaptive mesh refinement (AMR) framework. Various benchmark studies such as a rising bubble and a falling drop under buoyancy, droplet splashing on a wet surface, and droplet coalescence onto a fluid interface are conducted to examine the accuracy and versatility of the proposed AMR-LBM. The proposed model is further validated by comparing the results with other LB models on uniform grids. A factor of about 20 in savings of computational resources is achieved by using the proposed AMR-LBM. As a more demanding application, the Kelvin-Helmholtz instability (KHI) of a shear-layer flow is investigated for both density-matched and density-stratified binary fluids. The KHI results of the density-matched fluids are shown to be in good agreement with the benchmark AMR results based on the sharp-interface approach. When a density contrast between the two fluids exists, a

12. A Reconstructed Discontinuous Galerkin Method for the Compressible Euler Equations on Arbitrary Grids

SciTech Connect

Hong Luo; Luquing Luo; Robert Nourgaliev; Vincent Mousseau

2009-06-01

A reconstruction-based discontinuous Galerkin (DG) method is presented for the solution of the compressible Euler equations on arbitrary grids. By taking advantage of handily available and yet invaluable information, namely the derivatives, in the context of the discontinuous Galerkin methods, a solution polynomial of one degree higher is reconstructed using a least-squares method. The stencils used in the reconstruction involve only the van Neumann neighborhood (face-neighboring cells) and are compact and consistent with the underlying DG method. The resulting DG method can be regarded as an improvement of a recovery-based DG method in the sense that it shares the same nice features as the recovery-based DG method, such as high accuracy and efficiency, and yet overcomes some of its shortcomings such as a lack of flexibility, compactness, and robustness. The developed DG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate the accuracy and efficiency of the method. The numerical results indicate that this reconstructed DG method is able to obtain a third-order accurate solution at a slightly higher cost than its second-order DG method and provide an increase in performance over the third order DG method in terms of computing time and storage requirement.

13. Energy Conserving Forms of Discontinuous Galerkin Algorithms, and Sparse Grid Methods

Hakim, Ammar; Hammett, Greg; Shi, Eric

2016-10-01

A hybrid discontinuous/continuous Galerkin scheme for gyrokinetic equations is presented. Discretizing the Poisson bracket form of the equations, along with a careful choice of basis functions allows conserving the total (particle+field) energy exactly, even with upwinding to reduce artificial oscillations. Straightforward use of tensor basis functions can get expensive in higher dimensions and high polynomial order. Savings might be possible by using basis sets that have fewer monomials and combining these with a version of sparse grid quadrature methods. For example, a tensor product of piecewise parabolic basis functions in 5D involves 243 basis functions per cell, but this drops to 21 basis functions if only second order monomials are needed. Enforcing continuity needed for energy conservation in configuration space might reduce the savings, but would still be a gain over Gaussian quadrature. Our version of sparse grid methods could use non-nested quadrature points as well as well as anisotropic basis. Energy conservation with use of reduced basis sets is discussed. Supported by the Max-Planck/Princeton Center for Plasma Physics, the SciDAC Center for the Study of Plasma Microturbulence, and DOE Contract DE-AC02-09CH11466.

14. A Generalized Grid-Based Fast Multipole Method for Integrating Helmholtz Kernels.

PubMed

Parkkinen, Pauli; Losilla, Sergio A; Solala, Eelis; Toivanen, Elias A; Xu, Wen-Hua; Sundholm, Dage

2017-02-14

A grid-based fast multipole method (GB-FMM) for optimizing three-dimensional (3D) numerical molecular orbitals in the bubbles and cube double basis has been developed and implemented. The present GB-FMM method is a generalization of our recently published GB-FMM approach for numerically calculating electrostatic potentials and two-electron interaction energies. The orbital optimization is performed by integrating the Helmholtz kernel in the double basis. The steep part of the functions in the vicinity of the nuclei is represented by one-center bubbles functions, whereas the remaining cube part is expanded on an equidistant 3D grid. The integration of the bubbles part is treated by using one-center expansions of the Helmholtz kernel in spherical harmonics multiplied with modified spherical Bessel functions of the first and second kind, analogously to the numerical inward and outward integration approach for calculating two-electron interaction potentials in atomic structure calculations. The expressions and algorithms for massively parallel calculations on general purpose graphics processing units (GPGPU) are described. The accuracy and the correctness of the implementation has been checked by performing Hartree-Fock self-consistent-field calculations (HF-SCF) on H2, H2O, and CO. Our calculations show that an accuracy of 10(-4) to 10(-7) Eh can be reached in HF-SCF calculations on general molecules.

15. Advanced Unstructured Grid Generation for Complex Aerodynamic Applications

NASA Technical Reports Server (NTRS)

2010-01-01

A new approach for distribution of grid points on the surface and in the volume has been developed. In addition to the point and line sources of prior work, the new approach utilizes surface and volume sources for automatic curvature-based grid sizing and convenient point distribution in the volume. A new exponential growth function produces smoother and more efficient grids and provides superior control over distribution of grid points in the field. All types of sources support anisotropic grid stretching which not only improves the grid economy but also provides more accurate solutions for certain aerodynamic applications. The new approach does not require a three-dimensional background grid as in the previous methods. Instead, it makes use of an efficient bounding-box auxiliary medium for storing grid parameters defined by surface sources. The new approach is less memory-intensive and more efficient computationally. The grids generated with the new method either eliminate the need for adaptive grid refinement for certain class of problems or provide high quality initial grids that would enhance the performance of many adaptation methods.

16. Progress in unstructured-grid methods development for unsteady aerodynamic applications

NASA Technical Reports Server (NTRS)

Batina, John T.

1992-01-01

The development of unstructured-grid methods for the solution of the equations of fluid flow and what was learned over the course of the research are summarized. The focus of the discussion is on the solution of the time-dependent Euler equations including spatial discretizations, temporal discretizations, and boundary conditions. An example calculation with an implicit upwind method using a CFL number of infinity is presented for the Boeing 747 aircraft. The results were obtained in less than one hour CPU time on a Cray-2 computer, thus, demonstrating the speed and robustness of the capability. Additional calculations for the ONERA M6 wing demonstrate the accuracy of the method through the good agreement between calculated results and experimental data for a standard transonic flow case.

17. [Wavelet NeighShrink method for grid texture removal in image of solar radio bursts].

PubMed

Zhao, Rui-zhen; Hu, Zhan-yi

2007-01-01

The data received from solar bursts contain a lot of noise, which makes further processing more difficult. To remove the noise and enhance the image, we studied the properties of the NeighShrink threshold function and analyzed the influence of neighborhood window size on the denoising result, on the basis of which a new wavelet NeighShrink square root method for image denoising is presented. Firstly, each channel of the solar burst image is normalized, which can, to some extent, remove the horizontal grid texture in the image. Secondly, the preprocessed image is decomposed by wavelet transform, and the obtained wavelet coefficients are thresholded by NeighShrink square root method. Finally, the denoised image is reconstructed by inverse wavelet transform. The experimental results show that the presented method is effective in noise removal and image enhancement.

18. Application of multi-objective controller to optimal tuning of PID gains for a hydraulic turbine regulating system using adaptive grid particle swam optimization.

PubMed

Chen, Zhihuan; Yuan, Yanbin; Yuan, Xiaohui; Huang, Yuehua; Li, Xianshan; Li, Wenwu

2015-05-01

A hydraulic turbine regulating system (HTRS) is one of the most important components of hydropower plant, which plays a key role in maintaining safety, stability and economical operation of hydro-electrical installations. At present, the conventional PID controller is widely applied in the HTRS system for its practicability and robustness, and the primary problem with respect to this control law is how to optimally tune the parameters, i.e. the determination of PID controller gains for satisfactory performance. In this paper, a kind of multi-objective evolutionary algorithms, named adaptive grid particle swarm optimization (AGPSO) is applied to solve the PID gains tuning problem of the HTRS system. This newly AGPSO optimized method, which differs from a traditional one-single objective optimization method, is designed to take care of settling time and overshoot level simultaneously, in which a set of non-inferior alternatives solutions (i.e. Pareto solution) is generated. Furthermore, a fuzzy-based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto set. An illustrative example associated with the best compromise solution for parameter tuning of the nonlinear HTRS system is introduced to verify the feasibility and the effectiveness of the proposed AGPSO-based optimization approach, as compared with two another prominent multi-objective algorithms, i.e. Non-dominated Sorting Genetic Algorithm II (NSGAII) and Strength Pareto Evolutionary Algorithm II (SPEAII), for the quality and diversity of obtained Pareto solutions set. Consequently, simulation results show that this AGPSO optimized approach outperforms than compared methods with higher efficiency and better quality no matter whether the HTRS system works under unload or load conditions.

19. A Comparative Study of Different Reconstruction Schemes for a Reconstructed Discontinuous Galerkin Method on Arbitrary Grids

SciTech Connect

Hong Luo; Hanping Xiao; Robert Nourgaliev; Chunpei Cai

2011-06-01

A comparative study of different reconstruction schemes for a reconstruction-based discontinuous Galerkin, termed RDG(P1P2) method is performed for compressible flow problems on arbitrary grids. The RDG method is designed to enhance the accuracy of the discontinuous Galerkin method by increasing the order of the underlying polynomial solution via a reconstruction scheme commonly used in the finite volume method. Both Green-Gauss and least-squares reconstruction methods and a least-squares recovery method are implemented to obtain a quadratic polynomial representation of the underlying discontinuous Galerkin linear polynomial solution on each cell. These three reconstruction/recovery methods are compared for a variety of compressible flow problems on arbitrary meshes to access their accuracy and robustness. The numerical results demonstrate that all three reconstruction methods can significantly improve the accuracy of the underlying second-order DG method, although the least-squares reconstruction method provides the best performance in terms of both accuracy and robustness.

20. Modeling dam-break flows using finite volume method on unstructured grid

Technology Transfer Automated Retrieval System (TEKTRAN)

Two-dimensional shallow water models based on unstructured finite volume method and approximate Riemann solvers for computing the intercell fluxes have drawn growing attention because of their robustness, high adaptivity to complicated geometry and ability to simulate flows with mixed regimes and di...

1. A Reconstructed Discontinuous Galerkin Method for the Euler Equations on Arbitrary Grids

SciTech Connect

Hong Luo; Luqing Luo; Robert Nourgaliev

2012-11-01

A reconstruction-based discontinuous Galerkin (RDG(P1P2)) method, a variant of P1P2 method, is presented for the solution of the compressible Euler equations on arbitrary grids. In this method, an in-cell reconstruction, designed to enhance the accuracy of the discontinuous Galerkin method, is used to obtain a quadratic polynomial solution (P2) from the underlying linear polynomial (P1) discontinuous Galerkin solution using a least-squares method. The stencils used in the reconstruction involve only the von Neumann neighborhood (face-neighboring cells) and are compact and consistent with the underlying DG method. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG(P1P2) method is third-order accurate, and outperforms the third-order DG method (DG(P2)) in terms of both computing costs and storage requirements.

2. Studies of an Adaptive Kaczmarz Method for Electrical Impedance Imaging

Li, Taoran; Isaacson, David; Newell, Jonathan C.; Saulnier, Gary J.

2013-04-01

We present an adaptive Kaczmarz method for solving the inverse problem in electrical impedance tomography and determining the conductivity distribution inside an object from electrical measurements made on the surface. To best characterize an unknown conductivity distribution and avoid inverting the Jacobian-related term JTJ which could be expensive in terms of memory storage in large scale problems, we propose to solve the inverse problem by adaptively updating both the optimal current pattern with improved distinguishability and the conductivity estimate at each iteration. With a novel subset scheme, the memory-efficient reconstruction algorithm which appropriately combines the optimal current pattern generation and the Kaczmarz method can produce accurate and stable solutions adaptively compared to traditional Kaczmarz and Gauss-Newton type methods. Several reconstruction image metrics are used to quantitatively evaluate the performance of the simulation results.

3. Multilevel Methods for Elliptic Problems with Highly Varying Coefficients on Nonaligned Coarse Grids

SciTech Connect

Scheichl, Robert; Vassilevski, Panayot S.; Zikatanov, Ludmil T.

2012-06-21

We generalize the analysis of classical multigrid and two-level overlapping Schwarz methods for 2nd order elliptic boundary value problems to problems with large discontinuities in the coefficients that are not resolved by the coarse grids or the subdomain partition. The theoretical results provide a recipe for designing hierarchies of standard piecewise linear coarse spaces such that the multigrid convergence rate and the condition number of the Schwarz preconditioned system do not depend on the coefficient variation or on any mesh parameters. One assumption we have to make is that the coarse grids are sufficiently fine in the vicinity of cross points or where regions with large diffusion coefficients are separated by a narrow region where the coefficient is small. We do not need to align them with possible discontinuities in the coefficients. The proofs make use of novel stable splittings based on weighted quasi-interpolants and weighted Poincaré-type inequalities. Finally, numerical experiments are included that illustrate the sharpness of the theoretical bounds and the necessity of the technical assumptions.

4. Assessment of an Unstructured-Grid Method for Predicting 3-D Turbulent Viscous Flows

NASA Technical Reports Server (NTRS)

Frink, Neal T.

1996-01-01

A method Is presented for solving turbulent flow problems on three-dimensional unstructured grids. Spatial discretization Is accomplished by a cell-centered finite-volume formulation using an accurate lin- ear reconstruction scheme and upwind flux differencing. Time is advanced by an implicit backward- Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the sublayer region of the boundary layer. A systematic assessment of the method is presented to devise guidelines for more strategic application of the technology to complex problems. The assessment includes the accuracy In predictions of skin-friction coefficient, law-of-the-wall behavior, and surface pressure for a flat-plate turbulent boundary layer, and for the ONERA M6 wing under a high Reynolds number, transonic, separated flow condition.

5. A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

SciTech Connect

Xia, Yidong; Luo, Hong; Frisbey, Megan; Nourgaliev, Robert

2014-07-01

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flow solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.

6. A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

DOE PAGES

Xia, Yidong; Luo, Hong; Frisbey, Megan; ...

2014-07-01

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flowmore » solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.« less

7. Total enthalpy-based lattice Boltzmann method with adaptive mesh refinement for solid-liquid phase change

Huang, Rongzong; Wu, Huiying

2016-06-01

A total enthalpy-based lattice Boltzmann (LB) method with adaptive mesh refinement (AMR) is developed in this paper to efficiently simulate solid-liquid phase change problem where variables vary significantly near the phase interface and thus finer grid is required. For the total enthalpy-based LB method, the velocity field is solved by an incompressible LB model with multiple-relaxation-time (MRT) collision scheme, and the temperature field is solved by a total enthalpy-based MRT LB model with the phase interface effects considered and the deviation term eliminated. With a kinetic assumption that the density distribution function for solid phase is at equilibrium state, a volumetric LB scheme is proposed to accurately realize the nonslip velocity condition on the diffusive phase interface and in the solid phase. As compared with the previous schemes, this scheme can avoid nonphysical flow in the solid phase. As for the AMR approach, it is developed based on multiblock grids. An indicator function is introduced to control the adaptive generation of multiblock grids, which can guarantee the existence of overlap area between adjacent blocks for information exchange. Since MRT collision schemes are used, the information exchange is directly carried out in the moment space. Numerical tests are firstly performed to validate the strict satisfaction of the nonslip velocity condition, and then melting problems in a square cavity with different Prandtl numbers and Rayleigh numbers are simulated, which demonstrate that the present method can handle solid-liquid phase change problem with high efficiency and accuracy.

8. A Parallel Reconstructed Discontinuous Galerkin Method for the Compressible Flows on Aritrary Grids

SciTech Connect

Hong Luo; Amjad Ali; Robert Nourgaliev; Vincent A. Mousseau

2010-01-01

A reconstruction-based discontinuous Galerkin method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. In this method, an in-cell reconstruction is used to obtain a higher-order polynomial representation of the underlying discontinuous Galerkin polynomial solution and an inter-cell reconstruction is used to obtain a continuous polynomial solution on the union of two neighboring, interface-sharing cells. The in-cell reconstruction is designed to enhance the accuracy of the discontinuous Galerkin method by increasing the order of the underlying polynomial solution. The inter-cell reconstruction is devised to remove an interface discontinuity of the solution and its derivatives and thus to provide a simple, accurate, consistent, and robust approximation to the viscous and heat fluxes in the Navier-Stokes equations. A parallel strategy is also devised for the resulting reconstruction discontinuous Galerkin method, which is based on domain partitioning and Single Program Multiple Data (SPMD) parallel programming model. The RDG method is used to compute a variety of compressible flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results demonstrate that this RDG method is third-order accurate at a cost slightly higher than its underlying second-order DG method, at the same time providing a better performance than the third order DG method, in terms of both computing costs and storage requirements.

9. A High-Order Finite Spectral Volume Method for Conservation Laws on Unstructured Grids

NASA Technical Reports Server (NTRS)

Wang, Z. J.; Liu, Yen; Kwak, Dochan (Technical Monitor)

2001-01-01

A time accurate, high-order, conservative, yet efficient method named Finite Spectral Volume (FSV) is developed for conservation laws on unstructured grids. The concept of a 'spectral volume' is introduced to achieve high-order accuracy in an efficient manner similar to spectral element and multi-domain spectral methods. In addition, each spectral volume is further sub-divided into control volumes (CVs), and cell-averaged data from these control volumes is used to reconstruct a high-order approximation in the spectral volume. Riemann solvers are used to compute the fluxes at spectral volume boundaries. Then cell-averaged state variables in the control volumes are updated independently. Furthermore, TVD (Total Variation Diminishing) and TVB (Total Variation Bounded) limiters are introduced in the FSV method to remove/reduce spurious oscillations near discontinuities. A very desirable feature of the FSV method is that the reconstruction is carried out only once, and analytically, and is the same for all cells of the same type, and that the reconstruction stencil is always non-singular, in contrast to the memory and CPU-intensive reconstruction in a high-order finite volume (FV) method. Discussions are made concerning why the FSV method is significantly more efficient than high-order finite volume and the Discontinuous Galerkin (DG) methods. Fundamental properties of the FSV method are studied and high-order accuracy is demonstrated for several model problems with and without discontinuities.

10. An improved adaptive IHS method for image fusion

Wang, Ting

2015-12-01

An improved adaptive intensity-hue-saturation (IHS) method is proposed for image fusion in this paper based on the adaptive IHS (AIHS) method and its improved method(IAIHS). Through improved method, the weighting matrix, which decides how many spatial details in the panchromatic (Pan) image should be injected into the multispectral (MS) image, is defined on the basis of the linear relationship of the edges of Pan and MS image. At the same time, a modulation parameter t is used to balance the spatial resolution and spectral resolution of the fusion image. Experiments showed that the improved method can improve spectral quality and maintain spatial resolution compared with the AIHS and IAIHS methods.

11. A perspective on unstructured grid flow solvers

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.

1995-01-01

This survey paper assesses the status of compressible Euler and Navier-Stokes solvers on unstructured grids. Different spatial and temporal discretization options for steady and unsteady flows are discussed. The integration of these components into an overall framework to solve practical problems is addressed. Issues such as grid adaptation, higher order methods, hybrid discretizations and parallel computing are briefly discussed. Finally, some outstanding issues and future research directions are presented.

12. Wavelet methods in multi-conjugate adaptive optics

Helin, T.; Yudytskiy, M.

2013-08-01

The next generation ground-based telescopes rely heavily on adaptive optics for overcoming the limitation of atmospheric turbulence. In the future adaptive optics modalities, like multi-conjugate adaptive optics (MCAO), atmospheric tomography is the major mathematical and computational challenge. In this severely ill-posed problem, a fast and stable reconstruction algorithm is needed that can take into account many real-life phenomena of telescope imaging. We introduce a novel reconstruction method for the atmospheric tomography problem and demonstrate its performance and flexibility in the context of MCAO. Our method is based on using locality properties of compactly supported wavelets, both in the spatial and frequency domains. The reconstruction in the atmospheric tomography problem is obtained by solving the Bayesian MAP estimator with a conjugate-gradient-based algorithm. An accelerated algorithm with preconditioning is also introduced. Numerical performance is demonstrated on the official end-to-end simulation tool OCTOPUS of European Southern Observatory.

13. Adaptive computational methods for SSME internal flow analysis

NASA Technical Reports Server (NTRS)

Oden, J. T.

1986-01-01

Adaptive finite element methods for the analysis of classes of problems in compressible and incompressible flow of interest in SSME (space shuttle main engine) analysis and design are described. The general objective of the adaptive methods is to improve and to quantify the quality of numerical solutions to the governing partial differential equations of fluid dynamics in two-dimensional cases. There are several different families of adaptive schemes that can be used to improve the quality of solutions in complex flow simulations. Among these are: (1) r-methods (node-redistribution or moving mesh methods) in which a fixed number of nodal points is allowed to migrate to points in the mesh where high error is detected; (2) h-methods, in which the mesh size h is automatically refined to reduce local error; and (3) p-methods, in which the local degree p of the finite element approximation is increased to reduce local error. Two of the three basic techniques have been studied in this project: an r-method for steady Euler equations in two dimensions and a p-method for transient, laminar, viscous incompressible flow. Numerical results are presented. A brief introduction to residual methods of a-posterior error estimation is also given and some pertinent conclusions of the study are listed.

14. Adaptive clustering and adaptive weighting methods to detect disease associated rare variants.

PubMed

Sha, Qiuying; Wang, Shuaicheng; Zhang, Shuanglin

2013-03-01

Current statistical methods to test association between rare variants and phenotypes are essentially the group-wise methods that collapse or aggregate all variants in a predefined group into a single variant. Comparing with the variant-by-variant methods, the group-wise methods have their advantages. However, two factors may affect the power of these methods. One is that some of the causal variants may be protective. When both risk and protective variants are presented, it will lose power by collapsing or aggregating all variants because the effects of risk and protective variants will counteract each other. The other is that not all variants in the group are causal; rather, a large proportion is believed to be neutral. When a large proportion of variants are neutral, collapsing or aggregating all variants may not be an optimal solution. We propose two alternative methods, adaptive clustering (AC) method and adaptive weighting (AW) method, aiming to test rare variant association in the presence of neutral and/or protective variants. Both of AC and AW are applicable to quantitative traits as well as qualitative traits. Results of extensive simulation studies show that AC and AW have similar power and both of them have clear advantages from power to computational efficiency comparing with existing group-wise methods and existing data-driven methods that allow neutral and protective variants. We recommend AW method because AW method is computationally more efficient than AC method.

15. A new ghost-node method for linking different models and initial investigations of heterogeneity and nonmatching grids

USGS Publications Warehouse

Dickinson, J.E.; James, S.C.; Mehl, S.; Hill, M.C.; Leake, S.A.; Zyvoloski, G.A.; Faunt, C.C.; Eddebbarh, A.-A.

2007-01-01

A flexible, robust method for linking parent (regional-scale) and child (local-scale) grids of locally refined models that use different numerical methods is developed based on a new, iterative ghost-node method. Tests are presented for two-dimensional and three-dimensional pumped systems that are homogeneous or that have simple heterogeneity. The parent and child grids are simulated using the block-centered finite-difference MODFLOW and control-volume finite-element FEHM models, respectively. The models are solved iteratively through head-dependent (child model) and specified-flow (parent model) boundary conditions. Boundary conditions for models with nonmatching grids or zones of different hydraulic conductivity are derived and tested against heads and flows from analytical or globally-refined models. Results indicate that for homogeneous two- and three-dimensional models with matched grids (integer number of child cells per parent cell), the new method is nearly as accurate as the coupling of two MODFLOW models using the shared-node method and, surprisingly, errors are slightly lower for nonmatching grids (noninteger number of child cells per parent cell). For heterogeneous three-dimensional systems, this paper compares two methods for each of the two sets of boundary conditions: external heads at head-dependent boundary conditions for the child model are calculated using bilinear interpolation or a Darcy-weighted interpolation; specified-flow boundary conditions for the parent model are calculated using model-grid or hydrogeologic-unit hydraulic conductivities. Results suggest that significantly more accurate heads and flows are produced when both Darcy-weighted interpolation and hydrogeologic-unit hydraulic conductivities are used, while the other methods produce larger errors at the boundary between the regional and local models. The tests suggest that, if posed correctly, the ghost-node method performs well. Additional testing is needed for highly

16. A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Hybrid Grids

SciTech Connect

Xiaodong Liu; Lijun Xuan; Hong Luo; Yidong Xia

2001-01-01

A reconstructed discontinuous Galerkin (rDG(P1P2)) method, originally introduced for the compressible Euler equations, is developed for the solution of the compressible Navier- Stokes equations on 3D hybrid grids. In this method, a piecewise quadratic polynomial solution is obtained from the underlying piecewise linear DG solution using a hierarchical Weighted Essentially Non-Oscillatory (WENO) reconstruction. The reconstructed quadratic polynomial solution is then used for the computation of the inviscid fluxes and the viscous fluxes using the second formulation of Bassi and Reay (Bassi-Rebay II). The developed rDG(P1P2) method is used to compute a variety of flow problems to assess its accuracy, efficiency, and robustness. The numerical results demonstrate that the rDG(P1P2) method is able to achieve the designed third-order of accuracy at a cost slightly higher than its underlying second-order DG method, outperform the third order DG method in terms of both computing costs and storage requirements, and obtain reliable and accurate solutions to the large eddy simulation (LES) and direct numerical simulation (DNS) of compressible turbulent flows.

17. FAST TRACK PAPER: The interior penalty discontinuous Galerkin method for elastic wave propagation: grid dispersion

De Basabe, Jonás D.; Sen, Mrinal K.; Wheeler, Mary F.

2008-10-01

Recently, there has been an increased interest in applying the discontinuous Galerkin method (DGM) to wave propagation. In this work, we investigate the applicability of the interior penalty DGM to elastic wave propagation by analysing it's grid dispersion properties, with particular attention to the effect that different basis functions have on the numerical dispersion. We consider different types of basis functions that naturally yield a diagonal mass matrix. This is relevant to seismology because a diagonal mass matrix is tantamount to an explicit and efficient time marching scheme. We find that the Legendre basis functions that are traditionally used in the DGM introduce numerical dispersion and anisotropy. Furthermore, we find that using Lagrange basis functions along with the Gauss nodes has attractive advantages for numerical wave propagation.

18. Domain decomposition method for nonconforming finite element approximations of anisotropic elliptic problems on nonmatching grids

SciTech Connect

Maliassov, S.Y.

1996-12-31

An approach to the construction of an iterative method for solving systems of linear algebraic equations arising from nonconforming finite element discretizations with nonmatching grids for second order elliptic boundary value problems with anisotropic coefficients is considered. The technique suggested is based on decomposition of the original domain into nonoverlapping subdomains. The elliptic problem is presented in the macro-hybrid form with Lagrange multipliers at the interfaces between subdomains. A block diagonal preconditioner is proposed which is spectrally equivalent to the original saddle point matrix and has the optimal order of arithmetical complexity. The preconditioner includes blocks for preconditioning subdomain and interface problems. It is shown that constants of spectral equivalence axe independent of values of coefficients and mesh step size.

19. Adaptive windowed range-constrained Otsu method using local information

Zheng, Jia; Zhang, Dinghua; Huang, Kuidong; Sun, Yuanxi; Tang, Shaojie

2016-01-01

An adaptive windowed range-constrained Otsu method using local information is proposed for improving the performance of image segmentation. First, the reason why traditional thresholding methods do not perform well in the segmentation of complicated images is analyzed. Therein, the influences of global and local thresholdings on the image segmentation are compared. Second, two methods that can adaptively change the size of the local window according to local information are proposed by us. The characteristics of the proposed methods are analyzed. Thereby, the information on the number of edge pixels in the local window of the binarized variance image is employed to adaptively change the local window size. Finally, the superiority of the proposed method over other methods such as the range-constrained Otsu, the active contour model, the double Otsu, the Bradley's, and the distance-regularized level set evolution is demonstrated. It is validated by the experiments that the proposed method can keep more details and acquire much more satisfying area overlap measure as compared with the other conventional methods.

20. New developments in adaptive methods for computational fluid dynamics

NASA Technical Reports Server (NTRS)

Oden, J. T.; Bass, Jon M.

1990-01-01

New developments in a posteriori error estimates, smart algorithms, and h- and h-p adaptive finite element methods are discussed in the context of two- and three-dimensional compressible and incompressible flow simulations. Applications to rotor-stator interaction, rotorcraft aerodynamics, shock and viscous boundary layer interaction and fluid-structure interaction problems are discussed.

1. Likelihood Methods for Adaptive Filtering and Smoothing. Technical Report #455.

ERIC Educational Resources Information Center

Butler, Ronald W.

The dynamic linear model or Kalman filtering model provides a useful methodology for predicting the past, present, and future states of a dynamic system, such as an object in motion or an economic or social indicator that is changing systematically with time. Recursive likelihood methods for adaptive Kalman filtering and smoothing are developed.…

2. A Conditional Exposure Control Method for Multidimensional Adaptive Testing

ERIC Educational Resources Information Center

Finkelman, Matthew; Nering, Michael L.; Roussos, Louis A.

2009-01-01

In computerized adaptive testing (CAT), ensuring the security of test items is a crucial practical consideration. A common approach to reducing item theft is to define maximum item exposure rates, i.e., to limit the proportion of examinees to whom a given item can be administered. Numerous methods for controlling exposure rates have been proposed…

3. Patched based methods for adaptive mesh refinement solutions of partial differential equations

SciTech Connect

Saltzman, J.

1997-09-02

This manuscript contains the lecture notes for a course taught from July 7th through July 11th at the 1997 Numerical Analysis Summer School sponsored by C.E.A., I.N.R.I.A., and E.D.F. The subject area was chosen to support the general theme of that year`s school which is ``Multiscale Methods and Wavelets in Numerical Simulation.`` The first topic covered in these notes is a description of the problem domain. This coverage is limited to classical PDEs with a heavier emphasis on hyperbolic systems and constrained hyperbolic systems. The next topic is difference schemes. These schemes are the foundation for the adaptive methods. After the background material is covered, attention is focused on a simple patched based adaptive algorithm and its associated data structures for square grids and hyperbolic conservation laws. Embellishments include curvilinear meshes, embedded boundary and overset meshes. Next, several strategies for parallel implementations are examined. The remainder of the notes contains descriptions of elliptic solutions on the mesh hierarchy, elliptically constrained flow solution methods and elliptically constrained flow solution methods with diffusion.

4. Parallel grid population

DOEpatents

Wald, Ingo; Ize, Santiago

2015-07-28

Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.

5. A Parallel Implicit Reconstructed Discontinuous Galerkin Method for Compressible Flows on Hybrid Grids

Xia, Yidong

The objective this work is to develop a parallel, implicit reconstructed discontinuous Galerkin (RDG) method using Taylor basis for the solution of the compressible Navier-Stokes equations on 3D hybrid grids. This third-order accurate RDG method is based on a hierarchical weighed essentially non- oscillatory reconstruction scheme, termed as HWENO(P1P 2) to indicate that a quadratic polynomial solution is obtained from the underlying linear polynomial DG solution via a hierarchical WENO reconstruction. The HWENO(P1P2) is designed not only to enhance the accuracy of the underlying DG(P1) method but also to ensure non-linear stability of the RDG method. In this reconstruction scheme, a quadratic polynomial (P2) solution is first reconstructed using a least-squares approach from the underlying linear (P1) discontinuous Galerkin solution. The final quadratic solution is then obtained using a Hermite WENO reconstruction, which is necessary to ensure the linear stability of the RDG method on 3D unstructured grids. The first derivatives of the quadratic polynomial solution are then reconstructed using a WENO reconstruction in order to eliminate spurious oscillations in the vicinity of strong discontinuities, thus ensuring the non-linear stability of the RDG method. The parallelization in the RDG method is based on a message passing interface (MPI) programming paradigm, where the METIS library is used for the partitioning of a mesh into subdomain meshes of approximately the same size. Both multi-stage explicit Runge-Kutta and simple implicit backward Euler methods are implemented for time advancement in the RDG method. In the implicit method, three approaches: analytical differentiation, divided differencing (DD), and automatic differentiation (AD) are developed and implemented to obtain the resulting flux Jacobian matrices. The automatic differentiation is a set of techniques based on the mechanical application of the chain rule to obtain derivatives of a function given as

6. A wavelet-MRA-based adaptive semi-Lagrangian method for the relativistic Vlasov-Maxwell system

SciTech Connect

Besse, Nicolas Latu, Guillaume Ghizzo, Alain Sonnendruecker, Eric Bertrand, Pierre

2008-08-10

In this paper we present a new method for the numerical solution of the relativistic Vlasov-Maxwell system on a phase-space grid using an adaptive semi-Lagrangian method. The adaptivity is performed through a wavelet multiresolution analysis, which gives a powerful and natural refinement criterion based on the local measurement of the approximation error and regularity of the distribution function. Therefore, the multiscale expansion of the distribution function allows to get a sparse representation of the data and thus save memory space and CPU time. We apply this numerical scheme to reduced Vlasov-Maxwell systems arising in laser-plasma physics. Interaction of relativistically strong laser pulses with overdense plasma slabs is investigated. These Vlasov simulations revealed a rich variety of phenomena associated with the fast particle dynamics induced by electromagnetic waves as electron trapping, particle acceleration, and electron plasma wavebreaking. However, the wavelet based adaptive method that we developed here, does not yield significant improvements compared to Vlasov solvers on a uniform mesh due to the substantial overhead that the method introduces. Nonetheless they might be a first step towards more efficient adaptive solvers based on different ideas for the grid refinement or on a more efficient implementation. Here the Vlasov simulations are performed in a two-dimensional phase-space where the development of thin filaments, strongly amplified by relativistic effects requires an important increase of the total number of points of the phase-space grid as they get finer as time goes on. The adaptive method could be more useful in cases where these thin filaments that need to be resolved are a very small fraction of the hyper-volume, which arises in higher dimensions because of the surface-to-volume scaling and the essentially one-dimensional structure of the filaments. Moreover, the main way to improve the efficiency of the adaptive method is to

7. Method and system for environmentally adaptive fault tolerant computing

NASA Technical Reports Server (NTRS)

Copenhaver, Jason L. (Inventor); Jeremy, Ramos (Inventor); Wolfe, Jeffrey M. (Inventor); Brenner, Dean (Inventor)

2010-01-01

A method and system for adapting fault tolerant computing. The method includes the steps of measuring an environmental condition representative of an environment. An on-board processing system's sensitivity to the measured environmental condition is measured. It is determined whether to reconfigure a fault tolerance of the on-board processing system based in part on the measured environmental condition. The fault tolerance of the on-board processing system may be reconfigured based in part on the measured environmental condition.

8. Is the Multigrid Method Fault Tolerant? The Two-Grid Case

SciTech Connect

Ainsworth, Mark; Glusa, Christian

2016-06-30

The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault occurring, a decision has to be made as to what remedial action should be taken in order to resume the execution of the algorithm. The action that is chosen can have a dramatic effect on the performance and characteristics of the scheme. Ideally, the resulting algorithm should be subjected to the same kind of mathematical analysis that was applied to the original, deterministic variant. The purpose of this work is to provide an analysis of the behaviour of the multigrid algorithm in the presence of faults. Multigrid is arguably the method of choice for the solution of large-scale linear algebra problems arising from discretization of partial differential equations and it is of considerable importance to anticipate its behaviour on an exascale machine. The analysis of resilience of algorithms is in its infancy and the current work is perhaps the first to provide a mathematical model for faults and analyse the behaviour of a state-of-the-art algorithm under the model. It is shown that the Two Grid Method fails to be resilient to faults. Attention is then turned to identifying the minimal necessary remedial action required to restore the rate of convergence to that enjoyed by the ideal fault-free method.

9. Free energy calculations: an efficient adaptive biasing potential method.

PubMed

Dickson, Bradley M; Legoll, Frédéric; Lelièvre, Tony; Stoltz, Gabriel; Fleurat-Lessard, Paul

2010-05-06

We develop an efficient sampling and free energy calculation technique within the adaptive biasing potential (ABP) framework. By mollifying the density of states we obtain an approximate free energy and an adaptive bias potential that is computed directly from the population along the coordinates of the free energy. Because of the mollifier, the bias potential is "nonlocal", and its gradient admits a simple analytic expression. A single observation of the reaction coordinate can thus be used to update the approximate free energy at every point within a neighborhood of the observation. This greatly reduces the equilibration time of the adaptive bias potential. This approximation introduces two parameters: strength of mollification and the zero of energy of the bias potential. While we observe that the approximate free energy is a very good estimate of the actual free energy for a large range of mollification strength, we demonstrate that the errors associated with the mollification may be removed via deconvolution. The zero of energy of the bias potential, which is easy to choose, influences the speed of convergence but not the limiting accuracy. This method is simple to apply to free energy or mean force computation in multiple dimensions and does not involve second derivatives of the reaction coordinates, matrix manipulations nor on-the-fly adaptation of parameters. For the alanine dipeptide test case, the new method is found to gain as much as a factor of 10 in efficiency as compared to two basic implementations of the adaptive biasing force methods, and it is shown to be as efficient as well-tempered metadynamics with the postprocess deconvolution giving a clear advantage to the mollified density of states method.

10. Three-Dimensional High-Order Spectral Volume Method for Solving Maxwell's Equations on Unstructured Grids

NASA Technical Reports Server (NTRS)

Liu, Yen; Vinokur, Marcel; Wang, Z. J.

2004-01-01

A three-dimensional, high-order, conservative, and efficient discontinuous spectral volume (SV) method for the solutions of Maxwell's equations on unstructured grids is presented. The concept of discontinuous 2nd high-order loca1 representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) method, but instead of using a Galerkin finite-element formulation, the SV method is based on a finite-volume approach to attain a simpler formulation. Conventional unstructured finite-volume methods require data reconstruction based on the least-squares formulation using neighboring cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In the SV method, one starts with a relatively coarse grid of triangles or tetrahedra, called spectral volumes (SVs), and partition each SV into a number of structured subcells, called control volumes (CVs), that support a polynomial expansion of a desired degree of precision. The unknowns are cell averages over CVs. If all the SVs are partitioned in a geometrically similar manner, the reconstruction becomes universal as a weighted sum of unknowns, and only a few universal coefficients need to be stored for the surface integrals over CV faces. Since the solution is discontinuous across the SV boundaries, a Riemann solver is thus necessary to maintain conservation. In the paper, multi-parameter and symmetric SV partitions, up to quartic for triangle and cubic for tetrahedron, are first presented. The corresponding weight coefficients for CV face integrals in terms of CV cell averages for each partition are analytically determined. These discretization formulas are then applied to the integral form of

11. A Method for Flow Simulation About Complex Geometries Using Both Structured and Unstructured Grids

NASA Technical Reports Server (NTRS)

Debonis, James R.

1994-01-01

A computational fluid dynamics code which utilizes both structured and unstructured grids was developed. The objective of this study was to develop and demonstrate the ability of such a code to achieve solutions about complex geometries in two dimensions. An unstructured grid generator and flow solver were incorporated into the PARC2D structured flow solver. This new unstructured grid generator capability allows for easier generation and manipulation of complex grids. Several examples of the grid generation capabilities are provided. The coupling of different grid topologies and the manipulation of individual grids is shown. Also, grids for realistic geometries, a NACA 0012 airfoil and a wing/nacelle installation, were created. The flow over a NACA 0012 airfoil was used as a test case for the flow solver. Eight separate cases were run. They were both the inviscid and viscous solutions for two freestream Mach numbers and airfoil angle of attacks of 0 to 3.86 degrees. The Mach numbers chosen were for a subsonic case, Mach 0.6, and a case where supersonic regions and a shock wave exists, Mach 0.8. These test case conditions were selected to match experimentally obtained data for code comparison. The results show that the code accurately predicts the flow field for all cases.

12. An Adaptive Cross-Architecture Combination Method for Graph Traversal

SciTech Connect

You, Yang; Song, Shuaiwen; Kerbyson, Darren J.

2014-06-18

Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.

13. Adaptive Kaczmarz Method for Image Reconstruction in Electrical Impedance Tomography

PubMed Central

Li, Taoran; Kao, Tzu-Jen; Isaacson, David; Newell, Jonathan C.; Saulnier, Gary J.

2013-01-01

We present an adaptive Kaczmarz method for solving the inverse problem in electrical impedance tomography and determining the conductivity distribution inside an object from electrical measurements made on the surface. To best characterize an unknown conductivity distribution and avoid inverting the Jacobian-related term JTJ which could be expensive in terms of computation cost and memory in large scale problems, we propose solving the inverse problem by applying the optimal current patterns for distinguishing the actual conductivity from the conductivity estimate between each iteration of the block Kaczmarz algorithm. With a novel subset scheme, the memory-efficient reconstruction algorithm which appropriately combines the optimal current pattern generation with the Kaczmarz method can produce more accurate and stable solutions adaptively as compared to traditional Kaczmarz and Gauss-Newton type methods. Choices of initial current pattern estimates are discussed in the paper. Several reconstruction image metrics are used to quantitatively evaluate the performance of the simulation results. PMID:23718952

14. Adaptive Set-Based Methods for Association Testing.

PubMed

Su, Yu-Chen; Gauderman, William James; Berhane, Kiros; Lewinger, Juan Pablo

2016-02-01

With a typical sample size of a few thousand subjects, a single genome-wide association study (GWAS) using traditional one single nucleotide polymorphism (SNP)-at-a-time methods can only detect genetic variants conferring a sizable effect on disease risk. Set-based methods, which analyze sets of SNPs jointly, can detect variants with smaller effects acting within a gene, a pathway, or other biologically relevant sets. Although self-contained set-based methods (those that test sets of variants without regard to variants not in the set) are generally more powerful than competitive set-based approaches (those that rely on comparison of variants in the set of interest with variants not in the set), there is no consensus as to which self-contained methods are best. In particular, several self-contained set tests have been proposed to directly or indirectly "adapt" to the a priori unknown proportion and distribution of effects of the truly associated SNPs in the set, which is a major determinant of their power. A popular adaptive set-based test is the adaptive rank truncated product (ARTP), which seeks the set of SNPs that yields the best-combined evidence of association. We compared the standard ARTP, several ARTP variations we introduced, and other adaptive methods in a comprehensive simulation study to evaluate their performance. We used permutations to assess significance for all the methods and thus provide a level playing field for comparison. We found the standard ARTP test to have the highest power across our simulations followed closely by the global model of random effects (GMRE) and a least absolute shrinkage and selection operator (LASSO)-based test.

15. Conservative high-order-accurate finite-difference methods for curvilinear grids

NASA Technical Reports Server (NTRS)

Rai, Man M.; Chakrvarthy, Sukumar

1993-01-01

Two fourth-order-accurate finite-difference methods for numerically solving hyperbolic systems of conservation equations on smooth curvilinear grids are presented. The first method uses the differential form of the conservation equations; the second method uses the integral form of the conservation equations. Modifications to these schemes, which are required near boundaries to maintain overall high-order accuracy, are discussed. An analysis that demonstrates the stability of the modified schemes is also provided. Modifications to one of the schemes to make it total variation diminishing (TVD) are also discussed. Results that demonstrate the high-order accuracy of both schemes are included in the paper. In particular, a Ringleb-flow computation demonstrates the high-order accuracy and the stability of the boundary and near-boundary procedures. A second computation of supersonic flow over a cylinder demonstrates the shock-capturing capability of the TVD methodology. An important contribution of this paper is the dear demonstration that higher order accuracy leads to increased computational efficiency.

16. A multi-moment constrained finite volume method on arbitrary unstructured grids for incompressible flows

Xie, Bin; Xiao, Feng

2016-12-01

We proposed a multi-moment constrained finite volume method which can simulate incompressible flows of high Reynolds number in complex geometries. Following the underlying idea of the volume-average/point-value multi-moment (VPM) method (Xie et al. (2014) [71]), this formulation is developed on arbitrary unstructured hybrid grids by employing the point values (PV) at both cell vertex and barycenter as the prognostic variables. The cell center value is updated via an evolution equation derived from a constraint condition of finite volume form, which ensures the rigorous numerical conservativeness. Novel numerical formulations based on the local PVs over compact stencil are proposed to enhance the accuracy, robustness and efficiency of computations on unstructured meshes of hybrid and arbitrary elements. Numerical experiments demonstrate that the present numerical model has nearly 3-order convergence rate with numerical errors much smaller than the VPM method. The numerical dissipation has been significantly suppressed, which facilitates numerical simulations of high Reynolds number flows in complex geometries.

SciTech Connect

Lipnikov, Konstantine; Danilov, A; Vassilevski, Y; Agonzal, A

2010-01-01

18. Dynamic Power Grid Simulation

SciTech Connect

Top, Philip; Woodward, Carol; Smith, Steve; Banks, Lawrence; Kelley, Brian

2015-09-14

GridDyn is a part of power grid simulation toolkit. The code is designed using modern object oriented C++ methods utilizing C++11 and recent Boost libraries to ensure compatibility with multiple operating systems and environments.

19. Optimization Of A Computational Grid

NASA Technical Reports Server (NTRS)

Pearce, Daniel G.

1993-01-01

In improved method of generation of computational grid, grid-generation process decoupled from definition of geometry. Not necessary to redefine boundary. Instead, continuous boundaries in physical domain specified, and then grid points in computational domain mapped onto continuous boundaries.

20. Space-time adaptive numerical methods for geophysical applications.

PubMed

Castro, C E; Käser, M; Toro, E F

2009-11-28

In this paper we present high-order formulations of the finite volume and discontinuous Galerkin finite-element methods for wave propagation problems with a space-time adaptation technique using unstructured meshes in order to reduce computational cost without reducing accuracy. Both methods can be derived in a similar mathematical framework and are identical in their first-order version. In their extension to higher order accuracy in space and time, both methods use spatial polynomials of higher degree inside each element, a high-order solution of the generalized Riemann problem and a high-order time integration method based on the Taylor series expansion. The static adaptation strategy uses locally refined high-resolution meshes in areas with low wave speeds to improve the approximation quality. Furthermore, the time step length is chosen locally adaptive such that the solution is evolved explicitly in time by an optimal time step determined by a local stability criterion. After validating the numerical approach, both schemes are applied to geophysical wave propagation problems such as tsunami waves and seismic waves comparing the new approach with the classical global time-stepping technique. The problem of mesh partitioning for large-scale applications on multi-processor architectures is discussed and a new mesh partition approach is proposed and tested to further reduce computational cost.