An efficient MultiGrid solver for the 3D simulation of composite materials
Gu, H.; Rethore, J.; Baietto, M.C.; Sainsot, P.; Lecomte-Grosbras, P.; Venner, Cornelis H.; Lubrecht, A.A.
2016-01-01
• An efficient Multigrid solver for simulating composites. • A real topology is simulated for the first time by the MultiGrid methods. • MultiGrid application in composite homogenization process. • Factors influencing on surface displacement variation are studied. The subject of this paper is to
Elliptic Solvers for Adaptive Mesh Refinement Grids
Energy Technology Data Exchange (ETDEWEB)
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.
A sparse-grid isogeometric solver
Beck, Joakim
2018-02-28
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A vectorizable adaptive grid solver for PDEs in 3D
J.G. Blom (Joke); J.G. Verwer (Jan)
1993-01-01
textabstractThis paper describes the application of an adaptive-grid finite-difference solver to some time-dependent three-dimensional systems of partial differential equations. The code is a 3D extension of the 2D code VLUGR2[3].
Direct solvers performance on h-adapted grids
Paszynski, Maciej
2015-05-27
We analyse the performance of direct solvers when applied to a system of linear equations arising from an hh-adapted, C0C0 finite element space. Theoretical estimates are derived for typical hh-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of hh-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones.
Hybrid direct and iterative solvers for h refined grids with singularities
Paszyński, Maciej R.
2015-04-27
This paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to the standard algorithm performing static condensation over the entire mesh and executing the ILUPCG algorithm on top of it. The hybrid solver is applied for two or three dimensional grids automatically h refined towards point or edge singularities. The automatic refinement is based on the relative error estimations between the coarse and fine mesh solutions [2], and the optimal refinements are selected using the projection based interpolation. The computational mesh is partitioned into sub-meshes with local point and edge singularities separated. This is done by using the following greedy algorithm.
Preconditioned CG-solvers and finite element grids
Energy Technology Data Exchange (ETDEWEB)
Bauer, R.; Selberherr, S. [Technical Univ. of Vienna (Austria)
1994-12-31
To extract parasitic capacitances in wiring structures of integrated circuits the authors developed the two- and three-dimensional finite element program SCAP (Smart Capacitance Analysis Program). The program computes the task of the electrostatic field from a solution of Poisson`s equation via finite elements and calculates the energies from which the capacitance matrix is extracted. The unknown potential vector, which has for three-dimensional applications 5000-50000 unknowns, is computed by a ICCG solver. Currently three- and six-node triangular, four- and ten-node tetrahedronal elements are supported.
Agglomeration Multigrid for an Unstructured-Grid Flow Solver
Frink, Neal; Pandya, Mohagna J.
2004-01-01
An agglomeration multigrid scheme has been implemented into the sequential version of the NASA code USM3Dns, tetrahedral cell-centered finite volume Euler/Navier-Stokes flow solver. Efficiency and robustness of the multigrid-enhanced flow solver have been assessed for three configurations assuming an inviscid flow and one configuration assuming a viscous fully turbulent flow. The inviscid studies include a transonic flow over the ONERA M6 wing and a generic business jet with flow-through nacelles and a low subsonic flow over a high-lift trapezoidal wing. The viscous case includes a fully turbulent flow over the RAE 2822 rectangular wing. The multigrid solutions converged with 12%-33% of the Central Processing Unit (CPU) time required by the solutions obtained without multigrid. For all of the inviscid cases, multigrid in conjunction with an explicit time-stepping scheme performed the best with regard to the run time memory and CPU time requirements. However, for the viscous case multigrid had to be used with an implicit backward Euler time-stepping scheme that increased the run time memory requirement by 22% as compared to the run made without multigrid.
Unsteady Non-Newtonian Solver on Unstructured Grid for the Simulation of Blood Flow
Directory of Open Access Journals (Sweden)
Guojie Li
2013-01-01
Full Text Available Blood is in fact a suspension of different cells with yield stress, shear thinning, and viscoelastic properties, which can be represented by different non-Newtonian models. Taking Casson fluid as an example, an unsteady solver on unstructured grid for non-Newtonian fluid is developed to simulate transient blood flow in complex flow region. In this paper, a steady solver for Newtonian fluid is firstly developed with the discretization of convective flux, diffusion flux, and source term on unstructured grid. For the non-Newtonian characteristics of blood, the Casson fluid is approximated by the Papanastasiou's model and treated as Newtonian fluid with variable viscosity. Then considering the transient property of blood flow, an unsteady non-Newtonian solver based on unstructured grid is developed by introducing the temporal term by first-order upwind difference scheme. Using the proposed solver, the blood flows in carotid bifurcation of hypertensive patients and healthy people are simulated. The result shows that the possibility of the genesis and development of atherosclerosis is increased, because of the increase in incoming flow shock and backflow areas of the hypertensive patients, whose WSS was 20~87.1% lower in outer vascular wall near the bifurcation than that of the normal persons and 3.7~5.5% lower in inner vascular wall downstream the bifurcation.
An assessment of the adaptive unstructured tetrahedral grid, Euler Flow Solver Code FELISA
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.
Simulation of an Isolated Tiltrotor in Hover with an Unstructured Overset-Grid RANS Solver
Lee-Rausch, Elizabeth M.; Biedron, Robert T.
2009-01-01
An unstructured overset-grid Reynolds Averaged Navier-Stokes (RANS) solver, FUN3D, is used to simulate an isolated tiltrotor in hover. An overview of the computational method is presented as well as the details of the overset-grid systems. Steady-state computations within a noninertial reference frame define the performance trends of the rotor across a range of the experimental collective settings. Results are presented to show the effects of off-body grid refinement and blade grid refinement. The computed performance and blade loading trends show good agreement with experimental results and previously published structured overset-grid computations. Off-body flow features indicate a significant improvement in the resolution of the first perpendicular blade vortex interaction with background grid refinement across the collective range. Considering experimental data uncertainty and effects of transition, the prediction of figure of merit on the baseline and refined grid is reasonable at the higher collective range- within 3 percent of the measured values. At the lower collective settings, the computed figure of merit is approximately 6 percent lower than the experimental data. A comparison of steady and unsteady results show that with temporal refinement, the dynamic results closely match the steady-state noninertial results which gives confidence in the accuracy of the dynamic overset-grid approach.
An Analysis of Elliptic Grid Generation Techniques Using an Implicit Euler Solver.
1986-06-09
with complete continuity across - sonic pressure coefficient the block interfaces. The composite structure s such that completely general...solver to yield accurate second-order, ... v.s zd solutions. References Snn, .:-P.. Flr.e ’rference Methods In Z, .tational Fluid DinamIcs , to he published
LEOPARD: A grid-based dispersion relation solver for arbitrary gyrotropic distributions
Astfalk, Patrick; Jenko, Frank
2017-01-01
Particle velocity distributions measured in collisionless space plasmas often show strong deviations from idealized model distributions. Despite this observational evidence, linear wave analysis in space plasma environments such as the solar wind or Earth's magnetosphere is still mainly carried out using dispersion relation solvers based on Maxwellians or other parametric models. To enable a more realistic analysis, we present the new grid-based kinetic dispersion relation solver LEOPARD (Linear Electromagnetic Oscillations in Plasmas with Arbitrary Rotationally-symmetric Distributions) which no longer requires prescribed model distributions but allows for arbitrary gyrotropic distribution functions. In this work, we discuss the underlying numerical scheme of the code and we show a few exemplary benchmarks. Furthermore, we demonstrate a first application of LEOPARD to ion distribution data obtained from hybrid simulations. In particular, we show that in the saturation stage of the parallel fire hose instability, the deformation of the initial bi-Maxwellian distribution invalidates the use of standard dispersion relation solvers. A linear solver based on bi-Maxwellians predicts further growth even after saturation, while LEOPARD correctly indicates vanishing growth rates. We also discuss how this complies with former studies on the validity of quasilinear theory for the resonant fire hose. In the end, we briefly comment on the role of LEOPARD in directly analyzing spacecraft data, and we refer to an upcoming paper which demonstrates a first application of that kind.
A GPU-enabled Finite Volume solver for global magnetospheric simulations on unstructured grids
Lani, Andrea; Yalim, Mehmet Sarp; Poedts, Stefaan
2014-10-01
This paper describes an ideal Magnetohydrodynamics (MHD) solver for global magnetospheric simulations based on a B1 +B0 splitting approach, which has been implemented within the COOLFluiD platform and adapted to run on modern heterogeneous architectures featuring General Purpose Graphical Processing Units (GPGPUs). The code is based on a state-of-the-art Finite Volume discretization for unstructured grids and either explicit or implicit time integration, suitable for both steady and time accurate problems. Innovative object-oriented design and coding techniques mixing C++ and CUDA are discussed. Performance results of the modified code on single and multiple processors are presented and compared with those provided by the original solver.
A point implicit unstructured grid solver for the Euler and Navier-Stokes equations
Thareja, Rajiv R.; Stewart, James R.; Hassan, Obey; Morgan, Ken; Peraire, Jaime
1988-01-01
An upwind finite element technique that uses cell centered quantities and implicit and/or explicit time marching has been developed for computing hypersonic laminar viscous flows using adaptive unstructured triangular grids. A structured grid of quadrilaterals is laid out near the body surface. For inviscid flows the method is stable at Courant numbers of over 100,000. A first order basic scheme and a higher order flux corrected transport (FCT) scheme have been implemented. This technique has been applied to the problem of predicting type III and IV shock wave interactions on a cylinder, with a view of simulating the pressure and heating rate augmentation caused by an impinging shock on the leading edge of a cowl lip of an engine inlet. The predictions of wall pressure and heating rates compare very well with experimental data. The flow features are very distinctly captured with a sequence of adaptively generated grids. The adaptive mesh generator and the upwind Navier-Stokes solver are combined in a set of programs called LARCNESS, an acronym for Langley Adaptive Remeshing Code and Navier-Stokes Solver.
AbouEisha, Hassan M.
2014-06-06
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm.
Paszyński, Maciej R.
2013-04-01
This paper describes a direct solver algorithm for a sequence of finite element meshes that are h-refined towards one or several point singularities. For such a sequence of grids, the solver delivers linear computational cost O(N) in terms of CPU time and memory with respect to the number of unknowns N. The linear computational cost is achieved by utilizing the recursive structure provided by the sequence of h-adaptive grids with a special construction of the elimination tree that allows for reutilization of previously computed partial LU (or Cholesky) factorizations over the entire unrefined part of the computational mesh. The reutilization technique reduces the computational cost of the entire sequence of h-refined grids from O(N2) down to O(N). Theoretical estimates are illustrated with numerical results on two- and three-dimensional model problems exhibiting one or several point singularities. © 2013 Elsevier Ltd. All rights reserved.
Composite Grids for Reinforcement of Concrete Structures.
1998-06-01
ADVANCEMENT RESEARCH (CPAR) PROGRAM Composite Grids for Reinforcement of Concrete Structures by Piyush K. Dutta, David M. Bailey, Stephen W. Tsai...AGENCY USE ONLY (Leave Blank) 2. REPORT DATE June 1998 4. TITLE AND SUBTITLE Composite Grids for Reinforcement of Concrete Structures 3. REPORT...CPAR) Work Unit LX4, "Composite Grid/Frame Reinforcement for Concrete Structures ." The U.S. Army Construction Engineering Research Laboratories
Toward a Grid Work flow Formal Composition
Energy Technology Data Exchange (ETDEWEB)
Hlaoui, Y. B.; BenAyed, L. J.
2007-07-01
This paper exposes a new approach for the composition of grid work flow models. This approach proposes an abstract syntax for the UML Activity Diagrams (UML-AD) and a formal foundation for grid work flow composition in form of a work flow algebra based on UML-AD. This composition fulfils the need for collaborative model development particularly the specification and the reduction of the complexity of grid work flow model verification. This complexity has arisen with the increase in scale of grid work flow applications such as science and e-business applications since large amounts of computational resources are required and multiple parties could be involved in the development process and in the use of grid work flows. Furthermore, the proposed algebra allows the definition of work flow views which are useful to limit the access to predefined users in order to ensure the security of grid work flow applications. (Author)
Raju, M. S.
1998-01-01
The success of any solution methodology used in the study of gas-turbine combustor flows depends a great deal on how well it can model the various complex and rate controlling processes associated with the spray's turbulent transport, mixing, chemical kinetics, evaporation, and spreading rates, as well as convective and radiative heat transfer and other phenomena. The phenomena to be modeled, which are controlled by these processes, often strongly interact with each other at different times and locations. In particular, turbulence plays an important role in determining the rates of mass and heat transfer, chemical reactions, and evaporation in many practical combustion devices. The influence of turbulence in a diffusion flame manifests itself in several forms, ranging from the so-called wrinkled, or stretched, flamelets regime to the distributed combustion regime, depending upon how turbulence interacts with various flame scales. Conventional turbulence models have difficulty treating highly nonlinear reaction rates. A solution procedure based on the composition joint probability density function (PDF) approach holds the promise of modeling various important combustion phenomena relevant to practical combustion devices (such as extinction, blowoff limits, and emissions predictions) because it can account for nonlinear chemical reaction rates without making approximations. In an attempt to advance the state-of-the-art in multidimensional numerical methods, we at the NASA Lewis Research Center extended our previous work on the PDF method to unstructured grids, parallel computing, and sprays. EUPDF, which was developed by M.S. Raju of Nyma, Inc., was designed to be massively parallel and could easily be coupled with any existing gas-phase and/or spray solvers. EUPDF can use an unstructured mesh with mixed triangular, quadrilateral, and/or tetrahedral elements. The application of the PDF method showed favorable results when applied to several supersonic
Power Grid Simulation with GPU-Accelerated Iterative Solvers and Preconditioners
Xu, S.
2011-01-01
This thesis deals with two research problems. The first research problem is motivated by the numerical computation involved in the Time Domain Simulation (TDS) of Power Grids. Due to the ever growing size and complexity of Power Grids such as the China National Grid, accelerating TDS has become a
Manufacture and design of composite grids
Directory of Open Access Journals (Sweden)
Tsai, Stephen W.
1997-12-01
Full Text Available Grid structures have been in use for decades. Many were made of reinforced concrete or metals. Grids made of composite materials offer high stiffness and strength at low mass that are competitive with traditional composite laminates.
Commonly available manufacturing processes such as filament winding, pultrusion and tubes made from female molds are used to produce composite grids. Cost effective grids can then be made in large sizes and quantities. Grids derive their global stiffness and strength from their ribs. They are fundamentally different from laminates which derive theirs from plies. The models for stiffness and failure modes can be viewed as simple extensions of laminated plate theory. It is hoped that grids will emerge as one of the common structural forms along with solid, stiffened and sandwich panels. Potential applications of composite grids are also mentioned.
Las estructuras parrilla se han usado durante décadas. Muchas de ellas han sido fabricadas con hormigón armado o con metales. Las estructuras parrilla de materiales compuestos presentan rigideces y resistencias superiores, con menor peso en relación a laminados tradicionales de materiales compuestos.
Para la fahricacion.de este tipo de estructuras, se utilizan procesos convencionales como son enrollamiento continuo, pultrusión y perfiles fabricados a partir de moldes hembra. Las estructuras parrilla presentan una gran rigidez y resistencia debido a los refuerzos (largueros y travesaños. Los modelos utilizados para estudiar la rigidez y los modos de rotura, se derivan de la teoría de placas laminadas. Las estructuras parrilla de materiales compuestos tienen un prometedor futuro, tanto solas como reforzadas con un núcleo, como constituyentes de una estructura sándwich.
Zubair, Mohammad; Nielsen, Eric; Luitjens, Justin; Hammond, Dana
2016-01-01
In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.
A three-dimensional upwind finite element point implicit unstructured grid Euler solver
Thareja, Rajiv R.; Morgan, Ken; Peraire, Jaime; Peiro, Joaquin
1989-01-01
A three-dimensional upwind finite element technique that uses cell-centered quantities and implicit and/or explicit time marching was developed for computing hypersonic inviscid flows using adaptive unstructured grids. This technique was used to predict shock interference on a swept cylinder. An attempt was made to determine the flowfield and, in particular, the pressure augmentation caused by an impinging shock on the swept leading edge of a cowl lip of an engine inlet.
MEDUSA - An overset grid flow solver for network-based parallel computer systems
Smith, Merritt H.; Pallis, Jani M.
1993-01-01
Continuing improvement in processing speed has made it feasible to solve the Reynolds-Averaged Navier-Stokes equations for simple three-dimensional flows on advanced workstations. Combining multiple workstations into a network-based heterogeneous parallel computer allows the application of programming principles learned on MIMD (Multiple Instruction Multiple Data) distributed memory parallel computers to the solution of larger problems. An overset-grid flow solution code has been developed which uses a cluster of workstations as a network-based parallel computer. Inter-process communication is provided by the Parallel Virtual Machine (PVM) software. Solution speed equivalent to one-third of a Cray-YMP processor has been achieved from a cluster of nine commonly used engineering workstation processors. Load imbalance and communication overhead are the principal impediments to parallel efficiency in this application.
Feng, Wenqiang; Guo, Zhenlin; Lowengrub, John S.; Wise, Steven M.
2018-01-01
We present a mass-conservative full approximation storage (FAS) multigrid solver for cell-centered finite difference methods on block-structured, locally cartesian grids. The algorithm is essentially a standard adaptive FAS (AFAS) scheme, but with a simple modification that comes in the form of a mass-conservative correction to the coarse-level force. This correction is facilitated by the creation of a zombie variable, analogous to a ghost variable, but defined on the coarse grid and lying under the fine grid refinement patch. We show that a number of different types of fine-level ghost cell interpolation strategies could be used in our framework, including low-order linear interpolation. In our approach, the smoother, prolongation, and restriction operations need never be aware of the mass conservation conditions at the coarse-fine interface. To maintain global mass conservation, we need only modify the usual FAS algorithm by correcting the coarse-level force function at points adjacent to the coarse-fine interface. We demonstrate through simulations that the solver converges geometrically, at a rate that is h-independent, and we show the generality of the solver, applying it to several nonlinear, time-dependent, and multi-dimensional problems. In several tests, we show that second-order asymptotic (h → 0) convergence is observed for the discretizations, provided that (1) at least linear interpolation of the ghost variables is employed, and (2) the mass conservation corrections are applied to the coarse-level force term.
Directory of Open Access Journals (Sweden)
Julia Hofbauer
2016-04-01
Full Text Available Purpose : To analyze the impact of heterogeneity-corrected dose calculation on dosimetric quality parameters in gyne¬cological and breast brachytherapy using Acuros, a grid-based Boltzmann equation solver (GBBS, and to evaluate the shielding effects of different cervix brachytherapy applicators. Material and methods: Calculations with TG-43 and Acuros were based on computed tomography (CT retrospectively, for 10 cases of accelerated partial breast irradiation and 9 cervix cancer cases treated with tandem-ring applicators. Phantom CT-scans of different applicators (plastic and titanium were acquired. For breast cases the V
Hofbauer, Julia; Kirisits, Christian; Resch, Alexandra; Xu, Yingjie; Sturdza, Alina; Pötter, Richard; Nesvacil, Nicole
2016-04-01
To analyze the impact of heterogeneity-corrected dose calculation on dosimetric quality parameters in gynecological and breast brachytherapy using Acuros, a grid-based Boltzmann equation solver (GBBS), and to evaluate the shielding effects of different cervix brachytherapy applicators. Calculations with TG-43 and Acuros were based on computed tomography (CT) retrospectively, for 10 cases of accelerated partial breast irradiation and 9 cervix cancer cases treated with tandem-ring applicators. Phantom CT-scans of different applicators (plastic and titanium) were acquired. For breast cases the V20Gyαβ3 to lung, the D0.1cm(3) , D1cm(3) , D2cm(3) to rib, the D0.1cm(3) , D1cm(3) , D10cm(3) to skin, and Dmax for all structures were reported. For cervix cases, the D0.1cm(3) , D2cm(3) to bladder, rectum and sigmoid, and the D50, D90, D98, V100 for the CTVHR were reported. For the phantom study, surrogates for target and organ at risk were created for a similar dose volume histogram (DVH) analysis. Absorbed dose and equivalent dose to 2 Gy fractionation (EQD2) were used for comparison. Calculations with TG-43 overestimated the dose for all dosimetric indices investigated. For breast, a decrease of ~8% was found for D10cm(3) to the skin and 5% for D2cm(3) to rib, resulting in a difference ~ -1.5 Gy EQD2 for overall treatment. Smaller effects were found for cervix cases with the plastic applicator, with up to -2% (-0.2 Gy EQD2) per fraction for organs at risk and -0.5% (-0.3 Gy EQD2) per fraction for CTVHR. The shielding effect of the titanium applicator resulted in a decrease of 2% for D2cm(3) to the organ at risk versus 0.7% for plastic. Lower doses were reported when calculating with Acuros compared to TG-43. Differences in dose parameters were larger in breast cases. A lower impact on clinical dose parameters was found for the cervix cases. Applicator material causes systematic shielding effects that can be taken into account.
Kara, Emre; Kutlar, Ahmet Ihsan; Aksel, Mehmet Haluk
2017-09-01
In this study, two-dimensional geometric and solution adaptive refinement/coarsening scheme codes are generated by the use of Cartesian grid generation techniques. In the solution of compressible, turbulent flows one-equation Spalart-Allmaras turbulence model is implemented. The performance of the flow solver is tested on the case of high Reynolds number, steady flow around NACA 0012 airfoil. The lift coefficient solution for the airfoil at a real-life-flight Reynolds number is compared with the experimental study in literature.
Elliptic Solvers with Adaptive Mesh Refinement on Complex Geometries
Energy Technology Data Exchange (ETDEWEB)
Phillip, B.
2000-07-24
Adaptive Mesh Refinement (AMR) is a numerical technique for locally tailoring the resolution computational grids. Multilevel algorithms for solving elliptic problems on adaptive grids include the Fast Adaptive Composite grid method (FAC) and its parallel variants (AFAC and AFACx). Theory that confirms the independence of the convergence rates of FAC and AFAC on the number of refinement levels exists under certain ellipticity and approximation property conditions. Similar theory needs to be developed for AFACx. The effectiveness of multigrid-based elliptic solvers such as FAC, AFAC, and AFACx on adaptively refined overlapping grids is not clearly understood. Finally, a non-trivial eye model problem will be solved by combining the power of using overlapping grids for complex moving geometries, AMR, and multilevel elliptic solvers.
Buckling Analysis of Grid-Stiffened Composite Shells
Wang, D.; Abdalla, M.M.
2014-01-01
There is a renewed interest in grid-stiffened composite structures; they are not only competitive with conventional stiffened constructions and sandwich shells in terms of weight but also enjoy superior damage tolerance properties. In this paper, both global and local structural instabilities are
Directory of Open Access Journals (Sweden)
Monica W. K. Kan
2013-01-01
Full Text Available Deterministic linear Boltzmann transport equation (D-LBTE solvers have recently been developed, and one of the latest available software codes, Acuros XB, has been implemented in a commercial treatment planning system for radiotherapy photon beam dose calculation. One of the major limitations of most commercially available model-based algorithms for photon dose calculation is the ability to account for the effect of electron transport. This induces some errors in patient dose calculations, especially near heterogeneous interfaces between low and high density media such as tissue/lung interfaces. D-LBTE solvers have a high potential of producing accurate dose distributions in and near heterogeneous media in the human body. Extensive previous investigations have proved that D-LBTE solvers were able to produce comparable dose calculation accuracy as Monte Carlo methods with a reasonable speed good enough for clinical use. The current paper reviews the dosimetric evaluations of D-LBTE solvers for external beam photon radiotherapy. This content summarizes and discusses dosimetric validations for D-LBTE solvers in both homogeneous and heterogeneous media under different circumstances and also the clinical impact on various diseases due to the conversion of dose calculation from a conventional convolution/superposition algorithm to a recently released D-LBTE solver.
BSCW Unstructured Grids - VGRID software
National Aeronautics and Space Administration — These grids were constructed using VGRID software from NASA Langley. The grids designed for node based (labeled 'nc') and cell-centered solvers are supplied. Grids...
HIRENASD Unstructured Grids - VGRID software
National Aeronautics and Space Administration — These grids were constructed using VGRID software from NASA Langley. The grids designed for node based (labeled 'nc') and cell-centered solvers are supplied. Grids...
Lai, Changliang; Wang, Junbiao; Liu, Chuang
2014-10-01
Six typical composite grid cylindrical shells are constructed by superimposing three basic types of ribs. Then buckling behavior and structural efficiency of these shells are analyzed under axial compression, pure bending, torsion and transverse bending by finite element (FE) models. The FE models are created by a parametrical FE modeling approach that defines FE models with original natural twisted geometry and orients cross-sections of beam elements exactly. And the approach is parameterized and coded by Patran Command Language (PCL). The demonstrations of FE modeling indicate the program enables efficient generation of FE models and facilitates parametric studies and design of grid shells. Using the program, the effects of helical angles on the buckling behavior of six typical grid cylindrical shells are determined. The results of these studies indicate that the triangle grid and rotated triangle grid cylindrical shell are more efficient than others under axial compression and pure bending, whereas under torsion and transverse bending, the hexagon grid cylindrical shell is most efficient. Additionally, buckling mode shapes are compared and provide an understanding of composite grid cylindrical shells that is useful in preliminary design of such structures.
HIRENASD Unstructured Grids - Centaur software
National Aeronautics and Space Administration — These grids were constructed using Centaur software at DLR in Germany. The grids designed for node based (labeled 'cv') and cell-centered solvers (labeled 'cc') are...
BSCW Unstructured Grids - VGRID software FINAL
National Aeronautics and Space Administration — These grids were constructed using VGRID software from NASA Langley. The grids designed for node based (labeled 'nc') and cell-centered solvers are supplied. Grids...
P. Zoeteweij (Peter)
2005-01-01
htmlabstractComposing constraint solvers based on tree search and constraint propagation through generic iteration leads to efficient and flexible constraint solvers. This was demonstrated using OpenSolver, an abstract branch-and-propagate tree search engine that supports a wide range of relevant
Sanan, P.; Schnepp, S. M.; May, D.; Schenk, O.
2014-12-01
-suited to solution on hybrid computational clusters. To manage the combinatorial explosion of solver options (which include hybridizations of all the approaches mentioned above), we leverage the modularity of the PETSc library.
Differential equations problem solver
Arterburn, David R
2012-01-01
REA's Problem Solvers is a series of useful, practical, and informative study guides. Each title in the series is complete step-by-step solution guide. The Differential Equations Problem Solver enables students to solve difficult problems by showing them step-by-step solutions to Differential Equations problems. The Problem Solvers cover material ranging from the elementary to the advanced and make excellent review books and textbook companions. They're perfect for undergraduate and graduate studies.The Differential Equations Problem Solver is the perfect resource for any class, any exam, and
A composite passive damping method of the LLCL-filter based grid-tied inverter
DEFF Research Database (Denmark)
Wu, Weimin; Huang, Min; Sun, Yunjie
2012-01-01
This paper investigates the maximum and the minimum gain of the proportional resonant based grid current controller for a grid-tied inverter with a passive damped high-order power filter. It is found that the choice of the controller gain is limited to the local maximum amplitude determined by Q......-factor around the characteristic frequency of the filter and grid impedance. To obtain the Q-factor of a high-order system, an equivalent circuit analysis method is proposed and illustrated through several classical passive damped LCL- and LLCL-filters. It is shown that both the RC parallel damper...... that is in parallel with the capacitor of the LCL-filter or with the Lf-Cf resonant circuit of the LLCL-filter, and the RL series damper in series with the grid-side inductor have their own application limits. Thus, a composite passive damped LLCL-filter for the grid-tied inverter is proposed, which can effectively...
Böhm, R.; Hufnagl, E.; Kupfer, R.; Engler, T.; Hausding, J.; Cherif, C.; Hufenbach, W.
2013-12-01
A significant improvement in the properties of plastic components can be achieved by introducing flexible multiaxial textile grids as reinforcement. This reinforcing concept is based on the layerwise bonding of biaxially or multiaxially oriented, completely stretched filaments of high-performance fibers, e.g. glass or carbon, and thermoplastic components, using modified warp knitting techniques. Such pre-consolidated grid-like textiles are particularly suitable for use in injection moulding, since the grid geometry is very robust with respect to flow pressure and temperature on the one hand and possesses an adjustable spacing to enable a complete filling of the mould cavity on the other hand. The development of pre-consolidated textile grids and their further processing into composites form the basis for providing tailored parts with a large number of additional integrated functions like fibrous sensors or electroconductive fibres. Composites reinforced in that way allow new product groups for promising lightweight structures to be opened up in future. The article describes the manufacturing process of this new composite class and their variability regarding reinforcement and function integration. An experimentally based study of the mechanical properties is performed. For this purpose, quasi-static and highly dynamic tensile tests have been carried out as well as impact penetration experiments. The reinforcing potential of the multiaxial grids is demonstrated by means of evaluating drop tower experiments on automotive components. It has been shown that the load-adapted reinforcement enables a significant local or global improvement of the properties of plastic components depending on industrial requirements.
KeplerSolver: Kepler equation solver
Gürkan, M. Atakan
2017-06-01
KeplerSolver solves Kepler's equation for arbitrary epoch and eccentricity, using continued fractions. It is written in C and its speed is nearly the same as the SWIFT routines, while achieving machine precision. It comes with a test program to demonstrate usage.
Directory of Open Access Journals (Sweden)
F. Benduhn
2016-11-01
Full Text Available The dissolution of semi-volatile inorganic gases such as ammonia and nitric acid into the aerosol aqueous phase has an important influence on the composition, hygroscopic properties, and size distribution of atmospheric aerosol particles. The representation of dissolution in global models is challenging due to inherent issues of numerical stability and computational expense. For this reason, simplified approaches are often taken, with many models treating dissolution as an equilibrium process. In this paper we describe the new dissolution solver HyDiS-1.0, which was developed for the global size-resolved simulation of aerosol inorganic composition. The solver applies a hybrid approach, which allows for some particle size classes to establish instantaneous gas-particle equilibrium, whereas others are treated time dependently (or dynamically. Numerical accuracy at a competitive computational expense is achieved by using several tailored numerical formalisms and decision criteria, such as for the time- and size-dependent choice between the equilibrium and dynamic approaches. The new hybrid solver is shown to have numerical stability across a wide range of numerical stiffness conditions encountered within the atmosphere. For ammonia and nitric acid, HyDiS-1.0 is found to be in excellent agreement with a fully dynamic benchmark solver. In the presence of sea salt aerosol, a somewhat larger bias is found under highly polluted conditions if hydrochloric acid is represented as a third semi-volatile species. We present first results of the solver's implementation into a global aerosol microphysics and chemistry transport model. We find that (1 the new solver predicts surface concentrations of nitrate and ammonium in reasonable agreement with observations over Europe, the USA, and East Asia, (2 models that assume gas-particle equilibrium will not capture the partitioning of nitric acid and ammonia into Aitken-mode-sized particles, and thus may be
NEW RSW & Wall Medium Mixed Element Grid
National Aeronautics and Space Administration — RSW Medium Mixed Element Grid with Viscous Wind Tunnel Wall at the root. This grid is for a node-based unstructured solver. Quad Surface Faces= 18432 Tria Surface...
NEW RSW & Wall Medium Fully Tetrahedral Grid
National Aeronautics and Space Administration — New Medium Fully Tetrahedral RSW Grid with viscous wind tunnel wall at the root. This grid is for a node-based unstructured solver. Medium Tet: Quad Surface Faces= 0...
NEW RSW & Wall Fine Fully Tetrahedral Grid
National Aeronautics and Space Administration — NEW RSW Fine Fully Tetrahedral Grid with Viscous Wind Tunnel wall at the root. This grid is for a node-based unstructured solver. Note that the CGNS file is very...
NEW RSW & Wall Coarse Tet Only Grid
National Aeronautics and Space Administration — This is the RSW Coarse Tet Only grid with the root viscous tunnel wall. This grid is for a node-based unstructured solver. Quad Surface Faces= 0 Tria Surface Faces=...
HIRENASD Unstructured Grids - VGRID software FINAL
National Aeronautics and Space Administration — These grids were constructed using VGRID software from NASA Langley. The grids designed for node based (labeled 'nc') and cell-centered (labeled 'cc') solvers are...
NEW RSW & Wall Fine Mixed Element Grid
National Aeronautics and Space Administration — RSW Fine Mixed Element Grid with viscous root wind tunnel wall. This grid is for a node-based unstructured solver. Quad Surface Faces= 38016 Tria Surface Faces=...
NEW RSW & Wall Coarse Mixed Element Grid
National Aeronautics and Space Administration — This is the Coarse Mixed Element Grid for the RSW with a viscous wall at the root. This grid is for a node-based unstructured solver. Quad Surface Faces= 9728 Tria...
Resolving Neighbourhood Relations in a Parallel Fluid Dynamic Solver
Frisch, Jerome
2012-06-01
Computational Fluid Dynamics simulations require an enormous computational effort if a physically reasonable accuracy should be reached. Therefore, a parallel implementation is inevitable. This paper describes the basics of our implemented fluid solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on different processes. A special server concept keeps track of every grid over all processes while minimising data transfer between the nodes. © 2012 IEEE.
An iterative solver for the 3D Helmholtz equation
Belonosov, Mikhail; Dmitriev, Maxim; Kostin, Victor; Neklyudov, Dmitry; Tcheverda, Vladimir
2017-09-01
We develop a frequency-domain iterative solver for numerical simulation of acoustic waves in 3D heterogeneous media. It is based on the application of a unique preconditioner to the Helmholtz equation that ensures convergence for Krylov subspace iteration methods. Effective inversion of the preconditioner involves the Fast Fourier Transform (FFT) and numerical solution of a series of boundary value problems for ordinary differential equations. Matrix-by-vector multiplication for iterative inversion of the preconditioned matrix involves inversion of the preconditioner and pointwise multiplication of grid functions. Our solver has been verified by benchmarking against exact solutions and a time-domain solver.
Best Practices for Unstructured Grid Shock Fitting
McCloud, Peter L.
2017-01-01
Unstructured grid solvers have well-known issues predicting surface heat fluxes when strong shocks are present. Various efforts have been made to address the underlying numerical issues that cause the erroneous predictions. The present work addresses some of the shortcomings of unstructured grid solvers, not by addressing the numerics, but by applying structured grid best practices to unstructured grids. A methodology for robust shock detection and shock fitting is outlined and applied to production relevant cases. Results achieved by using the Loci-CHEM Computational Fluid Dynamics solver are provided.
Energy Technology Data Exchange (ETDEWEB)
Hicks, M
2004-04-12
The Gamma-Ray Large Area Space Telescope is an orbital observatory being planned as a joint DOE/NASA mission. The primary support of the instrument requires a grid structure which is very stiff, strong, light-weight, and thermally conductive. A carbon fiber composite grid design using a novel manufacture technique is proposed which meets or exceeds an aluminum design in all performance criteria and is economically competitive as well. Finite element analysis, confirmed by testing of a sample grid, is used to examine trade-offs for the materials and layups. Based on these analyses, recommendations are given for a viable design.
A sparse version of IGA solvers
Beck, Joakim
2017-07-30
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
Experiments with Succinct Solvers
DEFF Research Database (Denmark)
Buchholtz, Mikael; Nielson, Hanne Riis; Nielson, Flemming
2002-01-01
The Succinct Solver of Nielson and Seidl is based on the Alternation-free Least Fixed Point Logic and it is implemented in SML using a combination of recursion, continuations, prefix trees and memoisation. It is known that the actual formulation of the analysis has a great impact on the execution...
Zheng, Qiao; Cheng, Shuying; Jia, Hongjie; Zhang, Hong; Liu, Si; Lai, Yunfeng; Yu, Jinling; Zhou, Haifang
2017-10-01
By combining the appropriate Ag metallic grids with a thin functional reduced graphene oxide (MGs/F-rGO) film, a suitable photoelectric flexible electrode of the polymer solar cells (PSCs) is obtained. The conductivity and transmission of the MGs/F-rGO composited films can be improved by HNO3 modified. The optimized sheet resistance and transmission of the flexible electrode achieve to 25 Ω □-1 and 83% at 550 nm wavelength. Flexible PSCs with the MGs/F-rGO electrode show 5.63% power conversion efficiency. The photoelectric properties of the MGs/F-rGO film comparable with that of ITO substrates guarantee a high short current and an enhanced PCE of the solar cells. This method provides a feasible way for fabricating low-cost and flexible PSCs.
DEFF Research Database (Denmark)
Bendtsen, Katja Maria Bangsgaard; Krych, Lukasz; Sørensen, Dorte Bratbo
2012-01-01
Stress has profound influence on the gastro-intestinal tract, the immune system and the behavior of the animal. In this study, the correlation between gut microbiota composition determined by Denaturing Grade Gel Electrophoresis (DGGE) and tag-encoded 16S rRNA gene amplicon pyrosequencing (454/FLX...... to grid floor. Stressing the mice clearly changed the cecal microbiota as determined by both DGGE and pyrosequencing. Odoribacter, Alistipes and an unclassified genus from the Coriobacteriaceae family increased significantly in the grid floor housed mice. Compared to baseline, the mice exposed to grid...... correlations were found between GM composition and IL-1α, IFN-γ, closed arm entries of Elevated Plus Maze, total time in Elevated Plus Maze, time spent in Light/Dark Box, and time spent in the inner zone of the Open Field as well as total time in the Open Field. Significant correlations were found...
Wu, Yuanqing
2015-03-01
Flash calculations have become a performance bottleneck in the simulation of compositional flow in subsurface reservoirs. We apply a sparse grid surrogate model to substitute the flash calculation and thus try to remove the bottleneck from the reservoir simulation. So instead of doing a flash calculation in each time step of the simulation, we just generate a sparse grid approximation of all possible results of the flash calculation before the reservoir simulation. Then we evaluate the constructed surrogate model to approximate the values of the flash calculation results from this surrogate during the simulations. The execution of the true flash calculation has been shifted from the online phase during the simulation to the offline phase before the simulation. Sparse grids are known to require only few unknowns in order to obtain good approximation qualities. In conjunction with local adaptivity, sparse grids ensure that the accuracy of the surrogate is acceptable while keeping the memory usage small by only storing a minimal amount of values for the surrogate. The accuracy of the sparse grid surrogate during the reservoir simulation is compared to the accuracy of using a surrogate based on regular Cartesian grids and the original flash calculation. The surrogate model improves the speed of the flash calculations and the simulation of the whole reservoir. In an experiment, it is shown that the speed of the online flash calculations is increased by about 2000 times and as a result the speed of the reservoir simulations has been enhanced by 21 times in the best conditions.
Directory of Open Access Journals (Sweden)
JunHee Kim
2015-03-01
Full Text Available A full-scale experimental program was used in this study to investigate the structural behavior of novel insulated concrete sandwich wall panels (SWPs reinforced with grid-type glass-fiber-reinforced polymer (GFRP shear connectors. Two kinds of insulation-expanded polystyrene (EPS and extruded polystyrene (XPS with 100 mm thickness were incased between the two concrete wythes to meet the increasing demand for the insulation performance of building envelope. One to four GFRP shear grids were used to examine the degree of composite action of the two concrete wythes. Ten specimens of SWPs were tested under displacement control subjected to four-point concentrated loads. The test results showed that the SWPs reinforced with GFRP grids as shear connectors developed a high degree of composite action resulting in high flexural strength. The specimens with EPS foam exhibited an enhanced load-displacement behavior compared with the specimens with XPS because of the relatively stronger bond between insulation and concrete. In addition, the ultimate strength of the test results was compared to the analytical prediction with the mechanical properties of only GRFP grids. The specimens with EPS insulation presented higher strength-based composite action than the ones with XPS insulation.
Kim, JunHee; You, Young-Chan
2015-03-03
A full-scale experimental program was used in this study to investigate the structural behavior of novel insulated concrete sandwich wall panels (SWPs) reinforced with grid-type glass-fiber-reinforced polymer (GFRP) shear connectors. Two kinds of insulation-expanded polystyrene (EPS) and extruded polystyrene (XPS) with 100 mm thickness were incased between the two concrete wythes to meet the increasing demand for the insulation performance of building envelope. One to four GFRP shear grids were used to examine the degree of composite action of the two concrete wythes. Ten specimens of SWPs were tested under displacement control subjected to four-point concentrated loads. The test results showed that the SWPs reinforced with GFRP grids as shear connectors developed a high degree of composite action resulting in high flexural strength. The specimens with EPS foam exhibited an enhanced load-displacement behavior compared with the specimens with XPS because of the relatively stronger bond between insulation and concrete. In addition, the ultimate strength of the test results was compared to the analytical prediction with the mechanical properties of only GRFP grids. The specimens with EPS insulation presented higher strength-based composite action than the ones with XPS insulation.
Best Practices for Unstructured Grid Shock-Fitting
McCoud, Peter L.
2017-01-01
Unstructured grid solvers have well-known issues predicting surface heat fluxes when strong shocks are present. Various efforts have been made to address the underlying numerical issues that cause the erroneous predictions. The present work addresses some of the shortcomings of unstructured grid solvers, not by addressing the numerics, but by applying structured grid best practices to unstructured grids. A methodology for robust shock detection and shock-fitting is outlined and applied to production-relevant cases. Results
Advanced calculus problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of advanced calculus currently av
Electric circuits problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of electric circuits currently av
Moortgat, Joachim
2016-01-01
Problems of interest in hydrogeology and hydrocarbon resources involve complex heterogeneous geological formations. Such domains are most accurately represented in reservoir simulations by unstructured computational grids. Finite element methods accurately describe flow on unstructured meshes with complex geometries, and their flexible formulation allows implementation on different grid types. In this work, we consider for the first time the challenging problem of fully compositional three-phase flow in 3D unstructured grids, discretized by any combination of tetrahedra, prisms, and hexahedra. We employ a mass conserving mixed hybrid finite element (MHFE) method to solve for the pressure and flux fields. The transport equations are approximated with a higher-order vertex-based discontinuous Galerkin (DG) discretization. We show that this approach outperforms a face-based implementation of the same polynomial order. These methods are well suited for heterogeneous and fractured reservoirs, because they provide ...
Energy Technology Data Exchange (ETDEWEB)
GARDNER, P.R.
2006-04-01
Sudoku, also known as Number Place, is a logic-based placement puzzle. The aim of the puzzle is to enter a numerical digit from 1 through 9 in each cell of a 9 x 9 grid made up of 3 x 3 subgrids (called ''regions''), starting with various digits given in some cells (the ''givens''). Each row, column, and region must contain only one instance of each numeral. Completing the puzzle requires patience and logical ability. Although first published in a U.S. puzzle magazine in 1979, Sudoku initially caught on in Japan in 1986 and attained international popularity in 2005. Last fall, after noticing Sudoku puzzles in some newspapers and magazines, I attempted a few just to see how hard they were. Of course, the difficulties varied considerably. ''Obviously'' one could use Trial and Error but all the advice was to ''Use Logic''. Thinking to flex, and strengthen, those powers, I began to tackle the puzzles systematically. That is, when I discovered a new tactical rule, I would write it down, eventually generating a list of ten or so, with some having overlap. They served pretty well except for the more difficult puzzles, but even then I managed to develop an additional three rules that covered all of them until I hit the Oregonian puzzle shown. With all of my rules, I could not seem to solve that puzzle. Initially putting my failure down to rapid mental fatigue (being unable to hold a sufficient quantity of information in my mind at one time), I decided to write a program to implement my rules and see what I had failed to notice earlier. The solver, too, failed. That is, my rules were insufficient to solve that particular puzzle. I happened across a book written by a fellow who constructs such puzzles and who claimed that, sometimes, the only tactic left was trial and error. With a trial and error routine implemented, my solver successfully completed the Oregonian puzzle, and has successfully
Directory of Open Access Journals (Sweden)
ARUN, K.
2016-05-01
Full Text Available A modified digital signal processing procedure is described for the on-line estimation of DC, fundamental and harmonics of periodic signal. A frequency locked loop (FLL incorporated within the parallel structure of observers is proposed to accommodate a wide range of frequency drift. The error in frequency generated under drifting frequencies has been used for changing the sampling frequency of the composite observer, so that the number of samples per cycle of the periodic waveform remains constant. A standard coupled oscillator with automatic gain control is used as numerically controlled oscillator (NCO to generate the enabling pulses for the digital observer. The NCO gives an integer multiple of the fundamental frequency making it suitable for power quality applications. Another observer with DC and second harmonic blocks in the feedback path act as filter and reduces the double frequency content. A systematic study of the FLL is done and a method has been proposed to design the controller. The performance of FLL is validated through simulation and experimental studies. To illustrate applications of the new FLL, estimation of individual harmonics from nonlinear load and the design of a variable sampling resonant controller, for a single phase grid-connected inverter have been presented.
Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
Paszyńska, Anna
2015-06-01
This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.
DEFF Research Database (Denmark)
N., Kroll; P., Renzoni; M., Amato
1998-01-01
The purpose of this paper is to describe the influence of different Navier-Stokes solvers and grids on the prediction of the global coefficients for a simplified geometry of a helicopter fuselage.......The purpose of this paper is to describe the influence of different Navier-Stokes solvers and grids on the prediction of the global coefficients for a simplified geometry of a helicopter fuselage....
Sherlock Holmes, Master Problem Solver.
Ballew, Hunter
1994-01-01
Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)
Tests of a 3D Self Magnetic Field Solver in the Finite Element Gun Code MICHELLE
Nelson, Eric M
2005-01-01
We have recently implemented a prototype 3d self magnetic field solver in the finite-element gun code MICHELLE. The new solver computes the magnetic vector potential on unstructured grids. The solver employs edge basis functions in the curl-curl formulation of the finite-element method. A novel current accumulation algorithm takes advantage of the unstructured grid particle tracker to produce a compatible source vector, for which the singular matrix equation is easily solved by the conjugate gradient method. We will present some test cases demonstrating the capabilities of the prototype 3d self magnetic field solver. One test case is self magnetic field in a square drift tube. Another is a relativistic axisymmetric beam freely expanding in a round pipe.
Explicit solvers in an implicit code
Martinez Montesinos, Beatriz; Kaus, Boris J. P.; Popov, Anton
2017-04-01
Many geodynamic processes occur over long timescales (millions of years), and are best solved with implicit solvers. Yet, some processes, such as hydrofracking, or wave propagation, occur over smaller timescales. In those cases, it might be advantageous to use an explicit rather than an implicit approach as it requires significantly less memory and computational costs. Here, we discuss our ongoing work to include explicit solvers in the parallel software package LaMEM (Lithosphere and Mantle Evolution Model). As a first step, we focus on modelling seismic wave propagation in heterogeneous 3D poro-elasto-plastic models. To do that, we add inertial terms to the momentum equations as well as elastic compressibility to the mass conservation equations in an explicit way using the staggered grid finite difference discretization method. Results are similar to that of existing wave propagation codes and are capable to simulate wave propagation in heterogeneous media. To simulate geomechanical problems, timestep restrictions posed by the seismic wave speed are usually too severe to allow simulating deformation on a timescale of months-years. The classical (FLAC) method introduces a mass-density scaling in which a non-physical (larger) density is employed in the momentum equations. We will discuss how this method fits simple benchmarks for elastic and elastoplastic deformation. As an application, we use the code to model different complex media subject to compression and we investigate how mass scaling influence in our results.
Ghosh, Tarini Shankar; Mehra, Varun; Mande, Sharmila S
2015-06-01
Metagenomics approach involves extraction, sequencing and characterization of the genomic content of entire community of microbes present in a given environment. In contrast to genomic data, accurate assembly of metagenomic sequences is a challenging task. Given the huge volume and the diverse taxonomic origin of metagenomic sequences, direct application of single genome assembly methods on metagenomes are likely to not only lead to an immense increase in requirements of computational infrastructure, but also result in the formation of chimeric contigs. A strategy to address the above challenge would be to partition metagenomic sequence datasets into clusters and assemble separately the sequences in individual clusters using any single-genome assembly method. The current study presents such an approach that uses tetranucleotide usage patterns to first represent sequences as points in a three dimensional (3D) space. The 3D space is subsequently partitioned into "Grids". Sequences within overlapping grids are then progressively assembled using any available assembler. We demonstrate the applicability of the current Grid-Assembly method using various categories of assemblers as well as different simulated metagenomic datasets. Validation results indicate that the Grid-Assembly approach helps in improving the overall quality of assembly, in terms of the purity and volume of the assembled contigs.
A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations
Rattermann, Dale Nicholas
Fast Poisson solvers using the Fast Fourier Transform on uniform grids are especially suited for parallel implementation, making them appropriate for portability on graphical processing unit (GPU) devices. The goal of the following work was to implement, test, and evaluate a fast Poisson solver for periodic boundary conditions for use on a variety of GPU configurations. The solver used in this research was FLASH, an immersed-boundary-based method, which is well suited for complex, time-dependent geometries, has robust adaptive mesh refinement/de-refinement capabilities to capture evolving flow structures, and has been successfully implemented on conventional, parallel supercomputers. However, these solvers are still computationally costly to employ, and the total solver time is dominated by the solution of the pressure Poisson equation using state-of-the-art multigrid methods. FLASH improves the performance of its multigrid solvers by integrating a parallel FFT solver on a uniform grid during a coarse level. This hybrid solver could then be theoretically improved by replacing the highly-parallelizable FFT solver with one that utilizes GPUs, and, thus, was the motivation for my research. In the present work, the CPU-utilizing parallel FFT solver (PFFT) used in the base version of FLASH for solving the Poisson equation on uniform grids has been modified to enable parallel execution on CUDA-enabled GPU devices. New algorithms have been implemented to replace the Poisson solver that decompose the computational domain and send each new block to a GPU for parallel computation. One-dimensional (1-D) decomposition of the computational domain minimizes the amount of network traffic involved in this bandwidth-intensive computation by limiting the amount of all-to-all communication required between processes. Advanced techniques have been incorporated and implemented in a GPU-centric code design, while allowing end users the flexibility of parameter control at runtime in
Modern solvers for Helmholtz problems
Tang, Jok; Vuik, Kees
2017-01-01
This edited volume offers a state of the art overview of fast and robust solvers for the Helmholtz equation. The book consists of three parts: new developments and analysis in Helmholtz solvers, practical methods and implementations of Helmholtz solvers, and industrial applications. The Helmholtz equation appears in a wide range of science and engineering disciplines in which wave propagation is modeled. Examples are: seismic inversion, ultrasone medical imaging, sonar detection of submarines, waves in harbours and many more. The partial differential equation looks simple but is hard to solve. In order to approximate the solution of the problem numerical methods are needed. First a discretization is done. Various methods can be used: (high order) Finite Difference Method, Finite Element Method, Discontinuous Galerkin Method and Boundary Element Method. The resulting linear system is large, where the size of the problem increases with increasing frequency. Due to higher frequencies the seismic images need to b...
Scalable Parallel Algebraic Multigrid Solvers
Energy Technology Data Exchange (ETDEWEB)
Bank, R; Lu, S; Tong, C; Vassilevski, P
2005-03-23
The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.
TIGER: Turbomachinery interactive grid generation
Soni, Bharat K.; Shih, Ming-Hsin; Janus, J. Mark
1992-01-01
A three dimensional, interactive grid generation code, TIGER, is being developed for analysis of flows around ducted or unducted propellers. TIGER is a customized grid generator that combines new technology with methods from general grid generation codes. The code generates multiple block, structured grids around multiple blade rows with a hub and shroud for either C grid or H grid topologies. The code is intended for use with a Euler/Navier-Stokes solver also being developed, but is general enough for use with other flow solvers. TIGER features a silicon graphics interactive graphics environment that displays a pop-up window, graphics window, and text window. The geometry is read as a discrete set of points with options for several industrial standard formats and NASA standard formats. Various splines are available for defining the surface geometries. Grid generation is done either interactively or through a batch mode operation using history files from a previously generated grid. The batch mode operation can be done either with a graphical display of the interactive session or with no graphics so that the code can be run on another computer system. Run time can be significantly reduced by running on a Cray-YMP.
W.M. Lioen (Walter); J.J.B. de Swart (Jacques); W.A. van der Veen
1996-01-01
textabstractIn this paper a collection of Initial Value test Problems for systems of Ordinary Differential Equations, Implicit Differential Equations and Differential-Algebraic Equations is presented. This test set is maintained by the project group for Parallel IVP Solvers of CWI, department of
Verification and Validation Studies for the LAVA CFD Solver
Moini-Yekta, Shayan; Barad, Michael F; Sozer, Emre; Brehm, Christoph; Housman, Jeffrey A.; Kiris, Cetin C.
2013-01-01
The verification and validation of the Launch Ascent and Vehicle Aerodynamics (LAVA) computational fluid dynamics (CFD) solver is presented. A modern strategy for verification and validation is described incorporating verification tests, validation benchmarks, continuous integration and version control methods for automated testing in a collaborative development environment. The purpose of the approach is to integrate the verification and validation process into the development of the solver and improve productivity. This paper uses the Method of Manufactured Solutions (MMS) for the verification of 2D Euler equations, 3D Navier-Stokes equations as well as turbulence models. A method for systematic refinement of unstructured grids is also presented. Verification using inviscid vortex propagation and flow over a flat plate is highlighted. Simulation results using laminar and turbulent flow past a NACA 0012 airfoil and ONERA M6 wing are validated against experimental and numerical data.
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf
2010-01-01
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.
A Multigrid Approach to Embedded-Grid Solvers
1992-08-01
that the Government may have formulated or in any way supplied the said drawings, specifications, or other data, is not to be regarded by implication...previously as a Master’s Thesis at the University of Florida. Not edited by TESCO , Inc. 12a. DISTRIBUTION / AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE...The quasi-linear form of the Euler equations is obtained from Eq. 1 by defining the flux Jacobian matrices as Ak = OFk/&Q and applying the chain
Calo, Victor M.
2011-05-14
The multi-frontal direct solver is the state of the art for the direct solution of linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from p finite elements. Specifically we provide the estimates for systems resulting from C0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis.
M2Di: MATLAB 2D Stokes solvers using the Finite Difference method
Räss, Ludovic; Duretz, Thibault; Schmalholz, Stefan; Podladchikov, Yury
2017-04-01
The study of coupled processes in Earth Sciences leads to the development of multiphysics modelling tools. Mechanical solvers represent the essential ingredient of any of these tools such that their performance and robustness is generally dictated by that of the mechanical solver. Here, we present M2Di, a collection of MATLAB routines designed for studying 2D linear and power law incompressible viscous flow using Finite Difference discretisation. The scripts are written in a concise vectorised MATLAB fashion and rely on fast and robust linear and non-linear solvers (Picard and Newton iterations). As a result, time to solution of 22 seconds for linear viscous flow with 104 viscosity jump on 10002 grid points can be achieved on a standard personal computer. We will present a numerous example of applications that span from high resolution crystal-melt dynamics, deformation of heterogeneous power law viscous fluids, instantaneous mantle flow patterns in cylindrical coordinates, and calculation of pressure gradients around inclusions using variable grid spacing. We use analytical solution for linear viscous flow with highly variable viscosity to validate the linear flow solver. Validation of the non-linear solver is achieved by comparing numerical solution to analytic and benchmark solutions of power law viscous folding and necking. The M2Di codes are open source and can hence be used for research or educational purposes.
Gong, Weiwei; Zhou, Xu
2017-06-01
In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design. This paper reviews the main algorithms of the SAT solver in recent years, including serial SAT algorithms, parallel SAT algorithms, SAT algorithms based on GPU, and SAT algorithms based on FPGA. The development of SAT is analyzed comprehensively in this paper. Finally, several possible directions for the development of the SAT problem are proposed.
Miao, Sha; Hendrickson, Kelli; Liu, Yuming
2017-12-01
This work presents a Fully-Coupled Immersed Flow (FCIF) solver for the three-dimensional simulation of fluid-fluid interaction by coupling two distinct flow solvers using an Immersed Boundary (IB) method. The FCIF solver captures dynamic interactions between two fluids with disparate flow properties, while retaining the desirable simplicity of non-boundary-conforming grids. For illustration, we couple an IB-based unsteady Reynolds Averaged Navier Stokes (uRANS) simulator with a depth-integrated (long-wave) solver for the application of slug development with turbulent gas and laminar liquid. We perform a series of validations including turbulent/laminar flows over prescribed wavy boundaries and freely-evolving viscous fluids. These confirm the effectiveness and accuracy of both one-way and two-way coupling in the FCIF solver. Finally, we present a simulation example of the evolution from a stratified turbulent/laminar flow through the initiation of a slug that nearly bridges the channel. The results show both the interfacial wave dynamics excited by the turbulent gas forcing and the influence of the liquid on the gas turbulence. These results demonstrate that the FCIF solver effectively captures the essential physics of gas-liquid interaction and can serve as a useful tool for the mechanistic study of slug generation in two-phase gas/liquid flows in channels and pipes.
Predicting SMT Solver Performance for Software Verification
Directory of Open Access Journals (Sweden)
Andrew Healy
2017-01-01
Full Text Available The Why3 IDE and verification system facilitates the use of a wide range of Satisfiability Modulo Theories (SMT solvers through a driver-based architecture. We present Where4: a portfolio-based approach to discharge Why3 proof obligations. We use data analysis and machine learning techniques on static metrics derived from program source code. Our approach benefits software engineers by providing a single utility to delegate proof obligations to the solvers most likely to return a useful result. It does this in a time-efficient way using existing Why3 and solver installations - without requiring low-level knowledge about SMT solver operation from the user.
A simple compact fourth-order Poisson solver on polar geometry
Lai, M C
2002-01-01
We present a simple and efficient compact fourth-order Poisson solver in polar coordinates. This solver relies on the truncated Fourier series expansion, where the differential equations of the Fourier coefficients are solved by the compact fourth-order finite difference scheme. By shifting a grid a half mesh away from the origin and incorporating the symmetry constraint of Fourier coefficients, we can easily handle coordinate singularities without pole conditions. The numerical evidence confirms fourth-order accuracy for the problem on an annulus and third-order accuracy for the problem on a disk. In addition, a simple and comparably accurate approximation for the derivatives of the solution is also presented.
Energy Technology Data Exchange (ETDEWEB)
Fisher, A. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Bailey, D. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Kaiser, T. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eder, D. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Gunney, B. T. N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Masters, N. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Koniges, A. E. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Anderson, R. W. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-02-01
Here, we present a novel method for the solution of the diffusion equation on a composite AMR mesh. This approach is suitable for including diffusion based physics modules to hydrocodes that support ALE and AMR capabilities. To illustrate, we proffer our implementations of diffusion based radiation transport and heat conduction in a hydrocode called ALE-AMR. Numerical experiments conducted with the diffusion solver and associated physics packages yield 2nd order convergence in the L_{2} norm.
Wind Turbine Aerodynamics Using an Incompressible Overset Grid Method
DEFF Research Database (Denmark)
Zahle, Frederik; Johansen, Jeppe; Sørensen, Niels
2007-01-01
In this paper 3D Navier-Stokes simulations of the unsteady flow over the NREL Phase VI turbine are presented. The computations are carried out using the structured grid, incompressible, finite volume flow solver EllipSys3D, which has been extended to include the use of overset grids. Computations...
Houston, Johnny L.
1990-01-01
Program EAGLE (Eglin Arbitrary Geometry Implicit Euler) is a multiblock grid generation and steady-state flow solver system. This system combines a boundary conforming surface generation, a composite block structure grid generation scheme, and a multiblock implicit Euler flow solver algorithm. The three codes are intended to be used sequentially from the definition of the configuration under study to the flow solution about the configuration. EAGLE was specifically designed to aid in the analysis of both freestream and interference flow field configurations. These configurations can be comprised of single or multiple bodies ranging from simple axisymmetric airframes to complex aircraft shapes with external weapons. Each body can be arbitrarily shaped with or without multiple lifting surfaces. Program EAGLE is written to compile and execute efficiently on any CRAY machine with or without Solid State Disk (SSD) devices. Also, the code uses namelist inputs which are supported by all CRAY machines using the FORTRAN Compiler CF177. The use of namelist inputs makes it easier for the user to understand the inputs and to operate Program EAGLE. Recently, the Code was modified to operate on other computers, especially the Sun Spare4 Workstation. Several two-dimensional grid configurations were completely and successfully developed using EAGLE. Currently, EAGLE is being used for three-dimension grid applications.
Test set for initial value problem solvers
W.M. Lioen (Walter); J.J.B. de Swart (Jacques)
1998-01-01
textabstractThe CWI test set for IVP solvers presents a collection of Initial Value Problems to test solvers for implicit differential equations. This test set can both decrease the effort for the code developer to test his software in a reliable way, and cross the bridge between the application
Improving Resource-Unaware SAT Solvers
Hölldobler, Steffen; Manthey, Norbert; Saptawijaya, Ari
The paper discusses cache utilization in state-of-the-art SAT solvers. The aim of the study is to show how a resource-unaware SAT solver can be improved by utilizing the cache sensibly. The analysis is performed on a CDCL-based SAT solver using a subset of the industrial SAT Competition 2009 benchmark. For the analysis, the total cycles, the resource stall cycles, the L2 cache hits and the L2 cache misses are traced using sample based profiling. Based on the analysis, several techniques - some of which have not been used in SAT solvers so far - are proposed resulting in a combined speedup up to 83% without affecting the search path of the solver. The average speedup on the benchmark is 60%. The new techniques are also applied to MiniSAT2.0 improving its runtime by 20% on average.
Handling software upgradeability problems with MILP solvers
Directory of Open Access Journals (Sweden)
Claude Michel
2010-07-01
Full Text Available Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the "best" solution according to some criteria, to install, remove or upgrade packages in a given installation. This is a difficult problem: the complexity of the upgradeability problem is NP complete and modern OS contain a huge number of packages (often more than 20 000 packages in a Linux distribution. Moreover, several optimisation criteria have to be considered, e.g., stability, memory efficiency, network efficiency. In this paper we investigate the capabilities of MILP solvers to handle this problem. We show that MILP solvers are very efficient when the resolution is based on a linear combination of the criteria. Experiments done on real benchmarks show that the best MILP solvers outperform CP solvers and that they are significantly better than Pseudo Boolean solvers.
Towards Green Multi-frontal Solver for Adaptive Finite Element Method
AbbouEisha, H.
2015-06-01
In this paper we present the optimization of the energy consumption for the multi-frontal solver algorithm executed over two dimensional grids with point singularities. The multi-frontal solver algorithm is controlled by so-called elimination tree, defining the order of elimination of rows from particular frontal matrices, as well as order of memory transfers for Schur complement matrices. For a given mesh there are many possible elimination trees resulting in different number of floating point operations (FLOPs) of the solver or different amount of data trans- ferred via memory transfers. In this paper we utilize the dynamic programming optimization procedure and we compare elimination trees optimized with respect to FLOPs with elimination trees optimized with respect to energy consumption.
National Research Council Canada - National Science Library
Bangsgaard Bendtsen, Katja Maria; Krych, Lukasz; Sørensen, Dorte Bratbo; Pang, Wanyong; Nielsen, Dennis Sandris; Josefsen, Knud; Hansen, Lars H; Sørensen, Søren J; Hansen, Axel Kornerup
2012-01-01
... (Elevated Plus Maze, Light/Dark Box, and Open Field combined), the Tail Suspension Test, and Burrowing in 28 female BALB/c mice exposed to two weeks of grid floor induced stress was investigated...
ALPS - A LINEAR PROGRAM SOLVER
Viterna, L. A.
1994-01-01
Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.
s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
Energy Technology Data Exchange (ETDEWEB)
Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Lijewski, Mike [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Almgren, Ann [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Straalen, Brian Van [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Carson, Erin [Univ. of California, Berkeley, CA (United States); Knight, Nicholas [Univ. of California, Berkeley, CA (United States); Demmel, James [Univ. of California, Berkeley, CA (United States)
2014-08-14
Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual sub domain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence grows with problem size, and the time for each collective operation increases with machine scale, bottom solves in large-scale applications can constitute a significant fraction of the overall multigrid solve time. In this paper, we implement, evaluate, and optimize a communication-avoiding s-step formulation of BiCGStab (CABiCGStab for short) as a high-performance, distributed-memory bottom solver for geometric multigrid solvers. This is the first time s-step Krylov subspace methods have been leveraged to improve multigrid bottom solver performance. We use a synthetic benchmark for detailed analysis and integrate the best implementation into BoxLib in order to evaluate the benefit of a s-step Krylov subspace method on the multigrid solves found in the applications LMC and Nyx on up to 32,768 cores on the Cray XE6 at NERSC. Overall, we see bottom solver improvements of up to 4.2x on synthetic problems and up to 2.7x in real applications. This results in as much as a 1.5x improvement in solver performance in real applications.
Ferencz, Donald C.; Viterna, Larry A.
1991-01-01
ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.
Leveraging TSP Solver Complementarity through Machine Learning.
Kerschke, Pascal; Kotthoff, Lars; Bossek, Jakob; Hoos, Holger H; Trautmann, Heike
2017-08-24
The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers-namely, LKH, EAX, restart variants of those, and MAOS-on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.
Finite volume methods for the incompressible Navier-Stokes equations on unstructured grids
Energy Technology Data Exchange (ETDEWEB)
Meese, Ernst Arne
1998-07-01
Most solution methods of computational fluid dynamics (CFD) use structured grids based on curvilinear coordinates for compliance with complex geometries. In a typical industry application, about 80% of the time used to produce the results is spent constructing computational grids. Recently the use of unstructured grids has been strongly advocated. For unstructured grids there are methods for generating them automatically on quite complex domains. This thesis focuses on the design of Navier-Stokes solvers that can cope with unstructured grids and ''low quality grids'', thus reducing the need for human intervention in the grid generation.
Inductive ionospheric solver for magnetospheric MHD simulations
Directory of Open Access Journals (Sweden)
H. Vanhamäki
2011-01-01
Full Text Available We present a new scheme for solving the ionospheric boundary conditions required in magnetospheric MHD simulations. In contrast to the electrostatic ionospheric solvers currently in use, the new solver takes ionospheric induction into account by solving Faraday's law simultaneously with Ohm's law and current continuity. From the viewpoint of an MHD simulation, the new inductive solver is similar to the electrostatic solvers, as the same input data is used (field-aligned current [FAC] and ionospheric conductances and similar output is produced (ionospheric electric field. The inductive solver is tested using realistic, databased models of an omega-band and westward traveling surge. Although the tests were performed with local models and MHD simulations require a global ionospheric solution, we may nevertheless conclude that the new solution scheme is feasible also in practice. In the test cases the difference between static and electrodynamic solutions is up to ~10 V km−1 in certain locations, or up to 20-40% of the total electric field. This is in agreement with previous estimates. It should also be noted that if FAC is replaced by the ground magnetic field (or ionospheric equivalent current in the input data set, exactly the same formalism can be used to construct an inductive version of the KRM method originally developed by Kamide et al. (1981.
Adaptive Mesh Refinement in Curvilinear Body-Fitted Grid Systems
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.
A multilevel in space and energy solver for multigroup diffusion eigenvalue problems
Directory of Open Access Journals (Sweden)
Ben C. Yee
2017-09-01
Full Text Available In this paper, we present a new multilevel in space and energy diffusion (MSED method for solving multigroup diffusion eigenvalue problems. The MSED method can be described as a PI scheme with three additional features: (1 a grey (one-group diffusion equation used to efficiently converge the fission source and eigenvalue, (2 a space-dependent Wielandt shift technique used to reduce the number of PIs required, and (3 a multigrid-in-space linear solver for the linear solves required by each PI step. In MSED, the convergence of the solution of the multigroup diffusion eigenvalue problem is accelerated by performing work on lower-order equations with only one group and/or coarser spatial grids. Results from several Fourier analyses and a one-dimensional test code are provided to verify the efficiency of the MSED method and to justify the incorporation of the grey diffusion equation and the multigrid linear solver. These results highlight the potential efficiency of the MSED method as a solver for multidimensional multigroup diffusion eigenvalue problems, and they serve as a proof of principle for future work. Our ultimate goal is to implement the MSED method as an efficient solver for the two-dimensional/three-dimensional coarse mesh finite difference diffusion system in the Michigan parallel characteristics transport code. The work in this paper represents a necessary step towards that goal.
DRAGON Grid: A Three-Dimensional Hybrid Grid Generation Code Developed
Liou, Meng-Sing
2000-01-01
Because grid generation can consume 70 percent of the total analysis time for a typical three-dimensional viscous flow simulation for a practical engineering device, payoffs from research and development could reduce costs and increase throughputs considerably. In this study, researchers at the NASA Glenn Research Center at Lewis Field developed a new hybrid grid approach with the advantages of flexibility, high-quality grids suitable for an accurate resolution of viscous regions, and a low memory requirement. These advantages will, in turn, reduce analysis time and increase accuracy. They result from an innovative combination of structured and unstructured grids to represent the geometry and the computation domain. The present approach makes use of the respective strengths of both the structured and unstructured grid methods, while minimizing their weaknesses. First, the Chimera grid generates high-quality, mostly orthogonal meshes around individual components. This process is flexible and can be done easily. Normally, these individual grids are required overlap each other so that the solution on one grid can communicate with another. However, when this communication is carried out via a nonconservative interpolation procedure, a spurious solution can result. Current research is aimed at entirely eliminating this undesired interpolation by directly replacing arbitrary grid overlapping with a nonstructured grid called a DRAGON grid, which uses the same set of conservation laws over the entire region, thus ensuring conservation everywhere. The DRAGON grid is shown for a typical film-cooled turbine vane with 33 holes and 3 plenum compartments. There are structured grids around each geometrical entity and unstructured grids connecting them. In fiscal year 1999, Glenn researchers developed and tested the three-dimensional DRAGON grid-generation tools. A flow solver suitable for the DRAGON grid has been developed, and a series of validation tests are underway.
Conversion of contours to cartesian grids
DEFF Research Database (Denmark)
Mann, Jakob; Broe, Brian Riget
A robust and efficient method of calculating a cartesian grid of heights or roughnesses from contour line maps is developed. The purpose of the grids is to serve as input for atmospheric flow solvers such as WAsP Engineering or EllipSys3D. The method builds on Delaunay triangulation constrained...... to include all contour segments in the triangulation. It is furthermore refined to avoid spurious flat areas produced by the Delaunay triangulation. Robust ways to extrapolate beyond the convex hull of the map points are provided....
Nested head-tail Vlasov solver
Directory of Open Access Journals (Sweden)
A. Burov
2014-02-01
Full Text Available Nested head-tail is a Vlasov solver for transverse oscillations in multibunch beams. It takes into account azimuthal, radial, coupled-bunch, and beam-beam degrees of freedom affected by arbitrary dipole wakes, feedback damper,beam-beam effects and Landau damping.
Benchmarking optimization solvers for structural topology optimization
DEFF Research Database (Denmark)
Rojas Labanda, Susana; Stolpe, Mathias
2015-01-01
sizes is developed for this benchmarking. The problems are based on a material interpolation scheme combined with a density filter. Different optimization solvers including Optimality Criteria (OC), the Method of Moving Asymptotes (MMA) and its globally convergent version GCMMA, the interior point...
Indian Academy of Sciences (India)
IAS Admin
global view and optimize the configuration and the use of all the computers, particularly high performance servers wherever they are. An enterprise grid is ... attributes: business model, architecture, resource management, security model, programming model, and applications [6]. Business Model. Grid is formed by 'not for ...
Laser engine simulation using pressure based Navier-Stokes solver
Youssef, Hazim Saad
1994-03-01
Analysis of the flow field in a laser engine represents a difficult computational problem involving combinations of complex physical and gas-dynamical processes. Following a brief discussion of these processes a calculation procedure using primitive variables formulation on a nonstaggered grid system is introduced. Based on this procedure, a pressure based Navier-Stokes solver (PBNS) is developed using a generalized curvilinear coordinate system. The solver is first tested in application to a subsonic compressible flow over an insulated flat plate and to a flow in an axisymmetric converging-diverging nozzle. Next, the PBNS code is used to analyze the flowfield and performance of a laser thruster. The physical/numerical model includes the geometric ray tracing for the laser beam, beam power absorption, plasma radiation losses, and plasma thermophysical and optical properties. Equilibrium hydrogen is used as a flowing gas and its properties are calculated using the Hydrogen Properties Calculation (HPC) based on the methods of statistical thermodynamics. Two thrustor configurations, two laser types (CO2 and iodide), various laser power levels, and various injection conditions are tested. The results of these tests include the temperature, pressure, velocity, and Mach number contours, as well as tables of the laser beam power absorbed, radiation losses to the thrustor walls, thrust level, and specific impulse. The maximum specific impulse obtained in these tests is 1537 sec for a CO2 laser thruster and 827 sec for an iodide laser thruster. Up to 100% power absorption can be achieved; however, radiation losses from the hot plasma are quite high disallowing a full conversion of the absorbed power into the thermal energy of the propellant. The PBNS code can be used to study the effects of various design parameters on the performance of a laser thruster and provide guidelines for the preliminary design of a laser engine.
Wind Turbine Rotor-Tower Interaction Using an Incompressible Overset Grid Method
DEFF Research Database (Denmark)
Zahle, Frederik; Johansen, Jeppe; Sørensen, Niels
2007-01-01
In this paper 3D Navier-Stokes simulations of the flow over the NREL Phase VI turbine are presented. The computations are carried out using the structured grid, incompressible, finite volume flow solver EllipSys3D, which has been extended to include the use of overset grids. Computations are pres...
Ramses-GPU: Second order MUSCL-Handcock finite volume fluid solver
Kestener, Pierre
2017-10-01
RamsesGPU is a reimplementation of RAMSES (ascl:1011.007) which drops the adaptive mesh refinement (AMR) features to optimize 3D uniform grid algorithms for modern graphics processor units (GPU) to provide an efficient software package for astrophysics applications that do not need AMR features but do require a very large number of integration time steps. RamsesGPU provides an very efficient C++/CUDA/MPI software implementation of a second order MUSCL-Handcock finite volume fluid solver for compressible hydrodynamics as a magnetohydrodynamics solver based on the constraint transport technique. Other useful modules includes static gravity, dissipative terms (viscosity, resistivity), and forcing source term for turbulence studies, and special care was taken to enhance parallel input/output performance by using state-of-the-art libraries such as HDF5 and parallel-netcdf.
Application of wavelets to a Poisson equation solver and its parallel processing
Energy Technology Data Exchange (ETDEWEB)
Tanaka, Nobuatsu [Toshiba Corp., Kawasaki, Kanagawa (Japan)
1998-03-01
This paper describes a powerful and simple new wavelet-based preconditioning method for the CG solvers of Poisson equation. The equation can be solved with an iterative matrix solver, however, in the absence of our method, the computing time will increase exponentially with respect to an increase in grid points. Use of our technique leads to a matrix with a bounded condition number so that computing time is reduced significantly. Results from our numerical experiments confirm the power and accuracy of our wavelet-based preconditioning method. Unlike many preconditioning methods which are not suitable for vector and parallel processing, our algorithm can take advantage of the extra processing capabilities and enhance computing performance. For example, a speed up of over 100 fold can be achieved when solving Poisson equations on a Cray T3D using 128 processors in parallel. (author)
Parallel performance of a preconditioned CG solver for unstructured finite element applications
Energy Technology Data Exchange (ETDEWEB)
Shadid, J.N.; Hutchinson, S.A.; Moffat, H.K. [Sandia National Labs., Albuquerque, NM (United States)
1994-12-31
A parallel unstructured finite element (FE) implementation designed for message passing MIMD machines is described. This implementation employs automated problem partitioning algorithms for load balancing unstructured grids, a distributed sparse matrix representation of the global finite element equations and a parallel conjugate gradient (CG) solver. In this paper a number of issues related to the efficient implementation of parallel unstructured mesh applications are presented. These include the differences between structured and unstructured mesh parallel applications, major communication kernels for unstructured CG solvers, automatic mesh partitioning algorithms, and the influence of mesh partitioning metrics on parallel performance. Initial results are presented for example finite element (FE) heat transfer analysis applications on a 1024 processor nCUBE 2 hypercube. Results indicate over 95% scaled efficiencies are obtained for some large problems despite the required unstructured data communication.
Extending the Finite Domain Solver of GNU Prolog
Bloemen, Vincent; Bloemen, Vincent; Diaz, Daniel; van der Bijl, H.M.; Abreu, Salvador; Ströder, T.; Swift, T.
This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, the internal representation of sparse domains has been redesigned to
Linear solver performance in elastoplastic problem solution on GPU cluster
Khalevitsky, Yu. V.; Konovalov, A. V.; Burmasheva, N. V.; Partin, A. S.
2017-12-01
Applying the finite element method to severe plastic deformation problems involves solving linear equation systems. While the solution procedure is relatively hard to parallelize and computationally intensive by itself, a long series of large scale systems need to be solved for each problem. When dealing with fine computational meshes, such as in the simulations of three-dimensional metal matrix composite microvolume deformation, tens and hundreds of hours may be needed to complete the whole solution procedure, even using modern supercomputers. In general, one of the preconditioned Krylov subspace methods is used in a linear solver for such problems. The method convergence highly depends on the operator spectrum of a problem stiffness matrix. In order to choose the appropriate method, a series of computational experiments is used. Different methods may be preferable for different computational systems for the same problem. In this paper we present experimental data obtained by solving linear equation systems from an elastoplastic problem on a GPU cluster. The data can be used to substantiate the choice of the appropriate method for a linear solver to use in severe plastic deformation simulations.
AbouEisha, Hassan M.
2016-06-02
In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particular, the problem of optimal ordering of elimination of rows in the sparse matrices resulting from adaptive finite element method computations is reduced to the problem of finding of optimal element partition trees. Given a two dimensional h refined mesh, we find all optimal element partition trees by using the dynamic programming approach. An element partition tree defines a prescribed order of elimination of degrees of freedom over the mesh. We utilize three different metrics to estimate the quality of the element partition tree. As the first criterion we consider the number of floating point operations(FLOPs) performed by the multi-frontal solver. As the second criterion we consider the number of memory transfers (MEMOPS) performed by the multi-frontal solver algorithm. As the third criterion we consider memory usage (NONZEROS) of the multi-frontal direct solver. We show the optimization results for FLOPs vs MEMOPS as well as for the execution time estimated as FLOPs+100MEMOPS vs NONZEROS. We obtain Pareto fronts with multiple optimal trees, for each mesh, and for each refinement level. We generate a library of optimal elimination trees for small grids with local singularities. We also propose an algorithm that for a given large mesh with identified local sub-grids, each one with local singularity. We compute Schur complements over the sub-grids using the optimal trees from the library, and we submit the sequence of Schur complements into the iterative solver ILUPCG.
CERN. Geneva
2004-01-01
The aim of Grid computing is to enable the easy and open sharing of resources between large and highly distributed communities of scientists and institutes across many independent administrative domains. Convincing site security officers and computer centre managers to allow this to happen in view of today's ever-increasing Internet security problems is a major challenge. Convincing users and application developers to take security seriously is equally difficult. This paper will describe the main Grid security issues, both in terms of technology and policy, that have been tackled over recent years in LCG and related Grid projects. Achievements to date will be described and opportunities for future improvements will be addressed.
Aerodynamics Simulations for the D8 ``Double Bubble'' Aircraft Using the LAVA Unstructured Solver
Ballinger, Sean
2013-11-01
The D8 ``double bubble'' is a proposed design for quieter and more efficient domestic passenger aircraft of the Boeing 737 class. It features boundary layer-ingesting engines located under a non-load-bearing π-tail and a lightweight low-sweep wing for flight around Mach 0.7. The D8's wide lifting body is expected to supply 15% of its total lift, while a Boeing 737's fuselage contributes only 8%. The tapering rear of the fuselage is also predicted to experience a negative moment resulting in positive pitch, produce a thicker boundary layer for ingestion by distortion-tolerant engines, and act as a noise shield. To investigate these predictions, unstructured grids generated over a fine surface triangulation using Star-CCM+ are used to model the unpowered D8 with flow conditions mimicking those in the MIT Wright brothers wind tunnel at angles of attack from - 2 to 14 degrees. LAVA, the recently developed Launch Ascent and Vehicle Aerodynamics solver, is used to carry out simulations on an unstructured grid. The results are compared to wind tunnel data, and to data from structured grid simulations using the LAVA, Overflow, and Cart3D solvers. Applied Modeling and Simulation Branch, NASA Advanced Supercomputing Division, funded by New York Space Grant.
Aleph Field Solver Challenge Problem Results Summary
Energy Technology Data Exchange (ETDEWEB)
Hooper, Russell [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Moore, Stan Gerald [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-01-01
Aleph models continuum electrostatic and steady and transient thermal fields using a finite-element method. Much work has gone into expanding the core solver capability to support enriched modeling consisting of multiple interacting fields, special boundary conditions and two-way interfacial coupling with particles modeled using Aleph's complementary particle-in-cell capability. This report provides quantitative evidence for correct implementation of Aleph's field solver via order- of-convergence assessments on a collection of problems of increasing complexity. It is intended to provide Aleph with a pedigree and to establish a basis for confidence in results for more challenging problems important to Sandia's mission that Aleph was specifically designed to address.
Mathematical programming solver based on local search
Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain
2014-01-01
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...
Realization of the chess mate solver application
Directory of Open Access Journals (Sweden)
Vučković Vladan V.
2004-01-01
Full Text Available This paper presents details of the chess mate solver application, which is a part of the author’s Geniss general chess application. The problem chess is an important domain connected with solving of the chess problems. The Geniss Mate Solver (G.M.S. application solves Mate-in-N-move problems. Main techniques used for the implementation of the application are full-width searching with Alpha-Beta pruning technique and zero evaluation function. The application is written in Delphi for Windows programming environment and the searching engine is completely coded in assembly language (about 10000 lines. This hybrid software structure enables efficient program development by using high-level programming environment and the realization of a very fast searching engine at the same time. The machine code is manually coded and could achieve above 7 million generated positions per second on the 1Ghz Celeron PC.
Chemical Mechanism Solvers in Air Quality Models
Directory of Open Access Journals (Sweden)
John C. Linford
2011-09-01
Full Text Available The solution of chemical kinetics is one of the most computationally intensivetasks in atmospheric chemical transport simulations. Due to the stiff nature of the system,implicit time stepping algorithms which repeatedly solve linear systems of equations arenecessary. This paper reviews the issues and challenges associated with the construction ofefficient chemical solvers, discusses several families of algorithms, presents strategies forincreasing computational efficiency, and gives insight into implementing chemical solverson accelerated computer architectures.
Evolving effective incremental SAT solvers with GP
Bader, Mohamed; Poli, R.
2008-01-01
Hyper-Heuristics could simply be defined as heuristics to choose other heuristics, and it is a way of combining existing heuristics to generate new ones. In a Hyper-Heuristic framework, the framework is used for evolving effective incremental (Inc*) solvers for SAT. We test the evolved heuristics (IncHH) against other known local search heuristics on a variety of benchmark SAT problems.
Advanced 3D Poisson solvers and particle-in-cell methods for accelerator modeling
Energy Technology Data Exchange (ETDEWEB)
Serafini, David B; McCorquodale, Peter; Colella, Phillip [Lawrence Berkeley National Lab, Applied Numerical Algorithms Group, SciDAC Applied Differential Equations Center (United States)
2005-01-01
We seek to improve on the conventional FFT-based algorithms for solving the Poisson equation with infinite-domain (open) boundary conditions for large problems in accelerator modeling and related areas. In particular, improvements in both accuracy and performance are possible by combining several technologies: the method of local corrections (MLC); the James algorithm; and adaptive mesh refinement (AMR). The MLC enables the parallelization (by domain decomposition) of problems with large domains and many grid points. This improves on the FFT-based Poisson solvers typically used as it doesn't require the all-to-all communication pattern that parallel 3d FFT algorithms require, which tends to be a performance bottleneck on current (and foreseeable) parallel computers. In initial tests, good scalability up to 1000 processors has been demonstrated for our new MLC solver. An essential component of our approach is a new version of the James algorithm for infinite-domain boundary conditions for the case of three dimensions. By using a simplified version of the fast multipole method in the boundary-to-boundary potential calculation, we improve on the performance of the Hockney algorithm typically used by reducing the number of grid points by a factor of 8, and the CPU costs by a factor of 3. This is particularly important for large problems where computer memory limits are a consideration. The MLC allows for the use of adaptive mesh refinement, which reduces the number of grid points and increases the accuracy in the Poisson solution. This improves on the uniform grid methods typically used in PIC codes, particularly in beam problems where the halo is large. Also, the number of particles per cell can be controlled more closely with adaptivity than with a uniform grid. To use AMR with particles is more complicated than using uniform grids. It affects depositing particles on the non-uniform grid, reassigning particles when the adaptive grid changes and maintaining the
3D Structured Grid Generation Codes for Turbomachinery
Loellbach, James; Tsung, Fu-Lin
1999-01-01
This report describes the research tasks during the past year. The research was mainly in the area of computational grid generation in support of CFD analyses of turbomachinery components. In addition to the grid generation work, a numerical simulation was obtained for the flow through a centrifugal gas compressor using an unstructured Navier-Stokes solver. Other tasks involved many different turbomachinery component analyses. These analyses were performed for NASA projects or for industrial applications. The work includes both centrifugal and axial machines, single and multiple blade rows, and steady and unsteady analyses. Over the past five years, a set of structured grid generation codes were developed that allow grids to be obtained fairly quickly for the large majority of configurations we encounter. These codes do not comprise a generalized grid generation package; they are noninteractive codes specifically designed for turbomachinery blade row geometries. But because of this limited scope, the codes are small, fast, and portable, and they can be run in the batch mode on small workstations. During the past year, these programs were used to generate computational grids were modified for a wide variety of configurations. In particular, the codes or wrote supplementary codes to improve our grid generation capabilities for multiple blade row configurations. This involves generating separate grids for each blade row, and then making them match and overlap by a few grid points at their common interface so that fluid properties are communicated across the interface. Unsteady rotor/stator analyses were performed for an axial turbine, a centrifugal compressor, and a centrifugal pump. Steady-state single-blade-row analyses were made for a study of blade sweep in transonic compressors. There was also cooperation on the application of an unstructured Navier-Stokes solver for turbomachinery flow simulations. In particular, the unstructured solver was used to analyze the
MILAMIN 2 - Fast MATLAB FEM solver
Dabrowski, Marcin; Krotkiewski, Marcin; Schmid, Daniel W.
2013-04-01
MILAMIN is a free and efficient MATLAB-based two-dimensional FEM solver utilizing unstructured meshes [Dabrowski et al., G-cubed (2008)]. The code consists of steady-state thermal diffusion and incompressible Stokes flow solvers implemented in approximately 200 lines of native MATLAB code. The brevity makes the code easily customizable. An important quality of MILAMIN is speed - it can handle millions of nodes within minutes on one CPU core of a standard desktop computer, and is faster than many commercial solutions. The new MILAMIN 2 allows three-dimensional modeling. It is designed as a set of functional modules that can be used as building blocks for efficient FEM simulations using MATLAB. The utilities are largely implemented as native MATLAB functions. For performance critical parts we use MUTILS - a suite of compiled MEX functions optimized for shared memory multi-core computers. The most important features of MILAMIN 2 are: 1. Modular approach to defining, tracking, and discretizing the geometry of the model 2. Interfaces to external mesh generators (e.g., Triangle, Fade2d, T3D) and mesh utilities (e.g., element type conversion, fast point location, boundary extraction) 3. Efficient computation of the stiffness matrix for a wide range of element types, anisotropic materials and three-dimensional problems 4. Fast global matrix assembly using a dedicated MEX function 5. Automatic integration rules 6. Flexible prescription (spatial, temporal, and field functions) and efficient application of Dirichlet, Neuman, and periodic boundary conditions 7. Treatment of transient and non-linear problems 8. Various iterative and multi-level solution strategies 9. Post-processing tools (e.g., numerical integration) 10. Visualization primitives using MATLAB, and VTK export functions We provide a large number of examples that show how to implement a custom FEM solver using the MILAMIN 2 framework. The examples are MATLAB scripts of increasing complexity that address a given
IRKC: An IMEX solver for stiff diffusion-reaction PDEs
Shampine, L. F.; Sommeijer, B. P.; Verwer, J. G.
2006-11-01
The Fortran 90 code IRKC is intended for the time integration of systems of partial differential equations (PDEs) of diffusion-reaction type for which the reaction Jacobian has real (negative) eigenvalues. It is based on a family of implicit-explicit Runge-Kutta-Chebyshev methods which are unconditionally stable for reaction terms and which impose a stability constraint associated with the diffusion terms that is quadratic in the number of stages. Special properties of the family make it possible for the code to select at each step the most efficient stable method as well as the most efficient step size. Moreover, they make it possible to apply the methods using just a few vectors of storage. A further step towards minimal storage requirements and optimal efficiency is achieved by exploiting the fact that the implicit terms, originating from the stiff reactions, are not coupled over the spatial grid points. Hence, the systems to be solved have a small dimension (viz., equal to the number of PDEs). These characteristics of the code make it especially attractive for problems in several spatial variables. IRKC is a successor to the RKC code [B.P. Sommeijer, L.F. Shampine, J.G. Verwer, RKC: an explicit solver for parabolic PDEs, J. Comput. Appl. Math. 88 (1997) 315-326] that solves similar problems without stiff reaction terms.
Verification of continuum drift kinetic equation solvers in NIMROD
Energy Technology Data Exchange (ETDEWEB)
Held, E. D.; Ji, J.-Y. [Utah State University, Logan, Utah 84322-4415 (United States); Kruger, S. E. [Tech-X Corporation, Boulder, Colorado 80303 (United States); Belli, E. A. [General Atomics, San Diego, California 92186-5608 (United States); Lyons, B. C. [Program in Plasma Physics, Princeton University, Princeton, New Jersey 08543-0451 (United States)
2015-03-15
Verification of continuum solutions to the electron and ion drift kinetic equations (DKEs) in NIMROD [C. R. Sovinec et al., J. Comp. Phys. 195, 355 (2004)] is demonstrated through comparison with several neoclassical transport codes, most notably NEO [E. A. Belli and J. Candy, Plasma Phys. Controlled Fusion 54, 015015 (2012)]. The DKE solutions use NIMROD's spatial representation, 2D finite-elements in the poloidal plane and a 1D Fourier expansion in toroidal angle. For 2D velocity space, a novel 1D expansion in finite elements is applied for the pitch angle dependence and a collocation grid is used for the normalized speed coordinate. The full, linearized Coulomb collision operator is kept and shown to be important for obtaining quantitative results. Bootstrap currents, parallel ion flows, and radial particle and heat fluxes show quantitative agreement between NIMROD and NEO for a variety of tokamak equilibria. In addition, velocity space distribution function contours for ions and electrons show nearly identical detailed structure and agree quantitatively. A Θ-centered, implicit time discretization and a block-preconditioned, iterative linear algebra solver provide efficient electron and ion DKE solutions that ultimately will be used to obtain closures for NIMROD's evolving fluid model.
CFD Analysis for Industrial Applications using xGrid Environment
Directory of Open Access Journals (Sweden)
Catalin NAE
2011-12-01
Full Text Available Relevant CFD computations are performed in a GRID environment in order to evaluate this technology as a reliable infrastructure for HPSC for complex industrial applications. Several aspects of this environment are presented, including the CFD solver platform based on DxUNSp code developed in INCAS, dedicated pre/postprocessing tools for partitioning and domain decomposition and use of automatic differentiation of source code for optimization problems. Access for users is provided, together with information on our mobile GRID client for access in xGRID, application network for HPSC in fluid mechanics and aerospace research.
Applications of an implicit HLLC-based Godunov solver for steady state hypersonic problems
Energy Technology Data Exchange (ETDEWEB)
Link, R.A.; Sharman, B. [Martec Limited, Halifax, Nova Scotia (Canada)]. E-mail: rickl@martec.com
2005-07-01
Over the past few years, there has been considerable activity developing research vehicles for studying hypersonic propulsion. Successful launches of the Australian Hyshot and the US Hyper-X vehicles have added a significant amount of flight test data to a field that had previously been limited to numerical simulation. A number of approaches have been proposed for hypersonics propulsion, including attached detonation wave, supersonics combustion, and shock induced combustion. Due to the high cost of developing flight hardware, CFD simulations will continue to be a key tool for investigating the feasibility of these concepts. Capturing the interactions of the vehicle body with the boundary layer and chemical reactions pushes the limits of available modelling tools and computer hardware. Explicit formulations are extremely slow in converging to a steady state; therefore, the use of implicit methods are warranted. An implicit LLC-based Godunov solver has been developed at Martec in collaboration with DRDC Valcartier to solve hypersonic problems with a minimum of CPU time and RAM storage. The solver, Chinook Implicit, is based upon the implicit formulation adopted by Batten et. al. The solver is based on a point implicit Gauss-Seidel method for unstructured grids, and includes fully implicit boundary conditions. Preliminary results for small and large scale inviscid hypersonics problems will be presented. (author)
Metaheuristics progress as real problem solvers
Nonobe, Koji; Yagiura, Mutsunori
2005-01-01
Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.
Fostering Creative Problem Solvers in Higher Education
DEFF Research Database (Denmark)
Zhou, Chunfang
2016-01-01
Recent studies have emphasized issues of social emergence based on thinking of societies as complex systems. The complexity of professional practice has been recognized as the root of challenges for higher education. To foster creative problem solvers is a key response of higher education in order...... to meet such challenges. This chapter aims to illustrate how to understand: 1) complexity as the nature of professional practice; 2) creative problem solving as the core skill in professional practice; 3) creativity as interplay between persons and their environment; 4) higher education as the context...... of societies, creative problem solving skills, and higher education development in one theoretical framework....
The Openpipeflow Navier–Stokes solver
Directory of Open Access Journals (Sweden)
Ashley P. Willis
2017-01-01
Full Text Available Pipelines are used in a huge range of industrial processes involving fluids, and the ability to accurately predict properties of the flow through a pipe is of fundamental engineering importance. Armed with parallel MPI, Arnoldi and Newton–Krylov solvers, the Openpipeflow code can be used in a range of settings, from large-scale simulation of highly turbulent flow, to the detailed analysis of nonlinear invariant solutions (equilibria and periodic orbits and their influence on the dynamics of the flow.
DEFF Research Database (Denmark)
Bjørner, Nikolaj; Dung, Phan Anh; Fleckenstein, Lars
2015-01-01
Z provides a portfolio of approaches for solving linear optimization problems over SMT formulas, MaxSMT, and their combinations. Objective functions are combined as either Pareto fronts, lexicographically, or each objective is optimized independently. We describe usage scenarios of vZ, outline the tool......vZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. v...
Testing and Debugging Techniques for Answer Set Solver Development
Brummayer, Robert; Järvisalo, Matti
2010-01-01
This paper develops automated testing and debugging techniques for answer set solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is able to reveal various defects such as unsound and incomplete behavior, i.e. invalid answer sets and inability to find existing solutions, in state-of-the-art answer set solver implementations. Moreover, we develop delta debugging techniques for shrinking failure-inducing inputs on which solvers exhibit defective behavi...
Li, Yuanhong; Kong, Song-Charng
2009-09-01
This study developed spray-adaptive mesh refinement algorithms with directional sensitivity in an unstructured solver to improve spray simulation for internal combustion engine application. Inadequate spatial resolution is often found to cause inaccuracies in spray simulation using the Lagrangian-Eulerian approach due to the over-estimated diffusion and inappropriate liquid-gas phase coupling. Dynamic mesh refinement algorithms adaptive to fuel sprays and vapor gradients were developed in order to increase the grid resolution in the spray region to improve simulation accuracy. The local refinement introduced the coarse-fine face interface that requires advanced numerical schemes for flux calculation and grid rezoning with moving boundaries. To resolve the issue in flux calculation, this work implemented the refinement/coarsening algorithms into a collocated solver to avoid tedious interpolations in solving the momentum equations. A pressure correction method was applied to address unphysical pressure oscillations due to the collocation of pressure and velocity. An edge-based algorithm was used to evaluate the edge-centered quantities in order to account for the contributions from all the cells around an edge at the coarse-fine interface. A quasi-second-order upwind scheme with strong monotonicity was also modified to accommodate the coarse-fine interface for convective fluxes. To resolve the issue related to grid rezoning, rezoning was applied to the initial baseline mesh only and the new locations of the refined grids were obtained by interpolating the updated baseline mesh. The time step constraints were also re-evaluated to account for the change resulting from mesh refinement. The present refinement algorithm was used in simulating fuel sprays in an engine combustion chamber. It was found that the present approach could produce the same level of results as those using the uniformly fine mesh with substantially reduced computer time. Results also showed that
TDIGG - TWO-DIMENSIONAL, INTERACTIVE GRID GENERATION CODE
Vu, B. T.
1994-01-01
TDIGG is a fast and versatile program for generating two-dimensional computational grids for use with finite-difference flow-solvers. Both algebraic and elliptic grid generation systems are included. The method for grid generation by algebraic transformation is based on an interpolation algorithm and the elliptic grid generation is established by solving the partial differential equation (PDE). Non-uniform grid distributions are carried out using a hyperbolic tangent stretching function. For algebraic grid systems, interpolations in one direction (univariate) and two directions (bivariate) are considered. These interpolations are associated with linear or cubic Lagrangian/Hermite/Bezier polynomial functions. The algebraic grids can subsequently be smoothed using an elliptic solver. For elliptic grid systems, the PDE can be in the form of Laplace (zero forcing function) or Poisson. The forcing functions in the Poisson equation come from the boundary or the entire domain of the initial algebraic grids. A graphics interface procedure using the Silicon Graphics (GL) Library is included to allow users to visualize the grid variations at each iteration. This will allow users to interactively modify the grid to match their applications. TDIGG is written in FORTRAN 77 for Silicon Graphics IRIS series computers running IRIX. This package requires either MIT's X Window System, Version 11 Revision 4 or SGI (Motif) Window System. A sample executable is provided on the distribution medium. It requires 148K of RAM for execution. The standard distribution medium is a .25 inch streaming magnetic IRIX tape cartridge in UNIX tar format. This program was developed in 1992.
Benchmarking stiff ODE solvers for atmorspheric chemistry problems II: Rosenbrock solvers
A. Sandu; J.G. Verwer (Jan); J.G. Blom (Joke); E.J. Spee (Edwin); G.R. Carmichael
1996-01-01
textabstractIn the numerical simulation of atmospheric transport-chemistry processes, a major task is the integration of the stiff systems of ordinary differential equations describing the chemical transformations. It is therefore of interest to systematically search for stiff solvers which can be
Validation Process for LEWICE by Use of a Navier-Stokes Solver
Wright, William B.; Porter, Christopher E.
2017-01-01
A research project is underway at NASA Glenn to produce computer software that can accurately predict ice growth under any meteorological conditions for any aircraft surface. This report will present results from the latest LEWICE release, version 3.5. This program differs from previous releases in its ability to model mixed phase and ice crystal conditions such as those encountered inside an engine. It also has expanded capability to use structured grids and a new capability to use results from unstructured grid flow solvers. A quantitative comparison of the results against a database of ice shapes that have been generated in the NASA Glenn Icing Research Tunnel (IRT) has also been performed. This paper will extend the comparison of ice shapes between LEWICE 3.5 and experimental data from a previous paper. Comparisons of lift and drag are made between experimentally collected data from experimentally obtained ice shapes and simulated (CFD) data on simulated (LEWICE) ice shapes. Comparisons are also made between experimentally collected and simulated performance data on select experimental ice shapes to ensure the CFD solver, FUN3D, is valid within the flight regime. The results show that the predicted results are within the accuracy limits of the experimental data for the majority of cases.
Using the scalable nonlinear equations solvers package
Energy Technology Data Exchange (ETDEWEB)
Gropp, W.D.; McInnes, L.C.; Smith, B.F.
1995-02-01
SNES (Scalable Nonlinear Equations Solvers) is a software package for the numerical solution of large-scale systems of nonlinear equations on both uniprocessors and parallel architectures. SNES also contains a component for the solution of unconstrained minimization problems, called SUMS (Scalable Unconstrained Minimization Solvers). Newton-like methods, which are known for their efficiency and robustness, constitute the core of the package. As part of the multilevel PETSc library, SNES incorporates many features and options from other parts of PETSc. In keeping with the spirit of the PETSc library, the nonlinear solution routines are data-structure-neutral, making them flexible and easily extensible. This users guide contains a detailed description of uniprocessor usage of SNES, with some added comments regarding multiprocessor usage. At this time the parallel version is undergoing refinement and extension, as we work toward a common interface for the uniprocessor and parallel cases. Thus, forthcoming versions of the software will contain additional features, and changes to parallel interface may result at any time. The new parallel version will employ the MPI (Message Passing Interface) standard for interprocessor communication. Since most of these details will be hidden, users will need to perform only minimal message-passing programming.
Directory of Open Access Journals (Sweden)
Sánchez Álvarez , I.
1998-01-01
Full Text Available La relevancia de los problemas de optimización en el mundo empresarial ha generado la introducción de herramientas de optimización cada vez más sofisticadas en las últimas versiones de las hojas de cálculo de utilización generalizada. Estas utilidades, conocidas habitualmente como «solvers», constituyen una alternativa a los programas especializados de optimización cuando no se trata de problemas de gran escala, presentado la ventaja de su facilidad de uso y de comunicación con el usuario final. Frontline Systems Inc es la empresa que desarrolla el «solver» de Excel, si bien existen asimismo versiones para Lotus y Quattro Pro con ligeras diferencias de uso. En su dirección de internet (www.frontsys.com se puede obtener información técnica sobre las diferentes versiones de dicha utilidad y diversos aspectos operativos del programa, algunos de los cuales se comentan en este trabajo.
National Aeronautics and Space Administration — Structured multiblock grid of HIRENASD wing with medium grid density, about 10 mill grid points, 9.5 mill cells. Starting from coarse AIAA AEPW structured grid,...
A Discontinuous Galerkin Chimera Overset Solver
Galbraith, Marshall Christopher
This work summarizes the development of an accurate, efficient, and flexible Computational Fluid Dynamics computer code that is an improvement relative to the state of the art. The improved accuracy and efficiency is obtained by using a high-order discontinuous Galerkin (DG) discretization scheme. In order to maximize the computational efficiency, quadrature-free integration and numerical integration optimized as matrix-vector multiplications is employed and implemented through a pre-processor (PyDG). Using the PyDG pre-processor, a C++ polynomial library has been developed that uses overloaded operators to design an efficient Domain Specific Language (DSL) that allows expressions involving polynomials to be written as if they are scalars. The DSL, which makes the syntax of computer code legible and intuitive, promotes maintainability of the software and simplifies the development of additional capabilities. The flexibility of the code is achieved by combining the DG scheme with the Chimera overset method. The Chimera overset method produces solutions on a set of overlapping grids that communicate through an exchange of data on grid boundaries (known as artificial boundaries). Finite volume and finite difference discretizations use fringe points, which are layers of points on the artificial boundaries, to maintain the interior stencil on artificial boundaries. The fringe points receive solution values interpolated from overset grids. Proper interpolation requires fringe points to be contained in overset grids. Insufficient overlap must be corrected by modifying the grid system. The Chimera scheme can also exclude regions of grids that lie outside the computational domain; a process commonly known as hole cutting. The Chimera overset method has traditionally enabled the use of high-order finite difference and finite volume approaches such as WENO and compact differencing schemes, which require structured meshes, for modeling fluid flow associated with complex
Saiz, P; Rocha, R; Andreeva, J
2007-01-01
We are offering a system to track the efficiency of different components of the GRID. We can study the performance of both the WMS and the data transfers At the moment, we have set different parts of the system for ALICE, ATLAS, CMS and LHCb. None of the components that we have developed are VO specific, therefore it would be very easy to deploy them for any other VO. Our main goal is basically to improve the reliability of the GRID. The main idea is to discover as soon as possible the different problems that have happened, and inform the responsible. Since we study the jobs and transfers issued by real users, we see the same problems that users see. As a matter of fact, we see even more problems than the end user does, since we are also interested in following up the errors that GRID components can overcome by themselves (like for instance, in case of a job failure, resubmitting the job to a different site). This kind of information is very useful to site and VO administrators. They can find out the efficien...
Grid interoperability joining grid information systems
Flechl, M
2008-01-01
A grid is defined as being 'coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations'. Over recent years a number of grid projects, many of which have a strong regional presence, have emerged to help coordinate institutions and enable grids. Today, we face a situation where a number of grid projects exist, most of which are using slightly different middleware. Grid interoperation is trying to bridge these differences and enable Virtual Organizations to access resources at the institutions independent of their grid project affiliation. Grid interoperation is usually a bilateral activity between two grid infrastructures. Recently within the Open Grid Forum, the Grid Interoperability Now (GIN) Community Group is trying to build upon these bilateral activities. The GIN group is a focal point where all the infrastructures can come together to share ideas and experiences on grid interoperation. It is hoped that each bilateral activity will bring us one step closer to th...
A multi-dimensional finite volume cell-centered direct ALE solver for hydrodynamics
Clair, G.; Ghidaglia, J.-M.; Perlat, J.-P.
2016-12-01
In this paper we describe a second order multi-dimensional scheme, belonging to the class of direct Arbitrary Lagrangian-Eulerian (ALE) methods, for the solution of non-linear hyperbolic systems of conservation law. The scheme is constructed upon a cell-centered explicit Lagrangian solver completed with an edge-based upwinded formulation of the numerical fluxes, computed from the MUSCL-Hancock method, to obtain a full ALE formulation. Numerical fluxes depend on nodal grid velocities which are either set or computed to avoid most of the mesh problems typically encountered in purely Lagrangian simulations. In order to assess the robustness of the scheme, most results proposed in this paper have been obtained by computing the grid velocities as a fraction of the Lagrangian nodal velocities, the ratio being set before running the test case. The last part of the paper describes preliminary results about the triple point test case run in the ALE framework by computing the grid velocities with the fully adaptive Large Eddy Limitation (L.E.L.) method proposed in [1]. Such a method automatically computes the grid velocities at each node defining the mesh from the local characteristics of the flow. We eventually discuss the advantages and the drawback of the coupling.
Experiences with linear solvers for oil reservoir simulation problems
Energy Technology Data Exchange (ETDEWEB)
Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); Biswas, D.; Carey, G.
1996-12-31
This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.
A Novel Interactive MINLP Solver for CAPE Applications
DEFF Research Database (Denmark)
Henriksen, Jens Peter; Støy, S.; Russel, Boris Mariboe
2000-01-01
This paper presents an interactive MINLP solver that is particularly suitable for solution of process synthesis, design and analysis problems. The interactive MINLP solver is based on the decomposition based MINLP algorithms, where a NLP sub-problem is solved in the innerloop and a MILP master...
Kiris, Cetin C.; Kwak, Dochan; Rogers, Stuart E.
2002-01-01
This paper reviews recent progress made in incompressible Navier-Stokes simulation procedures and their application to problems of engineering interest. Discussions are focused on the methods designed for complex geometry applications in three dimensions, and thus are limited to primitive variable formulation. A summary of efforts in flow solver development is given followed by numerical studies of a few example problems of current interest. Both steady and unsteady solution algorithms and their salient features are discussed. Solvers discussed here are based on a structured-grid approach using either a finite -difference or a finite-volume frame work. As a grand-challenge application of these solvers, an unsteady turbopump flow simulation procedure has been developed which utilizes high performance computing platforms. In the paper, the progress toward the complete simulation capability of the turbo-pump for a liquid rocket engine is reported. The Space Shuttle Main Engine (SSME) turbo-pump is used as a test case for evaluation of two parallel computing algorithms that have been implemented in the INS3D code. The relative motion of the grid systems for the rotorstator interaction was obtained using overact grid techniques. Unsteady computations for the SSME turbo-pump, which contains 114 zones with 34.5 million grid points, are carried out on SCSI Origin 3000 systems at NASA Ames Research Center. The same procedure has been extended to the development of NASA-DeBakey Ventricular Assist Device (VAD) that is based on an axial blood pump. Computational, and clinical analysis of this device are presented.
Asynchronous Parallelization of a CFD Solver
Directory of Open Access Journals (Sweden)
Daniel S. Abdi
2015-01-01
Full Text Available A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used in CFD codes; however, it has a potential to alleviate scaling bottlenecks incurred due to processors having to wait for each other at designated synchronization points. A common way to avoid this idle time is to overlap asynchronous communication with computation. For this to work, however, there must be something useful and independent a processor can do while waiting for messages to arrive. We investigate an alternative approach of computation, namely, conducting asynchronous iterations to improve local subdomain solution while communication is in progress. An in-house CFD code is parallelized using message passing interface (MPI, and scalability tests are conducted that suggest asynchronous iterations are a viable way of parallelizing CFD code.
Optimising a parallel conjugate gradient solver
Energy Technology Data Exchange (ETDEWEB)
Field, M.R. [O`Reilly Institute, Dublin (Ireland)
1996-12-31
This work arises from the introduction of a parallel iterative solver to a large structural analysis finite element code. The code is called FEX and it was developed at Hitachi`s Mechanical Engineering Laboratory. The FEX package can deal with a large range of structural analysis problems using a large number of finite element techniques. FEX can solve either stress or thermal analysis problems of a range of different types from plane stress to a full three-dimensional model. These problems can consist of a number of different materials which can be modelled by a range of material models. The structure being modelled can have the load applied at either a point or a surface, or by a pressure, a centrifugal force or just gravity. Alternatively a thermal load can be applied with a given initial temperature. The displacement of the structure can be constrained by having a fixed boundary or by prescribing the displacement at a boundary.
High order Poisson Solver for unbounded flows
DEFF Research Database (Denmark)
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2015-01-01
This paper presents a high order method for solving the unbounded Poisson equation on a regular mesh using a Green’s function solution. The high order convergence was achieved by formulating mollified integration kernels, that were derived from a filter regularisation of the solution field....... The method was implemented on a rectangular domain using fast Fourier transforms (FFT) to increase computational efficiency. The Poisson solver was extended to directly solve the derivatives of the solution. This is achieved either by including the differential operator in the integration kernel...... or by performing the differentiation as a multiplication of the Fourier coefficients. In this way, differential operators such as the divergence or curl of the solution field could be solved to the same high order convergence without additional computational effort. The method was applied and validated using...
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB
Rose, Geoffrey K.; Nguyen, Duc T.; Newman, Brett A.
2017-01-01
Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB's Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.
Formal Aspects of Grid Brokering
Directory of Open Access Journals (Sweden)
Attila Kertész
2009-12-01
Full Text Available Coordination in distributed environments, like Grids, involves selecting the most appropriate services, resources or compositions to carry out the planned activities. Such functionalities appear at various levels of the infrastructure and in various means forming a blurry domain, where it is hard to see how the participating components are related and what their relevant properties are. In this paper we focus on a subset of these problems: resource brokering in Grid middleware. This paper aims at establishing a semantical model for brokering and related activities by defining brokering agents at three levels of the Grid middleware for resource, host and broker selection. The main contribution of this paper is the definition and decomposition of different brokering components in Grids by providing a formal model using Abstract State Machines.
Comparison of open-source linear programming solvers.
Energy Technology Data Exchange (ETDEWEB)
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
Taylor, M.; Kosmopoulos, P. G.; Kazadzis, S.; Keramitsoglou, I.; Kiranoudis, C. T.
2016-01-01
This paper reports on the development of a neural network (NN) model for instantaneous and accurate estimation of solar radiation spectra and budgets geared toward satellite cloud data using a ≈2.4 M record, high-spectral resolution look up table (LUT) generated with the radiative transfer model libRadtran. Two NN solvers, one for clear sky conditions dominated by aerosol and one for cloudy skies, were trained on a normally-distributed and multiparametric subset of the LUT that spans a very broad class of atmospheric and meteorological conditions as inputs with corresponding high resolution solar irradiance target spectra as outputs. The NN solvers were tested by feeding them with a large (10 K record) ;off-grid; random subset of the LUT spanning the training data space, and then comparing simulated outputs with target values provided by the LUT. The NN solvers demonstrated a capability to interpolate accurately over the entire multiparametric space. Once trained, the NN solvers allow for high-speed estimation of solar radiation spectra with high spectral resolution (1 nm) and for a quantification of the effect of aerosol and cloud optical parameters on the solar radiation budget without the need for a massive database. The cloudy sky NN solver was applied to high spatial resolution (54 K pixel) cloud data extracted from the Spinning Enhanced Visible and Infrared Imager (SEVIRI) onboard the geostationary Meteosat Second Generation 3 (MSG3) satellite and demonstrated that coherent maps of spectrally-integrated global horizontal irradiance at this resolution can be produced on the order of 1 min.
Multi-GPU three dimensional Stokes solver for simulating glacier flow
Licul, Aleksandar; Herman, Frédéric; Podladchikov, Yuri; Räss, Ludovic; Omlin, Samuel
2016-04-01
Here we present how we have recently developed a three-dimensional Stokes solver on the GPUs and apply it to a glacier flow. We numerically solve the Stokes momentum balance equations together with the incompressibility equation, while also taking into account strong nonlinearities for ice rheology. We have developed a fully three-dimensional numerical MATLAB application based on an iterative finite difference scheme with preconditioning of residuals. Differential equations are discretized on a regular staggered grid. We have ported it to C-CUDA to run it on GPU's in parallel, using MPI. We demonstrate the accuracy and efficiency of our developed model by manufactured analytical solution test for three-dimensional Stokes ice sheet models (Leng et al.,2013) and by comparison with other well-established ice sheet models on diagnostic ISMIP-HOM benchmark experiments (Pattyn et al., 2008). The results show that our developed model is capable to accurately and efficiently solve Stokes system of equations in a variety of different test scenarios, while preserving good parallel efficiency on up to 80 GPU's. For example, in 3D test scenarios with 250000 grid points our solver converges in around 3 minutes for single precision computations and around 10 minutes for double precision computations. We have also optimized the developed code to efficiently run on our newly acquired state-of-the-art GPU cluster octopus. This allows us to solve our problem on more than 20 million grid points, by just increasing the number of GPU used, while keeping the computation time the same. In future work we will apply our solver to real world applications and implement the free surface evolution capabilities. REFERENCES Leng,W.,Ju,L.,Gunzburger,M. & Price,S., 2013. Manufactured solutions and the verification of three-dimensional stokes ice-sheet models. Cryosphere 7,19-29. Pattyn, F., Perichon, L., Aschwanden, A., Breuer, B., de Smedt, B., Gagliardini, O., Gudmundsson,G.H., Hindmarsh, R
The MammoGrid Project Grids Architecture
McClatchey, Richard; Hauer, Tamas; Estrella, Florida; Saiz, Pablo; Rogulin, Dmitri; Buncic, Predrag; Clatchey, Richard Mc; Buncic, Predrag; Manset, David; Hauer, Tamas; Estrella, Florida; Saiz, Pablo; Rogulin, Dmitri
2003-01-01
The aim of the recently EU-funded MammoGrid project is, in the light of emerging Grid technology, to develop a European-wide database of mammograms that will be used to develop a set of important healthcare applications and investigate the potential of this Grid to support effective co-working between healthcare professionals throughout the EU. The MammoGrid consortium intends to use a Grid model to enable distributed computing that spans national borders. This Grid infrastructure will be used for deploying novel algorithms as software directly developed or enhanced within the project. Using the MammoGrid clinicians will be able to harness the use of massive amounts of medical image data to perform epidemiological studies, advanced image processing, radiographic education and ultimately, tele-diagnosis over communities of medical "virtual organisations". This is achieved through the use of Grid-compliant services [1] for managing (versions of) massively distributed files of mammograms, for handling the distri...
Parallel iterative solvers and preconditioners using approximate hierarchical methods
Energy Technology Data Exchange (ETDEWEB)
Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)
1996-12-31
In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.
Uncertainty Quantification for Production Navier-Stokes Solvers Project
National Aeronautics and Space Administration — The uncertainty quantification methods developed under this program are designed for use with current state-of-the-art flow solvers developed by and in use at NASA....
Wing aeroelasticity analysis based on an integral boundary-layer method coupled with Euler solver
Directory of Open Access Journals (Sweden)
Ma Yanfeng
2016-10-01
Full Text Available An interactive boundary-layer method, which solves the unsteady flow, is developed for aeroelastic computation in the time domain. The coupled method combines the Euler solver with the integral boundary-layer solver (Euler/BL in a “semi-inverse” manner to compute flows with the inviscid and viscous interaction. Unsteady boundary conditions on moving surfaces are taken into account by utilizing the approximate small-perturbation method without moving the computational grids. The steady and unsteady flow calculations for the LANN wing are presented. The wing tip displacement of high Reynolds number aero-structural dynamics (HIRENASD Project is simulated under different angles of attack. The flutter-boundary predictions for the AGARD 445.6 wing are provided. The results of the interactive boundary-layer method are compared with those of the Euler method and experimental data. The study shows that viscous effects are significant for these cases and the further data analysis confirms the validity and practicability of the coupled method.
Validation of the simpleFoam (RANS solver for the atmospheric boundary layer in complex terrain
Directory of Open Access Journals (Sweden)
Peralta C.
2014-01-01
Full Text Available We validate the simpleFoam (RANS solver in OpenFOAM (version 2.1.1 for simulating neutral atmospheric boundary layer flows in complex terrain. Initial and boundary conditions are given using Richards and Hoxey proposal [1]. In order to obtain stable simulation of the ABL, modified wall functions are used to set the near-wall boundary conditions, following Blocken et al remedial measures [2]. A structured grid is generated with the new library terrainBlockMesher [3,4], based on OpenFOAM's blockMesh native mesher. The new tool is capable of adding orographic features and the forest canopy. Additionally, the mesh can be refined in regions with complex orography. We study both the classical benchmark case of Askervein hill [5] and the more recent Bolund island data set [6]. Our purpose is two-folded: to validate the performance of OpenFOAM steady state solvers, and the suitability of the new meshing tool to generate high quality structured meshes, which will be used in the future for performing more computationally intensive LES simulations in complex terrain.
Betté, Srinivas; Diaz, Julio C.; Jines, William R.; Steihaug, Trond
1986-11-01
A preconditioned residual-norm-reducing iterative solver is described. Based on a truncated form of the generalized-conjugate-gradient method for nonsymmetric systems of linear equations, the iterative scheme is very effective for linear systems generated in reservoir simulation of thermal oil recovery processes. As a consequence of employing an adaptive implicit finite-difference scheme to solve the model equations, the number of variables per cell-block varies dynamically over the grid. The data structure allows for 5- and 9-point operators in the areal model, 5-point in the cross-sectional model, and 7- and 11-point operators in the three-dimensional model. Block-diagonal-scaling of the linear system, done prior to iteration, is found to have a significant effect on the rate of convergence. Block-incomplete-LU-decomposition (BILU) and block-symmetric-Gauss-Seidel (BSGS) methods, which result in no fill-in, are used as preconditioning procedures. A full factorization is done on the well terms, and the cells are ordered in a manner which minimizes the fill-in in the well-column due to this factorization. The convergence criterion for the linear (inner) iteration is linked to that of the nonlinear (Newton) iteration, thereby enhancing the efficiency of the computation. The algorithm, with both BILU and BSGS preconditioners, is evaluated in the context of a variety of thermal simulation problems. The solver is robust and can be used with little or no user intervention.
Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics
Watson, W. R.; Nguyen, D. T.; Reddy, C. J.; Vatsa, V. N.; Tang, W. H.
2001-01-01
An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.
Energy Technology Data Exchange (ETDEWEB)
Druinsky, A; Ghysels, P; Li, XS; Marques, O; Williams, S; Barker, A; Kalchev, D; Vassilevski, P
2016-04-02
In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism and made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.
A Parallel Implicit Incompressible Flow Solver Using Unstructured Meshes.
1993-01-17
conjunction with the incompressible flow solver. Steady and unsteady flows over a tri-element airfoil and NACA0012 airfoil are computed using the...in a heated bath. Next, an explicit version of the incompressible flow solver is parallelized. This is applied for solving steady flow over a NACA0012 ...modified to accomodate a set of complete linelets within a subdomain. The algorithm was then tested via simulation of unsteady flow past NACA0012 airfoil
Energy Technology Data Exchange (ETDEWEB)
Saas, L.
2004-05-01
This Thesis deals with sedimentary basin modeling whose goal is the prediction through geological times of the localizations and appraisal of hydrocarbons quantities present in the ground. Due to the natural and evolutionary decomposition of the sedimentary basin in blocks and stratigraphic layers, domain decomposition methods are requested to simulate flows of waters and of hydrocarbons in the ground. Conservations laws are used to model the flows in the ground and form coupled partial differential equations which must be discretized by finite volume method. In this report we carry out a study on finite volume methods on non-matching grids solved by domain decomposition methods. We describe a family of finite volume schemes on non-matching grids and we prove that the associated global discretized problem is well posed. Then we give an error estimate. We give two examples of finite volume schemes on non matching grids and the corresponding theoretical results (Constant scheme and Linear scheme). Then we present the resolution of the global discretized problem by a domain decomposition method using arbitrary interface conditions (for example Robin conditions). Finally we give numerical results which validate the theoretical results and study the use of finite volume methods on non-matching grids for basin modeling. (author)
Autotuning of Adaptive Mesh Refinement PDE Solvers on Shared Memory Architectures
Nogina, Svetlana
2012-01-01
Many multithreaded, grid-based, dynamically adaptive solvers for partial differential equations permanently have to traverse subgrids (patches) of different and changing sizes. The parallel efficiency of this traversal depends on the interplay of the patch size, the architecture used, the operations triggered throughout the traversal, and the grain size, i.e. the size of the subtasks the patch is broken into. We propose an oracle mechanism delivering grain sizes on-the-fly. It takes historical runtime measurements for different patch and grain sizes as well as the traverse\\'s operations into account, and it yields reasonable speedups. Neither magic configuration settings nor an expensive pre-tuning phase are necessary. It is an autotuning approach. © 2012 Springer-Verlag.
An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems
Energy Technology Data Exchange (ETDEWEB)
Oosterlee, C.W. [Inst. for Algorithms and Scientific Computing, Sankt Augustin (Germany); Washio, T. [C& C Research Lab., Sankt Augustin (Germany)
1996-12-31
In this paper we try to achieve h-independent convergence with preconditioned GMRES and BiCGSTAB for 2D singular perturbed equations. Three recently developed multigrid methods are adopted as a preconditioner. They are also used as solution methods in order to compare the performance of the methods as solvers and as preconditioners. Two of the multigrid methods differ only in the transfer operators. One uses standard matrix- dependent prolongation operators from. The second uses {open_quotes}upwind{close_quotes} prolongation operators, developed. Both employ the Galerkin coarse grid approximation and an alternating zebra line Gauss-Seidel smoother. The third method is based on the block LU decomposition of a matrix and on an approximate Schur complement. This multigrid variant is presented in. All three multigrid algorithms are algebraic methods.
Implementing High-Performance Geometric Multigrid Solver with Naturally Grained Messages
Energy Technology Data Exchange (ETDEWEB)
Shan, H; Williams, S; Zheng, Y; Kamil, A; Yelick, K
2015-10-26
Structured-grid linear solvers often require manually packing and unpacking of communication data to achieve high performance.Orchestrating this process efficiently is challenging, labor-intensive, and potentially error-prone.In this paper, we explore an alternative approach that communicates the data with naturally grained messagesizes without manual packing and unpacking. This approach is the distributed analogue of shared-memory programming, taking advantage of the global addressspace in PGAS languages to provide substantial programming ease. However, its performance may suffer from the large number of small messages. We investigate theruntime support required in the UPC ++ library for this naturally grained version to close the performance gap between the two approaches and attain comparable performance at scale using the High-Performance Geometric Multgrid (HPGMG-FV) benchmark as a driver.
A GPU accelerated and error-controlled solver for the unbounded Poisson equation in three dimensions
Exl, Lukas
2017-12-01
An efficient solver for the three dimensional free-space Poisson equation is presented. The underlying numerical method is based on finite Fourier series approximation. While the error of all involved approximations can be fully controlled, the overall computation error is driven by the convergence of the finite Fourier series of the density. For smooth and fast-decaying densities the proposed method will be spectrally accurate. The method scales with O(N log N) operations, where N is the total number of discretization points in the Cartesian grid. The majority of the computational costs come from fast Fourier transforms (FFT), which makes it ideal for GPU computation. Several numerical computations on CPU and GPU validate the method and show efficiency and convergence behavior. Tests are performed using the Vienna Scientific Cluster 3 (VSC3). A free MATLAB implementation for CPU and GPU is provided to the interested community.
A Simple GPU-Accelerated Two-Dimensional MUSCL-Hancock Solver for Ideal Magnetohydrodynamics
Bard, Christopher; Dorelli, John C.
2013-01-01
We describe our experience using NVIDIA's CUDA (Compute Unified Device Architecture) C programming environment to implement a two-dimensional second-order MUSCL-Hancock ideal magnetohydrodynamics (MHD) solver on a GTX 480 Graphics Processing Unit (GPU). Taking a simple approach in which the MHD variables are stored exclusively in the global memory of the GTX 480 and accessed in a cache-friendly manner (without further optimizing memory access by, for example, staging data in the GPU's faster shared memory), we achieved a maximum speed-up of approx. = 126 for a sq 1024 grid relative to the sequential C code running on a single Intel Nehalem (2.8 GHz) core. This speedup is consistent with simple estimates based on the known floating point performance, memory throughput and parallel processing capacity of the GTX 480.
A simple GPU-accelerated two-dimensional MUSCL-Hancock solver for ideal magnetohydrodynamics
Bard, Christopher M.; Dorelli, John C.
2014-02-01
We describe our experience using NVIDIA's CUDA (Compute Unified Device Architecture) C programming environment to implement a two-dimensional second-order MUSCL-Hancock ideal magnetohydrodynamics (MHD) solver on a GTX 480 Graphics Processing Unit (GPU). Taking a simple approach in which the MHD variables are stored exclusively in the global memory of the GTX 480 and accessed in a cache-friendly manner (without further optimizing memory access by, for example, staging data in the GPU's faster shared memory), we achieved a maximum speed-up of ≈126 for a 10242 grid relative to the sequential C code running on a single Intel Nehalem (2.8 GHz) core. This speedup is consistent with simple estimates based on the known floating point performance, memory throughput and parallel processing capacity of the GTX 480.
Feki, Saber
2013-07-01
An explicit marching-on-in-time (MOT)-based time-domain volume integral equation (TDVIE) solver has recently been developed for characterizing transient electromagnetic wave interactions on arbitrarily shaped dielectric bodies (A. Al-Jarro et al., IEEE Trans. Antennas Propag., vol. 60, no. 11, 2012). The solver discretizes the spatio-temporal convolutions of the source fields with the background medium\\'s Green function using nodal discretization in space and linear interpolation in time. The Green tensor, which involves second order spatial and temporal derivatives, is computed using finite differences on the temporal and spatial grid. A predictor-corrector algorithm is used to maintain the stability of the MOT scheme. The simplicity of the discretization scheme permits the computation of the discretized spatio-temporal convolutions on the fly during time marching; no \\'interaction\\' matrices are pre-computed or stored resulting in a memory efficient scheme. As a result, most often the applicability of this solver to the characterization of wave interactions on electrically large structures is limited by the computation time but not the memory. © 2013 IEEE.
Cao, Jian; Li, Qi; Cheng, Jicheng
2005-10-01
This paper discusses the concept, key technologies and main application of Spatial Services Grid. The technologies of Grid computing and Webservice is playing a revolutionary role in studying the spatial information services. The concept of the SSG (Spatial Services Grid) is put forward based on the SIG (Spatial Information Grid) and OGSA (open grid service architecture). Firstly, the grid computing is reviewed and the key technologies of SIG and their main applications are reviewed. Secondly, the grid computing and three kinds of SIG (in broad sense)--SDG (spatial data grid), SIG (spatial information grid) and SSG (spatial services grid) and their relationships are proposed. Thirdly, the key technologies of the SSG (spatial services grid) is put forward. Finally, three representative applications of SSG (spatial services grid) are discussed. The first application is urban location based services gird, which is a typical spatial services grid and can be constructed on OGSA (Open Grid Services Architecture) and digital city platform. The second application is region sustainable development grid which is the key to the urban development. The third application is Region disaster and emergency management services grid.
Begeman, K. G.; Belikov, A. N.; Boxhoorn, D. R.; Dijkstra, F.; Valentijn, E. A.; Vriend, W. -J.; Zhao, Z.
This paper reports the integration of the astronomical Grid solution realised in the Astro-WISE information system with the EGEE Grid and the porting of Astro-WISE applications on EGEE. We review the architecture of the Astro-WISE Grid, define the problems for the integration of the Grid
Refined isogeometric analysis for a preconditioned conjugate gradient solver
Garcia, Daniel
2018-02-12
Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.
Scaling of a Fast Fourier Transform and a pseudo-spectral fluid solver up to 196608 cores
Chatterjee, Anando G.
2017-11-04
In this paper we present scaling results of a FFT library, FFTK, and a pseudospectral code, Tarang, on grid resolutions up to 81923 grid using 65536 cores of Blue Gene/P and 196608 cores of Cray XC40 supercomputers. We observe that communication dominates computation, more so on the Cray XC40. The computation time scales as Tcomp∼p−1, and the communication time as Tcomm∼n−γ2 with γ2 ranging from 0.7 to 0.9 for Blue Gene/P, and from 0.43 to 0.73 for Cray XC40. FFTK, and the fluid and convection solvers of Tarang exhibit weak as well as strong scaling nearly up to 196608 cores of Cray XC40. We perform a comparative study of the performance on the Blue Gene/P and Cray XC40 clusters.
A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids
2001-10-01
the US-Spain Joint Commission for Scienti c and Technological Cooperation. yDepartamento Arquitectura de Computadores y Automatica, Universidad...Complutense, 28040 Madrid, Spain. E-mail: mpmatias@dacya.ucm.es zDepartamento Arquitectura de Computadores y Automatica, Universidad Complutense, 28040...Madrid, Spain. E-mail: rubensm@dacya.ucm.es xDepartamento Arquitectura de Computadores y Automatica, Universidad Complutense, 28040 Madrid, Spain. E-mail
Performance Models for the Spike Banded Linear System Solver
Directory of Open Access Journals (Sweden)
Murat Manguoglu
2011-01-01
Full Text Available With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and beyond, there is significant impetus for the development of scalable parallel sparse linear system solvers and preconditioners. An integral part of this design process is the development of performance models capable of predicting performance and providing accurate cost models for the solvers and preconditioners. There has been some work in the past on characterizing performance of the iterative solvers themselves. In this paper, we investigate the problem of characterizing performance and scalability of banded preconditioners. Recent work has demonstrated the superior convergence properties and robustness of banded preconditioners, compared to state-of-the-art ILU family of preconditioners as well as algebraic multigrid preconditioners. Furthermore, when used in conjunction with efficient banded solvers, banded preconditioners are capable of significantly faster time-to-solution. Our banded solver, the Truncated Spike algorithm is specifically designed for parallel performance and tolerance to deep memory hierarchies. Its regular structure is also highly amenable to accurate performance characterization. Using these characteristics, we derive the following results in this paper: (i we develop parallel formulations of the Truncated Spike solver, (ii we develop a highly accurate pseudo-analytical parallel performance model for our solver, (iii we show excellent predication capabilities of our model – based on which we argue the high scalability of our solver. Our pseudo-analytical performance model is based on analytical performance characterization of each phase of our solver. These analytical models are then parameterized using actual runtime information on target platforms. An important consequence of our performance models is that they reveal underlying performance bottlenecks in both serial and parallel formulations. All of our results are
The novel high-performance 3-D MT inverse solver
Kruglyakov, Mikhail; Geraskin, Alexey; Kuvshinov, Alexey
2016-04-01
We present novel, robust, scalable, and fast 3-D magnetotelluric (MT) inverse solver. The solver is written in multi-language paradigm to make it as efficient, readable and maintainable as possible. Separation of concerns and single responsibility concepts go through implementation of the solver. As a forward modelling engine a modern scalable solver extrEMe, based on contracting integral equation approach, is used. Iterative gradient-type (quasi-Newton) optimization scheme is invoked to search for (regularized) inverse problem solution, and adjoint source approach is used to calculate efficiently the gradient of the misfit. The inverse solver is able to deal with highly detailed and contrasting models, allows for working (separately or jointly) with any type of MT responses, and supports massive parallelization. Moreover, different parallelization strategies implemented in the code allow optimal usage of available computational resources for a given problem statement. To parameterize an inverse domain the so-called mask parameterization is implemented, which means that one can merge any subset of forward modelling cells in order to account for (usually) irregular distribution of observation sites. We report results of 3-D numerical experiments aimed at analysing the robustness, performance and scalability of the code. In particular, our computational experiments carried out at different platforms ranging from modern laptops to HPC Piz Daint (6th supercomputer in the world) demonstrate practically linear scalability of the code up to thousands of nodes.
Grid generation for the solution of partial differential equations
Eiseman, Peter R.; Erlebacher, Gordon
1989-01-01
A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.
GENIE(++): A Multi-Block Structured Grid System
Williams, Tonya; Nadenthiran, Naren; Thornburg, Hugh; Soni, Bharat K.
1996-01-01
The computer code GENIE++ is a continuously evolving grid system containing a multitude of proven geometry/grid techniques. The generation process in GENIE++ is based on an earlier version. The process uses several techniques either separately or in combination to quickly and economically generate sculptured geometry descriptions and grids for arbitrary geometries. The computational mesh is formed by using an appropriate algebraic method. Grid clustering is accomplished with either exponential or hyperbolic tangent routines which allow the user to specify a desired point distribution. Grid smoothing can be accomplished by using an elliptic solver with proper forcing functions. B-spline and Non-Uniform Rational B-splines (NURBS) algorithms are used for surface definition and redistribution. The built in sculptured geometry definition with desired distribution of points, automatic Bezier curve/surface generation for interior boundaries/surfaces, and surface redistribution is based on NURBS. Weighted Lagrance/Hermite transfinite interpolation methods, interactive geometry/grid manipulation modules, and on-line graphical visualization of the generation process are salient features of this system which result in a significant time savings for a given geometry/grid application.
Efficient Unstructured Grid Adaptation Methods for Sonic Boom Prediction
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 (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.
Non-Galerkin Coarse Grids for Algebraic Multigrid
Energy Technology Data Exchange (ETDEWEB)
Falgout, Robert D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schroder, Jacob B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2014-06-26
Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.
A weakly-compressible Cartesian grid approach for hydrodynamic flows
Bigay, P.; Oger, G.; Guilcher, P.-M.; Le Touzé, D.
2017-11-01
The present article aims at proposing an original strategy to solve hydrodynamic flows. In introduction, the motivations for this strategy are developed. It aims at modeling viscous and turbulent flows including complex moving geometries, while avoiding meshing constraints. The proposed approach relies on a weakly-compressible formulation of the Navier-Stokes equations. Unlike most hydrodynamic CFD (Computational Fluid Dynamics) solvers usually based on implicit incompressible formulations, a fully-explicit temporal scheme is used. A purely Cartesian grid is adopted for numerical accuracy and algorithmic simplicity purposes. This characteristic allows an easy use of Adaptive Mesh Refinement (AMR) methods embedded within a massively parallel framework. Geometries are automatically immersed within the Cartesian grid with an AMR compatible treatment. The method proposed uses an Immersed Boundary Method (IBM) adapted to the weakly-compressible formalism and imposed smoothly through a regularization function, which stands as another originality of this work. All these features have been implemented within an in-house solver based on this WCCH (Weakly-Compressible Cartesian Hydrodynamic) method which meets the above requirements whilst allowing the use of high-order (> 3) spatial schemes rarely used in existing hydrodynamic solvers. The details of this WCCH method are presented and validated in this article.
Lamar, John E.; Abdol-Hamid, Khaled S.
2009-01-01
In support of the Cranked Arrow Wing Aerodynamic Project International (CAWAPI) with its goal of improving the Technology Readiness Level of flow solvers by comparing results with measured F-16XL-1 flight data, NASA Langley employed the TetrUSS unstructured grid solver, USM3D, to obtain solutions for all seven flight conditions of interest. A newly available solver version that incorporates a number of turbulence models, including the two-equation linear and non-linear k- , was used in this study. As a first test, a choice was made to utilize only a single grid resolution with the solver for the simulation of the different flight conditions. Comparisons are presented with three turbulence models in USM3D, flight data for surface pressure, boundary-layer profiles, and skin-friction distribution, as well as limited predictions from other solvers. A result of these comparisons is that the USM3D solver can be used in an engineering environment to predict vortex-flow physics on a complex configuration at flight Reynolds numbers with a two-equation linear k- turbulence model.
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.
Integrating Problem Solvers from Analogous Markets in New Product Ideation
DEFF Research Database (Denmark)
Franke, Nikolaus; Poetz, Marion; Schreier, Martin
2014-01-01
Who provides better inputs to new product ideation tasks, problem solvers with expertise in the area for which new products are to be developed or problem solvers from “analogous” markets that are distant but share an analogous problem or need? Conventional wisdom appears to suggest that target...... market expertise is indispensable, which is why most managers searching for new ideas tend to stay within their own market context even when they do search outside their firms' boundaries. However, in a unique symmetric experiment that isolates the effect of market origin, we find evidence...... for the opposite: Although solutions provided by problem solvers from analogous markets show lower potential for immediate use, they demonstrate substantially higher levels of novelty. Also, compared to established novelty drivers, this effect appears highly relevant from a managerial perspective: we find...
Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation
Chen, Meng-Huo
2015-09-13
In this research we are particularly interested in extending the robustness of multigrid solvers to encounter complex systems related to subsurface reservoir applications for flow problems in porous media. In many cases, the step for solving the pressure filed in subsurface flow simulation becomes a bottleneck for the performance of the simulator. For solving large sparse linear system arising from MPFA discretization, we choose multigrid methods as the linear solver. The possible difficulties and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately goal which we desire to achieve.
An adaptive fast multipole accelerated Poisson solver for complex geometries
Askham, T.; Cerfon, A. J.
2017-09-01
We present a fast, direct and adaptive Poisson solver for complex two-dimensional geometries based on potential theory and fast multipole acceleration. More precisely, the solver relies on the standard decomposition of the solution as the sum of a volume integral to account for the source distribution and a layer potential to enforce the desired boundary condition. The volume integral is computed by applying the FMM on a square box that encloses the domain of interest. For the sake of efficiency and convergence acceleration, we first extend the source distribution (the right-hand side in the Poisson equation) to the enclosing box as a C0 function using a fast, boundary integral-based method. We demonstrate on multiply connected domains with irregular boundaries that this continuous extension leads to high accuracy without excessive adaptive refinement near the boundary and, as a result, to an extremely efficient "black box" fast solver.
Goel, Sanjay; Papakonstantinou, Vagelis; Kloza, Dariusz
2015-01-01
This book on smart grid security is meant for a broad audience from managers to technical experts. It highlights security challenges that are faced in the smart grid as we widely deploy it across the landscape. It starts with a brief overview of the smart grid and then discusses some of the reported attacks on the grid. It covers network threats, cyber physical threats, smart metering threats, as well as privacy issues in the smart grid. Along with the threats the book discusses the means to improve smart grid security and the standards that are emerging in the field. The second part of the b
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter
The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...
National Aeronautics and Space Administration — These grids were generated by Markus Ritter (DLR) using Solar in TAU format netcdf.nc. The grids were converted to CGNS format by Pawel Chwalowski (NASA)
HIRENASD coarse structured grid
National Aeronautics and Space Administration — blockstructured hexahedral grid, 6.7 mio elements, 24 degree minimum grid angle, CGNS format version 2.4, double precision Binary, Plot3D file Please contact...
National Aeronautics and Space Administration — After discussions by the organizing committee, and some research using the RSW grids, a modification has been made on the RSW grids. The inflow boundary has now been...
National Aeronautics and Space Administration — RSW hexahedral grids in CGNS (unstructured) and Plot3d (structured) formats generated by ANSYS Germany. Please see AePW_RSW_Grids.pptx below for full description of...
SAGE - MULTIDIMENSIONAL SELF-ADAPTIVE GRID CODE
Davies, C. B.
1994-01-01
SAGE, Self Adaptive Grid codE, is a flexible tool for adapting and restructuring both 2D and 3D grids. Solution-adaptive grid methods are useful tools for efficient and accurate flow predictions. In supersonic and hypersonic flows, strong gradient regions such as shocks, contact discontinuities, shear layers, etc., require careful distribution of grid points to minimize grid error and produce accurate flow-field predictions. SAGE helps the user obtain more accurate solutions by intelligently redistributing (i.e. adapting) the original grid points based on an initial or interim flow-field solution. The user then computes a new solution using the adapted grid as input to the flow solver. The adaptive-grid methodology poses the problem in an algebraic, unidirectional manner for multi-dimensional adaptations. The procedure is analogous to applying tension and torsion spring forces proportional to the local flow gradient at every grid point and finding the equilibrium position of the resulting system of grid points. The multi-dimensional problem of grid adaption is split into a series of one-dimensional problems along the computational coordinate lines. The reduced one dimensional problem then requires a tridiagonal solver to find the location of grid points along a coordinate line. Multi-directional adaption is achieved by the sequential application of the method in each coordinate direction. The tension forces direct the redistribution of points to the strong gradient region. To maintain smoothness and a measure of orthogonality of grid lines, torsional forces are introduced that relate information between the family of lines adjacent to one another. The smoothness and orthogonality constraints are direction-dependent, since they relate only the coordinate lines that are being adapted to the neighboring lines that have already been adapted. Therefore the solutions are non-unique and depend on the order and direction of adaption. Non-uniqueness of the adapted grid is
M2Di: Concise and efficient MATLAB 2-D Stokes solvers using the Finite Difference Method
Räss, Ludovic; Duretz, Thibault; Podladchikov, Yury Y.; Schmalholz, Stefan M.
2017-02-01
Recent development of many multiphysics modeling tools reflects the currently growing interest for studying coupled processes in Earth Sciences. The core of such tools should rely on fast and robust mechanical solvers. Here we provide M2Di, a set of routines for 2-D linear and power law incompressible viscous flow based on Finite Difference discretizations. The 2-D codes are written in a concise vectorized MATLAB fashion and can achieve a time to solution of 22 s for linear viscous flow on 10002 grid points using a standard personal computer. We provide application examples spanning from finely resolved crystal-melt dynamics, deformation of heterogeneous power law viscous fluids to instantaneous models of mantle flow in cylindrical coordinates. The routines are validated against analytical solution for linear viscous flow with highly variable viscosity and compared against analytical and numerical solutions of power law viscous folding and necking. In the power law case, both Picard and Newton iterations schemes are implemented. For linear Stokes flow and Picard linearization, the discretization results in symmetric positive-definite matrix operators on Cartesian grids with either regular or variable grid spacing allowing for an optimized solving procedure. For Newton linearization, the matrix operator is no longer symmetric and an adequate solving procedure is provided. The reported performance of linear and power law Stokes flow is finally analyzed in terms of wall time. All MATLAB codes are provided and can readily be used for educational as well as research purposes. The M2Di routines are available from Bitbucket and the University of Lausanne Scientific Computing Group website, and are also supplementary material to this article.
A Posteriori Error Estimation for Finite Element Methods and Iterative Linear Solvers
Energy Technology Data Exchange (ETDEWEB)
Melboe, Hallgeir
2001-10-01
This thesis addresses a posteriori error estimation for finite element methods and iterative linear solvers. Adaptive finite element methods have gained a lot of popularity over the last decades due to their ability to produce accurate results with limited computer power. In these methods a posteriori error estimates play an essential role. Not only do they give information about how large the total error is, they also indicate which parts of the computational domain should be given a more sophisticated treatment in order to reduce the error. A posteriori error estimates are traditionally aimed at estimating the global error, but more recently so called goal oriented error estimators have been shown a lot of interest. The name reflects the fact that they estimate the error in user-defined local quantities. In this thesis the main focus is on global error estimators for highly stretched grids and goal oriented error estimators for flow problems on regular grids. Numerical methods for partial differential equations, such as finite element methods and other similar techniques, typically result in a linear system of equations that needs to be solved. Usually such systems are solved using some iterative procedure which due to a finite number of iterations introduces an additional error. Most such algorithms apply the residual in the stopping criterion, whereas the control of the actual error may be rather poor. A secondary focus in this thesis is on estimating the errors that are introduced during this last part of the solution procedure. The thesis contains new theoretical results regarding the behaviour of some well known, and a few new, a posteriori error estimators for finite element methods on anisotropic grids. Further, a goal oriented strategy for the computation of forces in flow problems is devised and investigated. Finally, an approach for estimating the actual errors associated with the iterative solution of linear systems of equations is suggested. (author)
DEFF Research Database (Denmark)
Hartelius, Karsten; Carstensen, Jens Michael
2003-01-01
A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which r...... signals in hybridization filters and (2) localization of knit units in textile samples....
LINCS : A linear constraint solver for molecular simulations
Hess, B; Bekker, H.; Berendsen, H.J.C.; Fraaije, J.G E M
In this article, we present a new LINear Constraint Solver (LINCS) for molecular simulations with bond constraints. The algorithm is inherently stable, as the constraints themselves are reset instead of derivatives of the constraints, thereby eliminating drift. Although the derivation of the
Ebola and beyond: How Canada backs African problem-solvers ...
International Development Research Centre (IDRC) Digital Library (Canada)
2014-10-10
Oct 10, 2014 ... Canada is forging important links with the next generation of African leaders through our commitment to helping AIMS expand. AIMS is producing highly motivated problem-solvers with the advanced mathematical skills needed to confront the tremendous challenges facing Africa, and the world. We can take ...
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang
2014-09-26
Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.
Using a satisfiability solver to identify deterministic finite state automata
Heule, M.J.H.; Verwer, S.
2009-01-01
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we
Cluster Optimization and Parallelization of Simulations with Dynamically Adaptive Grids
Schreiber, Martin
2013-01-01
The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core affinity, and further meta data represents the inter-cluster communication. While stationary clusters already can be handled more efficiently than their dynamic counterparts, we propose to treat them as atomic grid entities and introduce a skip mechanism that allows the grid traversal to omit those regions completely. The communication graph ensures that the cluster data nevertheless are kept consistent, and several shared memory parallelization strategies are feasible. A hyperbolic benchmark that has to remesh selected mesh regions iteratively to preserve conforming tessellations acts as benchmark for the present work. We discuss runtime improvements resulting from the skip mechanism and the implications on shared memory performance and load balancing. © 2013 Springer-Verlag.
DEFF Research Database (Denmark)
Bergstrøm-Nielsen, Carl
2014-01-01
Cue Rondo is an open composition to be realised by improvising musicians. See more about my composition practise in the entry "Composition - General Introduction". Caution: streaming the sound/video files will in some cases only provide a few minutes' sample, or the visuals will not appear at all...
DEFF Research Database (Denmark)
Bergstrøm-Nielsen, Carl
2011-01-01
Strategies are open compositions to be realised by improvising musicians. See more about my composition practise in the entry "Composition - General Introduction". Caution: streaming the sound files will in some cases only provide a few minutes' sample. Please DOWNLOAD them to hear them in full...
DEFF Research Database (Denmark)
Bergstrøm-Nielsen, Carl
2010-01-01
New Year is an open composition to be realised by improvising musicians. It is included in "From the Danish Seasons" (see under this title). See more about my composition practise in the entry "Composition - General Introduction". This work is licensed under a Creative Commons "by-nc" License. You...
DEFF Research Database (Denmark)
2014-01-01
Memory Pieces are open compositions to be realised solo by an improvising musicians. See more about my composition practise in the entry "Composition - General Introduction". Caution: streaming the sound files will in some cases only provide a few minutes' sample. Please DOWNLOAD them to hear them...
Parallel Solver for H(div) Problems Using Hybridization and AMG
Energy Technology Data Exchange (ETDEWEB)
Lee, Chak S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-15
In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examined through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.
Coupling heat transfer and fluid flow solvers for multi-disciplinary simulations
Liu, Qingyun
The purpose of this study is to build, test, validate, and implement two heat transfer models, and couple them to an existing fluid flow solver, which can then be used for simulating multi-disciplinary problems. The first model is for heat conduction computation, the other one is a quasi-one-dimensional water cooling channel model for water-cooled jacket structural analysis. The first model employs the integral, conservative form of the thermal energy equation, which is discretized by means of a finite-volume numerical scheme. A special algorithm is developed at the interface between the solid and fluid regions, in order to keep the heat flux consistent. The thermal properties of the solid region materials can be temperature dependent, and different materials can be used in different parts of the domains, thanks to a multi-block gridding strategy. The cooling channel flow model is developed by using quasi-one-dimensional conservation laws of mass, momentum, and energy, taking into account the effects of heat transfer and friction. It is possible to have phase changes in the channel, and a mixture model is applied, which allows two phases to be present, as long as they move at the same bulk velocity and vapor quality does not exceed relatively small values. The coupling process of both models (with the fluid solver and with each other) is handled within the Loci system, and is detailed in this study. A hot-air nozzle wall problem is simulated, and the computed results are validated with available experimental data. Finally, a more complex case involving the water-cooled nozzle of a RBCC gaseous oxygen/gaseous hydrogen thruster is simulated, which involves all three models, fully coupled. The calculated temperatures in the nozzle wall and at the cooling channel outlet compare favorably with experimental data.
Tree-based solvers for adaptive mesh refinement code FLASH - I: gravity and optical depths.
Wünsch, R.; Walch, S.; Dinnbier, F.; Whitworth, A.
2018-01-01
We describe an OctTree algorithm for the MPI-parallel, adaptive mesh-refinement code FLASH, which can be used to calculate the gas self-gravity, and also the angle-averaged local optical depth, for treating ambient diffuse radiation. The algorithm communicates to the different processors only those parts of the tree that are needed to perform the tree walk locally. The advantage of this approach is a relatively low memory requirement, important in particular for the optical depth calculation, which needs to process information from many different directions. This feature also enables a general tree-based radiation transport algorithm that will be described in a subsequent paper, and delivers excellent scaling up to at least 1500 cores. Boundary conditions for gravity can be either isolated or periodic, and they can be specified in each direction independently, using a newly developed generalisation of the Ewald method. The gravity calculation can be accelerated with the adaptive block update technique by partially re-using the solution from the previous time-step. Comparison with the FLASH internal multi-grid gravity solver shows that tree based methods provide a competitive alternative, particularly for problems with isolated or mixed boundary conditions. We evaluate several multipole acceptance criteria (MACs) and identify a relatively simple APE MAC which provides high accuracy at low computational cost. The optical depth estimates are found to agree very well with those of the RADMC-3D radiation transport code, with the tree solver being much faster. Our algorithm is available in the standard release of the FLASH code in version 4.0 and later.
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
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Tang, Yu-Hang; Kudo, Shuhei; Bian, Xin; Li, Zhen; Karniadakis, George Em
2015-09-01
Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM).
A High Performance QDWH-SVD Solver using Hardware Accelerators
Sukkari, Dalal E.
2015-04-08
This paper describes a new high performance implementation of the QR-based Dynamically Weighted Halley Singular Value Decomposition (QDWH-SVD) solver on multicore architecture enhanced with multiple GPUs. The standard QDWH-SVD algorithm was introduced by Nakatsukasa and Higham (SIAM SISC, 2013) and combines three successive computational stages: (1) the polar decomposition calculation of the original matrix using the QDWH algorithm, (2) the symmetric eigendecomposition of the resulting polar factor to obtain the singular values and the right singular vectors and (3) the matrix-matrix multiplication to get the associated left singular vectors. A comprehensive test suite highlights the numerical robustness of the QDWH-SVD solver. Although it performs up to two times more flops when computing all singular vectors compared to the standard SVD solver algorithm, our new high performance implementation on single GPU results in up to 3.8x improvements for asymptotic matrix sizes, compared to the equivalent routines from existing state-of-the-art open-source and commercial libraries. However, when only singular values are needed, QDWH-SVD is penalized by performing up to 14 times more flops. The singular value only implementation of QDWH-SVD on single GPU can still run up to 18% faster than the best existing equivalent routines. Integrating mixed precision techniques in the solver can additionally provide up to 40% improvement at the price of losing few digits of accuracy, compared to the full double precision floating point arithmetic. We further leverage the single GPU QDWH-SVD implementation by introducing the first multi-GPU SVD solver to study the scalability of the QDWH-SVD framework.
Migration of vectorized iterative solvers to distributed memory architectures
Energy Technology Data Exchange (ETDEWEB)
Pommerell, C. [AT& T Bell Labs., Murray Hill, NJ (United States); Ruehl, R. [CSCS-ETH, Manno (Switzerland)
1994-12-31
Both necessity and opportunity motivate the use of high-performance computers for iterative linear solvers. Necessity results from the size of the problems being solved-smaller problems are often better handled by direct methods. Opportunity arises from the formulation of the iterative methods in terms of simple linear algebra operations, even if this {open_quote}natural{close_quotes} parallelism is not easy to exploit in irregularly structured sparse matrices and with good preconditioners. As a result, high-performance implementations of iterative solvers have attracted a lot of interest in recent years. Most efforts are geared to vectorize or parallelize the dominating operation-structured or unstructured sparse matrix-vector multiplication, or to increase locality and parallelism by reformulating the algorithm-reducing global synchronization in inner products or local data exchange in preconditioners. Target architectures for iterative solvers currently include mostly vector supercomputers and architectures with one or few optimized (e.g., super-scalar and/or super-pipelined RISC) processors and hierarchical memory systems. More recently, parallel computers with physically distributed memory and a better price/performance ratio have been offered by vendors as a very interesting alternative to vector supercomputers. However, programming comfort on such distributed memory parallel processors (DMPPs) still lags behind. Here the authors are concerned with iterative solvers and their changing computing environment. In particular, they are considering migration from traditional vector supercomputers to DMPPs. Application requirements force one to use flexible and portable libraries. They want to extend the portability of iterative solvers rather than reimplementing everything for each new machine, or even for each new architecture.
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Energy Technology Data Exchange (ETDEWEB)
Tang, Yu-Hang, E-mail: yuhang_tang@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Kudo, Shuhei, E-mail: shuhei-kudo@outlook.jp [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe, 657-8501 (Japan); Bian, Xin, E-mail: xin_bian@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Li, Zhen, E-mail: zhen_li@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Karniadakis, George Em, E-mail: george_karniadakis@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Collaboratory on Mathematics for Mesoscopic Modeling of Materials, Pacific Northwest National Laboratory, Richland, WA 99354 (United States)
2015-09-15
Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)
Mapping of grid faults and grid codes
DEFF Research Database (Denmark)
Iov, F.; Hansen, Anca Daniela; Sørensen, Poul Ejnar
for such investigations. The grid connection requirements for wind turbines have increased significantly during the last 5-10 years. Especially the requirements for wind turbines to stay connected to the grid during and after voltage sags, imply potential challenges in the design of wind turbines. These requirements pose......’ impact on the wind turbines’ lifetime are defined. The goal of this report is to present a mapping of different grid fault types and their frequency in different countries. The report provides also a detailed overview of the Low Voltage Ride-Through Capabilities for wind turbines in different relevant...
Mapping of grid faults and grid codes
DEFF Research Database (Denmark)
Iov, Florin; Hansen, A.D.; Sørensen, P.
for such investigations. The grid connection requirements for wind turbines have increased significantly during the last 5-10 years. Especially the requirements for wind turbines to stay connected to the grid during and after voltage sags, imply potential challenges in the design of wind turbines. These requirements pose......' impact on the wind turbines' lifetime are defined. The goal of this report is to present a mapping of different grid fault types and their frequency in different countries. The report provides also a detailed overview of the Low Voltage Ride-Through Capabilities for wind turbines in different relevant...
Motivation, Challenge, and Opportunity of Successful Solvers on an Innovation Platform
DEFF Research Database (Denmark)
Hossain, Mokter
2017-01-01
The objective of this study is to identify motivations, challenges, and opportunities of successful solvers participating in virtual teams of innovation contests (ICs) organized by an innovation intermediary. Based on 82 interviews of successful solvers, this study provides novel insights into ICs....... The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...
The non-linear microscale flow solver 3DWind Developments and validation
Energy Technology Data Exchange (ETDEWEB)
Undheim, Ove
2005-05-01
This PhD thesis describes the implementation of a Reynolds Stress Model in the RANS microscale solver 3DWind, which is developed to model wind flow in complex terrain. The solver is also calibrated and validated with the two-dimensional channel flow test case C18 from the ERCOFTAC Classic database and the full-scale atmospheric flow case of the Askervein hill. The implemented equations calculate both flow cases in good accordance with available experimental and numerical results. Still, the simulation experience and obtained results show that modelling of recirculation is a difficult task. The calculated flow field is very sensitive to the separation point, which is sensitive to several other factors. One important factor is the wall functions, which cause the separation zone to depend on the thickness of the first grid cell. Compared to the k-{epsilon} model, results from simulations with the Reynolds Stress Model gave improvements in the calculated turbulence upstream the C18 hill. There were also differences in the solutions in the wake of both the C18 and the Askervein hills; still, the differences are too small to make any conclusions about the quality of the models. The disadvantages of decreased stability, more wiggles in the solution and increased computational effort are considered larger than the advantages of accounting for anisotropy and historical effects in the Reynolds stresses. The solver is further used to quantify the effects of roughness and topography by generalized two-dimensional investigations of atmospheric flow. Hills and ridges are in this analysis found to increase wind velocities at 80m by up to 38%, and wind velocities above the ocean at 80m are 14% higher than corresponding open land velocities. Finally, a full wind resource assessment has been carried out at Eldsfjellet at the Norwegian island Hitra. Results were compared with measured data and simulation results from the linearized model WAsP. WAsP was found to estimate higher
Energy Technology Data Exchange (ETDEWEB)
Taft, Jeffrey D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2016-01-01
The report describes work done on Grid Architecture under the auspices of the Department of Electricity Office of Electricity Delivery and Reliability in 2015. As described in the first Grid Architecture report, the primary purpose of this work is to provide stakeholder insight about grid issues so as to enable superior decision making on their part. Doing this requires the creation of various work products, including oft-times complex diagrams, analyses, and explanations. This report provides architectural insights into several important grid topics and also describes work done to advance the science of Grid Architecture as well.
DEFF Research Database (Denmark)
Andersen, Michael; Abel, Sarah Maria Niebe; Erleben, Kenny
2017-01-01
We address the task of computing solutions for a separating fluid-solid wall boundary condition model. We present an embarrassingly parallel, easy to implement, fluid LCP solver.We are able to use greater domain sizes than previous works have shown, due to our new solver. The solver exploits matrix...
Smart grid technologies in local electric grids
Lezhniuk, Petro D.; Pijarski, Paweł; Buslavets, Olga A.
2017-08-01
The research is devoted to the creation of favorable conditions for the integration of renewable sources of energy into electric grids, which were designed to be supplied from centralized generation at large electric power stations. Development of distributed generation in electric grids influences the conditions of their operation - conflict of interests arises. The possibility of optimal functioning of electric grids and renewable sources of energy, when complex criterion of the optimality is balance reliability of electric energy in local electric system and minimum losses of electric energy in it. Multilevel automated system for power flows control in electric grids by means of change of distributed generation of power is developed. Optimization of power flows is performed by local systems of automatic control of small hydropower stations and, if possible, solar power plants.
Aeroacoustic Simulations of a Nose Landing Gear with FUN3D: A Grid Refinement Study
Vatsa, Veer N.; Khorrami, Mehdi R.; Lockard, David P.
2017-01-01
A systematic grid refinement study is presented for numerical simulations of a partially-dressed, cavity-closed (PDCC) nose landing gear configuration that was tested in the University of Florida's open-jet acoustic facility known as the UFAFF. The unstructured-grid flow solver FUN3D is used to compute the unsteady flow field for this configuration. Mixed-element grids generated using the Pointwise (Registered Trademark) grid generation software are used for numerical simulations. Particular care is taken to ensure quality cells and proper resolution in critical areas of interest in an effort to minimize errors introduced by numerical artifacts. A set of grids was generated in this manner to create a family of uniformly refined grids. The finest grid was then modified to coarsen the wall-normal spacing to create a grid suitable for the wall-function implementation in FUN3D code. A hybrid Reynolds-averaged Navier-Stokes/large eddy simulation (RANS/LES) turbulence modeling approach is used for these simulations. Time-averaged and instantaneous solutions obtained on these grids are compared with the measured data. These CFD solutions are used as input to a FfowcsWilliams-Hawkings (FW-H) noise propagation code to compute the farfield noise levels. The agreement of the computed results with the experimental data improves as the grid is refined.
Application of numerical grid generation for improved CFD analysis of multiphase screw machines
Rane, S.; Kovačević, A.
2017-08-01
Algebraic grid generation is widely used for discretization of the working domain of twin screw machines. Algebraic grid generation is fast and has good control over the placement of grid nodes. However, the desired qualities of grid which should be able to handle multiphase flows such as oil injection, may be difficult to achieve at times. In order to obtain fast solution of multiphase screw machines, it is important to further improve the quality and robustness of the computational grid. In this paper, a deforming grid of a twin screw machine is generated using algebraic transfinite interpolation to produce initial mesh upon which an elliptic partial differential equations (PDE) of the Poisson’s form is solved numerically to produce smooth final computational mesh. The quality of numerical cells and their distribution obtained by the differential method is greatly improved. In addition, a similar procedure was introduced to fully smoothen the transition of the partitioning rack curve between the rotors thus improving continuous movement of grid nodes and in turn improve robustness and speed of the Computational Fluid Dynamic (CFD) solver. Analysis of an oil injected twin screw compressor is presented to compare the improvements in grid quality factors in the regions of importance such as interlobe space, radial tip and the core of the rotor. The proposed method that combines algebraic and differential grid generation offer significant improvement in grid quality and robustness of numerical solution.
Aeroacoustic Simulation of Nose Landing Gear on Adaptive Unstructured Grids With FUN3D
Vatsa, Veer N.; Khorrami, Mehdi R.; Park, Michael A.; Lockard, 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.
Quantifiably secure power grid operation, management, and evolution :
Energy Technology Data Exchange (ETDEWEB)
Gray, Genetha Anne.; Watson, Jean-Paul; Silva Monroy, Cesar Augusto; Gramacy, Robert B.
2013-09-01
This report summarizes findings and results of the Quantifiably Secure Power Grid Operation, Management, and Evolution LDRD. The focus of the LDRD was to develop decisionsupport technologies to enable rational and quantifiable risk management for two key grid operational timescales: scheduling (day-ahead) and planning (month-to-year-ahead). Risk or resiliency metrics are foundational in this effort. The 2003 Northeast Blackout investigative report stressed the criticality of enforceable metrics for system resiliency the grids ability to satisfy demands subject to perturbation. However, we neither have well-defined risk metrics for addressing the pervasive uncertainties in a renewable energy era, nor decision-support tools for their enforcement, which severely impacts efforts to rationally improve grid security. For day-ahead unit commitment, decision-support tools must account for topological security constraints, loss-of-load (economic) costs, and supply and demand variability especially given high renewables penetration. For long-term planning, transmission and generation expansion must ensure realized demand is satisfied for various projected technological, climate, and growth scenarios. The decision-support tools investigated in this project paid particular attention to tailoriented risk metrics for explicitly addressing high-consequence events. Historically, decisionsupport tools for the grid consider expected cost minimization, largely ignoring risk and instead penalizing loss-of-load through artificial parameters. The technical focus of this work was the development of scalable solvers for enforcing risk metrics. Advanced stochastic programming solvers were developed to address generation and transmission expansion and unit commitment, minimizing cost subject to pre-specified risk thresholds. Particular attention was paid to renewables where security critically depends on production and demand prediction accuracy. To address this
Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
Weinzierl, Tobias
2011-01-01
Almost all approaches to solving partial differential equations (PDEs) are based upon a spatial discretization of the computational domain-a grid. This paper presents an algorithm to generate, store, and traverse a hierarchy of d-dimensional Cartesian grids represented by a (k = 3)- spacetree, a generalization of the well-known octree concept, and it also shows the correctness of the approach. These grids may change their adaptive structure throughout the traversal. The algorithm uses 2d + 4 stacks as data structures for both cells and vertices, and the storage requirements for the pure grid reduce to one bit per vertex for both the complete grid connectivity structure and the multilevel grid relations. Since the traversal algorithm uses only stacks, the algorithm\\'s cache hit rate is continually higher than 99.9 percent, and the runtime per vertex remains almost constant; i.e., it does not depend on the overall number of vertices or the adaptivity pattern. We use the algorithmic approach as the fundamental concept for a mesh management for d-dimensional PDEs and for a matrix-free PDE solver represented by a compact discrete 3 d-point operator. In the latter case, one can implement a Jacobi smoother, a Krylov solver, or a geometric multigrid scheme within the presented traversal scheme which inherits the low memory requirements and the good memory access characteristics directly. © 2011 Society for Industrial and Applied Mathematics.
Securing smart grid technology
Chaitanya Krishna, E.; Kosaleswara Reddy, T.; Reddy, M. YogaTeja; Reddy G. M., Sreerama; Madhusudhan, E.; AlMuhteb, Sulaiman
2013-03-01
In the developing countries electrical energy is very important for its all-round improvement by saving thousands of dollars and investing them in other sector for development. For Growing needs of power existing hierarchical, centrally controlled grid of the 20th Century is not sufficient. To produce and utilize effective power supply for industries or people we should have Smarter Electrical grids that address the challenges of the existing power grid. The Smart grid can be considered as a modern electric power grid infrastructure for enhanced efficiency and reliability through automated control, high-power converters, modern communications infrastructure along with modern IT services, sensing and metering technologies, and modern energy management techniques based on the optimization of demand, energy and network availability and so on. The main objective of this paper is to provide a contemporary look at the current state of the art in smart grid communications as well as critical issues on smart grid technologies primarily in terms of information and communication technology (ICT) issues like security, efficiency to communications layer field. In this paper we propose new model for security in Smart Grid Technology that contains Security Module(SM) along with DEM which will enhance security in Grid. It is expected that this paper will provide a better understanding of the technologies, potential advantages and research challenges of the smart grid and provoke interest among the research community to further explore this promising research area.
Eymet, V.; Poitou, D.; Galtier, M.; El Hafi, M.; Terrée, G.; Fournier, R.
2013-11-01
The Monte-Carlo method is often presented as a reference method for radiative transfer simulation when dealing with participating, inhomogeneous media. The reason is that numerical uncertainties are only of a statistical nature and are accurately evaluated by measuring the standard deviation of the Monte Carlo weight. But classical Monte-Carlo algorithms first sample optical thicknesses and then determine absorption or scattering locations by inverting the formal integral definition of optical thickness as an increasing function of path length. This function is only seldom analytically invertible and numerical inversion procedures are required. Most commonly, a volumic grid is introduced and optical properties within each cell are replaced by approximate homogeneous or linear fields. Simulation results are then sensitive to the grid and can no longer be considered as references. We propose a new algorithmic formulation based on the use of null-collisions that eliminate the need for numerical inversion: no volumic grid is required. Benchmark configurations are first considered in order to evaluate the effect of two free parameters: the amount of null-collisions, and the criterion used to decide at which stage a Russian Roulette is used to exit the path tracking process. Then the corresponding algorithm is implemented using a development environment allowing to deal with complex geometries (thanks to computer graphics techniques), leading to a Monte Carlo code that can be easily used for validation of fast radiative transfer solvers embedded in combustion simulators. "Easily" means here that the way the Monte Carlo algorithm deals with both the geometry and the temperature/pressure/concentration fields is independent of the choices made inside the combustion solver: there is no need for the design of a new path-tracking procedure adapted to each new CFD grid. The Monte Carlo simulator is ready for use as soon as combustion specialists provide a localization
African Journals Online (AJOL)
An effective medium theory of ferroelectric ceramic-polymer composite materials which treats both components symmetrically has been investigated to demonstrate the role played by the microgeometry of inclusions on dielectric, mechanical and piezoelectric properties of 0-3 composites. The limits of the various theoretical ...
Lead-acid batteries with foam grids
Tabaatabaai, S. M.; Rahmanifar, M. S.; Mousavi, S. A.; Shekofteh, S.; Khonsari, Jh.; Oweisi, A.; Hejabi, M.; Tabrizi, H.; Shirzadi, S.; Cheraghi, B.
Conventional lead-acid batteries are relatively heavy and thus have a low specific energy. Therefore, to improve the energy density, a lighter grid has been proposed. In this work, a novel lead-acid battery with high specific surface area negative foam current collectors was designed and constructed. The collectors were studied by cyclic voltametery (CV) and electrochemical impedance spectroscopy (EIS). The foam collectors were designed and suitable paste composition and formation algorithm was obtained. The basic cells were manufactured and its performance was evaluated. The results showed that the foam grids resistance was lower than that for lead grids and the specific surface area of the foam grids was very greater than lead grids. The foam battery has good discharge characteristics compared with common lead-acid batteries. The discharge curve was flat and negative mass utilization efficiency was higher than 50% when the cell was discharged with C5/5 A (137 Ah kg -1 negative active materials). The foam grids were used as negative electrode for various types of lead-acid batteries such as 60 Ah starter battery, 2, 3 and 10 Ah VRLA batteries. The batteries with foam grids were shown longer cycle life than conventional lead-acid batteries.
A dynamic solution-adaptive unstructured parallel solver
Williams, Roy
1992-12-01
This paper introduces CARDS: a Concurrent Adaptive Reaction-Diffusion Solver. Cards is designed for solving time-dependent nonlinear parabolic Partial Differential Equations (PDE's) in 2 or 3 dimensional domains with quantitative error control, using an extremely flexible mesh structure. The target machine is a distinguished-memory parallel processor with vector or pipeline hardware on the processors, but CARDS also runs efficiently on shared-memory and uniprocessor machines with and without vector hardware. CARDS uses linear finite elements. At present, it solves non-linear Poisson equations on polygonal and polyhedral domains, using Newton's method, solving the associated linear equations by diagonally preconditioned conjugate gradient. Spatial accuracy is achieved by refining the mesh sufficiently that a discrete second derivative times the square of the mesh spacing is everywhere below a user-specified bound. This spatial solver will be used with an implicit finite element time-integration scheme, which has quantitative error bounds even for adaptive meshes.
Parallel Auxiliary Space AMG Solver for $H(div)$ Problems
Energy Technology Data Exchange (ETDEWEB)
Kolev, Tzanio V. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2012-12-18
We present a family of scalable preconditioners for matrices arising in the discretization of $H(div)$ problems using the lowest order Raviart--Thomas finite elements. Our approach belongs to the class of “auxiliary space''--based methods and requires only the finite element stiffness matrix plus some minimal additional discretization information about the topology and orientation of mesh entities. Also, we provide a detailed algebraic description of the theory, parallel implementation, and different variants of this parallel auxiliary space divergence solver (ADS) and discuss its relations to the Hiptmair--Xu (HX) auxiliary space decomposition of $H(div)$ [SIAM J. Numer. Anal., 45 (2007), pp. 2483--2509] and to the auxiliary space Maxwell solver AMS [J. Comput. Math., 27 (2009), pp. 604--623]. Finally, an extensive set of numerical experiments demonstrates the robustness and scalability of our implementation on large-scale $H(div)$ problems with large jumps in the material coefficients.
Comparison of Einstein-Boltzmann solvers for testing general relativity
Bellini, E.; Barreira, A.; Frusciante, N.; Hu, B.; Peirone, S.; Raveri, M.; Zumalacárregui, M.; Avilez-Lopez, A.; Ballardini, M.; Battye, R. A.; Bolliet, B.; Calabrese, E.; Dirian, Y.; Ferreira, P. G.; Finelli, F.; Huang, Z.; Ivanov, M. M.; Lesgourgues, J.; Li, B.; Lima, N. A.; Pace, F.; Paoletti, D.; Sawicki, I.; Silvestri, A.; Skordis, C.; Umiltà, C.; Vernizzi, F.
2018-01-01
We compare Einstein-Boltzmann solvers that include modifications to general relativity and find that, for a wide range of models and parameters, they agree to a high level of precision. We look at three general purpose codes that primarily model general scalar-tensor theories, three codes that model Jordan-Brans-Dicke (JBD) gravity, a code that models f (R ) gravity, a code that models covariant Galileons, a code that models Hořava-Lifschitz gravity, and two codes that model nonlocal models of gravity. Comparing predictions of the angular power spectrum of the cosmic microwave background and the power spectrum of dark matter for a suite of different models, we find agreement at the subpercent level. This means that this suite of Einstein-Boltzmann solvers is now sufficiently accurate for precision constraints on cosmological and gravitational parameters.
Energy Technology Data Exchange (ETDEWEB)
Cohen, Aina E.; Baxter, Elizabeth L.
2018-01-16
An X-ray data collection grid device is provided that includes a magnetic base that is compatible with robotic sample mounting systems used at synchrotron beamlines, a grid element fixedly attached to the magnetic base, where the grid element includes at least one sealable sample window disposed through a planar synchrotron-compatible material, where the planar synchrotron-compatible material includes at least one automated X-ray positioning and fluid handling robot fiducial mark.
Rosy Mondardini Producer
2003-01-01
The Grid : . Sharing resources owned by many different organizations to access remote computers, software, and data efficiently and automatically . Secure access to establish the identity of a user or resource, after defining conditions under which sharing occurs . Bridging distance using high-speed connections between computers to create a global Grid . Open standards to allow applications designed for one Grid to run on all others
Thermal stitching: Extending the reach of quantum fermion solvers
Smith, Justin Clifford; Burke, Kieron
2018-01-01
For quantum fermion problems, many accurate solvers are limited by the temperature regime in which they can be usefully applied. The Mermin theorem implies the uniqueness of an effective potential from which both the exact density and free energy at a target temperature can be found, via a calculation at a different, reference temperature. We derive exact expressions for both the potential and the free energy in such a calculation, and introduce three controllable approximations that reduce t...
Menu-Driven Solver Of Linear-Programming Problems
Viterna, L. A.; Ferencz, D.
1992-01-01
Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).
Surviving Solver Sensitivity: An ASP Practitioners Guide
Silverthorn, Bryan; Lierler, Yuliya; Schneider, Marius
2012-01-01
Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the config...
A new nodal solver for the two dimensional Lagrangian hydrodynamics
Corot, T.; Mercier, B.
2018-01-01
We describe a cell-centered Godunov type scheme for the Lagrangian hydrodynamic equations on general unstructured meshes with nodal fluxes. The nodal solver only depends on the angular repartition of the physical variables around the node and not on the length of the edges. The scheme verifies a weak consistency property. Numerical results are compared to EUCCLHYD and GLACE schemes which are also cell-centered schemes with node based fluxes for Lagrangian hydrodynamics.
2008-07-22
Longitudinal resolution varies from 1/24° in a Strait of Gibraltar regional grid to 1/4° in a central North Atlantic Ocean grid. Brief details of the DieCAST ...the section below. 2.1. Basic Model [12] The purely z-level DieCAST ocean model [Dietrich et al., 1987; Dietrich, 1997] solves the discretized...scribed by Dietrich et al. [1975] used by the rigid-lid pressure solver [Roache, 1995] in a global adaptation of the DieCAST model. The present six-grid
DEFF Research Database (Denmark)
Fogh, Rune; Johansen, Asger
2013-01-01
In this paper we propose The Play Grid, a model for systemizing different play types. The approach is psychological by nature and the actual Play Grid is based, therefore, on two pairs of fundamental and widely acknowledged distinguishing characteristics of the ego, namely: extraversion vs...... at the Play Grid. Thus, the model has four quadrants, each of them describing one of four play types: the Assembler, the Director, the Explorer, and the Improviser. It is our hope that the Play Grid can be a useful design tool for making entertainment products for children....
Challenges facing production grids
Energy Technology Data Exchange (ETDEWEB)
Pordes, Ruth; /Fermilab
2007-06-01
Today's global communities of users expect quality of service from distributed Grid systems equivalent to that their local data centers. This must be coupled to ubiquitous access to the ensemble of processing and storage resources across multiple Grid infrastructures. We are still facing significant challenges in meeting these expectations, especially in the underlying security, a sustainable and successful economic model, and smoothing the boundaries between administrative and technical domains. Using the Open Science Grid as an example, I examine the status and challenges of Grids operating in production today.
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
Pavarino, L.F.
2015-07-18
The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.
Fast linear solvers for variable density turbulent flows
Pouransari, Hadi; Mani, Ali; Darve, Eric
2015-11-01
Variable density flows are ubiquitous in variety of natural and industrial systems. Two-phase and multi-phase flows in natural and industrial processes, astrophysical flows, and flows involved in combustion processes are such examples. For an ideal gas subject to low-Mach approximation, variations in temperature can lead to a non-uniform density field. In this work, we consider radiatively heated particle-laden turbulent flows as an example application in which density variability is resulted from inhomogeneities in the heat absorption by an inhomogeneous particle field. Under such conditions, the divergence constraint of the fluid is enforced through a variable coefficient Poisson equation. Inversion of the discretized variable coefficient Poisson operator is difficult using the conventional linear solvers as the size of the problem grows. We apply a novel hierarchical linear solve algorithm based on low-rank approximations. The proposed linear solver could be applied to variety of linear systems arising from discretized partial differential equations. It can be used as a standalone direct-solver with tunable accuracy and linear complexity, or as a high-accuracy pre-conditioner in conjunction with other iterative methods.
An immersed interface vortex particle-mesh solver
Marichal, Yves; Chatelain, Philippe; Winckelmans, Gregoire
2014-11-01
An immersed interface-enabled vortex particle-mesh (VPM) solver is presented for the simulation of 2-D incompressible viscous flows, in the framework of external aerodynamics. Considering the simulation of free vortical flows, such as wakes and jets, vortex particle-mesh methods already provide a valuable alternative to standard CFD methods, thanks to the interesting numerical properties arising from its Lagrangian nature. Yet, accounting for solid bodies remains challenging, despite the extensive research efforts that have been made for several decades. The present immersed interface approach aims at improving the consistency and the accuracy of one very common technique (based on Lighthill's model) for the enforcement of the no-slip condition at the wall in vortex methods. Targeting a sharp treatment of the wall calls for substantial modifications at all computational levels of the VPM solver. More specifically, the solution of the underlying Poisson equation, the computation of the diffusion term and the particle-mesh interpolation are adapted accordingly and the spatial accuracy is assessed. The immersed interface VPM solver is subsequently validated on the simulation of some challenging impulsively started flows, such as the flow past a cylinder and that past an airfoil. Research Fellow (PhD student) of the F.R.S.-FNRS of Belgium.
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Energy Technology Data Exchange (ETDEWEB)
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
IGA-ADS: Isogeometric analysis FEM using ADS solver
Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav
2017-08-01
In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).
NITSOL: A Newton iterative solver for nonlinear systems
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)
1996-12-31
Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.
Recent Results in the Study of Static Ground Effect Using an Inviscid Unstructured Grid Code
Yaros, Steven F.
1999-01-01
The TetrUSS (Tetrahedral Unstructured Software System), developed at NASA LaRC, enables one to take a vehicle from its surface definition to its analyzed solution. The important parts are the shape definition, accomplished in GRIDTOOL; the initial front and volume grid generation in VGRID; the flow solver USM3D, and the various ways used to post-process the computational results.
A Newton-Krylov solver with a loosely-coupled turbulence model for aerodynamic flows
Blanco, Max
Computational solutions of the Navier-Stokes equations have proven to be a useful tool in the design of aircraft. A Newton-Krylov flow solver for unstructured grids is developed in order to demonstrate that a formulation in which the mean-flow and turbulence mechanism equations are loosely coupled can be more economical than a similar fully-coupled formulation. The Favre-averaged Navier-Stokes equations are derived for steady two-dimensional flows, and the turbulence mechanism is described. These equations constitute a model of the physics of aerodynamic flows. The model is validated against experimental data. The objective of this thesis is to examine a means to improve the iterative process by which the solutions are generated. The Newton-Krylov iteration is selected in order to refine the solution, and its features examined. The authors of current Newton-Krylov techniques have fully coupled the turbulence mechanism to the Navier-Stokes equations. A contrast and comparison study made here between the fully-coupled formulation and a loosely-coupled alternative favours the latter. An 'equivalent function evaluation' metric is selected for comparison purposes, and is assessed by means of diverse computers. Published results which use the metric are located, and the present loosely-coupled formulation for unstructured grids is found to be significantly faster in this metric than similar fully-coupled formulations. The advantages of the loosely-coupled formulation with respect to the fully-coupled formulation are stated and future avenues for exploitation of the proposed technology are examined. Appendices consist of: a formalism for the Favre average and consequences of its derivation; a short tract on Taylor series; and an essay on the Frechet differential.
Li, Zhaorui; Livescu, Daniel
2017-11-01
The two-fluid plasma equations with full transport terms, including temperature and magnetic field dependent ion and electron viscous stresses and heat fluxes, frictional drag force, and ohmic heating term have been solved by using the sixth-order non-dissipative compact scheme for plasma flows in several different regimes. In order to be able to fully resolve all the dynamically relevant time and length scales while maintaining computational feasibility, the assumptions of infinite speed of light and negligible electron inertia have been made. The accuracy and robustness of this two-fluid plasma solver in handling plasma flows have been tested against a series of canonical problems, such as Alfven-Whistler dispersion relation, electromagnetic plasma shock, magnetic reconnection, etc. For all test cases, grid convergence tests have been conducted to achieve fully resolved results. The roles of heat flux, viscosity, resistivity, Hall and Biermann battery effects, are investigated for the canonical flows studied.
AbouEisha, Hassan M.
2017-07-13
We consider a class of two-and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive
Progress in Unsteady Turbopump Flow Simulations Using Overset Grid Systems
Kiris, Cetin C.; Chan, William; Kwak, Dochan
2002-01-01
This viewgraph presentation provides information on unsteady flow simulations for the Second Generation RLV (Reusable Launch Vehicle) baseline turbopump. Three impeller rotations were simulated by using a 34.3 million grid points model. MPI/OpenMP hybrid parallelism and MLP shared memory parallelism has been implemented and benchmarked in INS3D, an incompressible Navier-Stokes solver. For RLV turbopump simulations a speed up of more than 30 times has been obtained. Moving boundary capability is obtained by using the DCF module. Scripting capability from CAD geometry to solution is developed. Unsteady flow simulations for advanced consortium impeller/diffuser by using a 39 million grid points model are currently underway. 1.2 impeller rotations are completed. The fluid/structure coupling is initiated.
Current collecting grids for ITO-free solar cells
Galagan, Y.O.; Zimmermann, B.; Coenen, E.W.C.; Jorgensen, M.; Tanenbaum, D.M.; Krebs, F.C.; Gorter, H.; Sabik, S.; Slooff, L.H.; Veenstra, S.C.; Kroon, J.M.; Andriessen, H.A.J.M.
2012-01-01
Indium-tin-oxide (ITO) free polymer solar cells prepared by ink jet printing a composite front electrode comprising silver grid lines and a semitransparent PEDOT:PSS conductor are demonstrated. The effect of grid line density is explored for a large series of devices and a careful modeling study
The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
Collier, Nathan
2013-03-19
In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form. Specifically, we compare performance of linear solvers when discretizing using Co B-splines, which span traditional finite element spaces, and Cp-1 B-splines, which represent maximum continuity We provide theoretical estimates for the increase in cost of the matrix-vector product as well as for the construction and application of black-box preconditioners. We accompany these estimates with numerical results and study their sensitivity to various grid parameters such as element size h and polynomial order of approximation p in addition to the aforementioned continuity of the basis. Finally, we present timing results for a range of preconditioning options for the Laplace problem. We conclude that the matrix-vector product operation is at most 33p2/8 times more expensive for the more continuous space, although for moderately low p, this number is significantly reduced. Moreover, if static condensation is not employed, this number further reduces to at most a value of 8, even for high p. Preconditioning options can be up to p3 times more expensive to set up, although this difference significantly decreases for some popular preconditioners such as incomplete LU factorization. © 2013 Society for Industrial and Applied Mathematics.
Takahashi, Yusuke
2016-01-01
An analysis model of plasma flow and electromagnetic waves around a reentry vehicle for radio frequency blackout prediction during aerodynamic heating was developed in this study. The model was validated based on experimental results from the radio attenuation measurement program. The plasma flow properties, such as electron number density, in the shock layer and wake region were obtained using a newly developed unstructured grid solver that incorporated real gas effect models and could treat thermochemically non-equilibrium flow. To predict the electromagnetic waves in plasma, a frequency-dependent finite-difference time-domain method was used. Moreover, the complicated behaviour of electromagnetic waves in the plasma layer during atmospheric reentry was clarified at several altitudes. The prediction performance of the combined model was evaluated with profiles and peak values of the electron number density in the plasma layer. In addition, to validate the models, the signal losses measured during communication with the reentry vehicle were directly compared with the predicted results. Based on the study, it was suggested that the present analysis model accurately predicts the radio frequency blackout and plasma attenuation of electromagnetic waves in plasma in communication.
Adaptive integral method with fast Gaussian gridding for solving combined field integral equations
Bakır, O.; Baǧ; Cı, H.; Michielssen, E.
Fast Gaussian gridding (FGG), a recently proposed nonuniform fast Fourier transform algorithm, is used to reduce the memory requirements of the adaptive integral method (AIM) for accelerating the method of moments-based solution of combined field integral equations pertinent to the analysis of scattering from three-dimensional perfect electrically conducting surfaces. Numerical results that demonstrate the efficiency and accuracy of the AIM-FGG hybrid in comparison to an AIM-accelerated solver, which uses moment matching to project surface sources onto an auxiliary grid, are presented.
High-order nodal discontinuous Galerkin particle-in-cell method on unstructured grids
Jacobs, G. B.; Hesthaven, J. S.
2006-05-01
We present a high-order particle-in-cell (PIC) algorithm for the simulation of kinetic plasmas dynamics. The core of the algorithm utilizes an unstructured grid discontinuous Galerkin Maxwell field solver combining high-order accuracy with geometric flexibility. We introduce algorithms in the Lagrangian framework that preserve the favorable properties of the field solver in the PIC solver. Fast full-order interpolation and effective search algorithms are used for tracking individual particles on the general grid and smooth particle shape functions are introduced to ensure low noise in the charge and current density. A pre-computed levelset distance function is employed to represent the geometry and facilitates complex particle-boundary interaction. To enforce charge conservation we consider two different techniques, one based on projection and one on hyperbolic cleaning. Both are found to work well, although the latter is found be too expensive when used with explicit time integration. Examples of simple plasma phenomena, e.g., plasma waves, instabilities, and Landau damping are shown to agree well with theoretical predictions and/or results found by other computational methods. We also discuss generic well known problems such as numerical Cherenkov radiation and grid heating before presenting a few two-dimensional tests, showing the potential of the current method to handle fully relativistic plasma dynamics in complex geometries.
Gridded Species Distribution: Global Amphibian Richness Grids, 2015 Release
National Aeronautics and Space Administration — The 2015 Release of the Global Amphibian Richness Grids data set of the Gridded Species Distribution collection are aggregations of the presence grids data for the...
Gridded Species Distribution, Version 1: Global Amphibians Presence Grids
National Aeronautics and Space Administration — The Global Amphibians Presence Grids of the Gridded Species Distribution, Version 1 is a reclassified version of the original grids of amphibian species distribution...
Gridded Species Distribution, Version 1: Global Amphibians Original Grids
National Aeronautics and Space Administration — The Global Amphibians Original Grids of the Gridded Species Distribution, Version 1 are converted 1- kilometer grid cell data available in the Geographic Coordinate...
Gridded Species Distribution, Version 1: Global Amphibians Family Richness Grids
National Aeronautics and Space Administration — Global Amphibians Family Richness Grids of the Gridded Species Distribution, Version 1 are aggregations of the presence grids data at the family level. They are...
Gridded Species Distribution: Global Mammal Richness Grids, 2015 Release
National Aeronautics and Space Administration — The 2015 Release of the Global Mammal Richness Grids data set of the Gridded Species Distribution collection are aggregations of the presence grids data for the...
Perspectives on grid computing
Schwiegelshohn, U.; Badia, R.M.; Bubak, M.T.; Danelutto, M.; Dustdar, S.; Gagliardi, F.; Geiger, A.; Hluchy, L.; Kranzlmüller, D.; Laure, E.; Priol, T.; Reinefeld, A.; Resch, M.; Reuter, A.; Rienhoff, O.; Rüter, T.; Sloot, P.; Talia, D.; Ullmann, K.; Yahyapour, R.; von Voigt, G.
2010-01-01
Grid computing has been the subject of many large national and international IT projects. However, not all goals of these projects have been achieved. In particular, the number of users lags behind the initial forecasts laid out by proponents of grid technologies. This underachievement may have led
Baranov, Alexander
2016-01-01
The LHCb Grid access if based on the LHCbDirac system. It provides access to data and computational resources to researchers with different geographical locations. The Grid has a hierarchical topology with multiple sites distributed over the world. The sites differ from each other by their number of CPUs, amount of disk storage and connection bandwidth. These parameters are essential for the Grid work. Moreover, job scheduling and data distribution strategy have a great impact on the grid performance. However, it is hard to choose an appropriate algorithm and strategies as they need a lot of time to be tested on the real grid. In this study, we describe the LHCb Grid simulator. The simulator reproduces the LHCb Grid structure with its sites and their number of CPUs, amount of disk storage and bandwidth connection. We demonstrate how well the simulator reproduces the grid work, show its advantages and limitations. We show how well the simulator reproduces job scheduling and network anomalies, consider methods ...
Bosman, M.G.C.
2012-01-01
The electricity supply chain is changing, due to increasing awareness for sustainability and an improved energy efficiency. The traditional infrastructure where demand is supplied by centralized generation is subject to a transition towards a Smart Grid. In this Smart Grid, sustainable generation
Silvano de Gennaro
2003-01-01
DataGrid is a project funded by the European Union that aims to enable access to geographically distributed computing power and storage facilities belonging to different institutions. This will provide scientists with an unprecedented computing and data management tool. DataGrid is led by CERN, together with 20 other scientific and industrial partners.
Energy Technology Data Exchange (ETDEWEB)
Humphrey, Marty; Thompson, Mary R.; Jackson, Keith R.
2005-08-14
Securing a Grid environment presents a distinctive set of challenges. This paper groups the activities that need to be secured into four categories: naming and authentication; secure communication; trust, policy, and authorization; and enforcement of access control. It examines the current state of the art in securing these processes and introduces new technologies that promise to meet the security requirements of Grids more completely.
Towards High Performance Discrete-Event Simulations of Smart Electric Grids
Energy Technology Data Exchange (ETDEWEB)
Perumalla, Kalyan S [ORNL; Nutaro, James J [ORNL; Yoginath, Srikanth B [ORNL
2011-01-01
Future electric grid technology is envisioned on the notion of a smart grid in which responsive end-user devices play an integral part of the transmission and distribution control systems. Detailed simulation is often the primary choice in analyzing small network designs, and the only choice in analyzing large-scale electric network designs. Here, we identify and articulate the high-performance computing needs underlying high-resolution discrete event simulation of smart electric grid operation large network scenarios such as the entire Eastern Interconnect. We focus on the simulator's most computationally intensive operation, namely, the dynamic numerical solution for the electric grid state, for both time-integration as well as event-detection. We explore solution approaches using general-purpose dense and sparse solvers, and propose a scalable solver specialized for the sparse structures of actual electric networks. Based on experiments with an implementation in the THYME simulator, we identify performance issues and possible solution approaches for smart grid experimentation in the large.
DEFF Research Database (Denmark)
Sommer, Simon; Ma, Zheng; Jørgensen, Bo Nørregaard
2015-01-01
China is planning to transform its traditional power grid in favour of a smart grid, since it allows a more economically efficient and a more environmentally friendly transmission and distribution of electricity. Thus, a nationwide smart grid is likely to save tremendous amounts of resources...... and costs. This paper elaborates on the key stakeholders, crucial polices and general challenges in the context of the Chinese smart grid development. The paper finds that the Chinese energy market is a state monopoly and foreign companies can only become key stakeholders in the role of suppliers or service...... providers. It can be concluded that the Chinese smart grid development has still to overcome technological and political issues, such as overlapping authority structures, not installed or immature key technologies, the absence of standards and governmental market protectionism....
Liseikin, Vladimir D
2017-01-01
This new edition provides a description of current developments relating to grid methods, grid codes, and their applications to actual problems. Grid generation methods are indispensable for the numerical solution of differential equations. Adaptive grid-mapping techniques, in particular, are the main focus and represent a promising tool to deal with systems with singularities. This 3rd edition includes three new chapters on numerical implementations (10), control of grid properties (11), and applications to mechanical, fluid, and plasma related problems (13). Also the other chapters have been updated including new topics, such as curvatures of discrete surfaces (3). Concise descriptions of hybrid mesh generation, drag and sweeping methods, parallel algorithms for mesh generation have been included too. This new edition addresses a broad range of readers: students, researchers, and practitioners in applied mathematics, mechanics, engineering, physics and other areas of applications.
CERN. Geneva HR-RFA
2006-01-01
The Grid infrastructure is a key part of the computing environment for the simulation, processing and analysis of the data of the LHC experiments. These experiments depend on the availability of a worldwide Grid infrastructure in several aspects of their computing model. The Grid middleware will hide much of the complexity of this environment to the user, organizing all the resources in a coherent virtual computer center. The general description of the elements of the Grid, their interconnections and their use by the experiments will be exposed in this talk. The computational and storage capability of the Grid is attracting other research communities beyond the high energy physics. Examples of these applications will be also exposed during the presentation.
Advanced Methodology for Simulation of Complex Flows Using Structured Grid Systems
Steinthorsson, Erlendur; Modiano, David
1995-01-01
Detailed simulations of viscous flows in complicated geometries pose a significant challenge to current capabilities of Computational Fluid Dynamics (CFD). To enable routine application of CFD to this class of problems, advanced methodologies are required that employ (a) automated grid generation, (b) adaptivity, (c) accurate discretizations and efficient solvers, and (d) advanced software techniques. Each of these ingredients contributes to increased accuracy, efficiency (in terms of human effort and computer time), and/or reliability of CFD software. In the long run, methodologies employing structured grid systems will remain a viable choice for routine simulation of flows in complex geometries only if genuinely automatic grid generation techniques for structured grids can be developed and if adaptivity is employed more routinely. More research in both these areas is urgently needed.
BeamDyn: A High-Fidelity Wind Turbine Blade Solver in the FAST Modular Framework: Preprint
Energy Technology Data Exchange (ETDEWEB)
Wang, Q.; Sprague, M.; Jonkman, J.; Johnson, N.
2015-01-01
BeamDyn, a Legendre-spectral-finite-element implementation of geometrically exact beam theory (GEBT), was developed to meet the design challenges associated with highly flexible composite wind turbine blades. In this paper, the governing equations of GEBT are reformulated into a nonlinear state-space form to support its coupling within the modular framework of the FAST wind turbine computer-aided engineering (CAE) tool. Different time integration schemes (implicit and explicit) were implemented and examined for wind turbine analysis. Numerical examples are presented to demonstrate the capability of this new beam solver. An example analysis of a realistic wind turbine blade, the CX-100, is also presented as validation.
Electron gas grid semiconductor radiation detectors
Lee, Edwin Y.; James, Ralph B.
2002-01-01
An electron gas grid semiconductor radiation detector (EGGSRAD) useful for gamma-ray and x-ray spectrometers and imaging systems is described. The radiation detector employs doping of the semiconductor and variation of the semiconductor detector material to form a two-dimensional electron gas, and to allow transistor action within the detector. This radiation detector provides superior energy resolution and radiation detection sensitivity over the conventional semiconductor radiation detector and the "electron-only" semiconductor radiation detectors which utilize a grid electrode near the anode. In a first embodiment, the EGGSRAD incorporates delta-doped layers adjacent the anode which produce an internal free electron grid well to which an external grid electrode can be attached. In a second embodiment, a quantum well is formed between two of the delta-doped layers, and the quantum well forms the internal free electron gas grid to which an external grid electrode can be attached. Two other embodiments which are similar to the first and second embodiment involve a graded bandgap formed by changing the composition of the semiconductor material near the first and last of the delta-doped layers to increase or decrease the conduction band energy adjacent to the delta-doped layers.
Communication: Journalism Education Today, 2002
2002-01-01
Considers how photography is more than just pointing a camera in the right direction. Explains that good pictures use elements of composition such as the Rule of Thirds, leading lines, framing and repetition of shapes. Presents 16 photographs from college and secondary school publications, and describes the techniques that makes them effective.…
Schäfer, Benjamin; Matthiae, Moritz; Timme, Marc; Witthaut, Dirk
2015-01-01
Stable operation of complex flow and transportation networks requires balanced supply and demand. For the operation of electric power grids—due to their increasing fraction of renewable energy sources—a pressing challenge is to fit the fluctuations in decentralized supply to the distributed and temporally varying demands. To achieve this goal, common smart grid concepts suggest to collect consumer demand data, centrally evaluate them given current supply and send price information back to customers for them to decide about usage. Besides restrictions regarding cyber security, privacy protection and large required investments, it remains unclear how such central smart grid options guarantee overall stability. Here we propose a Decentral Smart Grid Control, where the price is directly linked to the local grid frequency at each customer. The grid frequency provides all necessary information about the current power balance such that it is sufficient to match supply and demand without the need for a centralized IT infrastructure. We analyze the performance and the dynamical stability of the power grid with such a control system. Our results suggest that the proposed Decentral Smart Grid Control is feasible independent of effective measurement delays, if frequencies are averaged over sufficiently large time intervals.
Grammar Based Multi-Frontal Solver For Isogeometric Analysis In 1d
Directory of Open Access Journals (Sweden)
Krzysztof Kuznik
2013-01-01
Full Text Available In this paper we present multi-frontal direct solver for one dimensional isogeometric ﬁniteelement method. The solver implementation is based on graph-grammar (GG model. TheGG model allows to express the entire solver algorithm, including generation of frontalmatrices, maerging and eliminations, as a set of basic undividable tasks called graph grammarproductions. Having the solver algorithm expressed as GG productions we can ﬁnd thepartial order of execution, and create the dependency graph allowing for scheduling of tasksinto shared memory parallel machine. We focus on the implementation of the solver withNVIDIA CUDA on the graphic processing unit (GPU. The solver has been tested for linear,quadratic, cubic and higher ordere B-splines, resulting in logarithmic scalability.
A New Robust Solver for Saturated-Unsaturated Richards' Equation
Barajas-Solano, D. A.; Tartakovsky, D. M.
2012-12-01
We present a novel approach for the numerical integration of the saturated-unsaturated Richards' equation, a degenerate parabolic partial differential equation that models flow in porous media. The method is based on the mixed (pore pressure-water content) form of RE, written as a set of differential algebraic equations (DAEs) of index-1 for the fully saturated case and index-2 for the partially saturated case. A DAE-based approach allows us to overcome the numerical challenges posed by the degenerate nature of the Richards' equation. The resulting set of DAEs is solved using the stiffly-accurate, single-step, 3-stage implicit Runge-Kutta method Radau IIA, chosen for its favorable accuracy and stability properties, and its ease of implementation. For each time step a nonlinear system of equations on the intermediate Runge-Kutta states of the pore pressure is solved, written so to ensure that the next step pore pressure and water content correspond to one another correctly. The implementation of our approach compares favorably to state-of-the-art DAE-based solvers in both one- and two-dimensional simulations. These solvers use multi-step backward difference formulas together with a pressure-based form of Richards' equation. To the best of our knowledge, our method is the first instance of a successful DAE-based solver that uses the mixed form of Richards' equation. We consider this a promising line of research, with future work to be done on the use of globally convergent methods for the solution of the occurring nonlinear systems of equations.
Application of Nearly Linear Solvers to Electric Power System Computation
Grant, Lisa L.
To meet the future needs of the electric power system, improvements need to be made in the areas of power system algorithms, simulation, and modeling, specifically to achieve a time frame that is useful to industry. If power system time-domain simulations could run in real-time, then system operators would have situational awareness to implement online control and avoid cascading failures, significantly improving power system reliability. Several power system applications rely on the solution of a very large linear system. As the demands on power systems continue to grow, there is a greater computational complexity involved in solving these large linear systems within reasonable time. This project expands on the current work in fast linear solvers, developed for solving symmetric and diagonally dominant linear systems, in order to produce power system specific methods that can be solved in nearly-linear run times. The work explores a new theoretical method that is based on ideas in graph theory and combinatorics. The technique builds a chain of progressively smaller approximate systems with preconditioners based on the system's low stretch spanning tree. The method is compared to traditional linear solvers and shown to reduce the time and iterations required for an accurate solution, especially as the system size increases. A simulation validation is performed, comparing the solution capabilities of the chain method to LU factorization, which is the standard linear solver for power flow. The chain method was successfully demonstrated to produce accurate solutions for power flow simulation on a number of IEEE test cases, and a discussion on how to further improve the method's speed and accuracy is included.
Code Verification of the HIGRAD Computational Fluid Dynamics Solver
Energy Technology Data Exchange (ETDEWEB)
Van Buren, Kendra L. [Los Alamos National Laboratory; Canfield, Jesse M. [Los Alamos National Laboratory; Hemez, Francois M. [Los Alamos National Laboratory; Sauer, Jeremy A. [Los Alamos National Laboratory
2012-05-04
The purpose of this report is to outline code and solution verification activities applied to HIGRAD, a Computational Fluid Dynamics (CFD) solver of the compressible Navier-Stokes equations developed at the Los Alamos National Laboratory, and used to simulate various phenomena such as the propagation of wildfires and atmospheric hydrodynamics. Code verification efforts, as described in this report, are an important first step to establish the credibility of numerical simulations. They provide evidence that the mathematical formulation is properly implemented without significant mistakes that would adversely impact the application of interest. Highly accurate analytical solutions are derived for four code verification test problems that exercise different aspects of the code. These test problems are referred to as: (i) the quiet start, (ii) the passive advection, (iii) the passive diffusion, and (iv) the piston-like problem. These problems are simulated using HIGRAD with different levels of mesh discretization and the numerical solutions are compared to their analytical counterparts. In addition, the rates of convergence are estimated to verify the numerical performance of the solver. The first three test problems produce numerical approximations as expected. The fourth test problem (piston-like) indicates the extent to which the code is able to simulate a 'mild' discontinuity, which is a condition that would typically be better handled by a Lagrangian formulation. The current investigation concludes that the numerical implementation of the solver performs as expected. The quality of solutions is sufficient to provide credible simulations of fluid flows around wind turbines. The main caveat associated to these findings is the low coverage provided by these four problems, and somewhat limited verification activities. A more comprehensive evaluation of HIGRAD may be beneficial for future studies.
Algorithms and data structures for adaptive multigrid elliptic solvers
Vanrosendale, J.
1983-01-01
Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented.
Finite element solvers for incompressible fluid flows and heat transfer
Sohn, Jeong L.; Kim, Yongmo; Chung, T. J.
1989-01-01
Two different finite-element solvers for incompressible viscous flow, i.e., the mixed interpolation method and the SIMPLE-type iterative method, are compared and tested with some benchmark problems. The advantages of the SIMPLE-type iterative method are the decoupling of the governing equations and the use of equal-order interpolation functions for both velocity and pressure. Even though there is a significant difference between the two methods in terms of the pressure field, similar solutions are obtained for the velocity field.
Turbulent Flow Validation in the Helios Strand Solver
2014-01-07
Multi-dimensional results come summing the results in three dimensions. The linear convection diffusion model equation is give as: ∂u ∂t + ∂(au) ∂x −ν...through the three-dimensional stencil of cells surrounding a strand.19 Once the nodal values have been obtained, a Green-Gauss surface integration ...on the approximate Riemann solver of Roe,20 F̂ = 1 2 (F (QR)+F (QL))− 1 2 |A(QR,QL)|(QR−QL) , (45) where F = Fjn j is the directed flux at a face with
Conjugate gradient solvers on Intel Xeon Phi and NVIDIA GPUs
Kaczmarek, O; Steinbrecher, P; Wagner, M
2014-01-01
Lattice Quantum Chromodynamics simulations typically spend most of the runtime in inversions of the Fermion Matrix. This part is therefore frequently optimized for various HPC architectures. Here we compare the performance of the Intel Xeon Phi to current Kepler-based NVIDIA Tesla GPUs running a conjugate gradient solver. By exposing more parallelism to the accelerator through inverting multiple vectors at the same time, we obtain a performance greater than 300 GFlop/s on both architectures. This more than doubles the performance of the inversions. We also give a short overview of the Knights Corner architecture, discuss some details of the implementation and the effort required to obtain the achieved performance.
Modelo de selección de cartera con Solver
Directory of Open Access Journals (Sweden)
P. Fogués Zornoza
2012-04-01
Full Text Available In this paper, we present an example of linear optimization in the context of degrees in Economics or Business Administration and Management. We show techniques that enable students to go deep and investigate in real problems that have been modelled using the Excel platform. The model shown here has been developed by a student and it consists in minimizing the absolute deviations over the average expected return of a portfolio of securities, using the solver tool that it is included in this software.
Comparison of PBO solvers in a dependency solving domain
Directory of Open Access Journals (Sweden)
Paulo Trezentos
2010-07-01
Full Text Available Linux package managers have to deal with dependencies and conflicts of packages required to be installed by the user. As an NP-complete problem, this is a hard task to solve. In this context, several approaches have been pursued. Apt-pbo is a package manager based on the apt project that encodes the dependency solving problem as a pseudo-Boolean optimization (PBO problem. This paper compares different PBO solvers and their effectiveness on solving the dependency solving problem.
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, Huda
2016-12-07
Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic PDE solver have opened the possibility to use it as a preconditioner for even a broader range of applications. In this thesis, we (i) discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on inter-node communication, and develop a performance model that considers the communication patterns of the FMM for spatially quasi-uniform distributions, (ii) employ this performance model to guide performance and scaling improvement of FMM for all-atom molecular dynamics simulations of uniformly distributed particles, and (iii) demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, FMM is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity
Haarla, Liisa; Hirvonen, Ritva; Labeau, Pierre-Etienne
2011-01-01
In response to the growing importance of power system security and reliability, ""Transmission Grid Security"" proposes a systematic and probabilistic approach for transmission grid security analysis. The analysis presented uses probabilistic safety assessment (PSA) and takes into account the power system dynamics after severe faults. In the method shown in this book the power system states (stable, not stable, system breakdown, etc.) are connected with the substation reliability model. In this way it is possible to: estimate the system-wide consequences of grid faults; identify a chain of eve
Motivation, Challenge, and Opportunity of Successful Solvers on an Innovation Platform
DEFF Research Database (Denmark)
Hossain, Mokter
2017-01-01
. The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...... differences, difficulties in finding suitable team members, framing the results, and difficulties in becoming quick learners and team players. Despite challenges, solvers have many opportunities, such as diversified knowledge, learning culture, developing a different way of thinking, gaining insights from...
2015-04-12
Avoiding communication in the Lanczos bidiagonalization routine and associated Least Squares QR solver Erin Carson Electrical Engineering and...Bidiagonalization Routine and Associated Least Squares QR Solver 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d...ASSOCIATED LEAST SQUARES QR SOLVER ERIN CARSON Abstract. Communication – the movement of data between levels of memory hierarchy or between processors
Jahandari, H.; Farquharson, C. G.
2017-11-01
Unstructured grids enable representing arbitrary structures more accurately and with fewer cells compared to regular structured grids. These grids also allow more efficient refinements compared to rectilinear meshes. In this study, tetrahedral grids are used for the inversion of magnetotelluric (MT) data, which allows for the direct inclusion of topography in the model, for constraining an inversion using a wireframe-based geological model and for local refinement at the observation stations. A minimum-structure method with an iterative model-space Gauss-Newton algorithm for optimization is used. An iterative solver is employed for solving the normal system of equations at each Gauss-Newton step and the sensitivity matrix-vector products that are required by this solver are calculated using pseudo-forward problems. This method alleviates the need to explicitly form the Hessian or Jacobian matrices which significantly reduces the required computation memory. Forward problems are formulated using an edge-based finite-element approach and a sparse direct solver is used for the solutions. This solver allows saving and re-using the factorization of matrices for similar pseudo-forward problems within a Gauss-Newton iteration which greatly minimizes the computation time. Two examples are presented to show the capability of the algorithm: the first example uses a benchmark model while the second example represents a realistic geological setting with topography and a sulphide deposit. The data that are inverted are the full-tensor impedance and the magnetic transfer function vector. The inversions sufficiently recovered the models and reproduced the data, which shows the effectiveness of unstructured grids for complex and realistic MT inversion scenarios. The first example is also used to demonstrate the computational efficiency of the presented model-space method by comparison with its data-space counterpart.
Lyon, Mark; Bruno, Oscar P.
2010-05-01
A new PDE solver was introduced recently, in Part I of this two-paper sequence, on the basis of two main concepts: the well-known Alternating Direction Implicit (ADI) approach, on one hand, and a certain "Fourier Continuation" (FC) method for the resolution of the Gibbs phenomenon, on the other. Unlike previous alternating direction methods of order higher than one, which only deliver unconditional stability for rectangular domains, the new high-order FC-AD (Fourier-Continuation Alternating-Direction) algorithm yields unconditional stability for general domains—at an O(Nlog(N)) cost per time-step for an N point spatial discretization grid. In the present contribution we provide an overall theoretical discussion of the FC-AD approach and we extend the FC-AD methodology to linear hyperbolic PDEs. In particular, we study the convergence properties of the newly introduced FC(Gram) Fourier Continuation method for both approximation of general functions and solution of the alternating-direction ODEs. We also present (for parabolic PDEs on general domains, and, thus, for our associated elliptic solvers) a stability criterion which, when satisfied, ensures unconditional stability of the FC-AD algorithm. Use of this criterion in conjunction with numerical evaluation of a series of singular values (of the alternating-direction discrete one-dimensional operators) suggests clearly that the fifth-order accurate class of parabolic and elliptic FC-AD solvers we propose is indeed unconditionally stable for all smooth spatial domains and for arbitrarily fine discretizations. To illustrate the FC-AD methodology in the hyperbolic PDE context, finally, we present an example concerning the Wave Equation—demonstrating sixth-order spatial and fourth-order temporal accuracy, as well as a complete absence of the debilitating "dispersion error", also known as "pollution error", that arises as finite-difference and finite-element solvers are applied to solution of wave propagation
On the implicit density based OpenFOAM solver for turbulent compressible flows
Directory of Open Access Journals (Sweden)
Fürst Jiří
2017-01-01
Full Text Available The contribution deals with the development of coupled implicit density based solver for compressible flows in the framework of open source package OpenFOAM. However the standard distribution of OpenFOAM contains several ready-made segregated solvers for compressible flows, the performance of those solvers is rather week in the case of transonic flows. Therefore we extend the work of Shen [15] and we develop an implicit semi-coupled solver. The main flow field variables are updated using lower-upper symmetric Gauss-Seidel method (LU-SGS whereas the turbulence model variables are updated using implicit Euler method.
Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds
National Research Council Canada - National Science Library
MacDonald, Jason E
2007-01-01
The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources...
High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems
National Research Council Canada - National Science Library
Mahadevan, Vijay S; Merzari, Elia; Tautges, Timothy; Jain, Rajeev; Obabko, Aleksandr; Smith, Michael; Fischer, Paul
2014-01-01
...-hydraulics physics under the SHARP framework. Over several years, high-fidelity, validated mono-physics solvers with proven scalability on petascale architectures have been developed independently...
Technology Roadmaps: Smart Grids
Energy Technology Data Exchange (ETDEWEB)
NONE
2011-07-01
The development of Technology Roadmaps: Smart Grids -- which the IEA defines as an electricity network that uses digital and other advanced technologies to monitor and manage the transport of electricity from all generation sources to meet the varying electricity demands of end users -- is essential if the global community is to achieve shared goals for energy security, economic development and climate change mitigation. Unfortunately, existing misunderstandings of exactly what smart grids are and the physical and institutional complexity of electricity systems make it difficult to implement smart grids on the scale that is needed. This roadmap sets out specific steps needed over the coming years to achieve milestones that will allow smart grids to deliver a clean energy future.
Kansas Data Access and Support Center — This is a polygon feature data layer of United States National Grid (1000m x 1000m polygons ) constructed by the Center for Interdisciplinary Geospatial Information...
Federal Laboratory Consortium — The Lincoln Laboratory Grid (LLGrid) is an interactive, on-demand parallel computing system that uses a large computing cluster to enable Laboratory researchers to...
Grätzel von Grätz, Philipp
2007-01-01
Whether for genetic risk analysis or 3D-rekonstruktion of the cerebral vessels: the modern medicine requires more computing power. With a grid infrastructure, this one can be if necessary called by the network. (4 pages)
Controlling smart grid adaptivity
Toersche, Hermen; Nykamp, Stefan; Molderink, Albert; Hurink, Johann L.; Smit, Gerardus Johannes Maria
2012-01-01
Methods are discussed for planning oriented smart grid control to cope with scenarios with limited predictability, supporting an increasing penetration of stochastic renewable resources. The performance of these methods is evaluated with simulations using measured wind generation and consumption
Yurkewicz, Katie
2005-01-01
Today's cutting-edge scientific projects are larger, more complex, and more expensive than ever. Grid computing provides the resources that allow researchers to share knowledge, data, and computer processing power across boundaries
National Aeronautics and Space Administration — New cell centered grids are generated to complement the node-centered ones uploaded. Six tarballs containing the coarse, medium, and fine mixed-element and pure tet....
Massimino, P.; Costa, A.
2008-08-01
Image Data Language is a software for data analysis, visualization and cross-platform application development. The potentiality of IDL is well-known in the academic scientific world, especially in the astronomical environment where thousands of procedures are developed by using IDL. The typical use of IDL is the interactive mode but it is also possible to run IDL programs that do not require any interaction with the user, submitting them in batch or background modality. Through the interactive mode the user immediately receives images or other data produced in the running phase of the program; in batch or background mode, the user will have to wait for the end of the program, sometime for many hours or days to obtain images or data that IDL produced as output: in fact in Grid environment it is possible to access to or retrieve data only after completion of the program. The work that we present gives flexibility to IDL procedures submitted to the Grid computer infrastructure. For this purpose we have developed an IDL Grid Web Portal to allow the user to access the Grid and to submit IDL programs granting a full job control and the access to images and data generated during the running phase, without waiting for their completion. We have used the PHP technology and we have given the same level of security that Grid normally offers to its users. In this way, when the user notices that the intermediate program results are not those expected, he can stop the job, change the parameters to better satisfy the computational algorithm and resubmit the program, without consuming the CPU time and other Grid resources. The IDL Grid Web Portal allows you to obtain IDL generated images, graphics and data tables by using a normal browser. All conversations from the user and the Grid resources occur via Web, as well as authentication phases. The IDL user has not to change the program source much because the Portal will automatically introduce the appropriate modification before
Steger, Joseph L.
1989-01-01
Hyperbolic grid generation procedures are described which have been used in external flow simulations about complex configurations. For many practical applications a single well-ordered (i.e., structured) grid can be used to mesh an entire configuration, in other problems, composite or unstructured grid procedures are needed. Although the hyperbolic partial differential equation grid generation procedure has mainly been utilized to generate structured grids, an extension of the procedure to semiunstructured grids is briefly described. Extensions of the methodology are also described using two-dimensional equations.
Mia, Gredelj
2014-01-01
The conventional electrical system in place today sees our electrical devices powered by AC mains. But as renewable technologies such as solar photovoltaic and wind power become more prevalent at a household level, DC micro-grids could be a cheaper and more efficient alternative. New lighting devices (LED) can reduce the electricity consumption substantially. Two alternatives are envisioned in this paper: A stand-alone alternative in which there is no grid connection, that would require local...
Thermal Anemometry Grid Sensor
Martin Arlit; Eckhard Schleicher; Uwe Hampel
2017-01-01
A novel thermal anemometry grid sensor was developed for the simultaneous measurement of cross-sectional temperature and axial velocity distribution in a fluid flow. The sensor consists of a set of platinum resistors arranged in a regular grid. Each platinum resistor allows the simultaneous measurement of fluid temperature via electrical resistance and flow velocity via constant voltage thermal anemometry. Cross-sectional measurement was enabled by applying a special multiplexing-excitation s...
Directory of Open Access Journals (Sweden)
Georgiana MARIN Romanian
2011-09-01
Full Text Available This paper presents the grid computing technology, the recent developments in this field. The idea of grid computing has its origins in the early development of computer networks and technologies involved, given that CPU cycle use "free" or "unused" was seen as an optimal and cost-effective way to use all capabilities of the hardware resources which were very expensive machinery.
Near-Body Grid Adaption for Overset Grids
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.
Domain decomposition solvers for nonlinear multiharmonic finite element equations
Copeland, D. M.
2010-01-01
In many practical applications, for instance, in computational electromagnetics, the excitation is time-harmonic. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple elliptic equation for the amplitude. This is true for linear problems, but not for nonlinear problems. However, due to the periodicity of the solution, we can expand the solution in a Fourier series. Truncating this Fourier series and approximating the Fourier coefficients by finite elements, we arrive at a large-scale coupled nonlinear system for determining the finite element approximation to the Fourier coefficients. The construction of fast solvers for such systems is very crucial for the efficiency of this multiharmonic approach. In this paper we look at nonlinear, time-harmonic potential problems as simple model problems. We construct and analyze almost optimal solvers for the Jacobi systems arising from the Newton linearization of the large-scale coupled nonlinear system that one has to solve instead of performing the expensive time-integration procedure. © 2010 de Gruyter.
Using computer algebra and SMT solvers in algebraic biology
Pineda Osorio, Mateo
2014-05-01
Biologic processes are represented as Boolean networks, in a discrete time. The dynamics within these networks are approached with the help of SMT Solvers and the use of computer algebra. Software such as Maple and Z3 was used in this case. The number of stationary states for each network was calculated. The network studied here corresponds to the immune system under the effects of drastic mood changes. Mood is considered as a Boolean variable that affects the entire dynamics of the immune system, changing the Boolean satisfiability and the number of stationary states of the immune network. Results obtained show Z3's great potential as a SMT Solver. Some of these results were verified in Maple, even though it showed not to be as suitable for the problem approach. The solving code was constructed using Z3-Python and Z3-SMT-LiB. Results obtained are important in biology systems and are expected to help in the design of immune therapies. As a future line of research, more complex Boolean network representations of the immune system as well as the whole psychological apparatus are suggested.
Application of alternating decision trees in selecting sparse linear solvers
Bhowmick, Sanjukta
2010-01-01
The solution of sparse linear systems, a fundamental and resource-intensive task in scientific computing, can be approached through multiple algorithms. Using an algorithm well adapted to characteristics of the task can significantly enhance the performance, such as reducing the time required for the operation, without compromising the quality of the result. However, the best solution method can vary even across linear systems generated in course of the same PDE-based simulation, thereby making solver selection a very challenging problem. In this paper, we use a machine learning technique, Alternating Decision Trees (ADT), to select efficient solvers based on the properties of sparse linear systems and runtime-dependent features, such as the stages of simulation. We demonstrate the effectiveness of this method through empirical results over linear systems drawn from computational fluid dynamics and magnetohydrodynamics applications. The results also demonstrate that using ADT can resolve the problem of over-fitting, which occurs when limited amount of data is available. © 2010 Springer Science+Business Media LLC.
Smart-Grid Investments, Regulation and Organization
DEFF Research Database (Denmark)
Agrell, Per J.; Bogetoft, Peter
Worldwide, but in particular in North America and Europe, the grid infrastructure managers are facing demands for reinvestments in new assets with higher on-grid and off-grid functionality in order to promote energy efficiency and low-carbon conversion of the energy sector. To meet societal policy...... objectives in terms of carbon dioxide emissions, both the composition of the generators in favor of distributed energy resources (DER) and the load, promoting integration with downstream energy useage, will change. In this paper, we chararcterize some of the effects of new asset investments policy...... of task separation. To provide guidance, we present a model of investment provision under regulation between a distribution system operator (DSO) and a potential investor-generation. The results from the model confirm the hypothesis thatnetwork regulation should find a focal point, should integrate...
The two major Grid infrastructures
2005-01-01
This map shows the world's two major Grid infrastructures. The Open Science Grid (OSG) will handle data in the US, while Enabling Grids for E-sciencE (EGEE) will process data in Europe and the rest of the world. These Grids share processing power in order to process the huge amounts of information from experiments such as those at the LHC.
Smart Grid Integration Laboratory
Energy Technology Data Exchange (ETDEWEB)
Troxell, Wade [Colorado State Univ., Fort Collins, CO (United States)
2011-12-22
The initial federal funding for the Colorado State University Smart Grid Integration Laboratory is through a Congressionally Directed Project (CDP), DE-OE0000070 Smart Grid Integration Laboratory. The original program requested in three one-year increments for staff acquisition, curriculum development, and instrumentation all which will benefit the Laboratory. This report focuses on the initial phase of staff acquisition which was directed and administered by DOE NETL/ West Virginia under Project Officer Tom George. Using this CDP funding, we have developed the leadership and intellectual capacity for the SGIC. This was accomplished by investing (hiring) a core team of Smart Grid Systems engineering faculty focused on education, research, and innovation of a secure and smart grid infrastructure. The Smart Grid Integration Laboratory will be housed with the separately funded Integrid Laboratory as part of CSU's overall Smart Grid Integration Center (SGIC). The period of performance of this grant was 10/1/2009 to 9/30/2011 which included one no cost extension due to time delays in faculty hiring. The Smart Grid Integration Laboratory's focus is to build foundations to help graduate and undergraduates acquire systems engineering knowledge; conduct innovative research; and team externally with grid smart organizations. Using the results of the separately funded Smart Grid Workforce Education Workshop (May 2009) sponsored by the City of Fort Collins, Northern Colorado Clean Energy Cluster, Colorado State University Continuing Education, Spirae, and Siemens has been used to guide the hiring of faculty, program curriculum and education plan. This project develops faculty leaders with the intellectual capacity to inspire its students to become leaders that substantially contribute to the development and maintenance of Smart Grid infrastructure through topics such as: (1) Distributed energy systems modeling and control; (2) Energy and power conversion; (3
Influence of Grid Spacing in Poisson-Boltzmann Equation Binding Energy Estimation.
Harris, Robert C; Boschitsch, Alexander H; Fenley, Marcia O
2013-08-13
Grid-based solvers of the Poisson-Boltzmann, PB, equation are routinely used to estimate electrostatic binding, ΔΔGel, and solvation, ΔGel, free energies. The accuracies of such estimates are subject to grid discretization errors from the finite difference approximation to the PB equation. Here, we show that the grid discretization errors in ΔΔGel are more significant than those in ΔGel, and can be divided into two parts: (i) errors associated with the relative positioning of the grid and (ii) systematic errors associated with grid spacing. The systematic error in particular is significant for methods, such as the molecular mechanics PB surface area, MM-PBSA, approach that predict electrostatic binding free energies by averaging over an ensemble of molecular conformations. Although averaging over multiple conformations can control for the error associated with grid placement, it will not eliminate the systematic error, which can only be controlled by reducing grid spacing. The present study indicates that the widely-used grid spacing of 0.5 Å produces unacceptable errors in ΔΔGel, even though its predictions of ΔGel are adequate for the cases considered here. Although both grid discretization errors generally increase with grid spacing, the relative sizes of these errors differ according to the solute-solvent dielectric boundary definition. The grid discretization errors are generally smaller on the Gaussian surface used in the present study than on either the solvent-excluded or van der Waals surfaces, which both contain more surface discontinuities (e.g., sharp edges and cusps). Additionally, all three molecular surfaces converge to very different estimates of ΔΔGel.
SMART GRIDS LABORATORIES INVENTORY 2015
PONCELA BLANCO MARTA; PRETTICO GIUSEPPE; ANDREADOU NIKOLETA; OLARIAGA-GUARDIOLA Miguel; Fulli, Gianluca; COVRIG CATALIN-FELIX
2015-01-01
A smart electricity grid opens the door to a myriad of new applications aimed at enhancing security of supply, sustainability and market competitiveness. Gathering detailed information about smart grid laboratories activities represents a primary need. In order to obtain a better picture of the ongoing Smart Grid developments, after the successful smart grid project survey initiated in 2011, we recently launched a focused on-line survey addressed to organisations owning or running Smart Grid ...
SeGrid: A Secure Grid Framework for Sensor Networks
Directory of Open Access Journals (Sweden)
An Fengguang
2006-01-01
Full Text Available In this paper, we propose SeGrid, a secure framework for establishing grid keys in low duty cycle sensor networks, for which establishing a common key for each pair of neighboring sensors is unnecessary since most sensors remain in sleep mode at any instant of time. SeGrid intends to compute a shared key for two grids that may be multihop away. This design explores the fact that for most applications, closer grids have higher probability and desire for secure message exchange. SeGrid relies on the availability of a low-cost public cryptosystem. The query and update of the corresponding public shares are controlled by a novel management protocol such that the closer the two grids, the shorter the distance to obtain each other's public share. We instantiate SeGrid based on Blom's key establishment to illustrate the computation of a grid key.
Exact Riemann solver for RMHD in the case of shocks only
D.E.A. van Odyck (Daniel)
2005-01-01
textabstractIn this paper the quasi-1D relativistic magneto-hydrodynamic (RMHD) equations are numerically solved with a Lax-Friedrichs scheme. The RMHD shock relations are studied in detail. An ansatz is made to build an exact Riemann solver for RMHD. The results of the exact Riemann solver are
Energy Technology Data Exchange (ETDEWEB)
Thompson, S.
1987-08-01
Several popular ordinary differential equation (ode) solvers contain provisions for locating roots of functions which depend on the solution of the ode. A collection of problems for testing such solvers is described in this report. In addition to several well-known problems, the collection contains other interesting problems which have not previously appeared in the literature.
A tailored solver for bifurcation analysis of ocean-climate models
de Niet, A.C.; Wubs, F.W.; Terwisscha van Scheltinga, A.D.; Dijkstra, H.A.
2007-01-01
In this paper, we present a new linear system solver for use in a fully-implicit ocean model. The new solver allows to perform bifurcation analysis of relatively high-resolution primitive-equation ocean-climate models. It is based on a block-ILU approach and takes special advantage of the
Evaluation of linear solvers for oil reservoir simulation problems. Part 2: The fully implicit case
Energy Technology Data Exchange (ETDEWEB)
Joubert, W.; Janardhan, R.
1997-12-01
A previous paper [Joubert/Biswas 1997] contained investigations of linear solver performance for matrices arising from Amoco`s Falcon parallel oil reservoir simulation code using the IMPES formulation (implicit pressure, explicit saturation). In this companion paper, similar issues are explored for linear solvers applied to matrices arising from more difficult fully implicit problems. The results of numerical experiments are given.
Cognitive Structures of Good and Poor Novice Problem Solvers in Physics
de Jong, Anthonius J.M.; Ferguson-Hessler, Monica G.M.
1986-01-01
The way knowledge is organized in memory is generally expected to relate to the degree of success in problem solving. In the present study, we investigated whether good novice problem solvers have their knowledge arranged around problem types to a greater extent than poor problem solvers have. In
High-Performance Small-Scale Solvers for Moving Horizon Estimation
DEFF Research Database (Denmark)
Frison, Gianluca; Vukov, Milan; Poulsen, Niels Kjølstad
2015-01-01
implementation techniques focusing on small-scale problems. The proposed MHE solver is implemented using custom linear algebra routines and is compared against implementations using BLAS libraries. Additionally, the MHE solver is interfaced to a code generation tool for nonlinear model predictive control (NMPC...
DEFF Research Database (Denmark)
Hossain, Mokter
2018-01-01
The objective of this study is to identify motivations, challenges, and opportunities of successful solvers participating in virtual teams of innovation contests (ICs) organized by an innovation intermediary. Based on 82 interviews of successful solvers, this study provides novel insights into ICs...
Grid and Entrepreneurship Workshop
2006-01-01
The CERN openlab is organising a special workshop about Grid opportunities for entrepreneurship. This one-day event will provide an overview of what is involved in spin-off technology, with a special reference to the context of computing and data Grids. Lectures by experienced entrepreneurs will introduce the key concepts of entrepreneurship and review, in particular, the industrial potential of EGEE (the EU co-funded Enabling Grids for E-sciencE project, led by CERN). Case studies will be given by CEOs of European start-ups already active in the Grid and computing cluster area, and regional experts will provide an overview of efforts in several European regions to stimulate entrepreneurship. This workshop is designed to encourage students and researchers involved or interested in Grid technology to consider the entrepreneurial opportunities that this technology may create in the coming years. This workshop is organized as part of the CERN openlab student programme, which is co-sponsored by CERN, HP, ...
Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Vassilevski, Panayot S.; Villa, Umberto
2017-01-01
discretizations on general unstructured grids for a large class of nonlinear partial differential equations, including saddle point problems. The approximation properties of the coarse spaces ensure that our FAS approach for general unstructured meshes leads to optimal mesh-independent convergence rates similar...... in evaluating the nonlinear coarse operators and the degradation in convergence rates that characterized previous attempts to extend FAS to algebraic multilevel hierarchies on general unstructured grids. Specifically, the AMGe technique employed in this paper allows to derive stable and accurate coarse...
Energy Technology Data Exchange (ETDEWEB)
Cwik, T.; Jamnejad, V.; Zuffada, C. [California Institute of Technology, Pasadena, CA (United States)
1994-12-31
The usefulness of finite element modeling follows from the ability to accurately simulate the geometry and three-dimensional fields on the scale of a fraction of a wavelength. To make this modeling practical for engineering design, it is necessary to integrate the stages of geometry modeling and mesh generation, numerical solution of the fields-a stage heavily dependent on the efficient use of a sparse matrix equation solver, and display of field information. The stages of geometry modeling, mesh generation, and field display are commonly completed using commercially available software packages. Algorithms for the numerical solution of the fields need to be written for the specific class of problems considered. Interior problems, i.e. simulating fields in waveguides and cavities, have been successfully solved using finite element methods. Exterior problems, i.e. simulating fields scattered or radiated from structures, are more difficult to model because of the need to numerically truncate the finite element mesh. To practically compute a solution to exterior problems, the domain must be truncated at some finite surface where the Sommerfeld radiation condition is enforced, either approximately or exactly. Approximate methods attempt to truncate the mesh using only local field information at each grid point, whereas exact methods are global, needing information from the entire mesh boundary. In this work, a method that couples three-dimensional finite element (FE) solutions interior to the bounding surface, with an efficient integral equation (IE) solution that exactly enforces the Sommerfeld radiation condition is developed. The bounding surface is taken to be a surface of revolution (SOR) to greatly reduce computational expense in the IE portion of the modeling.
Yuan, H. Z.; Wang, Y.; Shu, C.
2017-12-01
This paper presents an adaptive mesh refinement-multiphase lattice Boltzmann flux solver (AMR-MLBFS) for effective simulation of complex binary fluid flows at large density ratios. In this method, an AMR algorithm is proposed by introducing a simple indicator on the root block for grid refinement and two possible statuses for each block. Unlike available block-structured AMR methods, which refine their mesh by spawning or removing four child blocks simultaneously, the present method is able to refine its mesh locally by spawning or removing one to four child blocks independently when the refinement indicator is triggered. As a result, the AMR mesh used in this work can be more focused on the flow region near the phase interface and its size is further reduced. In each block of mesh, the recently proposed MLBFS is applied for the solution of the flow field and the level-set method is used for capturing the fluid interface. As compared with existing AMR-lattice Boltzmann models, the present method avoids both spatial and temporal interpolations of density distribution functions so that converged solutions on different AMR meshes and uniform grids can be obtained. The proposed method has been successfully validated by simulating a static bubble immersed in another fluid, a falling droplet, instabilities of two-layered fluids, a bubble rising in a box, and a droplet splashing on a thin film with large density ratios and high Reynolds numbers. Good agreement with the theoretical solution, the uniform-grid result, and/or the published data has been achieved. Numerical results also show its effectiveness in saving computational time and virtual memory as compared with computations on uniform meshes.
A massively parallel solver for discrete Poisson-like problems
Notay, Yvan; Napov, Artem
2015-01-01
The paper considers the parallel implementation of an algebraic multigrid method. The sequential version is well suited to solve linear systems arising from the discretization of scalar elliptic PDEs. It is scalable in the sense that the time needed to solve a system is (under known conditions) proportional to the number of unknowns. The associate software code is also robust and often significantly faster than other algebraic multigrid solvers. The present work addresses the challenge of porting it on massively parallel computers. In this view, some critical components are redesigned, in a relatively simple yet not straightforward way. Thanks to this, excellent weak scalability results are obtained on three petascale machines among the most powerful today available.
A General Symbolic PDE Solver Generator: Beyond Explicit Schemes
Directory of Open Access Journals (Sweden)
K. Sheshadri
2003-01-01
Full Text Available This paper presents an extension of our Mathematica- and MathCode-based symbolic-numeric framework for solving a variety of partial differential equation (PDE problems. The main features of our earlier work, which implemented explicit finite-difference schemes, include the ability to handle (1 arbitrary number of dependent variables, (2 arbitrary dimensionality, and (3 arbitrary geometry, as well as (4 developing finite-difference schemes to any desired order of approximation. In the present paper, extensions of this framework to implicit schemes and the method of lines are discussed. While C++ code is generated, using the MathCode system for the implicit method, Modelica code is generated for the method of lines. The latter provides a preliminary PDE support for the Modelica language. Examples illustrating the various aspects of the solver generator are presented.
SolveDB: Integrating Optimization Problem Solvers Into SQL Databases
DEFF Research Database (Denmark)
Siksnys, Laurynas; Pedersen, Torben Bach
2016-01-01
Many real-world decision problems involve solving optimization problems based on data in an SQL database. Traditionally, solving such problems requires combining a DBMS with optimization software packages for each required class of problems (e.g. linear and constraint programming) -- leading...... to workflows that are cumbersome, complex, inefficient, and error-prone. In this paper, we present SolveDB - a DBMS for optimization applications. SolveDB supports solvers for different problem classes and offers seamless data management and optimization problem solving in a pure SQL-based setting. This allows...... for much simpler and more effective solutions of database-based optimization problems. SolveDB is based on the 3-level ANSI/SPARC architecture and allows formulating, solving, and analysing solutions of optimization problems using a single so-called solve query. SolveDB provides (1) an SQL-based syntax...
GPU accelerated FDTD solver and its application in MRI.
Chi, J; Liu, F; Jin, J; Mason, D G; Crozier, S
2010-01-01
The finite difference time domain (FDTD) method is a popular technique for computational electromagnetics (CEM). The large computational power often required, however, has been a limiting factor for its applications. In this paper, we will present a graphics processing unit (GPU)-based parallel FDTD solver and its successful application to the investigation of a novel B1 shimming scheme for high-field magnetic resonance imaging (MRI). The optimized shimming scheme exhibits considerably improved transmit B(1) profiles. The GPU implementation dramatically shortened the runtime of FDTD simulation of electromagnetic field compared with its CPU counterpart. The acceleration in runtime has made such investigation possible, and will pave the way for other studies of large-scale computational electromagnetic problems in modern MRI which were previously impractical.
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Ibeid, Huda
2014-05-04
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
A high order solver for the unbounded Poisson equation
DEFF Research Database (Denmark)
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2013-01-01
. The method is extended to directly solve the derivatives of the solution to Poissonʼs equation. In this way differential operators such as the divergence or curl of the solution field can be solved to the same high order convergence without additional computational effort. The method, is applied...... and validated, however not restricted, to the equations of fluid mechanics, and can be used in many applications to solve Poissonʼs equation on a rectangular unbounded domain.......A high order converging Poisson solver is presented, based on the Greenʼs function solution to Poissonʼs equation subject to free-space boundary conditions. The high order convergence is achieved by formulating regularised integration kernels, analogous to a smoothing of the solution field...
Periodic Density Functional Theory Solver using Multiresolution Analysis with MADNESS
Harrison, Robert; Thornton, William
2011-03-01
We describe the first implementation of the all-electron Kohn-Sham density functional periodic solver (DFT) using multi-wavelets and fast integral equations using MADNESS (multiresolution adaptive numerical environment for scientific simulation; http://code.google.com/p/m-a-d-n-e-s-s). The multiresolution nature of a multi-wavelet basis allows for fast computation with guaranteed precision. By reformulating the Kohn-Sham eigenvalue equation into the Lippmann-Schwinger equation, we can avoid using the derivative operator which allows better control of overall precision for the all-electron problem. Other highlights include the development of periodic integral operators with low-rank separation, an adaptable model potential for nuclear potential, and an implementation for Hartree Fock exchange. This work was supported by NSF project OCI-0904972 and made use of resources at the Center for Computational Sciences at Oak Ridge National Laboratory under contract DE-AC05-00OR22725.
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan
2010-10-05
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Roe solver with entropy corrector for uncertain hyperbolic systems
Energy Technology Data Exchange (ETDEWEB)
Tryoen, J.; Ern, A. [Univ Paris Est, CERMICS, Ecole Ponts, F-77455 Marne La Vallee 2 (France); Tryoen, J.; Le Maitre, O. [CNRS, LIMSI, F-91403 Orsay (France); Ndjinga, M. [CEA Saclay, DEN, DM2S, SFME, F-91191 Gif Sur Yvette (France)
2010-07-01
This paper deals with intrusive Galerkin projection methods with a Roe-type solver for treating uncertain hyperbolic systems using a finite volume discretization in physical space and a piecewise continuous representation at the stochastic level. The aim of this paper is to design a cost-effective adaptation of the deterministic Dubois and Mehlman corrector to avoid entropy-violating shocks in the presence of sonic points. The adaptation relies on an estimate of the eigenvalues and eigenvectors of the Galerkin Jacobian matrix of the deterministic system of the stochastic modes of the solution and on a correspondence between these approximate eigenvalues and eigenvectors for the intermediate states considered at the interface. We derive some indicators that can be used to decide where a correction is needed, thereby reducing the computational costs considerably. The effectiveness of the proposed corrector is assessed on the Burgers and Euler equations including sonic points. (authors)
Visualising magnetic fields numerical equation solvers in action
Beeteson, John Stuart
2001-01-01
Visualizing Magnetic Fields: Numerical Equation Solvers in Action provides a complete description of the theory behind a new technique, a detailed discussion of the ways of solving the equations (including a software visualization of the solution algorithms), the application software itself, and the full source code. Most importantly, there is a succinct, easy-to-follow description of each procedure in the code.The physicist Michael Faraday said that the study of magnetic lines of force was greatly influential in leading him to formulate many of those concepts that are now so fundamental to our modern world, proving to him their "great utility as well as fertility." Michael Faraday could only visualize these lines in his mind's eye and, even with modern computers to help us, it has been very expensive and time consuming to plot lines of force in magnetic fields
A High-Order Direct Solver for Helmholtz Equations with Neumann Boundary Conditions
Sun, Xian-He; Zhuang, Yu
1997-01-01
In this study, a compact finite-difference discretization is first developed for Helmholtz equations on rectangular domains. Special treatments are then introduced for Neumann and Neumann-Dirichlet boundary conditions to achieve accuracy and separability. Finally, a Fast Fourier Transform (FFT) based technique is used to yield a fast direct solver. Analytical and experimental results show this newly proposed solver is comparable to the conventional second-order elliptic solver when accuracy is not a primary concern, and is significantly faster than that of the conventional solver if a highly accurate solution is required. In addition, this newly proposed fourth order Helmholtz solver is parallel in nature. It is readily available for parallel and distributed computers. The compact scheme introduced in this study is likely extendible for sixth-order accurate algorithms and for more general elliptic equations.
Li, Lingxiao; Zheng, Weiying
2017-12-01
In this paper, we propose a Newton-Krylov solver and a Picard-Krylov solver for finite element discrete problem of stationary incompressible magnetohydrodynamic equations in three dimensions. Using a mixed finite element method, we discretize the velocity and the pressure by H1 (Ω)-conforming finite elements and discretize the magnetic field by H (curl , Ω)-conforming edge elements. An efficient preconditioner is proposed to accelerate the convergence of GMRES method for solving linearized discrete problems. By extensive numerical experiments, we demonstrate the robustness of the Newton-Krylov solver for relatively large physical parameters and the optimality with respect to the number of degrees of freedom. Moreover, the numerical experiments show that the Newton-Krylov solver is more robust than the Picard-Krylov solver for large Reynolds number.
Accuracy and Efficiency in Fixed-Point Neural ODE Solvers.
Hopkins, Michael; Furber, Steve
2015-10-01
Simulation of neural behavior on digital architectures often requires the solution of ordinary differential equations (ODEs) at each step of the simulation. For some neural models, this is a significant computational burden, so efficiency is important. Accuracy is also relevant because solutions can be sensitive to model parameterization and time step. These issues are emphasized on fixed-point processors like the ARM unit used in the SpiNNaker architecture. Using the Izhikevich neural model as an example, we explore some solution methods, showing how specific techniques can be used to find balanced solutions. We have investigated a number of important and related issues, such as introducing explicit solver reduction (ESR) for merging an explicit ODE solver and autonomous ODE into one algebraic formula, with benefits for both accuracy and speed; a simple, efficient mechanism for cancelling the cumulative lag in state variables caused by threshold crossing between time steps; an exact result for the membrane potential of the Izhikevich model with the other state variable held fixed. Parametric variations of the Izhikevich neuron show both similarities and differences in terms of algorithms and arithmetic types that perform well, making an overall best solution challenging to identify, but we show that particular cases can be improved significantly using the techniques described. Using a 1 ms simulation time step and 32-bit fixed-point arithmetic to promote real-time performance, one of the second-order Runge-Kutta methods looks to be the best compromise; Midpoint for speed or Trapezoid for accuracy. SpiNNaker offers an unusual combination of low energy use and real-time performance, so some compromises on accuracy might be expected. However, with a careful choice of approach, results comparable to those of general-purpose systems should be possible in many realistic cases.
DEFF Research Database (Denmark)
Dondossola, Giovanna; Terruggia, Roberta; Bessler, Sandford
2014-01-01
grids requiring the development of new Information and Communication Technology (ICT) solutions with various degrees of adaptation of the monitoring, communication and control technologies. The costs of ICT based solutions need however to be taken into account, hence it is desirable to work...... with existing communication networks. The objective of the European FP7 project SmartC2Net in this regard is to enable robust smart grid control utilizing heterogeneous third party communication infrastructures.......The scope of this paper is to address the evolution of distribution grid architectures following the widespread introduction of renewable energy sources. The increasing connection of distributed resources has a strong impact on the topology and the control functionality of the current distribution...
Performance engineering in data Grids
Laure, Erwin; Stockinger, Kurt
2005-01-01
The vision of Grid computing is to facilitate worldwide resource sharing among distributed collaborations. With the help of numerous national and international Grid projects, this vision is becoming reality and Grid systems are attracting an ever increasing user base. However, Grids are still quite complex software systems whose efficient use is a difficult and error-prone task. In this paper we present performance engineering techniques that aim to facilitate an efficient use of Grid systems, in particular systems that deal with the management of large-scale data sets in the tera- and petabyte range (also referred to as data Grids). These techniques are applicable at different layers of a Grid architecture and we discuss the tools required at each of these layers to implement them. Having discussed important performance engineering techniques, we investigate how major Grid projects deal with performance issues particularly related to data Grids and how they implement the techniques presented.
Thermal Anemometry Grid Sensor
Directory of Open Access Journals (Sweden)
Martin Arlit
2017-07-01
Full Text Available A novel thermal anemometry grid sensor was developed for the simultaneous measurement of cross-sectional temperature and axial velocity distribution in a fluid flow. The sensor consists of a set of platinum resistors arranged in a regular grid. Each platinum resistor allows the simultaneous measurement of fluid temperature via electrical resistance and flow velocity via constant voltage thermal anemometry. Cross-sectional measurement was enabled by applying a special multiplexing-excitation scheme. In this paper, we present the design and characterization of a prototypical sensor for measurements in a range of very low velocities.
Distributed photovoltaic grid transformers
Shertukde, Hemchandra Madhusudan
2014-01-01
The demand for alternative energy sources fuels the need for electric power and controls engineers to possess a practical understanding of transformers suitable for solar energy. Meeting that need, Distributed Photovoltaic Grid Transformers begins by explaining the basic theory behind transformers in the solar power arena, and then progresses to describe the development, manufacture, and sale of distributed photovoltaic (PV) grid transformers, which help boost the electric DC voltage (generally at 30 volts) harnessed by a PV panel to a higher level (generally at 115 volts or higher) once it is
Manricks, Gabriel
2013-01-01
Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. A step-by-step, practical Starter book, Instant jqGrid embraces you while you take your first steps, and introduces you to the content in an easy-to-follow order.This book is aimed at people who have some knowledge of HTML and JavaScript. Knowledge of PHP and SQL would also prove to be beneficial. No prior knowledge of jqGrid is expected.
McCarthy, Clive; Cooper, Graham; Field, James; Thayne, Martyn; Vickers, Richard
2014-01-01
From 16th – 19th October 2014, co_LAB presented its newest creation, Grid Zone Drone, at Kinetica – an international exhibition providing a global platform for galleries, curatorial groups, design studios and artists working with new media art. 2014 marked the third consecutive year that the University of Lincoln has been represented at the global art fair. Grid Zone Drone represents a continuation of the group’s research into ‘drone culture’, and explores the detachment of the drone withi...
Thermal Anemometry Grid Sensor.
Arlit, Martin; Schleicher, Eckhard; Hampel, Uwe
2017-07-19
A novel thermal anemometry grid sensor was developed for the simultaneous measurement of cross-sectional temperature and axial velocity distribution in a fluid flow. The sensor consists of a set of platinum resistors arranged in a regular grid. Each platinum resistor allows the simultaneous measurement of fluid temperature via electrical resistance and flow velocity via constant voltage thermal anemometry. Cross-sectional measurement was enabled by applying a special multiplexing-excitation scheme. In this paper, we present the design and characterization of a prototypical sensor for measurements in a range of very low velocities.
A Novel FPGA-Based Real-Time Simulator for Micro-Grids
Directory of Open Access Journals (Sweden)
Bingda Zhang
2017-08-01
Full Text Available To meet the requirements of micro-grid real-time simulation, a novel real-time simulator for micro-grids based on Field-Programmable Gate Array (FPGA and orders (FO-RTDS is designed. We describe the design idea of the real-time solver and the order generator. Multi-valued parameter prestorage and multi-rate simulation are introduced to reduce the computational pressure. The data scheduling is carried out following the principle of saving the resources and the minimizing the average distance between variables. An example is performed on XC7VX690T-2FFG1761 chip, which proves the novel FO-RTDS method greatly improves the scale of real-time simulation of micro-grids.
Performance of a Heterogeneous Grid Partitioner for N-body Applications
Harvey, Daniel J.; Das, Sajal K.; Biswas, Rupak
2003-01-01
An important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied together in a transparent virtual environment to solve large-scale computational problems. However, many of these applications require effective runtime load balancing for the resulting solutions to be viable. Recently, we developed a latency tolerant partitioner, called MinEX, specifically for use in distributed grid environments. This paper compares the performance of MinEX to that of METIS, a popular multilevel family of partitioners, using simulated heterogeneous grid configurations. A solver for the classical N-body problem is implemented to provide a framework for the comparisons. Experimental results show that MinEX provides superior quality partitions while being competitive to METIS in speed of execution.
Essential Grid Workflow Monitoring Elements
Energy Technology Data Exchange (ETDEWEB)
Gunter, Daniel K.; Jackson, Keith R.; Konerding, David E.; Lee,Jason R.; Tierney, Brian L.
2005-07-01
Troubleshooting Grid workflows is difficult. A typicalworkflow involves a large number of components networks, middleware,hosts, etc. that can fail. Even when monitoring data from all thesecomponents is accessible, it is hard to tell whether failures andanomalies in these components are related toa given workflow. For theGrid to be truly usable, much of this uncertainty must be elim- inated.We propose two new Grid monitoring elements, Grid workflow identifiersand consistent component lifecycle events, that will make Gridtroubleshooting easier, and thus make Grids more usable, by simplifyingthe correlation of Grid monitoring data with a particular Gridworkflow.
Enabling Campus Grids with Open Science Grid Technology
Weitzel, Derek; Bockelman, Brian; Fraser, Dan; Pordes, Ruth; Swanson, David
2011-12-01
The Open Science Grid is a recognized key component of the US national cyber-infrastructure enabling scientific discovery through advanced high throughput computing. The principles and techniques that underlie the Open Science Grid can also be applied to Campus Grids since many of the requirements are the same, even if the implementation technologies differ. We find five requirements for a campus grid: trust relationships, job submission, resource independence, accounting, and data management. The Holland Computing Center's campus grid at the University of Nebraska-Lincoln was designed to fulfill the requirements of a campus grid. A bridging daemon was designed to bring non-Condor clusters into a grid managed by Condor. Condor features which make it possible to bridge Condor sites into a multi-campus grid have been exploited at the Holland Computing Center as well.
Changing from computing grid to knowledge grid in life-science grid.
Talukdar, Veera; Konar, Amit; Datta, Ayan; Choudhury, Anamika Roy
2009-09-01
Grid computing has a great potential to become a standard cyber infrastructure for life sciences that often require high-performance computing and large data handling, which exceeds the computing capacity of a single institution. Grid computer applies the resources of many computers in a network to a single problem at the same time. It is useful to scientific problems that require a great number of computer processing cycles or access to a large amount of data.As biologists,we are constantly discovering millions of genes and genome features, which are assembled in a library and distributed on computers around the world.This means that new, innovative methods must be developed that exploit the re-sources available for extensive calculations - for example grid computing.This survey reviews the latest grid technologies from the viewpoints of computing grid, data grid and knowledge grid. Computing grid technologies have been matured enough to solve high-throughput real-world life scientific problems. Data grid technologies are strong candidates for realizing a "resourceome" for bioinformatics. Knowledge grids should be designed not only from sharing explicit knowledge on computers but also from community formulation for sharing tacit knowledge among a community. By extending the concept of grid from computing grid to knowledge grid, it is possible to make use of a grid as not only sharable computing resources, but also as time and place in which people work together, create knowledge, and share knowledge and experiences in a community.
Grid computing the European Data Grid Project
Segal, B; Gagliardi, F; Carminati, F
2000-01-01
The goal of this project is the development of a novel environment to support globally distributed scientific exploration involving multi- PetaByte datasets. The project will devise and develop middleware solutions and testbeds capable of scaling to handle many PetaBytes of distributed data, tens of thousands of resources (processors, disks, etc.), and thousands of simultaneous users. The scale of the problem and the distribution of the resources and user community preclude straightforward replication of the data at different sites, while the aim of providing a general purpose application environment precludes distributing the data using static policies. We will construct this environment by combining and extending newly emerging "Grid" technologies to manage large distributed datasets in addition to computational elements. A consequence of this project will be the emergence of fundamental new modes of scientific exploration, as access to fundamental scientific data is no longer constrained to the producer of...
MAGNETOHYDRODYNAMIC MODELING OF SOLAR SYSTEM PROCESSES ON GEODESIC GRIDS
Energy Technology Data Exchange (ETDEWEB)
Florinski, V. [Department of Physics, University of Alabama, Huntsville, AL 35899 (United States); Guo, X. [Center for Space Plasma and Aeronomic Research, University of Alabama, Huntsville, AL 35899 (United States); Balsara, D. S.; Meyer, C. [Department of Physics, University of Notre Dame, Notre Dame, IN 46556 (United States)
2013-04-01
This report describes a new magnetohydrodynamic numerical model based on a hexagonal spherical geodesic grid. The model is designed to simulate astrophysical flows of partially ionized plasmas around a central compact object, such as a star or a planet with a magnetic field. The geodesic grid, produced by a recursive subdivision of a base platonic solid (an icosahedron), is free from control volume singularities inherent in spherical polar grids. Multiple populations of plasma and neutral particles, coupled via charge-exchange interactions, can be simulated simultaneously with this model. Our numerical scheme uses piecewise linear reconstruction on a surface of a sphere in a local two-dimensional 'Cartesian' frame. The code employs Haarten-Lax-van-Leer-type approximate Riemann solvers and includes facilities to control the divergence of the magnetic field and maintain pressure positivity. Several test solutions are discussed, including a problem of an interaction between the solar wind and the local interstellar medium, and a simulation of Earth's magnetosphere.
Heterogeneous Computing on Mixed Unstructured Grids with PyFR
Witherden, F D; Vincent, P E
2014-01-01
PyFR is an open-source high-order accurate computational fluid dynamics solver for mixed unstructured grids that can target a range of hardware platforms from a single codebase. In this paper we demonstrate the ability of PyFR to perform high-order accurate unsteady simulations of flow on mixed unstructured grids using heterogeneous multi-node hardware. Specifically, after benchmarking single-node performance for various platforms, PyFR v0.2.2 is used to undertake simulations of unsteady flow over a circular cylinder at Reynolds number 3 900 using a mixed unstructured grid of prismatic and tetrahedral elements on a desktop workstation containing an Intel Xeon E5-2697 v2 CPU, an NVIDIA Tesla K40c GPU, and an AMD FirePro W9100 GPU. Both the performance and accuracy of PyFR are assessed. PyFR v0.2.2 is freely available under a 3-Clause New Style BSD license (see www.pyfr.org).
Energy Technology Data Exchange (ETDEWEB)
Rokach, Joshua Z.
2010-10-15
The country has progressed in a relatively short time from rotary dial phones to computers, cell phones, and iPads. With proper planning and orderly policy implementation, the same will happen with the Smart Grid. Here are some suggestions on how to proceed. (author)
Autonomous Energy Grids: Preprint
Energy Technology Data Exchange (ETDEWEB)
Kroposki, Benjamin D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Bernstein, Andrey [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhang, Yingchen [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Hodge, Brian S [National Renewable Energy Laboratory (NREL), Golden, CO (United States)
2017-10-04
With much higher levels of distributed energy resources - variable generation, energy storage, and controllable loads just to mention a few - being deployed into power systems, the data deluge from pervasive metering of energy grids, and the shaping of multi-level ancillary-service markets, current frameworks to monitoring, controlling, and optimizing large-scale energy systems are becoming increasingly inadequate. This position paper outlines the concept of 'Autonomous Energy Grids' (AEGs) - systems that are supported by a scalable, reconfigurable, and self-organizing information and control infrastructure, can be extremely secure and resilient (self-healing), and self-optimize themselves in real-time for economic and reliable performance while systematically integrating energy in all forms. AEGs rely on scalable, self-configuring cellular building blocks that ensure that each 'cell' can self-optimize when isolated from a larger grid as well as partaking in the optimal operation of a larger grid when interconnected. To realize this vision, this paper describes the concepts and key research directions in the broad domains of optimization theory, control theory, big-data analytics, and complex system modeling that will be necessary to realize the AEG vision.
2007-01-01
I want to come back and work here when I'm older,' was the spontaneous reaction of one of the children invited to CERN by the Enabling Grids for E-sciencE project for a 'Grids for Kids' day at the end of January. The EGEE project is led by CERN, and the EGEE gender action team organized the day to introduce children to grid technology at an early age. The school group included both boys and girls, aged 9 to 11. All of the presenters were women. 'In general, before this visit, the children thought that scientists always wore white coats and were usually male, with wild Einstein-like hair,' said Jackie Beaver, the class's teacher at the Institut International de Lancy, a school near Geneva. 'They were surprised and pleased to see that women became scientists, and that scientists were quite 'normal'.' The half-day event included presentations about why Grids are needed, a visit of the computer centre, some online games, and plenty of time for questions. In the end, everyone agreed that it was a big success a...
National Oceanic and Atmospheric Administration, Department of Commerce — A 2 kilometer Bouguer anomaly grid for the state of Ohio. Number of columns is 187 and number of rows is 217. The order of the data is from the lower left to the...
National Oceanic and Atmospheric Administration, Department of Commerce — A 2.5 kilometer Bouguer anomaly grid for the state of Utah. Number of columns is 196 and number of rows is 245. The order of the data is from the lower left to the...
2006-01-01
During April, a collaboration of Asian and European laboratories analysed 300,000 possible drug components against the avian flu virus H5N1 using the EGEE Grid infrastructure. Schematic presentation of the avian flu virus.The distribution of the EGEE sites in the world on which the avian flu scan was performed. The goal was to find potential compounds that can inhibit the activities of an enzyme on the surface of the influenza virus, the so-called neuraminidase, subtype N1. Using the Grid to identify the most promising leads for biological tests could speed up the development process for drugs against the influenza virus. Co-ordinated by CERN and funded by the European Commission, the EGEE project (Enabling Grids for E-sciencE) aims to set up a worldwide grid infrastructure for science. The challenge of the in silico drug discovery application is to identify those molecules which can dock on the active sites of the virus in order to inhibit its action. To study the impact of small scale mutations on drug r...
National Oceanic and Atmospheric Administration, Department of Commerce — A 2 kilometer Bouguer anomaly grid for the state of Maine. Number of columns is 197 and number of rows is 292. The order of the data is from the lower left to the...
National Oceanic and Atmospheric Administration, Department of Commerce — A 1 kilometer Bouguer anomaly grid for the country of Bolivia.Number of columns is 550 and number of rows is 900. The order of the data is from the lower left to the...
National Research Council Canada - National Science Library
Michl, Josef; Magnera, Thomas
2008-01-01
...) porphyrin triply linked in the meso-meso, and both beta-beta positions four times by carbon-carbon bonds to each of its neighbors to form porphite sheets a grid-type material that would be an analog of graphene...
DEFF Research Database (Denmark)
Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming
In this document, we consider a specific Chinese Smart Grid implementation and try to address the verification problem for certain quantitative properties including performance and battery consumption. We employ stochastic model checking approach and present our modelling and analysis study using...
Energy Technology Data Exchange (ETDEWEB)
Rabari, Anil [NSTAR Electric, Manchester, NH (United States); Fadipe, Oloruntomi [NSTAR Electric, Manchester, NH (United States)
2014-03-31
NSTAR Electric & Gas Corporation (“the Company”, or “NSTAR”) developed and implemented a Smart Grid pilot program beginning in 2010 to demonstrate the viability of leveraging existing automated meter reading (“AMR”) deployments to provide much of the Smart Grid functionality of advanced metering infrastructure (“AMI”), but without the large capital investment that AMI rollouts typically entail. In particular, a central objective of the Smart Energy Pilot was to enable residential dynamic pricing (time-of-use “TOU” and critical peak rates and rebates) and two-way direct load control (“DLC”) by continually capturing AMR meter data transmissions and communicating through customer-sited broadband connections in conjunction with a standardsbased home area network (“HAN”). The pilot was supported by the U.S. Department of Energy’s (“DOE”) through the Smart Grid Demonstration program. NSTAR was very pleased to not only receive the funding support from DOE, but the guidance and support of the DOE throughout the pilot. NSTAR is also pleased to report to the DOE that it was able to execute and deliver a successful pilot on time and on budget. NSTAR looks for future opportunities to work with the DOE and others in future smart grid projects.
National Oceanic and Atmospheric Administration, Department of Commerce — A 2 kilometer Isostatic anomaly grid for the state of Nevada. Number of columns is 269 and number of rows is 394. The order of the data is from the lower left to the...
A Two-dimensional HLLC Riemann Solver for Conservation Laws : Application to Euler and MHD Flows
Balsara, Dinshaw S
2011-01-01
In this paper we present a genuinely two-dimensional HLLC Riemann solver. On logically rectangular meshes, it accepts four input states that come together at an edge and outputs the multi-dimensionally upwinded fluxes in both directions. This work builds on, and improves, our prior work on two-dimensional HLL Riemann solvers. The HLL Riemann solver presented here achieves its stabilization by introducing a constant state in the region of strong interaction, where four one-dimensional Riemann problems interact vigorously with one another. A robust version of the HLL Riemann solver is presented here along with a strategy for introducing sub-structure in the strongly-interacting state. Introducing sub-structure turns the two-dimensional HLL Riemann solver into a two-dimensional HLLC Riemann solver. The sub-structure that we introduce represents a contact discontinuity which can be oriented in any direction relative to the mesh. The Riemann solver presented here is general and can work with any system of conserva...
Acceleration of FDTD mode solver by high-performance computing techniques.
Han, Lin; Xi, Yanping; Huang, Wei-Ping
2010-06-21
A two-dimensional (2D) compact finite-difference time-domain (FDTD) mode solver is developed based on wave equation formalism in combination with the matrix pencil method (MPM). The method is validated for calculation of both real guided and complex leaky modes of typical optical waveguides against the bench-mark finite-difference (FD) eigen mode solver. By taking advantage of the inherent parallel nature of the FDTD algorithm, the mode solver is implemented on graphics processing units (GPUs) using the compute unified device architecture (CUDA). It is demonstrated that the high-performance computing technique leads to significant acceleration of the FDTD mode solver with more than 30 times improvement in computational efficiency in comparison with the conventional FDTD mode solver running on CPU of a standard desktop computer. The computational efficiency of the accelerated FDTD method is in the same order of magnitude of the standard finite-difference eigen mode solver and yet require much less memory (e.g., less than 10%). Therefore, the new method may serve as an efficient, accurate and robust tool for mode calculation of optical waveguides even when the conventional eigen value mode solvers are no longer applicable due to memory limitation.
The impact of improved sparse linear solvers on industrial engineering applications
Energy Technology Data Exchange (ETDEWEB)
Heroux, M. [Cray Research, Inc., Eagan, MN (United States); Baddourah, M.; Poole, E.L.; Yang, Chao Wu
1996-12-31
There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.
Grid interoperability the interoperations cookbook
Field, L
2008-01-01
Over recent years a number of grid projects have emerged which have built grid infrastructures that are now the computing backbones for various user communities. A significant number of these communities are limited to one grid infrastructure due to the different middleware and procedures used in each grid. Grid interoperation is trying to bridge these differences and enable virtual organizations to access resources independent of the grid project affiliation. This paper gives an overview of grid interoperation and describes the current methods used to bridge the differences between grids. Actual use cases encountered during the last three years are discussed and the most important interfaces required for interoperability are highlighted. A summary of the standardisation efforts in these areas is given and we argue for moving more aggressively towards standards.
Allegheny County Map Index Grid
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Map Index Sheets from Block and Lot Grid of Property Assessment and based on aerial photography, showing 1983 datum with solid line and NAD 27 with 5 second grid...
Current Collecting Grids for ITO-Free Solar Cells
DEFF Research Database (Denmark)
Galagan, Yulia; Zimmermann, Birger; Coenen, Erica W. C.
2012-01-01
Indium-tin-oxide (ITO) free polymer solar cells prepared by ink jet printing a composite front electrode comprising silver grid lines and a semitransparent PEDOT:PSS conductor are demonstrated. The effect of grid line density is explored for a large series of devices and a careful modeling study...... enabling the identification of the most rational grid structure is presented. Both optical and light beam induced current (LBIC) mapping of the devices are used to support the power loss model and to follow the evolution of the performance over time. Current generation is found to be evenly distributed...
A parallel direct solver for the self-adaptive hp Finite Element Method
Paszyński, Maciej R.
2010-03-01
In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.
George, David L.
2008-03-01
We present a class of augmented approximate Riemann solvers for the shallow water equations in the presence of a variable bottom surface. These belong to the class of simple approximate solvers that use a set of propagating jump discontinuities, or waves, to approximate the true Riemann solution. Typically, a simple solver for a system of m conservation laws uses m such discontinuities. We present a four wave solver for use with the the shallow water equations—a system of two equations in one dimension. The solver is based on a decomposition of an augmented solution vector—the depth, momentum as well as momentum flux and bottom surface. By decomposing these four variables into four waves the solver is endowed with several desirable properties simultaneously. This solver is well-balanced: it maintains a large class of steady states by the use of a properly defined steady state wave—a stationary jump discontinuity in the Riemann solution that acts as a source term. The form of this wave is introduced and described in detail. The solver also maintains depth non-negativity and extends naturally to Riemann problems with an initial dry state. These are important properties for applications with steady states and inundation, such as tsunami and flood modeling. Implementing the solver with LeVeque's wave propagation algorithm [R.J. LeVeque, Wave propagation algorithms for multi-dimensional hyperbolic systems, J. Comput. Phys. 131 (1997) 327-335] is also described. Several numerical simulations are shown, including a test problem for tsunami modeling.
Communication technologies in smart grid
Directory of Open Access Journals (Sweden)
Miladinović Nikola
2013-01-01
Full Text Available The role of communication technologies in Smart Grid lies in integration of large number of devices into one telecommunication system. This paper provides an overview of the technologies currently in use in electric power grid, that are not necessarily in compliance with the Smart Grid concept. Considering that the Smart Grid is open to the flow of information in all directions, it is necessary to provide reliability, protection and security of information.
Communication technologies in smart grid
Miladinović Nikola; Polužanski Vladimir; Milosavljević Srđan
2013-01-01
The role of communication technologies in Smart Grid lies in integration of large number of devices into one telecommunication system. This paper provides an overview of the technologies currently in use in electric power grid, that are not necessarily in compliance with the Smart Grid concept. Considering that the Smart Grid is open to the flow of information in all directions, it is necessary to provide reliability, protection and security of information.
DEFF Research Database (Denmark)
Ramos, Juan David Hincapie; Tabard, Aurélien; Bardram, Jakob
2010-01-01
the research taking place in the biology laboratory. This should promote contribu-tions to the grid, and thereby mediate the appropriation of the grid technology. GridOrbit visualizes the activity in the grid, shows information about the different active projects, and supports a messaging functionality where...... people comment on projects. Our work explores the usage of interactive technologies as enablers for the appropriation of an otherwise invisible infrastructure....
Robust large-scale parallel nonlinear solvers for simulations.
Energy Technology Data Exchange (ETDEWEB)
Bader, Brett William; Pawlowski, Roger Patrick; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)
2005-11-01
This report documents research to develop robust and efficient solution techniques for solving large-scale systems of nonlinear equations. The most widely used method for solving systems of nonlinear equations is Newton's method. While much research has been devoted to augmenting Newton-based solvers (usually with globalization techniques), little has been devoted to exploring the application of different models. Our research has been directed at evaluating techniques using different models than Newton's method: a lower order model, Broyden's method, and a higher order model, the tensor method. We have developed large-scale versions of each of these models and have demonstrated their use in important applications at Sandia. Broyden's method replaces the Jacobian with an approximation, allowing codes that cannot evaluate a Jacobian or have an inaccurate Jacobian to converge to a solution. Limited-memory methods, which have been successful in optimization, allow us to extend this approach to large-scale problems. We compare the robustness and efficiency of Newton's method, modified Newton's method, Jacobian-free Newton-Krylov method, and our limited-memory Broyden method. Comparisons are carried out for large-scale applications of fluid flow simulations and electronic circuit simulations. Results show that, in cases where the Jacobian was inaccurate or could not be computed, Broyden's method converged in some cases where Newton's method failed to converge. We identify conditions where Broyden's method can be more efficient than Newton's method. We also present modifications to a large-scale tensor method, originally proposed by Bouaricha, for greater efficiency, better robustness, and wider applicability. Tensor methods are an alternative to Newton-based methods and are based on computing a step based on a local quadratic model rather than a linear model. The advantage of Bouaricha's method is that it can use any
Grid3: An Application Grid Laboratory for Science
CERN. Geneva
2004-01-01
level services required by the participating experiments. The deployed infrastructure has been operating since November 2003 with 27 sites, a peak of 2800 processors, work loads from 10 different applications exceeding 1300 simultaneous jobs, and data transfers among sites of greater than 2 TB/day. The Grid3 infrastructure was deployed from grid level services provided by groups and applications within the collaboration. The services were organized into four distinct "grid level services" including: Grid3 Packaging, Monitoring and Information systems, User Authentication and the iGOC Grid Operatio...
A new set of direct and iterative solvers for the TOUGH2 family of codes
Energy Technology Data Exchange (ETDEWEB)
Moridis, G.J. [Lawrence Berkeley Lab., CA (United States). Earth Sciences Div.
1995-04-01
Two new solvers are discussed. LUBAND, the first routine is a direct solver for banded systems and is based on a LU decomposition with partial pivoting and row interchange. BCGSTB, the second routine, is a Preconditioned Conjugate Gradient (PCG) solver with improved speed and convergence characteristics. Bandwidth minimization and gridblock ordering schemes are also introduced into TOUGH2 to improve speed and accuracy. TOUGH2 simulates fluid and heat flows in permeable media and is used for the evaluation of WIPP and TEVES (Thermal Enhanced Vapor Extraction System) that will be used to extract solvents from the Chemical Waste Landfill at Sandia National Laboratories.
A Radiation Solver for the National Combustion Code
Sockol, Peter M.
2015-01-01
A methodology is given that converts an existing finite volume radiative transfer method that requires input of local absorption coefficients to one that can treat a mixture of combustion gases and compute the coefficients on the fly from the local mixture properties. The Full-spectrum k-distribution method is used to transform the radiative transfer equation (RTE) to an alternate wave number variable, g . The coefficients in the transformed equation are calculated at discrete temperatures and participating species mole fractions that span the values of the problem for each value of g. These results are stored in a table and interpolation is used to find the coefficients at every cell in the field. Finally, the transformed RTE is solved for each g and Gaussian quadrature is used to find the radiant heat flux throughout the field. The present implementation is in an existing cartesian/cylindrical grid radiative transfer code and the local mixture properties are given by a solution of the National Combustion Code (NCC) on the same grid. Based on this work the intention is to apply this method to an existing unstructured grid radiation code which can then be coupled directly to NCC.
Coarse-grid-CFD. An advantageous alternative to subchannel analysis
Energy Technology Data Exchange (ETDEWEB)
Class, A.G.; Himmel, S.R.; Viellieber, M.O. [Karlsruhe Institute of Technology (KIT), Karlsruhe (DE). Inst. for Nuclear and Energy Technologies (IKET)
2011-07-01
In the 1960{sup th} to 80{sup th} when current GEN II reactor technology was developed, the only possible approach was to use one-dimensional subchannel analysis to compute the flow inside a fuel bundle so that the subchannel scale could be resolved. For simulations of the whole reactor core either system codes or homogenization were employed. In system codes resolution of individual assemblies was the state of the art. Homogenization used porous media equations simulations and averaged the thermohydraulics on reactor core scale. Current potent computing power allows using Computational Fluid Dynamics (CFD) to simulate individual fuel assemblies. Yet the large number of fuel assemblies within the core forbids exploiting CFD for core wide simulation. We propose to combine ideas of subchannel analysis and CFD to develop a new methodology which takes advantage of the fast development of commercial CFD software and the efficiency of subchannel analysis. In this methodology was first applied to simulate a wire-wrap fuel bundle of the High Performance Light Water Reactor (HPLWR). Computations using an inviscid Euler solver on an extremely coarse grid were tuned to predict the true thermohydraulics by adding volumetric forces. These forces represent the non-resolved sub-grid physics. The volumetric forces cannot be measured directly. However, they can be accessed from detailed CFD simulations resolving all relevant physics. Parameterization of these subgrid forces can be realized analogous to models in subchannel codes. In the present work we extend the methodology to the open source solver OpenFOAM and a specific hexagonal fuel assembly which is studied in the framework of liquid metal cooled GEN IV reactor concepts. (orig.)
The development and application of the self-adaptive grid code, SAGE
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.
Energy Technology Data Exchange (ETDEWEB)
Yeung, Yu-Hong; Pothen, Alex; Halappanavar, Mahantesh; Huang, Zhenyu
2017-10-09
We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \\times 10^{-2}$ seconds on an Intel Xeon processor.
Incremental planning to control a blackboard-based problem solver
Durfee, E. H.; Lesser, V. R.
1987-01-01
To control problem solving activity, a planner must resolve uncertainty about which specific long-term goals (solutions) to pursue and about which sequences of actions will best achieve those goals. A planner is described that abstracts the problem solving state to recognize possible competing and compatible solutions and to roughly predict the importance and expense of developing these solutions. With this information, the planner plans sequences of problem solving activities that most efficiently resolve its uncertainty about which of the possible solutions to work toward. The planner only details actions for the near future because the results of these actions will influence how (and whether) a plan should be pursued. As problem solving proceeds, the planner adds new details to the plan incrementally, and monitors and repairs the plan to insure it achieves its goals whenever possible. Through experiments, researchers illustrate how these new mechanisms significantly improve problem solving decisions and reduce overall computation. They briefly discuss current research directions, including how these mechanisms can improve a problem solver's real-time response and can enhance cooperation in a distributed problem solving network.
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-06-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.
Towards Batched Linear Solvers on Accelerated Hardware Platforms
Energy Technology Data Exchange (ETDEWEB)
Haidar, Azzam [University of Tennessee (UT); Dong, Tingzing Tim [University of Tennessee (UT); Tomov, Stanimire [University of Tennessee (UT); Dongarra, Jack J [ORNL
2015-01-01
As hardware evolves, an increasingly effective approach to develop energy efficient, high-performance solvers, is to design them to work on many small and independent problems. Indeed, many applications already need this functionality, especially for GPUs, which are known to be currently about four to five times more energy efficient than multicore CPUs for every floating-point operation. In this paper, we describe the development of the main one-sided factorizations: LU, QR, and Cholesky; that are needed for a set of small dense matrices to work in parallel. We refer to such algorithms as batched factorizations. Our approach is based on representing the algorithms as a sequence of batched BLAS routines for GPU-contained execution. Note that this is similar in functionality to the LAPACK and the hybrid MAGMA algorithms for large-matrix factorizations. But it is different from a straightforward approach, whereby each of GPU's symmetric multiprocessors factorizes a single problem at a time. We illustrate how our performance analysis together with the profiling and tracing tools guided the development of batched factorizations to achieve up to 2-fold speedup and 3-fold better energy efficiency compared to our highly optimized batched CPU implementations based on the MKL library on a two-sockets, Intel Sandy Bridge server. Compared to a batched LU factorization featured in the NVIDIA's CUBLAS library for GPUs, we achieves up to 2.5-fold speedup on the K40 GPU.
Simulation of Propeller – Hull Interaction Using Ranse Solver
Directory of Open Access Journals (Sweden)
M.N. Senthil Prakash
2010-09-01
Full Text Available This work simulates propeller-hull interaction effects by a novel method namely, coupling a Vortex Lattice Method (VLM with a RANSE solver. The VLM generates the propeller forces based on the inputs of blade geometry, wake at propeller inlet, the required thrust and the propeller revolutions. The propeller forces thus obtained are distributed in the fluid domain at the propeller disk region at specific cells. These cells lie close to the blade coordinates and the forces are assigned to the centroids of cells by means of a user-defined function (UDF. The introduction of the body forces into the fluid domain, emulates the propeller action in the field of flow with consequent influences on the flow kinematics. Therefore the interaction effect between propeller and ship hull is simulated successfully by coupling the two methods. Thereby the kinematical aspects such as effective wake conditions are obtained. The results based on the methodology have been verified by comparison with data from the KCS ship available in recent published literature. The method establishes a successful numerical tank approach in understanding the ship hull-propeller interaction problem.
Parallelizable approximate solvers for recursions arising in preconditioning
Energy Technology Data Exchange (ETDEWEB)
Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
An optimal iterative solver for the Stokes problem
Energy Technology Data Exchange (ETDEWEB)
Wathen, A. [Univ. of Bristol (United Kingdom); Silvester, D.
1994-12-31
Discretisations of the classical Stokes Problem for slow viscous incompressible flow gives rise to systems of equations in matrix form for the velocity u and the pressure p, where the coefficient matrix is symmetric but necessarily indefinite. The square submatrix A is symmetric and positive definite and represents a discrete (vector) Laplacian and the submatrix C may be the zero matrix or more generally will be symmetric positive semi-definite. For `stabilised` discretisations (C {ne} 0) and descretisations which are inherently `stable` (C = 0) and so do not admit spurious pressure components even as the mesh size, h approaches zero, the Schur compliment of the matrix has spectral condition number independent of h (given also that B is bounded). Here the authors will show how this property together with a multigrid preconditioner only for the Laplacian block A yields an optimal solver for the Stokes problem through use of the Minimum Residual iteration. That is, combining Minimum Residual iteration for the matrix equation with a block preconditioner which comprises a small number of multigrid V-cycles for the Laplacian block A together with a simple diagonal scaling block provides an iterative solution procedure for which the computational work grows only linearly with the problem size.
Development and acceleration of unstructured mesh-based cfd solver
Emelyanov, V.; Karpenko, A.; Volkov, K.
2017-06-01
The study was undertaken as part of a larger effort to establish a common computational fluid dynamics (CFD) code for simulation of internal and external flows and involves some basic validation studies. The governing equations are solved with ¦nite volume code on unstructured meshes. The computational procedure involves reconstruction of the solution in each control volume and extrapolation of the unknowns to find the flow variables on the faces of control volume, solution of Riemann problem for each face of the control volume, and evolution of the time step. The nonlinear CFD solver works in an explicit time-marching fashion, based on a three-step Runge-Kutta stepping procedure. Convergence to a steady state is accelerated by the use of geometric technique and by the application of Jacobi preconditioning for high-speed flows, with a separate low Mach number preconditioning method for use with low-speed flows. The CFD code is implemented on graphics processing units (GPUs). Speedup of solution on GPUs with respect to solution on central processing units (CPU) is compared with the use of different meshes and different methods of distribution of input data into blocks. The results obtained provide promising perspective for designing a GPU-based software framework for applications in CFD.
Smart Grid Demonstration Project
Energy Technology Data Exchange (ETDEWEB)
Miller, Craig [National Rural Electric Cooperative Association, Arlington, VA (United States); Carroll, Paul [National Rural Electric Cooperative Association, Arlington, VA (United States); Bell, Abigail [National Rural Electric Cooperative Association, Arlington, VA (United States)
2015-03-11
The National Rural Electric Cooperative Association (NRECA) organized the NRECA-U.S. Department of Energy (DOE) Smart Grid Demonstration Project (DE-OE0000222) to install and study a broad range of advanced smart grid technologies in a demonstration that spanned 23 electric cooperatives in 12 states. More than 205,444 pieces of electronic equipment and more than 100,000 minor items (bracket, labels, mounting hardware, fiber optic cable, etc.) were installed to upgrade and enhance the efficiency, reliability, and resiliency of the power networks at the participating co-ops. The objective of this project was to build a path for other electric utilities, and particularly electrical cooperatives, to adopt emerging smart grid technology when it can improve utility operations, thus advancing the co-ops’ familiarity and comfort with such technology. Specifically, the project executed multiple subprojects employing a range of emerging smart grid technologies to test their cost-effectiveness and, where the technology demonstrated value, provided case studies that will enable other electric utilities—particularly electric cooperatives— to use these technologies. NRECA structured the project according to the following three areas: Demonstration of smart grid technology; Advancement of standards to enable the interoperability of components; and Improvement of grid cyber security. We termed these three areas Technology Deployment Study, Interoperability, and Cyber Security. Although the deployment of technology and studying the demonstration projects at coops accounted for the largest portion of the project budget by far, we see our accomplishments in each of the areas as critical to advancing the smart grid. All project deliverables have been published. Technology Deployment Study: The deliverable was a set of 11 single-topic technical reports in areas related to the listed technologies. Each of these reports has already been submitted to DOE, distributed to co-ops, and
Wireless Communications in Smart Grid
Bojkovic, Zoran; Bakmaz, Bojan
Communication networks play a crucial role in smart grid, as the intelligence of this complex system is built based on information exchange across the power grid. Wireless communications and networking are among the most economical ways to build the essential part of the scalable communication infrastructure for smart grid. In particular, wireless networks will be deployed widely in the smart grid for automatic meter reading, remote system and customer site monitoring, as well as equipment fault diagnosing. With an increasing interest from both the academic and industrial communities, this chapter systematically investigates recent advances in wireless communication technology for the smart grid.
Maximilien Brice
2006-01-01
Housed in the CERN Computer Centre, these banks of computers process and store data produced on the CERN systems. When the LHC starts operation in 2008, it will produce enough data every year to fill a stack of CDs 20 km tall. To handle this huge amount of data, CERN has also developed the Grid, allowing processing power to be shared between computer centres around the world.
DEFF Research Database (Denmark)
Klostermeyer, William F.; Yeo, Anders
2015-01-01
It has been conjectured that the edge domination number of the m × n grid graph, denoted by γ′(Pm□Pn), is ⌊mn/3⌋, when m,n ≥ 2. Our main result gives support for this conjecture by proving that ⌊mn/3⌋ ≤ -γ′{Pm□Pn) ≤ mn/3 + n/12 + 1, when m,n ≥ 2. We furthermore show that the conjecture holds when...
Grid computing for electromagnetics
Tarricone, Luciano
2004-01-01
Today, more and more practitioners, researchers, and students are utilizing the power and efficiency of grid computing for their increasingly complex electromagnetics applications. This cutting-edge book offers you the practical and comprehensive guidance you need to use this new approach to supercomputing for your challenging projects. Supported with over 110 illustrations, the book clearly describes a high-performance, low-cost method to solving huge numerical electromagnetics problems.
Resilient Grid Operational Strategies
Energy Technology Data Exchange (ETDEWEB)
Pasqualini, Donatella [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-03-01
Extreme weather-related disturbances, such as hurricanes, are a leading cause of grid outages historically. Although physical asset hardening is perhaps the most common way to mitigate the impacts of severe weather, operational strategies may be deployed to limit the extent of societal and economic losses associated with weather-related physical damage.1 The purpose of this study is to examine bulk power-system operational strategies that can be deployed to mitigate the impact of severe weather disruptions caused by hurricanes, thereby increasing grid resilience to maintain continuity of critical infrastructure during extreme weather. To estimate the impacts of resilient grid operational strategies, Los Alamos National Laboratory (LANL) developed a framework for hurricane probabilistic risk analysis (PRA). The probabilistic nature of this framework allows us to estimate the probability distribution of likely impacts, as opposed to the worst-case impacts. The project scope does not include strategies that are not operations related, such as transmission system hardening (e.g., undergrounding, transmission tower reinforcement and substation flood protection) and solutions in the distribution network.
Wang, XiaoLiang; Li, JiaChun
2017-12-01
A new solver based on the high-resolution scheme with novel treatments of source terms and interface capture for the Savage-Hutter model is developed to simulate granular avalanche flows. The capability to simulate flow spread and deposit processes is verified through indoor experiments of a two-dimensional granular avalanche. Parameter studies show that reduction in bed friction enhances runout efficiency, and that lower earth pressure restraints enlarge the deposit spread. The April 9, 2000, Yigong avalanche in Tibet, China, is simulated as a case study by this new solver. The predicted results, including evolution process, deposit spread, and hazard impacts, generally agree with site observations. It is concluded that the new solver for the Savage-Hutter equation provides a comprehensive software platform for granular avalanche simulation at both experimental and field scales. In particular, the solver can be a valuable tool for providing necessary information for hazard forecasts, disaster mitigation, and countermeasure decisions in mountainous areas.
Quasi-2D Unsteady Flow Solver Module for Rocket Engine and Propulsion System Simulations
National Research Council Canada - National Science Library
Campell, Bryan T; Davis, Roger L
2006-01-01
.... The solver is targeted to the commercial dynamic simulation software package Simulink(Registered) for integration into a larger suite of modules developed for simulating rocket engines and propulsion systems...
GPU-Accelerated Sparse Matrix Solvers for Large-Scale Simulations Project
National Aeronautics and Space Administration — At the heart of scientific computing and numerical analysis are linear algebra solvers. In scientific computing, the focus is on the partial differential equations...
Cognitive Distance Learning Problem Solver Reduces Search Cost through Learning Processes
Yamakawa, Hiroshi; Miyamoto, Yuji; Baba, Takayuki; Okada, Hiroyuki
Our proposed cognitive distance learning problem solver generates sequence of actions from initial state to goal states in problem state space. This problem solver learns cognitive distance (path cost) of arbitrary combination of two states. Action generation at each state is selection of next state that has minimum cognitive distance to the goal, like Q-learning agent. In this paper, first, we show that our proposed method reduces search cost than conventional search method by analytical simulation in spherical state space. Second, we show that an average search cost is more reduced more the prior learning term is long and our problem solver is familiar to the environment, by a computer simulation in a tile world state space. Third, we showed that proposed problem solver is superior to the reinforcement learning techniques when goal is changed by a computer simulation. Forth, we found that our simulation result consist with psychological experimental results.
Advanced field-solver techniques for RC extraction of integrated circuits
Yu, Wenjian
2014-01-01
Resistance and capacitance (RC) extraction is an essential step in modeling the interconnection wires and substrate coupling effect in nanometer-technology integrated circuits (IC). The field-solver techniques for RC extraction guarantee the accuracy of modeling, and are becoming increasingly important in meeting the demand for accurate modeling and simulation of VLSI designs. Advanced Field-Solver Techniques for RC Extraction of Integrated Circuits presents a systematic introduction to, and treatment of, the key field-solver methods for RC extraction of VLSI interconnects and substrate coupling in mixed-signal ICs. Various field-solver techniques are explained in detail, with real-world examples to illustrate the advantages and disadvantages of each algorithm. This book will benefit graduate students and researchers in the field of electrical and computer engineering, as well as engineers working in the IC design and design automation industries. Dr. Wenjian Yu is an Associate Professor at the Department of ...
An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU
Energy Technology Data Exchange (ETDEWEB)
Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of)
2017-02-15
The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.
Steger, Joseph L.
1989-01-01
Hyperbolic grid generation procedures are described which have been used in external flow simulations about complex configurations. For many practical applications a single well-ordered (i.e., structured) grid can be used to mesh an entire configuration, in other problems, composite or unstructured grid procedures are needed. Although the hyperbolic partial differential equation grid generation procedure has mainly been utilized to generate structured grids, extension of the procedure to semiunstructured grids is briefly described. Extensions of the methodology are also described using two-dimensional equations.
George, D.L.
2011-01-01
The simulation of advancing flood waves over rugged topography, by solving the shallow-water equations with well-balanced high-resolution finite volume methods and block-structured dynamic adaptive mesh refinement (AMR), is described and validated in this paper. The efficiency of block-structured AMR makes large-scale problems tractable, and allows the use of accurate and stable methods developed for solving general hyperbolic problems on quadrilateral grids. Features indicative of flooding in rugged terrain, such as advancing wet-dry fronts and non-stationary steady states due to balanced source terms from variable topography, present unique challenges and require modifications such as special Riemann solvers. A well-balanced Riemann solver for inundation and general (non-stationary) flow over topography is tested in this context. The difficulties of modeling floods in rugged terrain, and the rationale for and efficacy of using AMR and well-balanced methods, are presented. The algorithms are validated by simulating the Malpasset dam-break flood (France, 1959), which has served as a benchmark problem previously. Historical field data, laboratory model data and other numerical simulation results (computed on static fitted meshes) are shown for comparison. The methods are implemented in GEOCLAW, a subset of the open-source CLAWPACK software. All the software is freely available at. Published in 2010 by John Wiley & Sons, Ltd.
Cognitive structures of good and poor novice problem solvers in physics
Jong, de, AJM Ton; Ferguson-Hessler, MGM Monica
1986-01-01
The way knowledge is organized in memory is generally expected to relate to the degree of success in problem solving. In the present study, we investigated whether good novice problem solvers have their knowledge arranged around problem types to a greater extent than poor problem solvers have. In the subject of physics (electricity and magnetism), 12 problem types were distinguished according to their underlying physics principles. For each problem type, a set of elements of knowledge contain...
The role of initial value solvers in a moving mesh method
Ju, LIN
2007-01-01
This thesis investigates the role of different initial value solvers in moving mesh software for solving second-order parabolic partial differential equations. We confine our attention primarily to the effect of the implicit ODE solver DDASSL used in the software MOVCOL of Huang and Russell, which is based on a moving collocation method. The advantages and limitations of Backward Differentiation Formula (BDF) methods and Implicit Runge-Kutta (IRK) methods are discussed in this particular cont...
Weighted Matrix Ordering And Parallel Banded Preconditioners For Iterative Linear System Solvers
Manguoglu, Murat; Koyuturk, Mehmet; Sameh, Ahmed; Grama, Ananth Y.
2010-01-01
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of deep memory hierarchies, as opposed to minimizing raw FLOP counts. While direct solvers are reliable, they are often slow and memory-intensive for large problems. Iterative solvers, on the other hand, are more efficient but, in the absence of robust preconditioners, lack reliability. While preconditioners based on in...
Gomes, M.; Costa, J. C.; Alves, R. A.; Silva, N. A.; Guerreiro, A.
2017-08-01
Under specific conditions, there is a formal analogy between the fundamental equations of electromagnetism and relativistic gravitation, described by the Einstein field equations of general relativity. In this paper, we report on how we have used this analogy to implement a solver of the Einstein equations adapting algorithms initially developed for electromagnetism, combined with methods of heterogeneous supercomputing, in GPU that can achieve fast computing and exhibit good performance. We also present the results of the simulations used to validate our solver.
A 3D Unstructured Mesh Euler Solver Based on the Fourth-Order CESE Method
2013-06-01
hyperplane in every BCE associated with the current cell (j, n) and then take the sum of all integrations . For a tetrahedral mesh each cell has four...conservation in space and time without using a one-dimensional Riemann solver, (ii) genuinely multi-dimensional treatment without dimensional splitting (iii...of the original second-order CESE method, including: (i) flux conservation in space and time without using a one-dimensional Riemann solver, (ii
Thermal Loss of High-Q Antennas in Time Domain vs. Frequency Domain Solver
DEFF Research Database (Denmark)
Bahramzy, Pevand; Pedersen, Gert Frølund
2014-01-01
High-Q structures pose great challenges to their loss simulations in Time Domain Solvers (TDS). Therefore, in this work the thermal loss of high-Q antennas is calculated both in TDS and Frequency Domain Solver (FDS), which are then compared with each other and with the actual measurements....... The thermal loss calculation in FDS is shown to be more accurate for high-Q antennas....
Abad Lopez, Carlos Adrian
Current electricity infrastructure is being stressed from several directions -- high demand, unreliable supply, extreme weather conditions, accidents, among others. Infrastructure planners have, traditionally, focused on only the cost of the system; today, resilience and sustainability are increasingly becoming more important. In this dissertation, we develop computational tools for efficiently managing electricity resources to help create a more reliable and sustainable electrical grid. The tools we present in this work will help electric utilities coordinate demand to allow the smooth and large scale integration of renewable sources of energy into traditional grids, as well as provide infrastructure planners and operators in developing countries a framework for making informed planning and control decisions in the presence of uncertainty. Demand-side management is considered as the most viable solution for maintaining grid stability as generation from intermittent renewable sources increases. Demand-side management, particularly demand response (DR) programs that attempt to alter the energy consumption of customers either by using price-based incentives or up-front power interruption contracts, is more cost-effective and sustainable in addressing short-term supply-demand imbalances when compared with the alternative that involves increasing fossil fuel-based fast spinning reserves. An essential step in compensating participating customers and benchmarking the effectiveness of DR programs is to be able to independently detect the load reduction from observed meter data. Electric utilities implementing automated DR programs through direct load control switches are also interested in detecting the reduction in demand to efficiently pinpoint non-functioning devices to reduce maintenance costs. We develop sparse optimization methods for detecting a small change in the demand for electricity of a customer in response to a price change or signal from the utility
Kwf-Grid workflow management system for Earth science applications
Tran, V.; Hluchy, L.
2009-04-01
In this paper, we present workflow management tool for Earth science applications in EGEE. The workflow management tool was originally developed within K-wf Grid project for GT4 middleware and has many advanced features like semi-automatic workflow composition, user-friendly GUI for managing workflows, knowledge management. In EGEE, we are porting the workflow management tool to gLite middleware for Earth science applications K-wf Grid workflow management system was developed within "Knowledge-based Workflow System for Grid Applications" under the 6th Framework Programme. The workflow mangement system intended to - semi-automatically compose a workflow of Grid services, - execute the composed workflow application in a Grid computing environment, - monitor the performance of the Grid infrastructure and the Grid applications, - analyze the resulting monitoring information, - capture the knowledge that is contained in the information by means of intelligent agents, - and finally to reuse the joined knowledge gathered from all participating users in a collaborative way in order to efficiently construct workflows for new Grid applications. Kwf Grid workflow engines can support different types of jobs (e.g. GRAM job, web services) in a workflow. New class of gLite job has been added to the system, allows system to manage and execute gLite jobs in EGEE infrastructure. The GUI has been adapted to the requirements of EGEE users, new credential management servlet is added to portal. Porting K-wf Grid workflow management system to gLite would allow EGEE users to use the system and benefit from its avanced features. The system is primarly tested and evaluated with applications from ES clusters.
Particle-in-cell beam dynamics simulations with a wavelet-based Poisson solver
Directory of Open Access Journals (Sweden)
Balša Terzić
2007-03-01
Full Text Available We report on a successful implementation of a three-dimensional wavelet-based solver for the Poisson equation with Dirichlet boundary conditions, optimized for use in particle-in-cell (PIC simulations. The solver is based on the operator formulation of the conjugate gradient algorithm, for which effectively diagonal preconditioners are available in wavelet bases. Because of the recursive nature of PIC simulations, a good initial approximation to the iterative solution is always readily available, which we demonstrate to be a key advantage in terms of overall computational speed. While the Laplacian remains sparse in a wavelet representation, the wavelet-decomposed potential and density can be rendered sparse through a procedure that amounts to simultaneous compression and denoising of the data. We explain how this procedure can be carried out in a controlled and near-optimal way, and show the effect it has on the overall solver performance. After testing the solver in a stand-alone mode, we integrated it into the IMPACT-T beam dynamics particle-in-cell code and extensively benchmarked it against the IMPACT-T with the native FFT-based Poisson solver. We present and discuss these benchmarking results, as well as the results of modeling the Fermi/NICADD photoinjector using IMPACT-T with the wavelet-based solver.
Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems
Chávez, Gustavo
2017-12-15
We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.
Pacheco, Luz; Smith, Katherine; Hamlington, Peter; Niemeyer, Kyle
2017-11-01
Vertical transport flux in the ocean upper mixed layer has recently been attributed to submesoscale currents, which occur at scales on the order of kilometers in the horizontal direction. These phenomena, which include fronts and mixed-layer instabilities, have been of particular interest due to the effect of turbulent mixing on nutrient transport, facilitating phytoplankton blooms. We study these phenomena using a non-hydrostatic, large eddy simulation for submesoscale currents in the ocean, developed using the extensible, open-source finite element platform FEniCs. Our model solves the standard Boussinesq Euler equations in variational form using the finite element method. FEniCs enables the use of parallel computing on modern systems for efficient computing time, and is suitable for unstructured grids where irregular topography can be considered in the future. The solver will be verified against the well-established NCAR-LES model and validated against observational data. For the verification with NCAR-LES, the velocity, pressure, and buoyancy fields are compared through a surface-wind-driven, open-ocean case. We use this model to study the impacts of uncertainties in the model parameters, such as near-surface buoyancy flux and secondary circulation, and discuss implications.
A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS
Energy Technology Data Exchange (ETDEWEB)
Davis, Shane W. [Canadian Institute for Theoretical Astrophysics, Toronto, ON M5S 3H4 (Canada); Stone, James M.; Jiang Yanfei [Department of Astrophysical Sciences, Princeton University, Princeton, NJ 08544 (United States)
2012-03-01
We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.
Using Python to Construct a Scalable Parallel Nonlinear Wave Solver
Mandli, Kyle
2011-01-01
Computational scientists seek to provide efficient, easy-to-use tools and frameworks that enable application scientists within a specific discipline to build and/or apply numerical models with up-to-date computing technologies that can be executed on all available computing systems. Although many tools could be useful for groups beyond a specific application, it is often difficult and time consuming to combine existing software, or to adapt it for a more general purpose. Python enables a high-level approach where a general framework can be supplemented with tools written for different fields and in different languages. This is particularly important when a large number of tools are necessary, as is the case for high performance scientific codes. This motivated our development of PetClaw, a scalable distributed-memory solver for time-dependent nonlinear wave propagation, as a case-study for how Python can be used as a highlevel framework leveraging a multitude of codes, efficient both in the reuse of code and programmer productivity. We present scaling results for computations on up to four racks of Shaheen, an IBM BlueGene/P supercomputer at King Abdullah University of Science and Technology. One particularly important issue that PetClaw has faced is the overhead associated with dynamic loading leading to catastrophic scaling. We use the walla library to solve the issue which does so by supplanting high-cost filesystem calls with MPI operations at a low enough level that developers may avoid any changes to their codes.
Finite element solver for 3-D compressible viscous flows
Reddy, K. C.; Reddy, J. N.
1986-12-01
The space shuttle main engine (SSME) has extremely complex internal flow structure. The geometry of the flow domain is three-dimensional with complicated topology. The flow is compressible, viscous, and turbulent with large gradients in flow quantities and regions of recirculations. The analysis of the flow field in SSME involves several tedious steps. One is the geometrical modeling of the particular zone of the SSME being studied. Accessing the geometry definition, digitalizing it, and developing surface interpolations suitable for an interior grid generator require considerable amount of manual labor. There are several types of grid generators available with some general-purpose finite element programs. An efficient and robust computational scheme for solving 3D Navier-Stokes equations has to be implemented. Post processing software has to be adapted to visualize and analyze the computed 3D flow field. The progress made in a project to develop software for the analysis of the flow is discussed. The technical approach to the development of the finite element scheme and the relaxation procedure are discussed. The three dimensional finite element code for the compressible Navier-Stokes equations is listed.
The Volume Grid Manipulator (VGM): A Grid Reusability Tool
Alter, Stephen J.
1997-01-01
This document is a manual describing how to use the Volume Grid Manipulation (VGM) software. The code is specifically designed to alter or manipulate existing surface and volume structured grids to improve grid quality through the reduction of grid line skewness, removal of negative volumes, and adaption of surface and volume grids to flow field gradients. The software uses a command language to perform all manipulations thereby offering the capability of executing multiple manipulations on a single grid during an execution of the code. The command language can be input to the VGM code by a UNIX style redirected file, or interactively while the code is executing. The manual consists of 14 sections. The first is an introduction to grid manipulation; where it is most applicable and where the strengths of such software can be utilized. The next two sections describe the memory management and the manipulation command language. The following 8 sections describe simple and complex manipulations that can be used in conjunction with one another to smooth, adapt, and reuse existing grids for various computations. These are accompanied by a tutorial section that describes how to use the commands and manipulations to solve actual grid generation problems. The last two sections are a command reference guide and trouble shooting sections to aid in the use of the code as well as describe problems associated with generated scripts for manipulation control.
Zhuge, Hai
2004-01-01
The Knowledge Grid is an intelligent and sustainable interconnection environment that enables people and machines to effectively capture, publish, share and manage knowledge resources. It also provides appropriate on-demand services to support scientific research, technological innovation, cooperative teamwork, problem solving, and decision making. It incorporates epistemology and ontology to reflect human cognitive characteristics; exploits social, ecological and economic principles; and adopts techniques and standards developed during work toward the future web. This book presents its methodology, theory, models and applications systematically for the first time.
Keyhani, Ali
2012-01-01
Electric power systems are experiencing significant changes at the worldwide scale in order to become cleaner, smarter, and more reliable. This edited book examines a wide range of topics related to these changes, which are primarily caused by the introduction of information technologies, renewable energy penetration, digitalized equipment, new operational strategies, and so forth. The emphasis will be put on the modeling and control of smart grid systems. This book addresses research topics such as high efficiency transforrmers, wind turbines and generators, fuel cells, or high speed turbines
Steinbrenner, John P.; Chawner, John R.
1992-01-01
GRIDGEN is a government domain software package for interactive generation of multiple block grids around general configurations. Though it has been freely available since 1989, it has not been widely embraced by the internal flow community due to a misconception that it was designed for external flow use only. In reality GRIDGEN has always worked for internal flow applications, and GRIDGEN ongoing enhancements are increasing the quality of and efficiency with which grids for external and internal flow problems may be constructed. The software consists of four codes used to perform the four steps of the grid generation process. GRIDBLOCK is first used to decompose the flow domain into a collection of component blocks and then to establish interblock connections and flow solver boundary conditions. GRIDGEN2D is then used to generate surface grids on the outer shell of each component block. GRIDGEN3D generates grid points on the interior of each block, and finally GRIDVUE3D is used to inspect the resulting multiple block grid. Three of these codes (GRIDBLOCK, GRIDGEN2D, and GRIDVUE3D) are highly interactive and graphical in nature, and currently run on Silicon Graphics, Inc., and IBM RS/6000 workstations. The lone batch code (GRIDGEN3D) may be run on any of several Unix based platforms. Surface grid generation in GRIDGEN2D is being improved with the addition of higher order surface definitions (NURBS and parametric surfaces input in IGES format and bicubic surfaces input in PATRAN Neutral File format) and double precision mathematics. In addition, two types of automation have been added to GRIDGEN2D that reduce the learning curve slope for new users and eliminate work for experienced users. Volume grid generation using GRIDGEN3D has been improved via the addition of an advanced hybrid control function formulation that provides both orthogonality and clustering control at the block faces and clustering control on the block interior.
Smart Grid as a Service: A Discussion on Design Issues
Tsai, Chen-Chou; Chou, I-Hsin
2014-01-01
Smart grid allows the integration of distributed renewable energy resources into the conventional electricity distribution power grid such that the goals of reduction in power cost and in environment pollution can be met through an intelligent and efficient matching between power generators and power loads. Currently, this rapidly developing infrastructure is not as “smart” as it should be because of the lack of a flexible, scalable, and adaptive structure. As a solution, this work proposes smart grid as a service (SGaaS), which not only allows a smart grid to be composed out of basic services, but also allows power users to choose between different services based on their own requirements. The two important issues of service-level agreements and composition of services are also addressed in this work. Finally, we give the details of how SGaaS can be implemented using a FIPA-compliant JADE multiagent system. PMID:25243214
Smart grid as a service: a discussion on design issues.
Chao, Hung-Lin; Tsai, Chen-Chou; Hsiung, Pao-Ann; Chou, I-Hsin
2014-01-01
Smart grid allows the integration of distributed renewable energy resources into the conventional electricity distribution power grid such that the goals of reduction in power cost and in environment pollution can be met through an intelligent and efficient matching between power generators and power loads. Currently, this rapidly developing infrastructure is not as "smart" as it should be because of the lack of a flexible, scalable, and adaptive structure. As a solution, this work proposes smart grid as a service (SGaaS), which not only allows a smart grid to be composed out of basic services, but also allows power users to choose between different services based on their own requirements. The two important issues of service-level agreements and composition of services are also addressed in this work. Finally, we give the details of how SGaaS can be implemented using a FIPA-compliant JADE multiagent system.
Workshop on Future Generation Grids
Laforenza, Domenico; Reinefeld, Alexander
2006-01-01
The Internet and the Web continue to have a major impact on society. By allowing us to discover and access information on a global scale, they have created entirely new businesses and brought new meaning to the term surf. In addition, however, we want processing, and increasingly, we want collaborative processing within distributed teams. This need has led to the creation of the Grid - an infrastructure that enables us to share capabilities, and integrate services and resources within and across enterprises. "Future Generation Grids" is the second in the "CoreGRID" series. This edited volume brings together contributed articles by scientists and researchers in the Grid community in an attempt to draw a clearer picture of the future generation Grids. This book also identifies some of the most challenging problems on the way to achieving the invisible Grid ideas
Huang, Xiaomeng; Tang, Qiang; Tseng, Yuheng; Hu, Yong; Baker, Allison H.; Bryan, Frank O.; Dennis, John; Fu, Haohuan; Yang, Guangwen
2016-11-01
In the Community Earth System Model (CESM), the ocean model is computationally expensive for high-resolution grids and is often the least scalable component for high-resolution production experiments. The major bottleneck is that the barotropic solver scales poorly at high core counts. We design a new barotropic solver to accelerate the high-resolution ocean simulation. The novel solver adopts a Chebyshev-type iterative method to reduce the global communication cost in conjunction with an effective block preconditioner to further reduce the iterations. The algorithm and its computational complexity are theoretically analyzed and compared with other existing methods. We confirm the significant reduction of the global communication time with a competitive convergence rate using a series of idealized tests. Numerical experiments using the CESM 0.1° global ocean model show that the proposed approach results in a factor of 1.7 speed-up over the original method with no loss of accuracy, achieving 10.5 simulated years per wall-clock day on 16 875 cores.
Efficient IMRT inverse planning with a new L1-solver: template for first-order conic solver
Kim, Hojin; Suh, Tae-Suk; Lee, Rena; Xing, Lei; Li, Ruijiang
2012-07-01
Intensity modulated radiation therapy (IMRT) inverse planning using total-variation (TV) regularization has been proposed to reduce the complexity of fluence maps and facilitate dose delivery. Conventionally, the optimization problem with L-1 norm is solved with quadratic programming (QP), which is time consuming and memory expensive due to the second-order Newton update. This study proposes to use a new algorithm, template for first-order conic solver (TFOCS), for fast and memory-efficient optimization in IMRT inverse planning. The TFOCS utilizes dual-variable updates and first-order approaches for TV minimization without the need to compute and store the enlarged Hessian matrix required for Newton update in the QP technique. To evaluate the effectiveness and efficiency of the proposed method, two clinical cases were used for IMRT inverse planning: a head and neck case and a prostate case. For comparison, the conventional QP-based method for the TV form was adopted to solve the fluence map optimization problem in the above two cases. The convergence criteria and algorithm parameters were selected to achieve similar dose conformity for a fair comparison between the two methods. Compared with conventional QP-based approach, the proposed TFOCS-based method shows a remarkable improvement in computational efficiency for fluence map optimization, while maintaining the conformal dose distribution. Compared with QP-based algorithms, the computational speed using TFOCS for fluence optimization is increased by a factor of 4 to 6, and at the same time the memory requirement is reduced by a factor of 3 to 4. Therefore, TFOCS provides an effective, fast and memory-efficient method for IMRT inverse planning. The unique features of the approach should be particularly important in inverse planning involving a large number of beams, such as in VMAT and dense angularly sampled and sparse intensity modulated radiation therapy (DASSIM-RT).
Energy Technology Data Exchange (ETDEWEB)
Margot Gerritsen
2008-10-31
Gas-injection processes are widely and increasingly used for enhanced oil recovery (EOR). In the United States, for example, EOR production by gas injection accounts for approximately 45% of total EOR production and has tripled since 1986. The understanding of the multiphase, multicomponent flow taking place in any displacement process is essential for successful design of gas-injection projects. Due to complex reservoir geometry, reservoir fluid properties and phase behavior, the design of accurate and efficient numerical simulations for the multiphase, multicomponent flow governing these processes is nontrivial. In this work, we developed, implemented and tested a streamline based solver for gas injection processes that is computationally very attractive: as compared to traditional Eulerian solvers in use by industry it computes solutions with a computational speed orders of magnitude higher and a comparable accuracy provided that cross-flow effects do not dominate. We contributed to the development of compositional streamline solvers in three significant ways: improvement of the overall framework allowing improved streamline coverage and partial streamline tracing, amongst others; parallelization of the streamline code, which significantly improves wall clock time; and development of new compositional solvers that can be implemented along streamlines as well as in existing Eulerian codes used by industry. We designed several novel ideas in the streamline framework. First, we developed an adaptive streamline coverage algorithm. Adding streamlines locally can reduce computational costs by concentrating computational efforts where needed, and reduce mapping errors. Adapting streamline coverage effectively controls mass balance errors that mostly result from the mapping from streamlines to pressure grid. We also introduced the concept of partial streamlines: streamlines that do not necessarily start and/or end at wells. This allows more efficient coverage and avoids
Energy Technology Data Exchange (ETDEWEB)
None, None
2015-01-12
The combined team of GE Global Research, Federal Express, National Renewable Energy Laboratory, and Consolidated Edison has successfully achieved the established goals contained within the Department of Energy’s Smart Grid Capable Electric Vehicle Supply Equipment funding opportunity. The final program product, shown charging two vehicles in Figure 1, reduces by nearly 50% the total installed system cost of the electric vehicle supply equipment (EVSE) as well as enabling a host of new Smart Grid enabled features. These include bi-directional communications, load control, utility message exchange and transaction management information. Using the new charging system, Utilities or energy service providers will now be able to monitor transportation related electrical loads on their distribution networks, send load control commands or preferences to individual systems, and then see measured responses. Installation owners will be able to authorize usage of the stations, monitor operations, and optimally control their electricity consumption. These features and cost reductions have been developed through a total system design solution.
A fast Laplace solver approach to pore scale permeability
Arns, Christoph; Adler, Pierre
2017-04-01
alpha=0.5. Third, the most important test was performed on two types of real media that were used for previous studies. A fracture network measured by FIB/SEM in a low permeability sandstone was used for that purpose; the two dimensionless permeabilities KS and KL are equal to 9.3d-3 and 8.5d-3. Similar calculations were performed on 256 samples of Fontainebleau sandstones and the agreement was in general excellent, except may be for very low permeabilities. To conclude, the Laplace solver is significantly more stable than the lattice Boltzmann approach, uses less memory, and is significantly faster. Permeabilities are in excellent agreement over a wide range of porosities.
Power grid complex network evolutions for the smart grid
Pagani, Giuliano Andrea; Aiello, Marco
2014-01-01
The shift towards an energy grid dominated by prosumers (consumers and producers of energy) will inevitably have repercussions on the electricity distribution infrastructure. Today the grid is a hierarchical one delivering energy from large scale facilities to end-users. Tomorrow it will be a
From the grid to the smart grid, topologically
Pagani, Giuliano Andrea; Aiello, Marco
2016-05-01
In its more visionary acceptation, the smart grid is a model of energy management in which the users are engaged in producing energy as well as consuming it, while having information systems fully aware of the energy demand-response of the network and of dynamically varying prices. A natural question is then: to make the smart grid a reality will the distribution grid have to be upgraded? We assume a positive answer to the question and we consider the lower layers of medium and low voltage to be the most affected by the change. In our previous work, we analyzed samples of the Dutch distribution grid (Pagani and Aiello, 2011) and we considered possible evolutions of these using synthetic topologies modeled after studies of complex systems in other technological domains (Pagani and Aiello, 2014). In this paper, we take an extra important step by defining a methodology for evolving any existing physical power grid to a good smart grid model, thus laying the foundations for a decision support system for utilities and governmental organizations. In doing so, we consider several possible evolution strategies and apply them to the Dutch distribution grid. We show how increasing connectivity is beneficial in realizing more efficient and reliable networks. Our proposal is topological in nature, enhanced with economic considerations of the costs of such evolutions in terms of cabling expenses and economic benefits of evolving the grid.
Gas without grid; Gas ohne Netz
Energy Technology Data Exchange (ETDEWEB)
Janzing, Bernward
2009-07-15
The author of the contribution under consideration reports on the increasing use of liquid gas in the energy supply for a house (liquid petroleum gas) and for motor vehicles (autogas). The composition of liquid gas, its characteristics and storage are described. The quality requirements at liquid gas are in accordance with DIN 51622 (heating gas) and DIN EN 589 (autogas). At present, nearly 600,000 households in the Federal Republic of Germany use liquid gas because their plot of land is not attached to the natural gas grid. Within the range of camping different mixtures of gases are offered as liquid gas depending upon the range of application.
Solving the linear radiation problem using a volume method on an overset grid
DEFF Research Database (Denmark)
Read, Robert; Bingham, Harry B.
2012-01-01
-block methodology developed previously is applied to multiple, overlapping grid blocks using the overset approach. While the ultimate aim of this work is to model fully non-linear wave-structure interaction, a linear solver has been initially implemented to permit the use of a fixed grid, and to allow comparison......-differencebased, potentialow model to represent the propagation of fully non-linear waves in coastal regions of varying bathymetry. The present objective is to develop this methodology to include the presence of a oating structure. To represent the curvilinear boundaries of the structure and the bottom, the single......This paper describes recent progress towards the development of a computational tool, based on potential ow theory, that can accurately and effciently simulate wave-induced loadings on marine structures. Engsig-Karup et al. (2009) have successfully developed an arbitrary-order, finite...
The Grid2003 Production Grid Principles and Practice
Foster, I; Gose, S; Maltsev, N; May, E; Rodríguez, A; Sulakhe, D; Vaniachine, A; Shank, J; Youssef, S; Adams, D; Baker, R; Deng, W; Smith, J; Yu, D; Legrand, I; Singh, S; Steenberg, C; Xia, Y; Afaq, A; Berman, E; Annis, J; Bauerdick, L A T; Ernst, M; Fisk, I; Giacchetti, L; Graham, G; Heavey, A; Kaiser, J; Kuropatkin, N; Pordes, R; Sekhri, V; Weigand, J; Wu, Y; Baker, K; Sorrillo, L; Huth, J; Allen, M; Grundhoefer, L; Hicks, J; Luehring, F C; Peck, S; Quick, R; Simms, S; Fekete, G; Van den Berg, J; Cho, K; Kwon, K; Son, D; Park, H; Canon, S; Jackson, K; Konerding, D E; Lee, J; Olson, D; Sakrejda, I; Tierney, B; Green, M; Miller, R; Letts, J; Martin, T; Bury, D; Dumitrescu, C; Engh, D; Gardner, R; Mambelli, M; Smirnov, Y; Voeckler, J; Wilde, M; Zhao, Y; Zhao, X; Avery, P; Cavanaugh, R J; Kim, B; Prescott, C; Rodríguez, J; Zahn, A; McKee, S; Jordan, C; Prewett, J; Thomas, T; Severini, H; Clifford, B; Deelman, E; Flon, L; Kesselman, C; Mehta, G; Olomu, N; Vahi, K; De, K; McGuigan, P; Sosebee, M; Bradley, D; Couvares, P; De Smet, A; Kireyev, C; Paulson, E; Roy, A; Koranda, S; Moe, B; Brown, B; Sheldon, P
2004-01-01
The Grid2003 Project has deployed a multi-virtual organization, application-driven grid laboratory ("GridS") that has sustained for several months the production-level services required by physics experiments of the Large Hadron Collider at CERN (ATLAS and CMS), the Sloan Digital Sky Survey project, the gravitational wave search experiment LIGO, the BTeV experiment at Fermilab, as well as applications in molecular structure analysis and genome analysis, and computer science research projects in such areas as job and data scheduling. The deployed infrastructure has been operating since November 2003 with 27 sites, a peak of 2800 processors, work loads from 10 different applications exceeding 1300 simultaneous jobs, and data transfers among sites of greater than 2 TB/day. We describe the principles that have guided the development of this unique infrastructure and the practical experiences that have resulted from its creation and use. We discuss application requirements for grid services deployment and configur...
The more the merrier: grid based modelling of Kepler dwarfs with 5-dimensional stellar grids
Directory of Open Access Journals (Sweden)
Serenelli Aldo
2017-01-01
Full Text Available We present preliminary results of our grid based modelling (GBM of the dwarf/subgiant sample of stars observed with Kepler including global asteroseismic parameters. GBM analysis in this work is based on a large grid of stellar models that is characterized by five independent parameters: model mass and age, initial metallicity (Zini, initial helium (Yini, and mixing length parameter (αMLT. Using this grid relaxes assumptions used in all previous GBM work where the initial composition is determined by a single parameter and that αMLT is fixed to a solar-calibrated value. The new grid allows us to study, for example, the impact of different galactic chemical enrichment models on the determination of stellar parameters such as mass radius and age. Also, it allows to include new results from stellar atmosphere models on αMLT in the GBM analysis in a simple manner. Alternatively, it can be tested if global asteroseismology is a useful tool to constraint our ignorance on quantities such as Yini and αMLT. Initial findings show that mass determination is robust with respect to freedom in the latter quantities, with a 4.4% maximum deviation for extreme assumptions regarding prior information on Yini – Zini relations and aMLT. On the other hand, tests carried out so far seem to indicate that global seismology does not have much power to constrain Yini – Zni relations of αMLT values without resourcing to additional information.
The more the merrier: grid based modelling of Kepler dwarfs with 5-dimensional stellar grids
Serenelli, Aldo; Chaplin, William J.; Huber, Daniel
2017-10-01
We present preliminary results of our grid based modelling (GBM) of the dwarf/subgiant sample of stars observed with Kepler including global asteroseismic parameters. GBM analysis in this work is based on a large grid of stellar models that is characterized by five independent parameters: model mass and age, initial metallicity (Zini), initial helium (Yini), and mixing length parameter (αMLT). Using this grid relaxes assumptions used in all previous GBM work where the initial composition is determined by a single parameter and that αMLT is fixed to a solar-calibrated value. The new grid allows us to study, for example, the impact of different galactic chemical enrichment models on the determination of stellar parameters such as mass radius and age. Also, it allows to include new results from stellar atmosphere models on αMLT in the GBM analysis in a simple manner. Alternatively, it can be tested if global asteroseismology is a useful tool to constraint our ignorance on quantities such as Yini and αMLT. Initial findings show that mass determination is robust with respect to freedom in the latter quantities, with a 4.4% maximum deviation for extreme assumptions regarding prior information on Yini - Zini relations and aMLT. On the other hand, tests carried out so far seem to indicate that global seismology does not have much power to constrain Yini - Zni relations of αMLT values without resourcing to additional information.
Stabilized index-2 co-simulation approach for solver coupling with algebraic constraints
Energy Technology Data Exchange (ETDEWEB)
Schweizer, Bernhard, E-mail: schweizer@sds.tu-darmstadt.de; Lu, Daixing [Technical University Darmstadt, Department of Mechanical Engineering, Institute of Structural Dynamics (Germany)
2015-06-15
In the paper at hand, a co-simulation method on index-2 level is presented and analyzed. To explain the method, we consider two arbitrary mechanical subsystems, which are coupled by algebraic constraint equations, i.e., by means of ideal rigid joints. It is assumed that each subsystem has its own solver, integrating independently from the other subsystem solver. Both solvers are coupled by a weak coupling approach.The initial point of the method investigated here is a formulation of the coupled problem on the basis of the stabilized index-2 formulation, which takes simultaneously into account the constraint equations on position level and—by introducing additional Lagrange multipliers—also the constraint equations on velocity level. The presented co-simulation method is based on a predictor/corrector approach. The Jacobian matrix for calculating corrected coupling variables can in a straightforward manner be calculated numerically and in parallel with the predictor step so that almost no additional computation time is required. For the corrector step, the macro-time step has to be repeated once. Therefore, the subsystem solvers have to be reinitialized at the previous macro-time point. This is the only elementary requirement on the subsystem solvers.
Balancing Energy and Performance in Dense Linear System Solvers for Hybrid ARM+GPU platforms
Directory of Open Access Journals (Sweden)
Juan P. Silva
2016-04-01
Full Text Available The high performance computing community has traditionally focused uniquely on the reduction of execution time, though in the last years, the optimization of energy consumption has become a main issue. A reduction of energy usage without a degradation of performance requires the adoption of energy-efficient hardware platforms accompanied by the development of energy-aware algorithms and computational kernels. The solution of linear systems is a key operation for many scientific and engineering problems. Its relevance has motivated an important amount of work, and consequently, it is possible to find high performance solvers for a wide variety of hardware platforms. In this work, we aim to develop a high performance and energy-efficient linear system solver. In particular, we develop two solvers for a low-power CPU-GPU platform, the NVIDIA Jetson TK1. These solvers implement the Gauss-Huard algorithm yielding an efficient usage of the target hardware as well as an efficient memory access. The experimental evaluation shows that the novel proposal reports important savings in both time and energy-consumption when compared with the state-of-the-art solvers of the platform.
Pordes, Ruth; Olson, Doug; Livny, Miron; Roy, Alain; Avery, Paul; Blackburn, Kent; Wenaus, Torre; Wuerthwein, Frank K.; Gardner, Rob; Wilde, Mike; Blatecky, Alan; McGee, John; Quick, Rob
2007-01-01
The Open Science Grid (OSG) provides a distributed facility where the Consortium members provide guaranteed and opportunistic access to shared computing and storage resources. OSG provides support for and evolution of the infrastructure through activities that cover operations, security, software, troubleshooting, addition of new capabilities, and support for existing and engagement with new communities. The OSG SciDAC-2 project provides specific activities to manage and evolve the distributed infrastructure and support it's use. The innovative aspects of the project are the maintenance and performance of a collaborative (shared & common) petascale national facility over tens of autonomous computing sites, for many hundreds of users, transferring terabytes of data a day, executing tens of thousands of jobs a day, and providing robust and usable resources for scientific groups of all types and sizes. More information can be found at the OSG web site: www.opensciencegrid.org.
Energy Technology Data Exchange (ETDEWEB)
Pordes, Ruth; /Fermilab; Kramer, Bill; Olson, Doug; / /LBL, Berkeley; Livny, Miron; Roy, Alain; /Wisconsin U., Madison; Avery, Paul; /Florida U.; Blackburn, Kent; /Caltech; Wenaus, Torre; /Brookhaven; Wurthwein, Frank; /UC, San Diego; Gardner, Rob; Wilde, Mike; /Chicago U. /Indiana U.
2007-06-01
The Open Science Grid (OSG) provides a distributed facility where the Consortium members provide guaranteed and opportunistic access to shared computing and storage resources. OSG provides support for and evolution of the infrastructure through activities that cover operations, security, software, troubleshooting, addition of new capabilities, and support for existing and engagement with new communities. The OSG SciDAC-2 project provides specific activities to manage and evolve the distributed infrastructure and support its use. The innovative aspects of the project are the maintenance and performance of a collaborative (shared & common) petascale national facility over tens of autonomous computing sites, for many hundreds of users, transferring terabytes of data a day, executing tens of thousands of jobs a day, and providing robust and usable resources for scientific groups of all types and sizes. More information can be found at the OSG web site: www.opensciencegrid.org.
Monitoring of Grid scientific workflows
Balis, B.; Bubak, M.; Łabno, B.
2008-01-01
Scientific workflows are a means of conducting in silico experiments in modern computing infrastructures for e-Science, often built on top of Grids. Monitoring of Grid scientific workflows is essential not only for performance analysis but also to collect provenance data and gather feedback useful
Wind Turbine Providing Grid Support
DEFF Research Database (Denmark)
2011-01-01
A variable speed wind turbine is arranged to provide additional electrical power to counteract non-periodic disturbances in an electrical grid. A controller monitors events indicating a need to increase the electrical output power from the wind turbine to the electrical grid. The controller...
Begeman, Kor; Belikov, Andrey N.; Dijkstra, Fokke; Meyer-Zhao, Zheng; Valentijn, Edwin A.; Vriend, Willem-Jan
The paper reviews the Astro-WISE infrastructure and demonstrates that the Astro-WISE Information System provides a Grid itself. We describe the integration of Astro-WISE with an external Grid infrastructure (BiGGrid). The integration is performed on all infrastructural layers (data storage, metadata
Blake, Robert R.; Mouton, Jane Srygley
1978-01-01
Authors reexamine assumptions formulated in the early years of their Managerial Grid and test them against what is known today. Focus is on managerial motivations and industrial leadership. Includes a table which categorizes varied multi-disciplinary approaches to leadership using the Grid framework. (EM)
Koç, Y.
2015-01-01
Current and future trends in environmental, economical, and human-caused factors (such as power demand growth, over-ageing of assets in power grids, and extreme weather conditions) challenge power grid robustness in the near future, necessitating research to better analyse and understand the notion
Smart Grid Communication Middleware Comparison
DEFF Research Database (Denmark)
Petersen, Bo Søborg; Bindner, Henrik W.; Poulsen, Bjarne
2017-01-01
are possible by their performance, which is limited by the middleware characteristics, primarily interchangeable serialization and the Publish-Subscribe messaging pattern. The earlier paper “Smart Grid Serialization Comparison” (Petersen et al. 2017) aids in the choice of serialization, which has a big impact...... the strongest candidates for Smart Grid distributed control, but WAMP should also be considered in the future....
DEFF Research Database (Denmark)
Lunde, Morten; Røpke, Inge; Heiskanen, Eva
2016-01-01
how their (intentional or unintentional) choices serve to create or maintain certain boundaries in smart grid development: for example, an exclusive focus on electricity within the broader context of a sustainable energy system. As serious investment starts being made in the smart grid, concepts like...
Smart Grid Control and Communication
DEFF Research Database (Denmark)
Ciontea, Catalin-Iosif; Pedersen, Rasmus; Kristensen, Thomas le Fevre
2015-01-01
) and the quality of the power may become costly. In this light, Smart Grids may provide an answer towards a more active and efficient electrical network. The EU project SmartC2Net aims to enable smart grid operations over imperfect, heterogeneous general purpose networks, which poses a significant challenge...... to the reliability due to the stochastic behavior found in such networks. Therefore, key concepts are presented in this paper targeting the support of proper smart grid control in these network environments and its Real-Time Hardware-In-the Loop (HIL) verification. An overview on the required Information......The expected growth in distributed generation will significantly affect the operation and control of today's distribution grids. Being confronted with fast fluctuating power from distributed generations, the assurance of a reliable service (grid stability, avoidance of energy losses...
Andrade, Pedro
2008-01-01
gCube is a service-based framework for eScience applications requiring collaboratory, on-demand, and intensive information processing. It provides to these communities Virtual Research Environments (VREs) to support their activities. gCube is build on top of standard technologies for computational Grids, namely the gLite middleware. The software was produced by the DILIGENT project and will continue to be supported and further developed by the D4Science project. gCube reflects within its name a three-sided interpretation of the Grid vision of resource sharing: sharing of computational resources, sharing of structured data, and sharing of application services. As such, gCube embodies the defining characteristics of computational Grids, data Grids, and virtual data Grids. Precisely, it builds on gLite middleware for managing distributed computations and unstructured data, includes dedicated services for managing data and metadata, provides services for distributed information retrieval, allows the orchestration...
DEFF Research Database (Denmark)
Rodríguez, P.; Luna, A.; Muñoz-Aguilar, R. S.
2012-01-01
Grid synchronization algorithms are of great importance in the control of grid-connected power converters, as fast and accurate detection of the grid voltage parameters is crucial in order to implement stable control strategies under generic grid conditions. This paper presents a new grid...... of the instantaneous symmetrical components of the grid voltage under unbalanced and distorted grid conditions. This paper analyzes the performance of the proposed synchronization method including different design issues. Moreover, the behavior of the method for synchronizing with highly unbalanced grid is proven...
Final Report: Subcontract B623868 Algebraic Multigrid solvers for coupled PDE systems
Energy Technology Data Exchange (ETDEWEB)
Brannick, J. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2017-10-17
The Pennsylvania State University (“Subcontractor”) continued to work on the design of algebraic multigrid solvers for coupled systems of partial differential equations (PDEs) arising in numerical modeling of various applications, with a main focus on solving the Dirac equation arising in Quantum Chromodynamics (QCD). The goal of the proposed work was to develop combined geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers for these QCD systems. The research in these areas built on previous works, focusing on the following three topics: (1) the development of parallel full-multigrid (PFMG) and non-Galerkin coarsening techniques in this frame work for solving the Wilson Dirac system; (2) the use of these same Wilson MG solvers for preconditioning the Overlap and Domain Wall formulations of the Dirac equation; and (3) the design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity.
Energy Technology Data Exchange (ETDEWEB)
Secher, Bernard [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SFME/LGLS, Bat. 454, F-91191 Gif-sur-Yvette Cedex (France)], E-mail: bsecher@cea.fr; Belliard, Michel [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Cadarache DER/SSTH/LMDL, Bat. 238, F-13108 Saint-Paul-lez-Durance Cedex (France); Calvin, Christophe [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SERMA/LLPR, Bat. 470, F-91191 Gif-sur-Yvette Cedex (France)
2009-01-15
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost.
Gao, Hao; Phan, Lan; Lin, Yuting
2012-09-01
A graphics processing unit-based parallel multigrid solver for a radiative transfer equation with vacuum boundary condition or reflection boundary condition is presented for heterogeneous media with complex geometry based on two-dimensional triangular meshes or three-dimensional tetrahedral meshes. The computational complexity of this parallel solver is linearly proportional to the degrees of freedom in both angular and spatial variables, while the full multigrid method is utilized to minimize the number of iterations. The overall gain of speed is roughly 30 to 300 fold with respect to our prior multigrid solver, which depends on the underlying regime and the parallelization. The numerical validations are presented with the MATLAB codes at https://sites.google.com/site/rtefastsolver/.
A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements
Chávez, Gustavo
2017-03-17
A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.
Sensing and Measurement Architecture for Grid Modernization
Energy Technology Data Exchange (ETDEWEB)
Taft, Jeffrey D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); De Martini, Paul [California Inst. of Technology (CalTech), Pasadena, CA (United States)
2016-02-01
This paper addresses architecture for grid sensor networks, with primary emphasis on distribution grids. It describes a forward-looking view of sensor network architecture for advanced distribution grids, and discusses key regulatory, financial, and planning issues.
Global Population Density Grid Time Series Estimates
National Aeronautics and Space Administration — Global Population Density Grid Time Series Estimates provide a back-cast time series of population density grids based on the year 2000 population grid from SEDAC's...
Global Population Count Grid Time Series Estimates
National Aeronautics and Space Administration — Global Population Count Grid Time Series Estimates provide a back-cast time series of population grids based on the year 2000 population grid from SEDAC's Global...
Conductive grid patterns prepared by microcontact printing silver nanoparticles ink
Xin, Zhiqing; Liu, Yu; Li, Xiu; Liu, Shili; Fang, Yi; Deng, Yongqiang; Bao, Chao; Li, Luhai
2017-01-01
Metal grid transparent conductive electrodes have been developed by traditional printing techniques, but lower resolution of grid line has limited its performance. In this study, conductive grid patterns with ~10 µm width were created on the polyethylene terephthalate (PET) substrate by microcontact printing (µCP) silver nanoparticles ink. We have found that the composition of silver nanoparticles ink and the O2 plasma treated time of polydimethylsiloxane (PDMS) stamp were critical for the µCP process. Specially, the hole size of stamp has great influence on the patterns shape when using grid-structured stamp. This is because the break of liquid bridge formed between two adjacent lines of stamp depends on the hole size of stamp during the dry process of ink. Larger hole was beneficial for the formation of grid patterns with smooth edge. Conductive grid patterns with typical sheet resistance of 610 Ω/□ and 74% transparency were acquired over the entire 1 cm square area using 40 µm hole stamp. This method will lead to a facile strategy to prepare conductive electrode.
Grid simulator for power quality assessment of micro-grids
DEFF Research Database (Denmark)
Carrasco, Joaquin Eloy Garcia; Vasquez, Juan Carlos; Guerrero, Josep M.
2013-01-01
In this study, a grid simulator based on a back-to-back inverter topology with resonant controllers is presented. The simulator is able to generate three-phase voltages for a range of amplitudes and frequencies with different types of perturbations, such as voltage sags, steady-state unbalanced...... voltages, low-order harmonics and flicker. The aim of this equipment is to test the performance of a given system under such distorted voltages. A prototype of the simulator, consisting of two inverters connected back-to-back to a 380 V three-phase grid and feeding a micro-grid composed of two...
Smart grid security innovative solutions for a modernized grid
Skopik, Florian
2015-01-01
The Smart Grid security ecosystem is complex and multi-disciplinary, and relatively under-researched compared to the traditional information and network security disciplines. While the Smart Grid has provided increased efficiencies in monitoring power usage, directing power supplies to serve peak power needs and improving efficiency of power delivery, the Smart Grid has also opened the way for information security breaches and other types of security breaches. Potential threats range from meter manipulation to directed, high-impact attacks on critical infrastructure that could bring down regi
Notes on Newton-Krylov based Incompressible Flow Projection Solver
Energy Technology Data Exchange (ETDEWEB)
Robert Nourgaliev; Mark Christon; J. Bakosi
2012-09-01
The purpose of the present document is to formulate Jacobian-free Newton-Krylov algorithm for approximate projection method used in Hydra-TH code. Hydra-TH is developed by Los Alamos National Laboratory (LANL) under the auspices of the Consortium for Advanced Simulation of Light-Water Reactors (CASL) for thermal-hydraulics applications ranging from grid-to-rod fretting (GTRF) to multiphase flow subcooled boiling. Currently, Hydra-TH is based on the semi-implicit projection method, which provides an excellent platform for simulation of transient single-phase thermalhydraulics problems. This algorithm however is not efficient when applied for very slow or steady-state problems, as well as for highly nonlinear multiphase problems relevant to nuclear reactor thermalhydraulics with boiling and condensation. These applications require fully-implicit tightly-coupling algorithms. The major technical contribution of the present report is the formulation of fully-implicit projection algorithm which will fulfill this purpose. This includes the definition of non-linear residuals used for GMRES-based linear iterations, as well as physics-based preconditioning techniques.
Quantum Monte Carlo with a stochastic Poisson solver
Das, Dyutiman
Quantum Monte Carlo (QMC) is an extremely powerful method to treat many-body systems. Usually QMC has been applied in cases where the interaction potential has a simple analytic form, like the 1/r Coulomb potential. However, in a complicated environment as in a semiconductor heterostructure, the evaluation of the interaction itself becomes a non-trivial problem. Obtaining the potential from any grid-based finite-difference method, for every walker and every step is unfeasible. We demonstrate an alternative approach of solving the Poisson equation by a classical Monte Carlo within the overall QMC scheme. We have developed a modified "Walk On Spheres" (WOS) algorithm using Green's function techniques, which can efficiently account for the interaction energy of walker configurations, typical of QMC algorithms. This stochastically obtained potential can be easily incorporated within popular QMC techniques like variational Monte Carlo (VMC) or diffusion Monte Carlo(DMC). We demonstrate the validity of this method by studying a simple problem, the polarization of a helium atom in the electric field of an infinite capacitor. Then we apply this method to calculate the singlet-triplet splitting in a realistic heterostructure device. We also outline some other prospective applications for spherical quantum dots where the dielectric mismatch becomes an important issue for the addition energy spectrum.
Energy Technology Data Exchange (ETDEWEB)
Nelson, Eric Michael [Stanford Univ., CA (United States)
1993-12-01
Some two-dimensional finite element electromagnetic field solvers are described and tested. For TE and TM modes in homogeneous cylindrical waveguides and monopole modes in homogeneous axisymmetric structures, the solvers find approximate solutions to a weak formulation of the wave equation. Second-order isoparametric lagrangian triangular elements represent the field. For multipole modes in axisymmetric structures, the solver finds approximate solutions to a weak form of the curl-curl formulation of Maxwell`s equations. Second-order triangular edge elements represent the radial (ρ) and axial (z) components of the field, while a second-order lagrangian basis represents the azimuthal (Φ) component of the field weighted by the radius ρ. A reduced set of basis functions is employed for elements touching the axis. With this basis the spurious modes of the curl-curl formulation have zero frequency, so spurious modes are easily distinguished from non-static physical modes. Tests on an annular ring, a pillbox and a sphere indicate the solutions converge rapidly as the mesh is refined. Computed eigenvalues with relative errors of less than a few parts per million are obtained. Boundary conditions for symmetric, periodic and symmetric-periodic structures are discussed and included in the field solver. Boundary conditions for structures with inversion symmetry are also discussed. Special corner elements are described and employed to improve the accuracy of cylindrical waveguide and monopole modes with singular fields at sharp corners. The field solver is applied to three problems: (1) cross-field amplifier slow-wave circuits, (2) a detuned disk-loaded waveguide linear accelerator structure and (3) a 90° overmoded waveguide bend. The detuned accelerator structure is a critical application of this high accuracy field solver. To maintain low long-range wakefields, tight design and manufacturing tolerances are required.
Panday, Sorab; Langevin, Christian D.; Niswonger, Richard G.; Ibaraki, Motomu; Hughes, Joseph D.
2013-01-01
A new version of MODFLOW, called MODFLOW–USG (for UnStructured Grid), was developed to support a wide variety of structured and unstructured grid types, including nested grids and grids based on prismatic triangles, rectangles, hexagons, and other cell shapes. Flexibility in grid design can be used to focus resolution along rivers and around wells, for example, or to subdiscretize individual layers to better represent hydrostratigraphic units. MODFLOW–USG is based on an underlying control volume finite difference (CVFD) formulation in which a cell can be connected to an arbitrary number of adjacent cells. To improve accuracy of the CVFD formulation for irregular grid-cell geometries or nested grids, a generalized Ghost Node Correction (GNC) Package was developed, which uses interpolated heads in the flow calculation between adjacent connected cells. MODFLOW–USG includes a Groundwater Flow (GWF) Process, based on the GWF Process in MODFLOW–2005, as well as a new Connected Linear Network (CLN) Process to simulate the effects of multi-node wells, karst conduits, and tile drains, for example. The CLN Process is tightly coupled with the GWF Process in that the equations from both processes are formulated into one matrix equation and solved simultaneously. This robustness results from using an unstructured grid with unstructured matrix storage and solution schemes. MODFLOW–USG also contains an optional Newton-Raphson formulation, based on the formulation in MODFLOW–NWT, for improving solution convergence and avoiding problems with the drying and rewetting of cells. Because the existing MODFLOW solvers were developed for structured and symmetric matrices, they were replaced with a new Sparse Matrix Solver (SMS) Package developed specifically for MODFLOW–USG. The SMS Package provides several methods for resolving nonlinearities and multiple symmetric and asymmetric linear solution schemes to solve the matrix arising from the flow equations and the Newton
Application of FUN3D Solver for Aeroacoustics Simulation of a Nose Landing Gear Configuration
Vatsa, Veer N.; Lockard, David P.; Khorrami, Mehdi R.
2011-01-01
Numerical simulations have been performed for a nose landing gear configuration corresponding to the experimental tests conducted in the Basic Aerodynamic Research Tunnel at NASA Langley Research Center. A widely used unstructured grid code, FUN3D, is examined for solving the unsteady flow field associated with this configuration. A series of successively finer unstructured grids has been generated to assess the effect of grid refinement. Solutions have been obtained on purely tetrahedral grids as well as mixed element grids using hybrid RANS/LES turbulence models. The agreement of FUN3D solutions with experimental data on the same size mesh is better on mixed element grids compared to pure tetrahedral grids, and in general improves with grid refinement.
Fast immersed interface Poisson solver for 3D unbounded problems around arbitrary geometries
Gillis, T.; Winckelmans, G.; Chatelain, P.
2018-02-01
We present a fast and efficient Fourier-based solver for the Poisson problem around an arbitrary geometry in an unbounded 3D domain. This solver merges two rewarding approaches, the lattice Green's function method and the immersed interface method, using the Sherman-Morrison-Woodbury decomposition formula. The method is intended to be second order up to the boundary. This is verified on two potential flow benchmarks. We also further analyse the iterative process and the convergence behavior of the proposed algorithm. The method is applicable to a wide range of problems involving a Poisson equation around inner bodies, which goes well beyond the present validation on potential flows.
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe
2013-05-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
Identification of severe wind conditions using a Reynolds averaged Navier-Stokes solver
DEFF Research Database (Denmark)
Sørensen, Niels N.; Bechmann, Andreas; Johansen, Jeppe
2007-01-01
The present paper describes the application of a Navier-Stokes solver to predict the presence of severe flow conditions in complex terrain, capturing conditions that may be critical to the siting of wind turbines in the terrain. First it is documented that the flow solver is capable of predicting...... the flow in the complex terrain by comparing with measurements from two meteorology masts. Next, it is illustrated how levels of turbulent kinetic energy can be used to easily identify areas with severe flow conditions, relying on a high correlation between high turbulence intensity and severe flow...
Collier, Nathan
2012-03-01
We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.
García-Risueño, Pablo; Alberdi-Rodriguez, Joseba; Oliveira, Micael J T; Andrade, Xavier; Pippig, Michael; Muguerza, Javier; Arruabarrena, Agustin; Rubio, Angel
2014-03-05
We present an analysis of different methods to calculate the classical electrostatic Hartree potential created by charge distributions. Our goal is to provide the reader with an estimation on the performance-in terms of both numerical complexity and accuracy-of popular Poisson solvers, and to give an intuitive idea on the way these solvers operate. Highly parallelizable routines have been implemented in a first-principle simulation code (Octopus) to be used in our tests, so that reliable conclusions about the capability of methods to tackle large systems in cluster computing can be obtained from our work. Copyright © 2013 Wiley Periodicals, Inc.
Galerkin CFD solvers for use in a multi-disciplinary suite for modeling advanced flight vehicles
Moffitt, Nicholas J.
This work extends existing Galerkin CFD solvers for use in a multi-disciplinary suite. The suite is proposed as a means of modeling advanced flight vehicles, which exhibit strong coupling between aerodynamics, structural dynamics, controls, rigid body motion, propulsion, and heat transfer. Such applications include aeroelastics, aeroacoustics, stability and control, and other highly coupled applications. The suite uses NASA STARS for modeling structural dynamics and heat transfer. Aerodynamics, propulsion, and rigid body dynamics are modeled in one of the five CFD solvers below. Euler2D and Euler3D are Galerkin CFD solvers created at OSU by Cowan (2003). These solvers are capable of modeling compressible inviscid aerodynamics with modal elastics and rigid body motion. This work reorganized these solvers to improve efficiency during editing and at run time. Simple and efficient propulsion models were added, including rocket, turbojet, and scramjet engines. Viscous terms were added to the previous solvers to create NS2D and NS3D. The viscous contributions were demonstrated in the inertial and non-inertial frames. Variable viscosity (Sutherland's equation) and heat transfer boundary conditions were added to both solvers but not verified in this work. Two turbulence models were implemented in NS2D and NS3D: Spalart-Allmarus (SA) model of Deck, et al. (2002) and Menter's SST model (1994). A rotation correction term (Shur, et al., 2000) was added to the production of turbulence. Local time stepping and artificial dissipation were adapted to each model. CFDsol is a Taylor-Galerkin solver with an SA turbulence model. This work improved the time accuracy, far field stability, viscous terms, Sutherland?s equation, and SA model with NS3D as a guideline and added the propulsion models from Euler3D to CFDsol. Simple geometries were demonstrated to utilize current meshing and processing capabilities. Air-breathing hypersonic flight vehicles (AHFVs) represent the ultimate
Energy Technology Data Exchange (ETDEWEB)
Beaulieu, R A
2009-07-13
The United States repeatedly experiences floods along the Midwest's large rivers and droughts in the arid Western States that cause traumatic environmental conditions with huge economic impact. With an integrated approach and solution these problems can be alleviated. Tapping into the Mississippi River and its tributaries, the world's third largest fresh water river system, during flood events will mitigate the damage of flooding and provide a new source of fresh water to the Western States. The trend of increased flooding on the Midwest's large rivers is supported by a growing body of scientific literature. The Colorado River Basin and the western states are experiencing a protracted multi-year drought. Fresh water can be pumped via pipelines from areas of overabundance/flood to areas of drought or high demand. Calculations document 10 to 60 million acre-feet (maf) of fresh water per flood event can be captured from the Midwest's Rivers and pumped via pipelines to the Colorado River and introduced upstream of Lake Powell, Utah, to destinations near Denver, Colorado, and used in areas along the pipelines. Water users of the Colorado River include the cities in southern Nevada, southern California, northern Arizona, Colorado, Utah, Indian Tribes, and Mexico. The proposed start and end points, and routes of the pipelines are documented, including information on right-of-ways necessary for state and federal permits. A National Smart Water Grid{trademark} (NSWG) Project will create thousands of new jobs for construction, operation, and maintenance and save billions in drought and flood damage reparations tax dollars. The socio-economic benefits of NWSG include decreased flooding in the Midwest; increased agriculture, and recreation and tourism; improved national security, transportation, and fishery and wildlife habitats; mitigated regional climate change and global warming such as increased carbon capture; decreased salinity in Colorado River water
Constructing the ASCI computational grid
Energy Technology Data Exchange (ETDEWEB)
BEIRIGER,JUDY I.; BIVENS,HUGH P.; HUMPHREYS,STEVEN L.; JOHNSON,WILBUR R.; RHEA,RONALD E.
2000-06-01
The Accelerated Strategic Computing Initiative (ASCI) computational grid is being constructed to interconnect the high performance computing resources of the nuclear weapons complex. The grid will simplify access to the diverse computing, storage, network, and visualization resources, and will enable the coordinated use of shared resources regardless of location. To match existing hardware platforms, required security services, and current simulation practices, the Globus MetaComputing Toolkit was selected to provide core grid services. The ASCI grid extends Globus functionality by operating as an independent grid, incorporating Kerberos-based security, interfacing to Sandia's Cplant{trademark},and extending job monitoring services. To fully meet ASCI's needs, the architecture layers distributed work management and criteria-driven resource selection services on top of Globus. These services simplify the grid interface by allowing users to simply request ''run code X anywhere''. This paper describes the initial design and prototype of the ASCI grid.
The Grid Resource Broker, A Ubiquitous Grid Computing Framework
Directory of Open Access Journals (Sweden)
Giovanni Aloisio
2002-01-01
Full Text Available Portals to computational/data grids provide the scientific community with a friendly environment in order to solve large-scale computational problems. The Grid Resource Broker (GRB is a grid portal that allows trusted users to create and handle computational/data grids on the fly exploiting a simple and friendly web-based GUI. GRB provides location-transparent secure access to Globus services, automatic discovery of resources matching the user's criteria, selection and scheduling on behalf of the user. Moreover, users are not required to learn Globus and they do not need to write specialized code or to rewrite their existing legacy codes. We describe GRB architecture, its components and current GRB features addressing the main differences between our approach and related work in the area.
Profitability of smart grid solutions applied in power grid
Directory of Open Access Journals (Sweden)
Katić Nenad A.
2016-01-01
Full Text Available The idea of a Smart Grid solution has been developing for years, as complete solution for a power utility, consisting of different advanced technologies aimed at improving of the efficiency of operation. The trend of implementing various smart systems continues, e.g. Energy Management Systems, Grid Automation Systems, Advanced Metering Infrastructure, Smart power equipment, Distributed Energy Resources, Demand Response systems, etc. Futhermore, emerging technologies, such as energy storages, electrical vehicles or distributed generators, become integrated in distribution networks and systems. Nowadays, the idea of a Smart Grid solution becomes more realistic by full integration of all advanced operation technologies (OT within IT environment, providing the complete digitalization of an Utility (IT/OT integration. The overview of smart grid solutions, estimation of investments, operation costs and possible benefits are presented in this article, with discusison about profitability of such systems.
Buildings-to-Grid Technical Opportunities: From the Grid Perspective
Energy Technology Data Exchange (ETDEWEB)
Kropski, Ben [National Renewable Energy Lab. (NREL), Golden, CO (United States); Pratt, Rob [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2014-03-28
This paper outlines the nature of the power grid, lists challenges and barriers to the implementation of a transactive energy ecosystem, and provides concept solutions to current technological impediments.
Stable grid refinement and singular source discretization for seismic wave simulations
Energy Technology Data Exchange (ETDEWEB)
Petersson, N A; Sjogreen, B
2009-10-30
An energy conserving discretization of the elastic wave equation in second order formulation is developed for a composite grid, consisting of a set of structured rectangular component grids with hanging nodes on the grid refinement interface. Previously developed summation-by-parts properties are generalized to devise a stable second order accurate coupling of the solution across mesh refinement interfaces. The discretization of singular source terms of point force and point moment tensor type are also studied. Based on enforcing discrete moment conditions that mimic properties of the Dirac distribution and its gradient, previous single grid formulas are generalized to work in the vicinity of grid refinement interfaces. These source discretization formulas are shown to give second order accuracy in the solution, with the error being essentially independent of the distance between the source and the grid refinement boundary. Several numerical examples are given to illustrate the properties of the proposed method.
Secondary emission monitor (SEM) grids.
Patrice Loïez
2002-01-01
A great variety of Secondary Emission Monitors (SEM) are used all over the PS Complex. At other accelerators they are also called wire-grids, harps, etc. They are used to measure beam density profiles (from which beam size and emittance can be derived) in single-pass locations (not on circulating beams). Top left: two individual wire-planes. Top right: a combination of a horizontal and a vertical wire plane. Bottom left: a ribbon grid in its frame, with connecting wires. Bottom right: a SEM-grid with its insertion/retraction mechanism.
A terahertz grid frequency doubler
Moussessian, Alina; Wanke, Michael C.; Li, Yongjun; Chiao, Jung-Chih; Allen, S. James; Crowe, Thomas W.; Rutledge, David B.
1998-01-01
We present a 144-element terahertz quasi-optical grid frequency doubler. The grid is a planar structure with bow-tie antennas as a unit cell, each loaded with a planar Schottky diode. The maximum output power measured for this grid is 24 mW at 1 THz for 3.1-μs 500-GHz input pulses with a peak input power of 47 W. An efficiency of 0.17% for an input power of 6.3 W and output power of 10.8 mW is measured. To date, this is the largest recorded output power for a multiplier at terahertz frequenci...
National transmission grid study
Energy Technology Data Exchange (ETDEWEB)
Abraham, Spencer [USDOE Office of the Secretary of Energy, Washington, DC (United States)
2003-05-31
The National Energy Policy Plan directed the U.S. Department of Energy (DOE) to conduct a study to examine the benefits of establishing a national electricity transmission grid and to identify transmission bottlenecks and measures to address them. DOE began by conducting an independent analysis of U.S. electricity markets and identifying transmission system bottlenecks using DOE’s Policy Office Electricity Modeling System (POEMS). DOE’s analysis, presented in Section 2, confirms the central role of the nation’s transmission system in lowering costs to consumers through increased trade. More importantly, DOE’s analysis also confirms the results of previous studies, which show that transmission bottlenecks and related transmission system market practices are adding hundreds of millions of dollars to consumers’ electricity bills each year. A more detailed technical overview of the use of POEMS is provided in Appendix A. DOE led an extensive, open, public input process and heard a wide range of comments and recommendations that have all been considered.1 More than 150 participants registered for three public workshops held in Detroit, MI (September 24, 2001); Atlanta, GA (September 26, 2001); and Phoenix, AZ (September 28, 2001).
A geometric multigrid Poisson solver for domains containing solid inclusions
Botto, Lorenzo
2013-03-01
A Cartesian grid method for the fast solution of the Poisson equation in three-dimensional domains with embedded solid inclusions is presented and its performance analyzed. The efficiency of the method, which assume Neumann conditions at the immersed boundaries, is comparable to that of a multigrid method for regular domains. The method is light in terms of memory usage, and easily adaptable to parallel architectures. Tests with random and ordered arrays of solid inclusions, including spheres and ellipsoids, demonstrate smooth convergence of the residual for small separation between the inclusion surfaces. This feature is important, for instance, in simulations of nearly-touching finite-size particles. The implementation of the method, “MG-Inc”, is available online. Catalogue identifier: AEOE_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOE_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 19068 No. of bytes in distributed program, including test data, etc.: 215118 Distribution format: tar.gz Programming language: C++ (fully tested with GNU GCC compiler). Computer: Any machine supporting standard C++ compiler. Operating system: Any OS supporting standard C++ compiler. RAM: About 150MB for 1283 resolution Classification: 4.3. Nature of problem: Poisson equation in domains containing inclusions; Neumann boundary conditions at immersed boundaries. Solution method: Geometric multigrid with finite-volume discretization. Restrictions: Stair-case representation of the immersed boundaries. Running time: Typically a fraction of a minute for 1283 resolution.
Grid-based Meteorological and Crisis Applications
Hluchy, Ladislav; Bartok, Juraj; Tran, Viet; Lucny, Andrej; Gazak, Martin
2010-05-01
forecast model is a subject of the parameterization and parameter optimization before its real deployment. The parameter optimization requires tens of evaluations of the parameterized model accuracy and each evaluation of the model parameters requires re-running of the hundreds of meteorological situations collected over the years and comparison of the model output with the observed data. The architecture and inherent heterogeneity of both examples and their computational complexity and their interfaces to other systems and services make them well suited for decomposition into a set of web and grid services. Such decomposition has been performed within several projects we participated or participate in cooperation with academic sphere, namely int.eu.grid (dispersion model deployed as a pilot application to an interactive grid), SEMCO-WS (semantic composition of the web and grid services), DMM (development of a significant meteorological phenomena prediction system based on the data mining), VEGA 2009-2011 and EGEE III. We present useful and practical applications of technologies of high performance computing. The use of grid technology provides access to much higher computation power not only for modeling and simulation, but also for the model parameterization and validation. This results in the model parameters optimization and more accurate simulation outputs. Having taken into account that the simulations are used for the aviation, road traffic and crisis management, even small improvement in accuracy of predictions may result in significant improvement of safety as well as cost reduction. We found grid computing useful for our applications. We are satisfied with this technology and our experience encourages us to extend its use. Within an ongoing project (DMM) we plan to include processing of satellite images which extends our requirement on computation very rapidly. We believe that thanks to grid computing we are able to handle the job almost in real time.
Mapping of grid faults and grid codes[Wind turbines
Energy Technology Data Exchange (ETDEWEB)
Iov, F. [Aalborg Univ., Inst. of Energy Technology (Denmark); Hansen, Anca D.; Soerensen, Poul; Cutululis, N.A. [Risoe National Lab. - DTU, Wind Enegy Dept., Roskilde (Denmark)
2007-06-15
The objective of this project is to investigate into the consequences of the new grid connection requirements for the fatigue and extreme loads of wind turbines. The goal is also to clarify and define possible new directions in the certification process of power plant wind turbines, namely wind turbines, which participate actively in the stabilisation of power systems. Practical experience shows that there is a need for such investigations. The grid connection requirements for wind turbines have increased significantly during the last 5-10 years. Especially the requirements for wind turbines to stay connected to the grid during and after voltage sags, imply potential challenges in the design of wind turbines. These requirements pose challenges for the design of both the electrical system and the mechanical structure of wind turbines. An overview over the frequency of grid faults and the grid connection requirements in different relevant countries is done in this report. The most relevant study cases for the quantification of the loads' impact on the wind turbines' lifetime are defined. The goal of this report is to present a mapping of different grid fault types and their frequency in different countries. The report provides also a detailed overview of the Low Voltage Ride-Through Capabilities for wind turbines in different relevant countries. The most relevant study cases for the quantification of the loads' impact on the wind turbines' lifetime are defined. (au)
DEFF Research Database (Denmark)
Pang, Kar Mun; Ivarsson, Anders; Haider, Sajjad
2013-01-01
In the current work, a local time stepping (LTS) solver for the modeling of combustion, radiative heat transfer and soot formation is developed and validated. This is achieved using an open source computational fluid dynamics code, OpenFOAM. Akin to the solver provided in default assembly i...
Development of 3-D Flow Analysis Code for Fuel Assembly using Unstructured Grid System
Energy Technology Data Exchange (ETDEWEB)
Myong, Hyon Kook; Kim, Jong Eun; Ahn, Jong Ki; Yang, Seung Yong [Kookmin Univ., Seoul (Korea, Republic of)
2007-03-15
The flow through a nuclear rod bundle with mixing vanes are very complex and required a suitable turbulence model to be predicted accurately. Final objective of this study is to develop a CFD code for fluid flow and heat transfer analysis in a nuclear fuel assembly using unstructured grid system. In order to develop a CFD code for fluid flow and heat transfer analysis in a nuclear fuel assembly using unstructured grid system, the following researches are made: - Development of numerical algorithm for CFD code's solver - Grid and geometric connectivity data - Development of software(PowerCFD code) for fluid flow and heat transfer analysis in a nuclear fuel assembly using unstructured grid system - Modulation of software(PowerCFD code) - Development of turbulence model - Development of analysis module of RANS/LES hybrid models - Analysis of turbulent flow and heat transfer - Basic study on LES analysis - Development of main frame on pre/post processors based on GUI - Algorithm for fully-developed flow.
Grid generation methodology and CFD simulations in sliding vane compressors and expanders
Bianchi, Giuseppe; Rane, Sham; Kovacevic, Ahmed; Cipollone, Roberto; Murgia, Stefano; Contaldi, Giulio
2017-08-01
The limiting factor for the employment of advanced 3D CFD tools in the analysis and design of rotary vane machines is the unavailability of methods for generation of computational grids suitable for fast and reliable numerical analysis. The paper addresses this challenge presenting the development of an analytical grid generation for vane machines that is based on the user defined nodal displacement. In particular, mesh boundaries are defined as parametric curves generated using trigonometrical modelling of the axial cross section of the machine while the distribution of computational nodes is performed using algebraic algorithms with transfinite interpolation, post orthogonalisation and smoothing. Algebraic control functions are introduced for distribution of nodes on the rotor and casing boundaries in order to achieve good grid quality in terms of cell size and expansion. In this way, the moving and deforming fluid domain of the sliding vane machine is discretized and the conservation of intrinsic quantities in ensured by maintaining the cell connectivity and structure. For validation of generated grids, a mid-size air compressor and a small-scale expander for Organic Rankine Cycle applications have been investigated in this paper. Remarks on implementation of the mesh motion algorithm, stability and robustness experienced with the ANSYS CFX solver as well as the obtained flow results are presented.
Aeroacoustic Simulations of a Nose Landing Gear Using FUN3D on Pointwise Unstructured Grids
Vatsa, Veer N.; Khorrami, Mehdi R.; Rhoads, John; Lockard, David P.
2015-01-01
Numerical simulations have been performed for a partially-dressed, cavity-closed (PDCC) nose landing gear configuration that was tested in the University of Florida's open-jet acoustic facility known as the UFAFF. The unstructured-grid flow solver FUN3D is used to compute the unsteady flow field for this configuration. Mixed-element grids generated using the Pointwise(TradeMark) grid generation software are used for these simulations. Particular care is taken to ensure quality cells and proper resolution in critical areas of interest in an effort to minimize errors introduced by numerical artifacts. A hybrid Reynolds-averaged Navier-Stokes/large eddy simulation (RANS/LES) turbulence model is used for these simulations. Solutions are also presented for a wall function model coupled to the standard turbulence model. Time-averaged and instantaneous solutions obtained on these Pointwise grids are compared with the measured data and previous numerical solutions. The resulting CFD solutions are used as input to a Ffowcs Williams-Hawkings noise propagation code to compute the farfield noise levels in the flyover and sideline directions. The computed noise levels compare well with previous CFD solutions and experimental data.
Monitoring of Grid Scientific Workflows
Directory of Open Access Journals (Sweden)
Bartosz Balis
2008-01-01
Full Text Available Scientific workflows are a means of conducting in silico experiments in modern computing infrastructures for e-Science, often built on top of Grids. Monitoring of Grid scientific workflows is essential not only for performance analysis but also to collect provenance data and gather feedback useful in future decisions, e.g., related to optimization of resource usage. In this paper, basic problems related to monitoring of Grid scientific workflows are discussed. Being highly distributed, loosely coupled in space and time, heterogeneous, and heavily using legacy codes, workflows are exceptionally challenging from the monitoring point of view. We propose a Grid monitoring architecture for scientific workflows. Monitoring data correlation problem is described and an algorithm for on-line distributed collection of monitoring data is proposed. We demonstrate a prototype implementation of the proposed workflow monitoring architecture, the GEMINI monitoring system, and its use for monitoring of a real-life scientific workflow.
NASA Wingtip Code Validation Grid
Zilliac, Greg; Mariani, Jennifer Dacles
1995-01-01
I have been contacted by Alan Celic to request the computational fluid dynamics (CFD) grid file for the NASA Wingtip CFD validation case. Alan is currently a Ph.D. student at the University of Stuttgard in Germany and spent a year here at Ames Research Center (ARC) as an Ames Associate. This case is a standard validation case studied by many within the U.S. The case is of the flow around a rectangular wing with a rounded wing tip. The airfoil is a NACA 0012. There is nothing special or unusual about the geometry or the grid file. The grid file is a single-zone grid with 2.5 million points. This geometry is generic and is not similar to any currently flying vehicle. All of the results published by NASA, as part of this study, (completed in 1995) are currently in the public domain.