A cost-effective strategy for nonoscillatory convection without clipping

NASA Technical Reports Server (NTRS)

Leonard, B. P.; Niknafs, H. S.

1990-01-01

Clipping of narrow extrema and distortion of smooth profiles is a well known problem associated with so-called high resolution nonoscillatory convection schemes. A strategy is presented for accurately simulating highly convective flows containing discontinuities such as density fronts or shock waves, without distorting smooth profiles or clipping narrow local extrema. The convection algorithm is based on non-artificially diffusive third-order upwinding in smooth regions, with automatic adaptive stencil expansion to (in principle, arbitrarily) higher order upwinding locally, in regions of rapidly changing gradients. This is highly cost effective because the wider stencil is used only where needed-in isolated narrow regions. A recently developed universal limiter assures sharp monotonic resolution of discontinuities without introducing artificial diffusion or numerical compression. An adaptive discriminator is constructed to distinguish between spurious overshoots and physical peaks; this automatically relaxes the limiter near local turning points, thereby avoiding loss of resolution in narrow extrema. Examples are given for one-dimensional pure convection of scalar profiles at constant velocity.

Aeroheating Predictions for X-34 Using an Inviscid-Boundary Layer Method

NASA Technical Reports Server (NTRS)

Riley, Christopher J.; Kleb, William L.; Alter, Steven J.

1998-01-01

Radiative equilibrium surface temperatures and surface heating rates from a combined inviscid-boundary layer method are presented for the X-34 Reusable Launch Vehicle for several points along the hypersonic descent portion of its trajectory. Inviscid, perfect-gas solutions are generated with the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) and the Data-Parallel Lower-Upper Relaxation (DPLUR) code. Surface temperatures and heating rates are then computed using the Langley Approximate Three-Dimensional Convective Heating (LATCH) engineering code employing both laminar and turbulent flow models. The combined inviscid-boundary layer method provides accurate predictions of surface temperatures over most of the vehicle and requires much less computational effort than a Navier-Stokes code. This enables the generation of a more thorough aerothermal database which is necessary to design the thermal protection system and specify the vehicle's flight limits.

A survey of upwind methods for flows with equilibrium and non-equilibrium chemistry and thermodynamics

NASA Technical Reports Server (NTRS)

Grossman, B.; Garrett, J.; Cinnella, P.

1989-01-01

Several versions of flux-vector split and flux-difference split algorithms were compared with regard to general applicability and complexity. Test computations were performed using curve-fit equilibrium air chemistry for an M = 5 high-temperature inviscid flow over a wedge, and an M = 24.5 inviscid flow over a blunt cylinder for test computations; for these cases, little difference in accuracy was found among the versions of the same flux-split algorithm. For flows with nonequilibrium chemistry, the effects of the thermodynamic model on the development of flux-vector split and flux-difference split algorithms were investigated using an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Several numerical examples are presented, including nonequilibrium air chemistry in a high-temperature shock tube and nonequilibrium hydrogen-air chemistry in a supersonic diffuser.

An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Korte, John J.

1991-01-01

An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required for the upwind PNS code are approximately equal to an explicit PNS MacCormack's code and existing implicit PNS solvers.

Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Swanson, R. C.

2004-01-01

A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.

A single-stage flux-corrected transport algorithm for high-order finite-volume methods

DOE PAGES

Chaplin, Christopher; Colella, Phillip

2017-05-08

We present a new limiter method for solving the advection equation using a high-order, finite-volume discretization. The limiter is based on the flux-corrected transport algorithm. Here, we modify the classical algorithm by introducing a new computation for solution bounds at smooth extrema, as well as improving the preconstraint on the high-order fluxes. We compute the high-order fluxes via a method-of-lines approach with fourth-order Runge-Kutta as the time integrator. For computing low-order fluxes, we select the corner-transport upwind method due to its improved stability over donor-cell upwind. Several spatial differencing schemes are investigated for the high-order flux computation, including centered- differencemore » and upwind schemes. We show that the upwind schemes perform well on account of the dissipation of high-wavenumber components. The new limiter method retains high-order accuracy for smooth solutions and accurately captures fronts in discontinuous solutions. Further, we need only apply the limiter once per complete time step.« less

Incompressible viscous flow computations for the pump components and the artificial heart

NASA Technical Reports Server (NTRS)

Kiris, Cetin

1992-01-01

A finite difference, three dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. Here, equations are solved in steadily rotating reference frames by using the steady state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two.

Solution strategies and heat transfer calculations for three-dimensional configurations at hypersonic speeds

NASA Technical Reports Server (NTRS)

Weilmuenster, K. J.; Gnoffo, Peter A.

1992-01-01

A procedure which reduces the memory requirements for computing the viscous flow over a modified Orbiter geometry at a hypersonic flight condition is presented. The Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) code which incorporates a thermochemical nonequilibrium chemistry model, a finite rate catalytic wall boundary condition and wall temperature distribution based on radiation equilibrium is used in this study. In addition, the effect of choice of 'min mod' function, eigenvalue limiter and grid density on surface heating is investigated. The surface heating from a flowfield calculation at Mach number 22, altitude of 230,000 ft and 40 deg angle of attack is compared with flight data from three Orbiter flights.

An upwind, kinetic flux-vector splitting method for flows in chemical and thermal non-equilibrium

NASA Technical Reports Server (NTRS)

Eppard, W. M.; Grossman, B.

1993-01-01

We have developed new upwind kinetic difference schemes for flows with non-equilibrium thermodynamics and chemistry. These schemes are derived from the Boltzmann equation with the resulting Euler schemes developed as moments of the discretized Boltzmann scheme with a locally Maxwellian velocity distribution. Splitting the velocity distribution at the Boltzmann level is seen to result in a flux-split Euler scheme and is called Kinetic Flux Vector Splitting (KFVS). Extensions to flows with finite-rate chemistry and vibrational relaxation is accomplished utilizing nonequilibrium kinetic theory. Computational examples are presented comparing KFVS with the schemes of Van Leer and Roe for a quasi-one-dimensional flow through a supersonic diffuser, inviscid flow through two-dimensional inlet, and viscous flow over a cone at zero angle-of-attack. Calculations are also shown for the transonic flow over a bump in a channel and the transonic flow over an NACA 0012 airfoil. The results show that even though the KFVS scheme is a Riemann solver at the kinetic level, its behavior at the Euler level is more similar to the existing flux-vector splitting algorithms than to the flux-difference splitting scheme of Roe.

The upwind control volume scheme for unstructured triangular grids

NASA Technical Reports Server (NTRS)

Giles, Michael; Anderson, W. Kyle; Roberts, Thomas W.

1989-01-01

A new algorithm for the numerical solution of the Euler equations is presented. This algorithm is particularly suited to the use of unstructured triangular meshes, allowing geometric flexibility. Solutions are second-order accurate in the steady state. Implementation of the algorithm requires minimal grid connectivity information, resulting in modest storage requirements, and should enhance the implementation of the scheme on massively parallel computers. A novel form of upwind differencing is developed, and is shown to yield sharp resolution of shocks. Two new artificial viscosity models are introduced that enhance the performance of the new scheme. Numerical results for transonic airfoil flows are presented, which demonstrate the performance of the algorithm.

Finite volume multigrid method of the planar contraction flow of a viscoelastic fluid

NASA Astrophysics Data System (ADS)

Moatssime, H. Al; Esselaoui, D.; Hakim, A.; Raghay, S.

2001-08-01

This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first-order upwind approximation for the viscoelastic stress. A non-uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non-linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss-Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd-B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright

Scanning of wind turbine upwind conditions: numerical algorithm and first applications

NASA Astrophysics Data System (ADS)

Calaf, Marc; Cortina, Gerard; Sharma, Varun; Parlange, Marc B.

2014-11-01

Wind turbines still obtain in-situ meteorological information by means of traditional wind vane and cup anemometers installed at the turbine's nacelle, right behind the blades. This has two important drawbacks: 1-turbine misalignment with the mean wind direction is common and energy losses are experienced; 2-the near-blade monitoring does not provide any time to readjust the profile of the wind turbine to incoming turbulence gusts. A solution is to install wind Lidar devices on the turbine's nacelle. This technique is currently under development as an alternative to traditional in-situ wind anemometry because it can measure the wind vector at substantial distances upwind. However, at what upwind distance should they interrogate the atmosphere? A new flexible wind turbine algorithm for large eddy simulations of wind farms that allows answering this question, will be presented. The new wind turbine algorithm timely corrects the turbines' yaw misalignment with the changing wind. The upwind scanning flexibility of the algorithm also allows to track the wind vector and turbulent kinetic energy as they approach the wind turbine's rotor blades. Results will illustrate the spatiotemporal evolution of the wind vector and the turbulent kinetic energy as the incoming flow approaches the wind turbine under different atmospheric stability conditions. Results will also show that the available atmospheric wind power is larger during daytime periods at the cost of an increased variance.

Comparison of PLIF and CFD Results for the Orion CEV RCS Jets

NASA Technical Reports Server (NTRS)

Ivey, Christopher B.; Danehy, Paul M.; Bathel, Brett F.; Dyakonov, Artem A.; Inman, Jennifer A.; Jones, Stephen B.

2011-01-01

Nitric-oxide planar laser-induced fluorescence (NO PLIF) was used to visualize and measure centerline streamwise velocity of the Orion Crew Exploration Vehicle (CEV) Reaction Control System (RCS) Jets at NASA Langley Research Center's 31-Inch Mach 10 Air wind tunnel. Fluorescence flow visualizations of pitch, roll, and yaw RCS jets were obtained using different plenum pressures and wind tunnel operating stagnation pressures. For two yaw RCS jet test cases, the PLIF visualizations were compared to computational flow imaging (CFI) images based on Langley Aerothermal Upwind Relaxation Algorithm (LAURA) computational fluid dynamics (CFD) simulations of the flowfield. For the same test cases, the streamwise velocity measurements were compared to CFD. The CFD solution, while showing some unphysical artifacts, generally agree with the experimental measurements.

Solving Upwind-Biased Discretizations. 2; Multigrid Solver Using Semicoarsening

NASA Technical Reports Server (NTRS)

Diskin, Boris

1999-01-01

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

A comparison of upwind schemes for computation of three-dimensional hypersonic real-gas flows

NASA Technical Reports Server (NTRS)

Gerbsch, R. A.; Agarwal, R. K.

1992-01-01

The method of Suresh and Liou (1992) is extended, and the resulting explicit noniterative upwind finite-volume algorithm is applied to the integration of 3D parabolized Navier-Stokes equations to model 3D hypersonic real-gas flowfields. The solver is second-order accurate in the marching direction and employs flux-limiters to make the algorithm second-order accurate, with total variation diminishing in the cross-flow direction. The algorithm is used to compute hypersonic flow over a yawed cone and over the Ames All-Body Hypersonic Vehicle. The solutions obtained agree well with other computational results and with experimental data.

Some implementational issues of convection schemes for finite volume formulations

NASA Technical Reports Server (NTRS)

Thakur, Siddharth; Shyy, Wei

1993-01-01

Two higher-order upwind schemes - second-order upwind and QUICK - are examined in terms of their interpretation, implementation as well as performance for a recirculating flow in a lid-driven cavity, in the context of a control volume formulation using the SIMPLE algorithm. The present formulation of these schemes is based on a unified framework wherein the first-order upwind scheme is chosen as the basis, with the remaining terms being assigned to the source term. The performance of these schemes is contrasted with the first-order upwind and second-order central difference schemes. Also addressed in this study is the issue of boundary treatment associated with these higher-order upwind schemes. Two different boundary treatments - one that uses a two-point scheme consistently within a given control volume at the boundary, and the other that maintains consistency of flux across the interior face between the adjacent control volumes - are formulated and evaluated.

Some implementational issues of convection schemes for finite-volume formulations

NASA Technical Reports Server (NTRS)

Thakur, Siddharth; Shyy, Wei

1993-01-01

Two higher-order upwind schemes - second-order upwind and QUICK - are examined in terms of their interpretation, implementations, as well as performance for a recirculating flow in a lid-driven cavity, in the context of a control-volume formulation using the SIMPLE algorithm. The present formulation of these schemes is based on a unified framework wherein the first-order upwind scheme is chosen as the basis, with the remaining terms being assigned to the source term. The performance of these schemes is contrasted with the first-order upwind and second-order central difference schemes. Also addressed in this study is the issue of boundary treatment associated with these higher-order upwind schemes. Two different boundary treatments - one that uses a two-point scheme consistently within a given control volume at the boundary, and the other that maintains consistency of flux across the interior face between the adjacent control volumes - are formulated and evaluated.

Numerical solution of the incompressible Navier-Stokes equations. Ph.D. Thesis - Stanford Univ., Mar. 1989

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.

1990-01-01

The current work is initiated in an effort to obtain an efficient, accurate, and robust algorithm for the numerical solution of the incompressible Navier-Stokes equations in two- and three-dimensional generalized curvilinear coordinates for both steady-state and time-dependent flow problems. This is accomplished with the use of the method of artificial compressibility and a high-order flux-difference splitting technique for the differencing of the convective terms. Time accuracy is obtained in the numerical solutions by subiterating the equations in psuedo-time for each physical time step. The system of equations is solved with a line-relaxation scheme which allows the use of very large pseudo-time steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. Numerous laminar test flow problems are computed and presented with a comparison against analytically known solutions or experimental results. These include the flow in a driven cavity, the flow over a backward-facing step, the steady and unsteady flow over a circular cylinder, flow over an oscillating plate, flow through a one-dimensional inviscid channel with oscillating back pressure, the steady-state flow through a square duct with a 90 degree bend, and the flow through an artificial heart configuration with moving boundaries. An adequate comparison with the analytical or experimental results is obtained in all cases. Numerical comparisons of the upwind differencing with central differencing plus artificial dissipation indicates that the upwind differencing provides a much more robust algorithm, which requires significantly less computing time. The time-dependent problems require on the order of 10 to 20 subiterations, indicating that the elliptical nature of the problem does require a substantial amount of computing effort.

Incompressible viscous flow computations for the pump components and the artificial heart

NASA Technical Reports Server (NTRS)

Kiris, Cetin

1992-01-01

A finite-difference, three-dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. In this work, the equations are solved in steadily rotating reference frames by using the steady-state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two. Included in the appendix is a paper on incompressible viscous flow through artificial heart devices with moving boundaries. Time-accurate calculations, such as impeller and diffusor interaction, will be reported in future work.

Factorizable Schemes for the Equations of Fluid Flow

NASA Technical Reports Server (NTRS)

Sidilkover, David

1999-01-01

We present an upwind high-resolution factorizable (UHF) discrete scheme for the compressible Euler equations that allows to distinguish between full-potential and advection factors at the discrete level. The scheme approximates equations in their general conservative form and is related to the family of genuinely multidimensional upwind schemes developed previously and demonstrated to have good shock-capturing capabilities. A unique property of this scheme is that in addition to the aforementioned features it is also factorizable, i.e., it allows to distinguish between full-potential and advection factors at the discrete level. The latter property facilitates the construction of optimally efficient multigrid solvers. This is done through a relaxation procedure that utilizes the factorizability property.

Updates to Multi-Dimensional Flux Reconstruction for Hypersonic Simulations on Tetrahedral Grids

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2010-01-01

The quality of simulated hypersonic stagnation region heating with tetrahedral meshes is investigated by using an updated three-dimensional, upwind reconstruction algorithm for the inviscid flux vector. An earlier implementation of this algorithm provided improved symmetry characteristics on tetrahedral grids compared to conventional reconstruction methods. The original formulation however displayed quantitative differences in heating and shear that were as large as 25% compared to a benchmark, structured-grid solution. The primary cause of this discrepancy is found to be an inherent inconsistency in the formulation of the flux limiter. The inconsistency is removed by employing a Green-Gauss formulation of primitive gradients at nodes to replace the previous Gram-Schmidt algorithm. Current results are now in good agreement with benchmark solutions for two challenge problems: (1) hypersonic flow over a three-dimensional cylindrical section with special attention to the uniformity of the solution in the spanwise direction and (2) hypersonic flow over a three-dimensional sphere. The tetrahedral cells used in the simulation are derived from a structured grid where cell faces are bisected across the diagonal resulting in a consistent pattern of diagonals running in a biased direction across the otherwise symmetric domain. This grid is known to accentuate problems in both shock capturing and stagnation region heating encountered with conventional, quasi-one-dimensional inviscid flux reconstruction algorithms. Therefore the test problems provide a sensitive indicator for algorithmic effects on heating. Additional simulations on a sharp, double cone and the shuttle orbiter are then presented to demonstrate the capabilities of the new algorithm on more geometrically complex flows with tetrahedral grids. These results provide the first indication that pure tetrahedral elements utilizing the updated, three-dimensional, upwind reconstruction algorithm may be used for the simulation of heating and shear in hypersonic flows in upwind, finite volume formulations.

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

NASA Technical Reports Server (NTRS)

Cai, Xiao-Chuan; Gropp, William D.; Keyes, David E.; Melvin, Robin G.; Young, David P.

1996-01-01

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Obayashi, Shigeru

1991-01-01

A streamwise upwind algorithm for solving the unsteady 3-D Navier-Stokes equations was extended to handle the moving grid system. It is noted that the finite volume concept is essential to extend the algorithm. The resulting algorithm is conservative for any motion of the coordinate system. Two extensions to an implicit method were considered and the implicit extension that makes the algorithm computationally efficient is implemented into Ames's aeroelasticity code, ENSAERO. The new flow solver has been validated through the solution of test problems. Test cases include three-dimensional problems with fixed and moving grids. The first test case shown is an unsteady viscous flow over an F-5 wing, while the second test considers the motion of the leading edge vortex as well as the motion of the shock wave for a clipped delta wing. The resulting algorithm has been implemented into ENSAERO. The upwind version leads to higher accuracy in both steady and unsteady computations than the previously used central-difference method does, while the increase in the computational time is small.

Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method

NASA Technical Reports Server (NTRS)

Whitaker, David L.

1993-01-01

A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.

Accuracy of an unstructured-grid upwind-Euler algorithm for the ONERA M6 wing

NASA Technical Reports Server (NTRS)

Batina, John T.

1991-01-01

Improved algorithms for the solution of the three-dimensional, time-dependent Euler equations are presented for aerodynamic analysis involving unstructured dynamic meshes. The improvements have been developed recently to the spatial and temporal discretizations used by unstructured-grid flow solvers. The spatial discretization involves a flux-split approach that is naturally dissipative and captures shock waves sharply with at most one grid point within the shock structure. The temporal discretization involves either an explicit time-integration scheme using a multistage Runge-Kutta procedure or an implicit time-integration scheme using a Gauss-Seidel relaxation procedure, which is computationally efficient for either steady or unsteady flow problems. With the implicit Gauss-Seidel procedure, very large time steps may be used for rapid convergence to steady state, and the step size for unsteady cases may be selected for temporal accuracy rather than for numerical stability. Steady flow results are presented for both the NACA 0012 airfoil and the Office National d'Etudes et de Recherches Aerospatiales M6 wing to demonstrate applications of the new Euler solvers. The paper presents a description of the Euler solvers along with results and comparisons that assess the capability.

Numerical Simulation of Flow Through an Artificial Heart

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.; Kutler, Paul; Kwak, Dochan; Kiris, Cetin

1989-01-01

A solution procedure was developed that solves the unsteady, incompressible Navier-Stokes equations, and was used to numerically simulate viscous incompressible flow through a model of the Pennsylvania State artificial heart. The solution algorithm is based on the artificial compressibility method, and uses flux-difference splitting to upwind the convective terms; a line-relaxation scheme is used to solve the equations. The time-accuracy of the method is obtained by iteratively solving the equations at each physical time step. The artificial heart geometry involves a piston-type action with a moving solid wall. A single H-grid is fit inside the heart chamber. The grid is continuously compressed and expanded with a constant number of grid points to accommodate the moving piston. The computational domain ends at the valve openings where nonreflective boundary conditions based on the method of characteristics are applied. Although a number of simplifing assumptions were made regarding the geometry, the computational results agreed reasonably well with an experimental picture. The computer time requirements for this flow simulation, however, are quite extensive. Computational study of this type of geometry would benefit greatly from improvements in computer hardware speed and algorithm efficiency enhancements.

Recommended direct simulation Monte Carlo collision model parameters for modeling ionized air transport processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Swaminathan-Gopalan, Krishnan; Stephani, Kelly A., E-mail: ksteph@illinois.edu

2016-02-15

A systematic approach for calibrating the direct simulation Monte Carlo (DSMC) collision model parameters to achieve consistency in the transport processes is presented. The DSMC collision cross section model parameters are calibrated for high temperature atmospheric conditions by matching the collision integrals from DSMC against ab initio based collision integrals that are currently employed in the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) and Data Parallel Line Relaxation (DPLR) high temperature computational fluid dynamics solvers. The DSMC parameter values are computed for the widely used Variable Hard Sphere (VHS) and the Variable Soft Sphere (VSS) models using the collision-specific pairing approach.more » The recommended best-fit VHS/VSS parameter values are provided over a temperature range of 1000-20 000 K for a thirteen-species ionized air mixture. Use of the VSS model is necessary to achieve consistency in transport processes of ionized gases. The agreement of the VSS model transport properties with the transport properties as determined by the ab initio collision integral fits was found to be within 6% in the entire temperature range, regardless of the composition of the mixture. The recommended model parameter values can be readily applied to any gas mixture involving binary collisional interactions between the chemical species presented for the specified temperature range.« less

Aerodynamic Interference Due to MSL Reaction Control System

NASA Technical Reports Server (NTRS)

Dyakonov, Artem A.; Schoenenberger, Mark; Scallion, William I.; VanNorman, John W.; Novak, Luke A.; Tang, Chun Y.

2009-01-01

An investigation of effectiveness of the reaction control system (RCS) of Mars Science Laboratory (MSL) entry capsule during atmospheric flight has been conducted. The reason for the investigation is that MSL is designed to fly a lifting actively guided entry with hypersonic bank maneuvers, therefore an understanding of RCS effectiveness is required. In the course of the study several jet configurations were evaluated using Langley Aerothermal Upwind Relaxation Algorithm (LAURA) code, Data Parallel Line Relaxation (DPLR) code, Fully Unstructured 3D (FUN3D) code and an Overset Grid Flowsolver (OVERFLOW) code. Computations indicated that some of the proposed configurations might induce aero-RCS interactions, sufficient to impede and even overwhelm the intended control torques. It was found that the maximum potential for aero-RCS interference exists around peak dynamic pressure along the trajectory. Present analysis largely relies on computational methods. Ground testing, flight data and computational analyses are required to fully understand the problem. At the time of this writing some experimental work spanning range of Mach number 2.5 through 4.5 has been completed and used to establish preliminary levels of confidence for computations. As a result of the present work a final RCS configuration has been designed such as to minimize aero-interference effects and it is a design baseline for MSL entry capsule.

Development of an upwind, finite-volume code with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Molvik, Gregory A.

1994-01-01

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques, and a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical, and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data.

Development of new flux splitting schemes. [computational fluid dynamics algorithms

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing; Steffen, Christopher J., Jr.

1992-01-01

Maximizing both accuracy and efficiency has been the primary objective in designing a numerical algorithm for computational fluid dynamics (CFD). This is especially important for solutions of complex three dimensional systems of Navier-Stokes equations which often include turbulence modeling and chemistry effects. Recently, upwind schemes have been well received for their capability in resolving discontinuities. With this in mind, presented are two new flux splitting techniques for upwind differencing. The first method is based on High-Order Polynomial Expansions (HOPE) of the mass flux vector. The second new flux splitting is based on the Advection Upwind Splitting Method (AUSM). The calculation of the hypersonic conical flow demonstrates the accuracy of the splitting in resolving the flow in the presence of strong gradients. A second series of tests involving the two dimensional inviscid flow over a NACA 0012 airfoil demonstrates the ability of the AUSM to resolve the shock discontinuity at transonic speed. A third case calculates a series of supersonic flows over a circular cylinder. Finally, the fourth case deals with tests of a two dimensional shock wave/boundary layer interaction.

Composite scheme using localized relaxation with non-standard finite difference method for hyperbolic conservation laws

NASA Astrophysics Data System (ADS)

Kumar, Vivek; Raghurama Rao, S. V.

2008-04-01

Non-standard finite difference methods (NSFDM) introduced by Mickens [ Non-standard Finite Difference Models of Differential Equations, World Scientific, Singapore, 1994] are interesting alternatives to the traditional finite difference and finite volume methods. When applied to linear hyperbolic conservation laws, these methods reproduce exact solutions. In this paper, the NSFDM is first extended to hyperbolic systems of conservation laws, by a novel utilization of the decoupled equations using characteristic variables. In the second part of this paper, the NSFDM is studied for its efficacy in application to nonlinear scalar hyperbolic conservation laws. The original NSFDMs introduced by Mickens (1994) were not in conservation form, which is an important feature in capturing discontinuities at the right locations. Mickens [Construction and analysis of a non-standard finite difference scheme for the Burgers-Fisher equations, Journal of Sound and Vibration 257 (4) (2002) 791-797] recently introduced a NSFDM in conservative form. This method captures the shock waves exactly, without any numerical dissipation. In this paper, this algorithm is tested for the case of expansion waves with sonic points and is found to generate unphysical expansion shocks. As a remedy to this defect, we use the strategy of composite schemes [R. Liska, B. Wendroff, Composite schemes for conservation laws, SIAM Journal of Numerical Analysis 35 (6) (1998) 2250-2271] in which the accurate NSFDM is used as the basic scheme and localized relaxation NSFDM is used as the supporting scheme which acts like a filter. Relaxation schemes introduced by Jin and Xin [The relaxation schemes for systems of conservation laws in arbitrary space dimensions, Communications in Pure and Applied Mathematics 48 (1995) 235-276] are based on relaxation systems which replace the nonlinear hyperbolic conservation laws by a semi-linear system with a stiff relaxation term. The relaxation parameter ( λ) is chosen locally on the three point stencil of grid which makes the proposed method more efficient. This composite scheme overcomes the problem of unphysical expansion shocks and captures the shock waves with an accuracy better than the upwind relaxation scheme, as demonstrated by the test cases, together with comparisons with popular numerical methods like Roe scheme and ENO schemes.

Computation of incompressible viscous flows through artificial heart devices with moving boundaries

NASA Technical Reports Server (NTRS)

Kiris, Cetin; Rogers, Stuart; Kwak, Dochan; Chang, I.-DEE

1991-01-01

The extension of computational fluid dynamics techniques to artificial heart flow simulations is illustrated. Unsteady incompressible Navier-Stokes equations written in 3-D generalized curvilinear coordinates are solved iteratively at each physical time step until the incompressibility condition is satisfied. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. The efficiency and robustness of the time accurate formulation of the algorithm are tested by computing the flow through model geometries. A channel flow with a moving indentation is computed and validated with experimental measurements and other numerical solutions. In order to handle the geometric complexity and the moving boundary problems, a zonal method and an overlapping grid embedding scheme are used, respectively. Steady state solutions for the flow through a tilting disk heart valve was compared against experimental measurements. Good agreement was obtained. The flow computation during the valve opening and closing is carried out to illustrate the moving boundary capability.

Numerical Solution of Incompressible Navier-Stokes Equations Using a Fractional-Step Approach

NASA Technical Reports Server (NTRS)

Kiris, Cetin; Kwak, Dochan

1999-01-01

A fractional step method for the solution of steady and unsteady incompressible Navier-Stokes equations is outlined. The method is based on a finite volume formulation and uses the pressure in the cell center and the mass fluxes across the faces of each cell as dependent variables. Implicit treatment of convective and viscous terms in the momentum equations enables the numerical stability restrictions to be relaxed. The linearization error in the implicit solution of momentum equations is reduced by using three subiterations in order to achieve second order temporal accuracy for time-accurate calculations. In spatial discretizations of the momentum equations, a high-order (3rd and 5th) flux-difference splitting for the convective terms and a second-order central difference for the viscous terms are used. The resulting algebraic equations are solved with a line-relaxation scheme which allows the use of large time step. A four color ZEBRA scheme is employed after the line-relaxation procedure in the solution of the Poisson equation for pressure. This procedure is applied to a Couette flow problem using a distorted computational grid to show that the method minimizes grid effects. Additional benchmark cases include the unsteady laminar flow over a circular cylinder for Reynolds Numbers of 200, and a 3-D, steady, turbulent wingtip vortex wake propagation study. The solution algorithm does a very good job in resolving the vortex core when 5th-order upwind differencing and a modified production term in the Baldwin-Barth one-equation turbulence model are used with adequate grid resolution.

Development of an upwind, finite-volume code with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Molvik, Gregory A.

1995-01-01

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data. This report summarizes the research that took place from August 1,1994 to January 1, 1995.

Quality assessment of two- and three-dimensional unstructured meshes and validation of an upwind Euler flow solver

NASA Technical Reports Server (NTRS)

Woodard, Paul R.; Batina, John T.; Yang, Henry T. Y.

1992-01-01

Quality assessment procedures are described for two-dimensional unstructured meshes. The procedures include measurement of minimum angles, element aspect ratios, stretching, and element skewness. Meshes about the ONERA M6 wing and the Boeing 747 transport configuration are generated using an advancing front method grid generation package of programs. Solutions of Euler's equations for these meshes are obtained at low angle-of-attack, transonic conditions. Results for these cases, obtained as part of a validation study demonstrate accuracy of an implicit upwind Euler solution algorithm.

Second order upwind Lagrangian particle method for Euler equations

DOE PAGES

Samulyak, Roman; Chen, Hsin -Chiang; Yu, Kwangmin

2016-06-01

A new second order upwind Lagrangian particle method for solving Euler equations for compressible inviscid fluid or gas flows is proposed. Similar to smoothed particle hydrodynamics (SPH), the method represents fluid cells with Lagrangian particles and is suitable for the simulation of complex free surface / multiphase flows. The main contributions of our method, which is different from SPH in all other aspects, are (a) significant improvement of approximation of differential operators based on a polynomial fit via weighted least squares approximation and the convergence of prescribed order, (b) an upwind second-order particle-based algorithm with limiter, providing accuracy and longmore » term stability, and (c) accurate resolution of states at free interfaces. In conclusion, numerical verification tests demonstrating the convergence order for fixed domain and free surface problems are presented.« less

Second order upwind Lagrangian particle method for Euler equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samulyak, Roman; Chen, Hsin -Chiang; Yu, Kwangmin

A new second order upwind Lagrangian particle method for solving Euler equations for compressible inviscid fluid or gas flows is proposed. Similar to smoothed particle hydrodynamics (SPH), the method represents fluid cells with Lagrangian particles and is suitable for the simulation of complex free surface / multiphase flows. The main contributions of our method, which is different from SPH in all other aspects, are (a) significant improvement of approximation of differential operators based on a polynomial fit via weighted least squares approximation and the convergence of prescribed order, (b) an upwind second-order particle-based algorithm with limiter, providing accuracy and longmore » term stability, and (c) accurate resolution of states at free interfaces. In conclusion, numerical verification tests demonstrating the convergence order for fixed domain and free surface problems are presented.« less

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

NASA Technical Reports Server (NTRS)

Slack, David C.; Whitaker, D. L.; Walters, Robert W.

1994-01-01

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

On the implementation of a class of upwind schemes for system of hyperbolic conservation laws

NASA Technical Reports Server (NTRS)

Yee, H. C.

1985-01-01

The relative computational effort among the spatially five point numerical flux functions of Harten, van Leer, and Osher and Chakravarthy is explored. These three methods typify the design principles most often used in constructing higher than first order upwind total variation diminishing (TVD) schemes. For the scalar case the difference in operation count between any two algorithms may be very small and yet the operation count for their system counterparts might be vastly different. The situation occurs even though one starts with two different yet equivalent representations for the scalar case.

Quality assessment of two- and three-dimensional unstructured meshes and validation of an upwind Euler flow solver

NASA Technical Reports Server (NTRS)

Woodard, Paul R.; Yang, Henry T. Y.; Batina, John T.

1992-01-01

Quality assessment procedures are described for two-dimensional and three-dimensional unstructured meshes. The procedures include measurement of minimum angles, element aspect ratios, stretching, and element skewness. Meshes about the ONERA M6 wing and the Boeing 747 transport configuration are generated using an advancing front method grid generation package of programs. Solutions of Euler's equations for these meshes are obtained at low angle-of-attack, transonic conditions. Results for these cases, obtained as part of a validation study demonstrate the accuracy of an implicit upwind Euler solution algorithm.

Numerical solution of nonlinear partial differential equations of mixed type. [finite difference approximation

NASA Technical Reports Server (NTRS)

Jameson, A.

1976-01-01

A review is presented of some recently developed numerical methods for the solution of nonlinear equations of mixed type. The methods considered use finite difference approximations to the differential equation. Central difference formulas are employed in the subsonic zone and upwind difference formulas are used in the supersonic zone. The relaxation method for the small disturbance equation is discussed and a description is given of difference schemes for the potential flow equation in quasi-linear form. Attention is also given to difference schemes for the potential flow equation in conservation form, the analysis of relaxation schemes by the time dependent analogy, the accelerated iterative method, and three-dimensional calculations.

A Monte Carlo comparison of the recovery of winds near upwind and downwind from the SASS-1 model function by means of the sum of squares algorithm and a maximum likelihood estimator

NASA Technical Reports Server (NTRS)

Pierson, W. J., Jr.

1984-01-01

Backscatter measurements at upwind and crosswind are simulated for five incidence angles by means of the SASS-1 model function. The effects of communication noise and attitude errors are simulated by Monte Carlo methods, and the winds are recovered by both the Sum of Square (SOS) algorithm and a Maximum Likelihood Estimater (MLE). The SOS algorithm is shown to fail for light enough winds at all incidence angles and to fail to show areas of calm because backscatter estimates that were negative or that produced incorrect values of K sub p greater than one were discarded. The MLE performs well for all input backscatter estimates and returns calm when both are negative. The use of the SOS algorithm is shown to have introduced errors in the SASS-1 model function that, in part, cancel out the errors that result from using it, but that also cause disagreement with other data sources such as the AAFE circle flight data at light winds. Implications for future scatterometer systems are given.

High-speed reacting flow simulation using USA-series codes

NASA Astrophysics Data System (ADS)

Chakravarthy, S. R.; Palaniswamy, S.

In this paper, the finite-rate chemistry (FRC) formulation for the USA-series of codes and three sets of validations are presented. USA-series computational fluid dynamics (CFD) codes are based on Unified Solution Algorithms including explicity and implicit formulations, factorization and relaxation approaches, time marching and space marching methodolgies, etc., in order to be able to solve a very wide class of CDF problems using a single framework. Euler or Navier-Stokes equations are solved using a finite-volume treatment with upwind Total Variation Diminishing discretization for the inviscid terms. Perfect and real gas options are available including equilibrium and nonequilibrium chemistry. This capability has been widely used to study various problems including Space Shuttle exhaust plumes, National Aerospace Plane (NASP) designs, etc. (1) Numerical solutions are presented showing the full range of possible solutions to steady detonation wave problems. (2) Comparison between the solution obtained by the USA code and Generalized Kinetics Analysis Program (GKAP) is shown for supersonic combustion in a duct. (3) Simulation of combustion in a supersonic shear layer is shown to have reasonable agreement with experimental observations.

CFD Analysis of Tile-Repair Augers for the Shuttle Orbiter Re-Entry Aeroheating

NASA Technical Reports Server (NTRS)

Mazaheri, Ali R.

2007-01-01

A three-dimensional aerothermodynamic model of the shuttle orbiter's tile overlay repair (TOR) sub-assembly is presented. This sub-assembly, which is an overlay that covers the damaged tiles, is modeled as a protuberance with a constant thickness. The washers and augers that serve as the overlay fasteners are modeled as cylindrical protuberances with constant thicknesses. Entry aerothermodynamic cases are studied to provide necessary inputs for future thermal analyses and to support the space-shuttle return-to-flight effort. The NASA Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) is used to calculate heat transfer rate on the surfaces of the tile overlay repair and augers. Gas flow is modeled as non-equilibrium, five species air in thermal equilibrium. Heat transfer rate and surface temperatures are analyzed and studied for a shuttle orbiter trajectory point at Mach 17.85. Computational results show that the average heat transfer rate normalized with respect to its value at body point 1800 is about BF=1.9 for the auger head. It is also shown that the average BF for the auger and washer heads is about BF=2.0.

Multi-Component Diffusion with Application To Computational Aerothermodynamics

NASA Technical Reports Server (NTRS)

Sutton, Kenneth; Gnoffo, Peter A.

1998-01-01

The accuracy and complexity of solving multicomponent gaseous diffusion using the detailed multicomponent equations, the Stefan-Maxwell equations, and two commonly used approximate equations have been examined in a two part study. Part I examined the equations in a basic study with specified inputs in which the results are applicable for many applications. Part II addressed the application of the equations in the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) computational code for high-speed entries in Earth's atmosphere. The results showed that the presented iterative scheme for solving the Stefan-Maxwell equations is an accurate and effective method as compared with solutions of the detailed equations. In general, good accuracy with the approximate equations cannot be guaranteed for a species or all species in a multi-component mixture. 'Corrected' forms of the approximate equations that ensured the diffusion mass fluxes sum to zero, as required, were more accurate than the uncorrected forms. Good accuracy, as compared with the Stefan- Maxwell results, were obtained with the 'corrected' approximate equations in defining the heating rates for the three Earth entries considered in Part II.

An upwind method for the solution of the 3D Euler and Navier-Stokes equations on adaptively refined meshes

NASA Astrophysics Data System (ADS)

Aftosmis, Michael J.

1992-10-01

A new node based upwind scheme for the solution of the 3D Navier-Stokes equations on adaptively refined meshes is presented. The method uses a second-order upwind TVD scheme to integrate the convective terms, and discretizes the viscous terms with a new compact central difference technique. Grid adaptation is achieved through directional division of hexahedral cells in response to evolving features as the solution converges. The method is advanced in time with a multistage Runge-Kutta time stepping scheme. Two- and three-dimensional examples establish the accuracy of the inviscid and viscous discretization. These investigations highlight the ability of the method to produce crisp shocks, while accurately and economically resolving viscous layers. The representation of these and other structures is shown to be comparable to that obtained by structured methods. Further 3D examples demonstrate the ability of the adaptive algorithm to effectively locate and resolve multiple scale features in complex 3D flows with many interacting, viscous, and inviscid structures.

Multigrid solution of the Navier-Stokes equations on highly stretched grids with defect correction

NASA Technical Reports Server (NTRS)

Sockol, Peter M.

1993-01-01

Relaxation-based multigrid solvers for the steady incompressible Navier-Stokes equations are examined to determine their computational speed and robustness. Four relaxation methods with a common discretization have been used as smoothers in a single tailored multigrid procedure. The equations are discretized on a staggered grid with first order upwind used for convection in the relaxation process on all grids and defect correction to second order central on the fine grid introduced once per multigrid cycle. A fixed W(1,1) cycle with full weighting of residuals is used in the FAS multigrid process. The resulting solvers have been applied to three 2D flow problems, over a range of Reynolds numbers, on both uniform and highly stretched grids. In all cases the L(sub 2) norm of the velocity changes is reduced to 10(exp -6) in a few 10's of fine grid sweeps. The results from this study are used to draw conclusions on the strengths and weaknesses of the individual relaxation schemes as well as those of the overall multigrid procedure when used as a solver on highly stretched grids.

Flux splitting algorithms for two-dimensional viscous flows with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun; Liou, Meng-Sing

1989-01-01

The Roe flux difference splitting method was extended to treat 2-D viscous flows with nonequilibrium chemistry. The derivations have avoided unnecessary assumptions or approximations. For spatial discretization, the second-order Roe upwind differencing is used for the convective terms and central differencing for the viscous terms. An upwind-based TVD scheme is applied to eliminate oscillations and obtain a sharp representation of discontinuities. A two-state Runge-Kutta method is used to time integrate the discretized Navier-Stokes and species transport equations for the asymptotic steady solutions. The present method is then applied to two types of flows: the shock wave/boundary layer interaction problems and the jet in cross flows.

Flux splitting algorithms for two-dimensional viscous flows with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun; Liou, Meng-Sing

1989-01-01

The Roe flux-difference splitting method has been extended to treat two-dimensional viscous flows with nonequilibrium chemistry. The derivations have avoided unnecessary assumptions or approximations. For spatial discretization, the second-order Roe upwind differencing is used for the convective terms and central differencing for the viscous terms. An upwind-based TVD scheme is applied to eliminate oscillations and obtain a sharp representation of discontinuities. A two-stage Runge-Kutta method is used to time integrate the discretized Navier-Stokes and species transport equations for the asymptotic steady solutions. The present method is then applied to two types of flows: the shock wave/boundary layer interaction problems and the jet in cross flows.

MPDATA: Third-order accuracy for variable flows

NASA Astrophysics Data System (ADS)

Waruszewski, Maciej; Kühnlein, Christian; Pawlowska, Hanna; Smolarkiewicz, Piotr K.

2018-04-01

This paper extends the multidimensional positive definite advection transport algorithm (MPDATA) to third-order accuracy for temporally and spatially varying flows. This is accomplished by identifying the leading truncation error of the standard second-order MPDATA, performing the Cauchy-Kowalevski procedure to express it in a spatial form and compensating its discrete representation-much in the same way as the standard MPDATA corrects the first-order accurate upwind scheme. The procedure of deriving the spatial form of the truncation error was automated using a computer algebra system. This enables various options in MPDATA to be included straightforwardly in the third-order scheme, thereby minimising the implementation effort in existing code bases. Following the spirit of MPDATA, the error is compensated using the upwind scheme resulting in a sign-preserving algorithm, and the entire scheme can be formulated using only two upwind passes. Established MPDATA enhancements, such as formulation in generalised curvilinear coordinates, the nonoscillatory option or the infinite-gauge variant, carry over to the fully third-order accurate scheme. A manufactured 3D analytic solution is used to verify the theoretical development and its numerical implementation, whereas global tracer-transport benchmarks demonstrate benefits for chemistry-transport models fundamental to air quality monitoring, forecasting and control. A series of explicitly-inviscid implicit large-eddy simulations of a convective boundary layer and explicitly-viscid simulations of a double shear layer illustrate advantages of the fully third-order-accurate MPDATA for fluid dynamics applications.

Generalized conjugate-gradient methods for the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1991-01-01

A generalized conjugate-gradient method is used to solve the two-dimensional, compressible Navier-Stokes equations of fluid flow. The equations are discretized with an implicit, upwind finite-volume formulation. Preconditioning techniques are incorporated into the new solver to accelerate convergence of the overall iterative method. The superiority of the new solver is demonstrated by comparisons with a conventional line Gauss-Siedel Relaxation solver. Computational test results for transonic flow (trailing edge flow in a transonic turbine cascade) and hypersonic flow (M = 6.0 shock-on-shock phenoena on a cylindrical leading edge) are presented. When applied to the transonic cascade case, the new solver is 4.4 times faster in terms of number of iterations and 3.1 times faster in terms of CPU time than the Relaxation solver. For the hypersonic shock case, the new solver is 3.0 times faster in terms of number of iterations and 2.2 times faster in terms of CPU time than the Relaxation solver.

Efficient simulation of incompressible viscous flow over multi-element airfoils

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.; Wiltberger, N. Lyn; Kwak, Dochan

1992-01-01

The incompressible, viscous, turbulent flow over single and multi-element airfoils is numerically simulated in an efficient manner by solving the incompressible Navier-Stokes equations. The computer code uses the method of pseudo-compressibility with an upwind-differencing scheme for the convective fluxes and an implicit line-relaxation solution algorithm. The motivation for this work includes interest in studying the high-lift take-off and landing configurations of various aircraft. In particular, accurate computation of lift and drag at various angles of attack, up to stall, is desired. Two different turbulence models are tested in computing the flow over an NACA 4412 airfoil; an accurate prediction of stall is obtained. The approach used for multi-element airfoils involves the use of multiple zones of structured grids fitted to each element. Two different approaches are compared: a patched system of grids, and an overlaid Chimera system of grids. Computational results are presented for two-element, three-element, and four-element airfoil configurations. Excellent agreement with experimental surface pressure coefficients is seen. The code converges in less than 200 iterations, requiring on the order of one minute of CPU time (on a CRAY YMP) per element in the airfoil configuration.

Efficient simulation of incompressible viscous flow over multi-element airfoils

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.; Wiltberger, N. Lyn; Kwak, Dochan

1993-01-01

The incompressible, viscous, turbulent flow over single and multi-element airfoils is numerically simulated in an efficient manner by solving the incompressible Navier-Stokes equations. The solution algorithm employs the method of pseudo compressibility and utilizes an upwind differencing scheme for the convective fluxes, and an implicit line-relaxation scheme. The motivation for this work includes interest in studying high-lift take-off and landing configurations of various aircraft. In particular, accurate computation of lift and drag at various angles of attack up to stall is desired. Two different turbulence models are tested in computing the flow over an NACA 4412 airfoil; an accurate prediction of stall is obtained. The approach used for multi-element airfoils involves the use of multiple zones of structured grids fitted to each element. Two different approaches are compared; a patched system of grids, and an overlaid Chimera system of grids. Computational results are presented for two-element, three-element, and four-element airfoil configurations. Excellent agreement with experimental surface pressure coefficients is seen. The code converges in less than 200 iterations, requiring on the order of one minute of CPU time on a CRAY YMP per element in the airfoil configuration.

Numerical aspects in modeling high Deborah number flow and elastic instability

NASA Astrophysics Data System (ADS)

Kwon, Youngdon

2014-05-01

Investigating highly nonlinear viscoelastic flow in 2D domain, we explore problem as well as property possibly inherent in the streamline upwinding technique (SUPG) and then present various results of elastic instability. The mathematically stable Leonov model written in tensor-logarithmic formulation is employed in the framework of finite element method for spatial discretization of several representative problem domains. For enhancement of computation speed, decoupled integration scheme is applied for shear thinning and Boger-type fluids. From the analysis of 4:1 contraction flow at low and moderate values of the Deborah number (De) the solution with SUPG method does not show noticeable difference from the one by the computation without upwinding. On the other hand, in the flow regime of high De, especially in the state of elastic instability the SUPG significantly distorts the flow field and the result differs considerably from the solution acquired straightforwardly. When the strength of elastic flow and thus the nonlinearity further increase, the computational scheme with upwinding fails to converge and evolutionary solution does not become available any more. All this result suggests that extreme care has to be taken on occasions where upwinding is applied, and one has to first of all prove validity of this algorithm in the case of high nonlinearity. On the contrary, the straightforward computation with no upwinding can efficiently model representative phenomena of elastic instability in such benchmark problems as 4:1 contraction flow, flow over a circular cylinder and flow over asymmetric array of cylinders. Asymmetry of the flow field occurring in the symmetric domain, enhanced spatial and temporal fluctuation of dynamic variables and flow effects caused by extension hardening are properly described in this study.

Numerical Simulations of the Boundary Layer Transition Flight Experiment

NASA Technical Reports Server (NTRS)

Tang, Chun Y.; Trumble, Kerry A.; Campbell, Charles H.; Lessard, Victor R.; Wood, William A.

2010-01-01

Computational Fluid Dynamics (CFD) simulations were used to study the possible effects that the Boundary Layer Transition (BLT) Flight Experiments may have on the heating environment of the Space Shuttle during its entry to Earth. To investigate this issue, hypersonic calculations using the Data-Parallel Line Relaxation (DPLR) and Langley Aerothermodynamic Upwind Relaxation (LAURA) CFD codes were computed for a 0.75 tall protuberance at flight conditions of Mach 15 and 18. These initial results showed high surface heating on the BLT trip and the areas surrounding the protuberance. Since the predicted peak heating rates would exceed the thermal limits of the materials selected to construct the BLT trip, many changes to the geometry were attempted in order to reduce the surface heat flux. The following paper describes the various geometry revisions and the resulting heating environments predicted by the CFD codes.

Multi-Dimensional, Inviscid Flux Reconstruction for Simulation of Hypersonic Heating on Tetrahedral Grids

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2009-01-01

The quality of simulated hypersonic stagnation region heating on tetrahedral meshes is investigated by using a three-dimensional, upwind reconstruction algorithm for the inviscid flux vector. Two test problems are investigated: hypersonic flow over a three-dimensional cylinder with special attention to the uniformity of the solution in the spanwise direction and hypersonic flow over a three-dimensional sphere. The tetrahedral cells used in the simulation are derived from a structured grid where cell faces are bisected across the diagonal resulting in a consistent pattern of diagonals running in a biased direction across the otherwise symmetric domain. This grid is known to accentuate problems in both shock capturing and stagnation region heating encountered with conventional, quasi-one-dimensional inviscid flux reconstruction algorithms. Therefore the test problem provides a sensitive test for algorithmic effects on heating. This investigation is believed to be unique in its focus on three-dimensional, rotated upwind schemes for the simulation of hypersonic heating on tetrahedral grids. This study attempts to fill the void left by the inability of conventional (quasi-one-dimensional) approaches to accurately simulate heating in a tetrahedral grid system. Results show significant improvement in spanwise uniformity of heating with some penalty of ringing at the captured shock. Issues with accuracy near the peak shear location are identified and require further study.

Prediction of the Thrust Performance and the Flowfield of Liquid Rocket Engines

NASA Technical Reports Server (NTRS)

Wang, T.-S.

1990-01-01

In an effort to improve the current solutions in the design and analysis of liquid propulsive engines, a computational fluid dynamics (CFD) model capable of calculating the reacting flows from the combustion chamber, through the nozzle to the external plume, was developed. The Space Shuttle Main Engine (SSME) fired at sea level, was investigated as a sample case. The CFD model, FDNS, is a pressure based, non-staggered grid, viscous/inviscid, ideal gas/real gas, reactive code. An adaptive upwinding differencing scheme is employed for the spatial discretization. The upwind scheme is based on fourth order central differencing with fourth order damping for smooth regions, and second order central differencing with second order damping for shock capturing. It is equipped with a CHMQGM equilibrium chemistry algorithm and a PARASOL finite rate chemistry algorithm using the point implicit method. The computed flow results and performance compared well with those of other standard codes and engine hot fire test data. In addition, the transient nozzle flowfield calculation was also performed to demonstrate the ability of FDNS in capturing the flow separation during the startup process.

Efficient and optimized identification of generalized Maxwell viscoelastic relaxation spectra

PubMed Central

Babaei, Behzad; Davarian, Ali; Pryse, Kenneth M.; Elson, Elliot L.; Genin, Guy M.

2017-01-01

Viscoelastic relaxation spectra are essential for predicting and interpreting the mechanical responses of materials and structures. For biological tissues, these spectra must usually be estimated from viscoelastic relaxation tests. Interpreting viscoelastic relaxation tests is challenging because the inverse problem is expensive computationally. We present here an efficient algorithm that enables rapid identification of viscoelastic relaxation spectra. The algorithm was tested against trial data to characterize its robustness and identify its limitations and strengths. The algorithm was then applied to identify the viscoelastic response of reconstituted collagen, revealing an extensive distribution of viscoelastic time constants. PMID:26523785

Addition of Improved Shock-Capturing Schemes to OVERFLOW 2.1

NASA Technical Reports Server (NTRS)

Burning, Pieter G.; Nichols, Robert H.; Tramel, Robert W.

2009-01-01

Existing approximate Riemann solvers do not perform well when the grid is not aligned with strong shocks in the flow field. Three new approximate Riemann algorithms are investigated to improve solution accuracy and stability in the vicinity of strong shocks. The new algorithms are compared to the existing upwind algorithms in OVERFLOW 2.1. The new algorithms use a multidimensional pressure gradient based switch to transition to a more numerically dissipative algorithm in the vicinity of strong shocks. One new algorithm also attempts to artificially thicken captured shocks in order to alleviate the errors in the solution introduced by "stair-stepping" of the shock resulting from the approximate Riemann solver. This algorithm performed well for all the example cases and produced results that were almost insensitive to the alignment of the grid and the shock.

Efficient parallel implicit methods for rotary-wing aerodynamics calculations

NASA Astrophysics Data System (ADS)

Wissink, Andrew M.

Euler/Navier-Stokes Computational Fluid Dynamics (CFD) methods are commonly used for prediction of the aerodynamics and aeroacoustics of modern rotary-wing aircraft. However, their widespread application to large complex problems is limited lack of adequate computing power. Parallel processing offers the potential for dramatic increases in computing power, but most conventional implicit solution methods are inefficient in parallel and new techniques must be adopted to realize its potential. This work proposes alternative implicit schemes for Euler/Navier-Stokes rotary-wing calculations which are robust and efficient in parallel. The first part of this work proposes an efficient parallelizable modification of the Lower Upper-Symmetric Gauss Seidel (LU-SGS) implicit operator used in the well-known Transonic Unsteady Rotor Navier Stokes (TURNS) code. The new hybrid LU-SGS scheme couples a point-relaxation approach of the Data Parallel-Lower Upper Relaxation (DP-LUR) algorithm for inter-processor communication with the Symmetric Gauss Seidel algorithm of LU-SGS for on-processor computations. With the modified operator, TURNS is implemented in parallel using Message Passing Interface (MPI) for communication. Numerical performance and parallel efficiency are evaluated on the IBM SP2 and Thinking Machines CM-5 multi-processors for a variety of steady-state and unsteady test cases. The hybrid LU-SGS scheme maintains the numerical performance of the original LU-SGS algorithm in all cases and shows a good degree of parallel efficiency. It experiences a higher degree of robustness than DP-LUR for third-order upwind solutions. The second part of this work examines use of Krylov subspace iterative solvers for the nonlinear CFD solutions. The hybrid LU-SGS scheme is used as a parallelizable preconditioner. Two iterative methods are tested, Generalized Minimum Residual (GMRES) and Orthogonal s-Step Generalized Conjugate Residual (OSGCR). The Newton method demonstrates good parallel performance on the IBM SP2, with OS-GCR giving slightly better performance than GMRES on large numbers of processors. For steady and quasi-steady calculations, the convergence rate is accelerated but the overall solution time remains about the same as the standard hybrid LU-SGS scheme. For unsteady calculations, however, the Newton method maintains a higher degree of time-accuracy which allows tbe use of larger timesteps and results in CPU savings of 20-35%.

Comments on the Diffusive Behavior of Two Upwind Schemes

NASA Technical Reports Server (NTRS)

Wood, William A.; Kleb, William L.

1998-01-01

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and locally one-dimensional finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2.5 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a speedup of 29 over finite volume.

Multi-dimensional upwinding-based implicit LES for the vorticity transport equations

NASA Astrophysics Data System (ADS)

Foti, Daniel; Duraisamy, Karthik

2017-11-01

Complex turbulent flows such as rotorcraft and wind turbine wakes are characterized by the presence of strong coherent structures that can be compactly described by vorticity variables. The vorticity-velocity formulation of the incompressible Navier-Stokes equations is employed to increase numerical efficiency. Compared to the traditional velocity-pressure formulation, high order numerical methods and sub-grid scale models for the vorticity transport equation (VTE) have not been fully investigated. Consistent treatment of the convection and stretching terms also needs to be addressed. Our belief is that, by carefully designing sharp gradient-capturing numerical schemes, coherent structures can be more efficiently captured using the vorticity-velocity formulation. In this work, a multidimensional upwind approach for the VTE is developed using the generalized Riemann problem-based scheme devised by Parish et al. (Computers & Fluids, 2016). The algorithm obtains high resolution by augmenting the upwind fluxes with transverse and normal direction corrections. The approach is investigated with several canonical vortex-dominated flows including isolated and interacting vortices and turbulent flows. The capability of the technique to represent sub-grid scale effects is also assessed. Navy contract titled ``Turbulence Modelling Across Disparate Length Scales for Naval Computational Fluid Dynamics Applications,'' through Continuum Dynamics, Inc.

Diffusion Characteristics of Upwind Schemes on Unstructured Triangulations

NASA Technical Reports Server (NTRS)

Wood, William A.; Kleb, William L.

1998-01-01

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and dimensionally-split finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the dimensionally-split finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2-3 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a 20-25 speedup over finite volume.

Numerical solution of special ultra-relativistic Euler equations using central upwind scheme

NASA Astrophysics Data System (ADS)

Ghaffar, Tayabia; Yousaf, Muhammad; Qamar, Shamsul

2018-06-01

This article is concerned with the numerical approximation of one and two-dimensional special ultra-relativistic Euler equations. The governing equations are coupled first-order nonlinear hyperbolic partial differential equations. These equations describe perfect fluid flow in terms of the particle density, the four-velocity and the pressure. A high-resolution shock-capturing central upwind scheme is employed to solve the model equations. To avoid excessive numerical diffusion, the considered scheme avails the specific information of local propagation speeds. By using Runge-Kutta time stepping method and MUSCL-type initial reconstruction, we have obtained 2nd order accuracy of the proposed scheme. After discussing the model equations and the numerical technique, several 1D and 2D test problems are investigated. For all the numerical test cases, our proposed scheme demonstrates very good agreement with the results obtained by well-established algorithms, even in the case of highly relativistic 2D test problems. For validation and comparison, the staggered central scheme and the kinetic flux-vector splitting (KFVS) method are also implemented to the same model. The robustness and efficiency of central upwind scheme is demonstrated by the numerical results.

Efficient and optimized identification of generalized Maxwell viscoelastic relaxation spectra.

PubMed

Babaei, Behzad; Davarian, Ali; Pryse, Kenneth M; Elson, Elliot L; Genin, Guy M

2015-03-01

Viscoelastic relaxation spectra are essential for predicting and interpreting the mechanical responses of materials and structures. For biological tissues, these spectra must usually be estimated from viscoelastic relaxation tests. Interpreting viscoelastic relaxation tests is challenging because the inverse problem is expensive computationally. We present here an efficient algorithm that enables rapid identification of viscoelastic relaxation spectra. The algorithm was tested against trial data to characterize its robustness and identify its limitations and strengths. The algorithm was then applied to identify the viscoelastic response of reconstituted collagen, revealing an extensive distribution of viscoelastic time constants. Copyright © 2015 Elsevier Ltd. All rights reserved.

An integrated algorithm for hypersonic fluid-thermal-structural numerical simulation

NASA Astrophysics Data System (ADS)

Li, Jia-Wei; Wang, Jiang-Feng

2018-05-01

In this paper, a fluid-structural-thermal integrated method is presented based on finite volume method. A unified integral equations system is developed as the control equations for physical process of aero-heating and structural heat transfer. The whole physical field is discretized by using an up-wind finite volume method. To demonstrate its capability, the numerical simulation of Mach 6.47 flow over stainless steel cylinder shows a good agreement with measured values, and this method dynamically simulates the objective physical processes. Thus, the integrated algorithm proves to be efficient and reliable.

Developing a Learning Algorithm-Generated Empirical Relaxer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitchell, Wayne; Kallman, Josh; Toreja, Allen

2016-03-30

One of the main difficulties when running Arbitrary Lagrangian-Eulerian (ALE) simulations is determining how much to relax the mesh during the Eulerian step. This determination is currently made by the user on a simulation-by-simulation basis. We present a Learning Algorithm-Generated Empirical Relaxer (LAGER) which uses a regressive random forest algorithm to automate this decision process. We also demonstrate that LAGER successfully relaxes a variety of test problems, maintains simulation accuracy, and has the potential to significantly decrease both the person-hours and computational hours needed to run a successful ALE simulation.

Upwind MacCormack Euler solver with non-equilibrium chemistry

NASA Technical Reports Server (NTRS)

Sherer, Scott E.; Scott, James N.

1993-01-01

A computer code, designated UMPIRE, is currently under development to solve the Euler equations in two dimensions with non-equilibrium chemistry. UMPIRE employs an explicit MacCormack algorithm with dissipation introduced via Roe's flux-difference split upwind method. The code also has the capability to employ a point-implicit methodology for flows where stiffness is introduced through the chemical source term. A technique consisting of diagonal sweeps across the computational domain from each corner is presented, which is used to reduce storage and execution requirements. Results depicting one dimensional shock tube flow for both calorically perfect gas and thermally perfect, dissociating nitrogen are presented to verify current capabilities of the program. Also, computational results from a chemical reactor vessel with no fluid dynamic effects are presented to check the chemistry capability and to verify the point implicit strategy.

Analysis of Effectiveness of Phoenix Entry Reaction Control System

NASA Technical Reports Server (NTRS)

Dyakonov, Artem A.; Glass, Christopher E.; Desai, Prasun, N.; VanNorman, John W.

2008-01-01

Interaction between the external flowfield and the reaction control system (RCS) thruster plumes of the Phoenix capsule during entry has been investigated. The analysis covered rarefied, transitional, hypersonic and supersonic flight regimes. Performance of pitch, yaw and roll control authority channels was evaluated, with specific emphasis on the yaw channel due to its low nominal yaw control authority. Because Phoenix had already been constructed and its RCS could not be modified before flight, an assessment of RCS efficacy along the trajectory was needed to determine possible issues and to make necessary software changes. Effectiveness of the system at various regimes was evaluated using a hybrid DSMC-CFD technique, based on DSMC Analysis Code (DAC) code and General Aerodynamic Simulation Program (GASP), the LAURA (Langley Aerothermal Upwind Relaxation Algorithm) code, and the FUN3D (Fully Unstructured 3D) code. Results of the analysis at hypersonic and supersonic conditions suggest a significant aero-RCS interference which reduced the efficacy of the thrusters and could likely produce control reversal. Very little aero-RCS interference was predicted in rarefied and transitional regimes. A recommendation was made to the project to widen controller system deadbands to minimize (if not eliminate) the use of RCS thrusters through hypersonic and supersonic flight regimes, where their performance would be uncertain.

Measured and Computed Hypersonic Aerodynamic/Aeroheating Characteristics for an Elliptically Blunted Flared Cylinder

NASA Technical Reports Server (NTRS)

Greene, Francis A.; Buck, Gregory M.; Wood, William A.

2001-01-01

Computational and experimental hypersonic aerodynamic forces and moments and aeroheating levels for Kistler Aerospace Corporation's baseline orbiter vehicle at incidence are presented. Experimental data were measured in ground-based facilities at the Langley Research Center and predictions were performed using the Langley Aerothermodynamic Upwind Relaxation Algorithm code. The test parameters were incidence (-4 to 24 degrees), freestream Mach number (6 to 10),freestream ratio o specific heats (1.2 to 1.4), and freestream Reynolds number (0.5 to 8.0 million per foot). The effects of these parameters on aerodynamic characteristics, as well as the effects of Reynolds number on measured heating levels are discussed. Good agreement between computational and experimental aerodynamic and aeroheating values were observed over the wide range of test parameters examined. Reynolds number and ratio of specific heats were observed to significantly alter the trim L/D value. At Mach 6, laminar flow was observed along the entire windward centerline tip to the flare for all angles and Reynolds numbers tested. Flow over the flare transitioned from laminar to transitional/turbulent between 4 and 8 million per foot at 8 and 12 degrees angle of attack, and near 4 million per foot at 16 degrees angle of attack.

Re-Entry Aeroheating Analysis of Tile-Repair Augers for the Shuttle Orbiter

NASA Technical Reports Server (NTRS)

Mazaheri, Ali R.; Wood, William A.

2007-01-01

Computational re-entry aerothermodynamic analysis of the Space Shuttle Orbiter s tile overlay repair (TOR) sub-assembly is presented. Entry aeroheating analyses are conducted to characterize the aerothermodynamic environment of the TOR and to provide necessary inputs for future TOR thermal and structural analyses. The TOR sub-assembly consists of a thin plate and several augers and spacers that serve as the TOR fasteners. For the computational analysis, the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) is used. A 5-species non-equilibrium chemistry model with a finite rate catalytic recombination model and a radiation equilibrium wall condition are used. It is assumed that wall properties are the same as reaction cured glass (RCG) properties with a surface emissivity of epsilon = 0.89. Surface heat transfer rates for the TOR and tile repair augers (TRA) are computed at a STS-107 trajectory point corresponding to Mach 18 free stream conditions. Computational results show that the average heating bump factor (BF), which is a ratio of local heat transfer rate to a design reference point located at the damage site, for the auger head alone is about 1.9. It is also shown that the average BF for the combined auger and washer heads is about 2.0.

An upwind space-time conservation element and solution element scheme for solving dusty gas flow model

NASA Astrophysics Data System (ADS)

Rehman, Asad; Ali, Ishtiaq; Qamar, Shamsul

An upwind space-time conservation element and solution element (CE/SE) scheme is extended to numerically approximate the dusty gas flow model. Unlike central CE/SE schemes, the current method uses the upwind procedure to derive the numerical fluxes through the inner boundary of conservation elements. These upwind fluxes are utilized to calculate the gradients of flow variables. For comparison and validation, the central upwind scheme is also applied to solve the same dusty gas flow model. The suggested upwind CE/SE scheme resolves the contact discontinuities more effectively and preserves the positivity of flow variables in low density flows. Several case studies are considered and the results of upwind CE/SE are compared with the solutions of central upwind scheme. The numerical results show better performance of the upwind CE/SE method as compared to the central upwind scheme.

Three-dimensional multigrid algorithms for the flux-split Euler equations

NASA Technical Reports Server (NTRS)

Anderson, W. Kyle; Thomas, James L.; Whitfield, David L.

1988-01-01

The Full Approximation Scheme (FAS) multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each of the splitting algorithms uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computation required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined.

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

NASA Technical Reports Server (NTRS)

Bart, Timothy J.; Kutler, Paul (Technical Monitor)

1998-01-01

Chapter 1 briefly reviews several related topics associated with the symmetrization of systems of conservation laws and quasi-conservation laws: (1) Basic Entropy Symmetrization Theory; (2) Symmetrization and eigenvector scaling; (3) Symmetrization of the compressible Navier-Stokes equations; and (4) Symmetrization of the quasi-conservative form of the magnetohydrodynamic (MHD) equations. Chapter 2 describes one of the best known tools employed in the study of differential equations, the maximum principle: any function f(x) which satisfies the inequality f(double prime)>0 on the interval [a,b] attains its maximum value at one of the endpoints on the interval. Chapter three examines the upwind finite volume schemes for scalar and system conservation laws. The basic tasks in the upwind finite volume approach have already been presented: reconstruction, flux evaluation, and evolution. By far, the most difficult task in this process is the reconstruction step.

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

PubMed

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

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

NASA Technical Reports Server (NTRS)

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

1995-01-01

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

Preconditioned conjugate gradient methods for the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1994-01-01

A preconditioned Krylov subspace method (GMRES) is used to solve the linear systems of equations formed at each time-integration step of the unsteady, two-dimensional, compressible Navier-Stokes equations of fluid flow. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux-split formulation. Several preconditioning techniques are investigated to enhance the efficiency and convergence rate of the implicit solver based on the GMRES algorithm. The superiority of the new solver is established by comparisons with a conventional implicit solver, namely line Gauss-Seidel relaxation (LGSR). Computational test results for low-speed (incompressible flow over a backward-facing step at Mach 0.1), transonic flow (trailing edge flow in a transonic turbine cascade), and hypersonic flow (shock-on-shock interactions on a cylindrical leading edge at Mach 6.0) are presented. For the Mach 0.1 case, overall speedup factors of up to 17 (in terms of time-steps) and 15 (in terms of CPU time on a CRAY-YMP/8) are found in favor of the preconditioned GMRES solver, when compared with the LGSR solver. The corresponding speedup factors for the transonic flow case are 17 and 23, respectively. The hypersonic flow case shows slightly lower speedup factors of 9 and 13, respectively. The study of preconditioners conducted in this research reveals that a new LUSGS-type preconditioner is much more efficient than a conventional incomplete LU-type preconditioner.

Aerothermodynamic Analysis of Commercial Experiment Transporter (COMET) Reentry Capsule

NASA Technical Reports Server (NTRS)

Wood, William A.; Gnoffo, Peter A.; Rault, Didier F. G.

1996-01-01

An aerothermodynamic analysis of the Commercial Experiment Transporter (COMET) reentry capsule has been performed using the laminar thin-layer Navier-Stokes solver Langley Aerothermodynamic Upwind Relaxation Algorithm. Flowfield solutions were obtained at Mach numbers 1.5, 2, 5, 10, 15, 20, 25, and 27.5. Axisymmetric and 5, 10, and 20 degree angles of attack were considered across the Mach-number range, with the Mach 25 conditions taken to 90 degrees angle of attack and the Mach 27.5 cases taken to 60 degrees angle of attack. Detailed surface heat-transfer rates were computed at Mach 20 and 25, revealing that heating rates on the heat-shield shoulder ,can exceed the stagnation-point heating by 230 percent. Finite-rate chemistry solutions were performed above Mach 10, otherwise perfect gas computations were made. Drag, lift, and pitching moment coefficients are computed and details of a wake flow are presented. The effect of including the wake in the solution domain was investigated and base pressure corrections to forebody drag coefficients were numerically determined for the lower Mach numbers. Pitching moment comparisons are made with direct simulation Monte Carlo results in the more rarefied flow at the highest Mach numbers, showing agreement within two-percent. Thin-layer Navier-Stokes computations of the axial force are found to be 15 percent higher across the speed range than the empirical/Newtonian based results used during the initial trajectory analyses.

A Linear Bicharacteristic FDTD Method

NASA Technical Reports Server (NTRS)

Beggs, John H.

2001-01-01

The linear bicharacteristic scheme (LBS) was originally developed to improve unsteady solutions in computational acoustics and aeroacoustics [1]-[7]. It is a classical leapfrog algorithm, but is combined with upwind bias in the spatial derivatives. This approach preserves the time-reversibility of the leapfrog algorithm, which results in no dissipation, and it permits more flexibility by the ability to adopt a characteristic based method. The use of characteristic variables allows the LBS to treat the outer computational boundaries naturally using the exact compatibility equations. The LBS offers a central storage approach with lower dispersion than the Yee algorithm, plus it generalizes much easier to nonuniform grids. It has previously been applied to two and three-dimensional freespace electromagnetic propagation and scattering problems [3], [6], [7]. This paper extends the LBS to model lossy dielectric and magnetic materials. Results are presented for several one-dimensional model problems, and the FDTD algorithm is chosen as a convenient reference for comparison.

Investigation of the transient fuel preburner manifold and combustor

NASA Technical Reports Server (NTRS)

Wang, Ten-See; Chen, Yen-Sen; Farmer, Richard C.

1989-01-01

A computational fluid dynamics (CFD) model with finite rate reactions, FDNS, was developed to study the start transient of the Space Shuttle Main Engine (SSME) fuel preburner (FPB). FDNS is a time accurate, pressure based CFD code. An upwind scheme was employed for spatial discretization. The upwind scheme was based on second and fourth order central differencing with adaptive artificial dissipation. A state of the art two-equation k-epsilon (T) turbulence model was employed for the turbulence calculation. A Pade' Rational Solution (PARASOL) chemistry algorithm was coupled with the point implicit procedure. FDNS was benchmarked with three well documented experiments: a confined swirling coaxial jet, a non-reactive ramjet dump combustor, and a reactive ramjet dump combustor. Excellent comparisons were obtained for the benchmark cases. The code was then used to study the start transient of an axisymmetric SSME fuel preburner. Predicted transient operation of the preburner agrees well with experiment. Furthermore, it was also found that an appreciable amount of unburned oxygen entered the turbine stages.

Multidimensional upwind hydrodynamics on unstructured meshes using graphics processing units - I. Two-dimensional uniform meshes

NASA Astrophysics Data System (ADS)

Paardekooper, S.-J.

2017-08-01

We present a new method for numerical hydrodynamics which uses a multidimensional generalization of the Roe solver and operates on an unstructured triangular mesh. The main advantage over traditional methods based on Riemann solvers, which commonly use one-dimensional flux estimates as building blocks for a multidimensional integration, is its inherently multidimensional nature, and as a consequence its ability to recognize multidimensional stationary states that are not hydrostatic. A second novelty is the focus on graphics processing units (GPUs). By tailoring the algorithms specifically to GPUs, we are able to get speedups of 100-250 compared to a desktop machine. We compare the multidimensional upwind scheme to a traditional, dimensionally split implementation of the Roe solver on several test problems, and we find that the new method significantly outperforms the Roe solver in almost all cases. This comes with increased computational costs per time-step, which makes the new method approximately a factor of 2 slower than a dimensionally split scheme acting on a structured grid.

Improved numerical methods for turbulent viscous recirculating flows

NASA Technical Reports Server (NTRS)

Turan, A.

1985-01-01

The hybrid-upwind finite difference schemes employed in generally available combustor codes possess excessive numerical diffusion errors which preclude accurate quantative calculations. The present study has as its primary objective the identification and assessment of an improved solution algorithm as well as discretization schemes applicable to analysis of turbulent viscous recirculating flows. The assessment is carried out primarily in two dimensional/axisymetric geometries with a view to identifying an appropriate technique to be incorporated in a three-dimensional code.

A detailed analysis of inviscid flux splitting algorithms for real gases with equilibrium or finite-rate chemistry

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun; Liou, Meng-Sing; Van Leer, Bram

1989-01-01

The extension of the known flux-vector and flux-difference splittings to real gases via rigorous mathematical procedures is demonstrated. Formulations of both equilibrium and finite-rate chemistry for real-gas flows are described, with emphasis on derivations of finite-rate chemistry. Split-flux formulas from other authors are examined. A second-order upwind-based TVD scheme is adopted to eliminate oscillations and to obtain a sharp representation of discontinuities.

Multigrid schemes for viscous hypersonic flows

NASA Technical Reports Server (NTRS)

Swanson, R. C.; Radespiel, R.

1993-01-01

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm employs upwind spatial discretization with explicit multistage time stepping. Two-level versions of the various multigrid algorithms are applied to the two-dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving two different hypersonic flow problems. Some new multigrid schemes, based on semicoarsening strategies, are shown to be quite effective in relieving the stiffness caused by the high-aspect-ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6).

Solving LP Relaxations of Large-Scale Precedence Constrained Problems

NASA Astrophysics Data System (ADS)

Bienstock, Daniel; Zuckerberg, Mark

We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that can be employed on a wide range of problems; on data sets arising in the mining industry our algorithms prove effective on problems with many millions of variables and constraints, obtaining provably optimal solutions in a few minutes of computation.

Comparison of Implicit Schemes for the Incompressible Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.

1995-01-01

For a computational flow simulation tool to be useful in a design environment, it must be very robust and efficient. To develop such a tool for incompressible flow applications, a number of different implicit schemes are compared for several two-dimensional flow problems in the current study. The schemes include Point-Jacobi relaxation, Gauss-Seidel line relaxation, incomplete lower-upper decomposition, and the generalized minimum residual method preconditioned with each of the three other schemes. The efficiency of the schemes is measured in terms of the computing time required to obtain a steady-state solution for the laminar flow over a backward-facing step, the flow over a NACA 4412 airfoil, and the flow over a three-element airfoil using overset grids. The flow solver used in the study is the INS2D code that solves the incompressible Navier-Stokes equations using the method of artificial compressibility and upwind differencing of the convective terms. The results show that the generalized minimum residual method preconditioned with the incomplete lower-upper factorization outperforms all other methods by at least a factor of 2.

Curved-line search algorithm for ab initio atomic structure relaxation

NASA Astrophysics Data System (ADS)

Chen, Zhanghui; Li, Jingbo; Li, Shushen; Wang, Lin-Wang

2017-09-01

Ab initio atomic relaxations often take large numbers of steps and long times to converge, especially when the initial atomic configurations are far from the local minimum or there are curved and narrow valleys in the multidimensional potentials. An atomic relaxation method based on on-the-flight force learning and a corresponding curved-line search algorithm is presented to accelerate this process. Results demonstrate the superior performance of this method for metal and magnetic clusters when compared with the conventional conjugate-gradient method.

Wideband RELAX and wideband CLEAN for aeroacoustic imaging

NASA Astrophysics Data System (ADS)

Wang, Yanwei; Li, Jian; Stoica, Petre; Sheplak, Mark; Nishida, Toshikazu

2004-02-01

Microphone arrays can be used for acoustic source localization and characterization in wind tunnel testing. In this paper, the wideband RELAX (WB-RELAX) and the wideband CLEAN (WB-CLEAN) algorithms are presented for aeroacoustic imaging using an acoustic array. WB-RELAX is a parametric approach that can be used efficiently for point source imaging without the sidelobe problems suffered by the delay-and-sum beamforming approaches. WB-CLEAN does not have sidelobe problems either, but it behaves more like a nonparametric approach and can be used for both point source and distributed source imaging. Moreover, neither of the algorithms suffers from the severe performance degradations encountered by the adaptive beamforming methods when the number of snapshots is small and/or the sources are highly correlated or coherent with each other. A two-step optimization procedure is used to implement the WB-RELAX and WB-CLEAN algorithms efficiently. The performance of WB-RELAX and WB-CLEAN is demonstrated by applying them to measured data obtained at the NASA Langley Quiet Flow Facility using a small aperture directional array (SADA). Somewhat surprisingly, using these approaches, not only were the parameters of the dominant source accurately determined, but a highly correlated multipath of the dominant source was also discovered.

Wideband RELAX and wideband CLEAN for aeroacoustic imaging.

PubMed

Wang, Yanwei; Li, Jian; Stoica, Petre; Sheplak, Mark; Nishida, Toshikazu

2004-02-01

Microphone arrays can be used for acoustic source localization and characterization in wind tunnel testing. In this paper, the wideband RELAX (WB-RELAX) and the wideband CLEAN (WB-CLEAN) algorithms are presented for aeroacoustic imaging using an acoustic array. WB-RELAX is a parametric approach that can be used efficiently for point source imaging without the sidelobe problems suffered by the delay-and-sum beamforming approaches. WB-CLEAN does not have sidelobe problems either, but it behaves more like a nonparametric approach and can be used for both point source and distributed source imaging. Moreover, neither of the algorithms suffers from the severe performance degradations encountered by the adaptive beamforming methods when the number of snapshots is small and/or the sources are highly correlated or coherent with each other. A two-step optimization procedure is used to implement the WB-RELAX and WB-CLEAN algorithms efficiently. The performance of WB-RELAX and WB-CLEAN is demonstrated by applying them to measured data obtained at the NASA Langley Quiet Flow Facility using a small aperture directional array (SADA). Somewhat surprisingly, using these approaches, not only were the parameters of the dominant source accurately determined, but a highly correlated multipath of the dominant source was also discovered.

Free-Piston Shock Tunnel Test Technique Development: An AEDC/DLR Cooperative Program

DTIC Science & Technology

2003-02-01

Calibration Data." AIAA-95-6039, April 1995. 15. Molvik, G. A., and Merkle , C. L. "A Set of Strongly Coupled, Upwind Algorithms for Com- puting Flows in...April 1997. h. Date of Termination: 28 April 2002. i. All Signing Officials, Title/Offices Represented, and Countries: (1) Herr Rolf Schreiber, Chief...agreement by the RTP MOU Executive Agents. The US RTP/EA Signature Signature Clinton V. Hom, Maj Gen. USAF Rolf Schreiber Name Name Principal Assistant

Scramjet Combustor Simulations Using Reduced Chemical Kinetics for Practical Fuels

DTIC Science & Technology

2003-12-01

the aerospace industry in reducing prototype and testing costs and the time needed to bring products to market . Accurate simulation of chemical...JP-8 kinetics and soot models into the UNICORN CFD code (Montgomery et al., 2003a) NSF Phase I and II SBIRs for development of a computer-assisted...divided by diameter QSS quasi-steady state REI Reaction Engineering International UNICORN UNsteady Ignition and COmbustion with ReactioNs VULCAN Viscous Upwind aLgorithm for Complex flow ANalysis

CFD in the 1980's from one point of view

NASA Technical Reports Server (NTRS)

Lomax, Harvard

1991-01-01

The present interpretive treatment of the development history of CFD in the 1980s gives attention to advancements in such algorithmic techniques as flux Jacobian-based upwind differencing, total variation-diminishing and essentially nonoscillatory schemes, multigrid methods, unstructured grids, and nonrectangular structured grids. At the same time, computational turbulence research gave attention to turbulence modeling on the bases of increasingly powerful supercomputers and meticulously constructed databases. The major future developments in CFD will encompass such capabilities as structured and unstructured three-dimensional grids.

Multigrid Method for Modeling Multi-Dimensional Combustion with Detailed Chemistry

NASA Technical Reports Server (NTRS)

Zheng, Xiaoqing; Liu, Chaoqun; Liao, Changming; Liu, Zhining; McCormick, Steve

1996-01-01

A highly accurate and efficient numerical method is developed for modeling 3-D reacting flows with detailed chemistry. A contravariant velocity-based governing system is developed for general curvilinear coordinates to maintain simplicity of the continuity equation and compactness of the discretization stencil. A fully-implicit backward Euler technique and a third-order monotone upwind-biased scheme on a staggered grid are used for the respective temporal and spatial terms. An efficient semi-coarsening multigrid method based on line-distributive relaxation is used as the flow solver. The species equations are solved in a fully coupled way and the chemical reaction source terms are treated implicitly. Example results are shown for a 3-D gas turbine combustor with strong swirling inflows.

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Elmiligui, Alaa; Ash, Robert L.

1992-01-01

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

High-order upwind schemes for the wave equation on overlapping grids: Maxwell's equations in second-order form

DOE Office of Scientific and Technical Information (OSTI.GOV)

Angel, Jordan B.; Banks, Jeffrey W.; Henshaw, William D.

High-order accurate upwind approximations for the wave equation in second-order form on overlapping grids are developed. Although upwind schemes are well established for first-order hyperbolic systems, it was only recently shown by Banks and Henshaw how upwinding could be incorporated into the second-order form of the wave equation. This new upwind approach is extended here to solve the time-domain Maxwell's equations in second-order form; schemes of arbitrary order of accuracy are formulated for general curvilinear grids. Taylor time-stepping is used to develop single-step space-time schemes, and the upwind dissipation is incorporated by embedding the exact solution of a local Riemannmore » problem into the discretization. Second-order and fourth-order accurate schemes are implemented for problems in two and three space dimensions, and overlapping grids are used to treat complex geometry and problems with multiple materials. Stability analysis of the upwind-scheme on overlapping grids is performed using normal mode theory. The stability analysis and computations confirm that the upwind scheme remains stable on overlapping grids, including the difficult case of thin boundary grids when the traditional non-dissipative scheme becomes unstable. The accuracy properties of the scheme are carefully evaluated on a series of classical scattering problems for both perfect conductors and dielectric materials in two and three space dimensions. Finally, the upwind scheme is shown to be robust and provide high-order accuracy.« less

High-order upwind schemes for the wave equation on overlapping grids: Maxwell's equations in second-order form

DOE PAGES

Angel, Jordan B.; Banks, Jeffrey W.; Henshaw, William D.

2017-09-28

High-order accurate upwind approximations for the wave equation in second-order form on overlapping grids are developed. Although upwind schemes are well established for first-order hyperbolic systems, it was only recently shown by Banks and Henshaw how upwinding could be incorporated into the second-order form of the wave equation. This new upwind approach is extended here to solve the time-domain Maxwell's equations in second-order form; schemes of arbitrary order of accuracy are formulated for general curvilinear grids. Taylor time-stepping is used to develop single-step space-time schemes, and the upwind dissipation is incorporated by embedding the exact solution of a local Riemannmore » problem into the discretization. Second-order and fourth-order accurate schemes are implemented for problems in two and three space dimensions, and overlapping grids are used to treat complex geometry and problems with multiple materials. Stability analysis of the upwind-scheme on overlapping grids is performed using normal mode theory. The stability analysis and computations confirm that the upwind scheme remains stable on overlapping grids, including the difficult case of thin boundary grids when the traditional non-dissipative scheme becomes unstable. The accuracy properties of the scheme are carefully evaluated on a series of classical scattering problems for both perfect conductors and dielectric materials in two and three space dimensions. Finally, the upwind scheme is shown to be robust and provide high-order accuracy.« less

High-order upwind schemes for the wave equation on overlapping grids: Maxwell's equations in second-order form

NASA Astrophysics Data System (ADS)

Angel, Jordan B.; Banks, Jeffrey W.; Henshaw, William D.

2018-01-01

High-order accurate upwind approximations for the wave equation in second-order form on overlapping grids are developed. Although upwind schemes are well established for first-order hyperbolic systems, it was only recently shown by Banks and Henshaw [1] how upwinding could be incorporated into the second-order form of the wave equation. This new upwind approach is extended here to solve the time-domain Maxwell's equations in second-order form; schemes of arbitrary order of accuracy are formulated for general curvilinear grids. Taylor time-stepping is used to develop single-step space-time schemes, and the upwind dissipation is incorporated by embedding the exact solution of a local Riemann problem into the discretization. Second-order and fourth-order accurate schemes are implemented for problems in two and three space dimensions, and overlapping grids are used to treat complex geometry and problems with multiple materials. Stability analysis of the upwind-scheme on overlapping grids is performed using normal mode theory. The stability analysis and computations confirm that the upwind scheme remains stable on overlapping grids, including the difficult case of thin boundary grids when the traditional non-dissipative scheme becomes unstable. The accuracy properties of the scheme are carefully evaluated on a series of classical scattering problems for both perfect conductors and dielectric materials in two and three space dimensions. The upwind scheme is shown to be robust and provide high-order accuracy.

Field comparison of an eddy accumulation and an aerodynamic-gradient system for measuring pesticide volatilization fluxes

USGS Publications Warehouse

Majewski, M.; Desjardina, R.; Rochette, P.; Pattey, E.; Selber, J.; Glotfelty, D.

1993-01-01

The field experiment reported here applied the relaxed eddy accumulation (REA) technique to the measurement of triallate (TA) and trifluralin (TF) volatilization from fallow soil. A critical analysis of the REA system used in this experiment is done, and the fluxes are compared to those obtained by the aerodynamic-gradient (AG) technique. The measured cumulative volatilization losses, corrected for the effective upwind source area (footprint), for the AG system were higher than with the REA system. The differences between the methods over the first 5 days of the experiment were 27 and 13% for TA and TF, respectively. A mass balance based on the amount of parent compounds volatilized from soil during the first 5 days of the experiment showed a 110 and 70% and a 79 and 61% accountability for triallate and trifluralin by the AG and REA methods, respectively. These results also show that the non-footprint-corrected AG flux values underestimated the volatilization flux by approximately 16%. The footprint correction model used in this experiment does not presently have the capability of accounting for changes in atmospheric stability. However, these values still provide an indication of the most likely upwind area affecting the evaporative flux estimations. The soil half-lives for triallate and trifluralin were 9.8 and 7.0 days, respectively. ?? 1992 American Chemical Society.

Stable and low diffusive hybrid upwind splitting methods

NASA Technical Reports Server (NTRS)

Coquel, Frederic; Liou, Meng-Sing

1992-01-01

A new concept for upwinding is introduced, named the hybrid upwind splitting (HUS), which is achieved by combining the basically distinct flux vector splitting (FVS) and the flux difference splitting (FDS) approaches. The HUS approach yields upwind methods which share the robustness of the FVS schemes in the capture of nonlinear waves and the accuracy of some of the FDS schemes. Numerical illustrations are presented proving the relevance of the HUS methods for viscous calculations.

Comparison of Nonequilibrium Solution Algorithms Applied to Chemically Stiff Hypersonic Flows

NASA Technical Reports Server (NTRS)

Palmer, Grant; Venkatapathy, Ethiraj

1995-01-01

Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15 and 30, the lower-upper symmetric Gauss-Seidel method produces an eight order of magnitude drop in the energy residual in one-third to one-half the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 30 and above. At Mach 40 the performance of the lower-upper symmetric Gauss-Seidel algorithm deteriorates to the point that it is out performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

A Well-Calibrated Ocean Algorithm for Special Sensor Microwave/Imager

NASA Technical Reports Server (NTRS)

Wentz, Frank J.

1997-01-01

I describe an algorithm for retrieving geophysical parameters over the ocean from special sensor microwave/imager (SSM/I) observations. This algorithm is based on a model for the brightness temperature T(sub B) of the ocean and intervening atmosphere. The retrieved parameters are the near-surface wind speed W, the columnar water vapor V, the columnar cloud liquid water L, and the line-of-sight wind W(sub LS). I restrict my analysis to ocean scenes free of rain, and when the algorithm detects rain, the retrievals are discarded. The model and algorithm are precisely calibrated using a very large in situ database containing 37,650 SSM/I overpasses of buoys and 35,108 overpasses of radiosonde sites. A detailed error analysis indicates that the T(sub B) model rms accuracy is between 0.5 and 1 K and that the rms retrieval accuracies for wind, vapor, and cloud are 0.9 m/s, 1.2 mm, and 0.025 mm, respectively. The error in specifying the cloud temperature will introduce an additional 10% error in the cloud water retrieval. The spatial resolution for these accuracies is 50 km. The systematic errors in the retrievals are smaller than the rms errors, being about 0.3 m/s, 0.6 mm, and 0.005 mm for W, V, and L, respectively. The one exception is the systematic error in wind speed of -1.0 m/s that occurs for observations within +/-20 deg of upwind. The inclusion of the line-of-sight wind W(sub LS) in the retrieval significantly reduces the error in wind speed due to wind direction variations. The wind error for upwind observations is reduced from -3.0 to -1.0 m/s. Finally, I find a small signal in the 19-GHz, horizontal polarization (h(sub pol) T(sub B) residual DeltaT(sub BH) that is related to the effective air pressure of the water vapor profile. This information may be of some use in specifying the vertical distribution of water vapor.

Progress with multigrid schemes for hypersonic flow problems

NASA Technical Reports Server (NTRS)

Radespiel, R.; Swanson, R. C.

1991-01-01

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm uses upwind spatial discretization with explicit multistage time stepping. Two level versions of the various multigrid algorithms are applied to the two dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving three different hypersonic flow problems. Some new multigrid schemes based on semicoarsening strategies are shown to be quite effective in relieving the stiffness caused by the high aspect ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6) and Mach numbers up to 25.

Comparison of Several Dissipation Algorithms for Central Difference Schemes

NASA Technical Reports Server (NTRS)

Swanson, R. C.; Radespiel, R.; Turkel, E.

1997-01-01

Several algorithms for introducing artificial dissipation into a central difference approximation to the Euler and Navier Stokes equations are considered. The focus of the paper is on the convective upwind and split pressure (CUSP) scheme, which is designed to support single interior point discrete shock waves. This scheme is analyzed and compared in detail with scalar and matrix dissipation (MATD) schemes. Resolution capability is determined by solving subsonic, transonic, and hypersonic flow problems. A finite-volume discretization and a multistage time-stepping scheme with multigrid are used to compute solutions to the flow equations. Numerical results are also compared with either theoretical solutions or experimental data. For transonic airfoil flows the best accuracy on coarse meshes for aerodynamic coefficients is obtained with a simple MATD scheme.

Stable and low diffusive hybrid upwind splitting methods

NASA Technical Reports Server (NTRS)

Coquel, Frederic; Liou, Meng-Sing

1992-01-01

We introduce in this paper a new concept for upwinding: the Hybrid Upwind Splitting (HUS). This original strategy for upwinding is achieved by combining the two previous existing approaches, the Flux Vector (FVS) and Flux Difference Splittings (FDS), while retaining their own interesting features. Indeed, our approach yields upwind methods that share the robustness of FVS schemes in the capture of nonlinear waves and the accuracy of some FDS schemes in the capture of linear waves. We describe here some examples of such HUS methods obtained by hybridizing the Osher approach with FVS schemes. Numerical illustrations are displayed and will prove in particular the relevance of the HUS methods we propose for viscous calculations.

Angular-contact ball-bearing internal load estimation algorithm using runtime adaptive relaxation

NASA Astrophysics Data System (ADS)

Medina, H.; Mutu, R.

2017-07-01

An algorithm to estimate internal loads for single-row angular contact ball bearings due to externally applied thrust loads and high-operating speeds is presented. A new runtime adaptive relaxation procedure and blending function is proposed which ensures algorithm stability whilst also reducing the number of iterations needed to reach convergence, leading to an average reduction in computation time in excess of approximately 80%. The model is validated based on a 218 angular contact bearing and shows excellent agreement compared to published results.

Evolving fuzzy rules for relaxed-criteria negotiation.

PubMed

Sim, Kwang Mong

2008-12-01

In the literature on automated negotiation, very few negotiation agents are designed with the flexibility to slightly relax their negotiation criteria to reach a consensus more rapidly and with more certainty. Furthermore, these relaxed-criteria negotiation agents were not equipped with the ability to enhance their performance by learning and evolving their relaxed-criteria negotiation rules. The impetus of this work is designing market-driven negotiation agents (MDAs) that not only have the flexibility of relaxing bargaining criteria using fuzzy rules, but can also evolve their structures by learning new relaxed-criteria fuzzy rules to improve their negotiation outcomes as they participate in negotiations in more e-markets. To this end, an evolutionary algorithm for adapting and evolving relaxed-criteria fuzzy rules was developed. Implementing the idea in a testbed, two kinds of experiments for evaluating and comparing EvEMDAs (MDAs with relaxed-criteria rules that are evolved using the evolutionary algorithm) and EMDAs (MDAs with relaxed-criteria rules that are manually constructed) were carried out through stochastic simulations. Empirical results show that: 1) EvEMDAs generally outperformed EMDAs in different types of e-markets and 2) the negotiation outcomes of EvEMDAs generally improved as they negotiated in more e-markets.

The Linear Bicharacteristic Scheme for Computational Electromagnetics

NASA Technical Reports Server (NTRS)

Beggs, John H.; Chan, Siew-Loong

2000-01-01

The upwind leapfrog or Linear Bicharacteristic Scheme (LBS) has previously been implemented and demonstrated on electromagnetic wave propagation problems. This paper extends the Linear Bicharacteristic Scheme for computational electromagnetics to treat lossy dielectric and magnetic materials and perfect electrical conductors. This is accomplished by proper implementation of the LBS for homogeneous lossy dielectric and magnetic media, and treatment of perfect electrical conductors (PECs) are shown to follow directly in the limit of high conductivity. Heterogeneous media are treated through implementation of surface boundary conditions and no special extrapolations or interpolations at dielectric material boundaries are required. Results are presented for one-dimensional model problems on both uniform and nonuniform grids, and the FDTD algorithm is chosen as a convenient reference algorithm for comparison. The results demonstrate that the explicit LBS is a dissipation-free, second-order accurate algorithm which uses a smaller stencil than the FDTD algorithm, yet it has approximately one-third the phase velocity error. The LBS is also more accurate on nonuniform grids.

A Two-Dimensional Linear Bicharacteristic Scheme for Electromagnetics

NASA Technical Reports Server (NTRS)

Beggs, John H.

2002-01-01

The upwind leapfrog or Linear Bicharacteristic Scheme (LBS) has previously been implemented and demonstrated on one-dimensional electromagnetic wave propagation problems. This memorandum extends the Linear Bicharacteristic Scheme for computational electromagnetics to model lossy dielectric and magnetic materials and perfect electrical conductors in two dimensions. This is accomplished by proper implementation of the LBS for homogeneous lossy dielectric and magnetic media and for perfect electrical conductors. Both the Transverse Electric and Transverse Magnetic polarizations are considered. Computational requirements and a Fourier analysis are also discussed. Heterogeneous media are modeled through implementation of surface boundary conditions and no special extrapolations or interpolations at dielectric material boundaries are required. Results are presented for two-dimensional model problems on uniform grids, and the Finite Difference Time Domain (FDTD) algorithm is chosen as a convenient reference algorithm for comparison. The results demonstrate that the two-dimensional explicit LBS is a dissipation-free, second-order accurate algorithm which uses a smaller stencil than the FDTD algorithm, yet it has less phase velocity error.

A Two-Dimensional Linear Bicharacteristic FDTD Method

NASA Technical Reports Server (NTRS)

Beggs, John H.

2002-01-01

The linear bicharacteristic scheme (LBS) was originally developed to improve unsteady solutions in computational acoustics and aeroacoustics. The LBS has previously been extended to treat lossy materials for one-dimensional problems. It is a classical leapfrog algorithm, but is combined with upwind bias in the spatial derivatives. This approach preserves the time-reversibility of the leapfrog algorithm, which results in no dissipation, and it permits more flexibility by the ability to adopt a characteristic based method. The use of characteristic variables allows the LBS to include the Perfectly Matched Layer boundary condition with no added storage or complexity. The LBS offers a central storage approach with lower dispersion than the Yee algorithm, plus it generalizes much easier to nonuniform grids. It has previously been applied to two and three-dimensional free-space electromagnetic propagation and scattering problems. This paper extends the LBS to the two-dimensional case. Results are presented for point source radiation problems, and the FDTD algorithm is chosen as a convenient reference for comparison.

Numerical simulation of axisymmetric turbulent flow in combustors and diffusors. Ph.D. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Yung, Chain Nan

1988-01-01

A method for predicting turbulent flow in combustors and diffusers is developed. The Navier-Stokes equations, incorporating a turbulence kappa-epsilon model equation, were solved in a nonorthogonal curvilinear coordinate system. The solution applied the finite volume method to discretize the differential equations and utilized the SIMPLE algorithm iteratively to solve the differenced equations. A zonal grid method, wherein the flow field was divided into several subsections, was developed. This approach permitted different computational schemes to be used in the various zones. In addition, grid generation was made a more simple task. However, treatment of the zonal boundaries required special handling. Boundary overlap and interpolating techniques were used and an adjustment of the flow variables was required to assure conservation of mass, momentum and energy fluxes. The numerical accuracy was assessed using different finite differencing methods, i.e., hybrid, quadratic upwind and skew upwind, to represent the convection terms. Flows in different geometries of combustors and diffusers were simulated and results compared with experimental data and good agreement was obtained.

Application of Central Upwind Scheme for Solving Special Relativistic Hydrodynamic Equations

PubMed Central

Yousaf, Muhammad; Ghaffar, Tayabia; Qamar, Shamsul

2015-01-01

The accurate modeling of various features in high energy astrophysical scenarios requires the solution of the Einstein equations together with those of special relativistic hydrodynamics (SRHD). Such models are more complicated than the non-relativistic ones due to the nonlinear relations between the conserved and state variables. A high-resolution shock-capturing central upwind scheme is implemented to solve the given set of equations. The proposed technique uses the precise information of local propagation speeds to avoid the excessive numerical diffusion. The second order accuracy of the scheme is obtained with the use of MUSCL-type initial reconstruction and Runge-Kutta time stepping method. After a discussion of the equations solved and of the techniques employed, a series of one and two-dimensional test problems are carried out. To validate the method and assess its accuracy, the staggered central and the kinetic flux-vector splitting schemes are also applied to the same model. The scheme is robust and efficient. Its results are comparable to those obtained from the sophisticated algorithms, even in the case of highly relativistic two-dimensional test problems. PMID:26070067

Computations of the three-dimensional flow and heat transfer within a coolant passage of a radial turbine blade

NASA Technical Reports Server (NTRS)

Shih, T. I.-P.; Roelke, R. J.; Steinthorsson, E.

1991-01-01

A numerical code is developed for computing three-dimensional, turbulent, compressible flow within coolant passages of turbine blades. The code is based on a formulation of the compressible Navier-Stokes equations in a rotating frame of reference in which the velocity dependent variable is specified with respect to the rotating frame instead of the inertial frame. The algorithm employed to obtain solutions to the governing equation is a finite-volume LU algorithm that allows convection, source, as well as diffusion terms to be treated implicitly. In this study, all convection terms are upwind differenced by using flux-vector splitting, and all diffusion terms are centrally differenced. This paper describes the formulation and algorithm employed in the code. Some computed solutions for the flow within a coolant passage of a radial turbine are also presented.

A Robust Locally Preconditioned Semi-Coarsening Multigrid Algorithm for the 2-D Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Cain, Michael D.

1999-01-01

The goal of this thesis is to develop an efficient and robust locally preconditioned semi-coarsening multigrid algorithm for the two-dimensional Navier-Stokes equations. This thesis examines the performance of the multigrid algorithm with local preconditioning for an upwind-discretization of the Navier-Stokes equations. A block Jacobi iterative scheme is used because of its high frequency error mode damping ability. At low Mach numbers, the performance of a flux preconditioner is investigated. The flux preconditioner utilizes a new limiting technique based on local information that was developed by Siu. Full-coarsening and-semi-coarsening are examined as well as the multigrid V-cycle and full multigrid. The numerical tests were performed on a NACA 0012 airfoil at a range of Mach numbers. The tests show that semi-coarsening with flux preconditioning is the most efficient and robust combination of coarsening strategy, and iterative scheme - especially at low Mach numbers.

High-Order Finite-Difference Schemes for Numerical Simulation of Hypersonic Boundary-Layer Transition

NASA Astrophysics Data System (ADS)

Zhong, Xiaolin

1998-08-01

Direct numerical simulation (DNS) has become a powerful tool in studying fundamental phenomena of laminar-turbulent transition of high-speed boundary layers. Previous DNS studies of supersonic and hypersonic boundary layer transition have been limited to perfect-gas flow over flat-plate boundary layers without shock waves. For hypersonic boundary layers over realistic blunt bodies, DNS studies of transition need to consider the effects of bow shocks, entropy layers, surface curvature, and finite-rate chemistry. It is necessary that numerical methods for such studies are robust and high-order accurate both in resolving wide ranges of flow time and length scales and in resolving the interaction between the bow shocks and flow disturbance waves. This paper presents a new high-order shock-fitting finite-difference method for the DNS of the stability and transition of hypersonic boundary layers over blunt bodies with strong bow shocks and with (or without) thermo-chemical nonequilibrium. The proposed method includes a set of new upwind high-order finite-difference schemes which are stable and are less dissipative than a straightforward upwind scheme using an upwind-bias grid stencil, a high-order shock-fitting formulation, and third-order semi-implicit Runge-Kutta schemes for temporal discretization of stiff reacting flow equations. The accuracy and stability of the new schemes are validated by numerical experiments of the linear wave equation and nonlinear Navier-Stokes equations. The algorithm is then applied to the DNS of the receptivity of hypersonic boundary layers over a parabolic leading edge to freestream acoustic disturbances.

Implicit time-marching solution of the Navier-Stokes equations for thrust reversing and thrust vectoring nozzle flows

NASA Technical Reports Server (NTRS)

Imlay, S. T.

1986-01-01

An implicit finite volume method is investigated for the solution of the compressible Navier-Stokes equations for flows within thrust reversing and thrust vectoring nozzles. Thrust reversing nozzles typically have sharp corners, and the rapid expansion and large turning angles near these corners are shown to cause unacceptable time step restrictions when conventional approximate factorization methods are used. In this investigation these limitations are overcome by using second-order upwind differencing and line Gauss-Siedel relaxation. This method is implemented with a zonal mesh so that flows through complex nozzle geometries may be efficiently calculated. Results are presented for five nozzle configurations including two with time varying geometries. Three cases are compared with available experimental data and the results are generally acceptable.

Flux-split algorithms for flows with non-equilibrium chemistry and vibrational relaxation

NASA Technical Reports Server (NTRS)

Grossman, B.; Cinnella, P.

1990-01-01

The present consideration of numerical computation methods for gas flows with nonequilibrium chemistry thermodynamics gives attention to an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Flux-splitting procedures are developed for the fully-coupled inviscid equations encompassing fluid dynamics and both chemical and internal energy-relaxation processes. A fully coupled and implicit large-block structure is presented which embodies novel forms of flux-vector split and flux-difference split algorithms valid for nonequilibrium flow; illustrative high-temperature shock tube and nozzle flow examples are given.

Clique Relaxations in Biological and Social Network Analysis Foundations and Algorithms

DTIC Science & Technology

2015-10-26

study of clique relaxation models arising in biological and social networks. This project examines the elementary clique-defining properties... elementary clique-defining properties inherently exploited in the available clique relaxation models and pro- poses a taxonomic framework that not...analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that

Optimal convolution SOR acceleration of waveform relaxation with application to semiconductor device simulation

NASA Technical Reports Server (NTRS)

Reichelt, Mark

1993-01-01

In this paper we describe a novel generalized SOR (successive overrelaxation) algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is substantially faster than that of the more obvious frequency-independent waveform SOR algorithm. Finally, to demonstrate the general applicability of this new method, it is used to solve the differential-algebraic system generated by spatial discretization of the time-dependent semiconductor device equations.

Numerical investigations on the aerodynamic performance of wind turbine: Downwind versus upwind configuration

NASA Astrophysics Data System (ADS)

Zhou, Hu; Wan, Decheng

2015-03-01

Although the upwind configuration is more popular in the field of wind energy, the downwind one is a promising type for the offshore wind energy due to its special advantages. Different configurations have different aerodynamic performance and it is important to predict the performance of both downwind and upwind configurations accurately for designing and developing more reliable wind turbines. In this paper, a numerical investigation on the aerodynamic performance of National Renewable Energy Laboratory (NREL) phase VI wind turbine in downwind and upwind configurations is presented. The open source toolbox OpenFOAM coupled with arbitrary mesh interface (AMI) method is applied to tackle rotating problems of wind turbines. Two 3D numerical models of NREL phase VI wind turbine with downwind and upwind configurations under four typical working conditions of incoming wind velocities are set up for the study of different unsteady characteristics of the downwind and upwind configurations, respectively. Numerical results of wake vortex structure, time histories of thrust, pressure distribution on the blade and limiting streamlines which can be used to identify points of separation in a 3D flow are presented. It can be concluded that thrust reduction due to blade-tower interaction is small for upwind wind turbines but relatively large for downwind wind turbines and attention should be paid to the vibration at a certain frequency induced by the cyclic reduction for both configurations. The results and conclusions are helpful to analyze the different aerodynamic performance of wind turbines between downwind and upwind configurations, providing useful references for practical design of wind turbine.

An interactive adaptive remeshing algorithm for the two-dimensional Euler equations

NASA Technical Reports Server (NTRS)

Slack, David C.; Walters, Robert W.; Lohner, R.

1990-01-01

An interactive adaptive remeshing algorithm utilizing a frontal grid generator and a variety of time integration schemes for the two-dimensional Euler equations on unstructured meshes is presented. Several device dependent interactive graphics interfaces have been developed along with a device independent DI-3000 interface which can be employed on any computer that has the supporting software including the Cray-2 supercomputers Voyager and Navier. The time integration methods available include: an explicit four stage Runge-Kutta and a fully implicit LU decomposition. A cell-centered finite volume upwind scheme utilizing Roe's approximate Riemann solver is developed. To obtain higher order accurate results a monotone linear reconstruction procedure proposed by Barth is utilized. Results for flow over a transonic circular arc and flow through a supersonic nozzle are examined.

Solving Upwind-Biased Discretizations: Defect-Correction Iterations

NASA Technical Reports Server (NTRS)

Diskin, Boris; Thomas, James L.

1999-01-01

This paper considers defect-correction solvers for a second order upwind-biased discretization of the 2D convection equation. The following important features are reported: (1) The asymptotic convergence rate is about 0.5 per defect-correction iteration. (2) If the operators involved in defect-correction iterations have different approximation order, then the initial convergence rates may be very slow. The number of iterations required to get into the asymptotic convergence regime might grow on fine grids as a negative power of h. In the case of a second order target operator and a first order driver operator, this number of iterations is roughly proportional to h-1/3. (3) If both the operators have the second approximation order, the defect-correction solver demonstrates the asymptotic convergence rate after three iterations at most. The same three iterations are required to converge algebraic error below the truncation error level. A novel comprehensive half-space Fourier mode analysis (which, by the way, can take into account the influence of discretized outflow boundary conditions as well) for the defect-correction method is developed. This analysis explains many phenomena observed in solving non-elliptic equations and provides a close prediction of the actual solution behavior. It predicts the convergence rate for each iteration and the asymptotic convergence rate. As a result of this analysis, a new very efficient adaptive multigrid algorithm solving the discrete problem to within a given accuracy is proposed. Numerical simulations confirm the accuracy of the analysis and the efficiency of the proposed algorithm. The results of the numerical tests are reported.

Heat-bath algorithmic cooling with correlated qubit-environment interactions

NASA Astrophysics Data System (ADS)

Rodríguez-Briones, Nayeli A.; Li, Jun; Peng, Xinhua; Mor, Tal; Weinstein, Yossi; Laflamme, Raymond

2017-11-01

Cooling techniques are essential to understand fundamental thermodynamic questions of the low-energy states of physical systems, furthermore they are at the core of practical applications of quantum information science. In quantum computing, this controlled preparation of highly pure quantum states is required from the state initialization of most quantum algorithms to a reliable supply of ancilla qubits that satisfy the fault-tolerance threshold for quantum error correction. Heat-bath algorithmic cooling has been shown to purify qubits by controlled redistribution of entropy and multiple contact with a bath, not only for ensemble implementations but also for technologies with strong but imperfect measurements. In this paper, we show that correlated relaxation processes between the system and environment during rethermalization when we reset hot ancilla qubits, can be exploited to enhance purification. We show that a long standing upper bound on the limits of algorithmic cooling Schulman et al (2005 Phys. Rev. Lett. 94, 120501) can be broken by exploiting these correlations. We introduce a new tool for cooling algorithms, which we call ‘state-reset’, obtained when the coupling to the environment is generalized from individual-qubits relaxation to correlated-qubit relaxation. Furthermore, we present explicit improved cooling algorithms which lead to an increase of purity beyond all the previous work, and relate our results to the Nuclear Overhauser Effect.

Numerical solution of 3D Navier-Stokes equations with upwind implicit schemes

NASA Technical Reports Server (NTRS)

Marx, Yves P.

1990-01-01

An upwind MUSCL type implicit scheme for the three-dimensional Navier-Stokes equations is presented. Comparison between different approximate Riemann solvers (Roe and Osher) are performed and the influence of the reconstructions schemes on the accuracy of the solution as well as on the convergence of the method is studied. A new limiter is introduced in order to remove the problems usually associated with non-linear upwind schemes. The implementation of a diagonal upwind implicit operator for the three-dimensional Navier-Stokes equations is also discussed. Finally the turbulence modeling is assessed. Good prediction of separated flows are demonstrated if a non-equilibrium turbulence model is used.

Vortex breakdown simulation

NASA Technical Reports Server (NTRS)

Hafez, M.; Ahmad, J.; Kuruvila, G.; Salas, M. D.

1987-01-01

In this paper, steady, axisymmetric inviscid, and viscous (laminar) swirling flows representing vortex breakdown phenomena are simulated using a stream function-vorticity-circulation formulation and two numerical methods. The first is based on an inverse iteration, where a norm of the solution is prescribed and the swirling parameter is calculated as a part of the output. The second is based on direct Newton iterations, where the linearized equations, for all the unknowns, are solved simultaneously by an efficient banded Gaussian elimination procedure. Several numerical solutions for inviscid and viscous flows are demonstrated, followed by a discussion of the results. Some improvements on previous work have been achieved: first order upwind differences are replaced by second order schemes, line relaxation procedure (with linear convergence rate) is replaced by Newton's iterations (which converge quadratically), and Reynolds numbers are extended from 200 up to 1000.

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

NASA Technical Reports Server (NTRS)

Warren, Gary Patrick

1990-01-01

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

Fast preconditioned multigrid solution of the Euler and Navier-Stokes equations for steady, compressible flows

NASA Astrophysics Data System (ADS)

Caughey, David A.; Jameson, Antony

2003-10-01

New versions of implicit algorithms are developed for the efficient solution of the Euler and Navier-Stokes equations of compressible flow. The methods are based on a preconditioned, lower-upper (LU) implementation of a non-linear, symmetric Gauss-Seidel (SGS) algorithm for use as a smoothing algorithm in a multigrid method. Previously, this method had been implemented for flows in quasi-one-dimensional ducts and for two-dimensional flows past airfoils on boundary-conforming O-type grids for a variety of symmetric limited positive (SLIP) spatial approximations, including the scalar dissipation and convective upwind split pressure (CUSP) schemes. Here results are presented for both inviscid and viscous (laminar) flows past airfoils on boundary-conforming C-type grids. The method is significantly faster than earlier explicit or implicit methods for inviscid problems, allowing solution of these problems to the level of truncation error in three to five multigrid cycles. Viscous solutions still require as many as twenty multigrid cycles.

A Kirchhoff approach to seismic modeling and prestack depth migration

NASA Astrophysics Data System (ADS)

Liu, Zhen-Yue

1993-05-01

The Kirchhoff integral provides a robust method for implementing seismic modeling and prestack depth migration, which can handle lateral velocity variation and turning waves. With a little extra computation cost, the Kirchoff-type migration can obtain multiple outputs that have the same phase but different amplitudes, compared with that of other migration methods. The ratio of these amplitudes is helpful in computing some quantities such as reflection angle. I develop a seismic modeling and prestack depth migration method based on the Kirchhoff integral, that handles both laterally variant velocity and a dip beyond 90 degrees. The method uses a finite-difference algorithm to calculate travel times and WKBJ amplitudes for the Kirchhoff integral. Compared to ray-tracing algorithms, the finite-difference algorithm gives an efficient implementation and single-valued quantities (first arrivals) on output. In my finite difference algorithm, the upwind scheme is used to calculate travel times, and the Crank-Nicolson scheme is used to calculate amplitudes. Moreover, interpolation is applied to save computation cost. The modeling and migration algorithms require a smooth velocity function. I develop a velocity-smoothing technique based on damped least-squares to aid in obtaining a successful migration.

A Parallel, Finite-Volume Algorithm for Large-Eddy Simulation of Turbulent Flows

NASA Technical Reports Server (NTRS)

Bui, Trong T.

1999-01-01

A parallel, finite-volume algorithm has been developed for large-eddy simulation (LES) of compressible turbulent flows. This algorithm includes piecewise linear least-square reconstruction, trilinear finite-element interpolation, Roe flux-difference splitting, and second-order MacCormack time marching. Parallel implementation is done using the message-passing programming model. In this paper, the numerical algorithm is described. To validate the numerical method for turbulence simulation, LES of fully developed turbulent flow in a square duct is performed for a Reynolds number of 320 based on the average friction velocity and the hydraulic diameter of the duct. Direct numerical simulation (DNS) results are available for this test case, and the accuracy of this algorithm for turbulence simulations can be ascertained by comparing the LES solutions with the DNS results. The effects of grid resolution, upwind numerical dissipation, and subgrid-scale dissipation on the accuracy of the LES are examined. Comparison with DNS results shows that the standard Roe flux-difference splitting dissipation adversely affects the accuracy of the turbulence simulation. For accurate turbulence simulations, only 3-5 percent of the standard Roe flux-difference splitting dissipation is needed.

Improving the Held and Karp Approach with Constraint Programming

NASA Astrophysics Data System (ADS)

Benchimol, Pascal; Régin, Jean-Charles; Rousseau, Louis-Martin; Rueher, Michel; van Hoeve, Willem-Jan

Held and Karp have proposed, in the early 1970s, a relaxation for the Traveling Salesman Problem (TSP) as well as a branch-and-bound procedure that can solve small to modest-size instances to optimality [4, 5]. It has been shown that the Held-Karp relaxation produces very tight bounds in practice, and this relaxation is therefore applied in TSP solvers such as Concorde [1]. In this short paper we show that the Held-Karp approach can benefit from well-known techniques in Constraint Programming (CP) such as domain filtering and constraint propagation. Namely, we show that filtering algorithms developed for the weighted spanning tree constraint [3, 8] can be adapted to the context of the Held and Karp procedure. In addition to the adaptation of existing algorithms, we introduce a special-purpose filtering algorithm based on the underlying mechanisms used in Prim's algorithm [7]. Finally, we explored two different branching schemes to close the integrality gap. Our initial experimental results indicate that the addition of the CP techniques to the Held-Karp method can be very effective.

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

NASA Technical Reports Server (NTRS)

Barth, Timothy J.; Saini, Subhash (Technical Monitor)

1998-01-01

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

The efficient simulation of separated three-dimensional viscous flows using the boundary-layer equations

NASA Technical Reports Server (NTRS)

Van Dalsem, W. R.; Steger, J. L.

1985-01-01

A simple and computationally efficient algorithm for solving the unsteady three-dimensional boundary-layer equations in the time-accurate or relaxation mode is presented. Results of the new algorithm are shown to be in quantitative agreement with detailed experimental data for flow over a swept infinite wing. The separated flow over a 6:1 ellipsoid at angle of attack, and the transonic flow over a finite-wing with shock-induced 'mushroom' separation are also computed and compared with available experimental data. It is concluded that complex, separated, three-dimensional viscous layers can be economically and routinely computed using a time-relaxation boundary-layer algorithm.

Powered Descent Guidance with General Thrust-Pointing Constraints

NASA Technical Reports Server (NTRS)

Carson, John M., III; Acikmese, Behcet; Blackmore, Lars

2013-01-01

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Multiscale Capability in Rattlesnake using Contiguous Discontinuous Discretization of Self-Adjoint Angular Flux Equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zheng, Weixiong; Wang, Yaqi; DeHart, Mark D.

2016-09-01

In this report, we present a new upwinding scheme for the multiscale capability in Rattlesnake, the MOOSE based radiation transport application. Comparing with the initial implementation of multiscale utilizing Lagrange multipliers to impose strong continuity of angular flux on interface of in-between subdomains, this scheme does not require the particular domain partitioning. This upwinding scheme introduces discontinuity of angular flux and resembles the classic upwinding technique developed for solving first order transport equation using discontinuous finite element method (DFEM) on the subdomain interfaces. Because this scheme restores the causality of radiation streaming on the interfaces, significant accuracy improvement can bemore » observed with moderate increase of the degrees of freedom comparing with the continuous method over the entire solution domain. Hybrid SN-PN is implemented and tested with this upwinding scheme. Numerical results show that the angular smoothing required by Lagrange multiplier method is not necessary for the upwinding scheme.« less

Isometric quadriceps strength determines sailing performance and neuromuscular fatigue during an upwind sailing emulation.

PubMed

Bourgois, Jan G; Callewaert, Margot; Celie, Bert; De Clercq, Dirk; Boone, Jan

2016-01-01

This study investigates the physiological responses to upwind sailing on a laser emulation ergometer and analyses the components of the physical profile that determine the physiological responses related to sailing level. Ten male high-level laser sailors performed an upwind sailing test, incremental cycling test and quadriceps strength test. During the upwind sailing test, heart rate (HR), oxygen uptake, ventilation, respiratory exchange ratio, rating of perceived exertion (RPE) and lactate concentration were measured, combined with near-infrared spectroscopy (NIRS) and electromyography (EMG) registration of the M. Vastus lateralis. Repeated measures ANOVA showed for the cardio-respiratory, metabolic and muscles responses (mean power frequency [MPF], root mean square [RMS], deoxy[Hb+Mb]) during the upwind sailing test an initial significant increase followed by a stabilisation, despite a constant increase in RPE. Stepwise regression analysis showed that better sailing level was for 46.5% predicted by lower MPF decrease. Lower MPF decrease was for 57.8% predicted by a higher maximal isometric quadriceps strength. In conclusion, this study indicates that higher sailing level was mainly determined by a lower rate of neuromuscular fatigue during the upwind sailing test (as indicated by MPF decrease). Additionally, the level of neuromuscular fatigue was mainly determined by higher maximal isometric quadriceps strength stressing the importance of resistance training in the planning of training.

Progress in multi-dimensional upwind differencing

NASA Technical Reports Server (NTRS)

Vanleer, Bram

1992-01-01

Multi-dimensional upwind-differencing schemes for the Euler equations are reviewed. On the basis of the first-order upwind scheme for a one-dimensional convection equation, the two approaches to upwind differencing are discussed: the fluctuation approach and the finite-volume approach. The usual extension of the finite-volume method to the multi-dimensional Euler equations is not entirely satisfactory, because the direction of wave propagation is always assumed to be normal to the cell faces. This leads to smearing of shock and shear waves when these are not grid-aligned. Multi-directional methods, in which upwind-biased fluxes are computed in a frame aligned with a dominant wave, overcome this problem, but at the expense of robustness. The same is true for the schemes incorporating a multi-dimensional wave model not based on multi-dimensional data but on an 'educated guess' of what they could be. The fluctuation approach offers the best possibilities for the development of genuinely multi-dimensional upwind schemes. Three building blocks are needed for such schemes: a wave model, a way to achieve conservation, and a compact convection scheme. Recent advances in each of these components are discussed; putting them all together is the present focus of a worldwide research effort. Some numerical results are presented, illustrating the potential of the new multi-dimensional schemes.

General relaxation schemes in multigrid algorithms for higher order singularity methods

NASA Technical Reports Server (NTRS)

Oskam, B.; Fray, J. M. J.

1981-01-01

Relaxation schemes based on approximate and incomplete factorization technique (AF) are described. The AF schemes allow construction of a fast multigrid method for solving integral equations of the second and first kind. The smoothing factors for integral equations of the first kind, and comparison with similar results from the second kind of equations are a novel item. Application of the MD algorithm shows convergence to the level of truncation error of a second order accurate panel method.

Partial branch and bound algorithm for improved data association in multiframe processing

NASA Astrophysics Data System (ADS)

Poore, Aubrey B.; Yan, Xin

1999-07-01

A central problem in multitarget, multisensor, and multiplatform tracking remains that of data association. Lagrangian relaxation methods have shown themselves to yield near optimal answers in real-time. The necessary improvement in the quality of these solutions warrants a continuing interest in these methods. These problems are NP-hard; the only known methods for solving them optimally are enumerative in nature with branch-and-bound being most efficient. Thus, the development of methods less than a full branch-and-bound are needed for improving the quality. Such methods as K-best, local search, and randomized search have been proposed to improve the quality of the relaxation solution. Here, a partial branch-and-bound technique along with adequate branching and ordering rules are developed. Lagrangian relaxation is used as a branching method and as a method to calculate the lower bound for subproblems. The result shows that the branch-and-bound framework greatly improves the resolution quality of the Lagrangian relaxation algorithm and yields better multiple solutions in less time than relaxation alone.

Relaxation of Distributed Data Aggregation for Underwater Acoustic Sensor Networks

DTIC Science & Technology

2014-03-31

2 3.1 Gossip algorithms for distributed averaging . . . . . . . . . . . . . . . . . 3 3.2 Distributed particle filtering...algorithm that had direct access to all of the measurements. We use gossip algorithms (discussed in Section 3.1) to diffuse information across the...2 3.1 Gossip algorithms for distributed averaging We begin by discussing gossip algorithms, which we use to synchronize and spread infor- mation

A comparison of three-dimensional nonequilibrium solution algorithms applied to hypersonic flows with stiff chemical source terms

NASA Technical Reports Server (NTRS)

Palmer, Grant; Venkatapathy, Ethiraj

1993-01-01

Three solution algorithms, explicit underrelaxation, point implicit, and lower upper symmetric Gauss-Seidel (LUSGS), are used to compute nonequilibrium flow around the Apollo 4 return capsule at 62 km altitude. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness. The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15, 23, and 30, the LUSGS method produces an eight order of magnitude drop in the L2 norm of the energy residual in 1/3 to 1/2 the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 23 and above. At Mach 40 the performance of the LUSGS algorithm deteriorates to the point it is out-performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

Quantifying external focus of attention in sailing by means of action sport cameras.

PubMed

Pluijms, Joost P; Cañal-Bruland, Rouwen; Hoozemans, Marco J M; Van Beek, Morris W; Böcker, Kaj; Savelsbergh, Geert J P

2016-08-01

The aim of the current study was twofold: (1) to validate the use of action sport cameras for quantifying focus of visual attention in sailing and (2) to apply this method to examine whether an external focus of attention is associated with better performance in upwind sailing. To test the validity of this novel quantification method, we first calculated the agreement between gaze location measures and head orientation measures in 13 sailors sailing upwind during training regattas using a head mounted eye tracker. The results confirmed that for measuring visual focus of attention in upwind sailing, the agreement for the two measures was high (intraclass correlation coefficient (ICC) = 0.97) and the 95% limits of agreement were acceptable (between -8.0% and 14.6%). In a next step, we quantified the focus of visual attention in sailing upwind as fast as possible by means of an action sport camera. We captured sailing performance, operationalised as boat speed in the direction of the wind, and environmental conditions using a GPS, compass and wind meter. Four trials, each lasting 1 min, were analysed for 15 sailors each, resulting in a total of 30 upwind speed trials on port tack and 30 upwind speed trials on starboard tack. The results revealed that in sailing - within constantly changing environments - the focus of attention is not a significant predictor for better upwind sailing performances. This implicates that neither external nor internal foci of attention was per se correlated with better performances. Rather, relatively large interindividual differences seem to indicate that different visual attention strategies can lead to similar performance outcomes.

Horizontal variability of the marine boundary layer structure upwind of San Nicolas Island during FIRE, 1987

NASA Technical Reports Server (NTRS)

Jensen, Douglas R.

1990-01-01

During the months of June and July 1987, the Marine Stratocumulus Intensive Field Observation Experiment of First ISCCP Regional Experiment (FIRE) was conducted in the Southern California offshore area in the vicinity of San Nicolas Island (SNI). The Naval Ocean Systems Center (NOSC) airborne platform was utilized during FIRE to investigate the upwind low level horizontal variability of the marine boundary layer structure to determine the representativeness of SNI-based measurements to upwind open ocean conditions. The NOSC airborne meteorological platform made three flights during FIRE, two during clear sky conditions (19 and 23 July), and one during two stratus conditions (15 July). The boundary layer structure variations associated with the stratus clouds of 15 July 1987 are discussed. Profiles of air temperature (AT) and relative humidity (RH) taken 'at' and 'upwind' of SNI do show differences between the so-called open ocean conditions and those taken near the island. However, the observed difference cannot be uniquely identified to island effects, especially since the upwind fluctuations of AT and RH bound the SNI measurements. Total optical depths measures at SNI do not appear to be greatly affected by any surface based aerosol effects created by the island and could therefore realistically represent open ocean conditions. However, if one were to use the SNI aerosol measurements to predict ship to ship EO propagation conditions, significant errors could be introduced due to the increased number of surface aerosols observed near SNI which may not be, and were not, characteristic of open ocean conditions. Sea surface temperature measurements taken at the island will not, in general, represent those upwind open ocean conditions. Also, since CTT's varied appreciably along the upwind radials, measurements of CTT over the island may not be representative of actual open ocean CTT's.

Computation of incompressible viscous flows through turbopump components

NASA Technical Reports Server (NTRS)

Kiris, Cetin; Chang, Leon

1993-01-01

Flow through pump components, such as an inducer and an impeller, is efficiently simulated by solving the incompressible Navier-Stokes equations. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. the equations are solved in steadily rotating reference frames and the centrifugal force and the Coriolis force are added to the equation of motion. Current computations use a one-equation Baldwin-Barth turbulence model which is derived from a simplified form of the standard k-epsilon model equations. The resulting computer code is applied to the flow analysis inside a generic rocket engine pump inducer, a fuel pump impeller, and SSME high pressure fuel turbopump impeller. Numerical results of inducer flow are compared with experimental measurements. In the fuel pump impeller, the effect of downstream boundary conditions is investigated. Flow analyses at 80 percent, 100 percent, and 120 percent of design conditions are presented.

Incompressible Navier-Stokes Computations with Heat Transfer

NASA Technical Reports Server (NTRS)

Kiris, Cetin; Kwak, Dochan; Rogers, Stuart; Kutler, Paul (Technical Monitor)

1994-01-01

The existing pseudocompressibility method for the system of incompressible Navier-Stokes equations is extended to heat transfer problems by including the energy equation. The solution method is based on the pseudo compressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Current computations use one-equation Baldwin-Barth turbulence model which is derived from a simplified form of the standard k-epsilon model equations. Both forced and natural convection problems are examined. Numerical results from turbulent reattaching flow behind a backward-facing step will be compared against experimental measurements for the forced convection case. The validity of Boussinesq approximation to simplify the buoyancy force term will be investigated. The natural convective flow structure generated by heat transfer in a vertical rectangular cavity will be studied. The numerical results will be compared by experimental measurements by Morrison and Tran.

Choice of implicit and explicit operators for the upwind differencing method

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing; Vanleer, Bram

1988-01-01

The flux-vector and flux-difference splittings of Steger-Warming, van Leer and Roe are tested in all possible combinations on the implicit and explicit operators that can be distinguished in implicit relaxation methods for the steady Euler and Navier-Stokes equations. The tests include one-dimensional inviscid nozzle flow, and two-dimensional inviscid and viscous shock reflection. Roe's splitting, as anticipated, is found to uniformly yield the most accurate results. On the other hand, an approximate Roe splitting of the implicit operator (the complete Roe splitting is too complicated for practical use) proves to be the least robust with regard to convergence to the steady state. In this respect, the Steger-Warming splitting is the most robust; it leads to convergence when combined with any of the splittings in the explicit operator, although not necessarily in the most efficient way.

Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brown, Nathanael J. K.; Arguello, Bryan; Nozick, Linda Karen

This paper focuses on scheduling antennas to track satellites using a heuristic method. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The performance of the algorithm is established using several illustrative problems.

Deconvolution of astronomical images using SOR with adaptive relaxation.

PubMed

Vorontsov, S V; Strakhov, V N; Jefferies, S M; Borelli, K J

2011-07-04

We address the potential performance of the successive overrelaxation technique (SOR) in image deconvolution, focusing our attention on the restoration of astronomical images distorted by atmospheric turbulence. SOR is the classical Gauss-Seidel iteration, supplemented with relaxation. As indicated by earlier work, the convergence properties of SOR, and its ultimate performance in the deconvolution of blurred and noisy images, can be made competitive to other iterative techniques, including conjugate gradients, by a proper choice of the relaxation parameter. The question of how to choose the relaxation parameter, however, remained open, and in the practical work one had to rely on experimentation. In this paper, using constructive (rather than exact) arguments, we suggest a simple strategy for choosing the relaxation parameter and for updating its value in consecutive iterations to optimize the performance of the SOR algorithm (and its positivity-constrained version, +SOR) at finite iteration counts. We suggest an extension of the algorithm to the notoriously difficult problem of "blind" deconvolution, where both the true object and the point-spread function have to be recovered from the blurred image. We report the results of numerical inversions with artificial and real data, where the algorithm is compared with techniques based on conjugate gradients. In all of our experiments +SOR provides the highest quality results. In addition +SOR is found to be able to detect moderately small changes in the true object between separate data frames: an important quality for multi-frame blind deconvolution where stationarity of the object is a necesessity.

Adapting an Ant Colony Metaphor for Multi-Robot Chemical Plume Tracing

PubMed Central

Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Li, Fei; Zeng, Ming

2012-01-01

We consider chemical plume tracing (CPT) in time-varying airflow environments using multiple mobile robots. The purpose of CPT is to approach a gas source with a previously unknown location in a given area. Therefore, the CPT could be considered as a dynamic optimization problem in continuous domains. The traditional ant colony optimization (ACO) algorithm has been successfully used for combinatorial optimization problems in discrete domains. To adapt the ant colony metaphor to the multi-robot CPT problem, the two-dimension continuous search area is discretized into grids and the virtual pheromone is updated according to both the gas concentration and wind information. To prevent the adapted ACO algorithm from being prematurely trapped in a local optimum, the upwind surge behavior is adopted by the robots with relatively higher gas concentration in order to explore more areas. The spiral surge (SS) algorithm is also examined for comparison. Experimental results using multiple real robots in two indoor natural ventilated airflow environments show that the proposed CPT method performs better than the SS algorithm. The simulation results for large-scale advection-diffusion plume environments show that the proposed method could also work in outdoor meandering plume environments. PMID:22666056

Adapting an ant colony metaphor for multi-robot chemical plume tracing.

PubMed

Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Li, Fei; Zeng, Ming

2012-01-01

We consider chemical plume tracing (CPT) in time-varying airflow environments using multiple mobile robots. The purpose of CPT is to approach a gas source with a previously unknown location in a given area. Therefore, the CPT could be considered as a dynamic optimization problem in continuous domains. The traditional ant colony optimization (ACO) algorithm has been successfully used for combinatorial optimization problems in discrete domains. To adapt the ant colony metaphor to the multi-robot CPT problem, the two-dimension continuous search area is discretized into grids and the virtual pheromone is updated according to both the gas concentration and wind information. To prevent the adapted ACO algorithm from being prematurely trapped in a local optimum, the upwind surge behavior is adopted by the robots with relatively higher gas concentration in order to explore more areas. The spiral surge (SS) algorithm is also examined for comparison. Experimental results using multiple real robots in two indoor natural ventilated airflow environments show that the proposed CPT method performs better than the SS algorithm. The simulation results for large-scale advection-diffusion plume environments show that the proposed method could also work in outdoor meandering plume environments.

Improved Savitzky-Golay-method-based fluorescence subtraction algorithm for rapid recovery of Raman spectra.

PubMed

Chen, Kun; Zhang, Hongyuan; Wei, Haoyun; Li, Yan

2014-08-20

In this paper, we propose an improved subtraction algorithm for rapid recovery of Raman spectra that can substantially reduce the computation time. This algorithm is based on an improved Savitzky-Golay (SG) iterative smoothing method, which involves two key novel approaches: (a) the use of the Gauss-Seidel method and (b) the introduction of a relaxation factor into the iterative procedure. By applying a novel successive relaxation (SG-SR) iterative method to the relaxation factor, additional improvement in the convergence speed over the standard Savitzky-Golay procedure is realized. The proposed improved algorithm (the RIA-SG-SR algorithm), which uses SG-SR-based iteration instead of Savitzky-Golay iteration, has been optimized and validated with a mathematically simulated Raman spectrum, as well as experimentally measured Raman spectra from non-biological and biological samples. The method results in a significant reduction in computing cost while yielding consistent rejection of fluorescence and noise for spectra with low signal-to-fluorescence ratios and varied baselines. In the simulation, RIA-SG-SR achieved 1 order of magnitude improvement in iteration number and 2 orders of magnitude improvement in computation time compared with the range-independent background-subtraction algorithm (RIA). Furthermore the computation time of the experimentally measured raw Raman spectrum processing from skin tissue decreased from 6.72 to 0.094 s. In general, the processing of the SG-SR method can be conducted within dozens of milliseconds, which can provide a real-time procedure in practical situations.

Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

NASA Technical Reports Server (NTRS)

Coirier, William J.; Powell, Kenneth G.

1995-01-01

A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

Supercomputer implementation of finite element algorithms for high speed compressible flows

NASA Technical Reports Server (NTRS)

Thornton, E. A.; Ramakrishnan, R.

1986-01-01

Prediction of compressible flow phenomena using the finite element method is of recent origin and considerable interest. Two shock capturing finite element formulations for high speed compressible flows are described. A Taylor-Galerkin formulation uses a Taylor series expansion in time coupled with a Galerkin weighted residual statement. The Taylor-Galerkin algorithms use explicit artificial dissipation, and the performance of three dissipation models are compared. A Petrov-Galerkin algorithm has as its basis the concepts of streamline upwinding. Vectorization strategies are developed to implement the finite element formulations on the NASA Langley VPS-32. The vectorization scheme results in finite element programs that use vectors of length of the order of the number of nodes or elements. The use of the vectorization procedure speeds up processing rates by over two orders of magnitude. The Taylor-Galerkin and Petrov-Galerkin algorithms are evaluated for 2D inviscid flows on criteria such as solution accuracy, shock resolution, computational speed and storage requirements. The convergence rates for both algorithms are enhanced by local time-stepping schemes. Extension of the vectorization procedure for predicting 2D viscous and 3D inviscid flows are demonstrated. Conclusions are drawn regarding the applicability of the finite element procedures for realistic problems that require hundreds of thousands of nodes.

Effective channel estimation and efficient symbol detection for multi-input multi-output underwater acoustic communications

NASA Astrophysics Data System (ADS)

Ling, Jun

Achieving reliable underwater acoustic communications (UAC) has long been recognized as a challenging problem owing to the scarce bandwidth available and the reverberant spread in both time and frequency domains. To pursue high data rates, we consider a multi-input multi-output (MIMO) UAC system, and our focus is placed on two main issues regarding a MIMO UAC system: (1) channel estimation, which involves the design of the training sequences and the development of a reliable channel estimation algorithm, and (2) symbol detection, which requires interference cancelation schemes due to simultaneous transmission from multiple transducers. To enhance channel estimation performance, we present a cyclic approach for designing training sequences with good auto- and cross-correlation properties, and a channel estimation algorithm called the iterative adaptive approach (IAA). Sparse channel estimates can be obtained by combining IAA with the Bayesian information criterion (BIC). Moreover, we present sparse learning via iterative minimization (SLIM) and demonstrate that SLIM gives similar performance to IAA but at a much lower computational cost. Furthermore, an extension of the SLIM algorithm is introduced to estimate the sparse and frequency modulated acoustic channels. The extended algorithm is referred to as generalization of SLIM (GoSLIM). Regarding symbol detection, a linear minimum mean-squared error based detection scheme, called RELAX-BLAST, which is a combination of vertical Bell Labs layered space-time (V-BLAST) algorithm and the cyclic principle of the RELAX algorithm, is presented and it is shown that RELAX-BLAST outperforms V-BLAST. We show that RELAX-BLAST can be implemented efficiently by making use of the conjugate gradient method and diagonalization properties of circulant matrices. This fast implementation approach requires only simple fast Fourier transform operations and facilitates parallel implementations. The effectiveness of the proposed MIMO schemes is verified by both computer simulations and experimental results obtained by analyzing the measurements acquired in multiple in-water experiments.

Numerical solutions of 2-D multi-stage rotor/stator unsteady flow interactions

NASA Astrophysics Data System (ADS)

Yang, R.-J.; Lin, S.-J.

1991-01-01

The Rai method of single-stage rotor/stator flow interaction is extended to handle multistage configurations. In this study, a two-dimensional Navier-Stokes multi-zone approach was used to investigate unsteady flow interactions within two multistage axial turbines. The governing equations are solved by an iterative, factored, implicit finite-difference, upwind algorithm. Numerical accuracy is checked by investigating the effect of time step size, the effect of subiteration in the Newton-Raphson technique, and the effect of full viscous versus thin-layer approximation. Computer results compared well with experimental data. Unsteady flow interactions, wake cutting, and the associated evolution of vortical entities are discussed.

CAG12 - A CSCM based procedure for flow of an equilibrium chemically reacting gas

NASA Technical Reports Server (NTRS)

Green, M. J.; Davy, W. C.; Lombard, C. K.

1985-01-01

The Conservative Supra Characteristic Method (CSCM), an implicit upwind Navier-Stokes algorithm, is extended to the numerical simulation of flows in chemical equilibrium. The resulting computer code known as Chemistry and Gasdynamics Implicit - Version 2 (CAG12) is described. First-order accurate results are presented for inviscid and viscous Mach 20 flows of air past a hemisphere-cylinder. The solution procedure captures the bow shock in a chemically reacting gas, a technique that is needed for simulating high altitude, rarefied flows. In an initial effort to validate the code, the inviscid results are compared with published gasdynamic and chemistry solutions and satisfactorily agreement is obtained.

A lattice relaxation algorithm for three-dimensional Poisson-Nernst-Planck theory with application to ion transport through the gramicidin A channel.

PubMed Central

Kurnikova, M G; Coalson, R D; Graf, P; Nitzan, A

1999-01-01

A lattice relaxation algorithm is developed to solve the Poisson-Nernst-Planck (PNP) equations for ion transport through arbitrary three-dimensional volumes. Calculations of systems characterized by simple parallel plate and cylindrical pore geometries are presented in order to calibrate the accuracy of the method. A study of ion transport through gramicidin A dimer is carried out within this PNP framework. Good agreement with experimental measurements is obtained. Strengths and weaknesses of the PNP approach are discussed. PMID:9929470

A method for generating reliable atomistic models of amorphous polymers based on a random search of energy minima

NASA Astrophysics Data System (ADS)

Curcó, David; Casanovas, Jordi; Roca, Marc; Alemán, Carlos

2005-07-01

A method for generating atomistic models of dense amorphous polymers is presented. The method is organized in a two-steps procedure. First, structures are generated using an algorithm that minimizes the torsional strain. After this, a relaxation algorithm is applied to minimize the non-bonding interactions. Two alternative relaxation methods, which are based simple minimization and Concerted Rotation techniques, have been implemented. The performance of the method has been checked by simulating polyethylene, polypropylene, nylon 6, poly(L,D-lactic acid) and polyglycolic acid.

Graph Matching: Relax at Your Own Risk.

PubMed

Lyzinski, Vince; Fishkind, Donniell E; Fiori, Marcelo; Vogelstein, Joshua T; Priebe, Carey E; Sapiro, Guillermo

2016-01-01

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.

Computational Aerodynamic Analysis of Offshore Upwind and Downwind Turbines

DOE PAGES

Zhao, Qiuying; Sheng, Chunhua; Afjeh, Abdollah

2014-01-01

Aerodynamic interactions of the model NREL 5 MW offshore horizontal axis wind turbines (HAWT) are investigated using a high-fidelity computational fluid dynamics (CFD) analysis. Four wind turbine configurations are considered; three-bladed upwind and downwind and two-bladed upwind and downwind configurations, which operate at two different rotor speeds of 12.1 and 16 RPM. In the present study, both steady and unsteady aerodynamic loads, such as the rotor torque, blade hub bending moment, and base the tower bending moment of the tower, are evaluated in detail to provide overall assessment of different wind turbine configurations. Aerodynamic interactions between the rotor and tower are analyzed,more » including the rotor wake development downstream. The computational analysis provides insight into aerodynamic performance of the upwind and downwind, two- and three-bladed horizontal axis wind turbines.« less

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Interconversion algorithm between mechanical and dielectric relaxation measurements for acetate of cis- and trans-2-phenyl-5-hydroxymethyl-1,3-dioxane.

PubMed

Garcia-Bernabé, A; Lidón-Roger, J V; Sanchis, M J; Díaz-Calleja, R; del Castillo, L F

2015-10-01

The dielectric and mechanical spectroscopies of acetate of cis- and trans-2-phenyl-5-hydroxymethyl-1,3-dioxane are reported in the frequency domain from 10(-2) to 10(6)Hz. This ester has been selected in this study for its predominant α relaxation with regard to the β relaxation, which can be neglected. This study consists of determining an interconversion algorithm between dielectric and mechanical measurements, given by using a relation between rotational and translational complex viscosities. These important viscosities were obtained from measures of the dielectric complex permittivity and by dynamic mechanical analysis, respectively. The definitions of rotational and translational viscosities were evaluated by means of fractional calculus, by using the fit parameters of the Havriliak-Negami empirical model obtained in the dielectric and mechanical characterization of the α relaxation. This interconversion algorithm is a generalization of the break of the Stokes-Einstein-Debye relationship. It uses a power law with an exponent defined as the shape factor, which modifies the translational viscosity. Two others factors are introduced for the interconversion, a shift factor, which displaces the translational viscosity in the frequency domain, and a scale factor, which makes equal values of the two viscosities. In this paper, the shape factor has been identified as the relation between the slopes of the moduli of the complex viscosities at higher frequency. This is interpreted as the degree of kinetic coupling between the molecular rotation and translational movements. Alternatively, another interconversion algorithm has been expressed by means of dielectric and mechanical moduli.

An Algorithm for Automatically Modifying Train Crew Schedule

NASA Astrophysics Data System (ADS)

Takahashi, Satoru; Kataoka, Kenji; Kojima, Teruhito; Asami, Masayuki

Once the break-down of the train schedule occurs, the crew schedule as well as the train schedule has to be modified as quickly as possible to restore them. In this paper, we propose an algorithm for automatically modifying a crew schedule that takes all constraints into consideration, presenting a model of the combined problem of crews and trains. The proposed algorithm builds an initial solution by relaxing some of the constraint conditions, and then uses a Taboo-search method to revise this solution in order to minimize the degree of constraint violation resulting from these relaxed conditions. Then we show not only that the algorithm can generate a constraint satisfaction solution, but also that the solution will satisfy the experts. That is, we show the proposed algorithm is capable of producing a usable solution in a short time by applying to actual cases of train-schedule break-down, and that the solution is at least as good as those produced manually, by comparing the both solutions with several point of view.

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

PubMed

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

The Complexity of Bit Retrieval

DOE PAGES

Elser, Veit

2018-09-20

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

The Complexity of Bit Retrieval

DOE Office of Scientific and Technical Information (OSTI.GOV)

Elser, Veit

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

Hybrid upwind discretization of nonlinear two-phase flow with gravity

NASA Astrophysics Data System (ADS)

Lee, S. H.; Efendiev, Y.; Tchelepi, H. A.

2015-08-01

Multiphase flow in porous media is described by coupled nonlinear mass conservation laws. For immiscible Darcy flow of multiple fluid phases, whereby capillary effects are negligible, the transport equations in the presence of viscous and buoyancy forces are highly nonlinear and hyperbolic. Numerical simulation of multiphase flow processes in heterogeneous formations requires the development of discretization and solution schemes that are able to handle the complex nonlinear dynamics, especially of the saturation evolution, in a reliable and computationally efficient manner. In reservoir simulation practice, single-point upwinding of the flux across an interface between two control volumes (cells) is performed for each fluid phase, whereby the upstream direction is based on the gradient of the phase-potential (pressure plus gravity head). This upwinding scheme, which we refer to as Phase-Potential Upwinding (PPU), is combined with implicit (backward-Euler) time discretization to obtain a Fully Implicit Method (FIM). Even though FIM suffers from numerical dispersion effects, it is widely used in practice. This is because of its unconditional stability and because it yields conservative, monotone numerical solutions. However, FIM is not unconditionally convergent. The convergence difficulties are particularly pronounced when the different immiscible fluid phases switch between co-current and counter-current states as a function of time, or (Newton) iteration. Whether the multiphase flow across an interface (between two control-volumes) is co-current, or counter-current, depends on the local balance between the viscous and buoyancy forces, and how the balance evolves in time. The sensitivity of PPU to small changes in the (local) pressure distribution exacerbates the problem. The common strategy to deal with these difficulties is to cut the timestep and try again. Here, we propose a Hybrid-Upwinding (HU) scheme for the phase fluxes, then HU is combined with implicit time discretization to yield a fully implicit method. In the HU scheme, the phase flux is divided into two parts based on the driving force. The viscous-driven and buoyancy-driven phase fluxes are upwinded differently. Specifically, the viscous flux, which is always co-current, is upwinded based on the direction of the total-velocity. The buoyancy-driven flux across an interface is always counter-current and is upwinded such that the heavier fluid goes downward and the lighter fluid goes upward. We analyze the properties of the Implicit Hybrid Upwinding (IHU) scheme. It is shown that IHU is locally conservative and produces monotone, physically-consistent numerical solutions. The IHU solutions show numerical diffusion levels that are slightly higher than those for standard FIM (i.e., implicit PPU). The primary advantage of the IHU scheme is that the numerical overall-flux of a fluid phase remains continuous and differentiable as the flow regime changes between co-current and counter-current conditions. This is in contrast to the standard phase-potential upwinding scheme, in which the overall fractional-flow (flux) function is non-differentiable across the boundary between co-current and counter-current flows.

Three-Dimensional Navier-Stokes Method with Two-Equation Turbulence Models for Efficient Numerical Simulation of Hypersonic Flows

NASA Technical Reports Server (NTRS)

Bardina, J. E.

1994-01-01

A new computational efficient 3-D compressible Reynolds-averaged implicit Navier-Stokes method with advanced two equation turbulence models for high speed flows is presented. All convective terms are modeled using an entropy satisfying higher-order Total Variation Diminishing (TVD) scheme based on implicit upwind flux-difference split approximations and arithmetic averaging procedure of primitive variables. This method combines the best features of data management and computational efficiency of space marching procedures with the generality and stability of time dependent Navier-Stokes procedures to solve flows with mixed supersonic and subsonic zones, including streamwise separated flows. Its robust stability derives from a combination of conservative implicit upwind flux-difference splitting with Roe's property U to provide accurate shock capturing capability that non-conservative schemes do not guarantee, alternating symmetric Gauss-Seidel 'method of planes' relaxation procedure coupled with a three-dimensional two-factor diagonal-dominant approximate factorization scheme, TVD flux limiters of higher-order flux differences satisfying realizability, and well-posed characteristic-based implicit boundary-point a'pproximations consistent with the local characteristics domain of dependence. The efficiency of the method is highly increased with Newton Raphson acceleration which allows convergence in essentially one forward sweep for supersonic flows. The method is verified by comparing with experiment and other Navier-Stokes methods. Here, results of adiabatic and cooled flat plate flows, compression corner flow, and 3-D hypersonic shock-wave/turbulent boundary layer interaction flows are presented. The robust 3-D method achieves a better computational efficiency of at least one order of magnitude over the CNS Navier-Stokes code. It provides cost-effective aerodynamic predictions in agreement with experiment, and the capability of predicting complex flow structures in complex geometries with good accuracy.

A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Rusell; Nagarajan, Harsha; Sundar, Kaarthik

2017-09-25

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures

Application of a symmetric total variation diminishing scheme to aerodynamics of rotors

NASA Astrophysics Data System (ADS)

Usta, Ebru

2002-09-01

The aerodynamics characteristics of rotors in hover have been studied on stretched non-orthogonal grids using spatially high order symmetric total variation diminishing (STVD) schemes. Several companion numerical viscosity terms have been tested. The effects of higher order metrics, higher order load integrations and turbulence effects on the rotor performance have been studied. Where possible, calculations for 1-D and 2-D benchmark problems have been done on uniform grids, and comparisons with exact solutions have been made to understand the dispersion and dissipation characteristics of these algorithms. A baseline finite volume methodology termed TURNS (Transonic Unsteady Rotor Navier-Stokes) is the starting point for this effort. The original TURNS solver solves the 3-D compressible Navier-Stokes equations in an integral form using a third order upwind scheme. It is first or second order accurate in time. In the modified solver, the inviscid flux at a cell face is decomposed into two parts. The first part of the flux is symmetric in space, while the second part consists of an upwind-biased numerical viscosity term. The symmetric part of the flux at the cell face is computed to fourth-, sixth- or eighth order accuracy in space. The numerical viscosity portion of the flux is computed using either a third order accurate MUSCL scheme or a fifth order WENO scheme. A number of results are presented for the two-bladed Caradonna-Tung rotor and for a four-bladed UH-60A rotor in hover. Comparisons with the original TURNS code, and experiments are given. Results are also presented on the effects of metrics calculations, load integration algorithms, and turbulence models on the solution accuracy. A total of 64 combinations were studied in this thesis work. For brevity, only a small subset of results highlighting the most important conclusions are presented. It should be noted that use of higher order formulations did not affect the temporal stability of the algorithm and did not require any reduction in the time step. The calculations show that the solution accuracy increases when the 3 rd order upwind scheme in the baseline algorithm is replaced with 4th and 6th order accurate symmetric flux calculations. A point of diminishing returns is reached as increasingly larger stencils are used on highly stretched grids. The numerical viscosity term, when computed with the third order MUSCL scheme, is very dissipative, and does not resolve the tip vortex well. The WENO5 scheme, on the other hand significantly improves the tip vortex capturing. The STVD6+WENO5 scheme, in particular gave the best combinations of solution accuracy and efficiency on stretched grids. Spatially fourth order accurate metric calculations were found to be beneficial, but should be used in conjunction with a limiter that drops the metric calculation to a second order accuracy in the vicinity of grid discontinuities. High order integration of loads was found to have a beneficial, but small effect on the computed loads. Replacing the Baldwin-Lomax turbulence model with a one equation Spalart-Allmaras model resulted in higher than expected profile power contributions. Nevertheless the one-equation model is recommended for its robustness, its ability to model separated flows at high thrust settings, and the natural manner in which turbulence in the rotor wake may be treated.

A Message Passing Approach to Side Chain Positioning with Applications in Protein Docking Refinement *

PubMed Central

Moghadasi, Mohammad; Kozakov, Dima; Mamonov, Artem B.; Vakili, Pirooz; Vajda, Sandor; Paschalidis, Ioannis Ch.

2013-01-01

We introduce a message-passing algorithm to solve the Side Chain Positioning (SCP) problem. SCP is a crucial component of protein docking refinement, which is a key step of an important class of problems in computational structural biology called protein docking. We model SCP as a combinatorial optimization problem and formulate it as a Maximum Weighted Independent Set (MWIS) problem. We then employ a modified and convergent belief-propagation algorithm to solve a relaxation of MWIS and develop randomized estimation heuristics that use the relaxed solution to obtain an effective MWIS feasible solution. Using a benchmark set of protein complexes we demonstrate that our approach leads to more accurate docking predictions compared to a baseline algorithm that does not solve the SCP. PMID:23515575

Semidefinite Relaxation-Based Optimization of Multiple-Input Wireless Power Transfer Systems

NASA Astrophysics Data System (ADS)

Lang, Hans-Dieter; Sarris, Costas D.

2017-11-01

An optimization procedure for multi-transmitter (MISO) wireless power transfer (WPT) systems based on tight semidefinite relaxation (SDR) is presented. This method ensures physical realizability of MISO WPT systems designed via convex optimization -- a robust, semi-analytical and intuitive route to optimizing such systems. To that end, the nonconvex constraints requiring that power is fed into rather than drawn from the system via all transmitter ports are incorporated in a convex semidefinite relaxation, which is efficiently and reliably solvable by dedicated algorithms. A test of the solution then confirms that this modified problem is equivalent (tight relaxation) to the original (nonconvex) one and that the true global optimum has been found. This is a clear advantage over global optimization methods (e.g. genetic algorithms), where convergence to the true global optimum cannot be ensured or tested. Discussions of numerical results yielded by both the closed-form expressions and the refined technique illustrate the importance and practicability of the new method. It, is shown that this technique offers a rigorous optimization framework for a broad range of current and emerging WPT applications.

Algorithmic developments of the kinetic activation-relaxation technique: Accessing long-time kinetics of larger and more complex systems

NASA Astrophysics Data System (ADS)

Trochet, Mickaël; Sauvé-Lacoursière, Alecsandre; Mousseau, Normand

2017-10-01

In spite of the considerable computer speed increase of the last decades, long-time atomic simulations remain a challenge and most molecular dynamical simulations are limited to 1 μ s at the very best in condensed matter and materials science. There is a need, therefore, for accelerated methods that can bridge the gap between the full dynamical description of molecular dynamics and experimentally relevant time scales. This is the goal of the kinetic Activation-Relaxation Technique (k-ART), an off-lattice kinetic Monte-Carlo method with on-the-fly catalog building capabilities based on the topological tool NAUTY and the open-ended search method Activation-Relaxation Technique (ART nouveau) that has been applied with success to the study of long-time kinetics of complex materials, including grain boundaries, alloys, and amorphous materials. We present a number of recent algorithmic additions, including the use of local force calculation, two-level parallelization, improved topological description, and biased sampling and show how they perform on two applications linked to defect diffusion and relaxation after ion bombardement in Si.

Multi-dimensional Upwind Fluctuation Splitting Scheme with Mesh Adaption for Hypersonic Viscous Flow. Degree awarded by Virginia Polytechnic Inst. and State Univ., 9 Nov. 2001

NASA Technical Reports Server (NTRS)

Wood, William A., III

2002-01-01

A multi-dimensional upwind fluctuation splitting scheme is developed and implemented for two-dimensional and axisymmetric formulations of the Navier-Stokes equations on unstructured meshes. Key features of the scheme are the compact stencil, full upwinding, and non-linear discretization which allow for second-order accuracy with enforced positivity. Throughout, the fluctuation splitting scheme is compared to a current state-of-the-art finite volume approach, a second-order, dual mesh upwind flux difference splitting scheme (DMFDSFV), and is shown to produce more accurate results using fewer computer resources for a wide range of test cases. A Blasius flat plate viscous validation case reveals a more accurate upsilon-velocity profile for fluctuation splitting, and the reduced artificial dissipation production is shown relative to DMFDSFV. Remarkably, the fluctuation splitting scheme shows grid converged skin friction coefficients with only five points in the boundary layer for this case. The second half of the report develops a local, compact, anisotropic unstructured mesh adaptation scheme in conjunction with the multi-dimensional upwind solver, exhibiting a characteristic alignment behavior for scalar problems. The adaptation strategy is extended to the two-dimensional and axisymmetric Navier-Stokes equations of motion through the concept of fluctuation minimization.

SToRM: A numerical model for environmental surface flows

USGS Publications Warehouse

Simoes, Francisco J.

2009-01-01

SToRM (System for Transport and River Modeling) is a numerical model developed to simulate free surface flows in complex environmental domains. It is based on the depth-averaged St. Venant equations, which are discretized using unstructured upwind finite volume methods, and contains both steady and unsteady solution techniques. This article provides a brief description of the numerical approach selected to discretize the governing equations in space and time, including important aspects of solving natural environmental flows, such as the wetting and drying algorithm. The presentation is illustrated with several application examples, covering both laboratory and natural river flow cases, which show the model’s ability to solve complex flow phenomena.

Distributed Matrix Completion: Applications to Cooperative Positioning in Noisy Environments

DTIC Science & Technology

2013-12-11

positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown...computing the leading eigenvectors of a large data matrix through gossip algorithms. A new algorithm is proposed that amounts to iteratively multiplying...generalization of gossip algorithms for consensus. The algorithms outperform state-of-the-art methods in a communication-limited scenario. Positioning via

A new algorithm quantifies the roles of wind and midge flight activity in the bluetongue epizootic in northwest Europe

PubMed Central

Sedda, Luigi; Brown, Heidi E.; Purse, Bethan V.; Burgin, Laura; Gloster, John; Rogers, David J.

2012-01-01

The 2006 bluetongue (BT) outbreak in northwestern Europe had devastating effects on cattle and sheep in that intensively farmed area. The role of wind in disease spread, through its effect on Culicoides dispersal, is still uncertain, and remains unquantified. We examine here the relationship between farm-level infection dates and wind speed and direction within the framework of a novel model involving both mechanistic and stochastic steps. We consider wind as both a carrier of host semio-chemicals, to which midges might respond by upwind flight, and as a transporter of the midges themselves, in a more or less downwind direction. For completeness, we also consider midge movement independent of wind and various combinations of upwind, downwind and random movements. Using stochastic simulation, we are able to explain infection onset at 94 per cent of the 2025 affected farms. We conclude that 54 per cent of outbreaks occurred through (presumably midge) movement of infections over distances of no more than 5 km, 92 per cent over distances of no more than 31 km and only 2 per cent over any greater distances. The modal value for all infections combined is less than 1 km. Our analysis suggests that previous claims for a higher frequency of long-distance infections are unfounded. We suggest that many apparent long-distance infections resulted from sequences of shorter-range infections; a ‘stepping stone’ effect. Our analysis also found that downwind movement (the only sort so far considered in explanations of BT epidemics) is responsible for only 39 per cent of all infections, and highlights the effective contribution to disease spread of upwind midge movement, which accounted for 38 per cent of all infections. The importance of midge flight speed is also investigated. Within the same model framework, lower midge active flight speed (of 0.13 rather than 0.5 m s−1) reduced virtually to zero the role of upwind movement, mainly because modelled wind speeds in the area concerned were usually greater than such flight speed. Our analysis, therefore, highlights the need to improve our knowledge of midge flight speed in field situations, which is still very poorly understood. Finally, the model returned an intrinsic incubation period of 8 days, in accordance with the values reported in the literature. We argue that better understanding of the movement of infected insect vectors is an important ingredient in the management of future outbreaks of BT in Europe, and other devastating vector-borne diseases elsewhere. PMID:22319128

Contribution of Vegetation to the Microbial Composition of Nearby Outdoor Air

PubMed Central

Adams, Rachel I.

2016-01-01

ABSTRACT Given that epiphytic microbes are often found in large population sizes on plants, we tested the hypothesis that plants are quantitatively important local sources of airborne microorganisms. The abundance of microbial communities, determined by quantifying bacterial 16S RNA genes and the fungal internal transcribed spacer (ITS) region, in air collected directly above vegetation was 2- to 10-fold higher than that in air collected simultaneously in an adjacent nonvegetated area 50 m upwind. Nonmetric multidimensional scaling revealed that the composition of airborne bacteria in upwind air samples grouped separately from that of downwind air samples, while communities on plants and downwind air could not be distinguished. In contrast, fungal taxa in air samples were more similar to each other than to the fungal epiphytes. A source-tracking algorithm revealed that up to 50% of airborne bacteria in downwind air samples were presumably of local plant origin. The difference in the proportional abundances of a given operational taxonomic unit (OTU) between downwind and upwind air when regressed against the proportional representation of this OTU on the plant yielded a positive slope for both bacteria and fungi, indicating that those taxa that were most abundant on plants proportionally contributed more to downwind air. Epiphytic fungi were less of a determinant of the microbiological distinctiveness of downwind air and upwind air than epiphytic bacteria. Emigration of epiphytic bacteria and, to a lesser extent, fungi, from plants can thus influence the microbial composition of nearby air, a finding that has important implications for surrounding ecosystems, including the built environment into which outdoor air can penetrate. IMPORTANCE This paper addresses the poorly understood role of bacterial and fungal epiphytes, the inhabitants of the aboveground plant parts, in the composition of airborne microbes in outdoor air. It is widely held that epiphytes contribute to atmospheric microbial assemblages, but much of what we know is limited to qualitative assessments. Elucidating the sources of microbes in outdoor air can inform basic biological processes seen in airborne communities (e.g., dispersal and biogeographical patterns). Furthermore, given the considerable contribution of outdoor air to microbial communities found within indoor environments, the understanding of plants as sources of airborne microbes in outdoor air might contribute to our understanding of indoor air quality. With an experimental design developed to minimize the likelihood of other-than-local plant sources contributing to the composition of airborne microbes, we provide direct evidence that plants are quantitatively important local sources of airborne microorganisms, with implications for the surrounding ecosystems. PMID:27107117

Contribution of Vegetation to the Microbial Composition of Nearby Outdoor Air.

PubMed

Lymperopoulou, Despoina S; Adams, Rachel I; Lindow, Steven E

2016-07-01

Given that epiphytic microbes are often found in large population sizes on plants, we tested the hypothesis that plants are quantitatively important local sources of airborne microorganisms. The abundance of microbial communities, determined by quantifying bacterial 16S RNA genes and the fungal internal transcribed spacer (ITS) region, in air collected directly above vegetation was 2- to 10-fold higher than that in air collected simultaneously in an adjacent nonvegetated area 50 m upwind. Nonmetric multidimensional scaling revealed that the composition of airborne bacteria in upwind air samples grouped separately from that of downwind air samples, while communities on plants and downwind air could not be distinguished. In contrast, fungal taxa in air samples were more similar to each other than to the fungal epiphytes. A source-tracking algorithm revealed that up to 50% of airborne bacteria in downwind air samples were presumably of local plant origin. The difference in the proportional abundances of a given operational taxonomic unit (OTU) between downwind and upwind air when regressed against the proportional representation of this OTU on the plant yielded a positive slope for both bacteria and fungi, indicating that those taxa that were most abundant on plants proportionally contributed more to downwind air. Epiphytic fungi were less of a determinant of the microbiological distinctiveness of downwind air and upwind air than epiphytic bacteria. Emigration of epiphytic bacteria and, to a lesser extent, fungi, from plants can thus influence the microbial composition of nearby air, a finding that has important implications for surrounding ecosystems, including the built environment into which outdoor air can penetrate. This paper addresses the poorly understood role of bacterial and fungal epiphytes, the inhabitants of the aboveground plant parts, in the composition of airborne microbes in outdoor air. It is widely held that epiphytes contribute to atmospheric microbial assemblages, but much of what we know is limited to qualitative assessments. Elucidating the sources of microbes in outdoor air can inform basic biological processes seen in airborne communities (e.g., dispersal and biogeographical patterns). Furthermore, given the considerable contribution of outdoor air to microbial communities found within indoor environments, the understanding of plants as sources of airborne microbes in outdoor air might contribute to our understanding of indoor air quality. With an experimental design developed to minimize the likelihood of other-than-local plant sources contributing to the composition of airborne microbes, we provide direct evidence that plants are quantitatively important local sources of airborne microorganisms, with implications for the surrounding ecosystems. Copyright © 2016 Lymperopoulou et al.

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Obayashi, Shigeru

1994-01-01

Aeroelastic tests require extensive cost and risk. An aeroelastic wind-tunnel experiment is an order of magnitude more expensive than a parallel experiment involving only aerodynamics. By complementing the wind-tunnel experiments with numerical simulations, the overall cost of the development of aircraft can be considerably reduced. In order to accurately compute aeroelastic phenomenon it is necessary to solve the unsteady Euler/Navier-Stokes equations simultaneously with the structural equations of motion. These equations accurately describe the flow phenomena for aeroelastic applications. At ARC a code, ENSAERO, is being developed for computing the unsteady aerodynamics and aeroelasticity of aircraft, and it solves the Euler/Navier-Stokes equations. The purpose of this cooperative agreement was to enhance ENSAERO in both algorithm and geometric capabilities. During the last five years, the algorithms of the code have been enhanced extensively by using high-resolution upwind algorithms and efficient implicit solvers. The zonal capability of the code has been extended from a one-to-one grid interface to a mismatching unsteady zonal interface. The geometric capability of the code has been extended from a single oscillating wing case to a full-span wing-body configuration with oscillating control surfaces. Each time a new capability was added, a proper validation case was simulated, and the capability of the code was demonstrated.

Relaxation dynamics of a multihierarchical polymer network

NASA Astrophysics Data System (ADS)

Jurjiu, Aurel; Biter, Teodor Lucian; Turcu, Flaviu

2017-01-01

In this work, we study the relaxation dynamics of a multihierarchical polymer network built by replicating the Vicsek fractal in dendrimer shape. The relaxation dynamics is investigated in the framework of the generalized Gaussian structure model by employing both Rouse and Zimm approaches. In the Rouse-type approach, we show the iterative procedure whereby the whole eigenvalue spectrum of the connectivity matrix of the multihierarchical structure can be obtained. Remarkably, the general picture that emerges from both approaches, even though we have a mixed growth algorithm, is that the obtained multihierarchical structure preserves the individual relaxation behaviors of its components. The theoretical findings with respect to the splitting of the intermediate domain of the relaxation quantities are well supported by experimental results.

Adaptive Inverse Control for Rotorcraft Vibration Reduction

NASA Technical Reports Server (NTRS)

Jacklin, Stephen A.

1985-01-01

This thesis extends the Least Mean Square (LMS) algorithm to solve the mult!ple-input, multiple-output problem of alleviating N/Rev (revolutions per minute by number of blades) helicopter fuselage vibration by means of adaptive inverse control. A frequency domain locally linear model is used to represent the transfer matrix relating the higher harmonic pitch control inputs to the harmonic vibration outputs to be controlled. By using the inverse matrix as the controller gain matrix, an adaptive inverse regulator is formed to alleviate the N/Rev vibration. The stability and rate of convergence properties of the extended LMS algorithm are discussed. It is shown that the stability ranges for the elements of the stability gain matrix are directly related to the eigenvalues of the vibration signal information matrix for the learning phase, but not for the control phase. The overall conclusion is that the LMS adaptive inverse control method can form a robust vibration control system, but will require some tuning of the input sensor gains, the stability gain matrix, and the amount of control relaxation to be used. The learning curve of the controller during the learning phase is shown to be quantitatively close to that predicted by averaging the learning curves of the normal modes. For higher order transfer matrices, a rough estimate of the inverse is needed to start the algorithm efficiently. The simulation results indicate that the factor which most influences LMS adaptive inverse control is the product of the control relaxation and the the stability gain matrix. A small stability gain matrix makes the controller less sensitive to relaxation selection, and permits faster and more stable vibration reduction, than by choosing the stability gain matrix large and the control relaxation term small. It is shown that the best selections of the stability gain matrix elements and the amount of control relaxation is basically a compromise between slow, stable convergence and fast convergence with increased possibility of unstable identification. In the simulation studies, the LMS adaptive inverse control algorithm is shown to be capable of adapting the inverse (controller) matrix to track changes in the flight conditions. The algorithm converges quickly for moderate disturbances, while taking longer for larger disturbances. Perfect knowledge of the inverse matrix is not required for good control of the N/Rev vibration. However it is shown that measurement noise will prevent the LMS adaptive inverse control technique from controlling the vibration, unless the signal averaging method presented is incorporated into the algorithm.

Central Upwind Scheme for a Compressible Two-Phase Flow Model

PubMed Central

Ahmed, Munshoor; Saleem, M. Rehan; Zia, Saqib; Qamar, Shamsul

2015-01-01

In this article, a compressible two-phase reduced five-equation flow model is numerically investigated. The model is non-conservative and the governing equations consist of two equations describing the conservation of mass, one for overall momentum and one for total energy. The fifth equation is the energy equation for one of the two phases and it includes source term on the right-hand side which represents the energy exchange between two fluids in the form of mechanical and thermodynamical work. For the numerical approximation of the model a high resolution central upwind scheme is implemented. This is a non-oscillatory upwind biased finite volume scheme which does not require a Riemann solver at each time step. Few numerical case studies of two-phase flows are presented. For validation and comparison, the same model is also solved by using kinetic flux-vector splitting (KFVS) and staggered central schemes. It was found that central upwind scheme produces comparable results to the KFVS scheme. PMID:26039242

Central upwind scheme for a compressible two-phase flow model.

PubMed

Ahmed, Munshoor; Saleem, M Rehan; Zia, Saqib; Qamar, Shamsul

2015-01-01

In this article, a compressible two-phase reduced five-equation flow model is numerically investigated. The model is non-conservative and the governing equations consist of two equations describing the conservation of mass, one for overall momentum and one for total energy. The fifth equation is the energy equation for one of the two phases and it includes source term on the right-hand side which represents the energy exchange between two fluids in the form of mechanical and thermodynamical work. For the numerical approximation of the model a high resolution central upwind scheme is implemented. This is a non-oscillatory upwind biased finite volume scheme which does not require a Riemann solver at each time step. Few numerical case studies of two-phase flows are presented. For validation and comparison, the same model is also solved by using kinetic flux-vector splitting (KFVS) and staggered central schemes. It was found that central upwind scheme produces comparable results to the KFVS scheme.

Universal single level implicit algorithm for gasdynamics

NASA Technical Reports Server (NTRS)

Lombard, C. K.; Venkatapthy, E.

1984-01-01

A single level effectively explicit implicit algorithm for gasdynamics is presented. The method meets all the requirements for unconditionally stable global iteration over flows with mixed supersonic and supersonic zones including blunt body flow and boundary layer flows with strong interaction and streamwise separation. For hyperbolic (supersonic flow) regions the method is automatically equivalent to contemporary space marching methods. For elliptic (subsonic flow) regions, rapid convergence is facilitated by alternating direction solution sweeps which bring both sets of eigenvectors and the influence of both boundaries of a coordinate line equally into play. Point by point updating of the data with local iteration on the solution procedure at each spatial step as the sweeps progress not only renders the method single level in storage but, also, improves nonlinear accuracy to accelerate convergence by an order of magnitude over related two level linearized implicit methods. The method derives robust stability from the combination of an eigenvector split upwind difference method (CSCM) with diagonally dominant ADI(DDADI) approximate factorization and computed characteristic boundary approximations.

A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.

PubMed

Gong, Pinghua; Zhang, Changshui; Lu, Zhaosong; Huang, Jianhua Z; Ye, Jieping

2013-01-01

Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems because its computational cost is a multiple of solving a single convex problem. In this paper, we propose a General Iterative Shrinkage and Thresholding (GIST) algorithm to solve the nonconvex optimization problem for a large class of non-convex penalties. The GIST algorithm iteratively solves a proximal operator problem, which in turn has a closed-form solution for many commonly used penalties. At each outer iteration of the algorithm, we use a line search initialized by the Barzilai-Borwein (BB) rule that allows finding an appropriate step size quickly. The paper also presents a detailed convergence analysis of the GIST algorithm. The efficiency of the proposed algorithm is demonstrated by extensive experiments on large-scale data sets.

Operator induced multigrid algorithms using semirefinement

NASA Technical Reports Server (NTRS)

Decker, Naomi; Vanrosendale, John

1989-01-01

A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two and three dimensional model problems are presented, together with a two level analysis explaining these results.

Distributed Data-aggregation Consensus for Sensor Networks: Relaxation of Consensus Concept and Convergence Property

DTIC Science & Technology

2014-08-01

consensus algorithm called randomized gossip is more suitable [7, 8]. In asynchronous randomized gossip algorithms, pairs of neighboring nodes exchange...messages and perform updates in an asynchronous and unattended manner, and they also 1 The class of broadcast gossip algorithms [9, 10, 11, 12] are...dynamics [2] and asynchronous pairwise randomized gossip [7, 8], broadcast gossip algorithms do not require that nodes know the identities of their

Differential and relaxed image foresting transform for graph-cut segmentation of multiple 3D objects.

PubMed

Moya, Nikolas; Falcão, Alexandre X; Ciesielski, Krzysztof C; Udupa, Jayaram K

2014-01-01

Graph-cut algorithms have been extensively investigated for interactive binary segmentation, when the simultaneous delineation of multiple objects can save considerable user's time. We present an algorithm (named DRIFT) for 3D multiple object segmentation based on seed voxels and Differential Image Foresting Transforms (DIFTs) with relaxation. DRIFT stands behind efficient implementations of some state-of-the-art methods. The user can add/remove markers (seed voxels) along a sequence of executions of the DRIFT algorithm to improve segmentation. Its first execution takes linear time with the image's size, while the subsequent executions for corrections take sublinear time in practice. At each execution, DRIFT first runs the DIFT algorithm, then it applies diffusion filtering to smooth boundaries between objects (and background) and, finally, it corrects possible objects' disconnection occurrences with respect to their seeds. We evaluate DRIFT in 3D CT-images of the thorax for segmenting the arterial system, esophagus, left pleural cavity, right pleural cavity, trachea and bronchi, and the venous system.

Development of a 3-D upwind PNS code for chemically reacting hypersonic flowfields

NASA Technical Reports Server (NTRS)

Tannehill, J. C.; Wadawadigi, G.

1992-01-01

Two new parabolized Navier-Stokes (PNS) codes were developed to compute the three-dimensional, viscous, chemically reacting flow of air around hypersonic vehicles such as the National Aero-Space Plane (NASP). The first code (TONIC) solves the gas dynamic and species conservation equations in a fully coupled manner using an implicit, approximately-factored, central-difference algorithm. This code was upgraded to include shock fitting and the capability of computing the flow around complex body shapes. The revised TONIC code was validated by computing the chemically-reacting (M(sub infinity) = 25.3) flow around a 10 deg half-angle cone at various angles of attack and the Ames All-Body model at 0 deg angle of attack. The results of these calculations were in good agreement with the results from the UPS code. One of the major drawbacks of the TONIC code is that the central-differencing of fluxes across interior flowfield discontinuities tends to introduce errors into the solution in the form of local flow property oscillations. The second code (UPS), originally developed for a perfect gas, has been extended to permit either perfect gas, equilibrium air, or nonequilibrium air computations. The code solves the PNS equations using a finite-volume, upwind TVD method based on Roe's approximate Riemann solver that was modified to account for real gas effects. The dissipation term associated with this algorithm is sufficiently adaptive to flow conditions that, even when attempting to capture very strong shock waves, no additional smoothing is required. For nonequilibrium calculations, the code solves the fluid dynamic and species continuity equations in a loosely-coupled manner. This code was used to calculate the hypersonic, laminar flow of chemically reacting air over cones at various angles of attack. In addition, the flow around the McDonnel Douglas generic option blended-wing-body was computed and comparisons were made between the perfect gas, equilibrium air, and the nonequilibrium air results.

Computational physical oceanography -- A comprehensive approach based on generalized CFD/grid techniques for planetary scale simulations of oceanic flows. Final report, September 1, 1995--August 31, 1996

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beddhu, M.; Jiang, M.Y.; Whitfield, D.L.

The original intention for this work was to impart the technology that was developed in the field of computational aeronautics to the field of computational physical oceanography. This technology transfer involved grid generation techniques and solution procedures to solve the governing equations over the grids thus generated. Specifically, boundary fitting non-orthogonal grids would be generated over a sphere taking into account the topography of the ocean floor and the topography of the continents. The solution methodology to be employed involved the application of an upwind, finite volume discretization procedure that uses higher order numerical fluxes at the cell faces tomore » discretize the governing equations and an implicit Newton relaxation technique to solve the discretized equations. This report summarizes the efforts put forth during the past three years to achieve these goals and indicates the future direction of this work as it is still an ongoing effort.« less

Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions

NASA Astrophysics Data System (ADS)

Teal, Paul D.; Eccles, Craig

2015-04-01

The two most successful methods of estimating the distribution of nuclear magnetic resonance relaxation times from two dimensional data are data compression followed by application of the Butler-Reeds-Dawson algorithm, and a primal-dual interior point method using preconditioned conjugate gradient. Both of these methods have previously been presented using a truncated singular value decomposition of matrices representing the exponential kernel. In this paper it is shown that other matrix factorizations are applicable to each of these algorithms, and that these illustrate the different fundamental principles behind the operation of the algorithms. These are the rank-revealing QR (RRQR) factorization and the LDL factorization with diagonal pivoting, also known as the Bunch-Kaufman-Parlett factorization. It is shown that both algorithms can be improved by adaptation of the truncation as the optimization process progresses, improving the accuracy as the optimal value is approached. A variation on the interior method viz, the use of barrier function instead of the primal-dual approach, is found to offer considerable improvement in terms of speed and reliability. A third type of algorithm, related to the algorithm known as Fast iterative shrinkage-thresholding algorithm, is applied to the problem. This method can be efficiently formulated without the use of a matrix decomposition.

A Time-Accurate Upwind Unstructured Finite Volume Method for Compressible Flow with Cure of Pathological Behaviors

NASA Technical Reports Server (NTRS)

Loh, Ching Y.; Jorgenson, Philip C. E.

2007-01-01

A time-accurate, upwind, finite volume method for computing compressible flows on unstructured grids is presented. The method is second order accurate in space and time and yields high resolution in the presence of discontinuities. For efficiency, the Roe approximate Riemann solver with an entropy correction is employed. In the basic Euler/Navier-Stokes scheme, many concepts of high order upwind schemes are adopted: the surface flux integrals are carefully treated, a Cauchy-Kowalewski time-stepping scheme is used in the time-marching stage, and a multidimensional limiter is applied in the reconstruction stage. However even with these up-to-date improvements, the basic upwind scheme is still plagued by the so-called "pathological behaviors," e.g., the carbuncle phenomenon, the expansion shock, etc. A solution to these limitations is presented which uses a very simple dissipation model while still preserving second order accuracy. This scheme is referred to as the enhanced time-accurate upwind (ETAU) scheme in this paper. The unstructured grid capability renders flexibility for use in complex geometry; and the present ETAU Euler/Navier-Stokes scheme is capable of handling a broad spectrum of flow regimes from high supersonic to subsonic at very low Mach number, appropriate for both CFD (computational fluid dynamics) and CAA (computational aeroacoustics). Numerous examples are included to demonstrate the robustness of the methods.

Comparison of the AUSM(+) and H-CUSP Schemes for Turbomachinery Applications

NASA Technical Reports Server (NTRS)

Chima, Rodrick V.; Liou, Meng-Sing

2003-01-01

Many turbomachinery CFD codes use second-order central-difference (C-D) schemes with artificial viscosity to control point decoupling and to capture shocks. While C-D schemes generally give accurate results, they can also exhibit minor numerical problems including overshoots at shocks and at the edges of viscous layers, and smearing of shocks and other flow features. In an effort to improve predictive capability for turbomachinery problems, two C-D codes developed by Chima, RVCQ3D and Swift, were modified by the addition of two upwind schemes: the AUSM+ scheme developed by Liou, et al., and the H-CUSP scheme developed by Tatsumi, et al. Details of the C-D scheme and the two upwind schemes are described, and results of three test cases are shown. Results for a 2-D transonic turbine vane showed that the upwind schemes eliminated viscous layer overshoots. Results for a 3-D turbine vane showed that the upwind schemes gave improved predictions of exit flow angles and losses, although the HCUSP scheme predicted slightly higher losses than the other schemes. Results for a 3-D supersonic compressor (NASA rotor 37) showed that the AUSM+ scheme predicted exit distributions of total pressure and temperature that are not generally captured by C-D codes. All schemes showed similar convergence rates, but the upwind schemes required considerably more CPU time per iteration.

An implementation of a chemical and thermal nonequilibrium flow solver on unstructured meshes and application to blunt bodies

NASA Technical Reports Server (NTRS)

Prabhu, Ramadas K.

1994-01-01

This paper presents a nonequilibrium flow solver, implementation of the algorithm on unstructured meshes, and application to hypersonic flow past blunt bodies. Air is modeled as a mixture of five chemical species, namely O2, N2, O, NO, and N, having two temperatures namely translational and vibrational. The solution algorithm is a cell centered, point implicit upwind scheme that employs Roe's flux difference splitting technique. Implementation of this algorithm on unstructured meshes is described. The computer code is applied to solve Mach 15 flow with and without a Type IV shock interference on a cylindrical body of 2.5mm radius representing a cowl lip. Adaptively generated meshes are employed, and the meshes are refined several times until the solution exhibits detailed flow features and surface pressure and heat flux distributions. Effects of a catalytic wall on surface heat flux distribution are studied. For the Mach 15 Type IV shock interference flow, present results showed a peak heat flux of 544 MW/m2 for a fully catalytic wall and 431 MW/m(exp 2) for a noncatalytic wall. Some of the results are compared with available computational data.

SPATIAL VARIATION OF THE EVOLUTION AND STRUCTURE OF THE URBAN BOUNDARY LAYER

EPA Science Inventory

The spatial variation of the nocturnal urban boundary layer structure and the time variation of the mixing height, the nocturnal inversion top and strength after sunrise are presented for urban sites located upwind, downwind, and near the center of the heat island and for upwind ...

A nudging-based data assimilation method: the Back and Forth Nudging (BFN) algorithm

NASA Astrophysics Data System (ADS)

Auroux, D.; Blum, J.

2008-03-01

This paper deals with a new data assimilation algorithm, called Back and Forth Nudging. The standard nudging technique consists in adding to the equations of the model a relaxation term that is supposed to force the observations to the model. The BFN algorithm consists in repeatedly performing forward and backward integrations of the model with relaxation (or nudging) terms, using opposite signs in the direct and inverse integrations, so as to make the backward evolution numerically stable. This algorithm has first been tested on the standard Lorenz model with discrete observations (perfect or noisy) and compared with the variational assimilation method. The same type of study has then been performed on the viscous Burgers equation, comparing again with the variational method and focusing on the time evolution of the reconstruction error, i.e. the difference between the reference trajectory and the identified one over a time period composed of an assimilation period followed by a prediction period. The possible use of the BFN algorithm as an initialization for the variational method has also been investigated. Finally the algorithm has been tested on a layered quasi-geostrophic model with sea-surface height observations. The behaviours of the two algorithms have been compared in the presence of perfect or noisy observations, and also for imperfect models. This has allowed us to reach a conclusion concerning the relative performances of the two algorithms.

Fast Algorithms for Estimating Mixture Parameters

DTIC Science & Technology

1989-08-30

The investigation is a two year project with the first year sponsored by the Army Research Office and the second year by the National Science Foundation (Grant... Science Foundation during the coming year. Keywords: Fast algorithms; Algorithms Mixture Distribution Random Variables. (KR)...numerical testing of the accelerated fixed-point method was completed. The work on relaxation methods will be done under the sponsorship of the National

An algorithm for the solution of dynamic linear programs

NASA Technical Reports Server (NTRS)

Psiaki, Mark L.

1989-01-01

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Non-rigid ultrasound image registration using generalized relaxation labeling process

NASA Astrophysics Data System (ADS)

Lee, Jong-Ha; Seong, Yeong Kyeong; Park, MoonHo; Woo, Kyoung-Gu; Ku, Jeonghun; Park, Hee-Jun

2013-03-01

This research proposes a novel non-rigid registration method for ultrasound images. The most predominant anatomical features in medical images are tissue boundaries, which appear as edges. In ultrasound images, however, other features can be identified as well due to the specular reflections that appear as bright lines superimposed on the ideal edge location. In this work, an image's local phase information (via the frequency domain) is used to find the ideal edge location. The generalized relaxation labeling process is then formulated to align the feature points extracted from the ideal edge location. In this work, the original relaxation labeling method was generalized by taking n compatibility coefficient values to improve non-rigid registration performance. This contextual information combined with a relaxation labeling process is used to search for a correspondence. Then the transformation is calculated by the thin plate spline (TPS) model. These two processes are iterated until the optimal correspondence and transformation are found. We have tested our proposed method and the state-of-the-art algorithms with synthetic data and bladder ultrasound images of in vivo human subjects. Experiments show that the proposed method improves registration performance significantly, as compared to other state-of-the-art non-rigid registration algorithms.

Lifelong-RL: Lifelong Relaxation Labeling for Separating Entities and Aspects in Opinion Targets.

PubMed

Shu, Lei; Liu, Bing; Xu, Hu; Kim, Annice

2016-11-01

It is well-known that opinions have targets. Extracting such targets is an important problem of opinion mining because without knowing the target of an opinion, the opinion is of limited use. So far many algorithms have been proposed to extract opinion targets. However, an opinion target can be an entity or an aspect (part or attribute) of an entity. An opinion about an entity is an opinion about the entity as a whole, while an opinion about an aspect is just an opinion about that specific attribute or aspect of an entity. Thus, opinion targets should be separated into entities and aspects before use because they represent very different things about opinions. This paper proposes a novel algorithm, called Lifelong-RL , to solve the problem based on lifelong machine learning and relaxation labeling . Extensive experiments show that the proposed algorithm Lifelong-RL outperforms baseline methods markedly.

Flow Applications of the Least Squares Finite Element Method

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan

1998-01-01

The main thrust of the effort has been towards the development, analysis and implementation of the least-squares finite element method (LSFEM) for fluid dynamics and electromagnetics applications. In the past year, there were four major accomplishments: 1) special treatments in computational fluid dynamics and computational electromagnetics, such as upwinding, numerical dissipation, staggered grid, non-equal order elements, operator splitting and preconditioning, edge elements, and vector potential are unnecessary; 2) the analysis of the LSFEM for most partial differential equations can be based on the bounded inverse theorem; 3) the finite difference and finite volume algorithms solve only two Maxwell equations and ignore the divergence equations; and 4) the first numerical simulation of three-dimensional Marangoni-Benard convection was performed using the LSFEM.

Reduction of Air Pollution Levels Downwind of a Road with an Upwind Noise Barrier

EPA Science Inventory

We propose a dispersion model to characterize the impact of an upwind solid noise barrier next to a highway on air pollution concentrations downwind of the road. The model is based on data from wind tunnel experiments conducted by Heist et al. (2009). The model assumes that the...

Effects of wind on background particle concentrations at truck freight terminals.

PubMed

Garcia, Ronald; Hart, Jaime E; Davis, Mary E; Reaser, Paul; Natkin, Jonathan; Laden, Francine; Garshick, Eric; Smith, Thomas J

2007-01-01

Truck freight terminals are predominantly located near highways and industrial facilities. This proximity to pollution sources, coupled with meteorological conditions and wind patterns, may affect occupational exposures to particles at these work locations. To understand this process, data from an environmental sampling study of particles at U.S. trucking terminals, along with weather and geographic maps, were analyzed to determine the extent to which the transportation of particles from local pollutant sources elevated observed occupational exposures at these locations. To help identify potential upwind sources, wind direction weighted averages and speed measurements were used to construct wind roses that were superimposed on overhead photos of the terminal and examined for upwind source activity. Statistical tests were performed on these "source" and "nonsource" directions to determine whether there were significant differences in observed particle levels between the two groups. Our results provide evidence that nearby upwind pollution sources significantly elevated background concentrations at only a few of the locations sampled, whereas the majority provided little to no evidence of a significant upwind source effect.

Compatible diagonal-norm staggered and upwind SBP operators

NASA Astrophysics Data System (ADS)

Mattsson, Ken; O'Reilly, Ossian

2018-01-01

The main motivation with the present study is to achieve a provably stable high-order accurate finite difference discretisation of linear first-order hyperbolic problems on a staggered grid. The use of a staggered grid makes it non-trivial to discretise advective terms. To overcome this difficulty we discretise the advective terms using upwind Summation-By-Parts (SBP) operators, while the remaining terms are discretised using staggered SBP operators. The upwind and staggered SBP operators (for each order of accuracy) are compatible, here meaning that they are based on the same diagonal norms, allowing for energy estimates to be formulated. The boundary conditions are imposed using a penalty (SAT) technique, to guarantee linear stability. The resulting SBP-SAT approximations lead to fully explicit ODE systems. The accuracy and stability properties are demonstrated for linear hyperbolic problems in 1D, and for the 2D linearised Euler equations with constant background flow. The newly derived upwind and staggered SBP operators lead to significantly more accurate numerical approximations, compared with the exclusive usage of (previously derived) central-difference first derivative SBP operators.

Global ERS 1 and 2 and NSCAT observations: Upwind/crosswind and upwind/downwind measurements

NASA Astrophysics Data System (ADS)

Quilfen, Y.; Chapron, B.; Bentamy, A.; Gourrion, J.; El Fouhaily, T.; Vandemark, D.

1999-05-01

This paper presents an analysis of the wind speed dependence of upwind/downwind asymmetry (UDA) and upwind-crosswind anisotropy (UCA) as derived from global C band VV-polarized ERS 1 and 2 and Ku band VV- and HH-polarized NASA scatterometer (NSCAT) data. Interpretation of the results relies on identifying relationships between the differing frequencies and incidence angles that are consistent with Bragg scattering theory from gravity-capillary waves. It is shown that globally derived parameters characterizing UDA and UCA hold information on the wind dependence of short gravity and gravity-capillary wave growth and dissipation. In particular, the UCA behavior is found quadratic for both the C and Ku band, peaking at moderate wind speeds. In addition, the dual-frequency results appear to map out the expected, more rapid adjustment of centimeter-scale (Ku band) waves to the wind direction at light winds. However, as wind increases, the directionality associated with these shorter waves saturates at a lower speed than for the slightly longer waves inferred at C band. It is suggested that this observed phenomenon may be related to increasing wave-drift interactions that can potentially inhibit short-scale surface wave growth along the wind direction. Concerning UDA properties, our present analysis reveals that the NSCAT and ERS 1 and 2 scatterometers give quite different results. Our preliminary interpretation is that C band measurements may be easier to interpret using composite Bragg scattering theory and that upwind/downwind contrasts are mainly supported by short gravity waves.

Hydrogen sulfide concentrations at three middle schools near industrial livestock facilities.

PubMed

Guidry, Virginia T; Kinlaw, Alan C; Johnston, Jill; Hall, Devon; Wing, Steve

2017-03-01

Safe school environments are essential for healthy development, yet some schools are near large-scale livestock facilities that emit air pollution. Hydrogen sulfide (H 2 S) from decomposing manure is an indicator of livestock-related air pollution. We measured outdoor concentrations of H 2 S at three public middle schools near livestock facilities in North Carolina. We used circular graphs to relate H 2 S detection and wind direction to geospatial distributions of nearby livestock barns. We also used logistic and linear regression to model H 2 S in relation to upwind, distance-weighted livestock barn area. Circular graphs suggested an association between upwind livestock barns and H 2 S detection. The log-odds of H 2 S detection per 1000 m 2 increased with upwind weighted swine barn area (School A: β-coefficient (β)=0.43, SE=0.06; School B: β=0.64, SE=0.24) and upwind weighted poultry barn area (School A: β=0.05, SE=0.01), with stronger associations during periods of atmospheric stability than atmospheric instability (School A stable: β=0.69, SE=0.11; School A unstable: β=0.32, SE=0.09). H 2 S concentration also increased linearly with upwind swine barn area, with greater increases during stable atmospheric conditions (stable: β=0.16 parts per billion (p.p.b.), SE=0.01; unstable: β=0.05 p.p.b., SE=0.01). Off-site migration of pollutants from industrial livestock operations can decrease air quality at nearby schools.

Distributed Matrix Completion: Application to Cooperative Positioning in Noisy Environments

DTIC Science & Technology

2013-12-11

positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown to...of a large data matrix through gossip algorithms. A new algorithm is proposed that amounts to iteratively multiplying a vector by independent random...sparsification of the original matrix and averaging the resulting normalized vectors. This can be viewed as a generalization of gossip algorithms for

Preconditioned conjugate-gradient methods for low-speed flow calculations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1993-01-01

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Preconditioned Conjugate Gradient methods for low speed flow calculations

NASA Technical Reports Server (NTRS)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1993-01-01

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations are integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and the convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the lower-upper (L-U)-successive symmetric over-relaxation iterative scheme is more efficient than a preconditioner based on incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional line Gauss-Seidel relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Experimental validation of convection-diffusion discretisation scheme employed for computational modelling of biological mass transport

PubMed Central

2010-01-01

Background The finite volume solver Fluent (Lebanon, NH, USA) is a computational fluid dynamics software employed to analyse biological mass-transport in the vasculature. A principal consideration for computational modelling of blood-side mass-transport is convection-diffusion discretisation scheme selection. Due to numerous discretisation schemes available when developing a mass-transport numerical model, the results obtained should either be validated against benchmark theoretical solutions or experimentally obtained results. Methods An idealised aneurysm model was selected for the experimental and computational mass-transport analysis of species concentration due to its well-defined recirculation region within the aneurysmal sac, allowing species concentration to vary slowly with time. The experimental results were obtained from fluid samples extracted from a glass aneurysm model, using the direct spectrophometric concentration measurement technique. The computational analysis was conducted using the four convection-diffusion discretisation schemes available to the Fluent user, including the First-Order Upwind, the Power Law, the Second-Order Upwind and the Quadratic Upstream Interpolation for Convective Kinetics (QUICK) schemes. The fluid has a diffusivity of 3.125 × 10-10 m2/s in water, resulting in a Peclet number of 2,560,000, indicating strongly convection-dominated flow. Results The discretisation scheme applied to the solution of the convection-diffusion equation, for blood-side mass-transport within the vasculature, has a significant influence on the resultant species concentration field. The First-Order Upwind and the Power Law schemes produce similar results. The Second-Order Upwind and QUICK schemes also correlate well but differ considerably from the concentration contour plots of the First-Order Upwind and Power Law schemes. The computational results were then compared to the experimental findings. An average error of 140% and 116% was demonstrated between the experimental results and those obtained from the First-Order Upwind and Power Law schemes, respectively. However, both the Second-Order upwind and QUICK schemes accurately predict species concentration under high Peclet number, convection-dominated flow conditions. Conclusion Convection-diffusion discretisation scheme selection has a strong influence on resultant species concentration fields, as determined by CFD. Furthermore, either the Second-Order or QUICK discretisation schemes should be implemented when numerically modelling convection-dominated mass-transport conditions. Finally, care should be taken not to utilize computationally inexpensive discretisation schemes at the cost of accuracy in resultant species concentration. PMID:20642816

The kinetic activation-relaxation technique: an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search

NASA Astrophysics Data System (ADS)

Mousseau, Nomand

2012-02-01

While kinetic Monte Carlo algorithm has been proposed almost 40 years ago, its application in materials science has been mostly limited to lattice-based motion due to the difficulties associated with identifying new events and building usable catalogs when atoms moved into off-lattice position. Here, I present the kinetic activation-relaxation technique (kinetic ART) is an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search [1]. It combines ART nouveau [2], a very efficient unbiased open-ended activated method for finding transition states, with a topological classification [3] that allows a discrete cataloguing of local environments in complex systems, including disordered materials. In kinetic ART, local topologies are first identified for all atoms in a system. ART nouveau event searches are then launched for new topologies, building an extensive catalog of barriers and events. Next, all low energy events are fully reconstructed and relaxed, allowing to take complete account of elastic effects in the system's kinetics. Using standard kinetic Monte Carlo, the clock is brought forward and an event is then selected and applied before a new search for topologies is launched. In addition to presenting the various elements of the algorithm, I will discuss three recent applications to ion-bombarded silicon, defect diffusion in Fe and structural relaxation in amorphous silicon.[4pt] This work was done in collaboration with Laurent Karim B'eland, Peter Brommer, Fedwa El-Mellouhi, Jean-Francois Joly and Laurent Lewis.[4pt] [1] F. El-Mellouhi, N. Mousseau and L.J. Lewis, Phys. Rev. B. 78, 153202 (2008); L.K. B'eland et al., Phys. Rev. E 84, 046704 (2011).[2] G.T. Barkema and N. Mousseau, Phys. Rev. Lett. 77, 4358 (1996); E. Machado-Charry et al., J. Chem Phys. 135, 034102, (2011).[3] B.D. McKay, Congressus Numerantium 30, 45 (1981).

A computational atomistic study of the relaxation of ion-bombarded c-Si on experimental time-scales: an application of the kinetic Activation Relaxation Technique

NASA Astrophysics Data System (ADS)

Béland, Laurent Karim; Mousseau, Normand

2012-02-01

The kinetic activation relaxation technique (kinetic ART) method, an off-lattice, self-learning kinetic Monte Carlo (KMC) algorithm with on-the-fly event search,ootnotetextL. K. B'eland, P. Brommer, F. El-Mellouhi, J.-F. Joly and N. Mousseau, Phys. Rev. E 84, 046704 (2011). is used to study the relaxation of c-Si after Si^- bombardment at 3 keV. We describe the evolution of the damaged areas at room-temperature and above for periods of the order of seconds, treating long-range elastic deformations exactly. We assess the stability of the nanoscale structures formed by the damage cascade and the mechanisms that govern post-implantation annealing.

Adaptive relaxation for the steady-state analysis of Markov chains

NASA Technical Reports Server (NTRS)

Horton, Graham

1994-01-01

We consider a variant of the well-known Gauss-Seidel method for the solution of Markov chains in steady state. Whereas the standard algorithm visits each state exactly once per iteration in a predetermined order, the alternative approach uses a dynamic strategy. A set of states to be visited is maintained which can grow and shrink as the computation progresses. In this manner, we hope to concentrate the computational work in those areas of the chain in which maximum improvement in the solution can be achieved. We consider the adaptive approach both as a solver in its own right and as a relaxation method within the multi-level algorithm. Experimental results show significant computational savings in both cases.

Direct simulation Monte Carlo modeling of relaxation processes in polyatomic gases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pfeiffer, M., E-mail: mpfeiffer@irs.uni-stuttgart.de; Nizenkov, P., E-mail: nizenkov@irs.uni-stuttgart.de; Mirza, A., E-mail: mirza@irs.uni-stuttgart.de

2016-02-15

Relaxation processes of polyatomic molecules are modeled and implemented in an in-house Direct Simulation Monte Carlo code in order to enable the simulation of atmospheric entry maneuvers at Mars and Saturn’s Titan. The description of rotational and vibrational relaxation processes is derived from basic quantum-mechanics using a rigid rotator and a simple harmonic oscillator, respectively. Strategies regarding the vibrational relaxation process are investigated, where good agreement for the relaxation time according to the Landau-Teller expression is found for both methods, the established prohibiting double relaxation method and the new proposed multi-mode relaxation. Differences and applications areas of these two methodsmore » are discussed. Consequently, two numerical methods used for sampling of energy values from multi-dimensional distribution functions are compared. The proposed random-walk Metropolis algorithm enables the efficient treatment of multiple vibrational modes within a time step with reasonable computational effort. The implemented model is verified and validated by means of simple reservoir simulations and the comparison to experimental measurements of a hypersonic, carbon-dioxide flow around a flat-faced cylinder.« less

Direct simulation Monte Carlo modeling of relaxation processes in polyatomic gases

NASA Astrophysics Data System (ADS)

Pfeiffer, M.; Nizenkov, P.; Mirza, A.; Fasoulas, S.

2016-02-01

Relaxation processes of polyatomic molecules are modeled and implemented in an in-house Direct Simulation Monte Carlo code in order to enable the simulation of atmospheric entry maneuvers at Mars and Saturn's Titan. The description of rotational and vibrational relaxation processes is derived from basic quantum-mechanics using a rigid rotator and a simple harmonic oscillator, respectively. Strategies regarding the vibrational relaxation process are investigated, where good agreement for the relaxation time according to the Landau-Teller expression is found for both methods, the established prohibiting double relaxation method and the new proposed multi-mode relaxation. Differences and applications areas of these two methods are discussed. Consequently, two numerical methods used for sampling of energy values from multi-dimensional distribution functions are compared. The proposed random-walk Metropolis algorithm enables the efficient treatment of multiple vibrational modes within a time step with reasonable computational effort. The implemented model is verified and validated by means of simple reservoir simulations and the comparison to experimental measurements of a hypersonic, carbon-dioxide flow around a flat-faced cylinder.

Comparison of upwind and downwind rotor operation of the DOE/NASA 100-kW MOD-0 wind turbine

NASA Technical Reports Server (NTRS)

Glasgow, J. C.; Miller, D. R.; Corrigan, R. D.

1981-01-01

Tests were conducted on a 38m diameter horizontal axis wind turbine, which had first a rotor downwind of the supporting truss tower and then upwind of the tower. Aside from the placement of the rotor and the direction of rotation of the drive train, the wind turbine was identical for both tests. Three aspects of the test results are compared: rotor blade bending loads, rotor teeter response, and nacelle yaw moments. As a result of the tests, it is shown that while mean flatwise bending moments were unaffected by the placement of the rotor, cyclic flatwise bending tended to increase with wind speed for the downwind rotor while remaining somewhat uniform with wind speed for the upwind rotor, reflecting the effects of increased flow disturbance for downwind rotor. Rotor teeter response was not significantly affected by the rotor location relative to the tower, but appears to reflect reduced teeter stability near rated wind speed for both configurations. Teeter stability appears to return above rated wind speed, however. Nacelle yaw moments are higher for the upwind rotor but do not indicate significant design problems for either configuration.

The effect of chemical weapons incineration on the survival rates of Red-tailed Tropicbirds

USGS Publications Warehouse

Schreiber, E.A.; Schenk, G.A.; Doherty, P.F.

2001-01-01

In 1992, the Johnston Atoll Chemical Agent Disposal System (JACADS) began incinerating U.S. chemical weapons stockpiles on Johnston Atoll (Pacific Ocean) where about 500,000 seabirds breed, including Red-tailed Tropicbirds (Phaethon rubricauda). We hypothesized that survival rates of birds were lower in those nesting downwind of the incinerator smokestack compared to those upwind, and that birds might move away from the area. From 1992 - 2000 we monitored survival and movements between areas upwind and downwind from the JACADS facility. We used a multi-strata mark recapture approach to model survival, probability of recapture and movement. Probability of recapture was significantly higher for birds in downwind areas (owing to greater recapture effort) and thus was an important 'nuisance' parameter to take into account in modeling. We found no differences in survival between birds nesting upwind ( 0.8588) and downwind (0.8550). There was no consistent difference in movement rates between upwind or downwind areas from year to year: differences found may be attributed to differing vegetation growth and human activities between the areas. Our results suggest that JACADS has had no documentable influence on the survival and year to year movement of Red-tailed Tropicbirds.

Studies of Inviscid Flux Schemes for Acoustics and Turbulence Problems

NASA Technical Reports Server (NTRS)

Morris, Chris

2013-01-01

Five different central difference schemes, based on a conservative differencing form of the Kennedy and Gruber skew-symmetric scheme, were compared with six different upwind schemes based on primitive variable reconstruction and the Roe flux. These eleven schemes were tested on a one-dimensional acoustic standing wave problem, the Taylor-Green vortex problem and a turbulent channel flow problem. The central schemes were generally very accurate and stable, provided the grid stretching rate was kept below 10%. As near-DNS grid resolutions, the results were comparable to reference DNS calculations. At coarser grid resolutions, the need for an LES SGS model became apparent. There was a noticeable improvement moving from CD-2 to CD-4, and higher-order schemes appear to yield clear benefits on coarser grids. The UB-7 and CU-5 upwind schemes also performed very well at near-DNS grid resolutions. The UB-5 upwind scheme does not do as well, but does appear to be suitable for well-resolved DNS. The UF-2 and UB-3 upwind schemes, which have significant dissipation over a wide spectral range, appear to be poorly suited for DNS or LES.

Deriving quantitative dynamics information for proteins and RNAs using ROTDIF with a graphical user interface.

PubMed

Berlin, Konstantin; Longhini, Andrew; Dayie, T Kwaku; Fushman, David

2013-12-01

To facilitate rigorous analysis of molecular motions in proteins, DNA, and RNA, we present a new version of ROTDIF, a program for determining the overall rotational diffusion tensor from single- or multiple-field nuclear magnetic resonance relaxation data. We introduce four major features that expand the program's versatility and usability. The first feature is the ability to analyze, separately or together, (13)C and/or (15)N relaxation data collected at a single or multiple fields. A significant improvement in the accuracy compared to direct analysis of R2/R1 ratios, especially critical for analysis of (13)C relaxation data, is achieved by subtracting high-frequency contributions to relaxation rates. The second new feature is an improved method for computing the rotational diffusion tensor in the presence of biased errors, such as large conformational exchange contributions, that significantly enhances the accuracy of the computation. The third new feature is the integration of the domain alignment and docking module for relaxation-based structure determination of multi-domain systems. Finally, to improve accessibility to all the program features, we introduced a graphical user interface that simplifies and speeds up the analysis of the data. Written in Java, the new ROTDIF can run on virtually any computer platform. In addition, the new ROTDIF achieves an order of magnitude speedup over the previous version by implementing a more efficient deterministic minimization algorithm. We not only demonstrate the improvement in accuracy and speed of the new algorithm for synthetic and experimental (13)C and (15)N relaxation data for several proteins and nucleic acids, but also show that careful analysis required especially for characterizing RNA dynamics allowed us to uncover subtle conformational changes in RNA as a function of temperature that were opaque to previous analysis.

An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE

NASA Technical Reports Server (NTRS)

Baysal, Oktay; Lessard, Victor R.

1990-01-01

The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.

Simulation of multistatic and backscattering cross sections for airborne radar

NASA Astrophysics Data System (ADS)

Biggs, Albert W.

1986-07-01

In order to determine susceptibilities of airborne radar to electronic countermeasures and electronic counter-countermeasures simulations of multistatic and backscattering cross sections were developed as digital modules in the form of algorithms. Cross section algorithms are described for prolate (cigar shape) and oblate (disk shape) spheroids. Backscattering cross section algorithms are also described for different categories of terrain. Backscattering cross section computer programs were written for terrain categorized as vegetation, sea ice, glacial ice, geological (rocks, sand, hills, etc.), oceans, man-made structures, and water bodies. PROGRAM SIGTERRA is a file for backscattering cross section modules of terrain (TERRA) such as vegetation (AGCROP), oceans (OCEAN), Arctic sea ice (SEAICE), glacial snow (GLASNO), geological structures (GEOL), man-made structures (MAMMAD), or water bodies (WATER). AGCROP describes agricultural crops, trees or forests, prairies or grassland, and shrubs or bush cover. OCEAN has the SLAR or SAR looking downwind, upwind, and crosswind at the ocean surface. SEAICE looks at winter ice and old or polar ice. GLASNO is divided into a glacial ice and snow or snowfields. MANMAD includes buildings, houses, roads, railroad tracks, airfields and hangars, telephone and power lines, barges, trucks, trains, and automobiles. WATER has lakes, rivers, canals, and swamps. PROGRAM SIGAIR is a similar file for airborne targets such as prolate and oblate spheroids.

Constrained-transport Magnetohydrodynamics with Adaptive Mesh Refinement in CHARM

NASA Astrophysics Data System (ADS)

Miniati, Francesco; Martin, Daniel F.

2011-07-01

We present the implementation of a three-dimensional, second-order accurate Godunov-type algorithm for magnetohydrodynamics (MHD) in the adaptive-mesh-refinement (AMR) cosmological code CHARM. The algorithm is based on the full 12-solve spatially unsplit corner-transport-upwind (CTU) scheme. The fluid quantities are cell-centered and are updated using the piecewise-parabolic method (PPM), while the magnetic field variables are face-centered and are evolved through application of the Stokes theorem on cell edges via a constrained-transport (CT) method. The so-called multidimensional MHD source terms required in the predictor step for high-order accuracy are applied in a simplified form which reduces their complexity in three dimensions without loss of accuracy or robustness. The algorithm is implemented on an AMR framework which requires specific synchronization steps across refinement levels. These include face-centered restriction and prolongation operations and a reflux-curl operation, which maintains a solenoidal magnetic field across refinement boundaries. The code is tested against a large suite of test problems, including convergence tests in smooth flows, shock-tube tests, classical two- and three-dimensional MHD tests, a three-dimensional shock-cloud interaction problem, and the formation of a cluster of galaxies in a fully cosmological context. The magnetic field divergence is shown to remain negligible throughout.

Exploring the Sandy Province of Herschel Crater

NASA Image and Video Library

2017-09-04

This view from NASA's Mars Reconnaissance Orbiter shows the downwind stretches of a sand sheet in central part of the much larger Herschel Crater. This sandy province began kilometers upwind in a string of barchan sand dunes. As the north-to-south blowing wind weakened downwind, it could no longer fashion the sand into dunes but rather into amorphously-shaped sand sheets. While perhaps not awe-inspiringly beautiful, sand sheets can tell us about Mars' current and past environmental conditions as a piece of the puzzle for understanding habitability. Having dunes upwind of sheets is the opposite situation Earth has, where upwind sand sheets evolve downwind into sand dunes. This mystery is receiving ongoing research to to understand these sandy differences between Earth and Mars. https://photojournal.jpl.nasa.gov/catalog/PIA21933

Some experiments on Yaw stability of wind turbines with various coning angles

NASA Technical Reports Server (NTRS)

Bundas, D.; Dugundji, J.

1981-01-01

A horizontal axis wind turbine was constructed to study the effect of coning angle on the yawing moments produced. Coning angles of 0 deg, +10 deg and -10 deg were studied in the upwind and downwind cases. Moment and rotational frequency of the blades at each yaw angle setting were taken. It was found that as the coning angle increased from -10 deg to +10 deg in either the upwind or downwind case the stability decreased. The downwind case was slightly more stable for all coning angles than was the upwind case. It is found that all the previous cases were stable for high rotation speeds, but at lower rotation speeds, they were all unstable and could not self start unless held in the wind.

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron; Biegel, Bran R. (Technical Monitor)

2002-01-01

We present high-order semi-discrete central-upwind numerical schemes for approximating solutions of multi-dimensional Hamilton-Jacobi (HJ) equations. This scheme is based on the use of fifth-order central interpolants like those developed in [1], in fluxes presented in [3]. These interpolants use the weighted essentially nonoscillatory (WENO) approach to avoid spurious oscillations near singularities, and become "central-upwind" in the semi-discrete limit. This scheme provides numerical approximations whose error is as much as an order of magnitude smaller than those in previous WENO-based fifth-order methods [2, 1]. Thee results are discussed via examples in one, two and three dimensions. We also pregnant explicit N-dimensional formulas for the fluxes, discuss their monotonicity and tl!e connection between this method and that in [2].

Obtaining sparse distributions in 2D inverse problems.

PubMed

Reci, A; Sederman, A J; Gladden, L F

2017-08-01

The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L 1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L 1 regularization to a class of inverse problems; relaxation-relaxation, T 1 -T 2 , and diffusion-relaxation, D-T 2 , correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L 1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L 1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L 1 regularization algorithm stably recovers a distribution at a signal to noise ratio<20 and that it resolves relaxation time constants and diffusion coefficients differing by as little as 10%. The enhanced resolving capability is used to measure the inter and intra particle concentrations of a mixture of hexane and dodecane present within porous silica beads immersed within a bulk liquid phase; neither NNLS nor Tikhonov regularization are able to provide this resolution. This experimental study shows that the approach enables discrimination between different chemical species when direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise. Copyright © 2017. Published by Elsevier Inc.

Obtaining sparse distributions in 2D inverse problems

NASA Astrophysics Data System (ADS)

Reci, A.; Sederman, A. J.; Gladden, L. F.

2017-08-01

The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L1 regularization to a class of inverse problems; relaxation-relaxation, T1-T2, and diffusion-relaxation, D-T2, correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L1 regularization algorithm stably recovers a distribution at a signal to noise ratio < 20 and that it resolves relaxation time constants and diffusion coefficients differing by as little as 10%. The enhanced resolving capability is used to measure the inter and intra particle concentrations of a mixture of hexane and dodecane present within porous silica beads immersed within a bulk liquid phase; neither NNLS nor Tikhonov regularization are able to provide this resolution. This experimental study shows that the approach enables discrimination between different chemical species when direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise.

C1-Continuous relative permeability and hybrid upwind discretization of three phase flow in porous media

NASA Astrophysics Data System (ADS)

Lee, S. H.; Efendiev, Y.

2016-10-01

Three-phase flow in a reservoir model has been a major challenge in simulation studies due to slowly convergent iterations in Newton solution of nonlinear transport equations. In this paper, we examine the numerical characteristics of three-phase flow and propose a consistent, "C1-continuous discretization" (to be clarified later) of transport equations that ensures a convergent solution in finite difference approximation. First, we examine three-phase relative permeabilities that are critical in solving nonlinear transport equations. Three-phase relative permeabilities are difficult to measure in the laboratory, and they are often correlated with two-phase relative permeabilities (e.g., oil-gas and water-oil systems). Numerical convergence of non-linear transport equations entails that three-phase relative permeability correlations are a monotonically increasing function of the phase saturation and the consistency conditions of phase transitions are satisfied. The Modified Stone's Method II and the Linear Interpolation Method for three-phase relative permeability are closely examined for their mathematical properties. We show that the Linear Interpolation Method yields C1-continuous three-phase relative permeabilities for smooth solutions if the two phase relative permeabilities are monotonic and continuously differentiable. In the second part of the paper, we extend a Hybrid-Upwinding (HU) method of two-phase flow (Lee, Efendiev and Tchelepi, ADWR 82 (2015) 27-38) to three phase flow. In the HU method, the phase flux is divided into two parts based on the driving forces (in general, it can be divided into several parts): viscous and buoyancy. The viscous-driven and buoyancy-driven fluxes are upwinded differently. Specifically, the viscous flux, which is always co-current, is upwinded based on the direction of the total velocity. The pure buoyancy-induced flux is shown to be only dependent on saturation distributions and counter-current. In three-phase flow, the buoyancy effect can be expressed as a sum of two buoyancy effects from two-phase flows, i.e., oil-water and oil-gas systems. We propose an upwind scheme for the buoyancy flux term from three-phase flow as a sum of two buoyancy terms from two-phase flows. The upwind direction of the buoyancy flux in two phase flow is always fixed such that the heavier fluid goes downward and the lighter fluid goes upward. It is shown that the Implicit Hybrid-Upwinding (IHU) scheme for three-phase flow is locally conservative and produces physically-consistent numerical solutions. As in two phase flow, the primary advantage of the IHU scheme is that the flux of a fluid phase remains continuous and differentiable as the flow regime changes between co-current and counter-current conditions as a function of time, or (Newton) iterations. This is in contrast to the standard phase-potential-based upwinding scheme, in which the overall fractional-flow (flux) function is non-differentiable across the transition between co-current and counter-current flows.

A numerical study of hypersonic stagnation heat transfer predictions at a coordinate singularity

NASA Technical Reports Server (NTRS)

Grasso, Francesco; Gnoffo, Peter A.

1990-01-01

The problem of grid induced errors associated with a coordinate singularity on heating predictions in the stagnation region of a three-dimensional body in hypersonic flow is examined. The test problem is for Mach 10 flow over an Aeroassist Flight Experiment configuration. This configuration is composed of an elliptic nose, a raked elliptic cone, and a circular shoulder. Irregularities in the heating predictions in the vicinity of the coordinate singularity, located at the axis of the elliptic nose near the stagnation point, are examined with respect to grid refinement and grid restructuring. The algorithm is derived using a finite-volume formulation. An upwind-biased total-variation diminishing scheme is employed for the inviscid flux contribution, and central differences are used for the viscous terms.

Transonic Navier-Stokes solutions of three-dimensional afterbody flows

NASA Technical Reports Server (NTRS)

Compton, William B., III; Thomas, James L.; Abeyounis, William K.; Mason, Mary L.

1989-01-01

The performance of a three-dimensional Navier-Stokes solution technique in predicting the transonic flow past a nonaxisymmetric nozzle was investigated. The investigation was conducted at free-stream Mach numbers ranging from 0.60 to 0.94 and an angle of attack of 0 degrees. The numerical solution procedure employs the three-dimensional, unsteady, Reynolds-averaged Navier-Stokes equations written in strong conservation form, a thin layer assumption, and the Baldwin-Lomax turbulence model. The equations are solved by using the finite-volume principle in conjunction with an approximately factored upwind-biased numerical algorithm. In the numerical procedure, the jet exhaust is represented by a solid sting. Wind-tunnel data with the jet exhaust simulated by high pressure air were also obtained to compare with the numerical calculations.

Comments regarding two upwind methods for solving two-dimensional external flows using unstructured grids

NASA Technical Reports Server (NTRS)

Kleb, W. L.

1994-01-01

Steady flow over the leading portion of a multicomponent airfoil section is studied using computational fluid dynamics (CFD) employing an unstructured grid. To simplify the problem, only the inviscid terms are retained from the Reynolds-averaged Navier-Stokes equations - leaving the Euler equations. The algorithm is derived using the finite-volume approach, incorporating explicit time-marching of the unsteady Euler equations to a time-asymptotic, steady-state solution. The inviscid fluxes are obtained through either of two approximate Riemann solvers: Roe's flux difference splitting or van Leer's flux vector splitting. Results are presented which contrast the solutions given by the two flux functions as a function of Mach number and grid resolution. Additional information is presented concerning code verification techniques, flow recirculation regions, convergence histories, and computational resources.

Arm retraction dynamics of entangled star polymers: A forward flux sampling method study

NASA Astrophysics Data System (ADS)

Zhu, Jian; Likhtman, Alexei E.; Wang, Zuowei

2017-07-01

The study of dynamics and rheology of well-entangled branched polymers remains a challenge for computer simulations due to the exponentially growing terminal relaxation times of these polymers with increasing molecular weights. We present an efficient simulation algorithm for studying the arm retraction dynamics of entangled star polymers by combining the coarse-grained slip-spring (SS) model with the forward flux sampling (FFS) method. This algorithm is first applied to simulate symmetric star polymers in the absence of constraint release (CR). The reaction coordinate for the FFS method is determined by finding good agreement of the simulation results on the terminal relaxation times of mildly entangled stars with those obtained from direct shooting SS model simulations with the relative difference between them less than 5%. The FFS simulations are then carried out for strongly entangled stars with arm lengths up to 16 entanglements that are far beyond the accessibility of brute force simulations in the non-CR condition. Apart from the terminal relaxation times, the same method can also be applied to generate the relaxation spectra of all entanglements along the arms which are desired for the development of quantitative theories of entangled branched polymers. Furthermore, we propose a numerical route to construct the experimentally measurable relaxation correlation functions by effectively linking the data stored at each interface during the FFS runs. The obtained star arm end-to-end vector relaxation functions Φ (t ) and the stress relaxation function G(t) are found to be in reasonably good agreement with standard SS simulation results in the terminal regime. Finally, we demonstrate that this simulation method can be conveniently extended to study the arm-retraction problem in entangled star polymer melts with CR by modifying the definition of the reaction coordinate, while the computational efficiency will depend on the particular slip-spring or slip-link model employed.

MHD Turbulence, div B = 0 and Lattice Boltzmann Simulations

NASA Astrophysics Data System (ADS)

Phillips, Nate; Keating, Brian; Vahala, George; Vahala, Linda

2006-10-01

The question of div B = 0 in MHD simulations is a crucial issue. Here we consider lattice Boltzmann simulations for MHD (LB-MHD). One introduces a scalar distribution function for the velocity field and a vector distribution function for the magnetic field. This asymmetry is due to the different symmetries in the tensors arising in the time evolution of these fields. The simple algorithm of streaming and local collisional relaxation is ideally parallelized and vectorized -- leading to the best sustained performance/PE of any code run on the Earth Simulator. By reformulating the BGK collision term, a simple implicit algorithm can be immediately transformed into an explicit algorithm that permits simulations at quite low viscosity and resistivity. However the div B is not an imposed constraint. Currently we are examining a new formulations of LB-MHD that impose the div B constraint -- either through an entropic like formulation or by introducing forcing terms into the momentum equations and permitting simpler forms of relaxation distributions.

Fast graph-based relaxed clustering for large data sets using minimal enclosing ball.

PubMed

Qian, Pengjiang; Chung, Fu-Lai; Wang, Shitong; Deng, Zhaohong

2012-06-01

Although graph-based relaxed clustering (GRC) is one of the spectral clustering algorithms with straightforwardness and self-adaptability, it is sensitive to the parameters of the adopted similarity measure and also has high time complexity O(N(3)) which severely weakens its usefulness for large data sets. In order to overcome these shortcomings, after introducing certain constraints for GRC, an enhanced version of GRC [constrained GRC (CGRC)] is proposed to increase the robustness of GRC to the parameters of the adopted similarity measure, and accordingly, a novel algorithm called fast GRC (FGRC) based on CGRC is developed in this paper by using the core-set-based minimal enclosing ball approximation. A distinctive advantage of FGRC is that its asymptotic time complexity is linear with the data set size N. At the same time, FGRC also inherits the straightforwardness and self-adaptability from GRC, making the proposed FGRC a fast and effective clustering algorithm for large data sets. The advantages of FGRC are validated by various benchmarking and real data sets.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

NASA Technical Reports Server (NTRS)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

The role of streamline curvature in sand dune dynamics: evidence from field and wind tunnel measurements

NASA Astrophysics Data System (ADS)

Wiggs, Giles F. S.; Livingstone, Ian; Warren, Andrew

1996-09-01

Field measurements on an unvegetated, 10 m high barchan dune in Oman are compared with measurements over a 1:200 scale fixed model in a wind tunnel. Both the field and wind tunnel data demonstrate similar patterns of wind and shear velocity over the dune, confirming significant flow deceleration upwind of and at the toe of the dune, acceleration of flow up the windward slope, and deceleration between the crest and brink. This pattern, including the widely reported upwind reduction in shear velocity, reflects observations of previous studies. Such a reduction in shear velocity upwind of the dune should result in a reduction in sand transport and subsequent sand deposition. This is not observed in the field. Wind tunnel modelling using a near-surface pulse-wire probe suggests that the field method of shear velocity derivation is inadequate. The wind tunnel results exhibit no reduction in shear velocity upwind of or at the toe of the dune. Evidence provided by Reynolds stress profiles and turbulence intensities measured in the wind tunnel suggest that this maintenance of upwind shear stress may be a result of concave (unstable) streamline curvature. These additional surface stresses are not recorded by the techniques used in the field measurements. Using the occurrence of streamline curvature as a starting point, a new 2-D model of dune dynamics is deduced. This model relies on the establishment of an equilibrium between windward slope morphology, surface stresses induced by streamline curvature, and streamwise acceleration. Adopting the criteria that concave streamline curvature and streamwise acceleration both increase surface shear stress, whereas convex streamline curvature and deceleration have the opposite effect, the relationships between form and process are investigated in each of three morphologically distinct zones: the upwind interdune and concave toe region of the dune, the convex portion of the windward slope, and the crest-brink region. The applicability of the model is supported by measurements of the rate of sand transport and the change of the dune surface in the field.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

An improved pulse sequence and inversion algorithm of T2 spectrum

NASA Astrophysics Data System (ADS)

Ge, Xinmin; Chen, Hua; Fan, Yiren; Liu, Juntao; Cai, Jianchao; Liu, Jianyu

2017-03-01

The nuclear magnetic resonance transversal relaxation time is widely applied in geological prospecting, both in laboratory and downhole environments. However, current methods used for data acquisition and inversion should be reformed to characterize geological samples with complicated relaxation components and pore size distributions, such as samples of tight oil, gas shale, and carbonate. We present an improved pulse sequence to collect transversal relaxation signals based on the CPMG (Carr, Purcell, Meiboom, and Gill) pulse sequence. The echo spacing is not constant but varies in different windows, depending on prior knowledge or customer requirements. We use the entropy based truncated singular value decomposition (TSVD) to compress the ill-posed matrix and discard small singular values which cause the inversion instability. A hybrid algorithm combining the iterative TSVD and a simultaneous iterative reconstruction technique is implemented to reach the global convergence and stability of the inversion. Numerical simulations indicate that the improved pulse sequence leads to the same result as CPMG, but with lower echo numbers and computational time. The proposed method is a promising technique for geophysical prospecting and other related fields in future.

Nonlinear relaxation algorithms for circuit simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saleh, R.A.

Circuit simulation is an important Computer-Aided Design (CAD) tool in the design of Integrated Circuits (IC). However, the standard techniques used in programs such as SPICE result in very long computer-run times when applied to large problems. In order to reduce the overall run time, a number of new approaches to circuit simulation were developed and are described. These methods are based on nonlinear relaxation techniques and exploit the relative inactivity of large circuits. Simple waveform-processing techniques are described to determine the maximum possible speed improvement that can be obtained by exploiting this property of large circuits. Three simulation algorithmsmore » are described, two of which are based on the Iterated Timing Analysis (ITA) method and a third based on the Waveform-Relaxation Newton (WRN) method. New programs that incorporate these techniques were developed and used to simulate a variety of industrial circuits. The results from these simulations are provided. The techniques are shown to be much faster than the standard approach. In addition, a number of parallel aspects of these algorithms are described, and a general space-time model of parallel-task scheduling is developed.« less

Multiphysics modeling of non-linear laser-matter interactions for optically active semiconductors

NASA Astrophysics Data System (ADS)

Kraczek, Brent; Kanp, Jaroslaw

Development of photonic devices for sensors and communications devices has been significantly enhanced by computational modeling. We present a new computational method for modelling laser propagation in optically-active semiconductors within the paraxial wave approximation (PWA). Light propagation is modeled using the Streamline-upwind/Petrov-Galerkin finite element method (FEM). Material response enters through the non-linear polarization, which serves as the right-hand side of the FEM calculation. Maxwell's equations for classical light propagation within the PWA can be written solely in terms of the electric field, producing a wave equation that is a form of the advection-diffusion-reaction equations (ADREs). This allows adaptation of the computational machinery developed for solving ADREs in fluid dynamics to light-propagation modeling. The non-linear polarization is incorporated using a flexible framework to enable the use of multiple methods for carrier-carrier interactions (e.g. relaxation-time-based or Monte Carlo) to enter through the non-linear polarization, as appropriate to the material type. We demonstrate using a simple carrier-carrier model approximating the response of GaN. Supported by ARL Materials Enterprise.

Hybrid Upwind Splitting (HUS) by a Field-by-Field Decomposition

NASA Technical Reports Server (NTRS)

Coquel, Frederic; Liou, Meng-Sing

1995-01-01

We introduce and develop a new approach for upwind biasing: the hybrid upwind splitting (HUS) method. This original procedure is based on a suitable hybridization of current prominent flux vector splitting (FVS) and flux difference splitting (FDS) methods. The HUS method is designed to naturally combine the respective strengths of the above methods while excluding their main deficiencies. Specifically, the HUS strategy yields a family of upwind methods that exhibit the robustness of FVS schemes in the capture of nonlinear waves and the accuracy of some FDS schemes in the resolution of linear waves. We give a detailed construction of the HUS methods following a general and systematic procedure directly performed at the basic level of the field by field (i.e. waves) decomposition involved in FDS methods. For such a given decomposition, each field is endowed either with FVS or FDS numerical fluxes, depending on the nonlinear nature of the field under consideration. Such a design principle is made possible thanks to the introduction of a convenient formalism that provides us with a unified framework for upwind methods. The HUS methods we propose bring significant improvements over current methods in terms of accuracy and robustness. They yield entropy-satisfying approximate solutions as they are strongly supported in numerical experiments. Field by field hybrid numerical fluxes also achieve fairly simple and explicit expressions and hence require a computational effort between that of the FVS and FDS. Several numerical experiments ranging from stiff 1D shock-tube to high speed viscous flows problems are displayed, intending to illustrate the benefits of the present approach. We assess in particular the relevance of our HUS schemes to viscous flow calculations.

Multiple quay cranes scheduling for double cycling in container terminals

PubMed Central

Chu, Yanling; Zhang, Xiaoju; Yang, Zhongzhen

2017-01-01

Double cycling is an efficient tool to increase the efficiency of quay crane (QC) in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high. PMID:28692699

Multiple quay cranes scheduling for double cycling in container terminals.

PubMed

Chu, Yanling; Zhang, Xiaoju; Yang, Zhongzhen

2017-01-01

Double cycling is an efficient tool to increase the efficiency of quay crane (QC) in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high.

Solution of elliptic partial differential equations by fast Poisson solvers using a local relaxation factor. 1: One-step method

NASA Technical Reports Server (NTRS)

Chang, S. C.

1986-01-01

An algorithm for solving a large class of two- and three-dimensional nonseparable elliptic partial differential equations (PDE's) is developed and tested. It uses a modified D'Yakanov-Gunn iterative procedure in which the relaxation factor is grid-point dependent. It is easy to implement and applicable to a variety of boundary conditions. It is also computationally efficient, as indicated by the results of numerical comparisons with other established methods. Furthermore, the current algorithm has the advantage of possessing two important properties which the traditional iterative methods lack; that is: (1) the convergence rate is relatively insensitive to grid-cell size and aspect ratio, and (2) the convergence rate can be easily estimated by using the coefficient of the PDE being solved.

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron; Biegel, Bryan (Technical Monitor)

2002-01-01

We present the first fifth order, semi-discrete central upwind method for approximating solutions of multi-dimensional Hamilton-Jacobi equations. Unlike most of the commonly used high order upwind schemes, our scheme is formulated as a Godunov-type scheme. The scheme is based on the fluxes of Kurganov-Tadmor and Kurganov-Tadmor-Petrova, and is derived for an arbitrary number of space dimensions. A theorem establishing the monotonicity of these fluxes is provided. The spacial discretization is based on a weighted essentially non-oscillatory reconstruction of the derivative. The accuracy and stability properties of our scheme are demonstrated in a variety of examples. A comparison between our method and other fifth-order schemes for Hamilton-Jacobi equations shows that our method exhibits smaller errors without any increase in the complexity of the computations.

On the Total Variation of High-Order Semi-Discrete Central Schemes for Conservation Laws

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron

2004-01-01

We discuss a new fifth-order, semi-discrete, central-upwind scheme for solving one-dimensional systems of conservation laws. This scheme combines a fifth-order WENO reconstruction, a semi-discrete central-upwind numerical flux, and a strong stability preserving Runge-Kutta method. We test our method with various examples, and give particular attention to the evolution of the total variation of the approximations.

Compressed Semi-Discrete Central-Upwind Schemes for Hamilton-Jacobi Equations

NASA Technical Reports Server (NTRS)

Bryson, Steve; Kurganov, Alexander; Levy, Doron; Petrova, Guergana

2003-01-01

We introduce a new family of Godunov-type semi-discrete central schemes for multidimensional Hamilton-Jacobi equations. These schemes are a less dissipative generalization of the central-upwind schemes that have been recently proposed in series of works. We provide the details of the new family of methods in one, two, and three space dimensions, and then verify their expected low-dissipative property in a variety of examples.

A Numerical Analysis of Smoothed Particle Hydrodynamics

DTIC Science & Technology

1994-09-01

for the q terms: 1 N_ V).- Ernj(v.- iv)(X Ps4 -=0 N J) 03 R’, 1 - , P- El)( (4.54) Substitute equation (4.54) in equation (4.53) for q, then update the...p=, L ,(p,ý)2 (pn)2) Xn’+1 n + tVX (7.55) 7-17 7.4.2 Upwind. The second lower order scheme considered is motivated by upwind finite difference

Activation, orientation and landing of female Culex quinquefasciatus in response to carbon dioxide and odour from human feet: 3-D flight analysis in a wind tunnel.

PubMed

Lacey, E S; Cardé, R T

2011-03-01

This study investigated the interaction between carbon dioxide (CO(2) ) and human foot odour on activation, upwind orientation and landing of host-seeking female Culex quinquefasciatus (Say) (Diptera: Culicidae) in a wind tunnel. More mosquitoes landed on warmed glass beads coated with foot odour than on clean beads; adding a plume of 4% CO(2) did not influence the proportion of mosquitoes landing. A second experiment used 3-dimensional video tracking to assess flight performance. Activation was more rapid with CO(2) and with CO(2) + foot odour than with clean air or with foot odour alone. Upwind flights were fastest with CO(2) and with clean air, and slowest with foot odour; the CO(2) + foot odour treatment overlapped the previous three treatments in significance. Flight headings tended more towards due upwind with CO(2) and with clean air than with CO(2) + foot odour or with foot odour alone. In both experiments, many mosquitoes flew upwind in clean air. There was little evidence of females changing course upon entering or exiting the CO(2) plume or reacting to foot odour during flight. © 2010 The Authors. Medical and Veterinary Entomology © 2010 The Royal Entomological Society.

Relaxation dynamics of internal segments of DNA chains in nanochannels

NASA Astrophysics Data System (ADS)

Jain, Aashish; Muralidhar, Abhiram; Dorfman, Kevin; Dorfman Group Team

We will present relaxation dynamics of internal segments of a DNA chain confined in nanochannel. The results have direct application in genome mapping technology, where long DNA molecules containing sequence-specific fluorescent probes are passed through an array of nanochannels to linearize them, and then the distances between these probes (the so-called ``DNA barcode'') are measured. The relaxation dynamics of internal segments set the experimental error due to dynamic fluctuations. We developed a multi-scale simulation algorithm, combining a Pruned-Enriched Rosenbluth Method (PERM) simulation of a discrete wormlike chain model with hard spheres with Brownian dynamics (BD) simulations of a bead-spring chain. Realistic parameters such as the bead friction coefficient and spring force law parameters are obtained from PERM simulations and then mapped onto the bead-spring model. The BD simulations are carried out to obtain the extension autocorrelation functions of various segments, which furnish their relaxation times. Interestingly, we find that (i) corner segments relax faster than the center segments and (ii) relaxation times of corner segments do not depend on the contour length of DNA chain, whereas the relaxation times of center segments increase linearly with DNA chain size.

Reactive Searching and Infotaxis in Odor Source Localization

PubMed Central

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-01-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching. PMID:25330317

Reactive searching and infotaxis in odor source localization.

PubMed

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-10-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching.

Ion flux through membrane channels--an enhanced algorithm for the Poisson-Nernst-Planck model.

PubMed

Dyrka, Witold; Augousti, Andy T; Kotulska, Malgorzata

2008-09-01

A novel algorithmic scheme for numerical solution of the 3D Poisson-Nernst-Planck model is proposed. The algorithmic improvements are universal and independent of the detailed physical model. They include three major steps: an adjustable gradient-based step value, an adjustable relaxation coefficient, and an optimized segmentation of the modeled space. The enhanced algorithm significantly accelerates the speed of computation and reduces the computational demands. The theoretical model was tested on a regular artificial channel and validated on a real protein channel-alpha-hemolysin, proving its efficiency. (c) 2008 Wiley Periodicals, Inc.

Segmentation of magnetic resonance images using fuzzy algorithms for learning vector quantization.

PubMed

Karayiannis, N B; Pai, P I

1999-02-01

This paper evaluates a segmentation technique for magnetic resonance (MR) images of the brain based on fuzzy algorithms for learning vector quantization (FALVQ). These algorithms perform vector quantization by updating all prototypes of a competitive network through an unsupervised learning process. Segmentation of MR images is formulated as an unsupervised vector quantization process, where the local values of different relaxation parameters form the feature vectors which are represented by a relatively small set of prototypes. The experiments evaluate a variety of FALVQ algorithms in terms of their ability to identify different tissues and discriminate between normal tissues and abnormalities.

Diastolic chamber properties of the left ventricle assessed by global fitting of pressure-volume data: improving the gold standard of diastolic function.

PubMed

Bermejo, Javier; Yotti, Raquel; Pérez del Villar, Candelas; del Álamo, Juan C; Rodríguez-Pérez, Daniel; Martínez-Legazpi, Pablo; Benito, Yolanda; Antoranz, J Carlos; Desco, M Mar; González-Mansilla, Ana; Barrio, Alicia; Elízaga, Jaime; Fernández-Avilés, Francisco

2013-08-15

In cardiovascular research, relaxation and stiffness are calculated from pressure-volume (PV) curves by separately fitting the data during the isovolumic and end-diastolic phases (end-diastolic PV relationship), respectively. This method is limited because it assumes uncoupled active and passive properties during these phases, it penalizes statistical power, and it cannot account for elastic restoring forces. We aimed to improve this analysis by implementing a method based on global optimization of all PV diastolic data. In 1,000 Monte Carlo experiments, the optimization algorithm recovered entered parameters of diastolic properties below and above the equilibrium volume (intraclass correlation coefficients = 0.99). Inotropic modulation experiments in 26 pigs modified passive pressure generated by restoring forces due to changes in the operative and/or equilibrium volumes. Volume overload and coronary microembolization caused incomplete relaxation at end diastole (active pressure > 0.5 mmHg), rendering the end-diastolic PV relationship method ill-posed. In 28 patients undergoing PV cardiac catheterization, the new algorithm reduced the confidence intervals of stiffness parameters by one-fifth. The Jacobian matrix allowed visualizing the contribution of each property to instantaneous diastolic pressure on a per-patient basis. The algorithm allowed estimating stiffness from single-beat PV data (derivative of left ventricular pressure with respect to volume at end-diastolic volume intraclass correlation coefficient = 0.65, error = 0.07 ± 0.24 mmHg/ml). Thus, in clinical and preclinical research, global optimization algorithms provide the most complete, accurate, and reproducible assessment of global left ventricular diastolic chamber properties from PV data. Using global optimization, we were able to fully uncouple relaxation and passive PV curves for the first time in the intact heart.

Effective temperature in relaxation of Coulomb glasses.

PubMed

Somoza, A M; Ortuño, M; Caravaca, M; Pollak, M

2008-08-01

We study relaxation in two-dimensional Coulomb glasses up to macroscopic times. We use a kinetic Monte Carlo algorithm especially designed to escape efficiently from deep valleys around metastable states. We find that, during the relaxation process, the site occupancy follows a Fermi-Dirac distribution with an effective temperature much higher than the real temperature T. Long electron-hole excitations are characterized by T(eff), while short ones are thermalized at T. We argue that the density of states at the Fermi level is proportional to T(eff) and is a good thermometer to measure it. T(eff) decreases extremely slowly, roughly as the inverse of the logarithm of time, and it should affect hopping conductance in many experimental circumstances.

Development of Novel Instrumentation to Characterize Aerosol Insets and Cloud Particles

DTIC Science & Technology

2007-07-01

Wks Ic 1O m~s upwind of .03w a3~ I~ "We"~ 2D-C & -w4 km .1amg~hu upwind of CPI- =108 swa 4.0 *let k.03.8 km -"PO~m Distibuton -s. Mall MEM Mean~~ Snz...1226,1999. Goldfarb, L., Keckhut, P., Chanin, M.-L., and References Hauchecome, A.: Cirrus climatological results from lidar measurements at OHP (44_ N

A simple tandem disk model for a cross-wind machine

NASA Astrophysics Data System (ADS)

Healey, J. V.

The relative power coefficients, area expansion ratio, and crosswind forces for a crosswind tubine, e.g., the Darrieus, were examined with a tandem-disk, single-streamtube model. The upwind disk is assumed to be rectangular and the downwind disk is modeled as filling the wake of the upwind disk. Velocity and force triangles are devised for the factors operating at each blade. Attention was given to the NACA 0012 and 0018, and Go 735 and 420 airfoils as blades, with Reynolds number just under 500,000. The 0018 was found to be the best airfoil, followed by the 0012, the 735, and, very far behind in terms of the power coefficient, the 420. The forces on the two disks were calculated to be equal at low tip speed ratios with symmetrical airfoil, while the Go cambered profiles yielded negative values upwind in the same conditions.

A study of upwind schemes on the laminar hypersonic heating predictions for the reusable space vehicle

NASA Astrophysics Data System (ADS)

Qu, Feng; Sun, Di; Zuo, Guang

2018-06-01

With the rapid development of the Computational Fluid Dynamics (CFD), Accurate computing hypersonic heating is in a high demand for the design of the new generation reusable space vehicle to conduct deep space exploration. In the past years, most researchers try to solve this problem by concentrating on the choice of the upwind schemes or the definition of the cell Reynolds number. However, the cell Reynolds number dependencies and limiter dependencies of the upwind schemes, which are of great importance to their performances in hypersonic heating computations, are concerned by few people. In this paper, we conduct a systematic study on these properties respectively. Results in our test cases show that SLAU (Simple Low-dissipation AUSM-family) is with a much higher level of accuracy and robustness in hypersonic heating predictions. Also, it performs much better in terms of the limiter dependency and the cell Reynolds number dependency.

Investigation of upwind, multigrid, multiblock numerical schemes for three dimensional flows. Volume 1: Runge-Kutta methods for a thin layer Navier-Stokes solver

NASA Technical Reports Server (NTRS)

Cannizzaro, Frank E.; Ash, Robert L.

1992-01-01

A state-of-the-art computer code has been developed that incorporates a modified Runge-Kutta time integration scheme, upwind numerical techniques, multigrid acceleration, and multi-block capabilities (RUMM). A three-dimensional thin-layer formulation of the Navier-Stokes equations is employed. For turbulent flow cases, the Baldwin-Lomax algebraic turbulence model is used. Two different upwind techniques are available: van Leer's flux-vector splitting and Roe's flux-difference splitting. Full approximation multi-grid plus implicit residual and corrector smoothing were implemented to enhance the rate of convergence. Multi-block capabilities were developed to provide geometric flexibility. This feature allows the developed computer code to accommodate any grid topology or grid configuration with multiple topologies. The results shown in this dissertation were chosen to validate the computer code and display its geometric flexibility, which is provided by the multi-block structure.

Second- and third-order upwind difference schemes for hyperbolic conservation laws

NASA Technical Reports Server (NTRS)

Yang, J. Y.

1984-01-01

Second- and third-order two time-level five-point explicit upwind-difference schemes are described for the numerical solution of hyperbolic systems of conservation laws and applied to the Euler equations of inviscid gas dynamics. Nonliner smoothing techniques are used to make the schemes total variation diminishing. In the method both hyperbolicity and conservation properties of the hyperbolic conservation laws are combined in a very natural way by introducing a normalized Jacobian matrix of the hyperbolic system. Entropy satisfying shock transition operators which are consistent with the upwind differencing are locally introduced when transonic shock transition is detected. Schemes thus constructed are suitable for shockcapturing calculations. The stability and the global order of accuracy of the proposed schemes are examined. Numerical experiments for the inviscid Burgers equation and the compressible Euler equations in one and two space dimensions involving various situations of aerodynamic interest are included and compared.

A comparative study of upwind and MacCormack schemes for CAA benchmark problems

NASA Technical Reports Server (NTRS)

Viswanathan, K.; Sankar, L. N.

1995-01-01

In this study, upwind schemes and MacCormack schemes are evaluated as to their suitability for aeroacoustic applications. The governing equations are cast in a curvilinear coordinate system and discretized using finite volume concepts. A flux splitting procedure is used for the upwind schemes, where the signals crossing the cell faces are grouped into two categories: signals that bring information from outside into the cell, and signals that leave the cell. These signals may be computed in several ways, with the desired spatial and temporal accuracy achieved by choosing appropriate interpolating polynomials. The classical MacCormack schemes employed here are fourth order accurate in time and space. Results for categories 1, 4, and 6 of the workshop's benchmark problems are presented. Comparisons are also made with the exact solutions, where available. The main conclusions of this study are finally presented.

Well-balanced schemes for the Euler equations with gravitation: Conservative formulation using global fluxes

NASA Astrophysics Data System (ADS)

Chertock, Alina; Cui, Shumo; Kurganov, Alexander; Özcan, Şeyma Nur; Tadmor, Eitan

2018-04-01

We develop a second-order well-balanced central-upwind scheme for the compressible Euler equations with gravitational source term. Here, we advocate a new paradigm based on a purely conservative reformulation of the equations using global fluxes. The proposed scheme is capable of exactly preserving steady-state solutions expressed in terms of a nonlocal equilibrium variable. A crucial step in the construction of the second-order scheme is a well-balanced piecewise linear reconstruction of equilibrium variables combined with a well-balanced central-upwind evolution in time, which is adapted to reduce the amount of numerical viscosity when the flow is at (near) steady-state regime. We show the performance of our newly developed central-upwind scheme and demonstrate importance of perfect balance between the fluxes and gravitational forces in a series of one- and two-dimensional examples.

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

NASA Technical Reports Server (NTRS)

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

1994-01-01

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

Application of a flux-split algorithm to chemically relaxing, hypervelocity blunt-body flows

NASA Technical Reports Server (NTRS)

Balakrishnan, A.

1987-01-01

Viscous, nonequilibrium, hypervelocity flow fields over two axisymmetric configurations are numerically simulated using a factored, implicit, flux-split algorithm. The governing gas-dynamic and species-continuity equations for laminar flow are presented. The gas-dynamics/nonequilibrium-chemistry coupling procedure is developed as part of the solution procedure and is described in detail. Numerical solutions are presented for hypervelocity flows over a hemisphere and over an axisymmetric aeroassisted orbital transfer vehicle using three different chemistry models. The gas models considered are those for an ideal gas, for a frozen gas, and for chemically relaxing air consisting of five species. The calculated results are compared with existing numerical solutions in the literature along the stagnation line of the hemisphere. The effects of free-stream Reynolds number on the nonequilibrium flow field are discussed.

Separation analysis, a tool for analyzing multigrid algorithms

NASA Technical Reports Server (NTRS)

Costiner, Sorin; Taasan, Shlomo

1995-01-01

The separation of vectors by multigrid (MG) algorithms is applied to the study of convergence and to the prediction of the performance of MG algorithms. The separation operator for a two level cycle algorithm is derived. It is used to analyze the efficiency of the cycle when mixing of eigenvectors occurs. In particular cases the separation analysis reduces to Fourier type analysis. The separation operator of a two level cycle for a Schridubger eigenvalue problem, is derived and analyzed in a Fourier basis. Separation analysis gives information on how to choose performance relaxations and inter-level transfers. Separation analysis is a tool for analyzing and designing algorithms, and for optimizing their performance.

Adaptive optics retinal imaging with automatic detection of the pupil and its boundary in real time using Shack-Hartmann images.

PubMed

de Castro, Alberto; Sawides, Lucie; Qi, Xiaofeng; Burns, Stephen A

2017-08-20

Retinal imaging with an adaptive optics (AO) system usually requires that the eye be centered and stable relative to the exit pupil of the system. Aberrations are then typically corrected inside a fixed circular pupil. This approach can be restrictive when imaging some subjects, since the pupil may not be round and maintaining a stable head position can be difficult. In this paper, we present an automatic algorithm that relaxes these constraints. An image quality metric is computed for each spot of the Shack-Hartmann image to detect the pupil and its boundary, and the control algorithm is applied only to regions within the subject's pupil. Images on a model eye as well as for five subjects were obtained to show that a system exit pupil larger than the subject's eye pupil could be used for AO retinal imaging without a reduction in image quality. This algorithm automates the task of selecting pupil size. It also may relax constraints on centering the subject's pupil and on the shape of the pupil.

Deriving Quantitative Dynamics Information for Proteins and RNAs using ROTDIF with a Graphical User Interface

PubMed Central

Berlin, Konstantin; Longhini, Andrew; Dayie, T. Kwaku; Fushman, David

2013-01-01

To facilitate rigorous analysis of molecular motions in proteins, DNA, and RNA, we present a new version of ROTDIF, a program for determining the overall rotational diffusion tensor from single-or multiple-field Nuclear Magnetic Resonance (NMR) relaxation data. We introduce four major features that expand the program’s versatility and usability. The first feature is the ability to analyze, separately or together, 13C and/or 15N relaxation data collected at a single or multiple fields. A significant improvement in the accuracy compared to direct analysis of R2/R1 ratios, especially critical for analysis of 13C relaxation data, is achieved by subtracting high-frequency contributions to relaxation rates. The second new feature is an improved method for computing the rotational diffusion tensor in the presence of biased errors, such as large conformational exchange contributions, that significantly enhances the accuracy of the computation. The third new feature is the integration of the domain alignment and docking module for relaxation-based structure determination of multi-domain systems. Finally, to improve accessibility to all the program features, we introduced a graphical user interface (GUI) that simplifies and speeds up the analysis of the data. Written in Java, the new ROTDIF can run on virtually any computer platform. In addition, the new ROTDIF achieves an order of magnitude speedup over the previous version by implementing a more efficient deterministic minimization algorithm. We not only demonstrate the improvement in accuracy and speed of the new algorithm for synthetic and experimental 13C and 15N relaxation data for several proteins and nucleic acids, but also show that careful analysis required especially for characterizing RNA dynamics allowed us to uncover subtle conformational changes in RNA as a function of temperature that were opaque to previous analysis. PMID:24170368

Ocean backscatter across the Gulf Stream sea surface temperature front

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nghiem, S.V.; Li, F.K.

1997-06-01

Ocean backscatter was measured by the Jet Propulsion Laboratory, with the airborne NUSCAT K{sub u}-band scatterometer, across the Gulf Stream sea surface temperature front during the Surface Wave Dynamics Experiment off the coast of Virginia and Maryland in the winter of 1991. Backscatter across the front between the National Oceanic and Atmospheric Administration experimental coastal buoy A (44024) on the cold side and Discus C buoy (44023) on the warm side shows a difference of more than 5 dB for vertical polarization in many cases. This large frontal backscatter change is observed in all upwind, downwind, and crosswind directions. Themore » sea surface temperature difference measured by the buoys was about 9{degrees}C. The corresponding difference in wind speed cannot account for the large backscatter change in view of geophysical model functions depending only on neutral wind velocity such as SASS. The measured backscatter also has larger upwind-downwind and upwind-crosswind ratios compared to the model results. Furthermore, NUSCAT data reveal that upwind backscatter on the cold side was smaller than or close to crosswind backscatter on the warm side for incidence angles between 30{degrees} to 50{degrees}. This suggests that the temperature front can be detected by the scatterometer at these incidence angles for different wind directions in the cold and warm sides.« less

Boundary Layer Temporal Evolution Observed by Doppler LiDAR Upwind of a Lake-Effect Snow Event

NASA Astrophysics Data System (ADS)

King, D.; Kristovich, D.

2017-12-01

Lake-effect snow (LES) annually affects the Great Lakes region. It can impact communities economically, recreationally and perhaps result in fatalities. Previous studies have shown that the upwind shore of a LES system tends to be a region for mesoscale downdrafts. This study intends to show how the depth of the boundary (BL) on the upwind shore and how it could influence a LES event downstream. From December 7-10, 2016, we deployed a Halo-Photonics Streamline pulsed Doppler LiDAR at Illinois Beach State Park in Zion, Illinois, to observe the evolving BL wind structure and depth upwind of the growing LES over eastern Lake Michigan. The LiDAR scans included vertical stare, velocity-azimuth display (VAD), and range height indicator (RHI) modes to display the BL depth as well as LES cloud band structure. The BL depth was observed by turbulent velocities and backscatter profiles from the LiDAR. The BL was found to be approximately one kilometer during the day, and reduced to near surface at night. The BL depth, overall, increased from the 8th to the 9th, while snowfall rate decreased on the downwind shore. This suggests that local BL dynamics have less influence on downwind convection and snow production than originally anticipated. The larger scale environment appears to play a larger role in the multi-day BL evolution.

Novel cooperative neural fusion algorithms for image restoration and image fusion.

PubMed

Xia, Youshen; Kamel, Mohamed S

2007-02-01

To deal with the problem of restoring degraded images with non-Gaussian noise, this paper proposes a novel cooperative neural fusion regularization (CNFR) algorithm for image restoration. Compared with conventional regularization algorithms for image restoration, the proposed CNFR algorithm can relax need of the optimal regularization parameter to be estimated. Furthermore, to enhance the quality of restored images, this paper presents a cooperative neural fusion (CNF) algorithm for image fusion. Compared with existing signal-level image fusion algorithms, the proposed CNF algorithm can greatly reduce the loss of contrast information under blind Gaussian noise environments. The performance analysis shows that the proposed two neural fusion algorithms can converge globally to the robust and optimal image estimate. Simulation results confirm that in different noise environments, the proposed two neural fusion algorithms can obtain a better image estimate than several well known image restoration and image fusion methods.

Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

DTIC Science & Technology

2016-10-11

Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization,” (W. Bian, X. Chen, and Ye), Math Programming, 149 (2015) 301-327...Chen, Ge, Wang, Ye), Math Programming, 143 (1-2) (2014) 371-383. This paper resolved an important open question in cardinality constrained...Statistical Performance, and Algorithmic Theory for Local Solutions,” (H. Liu, T. Yao, R. Li, Y. Ye) manuscript, 2nd revision in Math Programming

Relaxation model for extended magnetohydrodynamics: Comparison to magnetohydrodynamics for dense Z-pinches

DOE PAGES

Seyler, C. E.; Martin, M. R.

2011-01-14

In this study, it is shown that the two-fluid model under a generalized Ohm’s law formulation and the resistive magnetohydrodynamics (MHD) can both be described as relaxation systems. In the relaxation model, the under-resolved stiff source terms constrain the dynamics of a set of hyperbolic equations to give the correct asymptotic solution. When applied to the collisional two-fluid model, the relaxation of fast time scales associated with displacement current and finite electron mass allows for a natural transition from a system where Ohm’s law determines the current density to a system where Ohm’s law determines the electric field. This resultmore » is used to derive novel algorithms, which allow for multiscale simulation of low and high frequency extended-MHD physics. This relaxation formulation offers an efficient way to implicitly advance the Hall term and naturally simulate a plasma-vacuum interface without invoking phenomenological models. The relaxation model is implemented as an extended-MHD code, which is used to analyze pulsed power loads such as wire arrays and ablating foils. Two-dimensional simulations of pulsed power loads are compared for extended-MHD and MHD. For these simulations, it is also shown that the relaxation model properly recovers the resistive-MHD limit.« less

Flux-corrected transport algorithms for continuous Galerkin methods based on high order Bernstein finite elements

NASA Astrophysics Data System (ADS)

Lohmann, Christoph; Kuzmin, Dmitri; Shadid, John N.; Mabuza, Sibusiso

2017-09-01

This work extends the flux-corrected transport (FCT) methodology to arbitrary order continuous finite element discretizations of scalar conservation laws on simplex meshes. Using Bernstein polynomials as local basis functions, we constrain the total variation of the numerical solution by imposing local discrete maximum principles on the Bézier net. The design of accuracy-preserving FCT schemes for high order Bernstein-Bézier finite elements requires the development of new algorithms and/or generalization of limiting techniques tailored for linear and multilinear Lagrange elements. In this paper, we propose (i) a new discrete upwinding strategy leading to local extremum bounded low order approximations with compact stencils, (ii) high order variational stabilization based on the difference between two gradient approximations, and (iii) new localized limiting techniques for antidiffusive element contributions. The optional use of a smoothness indicator, based on a second derivative test, makes it possible to potentially avoid unnecessary limiting at smooth extrema and achieve optimal convergence rates for problems with smooth solutions. The accuracy of the proposed schemes is assessed in numerical studies for the linear transport equation in 1D and 2D.

Modeling of high speed chemically reacting flow-fields

NASA Technical Reports Server (NTRS)

Drummond, J. P.; Carpenter, Mark H.; Kamath, H.

1989-01-01

The SPARK3D and SPARK3D-PNS computer programs were developed to model 3-D supersonic, chemically reacting flow-fields. The SPARK3D code is a full Navier-Stokes solver, and is suitable for use in scramjet combustors and other regions where recirculation may be present. The SPARK3D-PNS is a parabolized Navier-Stokes solver and provides an efficient means of calculating steady-state combustor far-fields and nozzles. Each code has a generalized chemistry package, making modeling of any chemically reacting flow possible. Research activities by the Langley group range from addressing fundamental theoretical issues to simulating problems of practical importance. Algorithmic development includes work on higher order and upwind spatial difference schemes. Direct numerical simulations employ these algorithms to address the fundamental issues of flow stability and transition, and the chemical reaction of supersonic mixing layers and jets. It is believed that this work will lend greater insight into phenomenological model development for simulating supersonic chemically reacting flows in practical combustors. Currently, the SPARK3D and SPARK3D-PNS codes are used to study problems of engineering interest, including various injector designs and 3-D combustor-nozzle configurations. Examples, which demonstrate the capabilities of each code are presented.

Instantaneous normal mode analysis of the vibrational relaxation of the amide I mode of alanine dipeptide in water.

PubMed

Farag, Marwa H; Zúñiga, José; Requena, Alberto; Bastida, Adolfo

2013-05-28

Nonequilibrium Molecular Dynamics (MD) simulations coupled to instantaneous normal modes (INMs) analysis are used to study the vibrational relaxation of the acetyl and amino-end amide I modes of the alanine dipeptide (AlaD) molecule dissolved in water (D2O). The INMs are assigned in terms of the equilibrium normal modes using the Effective Atomic Min-Cost algorithm as adapted to make use of the outputs of standard MD packages, a method which is well suited for the description of flexible molecules. The relaxation energy curves of both amide I modes show multiexponential decays, in good agreement with the experimental findings. It is found that ~85%-90% of the energy relaxes through intramolecular vibrational redistribution. The main relaxation pathways are also identified. The rate at which energy is transferred into the solvent is similar for the acetyl-end and amino-end amide I modes. The conformational changes occurring during relaxation are investigated, showing that the populations of the alpha and beta region conformers are altered by energy transfer in such a way that it takes 15 ps for the equilibrium conformational populations to be recovered after the initial excitation of the AlaD molecule.

A Coulomb collision algorithm for weighted particle simulations

NASA Technical Reports Server (NTRS)

Miller, Ronald H.; Combi, Michael R.

1994-01-01

A binary Coulomb collision algorithm is developed for weighted particle simulations employing Monte Carlo techniques. Charged particles within a given spatial grid cell are pair-wise scattered, explicitly conserving momentum and implicitly conserving energy. A similar algorithm developed by Takizuka and Abe (1977) conserves momentum and energy provided the particles are unweighted (each particle representing equal fractions of the total particle density). If applied as is to simulations incorporating weighted particles, the plasma temperatures equilibrate to an incorrect temperature, as compared to theory. Using the appropriate pairing statistics, a Coulomb collision algorithm is developed for weighted particles. The algorithm conserves energy and momentum and produces the appropriate relaxation time scales as compared to theoretical predictions. Such an algorithm is necessary for future work studying self-consistent multi-species kinetic transport.

Measurement of Non-Linear Internal Waves and Their Interaction with Surface Waves using Coherent Real Aperture Radars

DTIC Science & Technology

2010-03-08

frequencies on wind speed and direction is viable at VV polarization at much larger incidence angles than we had thought. At this polarization it works...out to 89 degree incidence angles. By contrast at HH polarization the model underpredicts the NRCS of the sea for incidence angles above about 45...degrees. ● At high grazing angles, HH polarized cross sections maximize upwind and minimize downwind; upwind they are slightly smaller than VV

Archaeological Investigations on the San Antonio Terrace, Vandenberg Air Force Base, California, in Connection with MX Facilities Construction.

DTIC Science & Technology

1984-01-01

different subsistence-settlement contexts: agriculturalists living in permanent villages and hunter-gatherers subsisting on highly productive wild food...peoples on the terrace (especially at the upwind extremities) may --- have resulted in an increase in the occurance of wild fires and an increase in...sand. The charcoal was probably generated in a wild fire upwind, blown across the surface and then covered by the sands freed by the burning of the

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.

PubMed

Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

2013-01-01

We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.

SALUTE Grid Application using Message-Oriented Middleware

NASA Astrophysics Data System (ADS)

Atanassov, E.; Dimitrov, D. Sl.; Gurov, T.

2009-10-01

Stochastic ALgorithms for Ultra-fast Transport in sEmiconductors (SALUTE) is a grid application developed for solving various computationally intensive problems which describe ultra-fast carrier transport in semiconductors. SALUTE studies memory and quantum effects during the relaxation process due to electronphonon interaction in one-band semiconductors or quantum wires. Formally, SALUTE integrates a set of novel Monte Carlo, quasi-Monte Carlo and hybrid algorithms for solving various computationally intensive problems which describe the femtosecond relaxation process of optically excited carriers in one-band semiconductors or quantum wires. In this paper we present application-specific job submission and reservation management tool named a Job Track Server (JTS). It is developed using Message-Oriented middleware to implement robust, versatile job submission and tracing mechanism, which can be tailored to application specific failover and quality of service requirements. Experience from using the JTS for submission of SALUTE jobs is presented.

Distributed resource allocation under communication constraints

NASA Astrophysics Data System (ADS)

Dodin, Pierre; Nimier, Vincent

2001-03-01

This paper deals with a study of the multi-sensor management problem for multi-target tracking. The collaboration between many sensors observing the same target means that they are able to fuse their data during the information process. Then one must take into account this possibility to compute the optimal association sensors-target at each step of time. In order to solve this problem for real large scale system, one must both consider the information aspect and the control aspect of the problem. To unify these problems, one possibility is to use a decentralized filtering algorithm locally driven by an assignment algorithm. The decentralized filtering algorithm we use in our model is the filtering algorithm of Grime, which relaxes the usual full-connected hypothesis. By full-connected, one means that the information in a full-connected system is totally distributed everywhere at the same moment, which is unacceptable for a real large scale system. We modelize the distributed assignment decision with the help of a greedy algorithm. Each sensor performs a global optimization, in order to estimate other information sets. A consequence of the relaxation of the full- connected hypothesis is that the sensors' information set are not the same at each step of time, producing an information dis- symmetry in the system. The assignment algorithm uses a local knowledge of this dis-symmetry. By testing the reactions and the coherence of the local assignment decisions of our system, against maneuvering targets, we show that it is still possible to manage with decentralized assignment control even though the system is not full-connected.

Eigensolution analysis of spectral/hp continuous Galerkin approximations to advection-diffusion problems: Insights into spectral vanishing viscosity

NASA Astrophysics Data System (ADS)

Moura, R. C.; Sherwin, S. J.; Peiró, J.

2016-02-01

This study addresses linear dispersion-diffusion analysis for the spectral/hp continuous Galerkin (CG) formulation in one dimension. First, numerical dispersion and diffusion curves are obtained for the advection-diffusion problem and the role of multiple eigencurves peculiar to spectral/hp methods is discussed. From the eigencurves' behaviour, we observe that CG might feature potentially undesirable non-smooth dispersion/diffusion characteristics for under-resolved simulations of problems strongly dominated by either convection or diffusion. Subsequently, the linear advection equation augmented with spectral vanishing viscosity (SVV) is analysed. Dispersion and diffusion characteristics of CG with SVV-based stabilization are verified to display similar non-smooth features in flow regions where convection is much stronger than dissipation or vice-versa, owing to a dependency of the standard SVV operator on a local Péclet number. First a modification is proposed to the traditional SVV scaling that enforces a globally constant Péclet number so as to avoid the previous issues. In addition, a new SVV kernel function is suggested and shown to provide a more regular behaviour for the eigencurves along with a consistent increase in resolution power for higher-order discretizations, as measured by the extent of the wavenumber range where numerical errors are negligible. The dissipation characteristics of CG with the SVV modifications suggested are then verified to be broadly equivalent to those obtained through upwinding in the discontinuous Galerkin (DG) scheme. Nevertheless, for the kernel function proposed, the full upwind DG scheme is found to have a slightly higher resolution power for the same dissipation levels. These results show that improved CG-SVV characteristics can be pursued via different kernel functions with the aid of optimization algorithms.

Numerical evaluation of the intensity transport equation for well-known wavefronts and intensity distributions

NASA Astrophysics Data System (ADS)

Campos-García, Manuel; Granados-Agustín, Fermín.; Cornejo-Rodríguez, Alejandro; Estrada-Molina, Amilcar; Avendaño-Alejo, Maximino; Moreno-Oliva, Víctor Iván.

2013-11-01

In order to obtain a clearer interpretation of the Intensity Transport Equation (ITE), in this work, we propose an algorithm to solve it for some particular wavefronts and its corresponding intensity distributions. By simulating intensity distributions in some planes, the ITE is turns into a Poisson equation with Neumann boundary conditions. The Poisson equation is solved by means of the iterative algorithm SOR (Simultaneous Over-Relaxation).

Differentially Private Frequent Sequence Mining via Sampling-based Candidate Pruning

PubMed Central

Xu, Shengzhi; Cheng, Xiang; Li, Zhengyi; Xiong, Li

2016-01-01

In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively reduce the number of unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose a novel differentially private FSM algorithm, which is referred to as PFS2. The core of our algorithm is to utilize sample databases to further prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which sequences are potentially frequent. To improve the accuracy of such private estimations, a sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS2 algorithm is ε-differentially private. Extensive experiments on real datasets illustrate that our PFS2 algorithm can privately find frequent sequences with high accuracy. PMID:26973430

Numerical simulation of steady and unsteady asymmetric vortical flow

NASA Technical Reports Server (NTRS)

Kandil, Osama A.; Wong, Tin-Chee; Liu, C. H.

1992-01-01

The unsteady, compressible, thin-layer, Navier-Stokes (NS) equations are solved to simulate steady and unsteady, asymmetric, vortical laminar flow around cones at high incidences and supersonic Mach numbers. The equations are solved by using an implicit, upwind, flux-difference splitting (FDS), finite-volume scheme. The locally conical flow assumption is used and the solutions are obtained by forcing the conserved components of the flowfield vector to be equal at two axial stations located at 0.95 and 1.0. Computational examples cover steady and unsteady asymmetric flows around a circular cone and its control using side strakes. The unsteady asymmetric flow solution around the circular cone has also been validated using the upwind, flux-vector splitting (FVS) scheme with the thin-layer NS equations and the upwind FDS with the full NS equations. The results are in excellent agreement with each other. Unsteady asymmetric flows are also presented for elliptic- and diamond-section cones, which model asymmetric vortex shedding around round- and sharp-edged delta winds.

A Simplified Model for Detonation Based Pressure-Gain Combustors

NASA Technical Reports Server (NTRS)

Paxson, Daniel E.

2010-01-01

A time-dependent model is presented which simulates the essential physics of a detonative or otherwise constant volume, pressure-gain combustor for gas turbine applications. The model utilizes simple, global thermodynamic relations to determine an assumed instantaneous and uniform post-combustion state in one of many envisioned tubes comprising the device. A simple, second order, non-upwinding computational fluid dynamic algorithm is then used to compute the (continuous) flowfield properties during the blowdown and refill stages of the periodic cycle which each tube undergoes. The exhausted flow is averaged to provide mixed total pressure and enthalpy which may be used as a cycle performance metric for benefits analysis. The simplicity of the model allows for nearly instantaneous results when implemented on a personal computer. The results compare favorably with higher resolution numerical codes which are more difficult to configure, and more time consuming to operate.

Finite volume model for two-dimensional shallow environmental flow

USGS Publications Warehouse

Simoes, F.J.M.

2011-01-01

This paper presents the development of a two-dimensional, depth integrated, unsteady, free-surface model based on the shallow water equations. The development was motivated by the desire of balancing computational efficiency and accuracy by selective and conjunctive use of different numerical techniques. The base framework of the discrete model uses Godunov methods on unstructured triangular grids, but the solution technique emphasizes the use of a high-resolution Riemann solver where needed, switching to a simpler and computationally more efficient upwind finite volume technique in the smooth regions of the flow. Explicit time marching is accomplished with strong stability preserving Runge-Kutta methods, with additional acceleration techniques for steady-state computations. A simplified mass-preserving algorithm is used to deal with wet/dry fronts. Application of the model is made to several benchmark cases that show the interplay of the diverse solution techniques.

Computations of spray, fuel-air mixing, and combustion in a lean-premixed-prevaporized combustor

NASA Technical Reports Server (NTRS)

Dasgupta, A.; Li, Z.; Shih, T. I.-P.; Kundu, K.; Deur, J. M.

1993-01-01

A code was developed for computing the multidimensional flow, spray, combustion, and pollutant formation inside gas turbine combustors. The code developed is based on a Lagrangian-Eulerian formulation and utilizes an implicit finite-volume method. The focus of this paper is on the spray part of the code (both formulation and algorithm), and a number of issues related to the computation of sprays and fuel-air mixing in a lean-premixed-prevaporized combustor. The issues addressed include: (1) how grid spacings affect the diffusion of evaporated fuel, and (2) how spurious modes can arise through modelling of the spray in the Lagrangian computations. An upwind interpolation scheme is proposed to account for some effects of grid spacing on the artificial diffusion of the evaporated fuel. Also, some guidelines are presented to minimize errors associated with the spurious modes.

The utilization of Nimbus-7 SMMR measurements to delineate rainfall over land

NASA Technical Reports Server (NTRS)

Rogers, E.; Siddalingaiah, H.

1982-01-01

Based on previous theoretical calculations, an empirical statistical approach to use satellite multifrequency dual polarized passive microwave data to detect rainfall areas over land was initiated. The addition of information from a lower frequency channel (18.0 or 10.7 GHz) was shown to improve the discrimination of rain from wet ground achieved by using a single frequency dual polarized (37 GHz) channel alone. The algorithm was developed and independently tested using data from the Nimbus-7 Scanning Multichannel Microwave Radiometer. Horizontally and vertically polarized brightness temperature pairs at 37, 18, 10.7 GHz were sampled for raining areas over land (determined from ground base radar), wet ground areas (adjacent and upwind from rain areas determined from radar), and dry land regions (areas where rain had not fallen in a 24h period) over the central and eastern United States. Surface thermodynamic temperatures were both above and below 15 deg C.

Numerical simulation of a relaxation test designed to fit a quasi-linear viscoelastic model for temporomandibular joint discs.

PubMed

Commisso, Maria S; Martínez-Reina, Javier; Mayo, Juana; Domínguez, Jaime

2013-02-01

The main objectives of this work are: (a) to introduce an algorithm for adjusting the quasi-linear viscoelastic model to fit a material using a stress relaxation test and (b) to validate a protocol for performing such tests in temporomandibular joint discs. This algorithm is intended for fitting the Prony series coefficients and the hyperelastic constants of the quasi-linear viscoelastic model by considering that the relaxation test is performed with an initial ramp loading at a certain rate. This algorithm was validated before being applied to achieve the second objective. Generally, the complete three-dimensional formulation of the quasi-linear viscoelastic model is very complex. Therefore, it is necessary to design an experimental test to ensure a simple stress state, such as uniaxial compression to facilitate obtaining the viscoelastic properties. This work provides some recommendations about the experimental setup, which are important to follow, as an inadequate setup could produce a stress state far from uniaxial, thus, distorting the material constants determined from the experiment. The test considered is a stress relaxation test using unconfined compression performed in cylindrical specimens extracted from temporomandibular joint discs. To validate the experimental protocol, the test was numerically simulated using finite-element modelling. The disc was arbitrarily assigned a set of quasi-linear viscoelastic constants (c1) in the finite-element model. Another set of constants (c2) was obtained by fitting the results of the simulated test with the proposed algorithm. The deviation of constants c2 from constants c1 measures how far the stresses are from the uniaxial state. The effects of the following features of the experimental setup on this deviation have been analysed: (a) the friction coefficient between the compression plates and the specimen (which should be as low as possible); (b) the portion of the specimen glued to the compression plates (smaller areas glued are better); and (c) the variation in the thickness of the specimen. The specimen's faces should be parallel to ensure a uniaxial stress state. However, this is not possible in real specimens, and a criterion must be defined to accept the specimen in terms of the specimen's thickness variation and the deviation of the fitted constants arising from such a variation.

Bounded-Degree Approximations of Stochastic Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identifymore » the r-best approximations among these classes, enabling robust decision making.« less

Three-dimensional particle tracking velocimetry algorithm based on tetrahedron vote

NASA Astrophysics Data System (ADS)

Cui, Yutong; Zhang, Yang; Jia, Pan; Wang, Yuan; Huang, Jingcong; Cui, Junlei; Lai, Wing T.

2018-02-01

A particle tracking velocimetry algorithm based on tetrahedron vote, which is named TV-PTV, is proposed to overcome the limited selection problem of effective algorithms for 3D flow visualisation. In this new cluster-matching algorithm, tetrahedrons produced by the Delaunay tessellation are used as the basic units for inter-frame matching, which results in a simple algorithmic structure of only two independent preset parameters. Test results obtained using the synthetic test image data from the Visualisation Society of Japan show that TV-PTV presents accuracy comparable to that of the classical algorithm based on new relaxation method (NRX). Compared with NRX, TV-PTV possesses a smaller number of loops in programming and thus a shorter computing time, especially for large particle displacements and high particle concentration. TV-PTV is confirmed practically effective using an actual 3D wake flow.

Curvilinear immersed boundary method for simulating fluid structure interaction with complex 3D rigid bodies

NASA Astrophysics Data System (ADS)

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2008-08-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A numerical method for solving the 3D unsteady incompressible Navier-Stokes equations in curvilinear domains with complex immersed boundaries, Journal of Computational Physics 225 (2007) 1782-1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions the FSI algorithm is unconditionally unstable even when strong coupling FSI is employed. For such cases, however, combining the strong coupling iteration with under-relaxation in conjunction with the Aitken's acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and the upper bound of the under-relaxation coefficient, required for stability, is derived.

Location estimation in wireless sensor networks using spring-relaxation technique.

PubMed

Zhang, Qing; Foh, Chuan Heng; Seet, Boon-Chong; Fong, A C M

2010-01-01

Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization.

Enhancing Web applications in radiology with Java: estimating MR imaging relaxation times.

PubMed

Dagher, A P; Fitzpatrick, M; Flanders, A E; Eng, J

1998-01-01

Java is a relatively new programming language that has been used to develop a World Wide Web-based tool for estimating magnetic resonance (MR) imaging relaxation times, thereby demonstrating how Java may be used for Web-based radiology applications beyond improving the user interface of teaching files. A standard processing algorithm coded with Java is downloaded along with the hypertext markup language (HTML) document. The user (client) selects the desired pulse sequence and inputs data obtained from a region of interest on the MR images. The algorithm is used to modify selected MR imaging parameters in an equation that models the phenomenon being evaluated. MR imaging relaxation times are estimated, and confidence intervals and a P value expressing the accuracy of the final results are calculated. Design features such as simplicity, object-oriented programming, and security restrictions allow Java to expand the capabilities of HTML by offering a more versatile user interface that includes dynamic annotations and graphics. Java also allows the client to perform more sophisticated information processing and computation than is usually associated with Web applications. Java is likely to become a standard programming option, and the development of stand-alone Java applications may become more common as Java is integrated into future versions of computer operating systems.

Migration of dispersive GPR data

USGS Publications Warehouse

Powers, M.H.; Oden, C.P.; ,

2004-01-01

Electrical conductivity and dielectric and magnetic relaxation phenomena cause electromagnetic propagation to be dispersive in earth materials. Both velocity and attenuation may vary with frequency, depending on the frequency content of the propagating energy and the nature of the relaxation phenomena. A minor amount of velocity dispersion is associated with high attenuation. For this reason, measuring effects of velocity dispersion in ground penetrating radar (GPR) data is difficult. With a dispersive forward model, GPR responses to propagation through materials with known frequency-dependent properties have been created. These responses are used as test data for migration algorithms that have been modified to handle specific aspects of dispersive media. When either Stolt or Gazdag migration methods are modified to correct for just velocity dispersion, the results are little changed from standard migration. For nondispersive propagating wavefield data, like deep seismic, ensuring correct phase summation in a migration algorithm is more important than correctly handling amplitude. However, the results of migrating model responses to dispersive media with modified algorithms indicate that, in this case, correcting for frequency-dependent amplitude loss has a much greater effect on the result than correcting for proper phase summation. A modified migration is only effective when it includes attenuation recovery, performing deconvolution and migration simultaneously.

Sparse approximation problem: how rapid simulated annealing succeeds and fails

NASA Astrophysics Data System (ADS)

Obuchi, Tomoyuki; Kabashima, Yoshiyuki

2016-03-01

Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the sparse approximation. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing works well in a reasonable parameter region: the planted solution is found fairly rapidly. This is true even in the case where a common relaxation of the sparse approximation problem, the G-relaxation, is ineffective. On the other hand, when the dimensionality of the data is close to the number of non-zero components, another metastable state emerges, and our algorithm fails to find the planted solution. This phenomenon is associated with a first-order phase transition. In the case of very strong noise, it is no longer meaningful to search for the planted solution. In this situation, our algorithm determines a solution with close-to-minimum distortion fairly quickly.

Taming the Wild: A Unified Analysis of Hogwild!-Style Algorithms.

PubMed

De Sa, Christopher; Zhang, Ce; Olukotun, Kunle; Ré, Christopher

2015-12-01

Stochastic gradient descent (SGD) is a ubiquitous algorithm for a variety of machine learning problems. Researchers and industry have developed several techniques to optimize SGD's runtime performance, including asynchronous execution and reduced precision. Our main result is a martingale-based analysis that enables us to capture the rich noise models that may arise from such techniques. Specifically, we use our new analysis in three ways: (1) we derive convergence rates for the convex case (Hogwild!) with relaxed assumptions on the sparsity of the problem; (2) we analyze asynchronous SGD algorithms for non-convex matrix problems including matrix completion; and (3) we design and analyze an asynchronous SGD algorithm, called Buckwild!, that uses lower-precision arithmetic. We show experimentally that our algorithms run efficiently for a variety of problems on modern hardware.

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

NASA Technical Reports Server (NTRS)

Barnard, Stephen T.; Pothen, Alex; Simon, Horst D.

1993-01-01

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Finite-element time-domain algorithms for modeling linear Debye and Lorentz dielectric dispersions at low frequencies.

PubMed

Stoykov, Nikolay S; Kuiken, Todd A; Lowery, Madeleine M; Taflove, Allen

2003-09-01

We present what we believe to be the first algorithms that use a simple scalar-potential formulation to model linear Debye and Lorentz dielectric dispersions at low frequencies in the context of finite-element time-domain (FETD) numerical solutions of electric potential. The new algorithms, which permit treatment of multiple-pole dielectric relaxations, are based on the auxiliary differential equation method and are unconditionally stable. We validate the algorithms by comparison with the results of a previously reported method based on the Fourier transform. The new algorithms should be useful in calculating the transient response of biological materials subject to impulsive excitation. Potential applications include FETD modeling of electromyography, functional electrical stimulation, defibrillation, and effects of lightning and impulsive electric shock.

Computation of turbulent pipe and duct flow using third order upwind scheme

NASA Technical Reports Server (NTRS)

Kawamura, T.

1986-01-01

The fully developed turbulence in a circular pipe and in a square duct is simulated directly without using turbulence models in the Navier-Stokes equations. The utilized method employs a third-order upwind scheme for the approximation to the nonlinear term and the second-order Adams-Bashforth method for the time derivative in the Navier-Stokes equation. The computational results appear to capture the large-scale turbulent structures at least qualitatively. The significance of the artificial viscosity inherent in the present scheme is discussed.

Upwind differencing and LU factorization for chemical non-equilibrium Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun

1992-01-01

By means of either the Roe or the Van Leer flux-splittings for inviscid terms, in conjunction with central differencing for viscous terms in the explicit operator and the Steger-Warming splitting and lower-upper approximate factorization for the implicit operator, the present, robust upwind method for solving the chemical nonequilibrium Navier-Stokes equations yields formulas for finite-volume discretization in general coordinates. Numerical tests in the illustrative cases of a hypersonic blunt body, a ramped duct, divergent nozzle flows, and shock wave/boundary layer interactions, establish the method's efficiency.

On central-difference and upwind schemes

NASA Technical Reports Server (NTRS)

Swanson, R. C.; Turkel, Eli

1990-01-01

A class of numerical dissipation models for central-difference schemes constructed with second- and fourth-difference terms is considered. The notion of matrix dissipation associated with upwind schemes is used to establish improved shock capturing capability for these models. In addition, conditions are given that guarantee that such dissipation models produce a Total Variation Diminishing (TVD) scheme. Appropriate switches for this type of model to ensure satisfaction of the TVD property are presented. Significant improvements in the accuracy of a central-difference scheme are demonstrated by computing both inviscid and viscous transonic airfoil flows.

A Well-Balanced Central-Upwind Scheme for the 2D Shallow Water Equations on Triangular Meshes

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron

2004-01-01

We are interested in approximating solutions of the two-dimensional shallow water equations with a bottom topography on triangular meshes. We show that there is a certain flexibility in choosing the numerical fluxes in the design of semi-discrete Godunov-type central schemes. We take advantage of this fact to generate a new second-order, central-upwind method for the two-dimensional shallow water equations that is well-balanced. We demonstrate the accuracy of our method as well as its balance properties in a variety of examples.

Field by field hybrid upwind splitting methods

NASA Technical Reports Server (NTRS)

Coquel, Frederic; Liou, Meng-Sing

1993-01-01

A new and general approach to upwind splitting is presented. The design principle combines the robustness of flux vector splitting schemes in the capture of nonlinear waves and the accuracy of some flux difference splitting schemes in the resolution of linear waves. The new schemes are derived following a general hybridization technique performed directly at the basic level of the field by field decomposition involved in FDS methods. The scheme does not use a spatial switch to be tuned up according to the local smoothness of the approximate solution.

Magnetic resonance electrical impedance tomography (MREIT) based on the solution of the convection equation using FEM with stabilization.

PubMed

Oran, Omer Faruk; Ider, Yusuf Ziya

2012-08-21

Most algorithms for magnetic resonance electrical impedance tomography (MREIT) concentrate on reconstructing the internal conductivity distribution of a conductive object from the Laplacian of only one component of the magnetic flux density (∇²B(z)) generated by the internal current distribution. In this study, a new algorithm is proposed to solve this ∇²B(z)-based MREIT problem which is mathematically formulated as the steady-state scalar pure convection equation. Numerical methods developed for the solution of the more general convection-diffusion equation are utilized. It is known that the solution of the pure convection equation is numerically unstable if sharp variations of the field variable (in this case conductivity) exist or if there are inconsistent boundary conditions. Various stabilization techniques, based on introducing artificial diffusion, are developed to handle such cases and in this study the streamline upwind Petrov-Galerkin (SUPG) stabilization method is incorporated into the Galerkin weighted residual finite element method (FEM) to numerically solve the MREIT problem. The proposed algorithm is tested with simulated and also experimental data from phantoms. Successful conductivity reconstructions are obtained by solving the related convection equation using the Galerkin weighted residual FEM when there are no sharp variations in the actual conductivity distribution. However, when there is noise in the magnetic flux density data or when there are sharp variations in conductivity, it is found that SUPG stabilization is beneficial.

The physical demands of Olympic yacht racing.

PubMed

Mackie, H; Sanders, R; Legg, S

1999-12-01

The primary purpose of this study was to quantify the up wards forces of the feet on the hiking strap and the forces in the mainsheet of four Olympic classes of racing dinghies (Europe, Laser. Finn and 470) during realistic on-water sailing in varying wind conditions. The secondary aim of the study was to measure the joint angles adopted by the sailors and boat heel angles. The tertiary aim was to identify events and sailing conditions associated with large or patterned force production. Forces in the hiking strap and mainsheet of four classes of Olympic sailing dinghies were measured on eleven New Zealand sailors during simulated on-water racing in a range of wind conditions. Up-wind hiking strap forces reached an average of 73-87% of predicted maximal voluntary contraction (pred MVC), with peak forces exceeding 100% pred MVC. Mainsheet forces reached 25-35% pred MVC, with peak forces reaching 40-50% pred MVC. Off-wind hiking strap and mainsheet forces were considerably lower than up-wind forces. Ankle and hip joint angles increased and knee joint angles decreased with increasing wind speed during up-wind sailing. Large forces occurred in the hiking strap and mainsheet when boats reached the tops of wave during up-wind sailing in high wind speeds and when a gust of wind hit the boat. During off-wind sailing large forces were observed in the mainsheet when surfing down waves. It is recommended that the intensities and joint angles found in this study be used as a basis for the development of class specific off-water physical conditioning programmes.

Scheduled Relaxation Jacobi method: Improvements and applications

NASA Astrophysics Data System (ADS)

Adsuara, J. E.; Cordero-Carrión, I.; Cerdá-Durán, P.; Aloy, M. A.

2016-09-01

Elliptic partial differential equations (ePDEs) appear in a wide variety of areas of mathematics, physics and engineering. Typically, ePDEs must be solved numerically, which sets an ever growing demand for efficient and highly parallel algorithms to tackle their computational solution. The Scheduled Relaxation Jacobi (SRJ) is a promising class of methods, atypical for combining simplicity and efficiency, that has been recently introduced for solving linear Poisson-like ePDEs. The SRJ methodology relies on computing the appropriate parameters of a multilevel approach with the goal of minimizing the number of iterations needed to cut down the residuals below specified tolerances. The efficiency in the reduction of the residual increases with the number of levels employed in the algorithm. Applying the original methodology to compute the algorithm parameters with more than 5 levels notably hinders obtaining optimal SRJ schemes, as the mixed (non-linear) algebraic-differential system of equations from which they result becomes notably stiff. Here we present a new methodology for obtaining the parameters of SRJ schemes that overcomes the limitations of the original algorithm and provide parameters for SRJ schemes with up to 15 levels and resolutions of up to 215 points per dimension, allowing for acceleration factors larger than several hundreds with respect to the Jacobi method for typical resolutions and, in some high resolution cases, close to 1000. Most of the success in finding SRJ optimal schemes with more than 10 levels is based on an analytic reduction of the complexity of the previously mentioned system of equations. Furthermore, we extend the original algorithm to apply it to certain systems of non-linear ePDEs.

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

Cavity control as a new quantum algorithms implementation treatment

NASA Astrophysics Data System (ADS)

AbuGhanem, M.; Homid, A. H.; Abdel-Aty, M.

2018-02-01

Based on recent experiments [ Nature 449, 438 (2007) and Nature Physics 6, 777 (2010)], a new approach for realizing quantum gates for the design of quantum algorithms was developed. Accordingly, the operation times of such gates while functioning in algorithm applications depend on the number of photons present in their resonant cavities. Multi-qubit algorithms can be realized in systems in which the photon number is increased slightly over the qubit number. In addition, the time required for operation is considerably less than the dephasing and relaxation times of the systems. The contextual use of the photon number as a main control in the realization of any algorithm was demonstrated. The results indicate the possibility of a full integration into the realization of multi-qubit multiphoton states and its application in algorithm designs. Furthermore, this approach will lead to a successful implementation of these designs in future experiments.

Unweighted least squares phase unwrapping by means of multigrid techniques

NASA Astrophysics Data System (ADS)

Pritt, Mark D.

1995-11-01

We present a multigrid algorithm for unweighted least squares phase unwrapping. This algorithm applies Gauss-Seidel relaxation schemes to solve the Poisson equation on smaller, coarser grids and transfers the intermediate results to the finer grids. This approach forms the basis of our multigrid algorithm for weighted least squares phase unwrapping, which is described in a separate paper. The key idea of our multigrid approach is to maintain the partial derivatives of the phase data in separate arrays and to correct these derivatives at the boundaries of the coarser grids. This maintains the boundary conditions necessary for rapid convergence to the correct solution. Although the multigrid algorithm is an iterative algorithm, we demonstrate that it is nearly as fast as the direct Fourier-based method. We also describe how to parallelize the algorithm for execution on a distributed-memory parallel processor computer or a network-cluster of workstations.

Typical performance of approximation algorithms for NP-hard problems

NASA Astrophysics Data System (ADS)

Takabe, Satoshi; Hukushima, Koji

2016-11-01

Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linear-programming relaxation, loopy-belief propagation, and the leaf-removal algorithm. The former two algorithms are analyzed using a statistical-mechanical technique, whereas the average-case analysis of the last one is conducted using the generating function method. These algorithms have a threshold in the typical performance with increasing average degree of the random graph, below which they find true optimal solutions with high probability. Our study reveals that there exist only three cases, determined by the order of the typical performance thresholds. In addition, we provide some conditions for classification of the graph ensembles and demonstrate explicitly some examples for the difference in thresholds.

Charge Relaxation Dynamics of an Electrolytic Nanocapacitor

PubMed Central

2015-01-01

Understanding ion relaxation dynamics in overlapping electric double layers (EDLs) is critical for the development of efficient nanotechnology-based electrochemical energy storage, electrochemomechanical energy conversion, and bioelectrochemical sensing devices as well as the controlled synthesis of nanostructured materials. Here, a lattice Boltzmann (LB) method is employed to simulate an electrolytic nanocapacitor subjected to a step potential at t = 0 for various degrees of EDL overlap, solvent viscosities, ratios of cation-to-anion diffusivity, and electrode separations. The use of a novel continuously varying and Galilean-invariant molecular-speed-dependent relaxation time (MSDRT) with the LB equation recovers a correct microscopic description of the molecular-collision phenomena and enhances the stability of the LB algorithm. Results for large EDL overlaps indicated oscillatory behavior for the ionic current density, in contrast to monotonic relaxation to equilibrium for low EDL overlaps. Further, at low solvent viscosities and large EDL overlaps, anomalous plasmalike spatial oscillations of the electric field were observed that appeared to be purely an effect of nanoscale confinement. Employing MSDRT in our simulations enabled modeling of the fundamental physics of the transient charge relaxation dynamics in electrochemical systems operating away from equilibrium wherein Nernst–Einstein relation is known to be violated. PMID:25678941

Relaxation of selection, niche construction, and the Baldwin effect in language evolution.

PubMed

Yamauchi, Hajime; Hashimoto, Takashi

2010-01-01

Deacon has suggested that one of the key factors of language evolution is not characterized by an increase in genetic contribution, often known as the Baldwin effect, but rather by a decrease. This process effectively increases linguistic learning capability by organizing a novel synergy of multiple lower-order functions previously irrelevant to the process of language acquisition. Deacon posits that this transition is not caused by natural selection. Rather, it is due to the relaxation of natural selection. While there are some cases in which relaxation caused by some external factors indeed induces the transition, we do not know what kind of relaxation has worked in language evolution. In this article, a genetic-algorithm-based computer simulation is used to investigate how the niche-constructing aspect of linguistic behavior may trigger the degradation of genetic predisposition related to language learning. The results show that agents initially increase their genetic predisposition for language learning—the Baldwin effect. They create a highly uniform sociolinguistic environment—a linguistic niche construction. This means that later generations constantly receive very similar inputs from adult agents, and subsequently the selective pressure to retain the genetic predisposition is relaxed.

Iterative algorithm for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution

NASA Astrophysics Data System (ADS)

Quan, Haiyang; Wu, Fan; Hou, Xi

2015-10-01

New method for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution is proposed. It is based on basic iterative scheme and accelerates the Gauss-Seidel method by introducing an acceleration parameter. This modified Successive Over-relaxation (SOR) is effective for solving the rotationally asymmetric components with pixel-level spatial resolution, without the usage of a fitting procedure. Compared to the Jacobi and Gauss-Seidel method, the modified SOR method with an optimal relaxation factor converges much faster and saves more computational costs and memory space without reducing accuracy. It has been proved by real experimental results.

Characteristic-based algorithms for flows in thermo-chemical nonequilibrium

NASA Technical Reports Server (NTRS)

Walters, Robert W.; Cinnella, Pasquale; Slack, David C.; Halt, David

1990-01-01

A generalized finite-rate chemistry algorithm with Steger-Warming, Van Leer, and Roe characteristic-based flux splittings is presented in three-dimensional generalized coordinates for the Navier-Stokes equations. Attention is placed on convergence to steady-state solutions with fully coupled chemistry. Time integration schemes including explicit m-stage Runge-Kutta, implicit approximate-factorization, relaxation and LU decomposition are investigated and compared in terms of residual reduction per unit of CPU time. Practical issues such as code vectorization and memory usage on modern supercomputers are discussed.

A conservative finite difference algorithm for the unsteady transonic potential equation in generalized coordinates

NASA Technical Reports Server (NTRS)

Bridgeman, J. O.; Steger, J. L.; Caradonna, F. X.

1982-01-01

An implicit, approximate-factorization, finite-difference algorithm has been developed for the computation of unsteady, inviscid transonic flows in two and three dimensions. The computer program solves the full-potential equation in generalized coordinates in conservation-law form in order to properly capture shock-wave position and speed. A body-fitted coordinate system is employed for the simple and accurate treatment of boundary conditions on the body surface. The time-accurate algorithm is modified to a conventional ADI relaxation scheme for steady-state computations. Results from two- and three-dimensional steady and two-dimensional unsteady calculations are compared with existing methods.

Iterated local search algorithm for solving the orienteering problem with soft time windows.

PubMed

Aghezzaf, Brahim; Fahim, Hassan El

2016-01-01

In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

Multi-Stage Convex Relaxation Methods for Machine Learning

DTIC Science & Technology

2013-03-01

Many problems in machine learning can be naturally formulated as non-convex optimization problems. However, such direct nonconvex formulations have...original nonconvex formulation. We will develop theoretical properties of this method and algorithmic consequences. Related convex and nonconvex machine learning methods will also be investigated.

A numerical model for predicting crack path and modes of damage in unidirectional metal matrix composites

NASA Technical Reports Server (NTRS)

Bakuckas, J. G.; Tan, T. M.; Lau, A. C. W.; Awerbuch, J.

1993-01-01

A finite element-based numerical technique has been developed to simulate damage growth in unidirectional composites. This technique incorporates elastic-plastic analysis, micromechanics analysis, failure criteria, and a node splitting and node force relaxation algorithm to create crack surfaces. Any combination of fiber and matrix properties can be used. One of the salient features of this technique is that damage growth can be simulated without pre-specifying a crack path. In addition, multiple damage mechanisms in the forms of matrix cracking, fiber breakage, fiber-matrix debonding and plastic deformation are capable of occurring simultaneously. The prevailing failure mechanism and the damage (crack) growth direction are dictated by the instantaneous near-tip stress and strain fields. Once the failure mechanism and crack direction are determined, the crack is advanced via the node splitting and node force relaxation algorithm. Simulations of the damage growth process in center-slit boron/aluminum and silicon carbide/titanium unidirectional specimens were performed. The simulation results agreed quite well with the experimental observations.

Investigation of Convection and Pressure Treatment with Splitting Techniques

NASA Technical Reports Server (NTRS)

Thakur, Siddharth; Shyy, Wei; Liou, Meng-Sing

1995-01-01

Treatment of convective and pressure fluxes in the Euler and Navier-Stokes equations using splitting formulas for convective velocity and pressure is investigated. Two schemes - controlled variation scheme (CVS) and advection upstream splitting method (AUSM) - are explored for their accuracy in resolving sharp gradients in flows involving moving or reflecting shock waves as well as a one-dimensional combusting flow with a strong heat release source term. For two-dimensional compressible flow computations, these two schemes are implemented in one of the pressure-based algorithms, whose very basis is the separate treatment of convective and pressure fluxes. For the convective fluxes in the momentum equations as well as the estimation of mass fluxes in the pressure correction equation (which is derived from the momentum and continuity equations) of the present algorithm, both first- and second-order (with minmod limiter) flux estimations are employed. Some issues resulting from the conventional use in pressure-based methods of a staggered grid, for the location of velocity components and pressure, are also addressed. Using the second-order fluxes, both CVS and AUSM type schemes exhibit sharp resolution. Overall, the combination of upwinding and splitting for the convective and pressure fluxes separately exhibits robust performance for a variety of flows and is particularly amenable for adoption in pressure-based methods.

Viscous flow computations using a second-order upwind differencing scheme

NASA Technical Reports Server (NTRS)

Chen, Y. S.

1988-01-01

In the present computations of a wide range of fluid flow problems by means of the primitive variables-incorporating Navier-Stokes equations, a mixed second-order upwinding scheme approximates the convective terms of the transport equations and the scheme's accuracy is verified for convection-dominated high Re number flow problems. An adaptive dissipation scheme is used as a monotonic supersonic shock flow capture mechanism. Many benchmark fluid flow problems, including the compressible and incompressible, laminar and turbulent, over a wide range of M and Re numbers, are presently studied to verify the accuracy and robustness of this numerical method.

Turbulence Intensity at Inlet of 80- by 120-Foot Wind Tunnel Caused by Upwind Blockage

NASA Technical Reports Server (NTRS)

Salazar, Denise; Yuricich, Jillian

2014-01-01

In order to estimate the magnitude of turbulence in the National Full-Scale Aerodynamics Complex (NFAC) 80- by 120-Foot Wind Tunnel (80 x 120) caused by buildings located upwind from the 80 x 120 inlet, a 150th-scale study was performed that utilized a nominal two-dimensional blockage placed ahead of the inlet. The distance of the blockage ahead of the inlet was varied. This report describes velocity measurements made in the plane of the 80 x 120 model inlet for the case of zero ambient (atmospheric) wind.

The Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 aerosol extinction retrieval algorithm: theoretical basis

NASA Astrophysics Data System (ADS)

Loughman, Robert; Bhartia, Pawan K.; Chen, Zhong; Xu, Philippe; Nyaku, Ernest; Taha, Ghassan

2018-05-01

The theoretical basis of the Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 aerosol extinction retrieval algorithm is presented. The algorithm uses an assumed bimodal lognormal aerosol size distribution to retrieve aerosol extinction profiles at 675 nm from OMPS LP radiance measurements. A first-guess aerosol extinction profile is updated by iteration using the Chahine nonlinear relaxation method, based on comparisons between the measured radiance profile at 675 nm and the radiance profile calculated by the Gauss-Seidel limb-scattering (GSLS) radiative transfer model for a spherical-shell atmosphere. This algorithm is discussed in the context of previous limb-scattering aerosol extinction retrieval algorithms, and the most significant error sources are enumerated. The retrieval algorithm is limited primarily by uncertainty about the aerosol phase function. Horizontal variations in aerosol extinction, which violate the spherical-shell atmosphere assumed in the version 1 algorithm, may also limit the quality of the retrieved aerosol extinction profiles significantly.

Generalized Fourier analyses of the advection-diffusion equation - Part I: one-dimensional domains

NASA Astrophysics Data System (ADS)

Christon, Mark A.; Martinez, Mario J.; Voth, Thomas E.

2004-07-01

This paper presents a detailed multi-methods comparison of the spatial errors associated with finite difference, finite element and finite volume semi-discretizations of the scalar advection-diffusion equation. The errors are reported in terms of non-dimensional phase and group speed, discrete diffusivity, artificial diffusivity, and grid-induced anisotropy. It is demonstrated that Fourier analysis provides an automatic process for separating the discrete advective operator into its symmetric and skew-symmetric components and characterizing the spectral behaviour of each operator. For each of the numerical methods considered, asymptotic truncation error and resolution estimates are presented for the limiting cases of pure advection and pure diffusion. It is demonstrated that streamline upwind Petrov-Galerkin and its control-volume finite element analogue, the streamline upwind control-volume method, produce both an artificial diffusivity and a concomitant phase speed adjustment in addition to the usual semi-discrete artifacts observed in the phase speed, group speed and diffusivity. The Galerkin finite element method and its streamline upwind derivatives are shown to exhibit super-convergent behaviour in terms of phase and group speed when a consistent mass matrix is used in the formulation. In contrast, the CVFEM method and its streamline upwind derivatives yield strictly second-order behaviour. In Part II of this paper, we consider two-dimensional semi-discretizations of the advection-diffusion equation and also assess the affects of grid-induced anisotropy observed in the non-dimensional phase speed, and the discrete and artificial diffusivities. Although this work can only be considered a first step in a comprehensive multi-methods analysis and comparison, it serves to identify some of the relative strengths and weaknesses of multiple numerical methods in a common analysis framework. Published in 2004 by John Wiley & Sons, Ltd.

Numerical solution of the electron transport equation

NASA Astrophysics Data System (ADS)

Woods, Mark

The electron transport equation has been solved many times for a variety of reasons. The main difficulty in its numerical solution is that it is a very stiff boundary value problem. The most common numerical methods for solving boundary value problems are symmetric collocation methods and shooting methods. Both of these types of methods can only be applied to the electron transport equation if the boundary conditions are altered with unrealistic assumptions because they require too many points to be practical. Further, they result in oscillating and negative solutions, which are physically meaningless for the problem at hand. For these reasons, all numerical methods for this problem to date are a bit unusual because they were designed to try and avoid the problem of extreme stiffness. This dissertation shows that there is no need to introduce spurious boundary conditions or invent other numerical methods for the electron transport equation. Rather, there already exists methods for very stiff boundary value problems within the numerical analysis literature. We demonstrate one such method in which the fast and slow modes of the boundary value problem are essentially decoupled. This allows for an upwind finite difference method to be applied to each mode as is appropriate. This greatly reduces the number of points needed in the mesh, and we demonstrate how this eliminates the need to define new boundary conditions. This method is verified by showing that under certain restrictive assumptions, the electron transport equation has an exact solution that can be written as an integral. We show that the solution from the upwind method agrees with the quadrature evaluation of the exact solution. This serves to verify that the upwind method is properly solving the electron transport equation. Further, it is demonstrated that the output of the upwind method can be used to compute auroral light emissions.

Atmospheric turbulence affects wind turbine nacelle transferfunctions

DOE Office of Scientific and Technical Information (OSTI.GOV)

St. Martin, Clara M.; Lundquist, Julie K.; Clifton, Andrew

Despite their potential as a valuable source of individual turbine power performance and turbine array energy production optimization information, nacelle-mounted anemometers have often been neglected because complex flows around the blades and nacelle interfere with their measurements. This work quantitatively explores the accuracy of and potential corrections to nacelle anemometer measurements to determine the degree to which they may be useful when corrected for these complex flows, particularly for calculating annual energy production (AEP) in the absence of other meteorological data. Using upwind meteorological tower measurements along with nacelle-based measurements from a General Electric (GE) 1.5sle model, we calculate empiricalmore » nacelle transfer functions (NTFs) and explore how they are impacted by different atmospheric and turbulence parameters. This work provides guidelines for the use of NTFs for deriving useful wind measurements from nacelle-mounted anemometers. Corrections to the nacelle anemometer wind speed measurements can be made with NTFs and used to calculate an AEP that comes within 1 % of an AEP calculated with upwind measurements. We also calculate unique NTFs for different atmospheric conditions defined by temperature stratification as well as turbulence intensity, turbulence kinetic energy, and wind shear. During periods of low stability as defined by the Bulk Richardson number ( RB), the nacelle-mounted anemometer underestimates the upwind wind speed more than during periods of high stability at some wind speed bins below rated speed, leading to a more steep NTF during periods of low stability. Similarly, during periods of high turbulence, the nacelle-mounted anemometer underestimates the upwind wind speed more than during periods of low turbulence at most wind bins between cut-in and rated wind speed. Based on these results, we suggest different NTFs be calculated for different regimes of atmospheric stability and turbulence for power performance validation purposes.« less

Accurate upwind methods for the Euler equations

NASA Technical Reports Server (NTRS)

Huynh, Hung T.

1993-01-01

A new class of piecewise linear methods for the numerical solution of the one-dimensional Euler equations of gas dynamics is presented. These methods are uniformly second-order accurate, and can be considered as extensions of Godunov's scheme. With an appropriate definition of monotonicity preservation for the case of linear convection, it can be shown that they preserve monotonicity. Similar to Van Leer's MUSCL scheme, they consist of two key steps: a reconstruction step followed by an upwind step. For the reconstruction step, a monotonicity constraint that preserves uniform second-order accuracy is introduced. Computational efficiency is enhanced by devising a criterion that detects the 'smooth' part of the data where the constraint is redundant. The concept and coding of the constraint are simplified by the use of the median function. A slope steepening technique, which has no effect at smooth regions and can resolve a contact discontinuity in four cells, is described. As for the upwind step, existing and new methods are applied in a manner slightly different from those in the literature. These methods are derived by approximating the Euler equations via linearization and diagonalization. At a 'smooth' interface, Harten, Lax, and Van Leer's one intermediate state model is employed. A modification for this model that can resolve contact discontinuities is presented. Near a discontinuity, either this modified model or a more accurate one, namely, Roe's flux-difference splitting. is used. The current presentation of Roe's method, via the conceptually simple flux-vector splitting, not only establishes a connection between the two splittings, but also leads to an admissibility correction with no conditional statement, and an efficient approximation to Osher's approximate Riemann solver. These reconstruction and upwind steps result in schemes that are uniformly second-order accurate and economical at smooth regions, and yield high resolution at discontinuities.

Exploration of Extended-Area Treatment Effects in FACE-2 Using Satellite Imagery.

NASA Astrophysics Data System (ADS)

Meití, José G.; Woodley, William L.; Flueck, John A.

1984-01-01

The second phase of the Florida Area Cumulus Experiment (FACE-2) has been completed and an exploratory analysis has been conducted to investigate the possibility that cloud seeding may have affected the rainfall outside the intended target. Rainfall was estimated over a 3.5×105 km2 area centered on the target using geosynchronous, infrared satellite imagery and the Griffith-Woodley rain estimation technique. This technique was derived in South Florida by calibrating infrared images using raingage and radar observations to produce an empirical, diagnostic (a posteriori), satellite rain estimation technique. The satellite rain estimates for the extended area were adjusted based on comparisons of raingage and satellite rainfall estimates for the entire FACE target (1.3×104 km2). All daily rainfall estimates were composited in two ways: 1) in the original coordinate system and 2) in a relative coordinate system that rotates the research area as a function of wind direction. After compositing, seeding effects were sought as a function of space and time.The results show more rainfall (in the mean) on seed than no seed days both in and downwind of the target but lesser rainfall upwind. All differences (averaging 20% downwind and 10% upwind) are confined in space to within 200 km of the center of the FACE target and in time to the 8 h period after initial treatment. In addition, the positive correlation between untreated upwind rainfall and target rainfall is degraded on seed days, suggesting possible intermittent negative effects of seeding upwind. Although the development of these differences in space and time suggests that seeding may have been partially responsible for their generation, the results do not have strong inferential (P-value) support.

Low-frequency coherent motions within the spruce canopy on the upwind vs. downwind side of a forested ridge

NASA Astrophysics Data System (ADS)

Potužníková, K.; Sedlák, P.; Šauli, P.

2009-09-01

Airflow and turbulence within and above the forest canopy determine the forest - atmosphere exchange of atmospheric constituents and pollutants. Our investigation is related to the existence of large-scale intermittent coherent structures, which have been detected in turbulence time series measured at the Experimental Ecological Study Site Bílý Kříž (800-900 m a.s.l.) in the Czech Republic. The site is situated on a steep (13°) SSW-faced slope near the top of a mountain ridge forested by a young Norway spruce plantation. Flow directions across the ridge (along the slope) strongly prevail at the site. Results based on a recent study reveal significant differences between the cases when the site is on the upwind vs. downwind side of the ridge. Typical downwind cases are characterized by a low wind speed above the canopy and by relatively higher friction velocity than in the upwind cases. This is explained by the flow retardation by the upslope-directed hydrodynamic pressure gradient and by the large wind shear in the upper part of the wake behind the ridge top. This contribution concentrates on the vertical coherency of the turbulent flow within the forest canopy. Analysed variables include the high-frequency wind velocity components and sonic temperature measured during periods of neutral thermal stratification at two different levels. Wavelet analysis was used for detection of characteristic temporal scale of coherent structures, their persistence and effectivity parameter. Special attention is paid to the differences between the upwind and downwind cases. Acknowledgements: The study is supported by the grant IAA300420803 and IAA300420704 from Grant Agency of Academy of Sciences of the Czech Republic.

Atmospheric turbulence affects wind turbine nacelle transferfunctions

DOE PAGES

St. Martin, Clara M.; Lundquist, Julie K.; Clifton, Andrew; ...

2017-06-02

Despite their potential as a valuable source of individual turbine power performance and turbine array energy production optimization information, nacelle-mounted anemometers have often been neglected because complex flows around the blades and nacelle interfere with their measurements. This work quantitatively explores the accuracy of and potential corrections to nacelle anemometer measurements to determine the degree to which they may be useful when corrected for these complex flows, particularly for calculating annual energy production (AEP) in the absence of other meteorological data. Using upwind meteorological tower measurements along with nacelle-based measurements from a General Electric (GE) 1.5sle model, we calculate empiricalmore » nacelle transfer functions (NTFs) and explore how they are impacted by different atmospheric and turbulence parameters. This work provides guidelines for the use of NTFs for deriving useful wind measurements from nacelle-mounted anemometers. Corrections to the nacelle anemometer wind speed measurements can be made with NTFs and used to calculate an AEP that comes within 1 % of an AEP calculated with upwind measurements. We also calculate unique NTFs for different atmospheric conditions defined by temperature stratification as well as turbulence intensity, turbulence kinetic energy, and wind shear. During periods of low stability as defined by the Bulk Richardson number ( RB), the nacelle-mounted anemometer underestimates the upwind wind speed more than during periods of high stability at some wind speed bins below rated speed, leading to a more steep NTF during periods of low stability. Similarly, during periods of high turbulence, the nacelle-mounted anemometer underestimates the upwind wind speed more than during periods of low turbulence at most wind bins between cut-in and rated wind speed. Based on these results, we suggest different NTFs be calculated for different regimes of atmospheric stability and turbulence for power performance validation purposes.« less

An efficient impedance method for induced field evaluation based on a stabilized Bi-conjugate gradient algorithm.

PubMed

Wang, Hua; Liu, Feng; Xia, Ling; Crozier, Stuart

2008-11-21

This paper presents a stabilized Bi-conjugate gradient algorithm (BiCGstab) that can significantly improve the performance of the impedance method, which has been widely applied to model low-frequency field induction phenomena in voxel phantoms. The improved impedance method offers remarkable computational advantages in terms of convergence performance and memory consumption over the conventional, successive over-relaxation (SOR)-based algorithm. The scheme has been validated against other numerical/analytical solutions on a lossy, multilayered sphere phantom excited by an ideal coil loop. To demonstrate the computational performance and application capability of the developed algorithm, the induced fields inside a human phantom due to a low-frequency hyperthermia device is evaluated. The simulation results show the numerical accuracy and superior performance of the method.

Solving the Cauchy-Riemann equations on parallel computers

NASA Technical Reports Server (NTRS)

Fatoohi, Raad A.; Grosch, Chester E.

1987-01-01

Discussed is the implementation of a single algorithm on three parallel-vector computers. The algorithm is a relaxation scheme for the solution of the Cauchy-Riemann equations; a set of coupled first order partial differential equations. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, and SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The machine architectures are briefly described. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Conclusions are presented.

Relaxation of sound fields in rooms of diffusely reflecting boundaries and its application in acoustical radiosity simulation.

PubMed

Zhang, Honghu

2006-04-01

The acoustical radiosity method is a computationally expensive acoustical simulation algorithm that assumes an enclosure with ideal diffuse reflecting boundaries. Miles observed that for such an enclosure, the sound energy decay of every point on the boundaries will gradually converge to exponential manner with a uniform decay rate. Therefore, the ratio of radiosity between every pair of points on the boundaries will converge to a constant, and the radiosity across the boundaries will approach a fixed distribution during the sound decay process, where radiosity is defined as the acoustic power per unit area leaving (or being received by) a point on a boundary. We call this phenomenon the "relaxation" of the sound field. In this paper, we study the relaxation in rooms of different shapes with different boundary absorptions. Criteria based on the relaxation of the sound field are proposed to terminate the costly and unnecessary radiosity computation in the later phase, which can then be replaced by a fast regression step to speed up the acoustical radiosity simulation.

Generation of Well-Relaxed All-Atom Models of Large Molecular Weight Polymer Melts: A Hybrid Particle-Continuum Approach Based on Particle-Field Molecular Dynamics Simulations.

PubMed

De Nicola, Antonio; Kawakatsu, Toshihiro; Milano, Giuseppe

2014-12-09

A procedure based on Molecular Dynamics (MD) simulations employing soft potentials derived from self-consistent field (SCF) theory (named MD-SCF) able to generate well-relaxed all-atom structures of polymer melts is proposed. All-atom structures having structural correlations indistinguishable from ones obtained by long MD relaxations have been obtained for poly(methyl methacrylate) (PMMA) and poly(ethylene oxide) (PEO) melts. The proposed procedure leads to computational costs mainly related on system size rather than to the chain length. Several advantages of the proposed procedure over current coarse-graining/reverse mapping strategies are apparent. No parametrization is needed to generate relaxed structures of different polymers at different scales or resolutions. There is no need for special algorithms or back-mapping schemes to change the resolution of the models. This characteristic makes the procedure general and its extension to other polymer architectures straightforward. A similar procedure can be easily extended to the generation of all-atom structures of block copolymer melts and polymer nanocomposites.

Real Gas Computation Using an Energy Relaxation Method and High-Order WENO Schemes

NASA Technical Reports Server (NTRS)

Montarnal, Philippe; Shu, Chi-Wang

1998-01-01

In this paper, we use a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition into two parts: one part is associated with a simpler pressure law and the other part (the nonlinear deviation) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the first part. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Algorithms for Mathematical Programming with Emphasis on Bi-level Models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldfarb, Donald; Iyengar, Garud

2014-05-22

The research supported by this grant was focused primarily on first-order methods for solving large scale and structured convex optimization problems and convex relaxations of nonconvex problems. These include optimal gradient methods, operator and variable splitting methods, alternating direction augmented Lagrangian methods, and block coordinate descent methods.

Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation

NASA Astrophysics Data System (ADS)

Chi, Yuejie

2017-08-01

We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.

A computational study of the discretization error in the solution of the Spencer-Lewis equation by doubling applied to the upwind finite-difference approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nelson, P.; Seth, D.L.; Ray, A.K.

A detailed and systematic study of the nature of the discretization error associated with the upwind finite-difference method is presented. A basic model problem has been identified and based upon the results for this problem, a basic hypothesis regarding the accuracy of the computational solution of the Spencer-Lewis equation is formulated. The basic hypothesis is then tested under various systematic single complexifications of the basic model problem. The results of these tests provide the framework of the refined hypothesis presented in the concluding comments. 27 refs., 3 figs., 14 tabs.

A rotationally biased upwind difference scheme for the Euler equations

NASA Technical Reports Server (NTRS)

Davis, S. F.

1983-01-01

The upwind difference schemes of Godunov, Osher, Roe and van Leer are able to resolve one dimensional steady shocks for the Euler equations within one or two mesh intervals. Unfortunately, this resolution is lost in two dimensions when the shock crosses the computing grid at an oblique angle. To correct this problem, a numerical scheme was developed which automatically locates the angle at which a shock might be expected to cross the computing grid and then constructs separate finite difference formulas for the flux components normal and tangential to this direction. Numerical results which illustrate the ability of this method to resolve steady oblique shocks are presented.

Upwind schemes and bifurcating solutions in real gas computations

NASA Technical Reports Server (NTRS)

Suresh, Ambady; Liou, Meng-Sing

1992-01-01

The area of high speed flow is seeing a renewed interest due to advanced propulsion concepts such as the National Aerospace Plane (NASP), Space Shuttle, and future civil transport concepts. Upwind schemes to solve such flows have become increasingly popular in the last decade due to their excellent shock capturing properties. In the first part of this paper the authors present the extension of the Osher scheme to equilibrium and non-equilibrium gases. For simplicity, the source terms are treated explicitly. Computations based on the above scheme are presented to demonstrate the feasibility, accuracy and efficiency of the proposed scheme. One of the test problems is a Chapman-Jouguet detonation problem for which numerical solutions have been known to bifurcate into spurious weak detonation solutions on coarse grids. Results indicate that the numerical solution obtained depends both on the upwinding scheme used and the limiter employed to obtain second order accuracy. For example, the Osher scheme gives the correct CJ solution when the super-bee limiter is used, but gives the spurious solution when the Van Leer limiter is used. With the Roe scheme the spurious solution is obtained for all limiters.

Analysis and design of numerical schemes for gas dynamics 1: Artificial diffusion, upwind biasing, limiters and their effect on accuracy and multigrid convergence

NASA Technical Reports Server (NTRS)

Jameson, Antony

1994-01-01

The theory of non-oscillatory scalar schemes is developed in this paper in terms of the local extremum diminishing (LED) principle that maxima should not increase and minima should not decrease. This principle can be used for multi-dimensional problems on both structured and unstructured meshes, while it is equivalent to the total variation diminishing (TVD) principle for one-dimensional problems. A new formulation of symmetric limited positive (SLIP) schemes is presented, which can be generalized to produce schemes with arbitrary high order of accuracy in regions where the solution contains no extrema, and which can also be implemented on multi-dimensional unstructured meshes. Systems of equations lead to waves traveling with distinct speeds and possibly in opposite directions. Alternative treatments using characteristic splitting and scalar diffusive fluxes are examined, together with modification of the scalar diffusion through the addition of pressure differences to the momentum equations to produce full upwinding in supersonic flow. This convective upwind and split pressure (CUSP) scheme exhibits very rapid convergence in multigrid calculations of transonic flow, and provides excellent shock resolution at very high Mach numbers.

Numerical experiments with a symmetric high-resolution shock-capturing scheme

NASA Technical Reports Server (NTRS)

Yee, H. C.

1986-01-01

Characteristic-based explicit and implicit total variation diminishing (TVD) schemes for the two-dimensional compressible Euler equations have recently been developed. This is a generalization of recent work of Roe and Davis to a wider class of symmetric (non-upwind) TVD schemes other than Lax-Wendroff. The Roe and Davis schemes can be viewed as a subset of the class of explicit methods. The main properties of the present class of schemes are that they can be implicit, and, when steady-state calculations are sought, the numerical solution is independent of the time step. In a recent paper, a comparison of a linearized form of the present implicit symmetric TVD scheme with an implicit upwind TVD scheme originally developed by Harten and modified by Yee was given. Results favored the symmetric method. It was found that the latter is just as accurate as the upwind method while requiring less computational effort. Currently, more numerical experiments are being conducted on time-accurate calculations and on the effect of grid topology, numerical boundary condition procedures, and different flow conditions on the behavior of the method for steady-state applications. The purpose here is to report experiences with this type of scheme and give guidelines for its use.

A new family of high-order compact upwind difference schemes with good spectral resolution

NASA Astrophysics Data System (ADS)

Zhou, Qiang; Yao, Zhaohui; He, Feng; Shen, M. Y.

2007-12-01

This paper presents a new family of high-order compact upwind difference schemes. Unknowns included in the proposed schemes are not only the values of the function but also those of its first and higher derivatives. Derivative terms in the schemes appear only on the upwind side of the stencil. One can calculate all the first derivatives exactly as one solves explicit schemes when the boundary conditions of the problem are non-periodic. When the proposed schemes are applied to periodic problems, only periodic bi-diagonal matrix inversions or periodic block-bi-diagonal matrix inversions are required. Resolution optimization is used to enhance the spectral representation of the first derivative, and this produces a scheme with the highest spectral accuracy among all known compact schemes. For non-periodic boundary conditions, boundary schemes constructed in virtue of the assistant scheme make the schemes not only possess stability for any selective length scale on every point in the computational domain but also satisfy the principle of optimal resolution. Also, an improved shock-capturing method is developed. Finally, both the effectiveness of the new hybrid method and the accuracy of the proposed schemes are verified by executing four benchmark test cases.

Temporal patterns of physical activity in Olympic dinghy racing.

PubMed

Legg, S; Mackie, H; Smith, P

1999-12-01

The objective of the present study was to determine the temporal patterns of physical activity in four classes of Olympic racing dinghy. Descriptive. A field (on-water) study. Nineteen elite New Zealand sailors (fifteen male and four female). Not applicable. The temporal pattern (duration and frequency) and nature of the physical activities of each sailor during each leg of simulated races were recorded on video tape and subsequently systematically quantified and categorised using notational analysis. The accumulated percentage of total leg time spent sitting (upright or leaning backwards), hiking (upright or fully extended) whilst trimming and whilst pumping the mainsheet and for the time spent on rig adjustments, tacking and gybing were calculated for both up-wind and off-wind sailing. When sailing up-wind, the most time was spent hiking upright (average 29-66% of total leg time) while trimming the mainsheet. During off-wind sailing, sailors spent the most time sitting upright while trimming the mainsheet (average 29-55% total leg time). Hiking upright while trimming the mainsheet was executed the greatest number of times (average 15.8-23.9) when sailing up-wind and sitting upright while trimming was executed the most times (average 3.5-7.4) when sailing off-wind. The most lengthy continuous activity was hiking upright while trimming the mainsheet when sailing up-wind (9-18 seconds) and sitting upright while trimming the mainsheet when sailing off-wind (17-34 seconds). The most physically demanding aspect of Olympic yacht racing is hiking. It occurs for the majority of up-wind legs when the wind starts to exceed approximately 8 knots. The only respite that the sailor gets from hiking is during tacking, rig adjustments or sitting in-board for brief periods when the wind is low. Sustained hiking tends to last for no more than approximately 20 seconds before the sailor changes to either a more extended or more upright hiking posture. The physical demands during off-wind sailing are generally less, except for a greater requirement for power in the arms and shoulders to pump the mainsheet in order to assist the dinghy in accelerating down waves. The findings of the present study are directly applicable to the design of sailing specific physical conditioning programmes for Olympic class sailors.

Did municipal solid waste landfill have obvious influence on polychlorinated dibenzo-p-dioxins and polychlorinated dibenzofurans (PCDD/Fs) in ambient air: A case study in East China.

PubMed

Li, Jiafu; Wang, Chong; Du, Lei; Lv, Zhiwei; Li, Xiaonan; Hu, Xuepeng; Niu, Zhiguang; Zhang, Ying

2017-04-01

Municipal solid waste (MSW) landfill was a main way to disposal of MSW and almost 95% of MSW was disposed by landfills in the world. In order to understand the influence of MSW landfill on polychlorinated dibenzo-p-dioxins and polychlorinated dibenzofurans (PCDD/Fs) in surrounding atmosphere, 42 ambient air samples were collected and analyzed from surrounding sites, background site, upwind site and downwind site of a MSW landfill in East China. The results of present study were summarized as follows. (1) The total concentrations of PCDD/Fs (∑PCDD/Fs) in ambient air from surrounding sites, background site, upwind site and downwind site were 2.215±1.004, 2.058±0.458, 2.617±1.092 and 1.822±0.566pgNm -3 , respectively. (2) The toxic equivalent concentrations (TEQ) of PCDD/Fs in ambient air from surrounding sites, background site, upwind site and downwind site were 0.103±0.017, 0.096±0.015, 0.120±0.024 and 0.108±0.014pg I-TEQNm -3 , respectively. (3) The congener profiles, ∑PCDD/Fs and TEQ between background atmosphere and surrounding atmosphere of landfill did not show statistically significant difference. (4) The ∑PCDD/Fs and TEQ in ambient air of downwind site were not higher than that of upwind site, suggesting that studied landfill did not have obvious influence on PCDD/Fs in ambient air from downwind site. (5) The 95th percentile carcinogenic risk (CR) of PCDD/Fs in ambient air from surrounding sites, background site, upwind site and downwind site were 8.03×10 -9 , 7.57×10 -9 , 9.69×10 -9 and 8.15×10 -9 , respectively, which were much lower than the threshold value of CR (10 -6 ), suggesting that studied landfill did not influence the CR of PCDD/Fs in surrounding atmosphere and negligible cancer risk occurred. (6) The non-carcinogenic risk (non-CR) analysis indicated that landfill did not have influence on the non-CR of PCDD/Fs in surrounding atmosphere and no obvious non-carcinogenic effects developed. Copyright © 2017 Elsevier Ltd. All rights reserved.

Aerodynamic Shape Sensitivity Analysis and Design Optimization of Complex Configurations Using Unstructured Grids

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Newman, James C., III; Barnwell, Richard W.

1997-01-01

A three-dimensional unstructured grid approach to aerodynamic shape sensitivity analysis and design optimization has been developed and is extended to model geometrically complex configurations. The advantage of unstructured grids (when compared with a structured-grid approach) is their inherent ability to discretize irregularly shaped domains with greater efficiency and less effort. Hence, this approach is ideally suited for geometrically complex configurations of practical interest. In this work the nonlinear Euler equations are solved using an upwind, cell-centered, finite-volume scheme. The discrete, linearized systems which result from this scheme are solved iteratively by a preconditioned conjugate-gradient-like algorithm known as GMRES for the two-dimensional geometry and a Gauss-Seidel algorithm for the three-dimensional; similar procedures are used to solve the accompanying linear aerodynamic sensitivity equations in incremental iterative form. As shown, this particular form of the sensitivity equation makes large-scale gradient-based aerodynamic optimization possible by taking advantage of memory efficient methods to construct exact Jacobian matrix-vector products. Simple parameterization techniques are utilized for demonstrative purposes. Once the surface has been deformed, the unstructured grid is adapted by considering the mesh as a system of interconnected springs. Grid sensitivities are obtained by differentiating the surface parameterization and the grid adaptation algorithms with ADIFOR (which is an advanced automatic-differentiation software tool). To demonstrate the ability of this procedure to analyze and design complex configurations of practical interest, the sensitivity analysis and shape optimization has been performed for a two-dimensional high-lift multielement airfoil and for a three-dimensional Boeing 747-200 aircraft.

Cost-effective accurate coarse-grid method for highly convective multidimensional unsteady flows

NASA Technical Reports Server (NTRS)

Leonard, B. P.; Niknafs, H. S.

1991-01-01

A fundamentally multidimensional convection scheme is described based on vector transient interpolation modeling rewritten in conservative control-volume form. Vector third-order upwinding is used as the basis of the algorithm; this automatically introduces important cross-difference terms that are absent from schemes using component-wise one-dimensional formulas. Third-order phase accuracy is good; this is important for coarse-grid large-eddy or full simulation. Potential overshoots or undershoots are avoided by using a recently developed universal limiter. Higher order accuracy is obtained locally, where needed, by the cost-effective strategy of adaptive stencil expansion in a direction normal to each control-volume face; this is controlled by monitoring the absolute normal gradient and curvature across the face. Higher (than third) order cross-terms do not appear to be needed. Since the wider stencil is used only in isolated narrow regions (near discontinuities), extremely high (in this case, seventh) order accuracy can be achieved for little more than the cost of a globally third-order scheme.

Lagrangian particle method for compressible fluid dynamics

NASA Astrophysics Data System (ADS)

Samulyak, Roman; Wang, Xingyu; Chen, Hsin-Chiang

2018-06-01

A new Lagrangian particle method for solving Euler equations for compressible inviscid fluid or gas flows is proposed. Similar to smoothed particle hydrodynamics (SPH), the method represents fluid cells with Lagrangian particles and is suitable for the simulation of complex free surface/multiphase flows. The main contributions of our method, which is different from SPH in all other aspects, are (a) significant improvement of approximation of differential operators based on a polynomial fit via weighted least squares approximation and the convergence of prescribed order, (b) a second-order particle-based algorithm that reduces to the first-order upwind method at local extremal points, providing accuracy and long term stability, and (c) more accurate resolution of entropy discontinuities and states at free interfaces. While the method is consistent and convergent to a prescribed order, the conservation of momentum and energy is not exact and depends on the convergence order. The method is generalizable to coupled hyperbolic-elliptic systems. Numerical verification tests demonstrating the convergence order are presented as well as examples of complex multiphase flows.

CFD analyses of combustor and nozzle flowfields

NASA Astrophysics Data System (ADS)

Tsuei, Hsin-Hua; Merkle, Charles L.

1993-11-01

The objectives of the research are to improve design capabilities for low thrust rocket engines through understanding of the detailed mixing and combustion processes. A Computational Fluid Dynamic (CFD) technique is employed to model the flowfields within the combustor, nozzle, and near plume field. The computational modeling of the rocket engine flowfields requires the application of the complete Navier-Stokes equations, coupled with species diffusion equations. Of particular interest is a small gaseous hydrogen-oxygen thruster which is considered as a coordinated part of an ongoing experimental program at NASA LeRC. The numerical procedure is performed on both time-marching and time-accurate algorithms, using an LU approximate factorization in time, flux split upwinding differencing in space. The integrity of fuel film cooling along the wall, its effectiveness in the mixing with the core flow including unsteady large scale effects, the resultant impact on performance and the assessment of the near plume flow expansion to finite pressure altitude chamber are addressed.

Calculations of separated 3-D flows with a pressure-staggered Navier-Stokes equations solver

NASA Technical Reports Server (NTRS)

Kim, S.-W.

1991-01-01

A Navier-Stokes equations solver based on a pressure correction method with a pressure-staggered mesh and calculations of separated three-dimensional flows are presented. It is shown that the velocity pressure decoupling, which occurs when various pressure correction algorithms are used for pressure-staggered meshes, is caused by the ill-conditioned discrete pressure correction equation. The use of a partial differential equation for the incremental pressure eliminates the velocity pressure decoupling mechanism by itself and yields accurate numerical results. Example flows considered are a three-dimensional lid driven cavity flow and a laminar flow through a 90 degree bend square duct. For the lid driven cavity flow, the present numerical results compare more favorably with the measured data than those obtained using a formally third order accurate quadratic upwind interpolation scheme. For the curved duct flow, the present numerical method yields a grid independent solution with a very small number of grid points. The calculated velocity profiles are in good agreement with the measured data.

A multigrid solver for the semiconductor equations

NASA Technical Reports Server (NTRS)

Bachmann, Bernhard

1993-01-01

We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.

Structure of the two-dimensional relaxation spectra seen within the eigenmode perturbation theory and the two-site exchange model.

PubMed

Bytchenkoff, Dimitri; Rodts, Stéphane

2011-01-01

The form of the two-dimensional (2D) NMR-relaxation spectra--which allow to study interstitial fluid dynamics in diffusive systems by correlating spin-lattice (T(1)) and spin-spin (T(2)) relaxation times--has given rise to numerous conjectures. Herein we find analytically a number of fundamental structural properties of the spectra: within the eigen-modes formalism, we establish relationships between the signs and intensities of the diagonal and cross-peaks in spectra obtained by various 1 and 2D NMR-relaxation techniques, reveal symmetries of the spectra and uncover interdependence between them. We investigate more specifically a practically important case of porous system that has sets of T(1)- and T(2)-eigenmodes and eigentimes similar to each other by applying the perturbation theory. Furthermore we provide a comparative analysis of the application of the, mathematically more rigorous, eigen-modes formalism and the, rather more phenomenological, first-order two-site exchange model to diffusive systems. Finally we put the results that we could formulate analytically to the test by comparing them with computer-simulations for 2D porous model systems. The structural properties, in general, are to provide useful clues for assignment and analysis of relaxation spectra. The most striking of them--the presence of negative peaks--underlines an urgent need for improvement of the current 2D Inverse Laplace Transform (ILT) algorithm used for calculation of relaxation spectra from NMR raw data. Copyright © 2010 Elsevier Inc. All rights reserved.

Proposed algorithm for determining the delta intercept of a thermocouple psychrometer curve

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurzmack, M.A.

1993-07-01

The USGS Hydrologic Investigations Program is currently developing instrumentation to study the unsaturated zone at Yucca Mountain in Nevada. Surface-based boreholes up to 2,500 feet in depth will be drilled, and then instrumented in order to define the water potential field within the unsaturated zone. Thermocouple psychrometers will be used to monitor the in-situ water potential. An algorithm is proposed for simply and efficiently reducing a six wire thermocouple psychrometer voltage output curve to a single value, the delta intercept. The algorithm identifies a plateau region in the psychrometer curve and extrapolates a linear regression back to the initial startmore » of relaxation. When properly conditioned for the measurements being made, the algorithm results in reasonable results even with incomplete or noisy psychrometer curves over a 1 to 60 bar range.« less

The Quality Control Algorithms Used in the Creation of NASA Kennedy Space Center Lightning Protection System Towers Meteorological Database

NASA Technical Reports Server (NTRS)

Orcutt, John M.; Brenton, James C.

2016-01-01

An accurate database of meteorological data is essential for designing any aerospace vehicle and for preparing launch commit criteria. Meteorological instrumentation were recently placed on the three Lightning Protection System (LPS) towers at Kennedy Space Center (KSC) launch complex 39B (LC-39B), which provide a unique meteorological dataset existing at the launch complex over an extensive altitude range. Data records of temperature, dew point, relative humidity, wind speed, and wind direction are produced at 40, 78, 116, and 139 m at each tower. The Marshall Space Flight Center Natural Environments Branch (EV44) received an archive that consists of one-minute averaged measurements for the period of record of January 2011 - April 2015. However, before the received database could be used EV44 needed to remove any erroneous data from within the database through a comprehensive quality control (QC) process. The QC process applied to the LPS towers' meteorological data is similar to other QC processes developed by EV44, which were used in the creation of meteorological databases for other towers at KSC. The QC process utilized in this study has been modified specifically for use with the LPS tower database. The QC process first includes a check of each individual sensor. This check includes removing any unrealistic data and checking the temporal consistency of each variable. Next, data from all three sensors at each height are checked against each other, checked against climatology, and checked for sensors that erroneously report a constant value. Then, a vertical consistency check of each variable at each tower is completed. Last, the upwind sensor at each level is selected to minimize the influence of the towers and other structures at LC-39B on the measurements. The selection process for the upwind sensor implemented a study of tower-induced turbulence. This paper describes in detail the QC process, QC results, and the attributes of the LPS towers meteorological database.

How Does Relaxing the Algorithm for Autism Affect DSM-V Prevalence Rates?

ERIC Educational Resources Information Center

Matson, Johnny L.; Hattier, Megan A.; Williams, Lindsey W.

2012-01-01

Although it is still unclear what causes autism spectrum disorders (ASDs), over time researchers and clinicians have become more precise with detecting and diagnosing ASD. Many diagnoses, however, are based on the criteria established within the "Diagnostic and Statistical Manual of Mental Disorders" ("DSM"); thus, any change in these diagnostic…

Measurement of the Exchange Rate of Waters of Hydration in Elastin by 2D T(2)-T(2) Correlation Nuclear Magnetic Resonance Spectroscopy.

PubMed

Sun, Cheng; Boutis, Gregory S

2011-02-28

We report on the direct measurement of the exchange rate of waters of hydration in elastin by T(2)-T(2) exchange spectroscopy. The exchange rates in bovine nuchal ligament elastin and aortic elastin at temperatures near, below and at the physiological temperature are reported. Using an Inverse Laplace Transform (ILT) algorithm, we are able to identify four components in the relaxation times. While three of the components are in good agreement with previous measurements that used multi-exponential fitting, the ILT algorithm distinguishes a fourth component having relaxation times close to that of free water and is identified as water between fibers. With the aid of scanning electron microscopy, a model is proposed allowing for the application of a two-site exchange analysis between any two components for the determination of exchange rates between reservoirs. The results of the measurements support a model (described elsewhere [1]) wherein the net entropy of bulk waters of hydration should increase upon increasing temperature in the inverse temperature transition.

Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

NASA Astrophysics Data System (ADS)

Scutari, Gesualdo; Facchinei, Francisco; Lampariello, Lorenzo

2017-04-01

In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell environment. We develop a new class of algorithms enjoying the following distinctive features: i) they are \\emph{distributed} across the base stations (with limited signaling) and lead to subproblems whose solutions are computable in closed form; and ii) differently from current relaxation-based schemes (e.g., semidefinite relaxation), they are proved to always converge to d-stationary solutions of the aforementioned class of nonconvex problems. Numerical results show that the proposed (distributed) schemes achieve larger worst-case rates (resp. signal-to-noise interference ratios) than state-of-the-art centralized ones while having comparable computational complexity.

Dependence of calculated postshock thermodynamic variables on vibrational equilibrium and input uncertainty

DOE Office of Scientific and Technical Information (OSTI.GOV)

Campbell, Matthew Frederick; Owen, Kyle G.; Davidson, David F.

The purpose of this article is to explore the dependence of calculated postshock thermodynamic properties in shock tube experiments upon the vibrational state of the test gas and upon the uncertainties inherent to calculation inputs. This paper first offers a comparison between state variables calculated according to a Rankine–Hugoniot–equation-based algorithm, known as FROSH, and those derived from shock tube experiments on vibrationally nonequilibrated gases. It is shown that incorrect vibrational relaxation assumptions could lead to errors in temperature as large as 8% for 25% oxygen/argon mixtures at 3500 K. Following this demonstration, this article employs the algorithm to show themore » importance of correct vibrational equilibration assumptions, noting, for instance, that errors in temperature of up to about 2% at 3500 K may be generated for 10% nitrogen/argon mixtures if vibrational relaxation is not treated properly. Lastly, this article presents an extensive uncertainty analysis, showing that postshock temperatures can be calculated with root-of-sum-of-square errors of better than ±1% given sufficiently accurate experimentally measured input parameters.« less

Dependence of calculated postshock thermodynamic variables on vibrational equilibrium and input uncertainty

DOE PAGES

Campbell, Matthew Frederick; Owen, Kyle G.; Davidson, David F.; ...

2017-01-30

The purpose of this article is to explore the dependence of calculated postshock thermodynamic properties in shock tube experiments upon the vibrational state of the test gas and upon the uncertainties inherent to calculation inputs. This paper first offers a comparison between state variables calculated according to a Rankine–Hugoniot–equation-based algorithm, known as FROSH, and those derived from shock tube experiments on vibrationally nonequilibrated gases. It is shown that incorrect vibrational relaxation assumptions could lead to errors in temperature as large as 8% for 25% oxygen/argon mixtures at 3500 K. Following this demonstration, this article employs the algorithm to show themore » importance of correct vibrational equilibration assumptions, noting, for instance, that errors in temperature of up to about 2% at 3500 K may be generated for 10% nitrogen/argon mixtures if vibrational relaxation is not treated properly. Lastly, this article presents an extensive uncertainty analysis, showing that postshock temperatures can be calculated with root-of-sum-of-square errors of better than ±1% given sufficiently accurate experimentally measured input parameters.« less

A meta-cognitive learning algorithm for a Fully Complex-valued Relaxation Network.

PubMed

Savitha, R; Suresh, S; Sundararajan, N

2012-08-01

This paper presents a meta-cognitive learning algorithm for a single hidden layer complex-valued neural network called "Meta-cognitive Fully Complex-valued Relaxation Network (McFCRN)". McFCRN has two components: a cognitive component and a meta-cognitive component. A Fully Complex-valued Relaxation Network (FCRN) with a fully complex-valued Gaussian like activation function (sech) in the hidden layer and an exponential activation function in the output layer forms the cognitive component. The meta-cognitive component contains a self-regulatory learning mechanism which controls the learning ability of FCRN by deciding what-to-learn, when-to-learn and how-to-learn from a sequence of training data. The input parameters of cognitive components are chosen randomly and the output parameters are estimated by minimizing a logarithmic error function. The problem of explicit minimization of magnitude and phase errors in the logarithmic error function is converted to system of linear equations and output parameters of FCRN are computed analytically. McFCRN starts with zero hidden neuron and builds the number of neurons required to approximate the target function. The meta-cognitive component selects the best learning strategy for FCRN to acquire the knowledge from training data and also adapts the learning strategies to implement best human learning components. Performance studies on a function approximation and real-valued classification problems show that proposed McFCRN performs better than the existing results reported in the literature. Copyright © 2012 Elsevier Ltd. All rights reserved.

A New Method for Determining Structure Ensemble: Application to a RNA Binding Di-Domain Protein.

PubMed

Liu, Wei; Zhang, Jingfeng; Fan, Jing-Song; Tria, Giancarlo; Grüber, Gerhard; Yang, Daiwen

2016-05-10

Structure ensemble determination is the basis of understanding the structure-function relationship of a multidomain protein with weak domain-domain interactions. Paramagnetic relaxation enhancement has been proven a powerful tool in the study of structure ensembles, but there exist a number of challenges such as spin-label flexibility, domain dynamics, and overfitting. Here we propose a new (to our knowledge) method to describe structure ensembles using a minimal number of conformers. In this method, individual domains are considered rigid; the position of each spin-label conformer and the structure of each protein conformer are defined by three and six orthogonal parameters, respectively. First, the spin-label ensemble is determined by optimizing the positions and populations of spin-label conformers against intradomain paramagnetic relaxation enhancements with a genetic algorithm. Subsequently, the protein structure ensemble is optimized using a more efficient genetic algorithm-based approach and an overfitting indicator, both of which were established in this work. The method was validated using a reference ensemble with a set of conformers whose populations and structures are known. This method was also applied to study the structure ensemble of the tandem di-domain of a poly (U) binding protein. The determined ensemble was supported by small-angle x-ray scattering and nuclear magnetic resonance relaxation data. The ensemble obtained suggests an induced fit mechanism for recognition of target RNA by the protein. Copyright © 2016 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Shape effects on time-scale divergence at athermal jamming transition of frictionless non-spherical particles

NASA Astrophysics Data System (ADS)

Yuan, Ye; Jin, Weiwei; Liu, Lufeng; Li, Shuixiang

2017-10-01

The critical behaviors of a granular system at the jamming transition have been extensively studied from both mechanical and thermodynamic perspectives. In this work, we numerically investigate the jamming behaviors of a variety of frictionless non-spherical particles, including spherocylinder, ellipsoid, spherotetrahedron and spherocube. In particular, for a given particle shape, a series of random configurations at different fixed densities are generated and relaxed to minimize interparticle overlaps using the relaxation algorithm. We find that as the jamming point (i.e., point J) is approached, the number of iteration steps (defined as the "time-scale" for our systems) required to completely relax the interparticle overlaps exhibits a clear power-law divergence. The dependence of the detailed mathematical form of the power-law divergence on particle shapes is systematically investigated and elucidated, which suggests that the shape effects can be generally categorized as elongation and roundness. Importantly, we show the jamming transition density can be accurately determined from the analysis of time-scale divergence for different non-spherical shapes, and the obtained values agree very well with corresponding ones reported in literature. Moreover, we study the plastic behaviors of over-jammed packings of different particles under a compression-expansion procedure and find that the jamming of ellipsoid is much more robust than other non-spherical particles. This work offers an alternative approximate procedure besides conventional packing algorithms for studying athermal jamming transition in granular system of frictionless non-spherical particles.

Graph cuts with invariant object-interaction priors: application to intervertebral disc segmentation.

PubMed

Ben Ayed, Ismail; Punithakumar, Kumaradevan; Garvin, Gregory; Romano, Walter; Li, Shuo

2011-01-01

This study investigates novel object-interaction priors for graph cut image segmentation with application to intervertebral disc delineation in magnetic resonance (MR) lumbar spine images. The algorithm optimizes an original cost function which constrains the solution with learned prior knowledge about the geometric interactions between different objects in the image. Based on a global measure of similarity between distributions, the proposed priors are intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive an original fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed priors relax the need of costly pose estimation (or registration) procedures and large training sets (we used a single subject for training), and can tolerate shape deformations, unlike template-based priors. Our formulation leads to an NP-hard problem which does not afford a form directly amenable to graph cut optimization. We proceeded to a relaxation of the problem via an auxiliary function, thereby obtaining a nearly real-time solution with few graph cuts. Quantitative evaluations over 60 intervertebral discs acquired from 10 subjects demonstrated that the proposed algorithm yields a high correlation with independent manual segmentations by an expert. We further demonstrate experimentally the invariance of the proposed geometric attributes. This supports the fact that a single subject is sufficient for training our algorithm, and confirms the relevance of the proposed priors to disc segmentation.

Dense-HOG-based drift-reduced 3D face tracking for infant pain monitoring

NASA Astrophysics Data System (ADS)

Saeijs, Ronald W. J. J.; Tjon A Ten, Walther E.; de With, Peter H. N.

2017-03-01

This paper presents a new algorithm for 3D face tracking intended for clinical infant pain monitoring. The algorithm uses a cylinder head model and 3D head pose recovery by alignment of dynamically extracted templates based on dense-HOG features. The algorithm includes extensions for drift reduction, using re-registration in combination with multi-pose state estimation by means of a square-root unscented Kalman filter. The paper reports experimental results on videos of moving infants in hospital who are relaxed or in pain. Results show good tracking behavior for poses up to 50 degrees from upright-frontal. In terms of eye location error relative to inter-ocular distance, the mean tracking error is below 9%.

Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.

PubMed

Petrotchenko, Evgeniy V; Borchers, Christoph H

2014-09-01

Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A genetic algorithm solution to the unit commitment problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kazarlis, S.A.; Bakirtzis, A.G.; Petridis, V.

1996-02-01

This paper presents a Genetic Algorithm (GA) solution to the Unit Commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple Ga algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the Varying Quality Function technique and adding problem specific operators, satisfactory solutions to the Unit Commitment problem were obtained. Test results for systems of up to 100 unitsmore » and comparisons with results obtained using Lagrangian Relaxation and Dynamic Programming are also reported.« less

Curvilinear Immersed Boundary Method for Simulating Fluid Structure Interaction with Complex 3D Rigid Bodies

PubMed Central

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2010-01-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries, Journal of Computational Physics 225 (2007) 1782–1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions unconditionally unstable iteration schemes result even when strong coupling FSI is employed. For such cases, however, combining the strong-coupling iteration with under-relaxation in conjunction with the Aitken’s acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and an upper bound of the required for stability under-relaxation coefficient is derived. PMID:20981246

Entropic multi-relaxation free-energy lattice Boltzmann model for two-phase flows

NASA Astrophysics Data System (ADS)

Bösch, F.; Dorschner, B.; Karlin, I.

2018-04-01

The entropic multi-relaxation lattice Boltzmann method is extended to two-phase systems following the free-energy approach. Gain in stability is achieved by incorporating the force term due to Korteweg's stress into the redefined entropic stabilizer, which allows simulation of higher Weber and Reynolds numbers with an efficient and explicit algorithm. Results for head-on droplet collisions and droplet impact on super-hydrophobic substrates are matching experimental data accurately. Furthermore, it is demonstrated that the entropic stabilization leads to smaller spurious currents without affecting the interface thickness. The present findings demonstrate the universality of the simple and explicit entropic lattice Boltzmann models and provide a viable and robust alternative to existing methods.

Mapping implicit spectral methods to distributed memory architectures

NASA Technical Reports Server (NTRS)

Overman, Andrea L.; Vanrosendale, John

1991-01-01

Spectral methods were proven invaluable in numerical simulation of PDEs (Partial Differential Equations), but the frequent global communication required raises a fundamental barrier to their use on highly parallel architectures. To explore this issue, a 3-D implicit spectral method was implemented on an Intel hypercube. Utilization of about 50 percent was achieved on a 32 node iPSC/860 hypercube, for a 64 x 64 x 64 Fourier-spectral grid; finer grids yield higher utilizations. Chebyshev-spectral grids are more problematic, since plane-relaxation based multigrid is required. However, by using a semicoarsening multigrid algorithm, and by relaxing all multigrid levels concurrently, relatively high utilizations were also achieved in this harder case.

Noise radiation characteristics of the Westinghouse WWG-0600 (600kW) wind turbine generator

NASA Technical Reports Server (NTRS)

Shepherd, Kevin P.; Hubbard, Harvey H.

1989-01-01

Acoustic data are presented from five different WWG-0600 machines for the wind speed range 6.7 to 13.4 m/s, for a power output range of 51 to 600 kW and for upwind, downwind and crosswind locations. Both broadband and narrowband data are presented and are compared with calculations and with similar data from other machines. Predicted broadband spectra are in good agreement with measurements at high power and underestimate them at low power. Discrete frequency rotational noise components are present in all measurements and are believed due to terrain induced wind gradients. Predictions are in general agreement with measurements upwind and downwind but underestimate them in the crosswind direction.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Morgan, Nathaniel Ray; Waltz, Jacob I.

The level set method is commonly used to model dynamically evolving fronts and interfaces. In this work, we present new methods for evolving fronts with a specified velocity field or in the surface normal direction on 3D unstructured tetrahedral meshes with adaptive mesh refinement (AMR). The level set field is located at the nodes of the tetrahedral cells and is evolved using new upwind discretizations of Hamilton–Jacobi equations combined with a Runge–Kutta method for temporal integration. The level set field is periodically reinitialized to a signed distance function using an iterative approach with a new upwind gradient. We discuss themore » details of these level set and reinitialization methods. Results from a range of numerical test problems are presented.« less

Factorizable Upwind Schemes: The Triangular Unstructured Grid Formulation

NASA Technical Reports Server (NTRS)

Sidilkover, David; Nielsen, Eric J.

2001-01-01

The upwind factorizable schemes for the equations of fluid were introduced recently. They facilitate achieving the Textbook Multigrid Efficiency (TME) and are expected also to result in the solvers of unparalleled robustness. The approach itself is very general. Therefore, it may well become a general framework for the large-scale, Computational Fluid Dynamics. In this paper we outline the triangular grid formulation of the factorizable schemes. The derivation is based on the fact that the factorizable schemes can be expressed entirely using vector notation. without explicitly mentioning a particular coordinate frame. We, describe the resulting discrete scheme in detail and present some computational results verifying the basic properties of the scheme/solver.

Finite-volume WENO scheme for viscous compressible multicomponent flows

PubMed Central

Coralic, Vedran; Colonius, Tim

2014-01-01

We develop a shock- and interface-capturing numerical method that is suitable for the simulation of multicomponent flows governed by the compressible Navier-Stokes equations. The numerical method is high-order accurate in smooth regions of the flow, discretely conserves the mass of each component, as well as the total momentum and energy, and is oscillation-free, i.e. it does not introduce spurious oscillations at the locations of shockwaves and/or material interfaces. The method is of Godunov-type and utilizes a fifth-order, finite-volume, weighted essentially non-oscillatory (WENO) scheme for the spatial reconstruction and a Harten-Lax-van Leer contact (HLLC) approximate Riemann solver to upwind the fluxes. A third-order total variation diminishing (TVD) Runge-Kutta (RK) algorithm is employed to march the solution in time. The derivation is generalized to three dimensions and nonuniform Cartesian grids. A two-point, fourth-order, Gaussian quadrature rule is utilized to build the spatial averages of the reconstructed variables inside the cells, as well as at cell boundaries. The algorithm is therefore fourth-order accurate in space and third-order accurate in time in smooth regions of the flow. We corroborate the properties of our numerical method by considering several challenging one-, two- and three-dimensional test cases, the most complex of which is the asymmetric collapse of an air bubble submerged in a cylindrical water cavity that is embedded in 10% gelatin. PMID:25110358

Finite-volume WENO scheme for viscous compressible multicomponent flows.

PubMed

Coralic, Vedran; Colonius, Tim

2014-10-01

We develop a shock- and interface-capturing numerical method that is suitable for the simulation of multicomponent flows governed by the compressible Navier-Stokes equations. The numerical method is high-order accurate in smooth regions of the flow, discretely conserves the mass of each component, as well as the total momentum and energy, and is oscillation-free, i.e. it does not introduce spurious oscillations at the locations of shockwaves and/or material interfaces. The method is of Godunov-type and utilizes a fifth-order, finite-volume, weighted essentially non-oscillatory (WENO) scheme for the spatial reconstruction and a Harten-Lax-van Leer contact (HLLC) approximate Riemann solver to upwind the fluxes. A third-order total variation diminishing (TVD) Runge-Kutta (RK) algorithm is employed to march the solution in time. The derivation is generalized to three dimensions and nonuniform Cartesian grids. A two-point, fourth-order, Gaussian quadrature rule is utilized to build the spatial averages of the reconstructed variables inside the cells, as well as at cell boundaries. The algorithm is therefore fourth-order accurate in space and third-order accurate in time in smooth regions of the flow. We corroborate the properties of our numerical method by considering several challenging one-, two- and three-dimensional test cases, the most complex of which is the asymmetric collapse of an air bubble submerged in a cylindrical water cavity that is embedded in 10% gelatin.

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Hou, Gene W.

1996-01-01

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Mechanical response of transient telechelic networks with many-part stickers

NASA Astrophysics Data System (ADS)

Sing, Michelle K.; Ramírez, Jorge; Olsen, Bradley D.

2017-11-01

A central question in soft matter is understanding how several individual, weak bonds act together to produce collective interactions. Here, gel-forming telechelic polymers with multiple stickers at each chain end are studied through Brownian dynamics simulations to understand how collective interaction of the bonds affects mechanical response of the gels. These polymers are modeled as finitely extensible dumbbells using an explicit tau-leap algorithm and the binding energy of these associations was kept constant regardless of the number of stickers. The addition of multiple bonds to the associating ends of telechelic polymers increases or decreases the network relaxation time depending on the relative kinetics of association but increases both shear stress and extensional viscosity. The relationship between the rate of association and the Rouse time of dangling chains results in two different regimes for the equilibrium stress relaxation of associating physical networks. In case I, a dissociated dangling chain is able to fully relax before re-associating to the network, resulting in two characteristic relaxation times and a non-monotonic terminal relaxation time with increasing number of bonds per polymer endgroup. In case II, the dissociated dangling chain is only able to relax a fraction of the way before it re-attaches to the network, and increasing the number of bonds per endgroup monotonically increases the terminal relaxation time. In flow, increasing the number of stickers increases the steady-state shear and extensional viscosities even though the overall bond kinetics and equilibrium constant remain unchanged. Increased dissipation in the simulations is primarily due to higher average chain extension with increasing bond number. These results indicate that toughness and dissipation in physically associating networks can both be increased by breaking single, strong bonds into smaller components.

Time scale bridging in atomistic simulation of slow dynamics: viscous relaxation and defect activation

NASA Astrophysics Data System (ADS)

Kushima, A.; Eapen, J.; Li, Ju; Yip, S.; Zhu, T.

2011-08-01

Atomistic simulation methods are known for timescale limitations in resolving slow dynamical processes. Two well-known scenarios of slow dynamics are viscous relaxation in supercooled liquids and creep deformation in stressed solids. In both phenomena the challenge to theory and simulation is to sample the transition state pathways efficiently and follow the dynamical processes on long timescales. We present a perspective based on the biased molecular simulation methods such as metadynamics, autonomous basin climbing (ABC), strain-boost and adaptive boost simulations. Such algorithms can enable an atomic-level explanation of the temperature variation of the shear viscosity of glassy liquids, and the relaxation behavior in solids undergoing creep deformation. By discussing the dynamics of slow relaxation in two quite different areas of condensed matter science, we hope to draw attention to other complex problems where anthropological or geological-scale time behavior can be simulated at atomic resolution and understood in terms of micro-scale processes of molecular rearrangements and collective interactions. As examples of a class of phenomena that can be broadly classified as materials ageing, we point to stress corrosion cracking and cement setting as opportunities for atomistic modeling and simulations.

Weighted cubic and biharmonic splines

NASA Astrophysics Data System (ADS)

Kvasov, Boris; Kim, Tae-Wan

2017-01-01

In this paper we discuss the design of algorithms for interpolating discrete data by using weighted cubic and biharmonic splines in such a way that the monotonicity and convexity of the data are preserved. We formulate the problem as a differential multipoint boundary value problem and consider its finite-difference approximation. Two algorithms for automatic selection of shape control parameters (weights) are presented. For weighted biharmonic splines the resulting system of linear equations can be efficiently solved by combining Gaussian elimination with successive over-relaxation method or finite-difference schemes in fractional steps. We consider basic computational aspects and illustrate main features of this original approach.

Winds and the distribution of nearshore phytoplankton in a stratified lake.

PubMed

Cyr, Hélène

2017-10-01

The distribution of phytoplankton in lakes is notoriously patchy and dynamic, but wind-driven currents and algal buoyancy/motility are thought to determine where algae accumulate. In this study, nearshore phytoplankton were sampled from different parts of a lake basin twice a day for 4-5 consecutive days, in the spring and in late summer, to test whether short-term changes in phytoplankton biomass and community composition can be predicted from wind-driven currents. On windy days, phytoplankton biomass was higher at downwind than at upwind nearshore sites, and the magnitude of this difference increased linearly with increasing wind speed. However, contrary to the generally assumed downwind phytoplankton aggregations, these differences were mostly due to upwelling activity and the dilution of phytoplankton at upwind nearshore sites. The distribution of individual taxa was also related to wind speed, but only during late stratification (except for cryptophytes), and these relationships were consistent with the buoyancy and motility of each group. On windy days, large diatoms and cyanobacteria concentrated upwind, neutrally buoyant taxa (green algae, small diatoms) were homogeneously distributed, and motile taxa (cryptophytes, chrysophytes, dinoflagellates) concentrated downwind. Predictable differences in the biomass and composition of phytoplankton communities could affect the efficiency of trophic transfers in nearshore areas. Copyright © 2017 Elsevier Ltd. All rights reserved.

Distorted-wave born approximation calculations for turbulence scattering in an upward-refracting atmosphere

NASA Technical Reports Server (NTRS)

Gilbert, Kenneth E.; Di, Xiao; Wang, Lintao

1990-01-01

Weiner and Keast observed that in an upward-refracting atmosphere, the relative sound pressure level versus range follows a characteristic 'step' function. The observed step function has recently been predicted qualitatively and quantitatively by including the effects of small-scale turbulence in a parabolic equation (PE) calculation. (Gilbert et al., J. Acoust. Soc. Am. 87, 2428-2437 (1990)). The PE results to single-scattering calculations based on the distorted-wave Born approximation (DWBA) are compared. The purpose is to obtain a better understanding of the physical mechanisms that produce the step-function. The PE calculations and DWBA calculations are compared to each other and to the data of Weiner and Keast for upwind propagation (strong upward refraction) and crosswind propagation (weak upward refraction) at frequencies of 424 Hz and 848 Hz. The DWBA calculations, which include only single scattering from turbulence, agree with the PE calculations and with the data in all cases except for upwind propagation at 848 Hz. Consequently, it appears that in all cases except one, the observed step function can be understood in terms of single scattering from an upward-refracted 'skywave' into the refractive shadow zone. For upwind propagation at 848 Hz, the DWBA calculation gives levels in the shadow zone that are much below both the PE and the data.

Application of ray theory to propagation of low frequency noise from wind turbines

NASA Technical Reports Server (NTRS)

Hawkins, James A.

1987-01-01

Ray theory is used to explain data from two experiments (1985 and 1985) on the propagation of low frequency sound generated by the WTS-4 wind turbine. Emphasis is on downwind data, but some upwind measurements taken during the 1985 experiment are also considered. General ray theory for a moving medium is reviewed and ray equations obtained. Restrictions are introduced simplifying the equations and permitting the use of a ray theory program MEDUSA, the computed propagation loss curve of which is compared to the measurements. Good qualitative agreement is obtained with 1984 downwind data. The results indicate that the downwind sound field is that of a near-ground sound channel. Although more scatter is seen in the 1985 data, agreement between theory and data is also good. In particular, the position and magnitude of the jump in the sound levels associated with the beginning of the sound channel is correctly predicted. The theoretical explanation of the upwind data is less successful. Ray theory calculations indicate the formation of a shadow zone that, in fact, does not occur. While no sharp shadow zone is apparent in the data, the general expectation (based on ray theory) that sound levels should be much reduced upwind is confirmed by the data.

Theoretical model for scattering of radar signals in Ku- and C-bands from a rough sea surface with breaking waves

NASA Astrophysics Data System (ADS)

Voronovich, A. G.; Zavorotny, V. U.

2001-07-01

A small-slope approximation (SSA) is used for numerical calculations of a radar backscattering cross section of the ocean surface for both Ku- and C-bands for various wind speeds and incident angles. Both the lowest order of the SSA and the one that includes the next-order correction to it are considered. The calculations were made by assuming the surface-height spectrum of Elfouhaily et al for fully developed seas. Empirical scattering models CMOD2-I3 and SASS-II are used for comparison. Theoretical calculations are in good overall agreement with the experimental data represented by the empirical models, with the exception of HH-polarization in the upwind direction. It was assumed that steep breaking waves are responsible for this effect, and the probability density function of large slopes was calculated based on this assumption. The logarithm of this function in the upwind direction can be approximated by a linear combination of wind speed and the appropriate slope. The resulting backscattering cross section for upwind, downwind and cross-wind directions, for winds ranging between 5 and 15 m s-1, and for both polarizations in both wave bands corresponds to experimental results within 1-2 dB accuracy.

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Molzahn, Daniel K.

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE PAGES

Molzahn, Daniel K.

2017-03-15

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Maximum Margin Clustering of Hyperspectral Data

NASA Astrophysics Data System (ADS)

Niazmardi, S.; Safari, A.; Homayouni, S.

2013-09-01

In recent decades, large margin methods such as Support Vector Machines (SVMs) are supposed to be the state-of-the-art of supervised learning methods for classification of hyperspectral data. However, the results of these algorithms mainly depend on the quality and quantity of available training data. To tackle down the problems associated with the training data, the researcher put effort into extending the capability of large margin algorithms for unsupervised learning. One of the recent proposed algorithms is Maximum Margin Clustering (MMC). The MMC is an unsupervised SVMs algorithm that simultaneously estimates both the labels and the hyperplane parameters. Nevertheless, the optimization of the MMC algorithm is a non-convex problem. Most of the existing MMC methods rely on the reformulating and the relaxing of the non-convex optimization problem as semi-definite programs (SDP), which are computationally very expensive and only can handle small data sets. Moreover, most of these algorithms are two-class classification, which cannot be used for classification of remotely sensed data. In this paper, a new MMC algorithm is used that solve the original non-convex problem using Alternative Optimization method. This algorithm is also extended for multi-class classification and its performance is evaluated. The results of the proposed algorithm show that the algorithm has acceptable results for hyperspectral data clustering.

Flight Tunnel Response of Male European Corn Borer Moths to Cross-Specific Mixtures of European and Asian Corn Borer Sex Pheromones: Evidence Supporting a Critical Stage in Evolution of a New Communication System.

PubMed

Martin, Nathan; Moore, Kevin; Musto, Callie J; Linn, Charles E

2016-01-01

Previous flight tunnel studies showed that 3-5 % of male European corn borer (ECB) moths, Ostrinia nubilalis, could fly upwind and make contact with sources releasing the sex pheromone of the closely related Asian corn borer (ACB), Ostrina furnacalis, [2:1 (Z)-12-tetradecenyl acetate (Z12-14:OAc) : (E)-12-teradecenyl acetate (E12-14:OAc)] and that 2-4 % of ACB males could similarly fly upwind to the sex pheromone blends of the ECB Z- [97:3 (Z)-tetradecenyl acetate (Z11-14:OAc) : (E)-tetradecenyl acetate (E11-14:Ac)] and E-strains (1:99 Z/E11-14:OAc) pheromones. The results supported the hypothesis that the evolution of the ACB pheromone system from an ECB-like ancestor included a stage in which males could be attracted to the unusual females emitting Z12- and E12-14:OAc while retaining their responsiveness to the ancestral pheromone blend of Z11- and E11-14:OAc. Here, we showed further that ECB E-strain males exhibited upwind oriented flight and source contacts to sources containing all combinations of ECB and ACB components. Maximal response levels were observed with the E-strain 99:1 E11/Z11-14:OAc blend, and high response levels also were observed with two other blends containing E11-14:OAc as the major component (E11:E12 and E11:Z12). Upwind flight and source contact also occurred at lower levels with the remaining blend combinations in which Z11-, E12-, or Z12-14:OAc was the major component. Our current results support the hypothesis concerning the evolution of ACB from an ECB-like ancester by showing that males were able to respond to females producing either the 12-14:Ac isomers, 11-14:Ac isomers, or even mixtures of all four components.

Critical wind velocity for arresting upwind gas and smoke dispersion induced by near-wall fire in a road tunnel.

PubMed

Hu, L H; Peng, W; Huo, R

2008-01-15

In case of a tunnel fire, toxic gas and smoke particles released are the most fatal contaminations. It is important to supply fresh air from the upwind side to provide a clean and safe environment upstream from the fire source for people evacuation. Thus, the critical longitudinal wind velocity for arresting fire induced upwind gas and smoke dispersion is a key criteria for tunnel safety design. Former studies and thus, the models built for estimating the critical wind velocity are all arbitrarily assuming that the fire takes place at the centre of the tunnel. However, in many real cases in road tunnels, the fire originates near the sidewall. The critical velocity of a near-wall fire should be different with that of a free-standing central fire due to their different plume entrainment process. Theoretical analysis and CFD simulation were performed in this paper to estimate the critical velocity for the fire near the sidewall. Results showed that when fire originates near the sidewall, it needs larger critical velocity to arrest the upwind gas and smoke dispersion than when fire at the centre. The ratio of critical velocity of a near-wall fire to that of a central fire was ideally estimated to be 1.26 by theoretical analysis. Results by CFD modelling showed that the ratio decreased with the increase of the fire size till near to unity. The ratio by CFD modelling was about 1.18 for a 500kW small fire, being near to and a bit lower than the theoretically estimated value of 1.26. However, the former models, including those of Thomas (1958, 1968), Dangizer and Kenndey (1982), Oka and Atkinson (1995), Wu and Barker (2000) and Kunsch (1999, 2002), underestimated the critical velocity needed for a fire near the tunnel sidewall.

Multi-task feature selection in microarray data by binary integer programming.

PubMed

Lan, Liang; Vucetic, Slobodan

2013-12-20

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.

Experiences with serial and parallel algorithms for channel routing using simulated annealing

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

ERIC Educational Resources Information Center

Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

2011-01-01

JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

Real-time Continuous Assessment Method for Mental and Physiological Condition using Heart Rate Variability

NASA Astrophysics Data System (ADS)

Yoshida, Yutaka; Yokoyama, Kiyoko; Ishii, Naohiro

It is necessary to monitor the daily health condition for preventing stress syndrome. In this study, it was proposed the method assessing the mental and physiological condition, such as the work stress or the relaxation, using heart rate variability at real time and continuously. The instantanuous heart rate (HR), and the ratio of the number of extreme points (NEP) and the number of heart beats were calculated for assessing mental and physiological condition. In this method, 20 beats heart rate were used to calculate these indexes. These were calculated in one beat interval. Three conditions, which are sitting rest, performing mental arithmetic and watching relaxation movie, were assessed using our proposed algorithm. The assessment accuracies were 71.9% and 55.8%, when performing mental arithmetic and watching relaxation movie respectively. In this method, the mental and physiological condition was assessed using only 20 regressive heart beats, so this method is considered as the real time assessment method.

Time-domain approach for the transient responses in stratified viscoelastic Earth models

NASA Technical Reports Server (NTRS)

Hanyk, L.; Moser, J.; Yuen, D. A.; Matyska, C.

1995-01-01

We have developed the numerical algorithm for the computation of transient viscoelastic responses in the time domain for a radially stratified Earth model. Stratifications in both the elastic parameters and the viscosity profile have been considered. The particular viscosity profile employed has a viscosity maximum with a constrast of O(100) in the mid lower mantle. The distribution of relaxation times reveals the presence of a continuous spectrum situated between O(100) and O(exp 4) years. The principal mode is embedded within this continuous spectrum. From this initial-value approach we have found that for the low degree harmonics the non-modal contributions are comparable to the modal contributions. For this viscosity model the differences between the time-domain and normal-mode results are found to decrease strongly with increasing angular order. These calculations also show that a time-dependent effective relaxation time can be defined, which can be bounded by the relaxation times of the principal modes.

A unified inversion scheme to process multifrequency measurements of various dispersive electromagnetic properties

NASA Astrophysics Data System (ADS)

Han, Y.; Misra, S.

2018-04-01

Multi-frequency measurement of a dispersive electromagnetic (EM) property, such as electrical conductivity, dielectric permittivity, or magnetic permeability, is commonly analyzed for purposes of material characterization. Such an analysis requires inversion of the multi-frequency measurement based on a specific relaxation model, such as Cole-Cole model or Pelton's model. We develop a unified inversion scheme that can be coupled to various type of relaxation models to independently process multi-frequency measurement of varied EM properties for purposes of improved EM-based geomaterial characterization. The proposed inversion scheme is firstly tested in few synthetic cases in which different relaxation models are coupled into the inversion scheme and then applied to multi-frequency complex conductivity, complex resistivity, complex permittivity, and complex impedance measurements. The method estimates up to seven relaxation-model parameters exhibiting convergence and accuracy for random initializations of the relaxation-model parameters within up to 3-orders of magnitude variation around the true parameter values. The proposed inversion method implements a bounded Levenberg algorithm with tuning initial values of damping parameter and its iterative adjustment factor, which are fixed in all the cases shown in this paper and irrespective of the type of measured EM property and the type of relaxation model. Notably, jump-out step and jump-back-in step are implemented as automated methods in the inversion scheme to prevent the inversion from getting trapped around local minima and to honor physical bounds of model parameters. The proposed inversion scheme can be easily used to process various types of EM measurements without major changes to the inversion scheme.

Measurement of short transverse relaxation times by pseudo-echo nutation experiments

NASA Astrophysics Data System (ADS)

Ferrari, Maude; Moyne, Christian; Canet, Daniel

2018-07-01

Very short NMR transverse relaxation times may be difficult to measure by conventional methods. Nutation experiments constitute an alternative approach. Nutation is, in the rotating frame, the equivalent of precession in the laboratory frame. It consists in monitoring the rotation of magnetization around the radio-frequency (rf) field when on-resonance conditions are fulfilled. Depending on the amplitude of the rf field, nutation may be sensitive to the two relaxation rates R1 and R2. A full theoretical development has been worked out for demonstrating how these two relaxation rates could be deduced from a simple nutation experiment, noticing however that inhomogeneity of the rf field may lead to erroneous results. This has led us to devise new experiments which are the equivalent of echo techniques in the rotating frame (pseudo spin-echo nutation experiment and pseudo gradient-echo experiment). Full equations of motion have been derived. Although complicated, they indicate that the sum of the two relaxation rates can be obtained very accurately and not altered by rf field inhomogeneity. This implies however an appropriate data processing accounting for the oscillations which are superposed to the echo decays and, anyway, theoretically predicted. A series of experiments has been carried out for different values of the rf field amplitude on samples of water doped with a paramagnetic compound at different concentrations. Pragmatically, as R1 can be easily measured by conventional methods, its value is entered in the data processing algorithm which then returns exclusively the value of the transverse relaxation time. Very consistent results are obtained that way.

Measurement of short transverse relaxation times by pseudo-echo nutation experiments.

PubMed

Ferrari, Maude; Moyne, Christian; Canet, Daniel

2018-05-03

Very short NMR transverse relaxation times may be difficult to measure by conventional methods. Nutation experiments constitute an alternative approach. Nutation is, in the rotating frame, the equivalent of precession in the laboratory frame. It consists in monitoring the rotation of magnetization around the radio-frequency (rf) field when on-resonance conditions are fulfilled. Depending on the amplitude of the rf field, nutation may be sensitive to the two relaxation rates R 1 and R 2 . A full theoretical development has been worked out for demonstrating how these two relaxation rates could be deduced from a simple nutation experiment, noticing however that inhomogeneity of the rf field may lead to erroneous results. This has led us to devise new experiments which are the equivalent of echo techniques in the rotating frame (pseudo spin-echo nutation experiment and pseudo gradient-echo experiment). Full equations of motion have been derived. Although complicated, they indicate that the sum of the two relaxation rates can be obtained very accurately and not altered by rf field inhomogeneity. This implies however an appropriate data processing accounting for the oscillations which are superposed to the echo decays and, anyway, theoretically predicted. A series of experiments has been carried out for different values of the rf field amplitude on samples of water doped with a paramagnetic compound at different concentrations. Pragmatically, as R 1 can be easily measured by conventional methods, its value is entered in the data processing algorithm which then returns exclusively the value of the transverse relaxation time. Very consistent results are obtained that way. Copyright © 2018 Elsevier Inc. All rights reserved.

Improvements to a five-phase ABS algorithm for experimental validation

NASA Astrophysics Data System (ADS)

Gerard, Mathieu; Pasillas-Lépine, William; de Vries, Edwin; Verhaegen, Michel

2012-10-01

The anti-lock braking system (ABS) is the most important active safety system for passenger cars. Unfortunately, the literature is not really precise about its description, stability and performance. This research improves a five-phase hybrid ABS control algorithm based on wheel deceleration [W. Pasillas-Lépine, Hybrid modeling and limit cycle analysis for a class of five-phase anti-lock brake algorithms, Veh. Syst. Dyn. 44 (2006), pp. 173-188] and validates it on a tyre-in-the-loop laboratory facility. Five relevant effects are modelled so that the simulation matches the reality: oscillations in measurements, wheel acceleration reconstruction, brake pressure dynamics, brake efficiency changes and tyre relaxation. The time delays in measurement and actuation have been identified as the main difficulty for the initial algorithm to work in practice. Three methods are proposed in order to deal with these delays. It is verified that the ABS limit cycles encircle the optimal braking point, without assuming any tyre parameter being a priori known. The ABS algorithm is compared with the commercial algorithm developed by Bosch.

A new adaptively central-upwind sixth-order WENO scheme

NASA Astrophysics Data System (ADS)

Huang, Cong; Chen, Li Li

2018-03-01

In this paper, we propose a new sixth-order WENO scheme for solving one dimensional hyperbolic conservation laws. The new WENO reconstruction has three properties: (1) it is central in smooth region for low dissipation, and is upwind near discontinuities for numerical stability; (2) it is a convex combination of four linear reconstructions, in which one linear reconstruction is sixth order, and the others are third order; (3) its linear weights can be any positive numbers with requirement that their sum equals one. Furthermore, we propose a simple smoothness indicator for the sixth-order linear reconstruction, this smooth indicator not only can distinguish the smooth region and discontinuities exactly, but also can reduce the computational cost, thus it is more efficient than the classical one.

An Upwind Solver for the National Combustion Code

NASA Technical Reports Server (NTRS)

Sockol, Peter M.

2011-01-01

An upwind solver is presented for the unstructured grid National Combustion Code (NCC). The compressible Navier-Stokes equations with time-derivative preconditioning and preconditioned flux-difference splitting of the inviscid terms are used. First order derivatives are computed on cell faces and used to evaluate the shear stresses and heat fluxes. A new flux limiter uses these same first order derivatives in the evaluation of left and right states used in the flux-difference splitting. The k-epsilon turbulence equations are solved with the same second-order method. The new solver has been installed in a recent version of NCC and the resulting code has been tested successfully in 2D on two laminar cases with known solutions and one turbulent case with experimental data.

Calculations of 3D compressible flows using an efficient low diffusion upwind scheme

NASA Astrophysics Data System (ADS)

Hu, Zongjun; Zha, Gecheng

2005-01-01

A newly suggested E-CUSP upwind scheme is employed for the first time to calculate 3D flows of propulsion systems. The E-CUSP scheme contains the total energy in the convective vector and is fully consistent with the characteristic directions. The scheme is proved to have low diffusion and high CPU efficiency. The computed cases in this paper include a transonic nozzle with circular-to-rectangular cross-section, a transonic duct with shock wave/turbulent boundary layer interaction, and a subsonic 3D compressor cascade. The computed results agree well with the experiments. The new scheme is proved to be accurate, efficient and robust for the 3D calculations of the flows in this paper.

Evolution of Advection Upstream Splitting Method Schemes

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing

2010-01-01

This paper focuses on the evolution of advection upstream splitting method(AUSM) schemes. The main ingredients that have led to the development of modern computational fluid dynamics (CFD) methods have been reviewed, thus the ideas behind AUSM. First and foremost is the concept of upwinding. Second, the use of Riemann problem in constructing the numerical flux in the finite-volume setting. Third, the necessity of including all physical processes, as characterised by the linear (convection) and nonlinear (acoustic) fields. Fourth, the realisation of separating the flux into convection and pressure fluxes. The rest of this review briefly outlines the technical evolution of AUSM and more details can be found in the cited references. Keywords: Computational fluid dynamics methods, hyperbolic systems, advection upstream splitting method, conservation laws, upwinding, CFD

A comparison of neural network and fuzzy clustering techniques in segmenting magnetic resonance images of the brain

NASA Technical Reports Server (NTRS)

Hall, Lawrence O.; Bensaid, Amine M.; Clarke, Laurence P.; Velthuizen, Robert P.; Silbiger, Martin S.; Bezdek, James C.

1992-01-01

Magnetic resonance (MR) brain section images are segmented and then synthetically colored to give visual representations of the original data with three approaches: the literal and approximate fuzzy c-means unsupervised clustering algorithms and a supervised computational neural network, a dynamic multilayered perception trained with the cascade correlation learning algorithm. Initial clinical results are presented on both normal volunteers and selected patients with brain tumors surrounded by edema. Supervised and unsupervised segmentation techniques provide broadly similar results. Unsupervised fuzzy algorithms were visually observed to show better segmentation when compared with raw image data for volunteer studies. However, for a more complex segmentation problem with tumor/edema or cerebrospinal fluid boundary, where the tissues have similar MR relaxation behavior, inconsistency in rating among experts was observed.

An efficient interior-point algorithm with new non-monotone line search filter method for nonlinear constrained programming

NASA Astrophysics Data System (ADS)

Wang, Liwei; Liu, Xinggao; Zhang, Zeyin

2017-02-01

An efficient primal-dual interior-point algorithm using a new non-monotone line search filter method is presented for nonlinear constrained programming, which is widely applied in engineering optimization. The new non-monotone line search technique is introduced to lead to relaxed step acceptance conditions and improved convergence performance. It can also avoid the choice of the upper bound on the memory, which brings obvious disadvantages to traditional techniques. Under mild assumptions, the global convergence of the new non-monotone line search filter method is analysed, and fast local convergence is ensured by second order corrections. The proposed algorithm is applied to the classical alkylation process optimization problem and the results illustrate its effectiveness. Some comprehensive comparisons to existing methods are also presented.

Joint segmentation of lumen and outer wall from femoral artery MR images: Towards 3D imaging measurements of peripheral arterial disease.

PubMed

Ukwatta, Eranga; Yuan, Jing; Qiu, Wu; Rajchl, Martin; Chiu, Bernard; Fenster, Aaron

2015-12-01

Three-dimensional (3D) measurements of peripheral arterial disease (PAD) plaque burden extracted from fast black-blood magnetic resonance (MR) images have shown to be more predictive of clinical outcomes than PAD stenosis measurements. To this end, accurate segmentation of the femoral artery lumen and outer wall is required for generating volumetric measurements of PAD plaque burden. Here, we propose a semi-automated algorithm to jointly segment the femoral artery lumen and outer wall surfaces from 3D black-blood MR images, which are reoriented and reconstructed along the medial axis of the femoral artery to obtain improved spatial coherence between slices of the long, thin femoral artery and to reduce computation time. The developed segmentation algorithm enforces two priors in a global optimization manner: the spatial consistency between the adjacent 2D slices and the anatomical region order between the femoral artery lumen and outer wall surfaces. The formulated combinatorial optimization problem for segmentation is solved globally and exactly by means of convex relaxation using a coupled continuous max-flow (CCMF) model, which is a dual formulation to the convex relaxed optimization problem. In addition, the CCMF model directly derives an efficient duality-based algorithm based on the modern multiplier augmented optimization scheme, which has been implemented on a GPU for fast computation. The computed segmentations from the developed algorithm were compared to manual delineations from experts using 20 black-blood MR images. The developed algorithm yielded both high accuracy (Dice similarity coefficients ≥ 87% for both the lumen and outer wall surfaces) and high reproducibility (intra-class correlation coefficient of 0.95 for generating vessel wall area), while outperforming the state-of-the-art method in terms of computational time by a factor of ≈ 20. Copyright © 2015 Elsevier B.V. All rights reserved.

On the suitability of the connection machine for direct particle simulation

NASA Technical Reports Server (NTRS)

Dagum, Leonard

1990-01-01

The algorithmic structure was examined of the vectorizable Stanford particle simulation (SPS) method and the structure is reformulated in data parallel form. Some of the SPS algorithms can be directly translated to data parallel, but several of the vectorizable algorithms have no direct data parallel equivalent. This requires the development of new, strictly data parallel algorithms. In particular, a new sorting algorithm is developed to identify collision candidates in the simulation and a master/slave algorithm is developed to minimize communication cost in large table look up. Validation of the method is undertaken through test calculations for thermal relaxation of a gas, shock wave profiles, and shock reflection from a stationary wall. A qualitative measure is provided of the performance of the Connection Machine for direct particle simulation. The massively parallel architecture of the Connection Machine is found quite suitable for this type of calculation. However, there are difficulties in taking full advantage of this architecture because of lack of a broad based tradition of data parallel programming. An important outcome of this work has been new data parallel algorithms specifically of use for direct particle simulation but which also expand the data parallel diction.

Alternative Significant Contribution Approaches Evaluated

EPA Pesticide Factsheets

This Technical Support Document (TSD) discusses alternative approaches that EPA evaluated for defining emissions that constitute each upwind state’s significant contribution to nonattainment and interference with maintenance downwind.

A generalized interval fuzzy mixed integer programming model for a multimodal transportation problem under uncertainty

NASA Astrophysics Data System (ADS)

Tian, Wenli; Cao, Chengxuan

2017-03-01

A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.

Explaining quantum correlations through evolution of causal models

NASA Astrophysics Data System (ADS)

Harper, Robin; Chapman, Robert J.; Ferrie, Christopher; Granade, Christopher; Kueng, Richard; Naoumenko, Daniel; Flammia, Steven T.; Peruzzo, Alberto

2017-04-01

We propose a framework for the systematic and quantitative generalization of Bell's theorem using causal networks. We first consider the multiobjective optimization problem of matching observed data while minimizing the causal effect of nonlocal variables and prove an inequality for the optimal region that both strengthens and generalizes Bell's theorem. To solve the optimization problem (rather than simply bound it), we develop a genetic algorithm treating as individuals causal networks. By applying our algorithm to a photonic Bell experiment, we demonstrate the trade-off between the quantitative relaxation of one or more local causality assumptions and the ability of data to match quantum correlations.

Fluid transport properties by equilibrium molecular dynamics. I. Methodology at extreme fluid states

NASA Astrophysics Data System (ADS)

Dysthe, D. K.; Fuchs, A. H.; Rousseau, B.

1999-02-01

The Green-Kubo formalism for evaluating transport coefficients by molecular dynamics has been applied to flexible, multicenter models of linear and branched alkanes in the gas phase and in the liquid phase from ambient conditions to close to the triple point. The effects of integration time step, potential cutoff and system size have been studied and shown to be small compared to the computational precision except for diffusion in gaseous n-butane. The RATTLE algorithm is shown to give accurate transport coefficients for time steps up to a limit of 8 fs. The different relaxation mechanisms in the fluids have been studied and it is shown that the longest relaxation time of the system governs the statistical precision of the results. By measuring the longest relaxation time of a system one can obtain a reliable error estimate from a single trajectory. The accuracy of the Green-Kubo method is shown to be as good as the precision for all states and models used in this study even when the system relaxation time becomes very long. The efficiency of the method is shown to be comparable to nonequilibrium methods. The transport coefficients for two recently proposed potential models are presented, showing deviations from experiment of 0%-66%.

Tumor segmentation of multi-echo MR T2-weighted images with morphological operators

NASA Astrophysics Data System (ADS)

Torres, W.; Martín-Landrove, M.; Paluszny, M.; Figueroa, G.; Padilla, G.

2009-02-01

In the present work an automatic brain tumor segmentation procedure based on mathematical morphology is proposed. The approach considers sequences of eight multi-echo MR T2-weighted images. The relaxation time T2 characterizes the relaxation of water protons in the brain tissue: white matter, gray matter, cerebrospinal fluid (CSF) or pathological tissue. Image data is initially regularized by the application of a log-convex filter in order to adjust its geometrical properties to those of noiseless data, which exhibits monotonously decreasing convex behavior. Finally the regularized data is analyzed by means of an 8-dimensional morphological eccentricity filter. In a first stage, the filter was used for the spatial homogenization of the tissues in the image, replacing each pixel by the most representative pixel within its structuring element, i.e. the one which exhibits the minimum total distance to all members in the structuring element. On the filtered images, the relaxation time T2 is estimated by means of least square regression algorithm and the histogram of T2 is determined. The T2 histogram was partitioned using the watershed morphological operator; relaxation time classes were established and used for tissue classification and segmentation of the image. The method was validated on 15 sets of MRI data with excellent results.

Closer insight into the structure of moderate to densely branched comb polymers by combining modelling and linear rheological measurements.

PubMed

Ahmadi, Mostafa; Pioge, Sandie; Fustin, Charles-Andre; Gohy, Jean-Francois; van Ruymbeke, Evelyne

2017-02-07

Synthesis of combs with well-entangled backbones and long branches with high densities has always been a challenge. Steric hindrance frequently leads to coupling of chains and structural imperfections that cannot be easily distinguished by traditional characterization methods. Research studies have therefore tried to use a combination of different methods to obtain more information on the actual microstructures. In this work, a grafting-from approach is used to synthesize poly(n-butyl acrylate) combs using atom transfer radical polymerization (ATRP) in three steps including the synthesis of a backbone, cleavage of protecting groups and growth of side branches. We have compared the linear viscoelastic properties theoretically predicted by a time marching algorithm (TMA) tube based model with the measured rheological behaviour to provide a better insight into the actual microstructure formed during synthesis. For combs with branches smaller than an entanglement, no discernible hierarchical relaxation can be distinguished, while for those with longer branches, a high frequency plateau made by entangled branches can be separated from backbone's relaxation. Dilution of the backbone, after relaxation of side branches, may accelerate the final relaxation, while extra friction can delay it especially for longer branches. Such a comparison provides a better assessment of the microstructure formed in combs.

Separating the attractant from the toxicant improves attract-and-kill of codling moth (Lepidoptera: Tortricidae).

PubMed

Huang, Juan; Gut, Larry J; Miller, James R

2013-10-01

The behavior of codling moth, Cydia pomonella (L.), responding to three attract-and-kill devices was compared in flight tunnel experiments measuring attraction and duration of target contact. Placing a 7.6 by 12.6 cm card immediately upwind of a rubber septum releasing pheromone, dramatically increased the duration on the target to > 60 s. In this setting, nearly all the males flew upwind, landed on the card first, and spent the majority of time searching the card. In contrast, male codling moths spent < 15 s at the source if given the lure only. In a forced contact bioassay, knockdown rate or mortality of male codling moths increased in direct proportion to duration of contact on a lambda-cyhalothrin-loaded filter paper. When this insecticide-treated paper was placed immediately upwind of the lure in the flight tunnel, > 90% of males contacting the paper were knocked down 2 h after voluntary exposure. These findings suggest that past attempts to combine insecticide directly with sex pheromones into a small paste, gel, or other forms of dollops are ill-advised because moths are likely over-exposed to pheromone and vacate the target before obtaining a lethal dose of insecticide. It is better to minimize direct contact with the concentrated pheromone while enticing males to extensively search insecticide-treated surface nearby the lure.

On the divergence-free condition in Godunov-type schemes for ideal magnetohydrodynamics: the upwind constrained transport method

NASA Astrophysics Data System (ADS)

Londrillo, P.; del Zanna, L.

2004-03-01

We present a general framework to design Godunov-type schemes for multidimensional ideal magnetohydrodynamic (MHD) systems, having the divergence-free relation and the related properties of the magnetic field B as built-in conditions. Our approach mostly relies on the constrained transport (CT) discretization technique for the magnetic field components, originally developed for the linear induction equation, which assures [∇.B]num=0 and its preservation in time to within machine accuracy in a finite-volume setting. We show that the CT formalism, when fully exploited, can be used as a general guideline to design the reconstruction procedures of the B vector field, to adapt standard upwind procedures for the momentum and energy equations, avoiding the onset of numerical monopoles of O(1) size, and to formulate approximate Riemann solvers for the induction equation. This general framework will be named here upwind constrained transport (UCT). To demonstrate the versatility of our method, we apply it to a variety of schemes, which are finally validated numerically and compared: a novel implementation for the MHD case of the second-order Roe-type positive scheme by Liu and Lax [J. Comput. Fluid Dyn. 5 (1996) 133], and both the second- and third-order versions of a central-type MHD scheme presented by Londrillo and Del Zanna [Astrophys. J. 530 (2000) 508], where the basic UCT strategies have been first outlined.

Identification of host fruit volatiles from flowering dogwood (Cornus florida) attractive to dogwood-origin Rhagoletis pomonella flies.

PubMed

Nojima, Satoshi; Linn, Charles; Roelofs, Wendell

2003-10-01

Solid-phase microextraction and gas chromatography coupled with electroantennographic detection were used to identify volatiles from fruit of flowering dogwood, Cornus florida, as key attractants for Rhagoletis pomonella flies originating from dogwood fruit. A six-component blend containing ethyl acetate (54.9%), 3-methylbutan-1-ol (27.5%), isoamyl acetate (0.9%), dimethyl trisulfide (1.9%), 1-octen-3-ol (9.1%), and beta-caryophyllene (5.8%) was identified from flowering dogwood fruit that gave consistent EAD activity. In a flight tunnel assay there was no significant difference in the response of individual dogwood flies exhibiting upwind anemotactic flight to volatile extracts from dogwood fruit and the six-component synthetic mixture. Dogwood flies also displayed significantly greater levels of upwind flight to sources with the dogwood volatile blend than with previously identified volatile blends from domestic apple or hawthorn fruit. Selected subtraction assays showed that the three-component mixture of 3-methylbutan-1-ol, 1-octen-3-ol, and beta-caryophyllene elicited levels of upwind flight to the source equivalent to the six-component mixture. Our study adds to previous ones showing that populations of Rhagoletis pomonella flies infesting apple, hawthorn, and flowering dogwood fruit are attracted to unique mixtures of fruit volatiles, supporting the hypothesis that host fruit odors could be key traits in sympatric host shifts and establishing host fidelity within members of the Rhagoletis pomonella species complex.

Lagrangian particle method for compressible fluid dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samulyak, Roman; Wang, Xingyu; Chen, Hsin -Chiang

A new Lagrangian particle method for solving Euler equations for compressible inviscid fluid or gas flows is proposed. Similar to smoothed particle hydrodynamics (SPH), the method represents fluid cells with Lagrangian particles and is suitable for the simulation of complex free surface / multi-phase flows. The main contributions of our method, which is different from SPH in all other aspects, are (a) significant improvement of approximation of differential operators based on a polynomial fit via weighted least squares approximation and the convergence of prescribed order, (b) a second-order particle-based algorithm that reduces to the first-order upwind method at local extremalmore » points, providing accuracy and long term stability, and (c) more accurate resolution of entropy discontinuities and states at free inter-faces. While the method is consistent and convergent to a prescribed order, the conservation of momentum and energy is not exact and depends on the convergence order . The method is generalizable to coupled hyperbolic-elliptic systems. As a result, numerical verification tests demonstrating the convergence order are presented as well as examples of complex multiphase flows.« less

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

NASA Technical Reports Server (NTRS)

Frink, Neal T.; Pirzadeh, Shahyar Z.

1998-01-01

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Computations of Wall Distances Based on Differential Equations

NASA Technical Reports Server (NTRS)

Tucker, Paul G.; Rumsey, Chris L.; Spalart, Philippe R.; Bartels, Robert E.; Biedron, Robert T.

2004-01-01

The use of differential equations such as Eikonal, Hamilton-Jacobi and Poisson for the economical calculation of the nearest wall distance d, which is needed by some turbulence models, is explored. Modifications that could palliate some turbulence-modeling anomalies are also discussed. Economy is of especial value for deforming/adaptive grid problems. For these, ideally, d is repeatedly computed. It is shown that the Eikonal and Hamilton-Jacobi equations can be easy to implement when written in implicit (or iterated) advection and advection-diffusion equation analogous forms, respectively. These, like the Poisson Laplacian term, are commonly occurring in CFD solvers, allowing the re-use of efficient algorithms and code components. The use of the NASA CFL3D CFD program to solve the implicit Eikonal and Hamilton-Jacobi equations is explored. The re-formulated d equations are easy to implement, and are found to have robust convergence. For accurate Eikonal solutions, upwind metric differences are required. The Poisson approach is also found effective, and easiest to implement. Modified distances are not found to affect global outputs such as lift and drag significantly, at least in common situations such as airfoil flows.

Lagrangian particle method for compressible fluid dynamics

DOE PAGES

Samulyak, Roman; Wang, Xingyu; Chen, Hsin -Chiang

2018-02-09

A new Lagrangian particle method for solving Euler equations for compressible inviscid fluid or gas flows is proposed. Similar to smoothed particle hydrodynamics (SPH), the method represents fluid cells with Lagrangian particles and is suitable for the simulation of complex free surface / multi-phase flows. The main contributions of our method, which is different from SPH in all other aspects, are (a) significant improvement of approximation of differential operators based on a polynomial fit via weighted least squares approximation and the convergence of prescribed order, (b) a second-order particle-based algorithm that reduces to the first-order upwind method at local extremalmore » points, providing accuracy and long term stability, and (c) more accurate resolution of entropy discontinuities and states at free inter-faces. While the method is consistent and convergent to a prescribed order, the conservation of momentum and energy is not exact and depends on the convergence order . The method is generalizable to coupled hyperbolic-elliptic systems. As a result, numerical verification tests demonstrating the convergence order are presented as well as examples of complex multiphase flows.« less

A comparative study and validation of upwind and central-difference Navier-Stokes codes for high-speed flows

NASA Technical Reports Server (NTRS)

Rudy, David H.; Kumar, Ajay; Thomas, James L.; Gnoffo, Peter A.; Chakravarthy, Sukumar R.

1988-01-01

A comparative study was made using 4 different computer codes for solving the compressible Navier-Stokes equations. Three different test problems were used, each of which has features typical of high speed internal flow problems of practical importance in the design and analysis of propulsion systems for advanced hypersonic vehicles. These problems are the supersonic flow between two walls, one of which contains a 10 deg compression ramp, the flow through a hypersonic inlet, and the flow in a 3-D corner formed by the intersection of two symmetric wedges. Three of the computer codes use similar recently developed implicit upwind differencing technology, while the fourth uses a well established explicit method. The computed results were compared with experimental data where available.

3D level set methods for evolving fronts on tetrahedral meshes with adaptive mesh refinement

DOE PAGES

Morgan, Nathaniel Ray; Waltz, Jacob I.

2017-03-02

The level set method is commonly used to model dynamically evolving fronts and interfaces. In this work, we present new methods for evolving fronts with a specified velocity field or in the surface normal direction on 3D unstructured tetrahedral meshes with adaptive mesh refinement (AMR). The level set field is located at the nodes of the tetrahedral cells and is evolved using new upwind discretizations of Hamilton–Jacobi equations combined with a Runge–Kutta method for temporal integration. The level set field is periodically reinitialized to a signed distance function using an iterative approach with a new upwind gradient. We discuss themore » details of these level set and reinitialization methods. Results from a range of numerical test problems are presented.« less

Non-oscillatory central differencing for hyperbolic conservation laws

NASA Technical Reports Server (NTRS)

Nessyahu, Haim; Tadmor, Eitan

1988-01-01

Many of the recently developed high resolution schemes for hyperbolic conservation laws are based on upwind differencing. The building block for these schemes is the averaging of an appropriate Godunov solver; its time consuming part involves the field-by-field decomposition which is required in order to identify the direction of the wind. Instead, the use of the more robust Lax-Friedrichs (LxF) solver is proposed. The main advantage is simplicity: no Riemann problems are solved and hence field-by-field decompositions are avoided. The main disadvantage is the excessive numerical viscosity typical to the LxF solver. This is compensated for by using high-resolution MUSCL-type interpolants. Numerical experiments show that the quality of results obtained by such convenient central differencing is comparable with those of the upwind schemes.

Upwind methods for the Baer–Nunziato equations and higher-order reconstruction using artificial viscosity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fraysse, F., E-mail: francois.fraysse@rs2n.eu; E. T. S. de Ingeniería Aeronáutica y del Espacio, Universidad Politécnica de Madrid, Madrid; Redondo, C.

This article is devoted to the numerical discretisation of the hyperbolic two-phase flow model of Baer and Nunziato. A special attention is paid on the discretisation of intercell flux functions in the framework of Finite Volume and Discontinuous Galerkin approaches, where care has to be taken to efficiently approximate the non-conservative products inherent to the model equations. Various upwind approximate Riemann solvers have been tested on a bench of discontinuous test cases. New discretisation schemes are proposed in a Discontinuous Galerkin framework following the criterion of Abgrall and the path-conservative formalism. A stabilisation technique based on artificial viscosity is appliedmore » to the high-order Discontinuous Galerkin method and compared against classical TVD-MUSCL Finite Volume flux reconstruction.« less

Optimal Energy Efficiency Fairness of Nodes in Wireless Powered Communication Networks.

PubMed

Zhang, Jing; Zhou, Qingjie; Ng, Derrick Wing Kwan; Jo, Minho

2017-09-15

In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity.

Optimal Energy Efficiency Fairness of Nodes in Wireless Powered Communication Networks

PubMed Central

Zhou, Qingjie; Ng, Derrick Wing Kwan; Jo, Minho

2017-01-01

In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity. PMID:28914818

Semi-Analytic Reconstruction of Flux in Finite Volume Formulations

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2006-01-01

Semi-analytic reconstruction uses the analytic solution to a second-order, steady, ordinary differential equation (ODE) to simultaneously evaluate the convective and diffusive flux at all interfaces of a finite volume formulation. The second-order ODE is itself a linearized approximation to the governing first- and second- order partial differential equation conservation laws. Thus, semi-analytic reconstruction defines a family of formulations for finite volume interface fluxes using analytic solutions to approximating equations. Limiters are not applied in a conventional sense; rather, diffusivity is adjusted in the vicinity of changes in sign of eigenvalues in order to achieve a sufficiently small cell Reynolds number in the analytic formulation across critical points. Several approaches for application of semi-analytic reconstruction for the solution of one-dimensional scalar equations are introduced. Results are compared with exact analytic solutions to Burger s Equation as well as a conventional, upwind discretization using Roe s method. One approach, the end-point wave speed (EPWS) approximation, is further developed for more complex applications. One-dimensional vector equations are tested on a quasi one-dimensional nozzle application. The EPWS algorithm has a more compact difference stencil than Roe s algorithm but reconstruction time is approximately a factor of four larger than for Roe. Though both are second-order accurate schemes, Roe s method approaches a grid converged solution with fewer grid points. Reconstruction of flux in the context of multi-dimensional, vector conservation laws including effects of thermochemical nonequilibrium in the Navier-Stokes equations is developed.

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

NASA Technical Reports Server (NTRS)

Singh, Jatinder; Taylor, Stephen

1997-01-01

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Evaluation of various deformable image registrations for point and volume variations

NASA Astrophysics Data System (ADS)

Han, Su Chul; Lee, Soon Sung; Kim, Mi-Sook; Ji, Young Hoon; Kim, Kum Bae; Choi, Sang Hyun; Park, Seungwoo; Jung, Haijo; Yoo, Hyung Jun; Yi, Chul Young

2015-07-01

The accuracy of deformable image registration (DIR) has a significant dosimetric impact in radiationtreatment planning. Many groups have studied the accuracy of DIR. In this study, we evaluatedthe accuracy of various DIR algorithms by using variations of the deformation point and volume.The reference image (I ref ) and volume (V ref ) were first generated by using virtual deformation QAsoftware (ImSimQA, Oncology System Limited, UK). We deformed I ref with axial movement of thedeformation point and V ref , depending on the type of deformation (relaxation and contraction) inImSimQA software. The deformed image (I def ) and volume (V def ) acquired by using the ImSimQAsoftware were inversely deformed relative to I ref and V ref by using DIR algorithms. As a result,we acquired a deformed image (I id ) from I def and volume (V id ) from V ref . Four intensity-basedalgorithms were tested by following the horn-schunk optical flow (HS), iterative optical flow (IOF),modified demons (MD) and fast demons (FD) with the Deformable Image Registration and AdaptiveRadiotherapy Toolkit (DIRART) of MATLAB. The image similarity between I ref and I id wascalculated to evaluate the accuracy of DIR algorithms using by Normalized Mutual Information(NMI) and Normalized Cross Correlation (NCC) metrics, when the distance of point deformationwas moved 4 mm, the value of NMI was above 1.81 and that of NCC was above 0.99 in all DIRalgorithms. As the degree of deformation was increased, the degree of image similarity decreased.When the V ref was increased or decreased by about 12%, the difference between V ref and V id waswithin ±5% regardless of the type of deformation, the deformation was classified into two types:deformation 1 increased the V ref (relaxation) and deformation 2 decreased the V ref (contraction).The value of the Dice Similarity Coefficient (DSC) was above 0.95 in deformation 1 except for theMD algorithm. In the case of deformation 2, the value of the DSC was above 0.95 in all DIR algorithms.The I def and the V def were not completely restored to I ref and V ref , and the accuracy ofthe DIR algorithms were different, depending on the degree of deformation. Hence, the performanceof DIR algorithms should be verified for the desired applications

SUPG Finite Element Simulations of Compressible Flows

NASA Technical Reports Server (NTRS)

Kirk, Brnjamin, S.

2006-01-01

The Streamline-Upwind Petrov-Galerkin (SUPG) finite element simulations of compressible flows is presented. The topics include: 1) Introduction; 2) SUPG Galerkin Finite Element Methods; 3) Applications; and 4) Bibliography.

An algorithm for the design and tuning of RF accelerating structures with variable cell lengths

NASA Astrophysics Data System (ADS)

Lal, Shankar; Pant, K. K.

2018-05-01

An algorithm is proposed for the design of a π mode standing wave buncher structure with variable cell lengths. It employs a two-parameter, multi-step approach for the design of the structure with desired resonant frequency and field flatness. The algorithm, along with analytical scaling laws for the design of the RF power coupling slot, makes it possible to accurately design the structure employing a freely available electromagnetic code like SUPERFISH. To compensate for machining errors, a tuning method has been devised to achieve desired RF parameters for the structure, which has been qualified by the successful tuning of a 7-cell buncher to π mode frequency of 2856 MHz with field flatness <3% and RF coupling coefficient close to unity. The proposed design algorithm and tuning method have demonstrated the feasibility of developing an S-band accelerating structure for desired RF parameters with a relatively relaxed machining tolerance of ∼ 25 μm. This paper discusses the algorithm for the design and tuning of an RF accelerating structure with variable cell lengths.

Robust automatic line scratch detection in films.

PubMed

Newson, Alasdair; Almansa, Andrés; Gousseau, Yann; Pérez, Patrick

2014-03-01

Line scratch detection in old films is a particularly challenging problem due to the variable spatiotemporal characteristics of this defect. Some of the main problems include sensitivity to noise and texture, and false detections due to thin vertical structures belonging to the scene. We propose a robust and automatic algorithm for frame-by-frame line scratch detection in old films, as well as a temporal algorithm for the filtering of false detections. In the frame-by-frame algorithm, we relax some of the hypotheses used in previous algorithms in order to detect a wider variety of scratches. This step's robustness and lack of external parameters is ensured by the combined use of an a contrario methodology and local statistical estimation. In this manner, over-detection in textured or cluttered areas is greatly reduced. The temporal filtering algorithm eliminates false detections due to thin vertical structures by exploiting the coherence of their motion with that of the underlying scene. Experiments demonstrate the ability of the resulting detection procedure to deal with difficult situations, in particular in the presence of noise, texture, and slanted or partial scratches. Comparisons show significant advantages over previous work.

The theory of variational hybrid quantum-classical algorithms

NASA Astrophysics Data System (ADS)

McClean, Jarrod R.; Romero, Jonathan; Babbush, Ryan; Aspuru-Guzik, Alán

2016-02-01

Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘the quantum variational eigensolver’ was developed (Peruzzo et al 2014 Nat. Commun. 5 4213) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

Potential Air Toxics Hot Spots in Truck Terminals and Cabs

PubMed Central

Smith, Thomas J.; Davis, Mary E.; Hart, Jaime E.; Blicharz, Andrew; Laden, Francine; Garshick, Eric

2016-01-01

INTRODUCTION Hot spots are areas where concentrations of one or more air toxics — organic vapors or particulate matter (PM) — are expected to be elevated. The U.S. Environmental Protection Agency’s (EPA*) screening values for air toxics were used in our definition of hot spots. According to the EPA, a screening value “is used to indicate a concentration of a chemical in the air to which a person could be continually exposed for a lifetime … and which would be unlikely to result in a deleterious effect (either cancer or noncancer health effects)” (U.S. EPA 2006). Our characterization of volatile organic compounds (VOCs; namely 18 hydrocarbons, methyl tert-butyl ether [MTBE], acetone, and aldehydes) was added onto our ongoing National Cancer Institute–funded study of lung cancer and particulate pollutant concentrations (PM with an aerodynamic diameter ≤ 2.5 µm [PM2.5], elemental carbon [EC], and organic carbon [OC]) and source apportionment of the U.S. trucking industry. We focused on three possible hot spots within the trucking terminals: upwind background areas affected by nearby industrial parks; downwind areas affected by upwind and terminal sources; and the loading docks and mechanic shops within terminal as well as the interior of cabs of trucks being driven on city, suburban, and rural streets and on highways. METHODS In Phase 1 of our study, 15 truck terminals across the United States were each visited for five consecutive days. During these site visits, sorbent tubes were used to collect 12-hour integrated samples of hydrocarbons and aldehydes from upwind and downwind fence-line locations as well as inside truck cabs. Meteorologic data and extensive site information were collected with each sample. In Phase 2, repeat visits to six terminals were conducted to test the stability of concentrations across time and judge the representativeness of our previous measurements. During the repeat site visits, the sampling procedure was expanded to include real-time sampling for total hydrocarbon (HC) and PM2.5 at the terminal upwind and downwind sites and inside the truck cabs, two additional monitors in the yard for four-quadrant sampling to better characterize the influence of wind, and indoor sampling in the loading dock and mechanic shop work areas. RESULTS Mean and median concentrations of VOCs across the sampling locations in and around the truck terminals showed significant variability in the upwind concentrations as well as in the intensity of exposures for drivers, loading-dock workers, and mechanics. The area of highest concentrations varied, although the lowest concentrations were always found in the upwind background samples. However, the downwind samples, which included the terminal’s contribution, were on average only modestly higher than the upwind samples. In the truck terminal, the mechanic-shop-area concentrations were consistently elevated for many of the VOCs (including the xylenes, alkanes, and acetone) and particulates; the loading-dock concentrations had relatively high concentrations of 1,3-butadiene, formaldehyde, and acetaldehyde; and nonsmoking driver exposures were elevated for benzene, MTBE, styrene, and hexane. Also, the loading dock and yard background concentrations for EC and PM2.5 were highly correlated with many of the VOCs (50% of pairs tested with Spearman r > 0.5 and 75% with r > 0.4); in the mechanic shop VOCs were correlated with EC but not PM2.5 (r = 0.4–0.9 where significant); and for driver exposures VOC correlations with EC and PM2.5 were relatively low, with the exception of a few aromatics, primarily benzene (r = 0.4–0.5). A principal component analysis of background source characteristics across the terminal locations that had repeat site visits identified three different groupings of variables (the “components”). This analysis suggested that a strong primary factor for hydrocarbons (alkanes and aromatics) was the major contributor to VOC variability in the yard upwind measurement. Aldehydes and acetone, which loaded onto the second and third components, were responsible for a smaller contribution to VOC variability. A multi-layer exposure model was constructed using structural equation modeling techniques that significantly predicted the yard upwind concentrations of individual VOCs as a function of wind speed, road proximity, and regional location (R2 = 0.5–0.9). This predicted value for the yard background concentration was then used to calculate concentrations for the loading dock and mechanic shop. Finally, we conducted a detailed descriptive analysis of the real-time data collected in the yard and in truck cabs during the six repeat site visits, which included more than 50 12-hour sessions at each sampling location. The real-time yard monitoring results suggested that under some conditions there was a clear upwind-to-downwind trend indicating a terminal contribution, which was not apparent in the integrated sampling data alone. They also suggested a nonlinear relationship with wind speed: calm conditions (wind speed < 2 mph) were associated with erratic upwind–downwind differences, lower wind speeds (2 to 10 mph) favored transport with little dilution, and higher wind speeds (> 10 mph) favored dilution and dispersal (more so for VOCs than for PM). Finally, an analysis of the real-time data for driver exposures in trucks with a global positioning system (GPS) matched with geographic information system (GIS) data suggested a clear influence of traffic and industrial sources along a given route with peaks in driver exposures. These peaks were largely associated with traffic, major intersections, idling at the terminals, and pickup and delivery (P&D) periods. However, VOCs and PM2.5 had different exposure patterns: VOCs exposures increased when the vehicle was stopped, and PM2.5 exposures increased during travel in traffic. CONCLUSIONS All three types of testing sites—upwind and downwind fence-line locations and inside truck cabs while in heavy traffic — met the established definition for a hot spot by having periods with concentrations of pollutants that exceeded the EPA’s screening values. Most frequently, the pollutants with concentrations exceeding the screening values were formaldehyde, acetaldehyde, and EC (which serves as a marker for diesel particulate); less frequently they were 1,3-butadiene and benzene. In the case of the downwind location of a single truck terminal without an aggregation of other sources, high concentrations of VOCs and PM were infrequent. Using structural equation modeling, a model was developed that could identify combinations of conditions and factors likely to produce hot spots. Source apportionment analyses showed that EC came predominantly from diesel emissions. As expected from the sites studied, organic vapors associated with vehicle emissions (C6–C8 alkanes and aromatics) were the predominant components of VOCs, followed by formaldehyde and acetaldehyde. For driver exposures, high VOC values were associated with stopped vehicles, and high PM2.5 values were associated with conditions during driving. PMID:23409510

Diagnostics of Dielectric Materials with Several Relaxation Times

NASA Astrophysics Data System (ADS)

Karpov, A. G.; Klemeshev, V. A.

2018-04-01

A set of means for detection and preprocessing of dielectrometric information has been suggested for studying the polarization/depolarization of dielectrics. Special attention has been paid to the processing of dielectrometric data for inhomogeneous materials using dielectric diagrams. Rapid analysis has been carried out the results of which can be used as initial approximations in more accurate (more complicated and time-consuming) iterative algorithms for model fitting.

A Novel Electrocardiogram Segmentation Algorithm Using a Multiple Model Adaptive Estimator

DTIC Science & Technology

2002-03-01

2-5 Figure 2-3. Typical Pulse Oximeter Placement [20].....................................................2-5 Figure 2-4...the heart contracts and then decreases when the heart relaxes. The pulse oximeter is typically place on a toe, finger, or earlobe as shown in Figure...2-3. Figure 2-2. Absorption as Light Passes Through the Body [24]. Figure 2-3. Typical Pulse Oximeter Placement [19]. The pulse

Kinetic Activation-Relaxation Technique and Self-Evolving Atomistic Kinetic Monte Carlo: Comparison of on-the-fly kinetic Monte Carlo algorithms

DOE PAGES

Beland, Laurent Karim; Osetskiy, Yury N.; Stoller, Roger E.; ...

2015-02-07

Here, we present a comparison of the Kinetic Activation–Relaxation Technique (k-ART) and the Self-Evolving Atomistic Kinetic Monte Carlo (SEAKMC), two off-lattice, on-the-fly Kinetic Monte Carlo (KMC) techniques that were recently used to solve several materials science problems. We show that if the initial displacements are localized the dimer method and the Activation–Relaxation Technique nouveau provide similar performance. We also show that k-ART and SEAKMC, although based on different approximations, are in agreement with each other, as demonstrated by the examples of 50 vacancies in a 1950-atom Fe box and of interstitial loops in 16,000-atom boxes. Generally speaking, k-ART’s treatment ofmore » geometry and flickers is more flexible, e.g. it can handle amorphous systems, and rigorous than SEAKMC’s, while the later’s concept of active volumes permits a significant speedup of simulations for the systems under consideration and therefore allows investigations of processes requiring large systems that are not accessible if not localizing calculations.« less

A novel partitioning method for block-structured adaptive meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fu, Lin, E-mail: lin.fu@tum.de; Litvinov, Sergej, E-mail: sergej.litvinov@aer.mw.tum.de; Hu, Xiangyu Y., E-mail: xiangyu.hu@tum.de

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtainmore » the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.« less

Post-seismic relaxation theory on laterally heterogeneous viscoelastic model

USGS Publications Warehouse

Pollitz, F.F.

2003-01-01

Investigation was carried out into the problem of relaxation of a laterally heterogeneous viscoelastic Earth following an impulsive moment release event. The formal solution utilizes a semi-analytic solution for post-seismic deformation on a laterally homogeneous Earth constructed from viscoelastic normal modes, followed by application of mode coupling theory to derive the response on the aspherical Earth. The solution is constructed in the Laplace transform domain using the correspondence principle and is valid for any linear constitutive relationship between stress and strain. The specific implementation described in this paper is a semi-analytic discretization method which assumes isotropic elastic structure and a Maxwell constitutive relation. It accounts for viscoelastic-gravitational coupling under lateral variations in elastic parameters and viscosity. For a given viscoelastic structure and minimum wavelength scale, the computational effort involved with the numerical algorithm is proportional to the volume of the laterally heterogeneous region. Examples are presented of the calculation of post-seismic relaxation with a shallow, laterally heterogeneous volume following synthetic impulsive seismic events, and they illustrate the potentially large effect of regional 3-D heterogeneities on regional deformation patterns.

NMR relaxometry study of plaster mortar with polymer additives

NASA Astrophysics Data System (ADS)

Jumate, E.; Moldovan, D.; Fechete, R.; Manea, D.

2013-11-01

The cement mixed with water forms a plastic paste or slurry which stiffness in time and finally hardens into a resistant stone. The addition of sand aggregates, polymers (Walocel) and/or calcium carbonate will modify dramatically the final mortar mechanic and thermal properties. The hydration processes can be observed using the 1D NMR measurements of transverse T2 relaxation times distributions analysed by a Laplace inversion algorithm. These distributions were obtained for mortar pasta measured at 2 hours after preparation then at 3, 7 and 28 days after preparation. Multiple components are identified in the T2 distributions. These can be associated with the proton bounded chemical or physical to the mortar minerals characterized by a short T2 relaxation time and to water protons in pores with three different pore sizes as observed from SEM images. The evaporation process is faster in the first hours after preparation, while the mortar hydration (bonding of water molecules to mortar minerals) can be still observed after days or months from preparation. Finally, the mechanic resistance was correlated with the transverse T2 relaxation rates corresponding to the bound water.

A novel partitioning method for block-structured adaptive meshes

NASA Astrophysics Data System (ADS)

Fu, Lin; Litvinov, Sergej; Hu, Xiangyu Y.; Adams, Nikolaus A.

2017-07-01

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

Multi-objective based spectral unmixing for hyperspectral images

NASA Astrophysics Data System (ADS)

Xu, Xia; Shi, Zhenwei

2017-02-01

Sparse hyperspectral unmixing assumes that each observed pixel can be expressed by a linear combination of several pure spectra in a priori library. Sparse unmixing is challenging, since it is usually transformed to a NP-hard l0 norm based optimization problem. Existing methods usually utilize a relaxation to the original l0 norm. However, the relaxation may bring in sensitive weighted parameters and additional calculation error. In this paper, we propose a novel multi-objective based algorithm to solve the sparse unmixing problem without any relaxation. We transform sparse unmixing to a multi-objective optimization problem, which contains two correlative objectives: minimizing the reconstruction error and controlling the endmember sparsity. To improve the efficiency of multi-objective optimization, a population-based randomly flipping strategy is designed. Moreover, we theoretically prove that the proposed method is able to recover a guaranteed approximate solution from the spectral library within limited iterations. The proposed method can directly deal with l0 norm via binary coding for the spectral signatures in the library. Experiments on both synthetic and real hyperspectral datasets demonstrate the effectiveness of the proposed method.

Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation

NASA Astrophysics Data System (ADS)

Ellinas, Demosthenes; Konstandakis, Christos

2016-02-01

Parametric quantum search algorithm (PQSA) is a form of quantum search that results by relaxing the unitarity of the original algorithm. PQSA can naturally be cast in the form of quantum walk, by means of the formalism of oracle algebra. This is due to the fact that the completely positive trace preserving search map used by PQSA, admits a unitarization (unitary dilation) a la quantum walk, at the expense of introducing auxiliary quantum coin-qubit space. The ensuing QW describes a process of spiral motion, chosen to be driven by two unitary Kraus generators, generating planar rotations of Bloch vector around an axis. The quadratic acceleration of quantum search translates into an equivalent quadratic saving of the number of coin qubits in the QW analogue. The associated to QW model Hamiltonian operator is obtained and is shown to represent a multi-particle long-range interacting quantum system that simulates parametric search. Finally, the relation of PQSA-QW simulator to the QW search algorithm is elucidated.

Distributed support vector machine in master-slave mode.

PubMed

Chen, Qingguo; Cao, Feilong

2018-05-01

It is well known that the support vector machine (SVM) is an effective learning algorithm. The alternating direction method of multipliers (ADMM) algorithm has emerged as a powerful technique for solving distributed optimisation models. This paper proposes a distributed SVM algorithm in a master-slave mode (MS-DSVM), which integrates a distributed SVM and ADMM acting in a master-slave configuration where the master node and slave nodes are connected, meaning the results can be broadcasted. The distributed SVM is regarded as a regularised optimisation problem and modelled as a series of convex optimisation sub-problems that are solved by ADMM. Additionally, the over-relaxation technique is utilised to accelerate the convergence rate of the proposed MS-DSVM. Our theoretical analysis demonstrates that the proposed MS-DSVM has linear convergence, meaning it possesses the fastest convergence rate among existing standard distributed ADMM algorithms. Numerical examples demonstrate that the convergence and accuracy of the proposed MS-DSVM are superior to those of existing methods under the ADMM framework. Copyright © 2018 Elsevier Ltd. All rights reserved.

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

Design Approach and Implementation of Application Specific Instruction Set Processor for SHA-3 BLAKE Algorithm

NASA Astrophysics Data System (ADS)

Zhang, Yuli; Han, Jun; Weng, Xinqian; He, Zhongzhu; Zeng, Xiaoyang

This paper presents an Application Specific Instruction-set Processor (ASIP) for the SHA-3 BLAKE algorithm family by instruction set extensions (ISE) from an RISC (reduced instruction set computer) processor. With a design space exploration for this ASIP to increase the performance and reduce the area cost, we accomplish an efficient hardware and software implementation of BLAKE algorithm. The special instructions and their well-matched hardware function unit improve the calculation of the key section of the algorithm, namely G-functions. Also, relaxing the time constraint of the special function unit can decrease its hardware cost, while keeping the high data throughput of the processor. Evaluation results reveal the ASIP achieves 335Mbps and 176Mbps for BLAKE-256 and BLAKE-512. The extra area cost is only 8.06k equivalent gates. The proposed ASIP outperforms several software approaches on various platforms in cycle per byte. In fact, both high throughput and low hardware cost achieved by this programmable processor are comparable to that of ASIC implementations.

Surface hopping with a manifold of electronic states. I. Incorporating surface-leaking to capture lifetimes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ouyang, Wenjun; Dou, Wenjie; Subotnik, Joseph E., E-mail: subotnik@sas.upenn.edu

2015-02-28

We investigate the incorporation of the surface-leaking (SL) algorithm into Tully’s fewest-switches surface hopping (FSSH) algorithm to simulate some electronic relaxation induced by an electronic bath in conjunction with some electronic transitions between discrete states. The resulting SL-FSSH algorithm is benchmarked against exact quantum scattering calculations for three one-dimensional model problems. The results show excellent agreement between SL-FSSH and exact quantum dynamics in the wide band limit, suggesting the potential for a SL-FSSH algorithm. Discrepancies and failures are investigated in detail to understand the factors that will limit the reliability of SL-FSSH, especially the wide band approximation. Considering the easinessmore » of implementation and the low computational cost, we expect this method to be useful in studying processes involving both a continuum of electronic states (where electronic dynamics are probabilistic) and processes involving only a few electronic states (where non-adiabatic processes cannot ignore short-time coherence)« less

Analysis and design of second-order sliding-mode algorithms for quadrotor roll and pitch estimation.

PubMed

Chang, Jing; Cieslak, Jérôme; Dávila, Jorge; Zolghadri, Ali; Zhou, Jun

2017-11-01

The problem addressed in this paper is that of quadrotor roll and pitch estimation without any assumption about the knowledge of perturbation bounds when Inertial Measurement Units (IMU) data or position measurements are available. A Smooth Sliding Mode (SSM) algorithm is first designed to provide reliable estimation under a smooth disturbance assumption. This assumption is next relaxed with the second proposed Adaptive Sliding Mode (ASM) algorithm that deals with disturbances of unknown bounds. In addition, the analysis of the observers are extended to the case where measurements are corrupted by bias and noise. The gains of the proposed algorithms were deduced from the Lyapunov function. Furthermore, some useful guidelines are provided for the selection of the observer turning parameters. The performance of these two approaches is evaluated using a nonlinear simulation model and considering either accelerometer or position measurements. The simulation results demonstrate the benefits of the proposed solutions. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

A splitting algorithm for a novel regularization of Perona-Malik and application to image restoration

NASA Astrophysics Data System (ADS)

Karami, Fahd; Ziad, Lamia; Sadik, Khadija

2017-12-01

In this paper, we focus on a numerical method of a problem called the Perona-Malik inequality which we use for image denoising. This model is obtained as the limit of the Perona-Malik model and the p-Laplacian operator with p→ ∞. In Atlas et al., (Nonlinear Anal. Real World Appl 18:57-68, 2014), the authors have proved the existence and uniqueness of the solution of the proposed model. However, in their work, they used the explicit numerical scheme for approximated problem which is strongly dependent to the parameter p. To overcome this, we use in this work an efficient algorithm which is a combination of the classical additive operator splitting and a nonlinear relaxation algorithm. At last, we have presented the experimental results in image filtering show, which demonstrate the efficiency and effectiveness of our algorithm and finally, we have compared it with the previous scheme presented in Atlas et al., (Nonlinear Anal. Real World Appl 18:57-68, 2014).

The artificial-free technique along the objective direction for the simplex algorithm

NASA Astrophysics Data System (ADS)

Boonperm, Aua-aree; Sinapiromsaran, Krung

2014-03-01

The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

A capacitated vehicle routing problem with order available time in e-commerce industry

NASA Astrophysics Data System (ADS)

Liu, Ling; Li, Kunpeng; Liu, Zhixue

2017-03-01

In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

Tracking upwind areas associated with enhanced chlorophyll-a concentrations to examine the impact of atmospheric deposition on phytoplankton production in the Sargasso and Mediterranean Seas

NASA Astrophysics Data System (ADS)

Kim, T. W.

2016-12-01

Transports of terrestrial materials through the atmosphere and their depositions influence ocean biogeochemistry. In particular, growth of phytoplankton in oligotrophic oceans may be stimulated by the atmospheric deposition of nutrients (e.g. reactive nitrogen species and iron). The Sargasso and Mediterranean Seas are two oligotrophic oceans that may show the enhancements in phytoplankton production by the atmospheric deposition, because their upwind areas include African deserts and urban areas of the United States and the Europe. To test this hypothesis, time series of chlorophyll-a concentration (from the Moderate Resolution Imaging Spectroradiometer) were combined with air mass back trajectory (from Hybrid Single Particle Lagrangian Integrated Trajectory Model) to perform the Concentration-Weighted Trajectory (CWT) receptor model. In this model, all individual endpoints of a single air mass back trajectory are associated with a chlorophyll-a concentration measured at the starting time of air mass back trajectory. The upwind areas showing relatively high CWT values represent they are mostly associated with enhanced chlorophyll-a concentration and contribute to phytoplankton production. We carried out the CWT in 65 and 188 stations for the Mediterranean and Saragossa Seas, respectively. The results showed relatively high CWT values in the North American and northern African continents. However, wind usually flows from these continents to ocean during cold months when chlorophyll-a concentrations are generally high. Thus the results appeared to largely originate from seasonal cycle of ocean mixed layer depth. To minimize the effect of seasonal variations, we divided chlorophyll-a concentrations by monthly climatology, which resulted in much reduced contrast in the CWT values between land and ocean areas. However, some upwind areas including the northern African desert regions still showed relatively high CWT values, maybe implying deposition-induced stimulation of phytoplankton production. We also performed CWT receptor model using sea surface temperature instead of chlorophyll-a concentration to see the effect of ocean mixed layer depth. These results will be included in the presentation.

An outer approximation method for the road network design problem

PubMed Central

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well. PMID:29590111

An outer approximation method for the road network design problem.

PubMed

Asadi Bagloee, Saeed; Sarvi, Majid

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.

Rapid simultaneous high-resolution mapping of myelin water fraction and relaxation times in human brain using BMC-mcDESPOT.

PubMed

Bouhrara, Mustapha; Spencer, Richard G

2017-02-15

A number of central nervous system (CNS) diseases exhibit changes in myelin content and magnetic resonance longitudinal, T 1 , and transverse, T 2 , relaxation times, which therefore represent important biomarkers of CNS pathology. Among the methods applied for measurement of myelin water fraction (MWF) and relaxation times, the multicomponent driven equilibrium single pulse observation of T 1 and T 2 (mcDESPOT) approach is of particular interest. mcDESPOT permits whole brain mapping of multicomponent T 1 and T 2 , with data acquisition accomplished within a clinically realistic acquisition time. Unfortunately, previous studies have indicated the limited performance of mcDESPOT in the setting of the modest signal-to-noise range of high-resolution mapping, required for the depiction of small structures and to reduce partial volume effects. Recently, we showed that a new Bayesian Monte Carlo (BMC) analysis substantially improved determination of MWF from mcDESPOT imaging data. However, our previous study was limited in that it did not discuss determination of relaxation times. Here, we extend the BMC analysis to the simultaneous determination of whole-brain MWF and relaxation times using the two-component mcDESPOT signal model. Simulation analyses and in-vivo human brain studies indicate the overall greater performance of this approach compared to the stochastic region contraction (SRC) algorithm, conventionally used to derive parameter estimates from mcDESPOT data. SRC estimates of the transverse relaxation time of the long T 2 fraction, T 2,l , and the longitudinal relaxation time of the short T 1 fraction, T 1,s , clustered towards the lower and upper parameter search space limits, respectively, indicating failure of the fitting procedure. We demonstrate that this effect is absent in the BMC analysis. Our results also showed improved parameter estimation for BMC as compared to SRC for high-resolution mapping. Overall we find that the combination of BMC analysis and mcDESPOT, BMC-mcDESPOT, shows excellent performance for accurate high-resolution whole-brain mapping of MWF and bi-component transverse and longitudinal relaxation times within a clinically realistic acquisition time. Published by Elsevier Inc.

Analysis to Quantify Significant Contribution

EPA Pesticide Factsheets

This Technical Support Document provides information that supports EPA’s analysis to quantify upwind state emissions that significantly contribute to nonattainment or interfere with maintenance of National Ambient Air Quality Standards in downwind states.

Faster quantum searching with almost any diffusion operator

NASA Astrophysics Data System (ADS)

Tulsi, Avatar

2015-05-01

Grover's search algorithm drives a quantum system from an initial state |s > to a desired final state |t > by using selective phase inversions of these two states. Earlier, we studied a generalization of Grover's algorithm that relaxes the assumption of the efficient implementation of Is, the selective phase inversion of the initial state, also known as a diffusion operator. This assumption is known to become a serious handicap in cases of physical interest. Our general search algorithm works with almost any diffusion operator Ds with the only restriction of having |s > as one of its eigenstates. The price that we pay for using any operator is an increase in the number of oracle queries by a factor of O (B ) , where B is a characteristic of the eigenspectrum of Ds and can be large in some situations. Here we show that by using a quantum Fourier transform, we can regain the optimal query complexity of Grover's algorithm without losing the freedom of using any diffusion operator for quantum searching. However, the total number of operators required by the algorithm is still O (B ) times more than that of Grover's algorithm. So our algorithm offers an advantage only if the oracle operator is computationally more expensive than the diffusion operator, which is true in most search problems.

Bin Packing, Number Balancing, and Rescaling Linear Programs

NASA Astrophysics Data System (ADS)

Hoberg, Rebecca

This thesis deals with several important algorithmic questions using techniques from diverse areas including discrepancy theory, machine learning and lattice theory. In Chapter 2, we construct an improved approximation algorithm for a classical NP-complete problem, the bin packing problem. In this problem, the goal is to pack items of sizes si ∈ [0,1] into as few bins as possible, where a set of items fits into a bin provided the sum of the item sizes is at most one. We give a polynomial-time rounding scheme for a standard linear programming relaxation of the problem, yielding a packing that uses at most OPT + O(log OPT) bins. This makes progress towards one of the "10 open problems in approximation algorithms" stated in the book of Shmoys and Williamson. In fact, based on related combinatorial lower bounds, Rothvoss conjectures that theta(logOPT) may be a tight bound on the additive integrality gap of this LP relaxation. In Chapter 3, we give a new polynomial-time algorithm for linear programming. Our algorithm is based on the multiplicative weights update (MWU) method, which is a general framework that is currently of great interest in theoretical computer science. An algorithm for linear programming based on MWU was known previously, but was not polynomial time--we remedy this by alternating between a MWU phase and a rescaling phase. The rescaling methods we introduce improve upon previous methods by reducing the number of iterations needed until one can rescale, and they can be used for any algorithm with a similar rescaling structure. Finally, we note that the MWU phase of the algorithm has a simple interpretation as gradient descent of a particular potential function, and we show we can speed up this phase by walking in a direction that decreases both the potential function and its gradient. In Chapter 4, we show that an approximate oracle for Minkowski's Theorem gives an approximate oracle for the number balancing problem, and conversely. Number balancing is the problem of minimizing | 〈a,x〉 | over x ∈ {-1,0,1}n \\ { 0}, given a ∈ [0,1]n. While an application of the pigeonhole principle shows that there always exists x with | 〈a,x〉| ≤ O(√ n/2n), the best known algorithm only guarantees |〈a,x〉| ≤ 2-ntheta(log n). We show that an oracle for Minkowski's Theorem with approximation factor rho would give an algorithm for NBP that guarantees | 〈a,x〉 | ≤ 2-ntheta(1/rho). In particular, this would beat the bound of Karmarkar and Karp provided rho ≤ O(logn/loglogn). In the other direction, we prove that any polynomial time algorithm for NBP that guarantees a solution of difference at most 2√n/2 n would give a polynomial approximation for Minkowski as well as a polynomial factor approximation algorithm for the Shortest Vector Problem.

A simulation based method to assess inversion algorithms for transverse relaxation data

NASA Astrophysics Data System (ADS)

Ghosh, Supriyo; Keener, Kevin M.; Pan, Yong

2008-04-01

NMR relaxometry is a very useful tool for understanding various chemical and physical phenomena in complex multiphase systems. A Carr-Purcell-Meiboom-Gill (CPMG) [P.T. Callaghan, Principles of Nuclear Magnetic Resonance Microscopy, Clarendon Press, Oxford, 1991] experiment is an easy and quick way to obtain transverse relaxation constant (T2) in low field. Most of the samples usually have a distribution of T2 values. Extraction of this distribution of T2s from the noisy decay data is essentially an ill-posed inverse problem. Various inversion approaches have been used to solve this problem, to date. A major issue in using an inversion algorithm is determining how accurate the computed distribution is. A systematic analysis of an inversion algorithm, UPEN [G.C. Borgia, R.J.S. Brown, P. Fantazzini, Uniform-penalty inversion of multiexponential decay data, Journal of Magnetic Resonance 132 (1998) 65-77; G.C. Borgia, R.J.S. Brown, P. Fantazzini, Uniform-penalty inversion of multiexponential decay data II. Data spacing, T2 data, systematic data errors, and diagnostics, Journal of Magnetic Resonance 147 (2000) 273-285] was performed by means of simulated CPMG data generation. Through our simulation technique and statistical analyses, the effects of various experimental parameters on the computed distribution were evaluated. We converged to the true distribution by matching up the inversion results from a series of true decay data and a noisy simulated data. In addition to simulation studies, the same approach was also applied on real experimental data to support the simulation results.

Parsimony and goodness-of-fit in multi-dimensional NMR inversion

NASA Astrophysics Data System (ADS)

Babak, Petro; Kryuchkov, Sergey; Kantzas, Apostolos

2017-01-01

Multi-dimensional nuclear magnetic resonance (NMR) experiments are often used for study of molecular structure and dynamics of matter in core analysis and reservoir evaluation. Industrial applications of multi-dimensional NMR involve a high-dimensional measurement dataset with complicated correlation structure and require rapid and stable inversion algorithms from the time domain to the relaxation rate and/or diffusion domains. In practice, applying existing inverse algorithms with a large number of parameter values leads to an infinite number of solutions with a reasonable fit to the NMR data. The interpretation of such variability of multiple solutions and selection of the most appropriate solution could be a very complex problem. In most cases the characteristics of materials have sparse signatures, and investigators would like to distinguish the most significant relaxation and diffusion values of the materials. To produce an easy to interpret and unique NMR distribution with the finite number of the principal parameter values, we introduce a new method for NMR inversion. The method is constructed based on the trade-off between the conventional goodness-of-fit approach to multivariate data and the principle of parsimony guaranteeing inversion with the least number of parameter values. We suggest performing the inversion of NMR data using the forward stepwise regression selection algorithm. To account for the trade-off between goodness-of-fit and parsimony, the objective function is selected based on Akaike Information Criterion (AIC). The performance of the developed multi-dimensional NMR inversion method and its comparison with conventional methods are illustrated using real data for samples with bitumen, water and clay.

Block structured adaptive mesh and time refinement for hybrid, hyperbolic + N-body systems

NASA Astrophysics Data System (ADS)

Miniati, Francesco; Colella, Phillip

2007-11-01

We present a new numerical algorithm for the solution of coupled collisional and collisionless systems, based on the block structured adaptive mesh and time refinement strategy (AMR). We describe the issues associated with the discretization of the system equations and the synchronization of the numerical solution on the hierarchy of grid levels. We implement a code based on a higher order, conservative and directionally unsplit Godunov’s method for hydrodynamics; a symmetric, time centered modified symplectic scheme for collisionless component; and a multilevel, multigrid relaxation algorithm for the elliptic equation coupling the two components. Numerical results that illustrate the accuracy of the code and the relative merit of various implemented schemes are also presented.

Dominant takeover regimes for genetic algorithms

NASA Technical Reports Server (NTRS)

Noever, David; Baskaran, Subbiah

1995-01-01

The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.

Neural-network-enhanced evolutionary algorithm applied to supported metal nanoparticles

NASA Astrophysics Data System (ADS)

Kolsbjerg, E. L.; Peterson, A. A.; Hammer, B.

2018-05-01

We show that approximate structural relaxation with a neural network enables orders of magnitude faster global optimization with an evolutionary algorithm in a density functional theory framework. The increased speed facilitates reliable identification of global minimum energy structures, as exemplified by our finding of a hollow Pt13 nanoparticle on an MgO support. We highlight the importance of knowing the correct structure when studying the catalytic reactivity of the different particle shapes. The computational speedup further enables screening of hundreds of different pathways in the search for optimum kinetic transitions between low-energy conformers and hence pushes the limits of the insight into thermal ensembles that can be obtained from theory.

Integrating NOE and RDC using sum-of-squares relaxation for protein structure determination.

PubMed

Khoo, Y; Singer, A; Cowburn, D

2017-07-01

We revisit the problem of protein structure determination from geometrical restraints from NMR, using convex optimization. It is well-known that the NP-hard distance geometry problem of determining atomic positions from pairwise distance restraints can be relaxed into a convex semidefinite program (SDP). However, often the NOE distance restraints are too imprecise and sparse for accurate structure determination. Residual dipolar coupling (RDC) measurements provide additional geometric information on the angles between atom-pair directions and axes of the principal-axis-frame. The optimization problem involving RDC is highly non-convex and requires a good initialization even within the simulated annealing framework. In this paper, we model the protein backbone as an articulated structure composed of rigid units. Determining the rotation of each rigid unit gives the full protein structure. We propose solving the non-convex optimization problems using the sum-of-squares (SOS) hierarchy, a hierarchy of convex relaxations with increasing complexity and approximation power. Unlike classical global optimization approaches, SOS optimization returns a certificate of optimality if the global optimum is found. Based on the SOS method, we proposed two algorithms-RDC-SOS and RDC-NOE-SOS, that have polynomial time complexity in the number of amino-acid residues and run efficiently on a standard desktop. In many instances, the proposed methods exactly recover the solution to the original non-convex optimization problem. To the best of our knowledge this is the first time SOS relaxation is introduced to solve non-convex optimization problems in structural biology. We further introduce a statistical tool, the Cramér-Rao bound (CRB), to provide an information theoretic bound on the highest resolution one can hope to achieve when determining protein structure from noisy measurements using any unbiased estimator. Our simulation results show that when the RDC measurements are corrupted by Gaussian noise of realistic variance, both SOS based algorithms attain the CRB. We successfully apply our method in a divide-and-conquer fashion to determine the structure of ubiquitin from experimental NOE and RDC measurements obtained in two alignment media, achieving more accurate and faster reconstructions compared to the current state of the art.

Mining in subarctic Canada: airborne PM2.5 metal concentrations in two remote First Nations communities.

PubMed

Liberda, Eric N; Tsuji, Leonard J S; Peltier, Richard E

2015-11-01

Airborne particulate matter arising from upwind mining activities is a concern for First Nations communities in the western James Bay region of Ontario, Canada. Aerosol chemical components were collected in 2011 from two communities in northern Ontario. The chemical and mass concentration data of particulate matter collected during this study shows a significant difference in PM2.5 in Attawapiskat compared to Fort Albany. Elemental profiles indicate enhanced levels of some tracers thought to arise from mining activities, such as, K, Ni, and crustal materials. Both communities are remote and isolated from urban and industrial pollution sources, however, Attawapiskat First Nation has significantly enhanced levels of particulate matter, and it is likely that some of this arises from upwind mining activities. Copyright © 2015 Elsevier Ltd. All rights reserved.

Analysis of C and Ku band ocean backscatter measurements under low-wind conditions

NASA Astrophysics Data System (ADS)

Carswell, James R.; Donnelly, William J.; McIntosh, Robert E.; Donelan, Mark A.; Vandemark, Douglas C.

1999-09-01

Airborne ocean backscatter measurements at C and Ku band wavelengths obtained in low to moderate-wind conditions are presented. The differences between the low-wind backscatter data and the CMOD4 and SASS-II models are reported. The measurements show that the upwind/crosswind backscatter ratio is greater than predicted. These large upwind/crosswind backscatter ratios are attributed to a rapid decrease in the crosswind backscatter at low winds. Qualitative agreement with the composite surface model proposed by Donelan and Pierson suggests the rapid decrease in the crosswind backscatter may be caused by viscous dampening of the Bragg-resonant capillary-gravity waves. We show that for larger antenna footprints typical of satellite-based scatterometers, the variability in the observed wind field smooths out the backscatter response such that the rapid decrease in the crosswind direction is not observed.

Analysis and design of numerical schemes for gas dynamics. 2: Artificial diffusion and discrete shock structure

NASA Technical Reports Server (NTRS)

Jameson, Antony

1994-01-01

The effect of artificial diffusion on discrete shock structures is examined for a family of schemes which includes scalar diffusion, convective upwind and split pressure (CUSP) schemes, and upwind schemes with characteristics splitting. The analysis leads to conditions on the diffusive flux such that stationary discrete shocks can contain a single interior point. The simplest formulation which meets these conditions is a CUSP scheme in which the coefficients of the pressure differences is fully determined by the coefficient of convective diffusion. It is also shown how both the characteristic and CUSP schemes can be modified to preserve constant stagnation enthalpy in steady flow, leading to four variants, the E and H-characteristic schemes, and the E and H-CUSP schemes. Numerical results are presented which confirm the properties of these schemes.

An empirical model for ocean radar backscatter and its application in inversion routine to eliminate wind speed and direction effects

NASA Technical Reports Server (NTRS)

Dome, G. J.; Fung, A. K.; Moore, R. K.

1977-01-01

Several regression models were tested to explain the wind direction dependence of the 1975 JONSWAP (Joint North Sea Wave Project) scatterometer data. The models consider the radar backscatter as a harmonic function of wind direction. The constant term accounts for the major effect of wind speed and the sinusoidal terms for the effects of direction. The fundamental accounts for the difference in upwind and downwind returns, while the second harmonic explains the upwind-crosswind difference. It is shown that a second harmonic model appears to adequately explain the angular variation. A simple inversion technique, which uses two orthogonal scattering measurements, is also described which eliminates the effect of wind speed and direction. Vertical polarization was shown to be more effective in determining both wind speed and direction than horizontal polarization.

Large-scale computations in fluid mechanics; Proceedings of the Fifteenth Summer Seminar on Applied Mathematics, University of California, La Jolla, CA, June 27-July 8, 1983. Parts 1 & 2

NASA Technical Reports Server (NTRS)

Engquist, B. E. (Editor); Osher, S. (Editor); Somerville, R. C. J. (Editor)

1985-01-01

Papers are presented on such topics as the use of semi-Lagrangian advective schemes in meteorological modeling; computation with high-resolution upwind schemes for hyperbolic equations; dynamics of flame propagation in a turbulent field; a modified finite element method for solving the incompressible Navier-Stokes equations; computational fusion magnetohydrodynamics; and a nonoscillatory shock capturing scheme using flux-limited dissipation. Consideration is also given to the use of spectral techniques in numerical weather prediction; numerical methods for the incorporation of mountains in atmospheric models; techniques for the numerical simulation of large-scale eddies in geophysical fluid dynamics; high-resolution TVD schemes using flux limiters; upwind-difference methods for aerodynamic problems governed by the Euler equations; and an MHD model of the earth's magnetosphere.

Sensitivity of the International Monitoring System infrasound network to elevated sources: a western Eurasia case study

NASA Astrophysics Data System (ADS)

Nippress, Alexandra; Green, David N.

2017-11-01

For the past 5 years (2010-2015) infrasound arrivals have been included in International Data Centre analyst-reviewed bulletins of events detected across the International Monitoring System (IMS). In western Eurasia, there are clusters of up to 268 events that consist of only infrasound arrivals (no associated seismic phases). These clusters are of unknown origin, although one in the North Sea region is associated with sonic booms from supersonic aircraft activity. IMS data for 17 North Sea events are analysed and compared with data from the Large Aperture Infrasound Array in the Netherlands to support the existence of these events and to determine common characteristics. Three other large clusters in western Eurasia are also identified and studied and show similar characteristics to the North Sea events, indicative of supersonic aircraft activity. The IMS infrasound network is shown to be particularly sensitive to sonic booms because the elevated source height reduces the anisotropy of infrasonic propagation within a stratospheric duct and allows for episodic upwind propagation. This episodic upwind propagation in addition to the prevailing downwind propagation, leads to clusters of Reviewed Event Bulletin events with constrained locations in western Eurasia region during the summer months. In the winter months, the recorded arrivals suggest that episodic upwind propagation is not as prevalent. Propagation modelling indicates that the subsequent unidirectional propagation, combined with the sparseness of the IMS network, leads to elongated lines of estimated event locations.

Airborne endotoxin concentrations at a large open-lot dairy in southern idaho.

PubMed

Dungan, Robert S; Leytem, April B

2009-01-01

Endotoxins are derived from gram-negative bacteria and are a potential respiratory health risk for animals and humans. To determine the potential for endotoxin transport from a large open-lot dairy, total airborne endotoxin concentrations were determined at an upwind location (background) and five downwind locations on three separate days. The downwind locations were situated at of the edge of the lot, 200 and 1390 m downwind from the lot, and downwind from a manure composting area and wastewater holding pond. When the wind was predominantly from the west, the average endotoxin concentration at the upwind location was 24 endotoxin units (EU) m(-3), whereas at the edge of the lot on the downwind side it was 259 EU m(-3). At 200 and 1390 m downwind from the edge of the lot, the average endotoxin concentrations were 168 and 49 EU m(-3), respectively. Average airborne endotoxin concentrations downwind from the composting site (36 EU m(-3)) and wastewater holding pond (89 EU m(-3)) and 1390 m from the edge of the lot were not significantly different from the upwind location. There were no significant correlations between ambient weather data collected and endotoxin concentrations over the experimental period. The downwind data show that the airborne endotoxin concentrations decreased exponentially with distance from the lot edge. Decreasing an individual's proximity to the dairy should lower their risk of airborne endotoxin exposure and associated health effects.

Source apportionment of formaldehyde during TexAQS 2006 using a source-oriented chemical transport model

NASA Astrophysics Data System (ADS)

Zhang, Hongliang; Li, Jingyi; Ying, Qi; Guven, Birnur Buzcu; Olaguer, Eduardo P.

2013-02-01

In this study, a source-oriented version of the Community Multiscale Air Quality (CMAQ) model was developed and used to quantify the contributions of five major local emission source types in Southeast Texas (vehicles, industry, natural gas combustion, wildfires, biogenic sources), as well as upwind sources, to regional primary and secondary formaldehyde (HCHO) concentrations. Predicted HCHO concentrations agree well with observations at two urban sites (the Moody Tower [MT] site at the University of Houston and the Haden Road #3 [HRM-3] site operated by Texas Commission on Environmental Quality). However, the model underestimates concentrations at an industrial site (Lynchburg Ferry). Throughout most of Southeast Texas, primary HCHO accounts for approximately 20-30% of total HCHO, while the remaining portion is due to secondary HCHO (30-50%) and upwind sources (20-50%). Biogenic sources, natural gas combustion, and vehicles are important sources of primary HCHO in the urban Houston area, respectively, accounting for 10-20%, 10-30%, and 20-60% of total primary HCHO. Biogenic sources, industry, and vehicles are the top three sources of secondary HCHO, respectively, accounting for 30-50%, 10-30%, and 5-15% of overall secondary HCHO. It was also found that over 70% of PAN in the Houston area is due to upwind sources, and only 30% is formed locally. The model-predicted source contributions to HCHO at the MT generally agree with source apportionment results obtained from the Positive Matrix Factorization (PMF) technique.

Atmospheric ammonia mixing ratios at an open-air cattle feeding facility.

PubMed

Hiranuma, Naruki; Brooks, Sarah D; Thornton, Daniel C O; Auvermann, Brent W

2010-02-01

Mixing ratios of total and gaseous ammonia were measured at an open-air cattle feeding facility in the Texas Panhandle in the summers of 2007 and 2008. Samples were collected at the nominally upwind and downwind edges of the facility. In 2008, a series of far-field samples was also collected 3.5 km north of the facility. Ammonium concentrations were determined by two complementary laboratory methods, a novel application of visible spectrophotometry and standard ion chromatography (IC). Results of the two techniques agreed very well, and spectrophotometry is faster, easier, and cheaper than chromatography. Ammonia mixing ratios measured at the immediate downwind site were drastically higher (approximately 2900 parts per billion by volume [ppbv]) than thos measured at the upwind site (< or = 200 ppbv). In contrast, at 3.5 km away from the facility, ammonia mixing ratios were reduced to levels similar to the upwind site (< or = 200 ppbv). In addition, PM10 (particulate matter < 10 microm in optical diameter) concentrations obtained at each sampling location using Grimm portable aerosol spectrometers are reported. Time-averaged (1-hr) volume concentrations of PM10 approached 5 x 10(12) nm3 cm(-3). Emitted ammonia remained largely in the gas phase at the downwind and far-field locations. No clear correlation between concentrations of ammonia and particles was observed. Overall, this study provides a better understanding of ammonia emissions from open-air animal feeding operations, especially under the hot and dry conditions present during these measurements.

Detection method of flexion relaxation phenomenon based on wavelets for patients with low back pain

NASA Astrophysics Data System (ADS)

Nougarou, François; Massicotte, Daniel; Descarreaux, Martin

2012-12-01

The flexion relaxation phenomenon (FRP) can be defined as a reduction or silence of myoelectric activity of the lumbar erector spinae muscle during full trunk flexion. It is typically absent in patients with chronic low back pain (LBP). Before any broad clinical utilization of this neuromuscular response can be made, effective, standardized, and accurate methods of identifying FRP limits are needed. However, this phenomenon is clearly more difficult to detect for LBP patients than for healthy patients. The main goal of this study is to develop an automated method based on wavelet transformation that would improve time point limits detection of surface electromyography signals of the FRP in case of LBP patients. Conventional visual identification and proposed automated methods of time point limits detection of relaxation phase were compared on experimental data using criteria of accuracy and repeatability based on physiological properties. The evaluation demonstrates that the use of wavelet transform (WT) yields better results than methods without wavelet decomposition. Furthermore, methods based on wavelet per packet transform are more effective than algorithms employing discrete WT. Compared to visual detection, in addition to demonstrating an obvious saving of time, the use of wavelet per packet transform improves the accuracy and repeatability in the detection of the FRP limits. These results clearly highlight the value of the proposed technique in identifying onset and offset of the flexion relaxation response in LBP subjects.

Nonadiabatic Dynamics for Electrons at Second-Order: Real-Time TDDFT and OSCF2.

PubMed

Nguyen, Triet S; Parkhill, John

2015-07-14

We develop a new model to simulate nonradiative relaxation and dephasing by combining real-time Hartree-Fock and density functional theory (DFT) with our recent open-systems theory of electronic dynamics. The approach has some key advantages: it has been systematically derived and properly relaxes noninteracting electrons to a Fermi-Dirac distribution. This paper combines the new dissipation theory with an atomistic, all-electron quantum chemistry code and an atom-centered model of the thermal environment. The environment is represented nonempirically and is dependent on molecular structure in a nonlocal way. A production quality, O(N(3)) closed-shell implementation of our theory applicable to realistic molecular systems is presented, including timing information. This scaling implies that the added cost of our nonadiabatic relaxation model, time-dependent open self-consistent field at second order (OSCF2), is computationally inexpensive, relative to adiabatic propagation of real-time time-dependent Hartree-Fock (TDHF) or time-dependent density functional theory (TDDFT). Details of the implementation and numerical algorithm, including factorization and efficiency, are discussed. We demonstrate that OSCF2 approaches the stationary self-consistent field (SCF) ground state when the gap is large relative to k(b)T. The code is used to calculate linear-response spectra including the effects of bath dynamics. Finally, we show how our theory of finite-temperature relaxation can be used to correct ground-state DFT calculations.

Broadscale postseismic deformation and lower crustal relaxation in the central Bayankala Block (central Tibetan Plateau) observed using InSAR data

NASA Astrophysics Data System (ADS)

Zhao, Dezheng; Qu, Chunyan; Shan, Xinjian; Zuo, Ronghu; Liu, Yunhua; Gong, Wenyu; Zhang, Guohong

2018-04-01

We have generated a more than 500 km long postseismic deformation rate map and cumulative displacement time series in the central Bayankala Block of the Tibetan Plateau using ENVISAT/ASAR data from 2003 to 2010 by the π-RATE stacking algorithm. This rate map spans a period of ∼7.2 years and reveals that postseismic motion of 2001 Kokoxili earthquake exhibits a striking signal, dominating crustal deformation of the central Bayankala Block with a cross-fault magnitude ∼9-11 mm/yr in line of sight (LOS) (∼93.1°E). The southern and northern parts of the postseismic deformation field exhibit different patterns and variable magnitudes, reflecting asymmetry of the displacement distribution. Postseismic motion affects eastward extrusion of the central Bayankala Block, which reaches ∼15 km north of the Ganzi-Yushu fault. To further investigate viscoelastic relaxation of the lower crust in this area after approximately two years, E-M, E-M-M and E-S models are constructed. The result shows that the best fit viscosity for the lower crust is about 1 × 1019 Pa·s. Comparison between cumulative displacements resolved by these three models shows that viscoelastic relaxation of the lower crust makes the most significant contribution to postseismic stress relaxation after 2001 event.

Photoinduced relaxation dynamics of nitrogen-capped silicon nanoclusters: a TD-DFT study

NASA Astrophysics Data System (ADS)

Liu, Xiang-Yang; Xie, Xiao-Ying; Fang, Wei-Hai; Cui, Ganglong

2018-04-01

Herein we have developed and implemented a TD-DFT-based surface-hopping dynamics simulation method with a recently proposed numerical algorithm capable of efficiently computing nonadiabatic couplings, a semiclassical spectrum simulation method, and an excited-state character analysis method based on one-electron transition density matrix. With the use of these developed methods, we have studied the spectroscopic properties, excited-state characters, and photoinduced relaxation dynamics of three silicon nanoclusters capped with different chromophores (Cl@SiQD, Car@SiQD, Azo@SiQD). Spectroscopically, the main absorption peak is visibly red-shifted from Cl@SiQD via Car@SiQD to Azo@SiQD. In contrast to Cl@SiQD and Car@SiQD, there are two peaks observed in Azo@SiQD. Mechanistically, the excited-state relaxation to the lowest S1 excited singlet state is ultrafast in Cl@SiQD, which is less than 190 fs and without involving excited-state trapping. In comparison, there are clear excited-state trappings in Car@SiQD and Azo@SiQD. In the former, the S2 state is trapped more than 300 fs; in the latter, the S3 excited-state trapping is more than 615 fs. These results demonstrate that the interfacial interaction has significant influences on the spectroscopic properties and excited-state relaxation dynamics. The knowledge gained in this work could be helpful for the design of silicon nanoclusters with better photoluminescence performance.

Phase retrieval by coherent modulation imaging

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fucai; Chen, Bo; Morrison, Graeme R.

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging (CDI) is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit-wave. This coherent modulation imaging (CMI) method removes inherent ambiguities of CDI and uses a reliable, rapidly converging iterative algorithm involving three planes. It works formore » extended samples, does not require tight support for convergence, and relaxes dynamic range requirements on the detector. CMI provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free electron laser.« less

Phase retrieval by coherent modulation imaging

DOE PAGES

Zhang, Fucai; Chen, Bo; Morrison, Graeme R.; ...

2016-11-18

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging (CDI) is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit-wave. This coherent modulation imaging (CMI) method removes inherent ambiguities of CDI and uses a reliable, rapidly converging iterative algorithm involving three planes. It works formore » extended samples, does not require tight support for convergence, and relaxes dynamic range requirements on the detector. CMI provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free electron laser.« less