A Wavelet-Enhanced PWTD-Accelerated Time-Domain Integral Equation Solver for Analysis of Transient Scattering from Electrically Large Conducting Objects

KAUST Repository

Liu, Yang

2018-02-26

A wavelet-enhanced plane-wave time-domain (PWTD) algorithm for efficiently and accurately solving time-domain surface integral equations (TD-SIEs) on electrically large conducting objects is presented. The proposed scheme reduces the memory requirement and computational cost of the PWTD algorithm by representing the PWTD ray data using local cosine wavelet bases (LCBs) and performing PWTD operations in the wavelet domain. The memory requirement and computational cost of the LCB-enhanced PWTD-accelerated TD-SIE solver, when applied to the analysis of transient scattering from smooth quasi-planar objects with near-normal incident pulses, scale nearly as O(Ns log Ns) and O(Ns 1.5 ), respectively. Here, Ns denotes the number of spatial unknowns. The efficiency and accuracy of the proposed scheme are demonstrated through its applications to the analysis of transient scattering from a 185 wave-length-long NASA almond and a 123-wavelength long Air-bus-A320 model.

Marching on-in-time solution of the time domain magnetic field integral equation using a predictor-corrector scheme

KAUST Repository

Ulku, Huseyin Arda; Bagci, Hakan; Michielssen, Eric

2013-01-01

An explicit marching on-in-time (MOT) scheme for solving the time-domain magnetic field integral equation (TD-MFIE) is presented. The proposed MOT-TD-MFIE solver uses Rao-Wilton-Glisson basis functions for spatial discretization and a PE(CE)m-type linear multistep method for time marching. Unlike previous explicit MOT-TD-MFIE solvers, the time step size can be chosen as large as that of the implicit MOT-TD-MFIE solvers without adversely affecting accuracy or stability. An algebraic stability analysis demonstrates the stability of the proposed explicit solver; its accuracy and efficiency are established via numerical examples. © 1963-2012 IEEE.

Marching on-in-time solution of the time domain magnetic field integral equation using a predictor-corrector scheme

KAUST Repository

Ulku, Huseyin Arda

2013-08-01

An explicit marching on-in-time (MOT) scheme for solving the time-domain magnetic field integral equation (TD-MFIE) is presented. The proposed MOT-TD-MFIE solver uses Rao-Wilton-Glisson basis functions for spatial discretization and a PE(CE)m-type linear multistep method for time marching. Unlike previous explicit MOT-TD-MFIE solvers, the time step size can be chosen as large as that of the implicit MOT-TD-MFIE solvers without adversely affecting accuracy or stability. An algebraic stability analysis demonstrates the stability of the proposed explicit solver; its accuracy and efficiency are established via numerical examples. © 1963-2012 IEEE.

Domain decomposition methods for core calculations using the MINOS solver

International Nuclear Information System (INIS)

Guerin, P.; Baudron, A. M.; Lautard, J. J.

2007-01-01

Cell by cell homogenized transport calculations of an entire nuclear reactor core are currently too expensive for industrial applications, even if a simplified transport (SPn) approximation is used. In order to take advantage of parallel computers, we propose here two domain decomposition methods using the mixed dual finite element solver MINOS. The first one is a modal synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second one is an iterative method based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the close sub-domains estimated at the previous iteration. For these two methods, we give numerical results which demonstrate their accuracy and their efficiency for the diffusion model on realistic 2D and 3D cores. (authors)

An FFT-accelerated time-domain multiconductor transmission line simulator

KAUST Repository

Bagci, Hakan

2010-02-01

A fast time-domain multiconductor transmission line (MTL) simulator for analyzing general MTL networks is presented. The simulator models the networks as homogeneous MTLs that are excited by external fields and driven/terminated/ connected by potentially nonlinear lumped circuitry. It hybridizes an MTL solver derived from time-domain integral equations (TDIEs) in unknown wave coefficients for each MTL with a circuit solver rooted in modified nodal analysis equations in unknown node voltages and voltage-source currents for each circuit. These two solvers are rigorously interfaced at MTL and circuit terminals, and the resulting coupled system of equations is solved simultaneously for all MTL and circuit unknowns at each time step. The proposed simulator is amenable to hybridization, is fast Fourier transform (FFT)-accelerated, and is highly accurate: 1) It can easily be hybridized with TDIE-based field solvers (in a fully rigorous mathematical framework) for performing electromagnetic interference and compatibility analysis on electrically large and complex structures loaded with MTL networks. 2) It is accelerated by an FFT algorithm that calculates temporal convolutions of time-domain MTL Green functions in only O(Ntlog2 N t) rather than O(Ntt2) operations, where N t is the number of time steps of simulation. Moreover, the algorithm, which operates on temporal samples of MTL Green functions, is indifferent to the method used to obtain them. 3) It approximates MTL voltages, currents, and wave coefficients, using high-order temporal basis functions. Various numerical examples, including the crosstalk analysis of a (twisted) unshielded twisted-pair (UTP)-CAT5 cable and the analysis of field coupling into UTP-CAT5 and RG-58 cables located on an airplane, are presented to demonstrate the accuracy, efficiency, and versatility of the proposed simulator. © 2010 IEEE.

Quantum-corrected plasmonic field analysis using a time domain PMCHWT integral equation

KAUST Repository

Uysal, Ismail E.

2016-03-13

When two structures are within sub-nanometer distance of each other, quantum tunneling, i.e., electrons "jumping" from one structure to another, becomes relevant. Classical electromagnetic solvers do not directly account for this additional path of current. In this work, an auxiliary tunnel made of Drude material is used to "connect" the structures as a support for this current path (R. Esteban et al., Nat. Commun., 2012). The plasmonic fields on the resulting connected structure are analyzed using a time domain surface integral equation solver. Time domain samples of the dispersive medium Green function and the dielectric permittivities are computed from the analytical inverse Fourier transform applied to the rational function representation of their frequency domain samples.

Primal Domain Decomposition Method with Direct and Iterative Solver for Circuit-Field-Torque Coupled Parallel Finite Element Method to Electric Machine Modelling

Directory of Open Access Journals (Sweden)

Daniel Marcsa

2015-01-01

Full Text Available The analysis and design of electromechanical devices involve the solution of large sparse linear systems, and require therefore high performance algorithms. In this paper, the primal Domain Decomposition Method (DDM with parallel forward-backward and with parallel Preconditioned Conjugate Gradient (PCG solvers are introduced in two-dimensional parallel time-stepping finite element formulation to analyze rotating machine considering the electromagnetic field, external circuit and rotor movement. The proposed parallel direct and the iterative solver with two preconditioners are analyzed concerning its computational efficiency and number of iterations of the solver with different preconditioners. Simulation results of a rotating machine is also presented.

A parallel adaptive finite element simplified spherical harmonics approximation solver for frequency domain fluorescence molecular imaging

International Nuclear Information System (INIS)

Lu Yujie; Zhu Banghe; Rasmussen, John C; Sevick-Muraca, Eva M; Shen Haiou; Wang Ge

2010-01-01

Fluorescence molecular imaging/tomography may play an important future role in preclinical research and clinical diagnostics. Time- and frequency-domain fluorescence imaging can acquire more measurement information than the continuous wave (CW) counterpart, improving the image quality of fluorescence molecular tomography. Although diffusion approximation (DA) theory has been extensively applied in optical molecular imaging, high-order photon migration models need to be further investigated to match quantitation provided by nuclear imaging. In this paper, a frequency-domain parallel adaptive finite element solver is developed with simplified spherical harmonics (SP N ) approximations. To fully evaluate the performance of the SP N approximations, a fast time-resolved tetrahedron-based Monte Carlo fluorescence simulator suitable for complex heterogeneous geometries is developed using a convolution strategy to realize the simulation of the fluorescence excitation and emission. The validation results show that high-order SP N can effectively correct the modeling errors of the diffusion equation, especially when the tissues have high absorption characteristics or when high modulation frequency measurements are used. Furthermore, the parallel adaptive mesh evolution strategy improves the modeling precision and the simulation speed significantly on a realistic digital mouse phantom. This solver is a promising platform for fluorescence molecular tomography using high-order approximations to the radiative transfer equation.

Time-Domain Simulation of RF Couplers

International Nuclear Information System (INIS)

Smithe, David; Carlsson, Johan; Austin, Travis

2009-01-01

We have developed a finite-difference time-domain (FDTD) fluid-like approach to integrated plasma-and-coupler simulation [1], and show how it can be used to model LH and ICRF couplers in the MST and larger tokamaks.[2] This approach permits very accurate 3-D representation of coupler geometry, and easily includes non-axi-symmetry in vessel wall, magnetic equilibrium, and plasma density. The plasma is integrated with the FDTD Maxwell solver in an implicit solve that steps over electron time-scales, and permits tenuous plasma in the coupler itself, without any need to distinguish or interface between different regions of vacuum and/or plasma. The FDTD algorithm is also generalized to incorporate a time-domain sheath potential [3] on metal structures within the simulation, to look for situations where the sheath potential might generate local sputtering opportunities. Benchmarking of the time-domain sheath algorithm has been reported in the references. Finally, the time-domain software [4] permits the use of particles, either as field diagnostic (test particles) or to self-consistently compute plasma current from the applied RF power.

Analysis of electromagnetic wave interactions on nonlinear scatterers using time domain volume integral equations

KAUST Repository

Ulku, Huseyin Arda

2014-07-06

Effects of material nonlinearities on electromagnetic field interactions become dominant as field amplitudes increase. A typical example is observed in plasmonics, where highly localized fields “activate” Kerr nonlinearities. Naturally, time domain solvers are the method of choice when it comes simulating these nonlinear effects. Oftentimes, finite difference time domain (FDTD) method is used for this purpose. This is simply due to the fact that explicitness of the FDTD renders the implementation easier and the material nonlinearity can be easily accounted for using an auxiliary differential equation (J.H. Green and A. Taflove, Opt. Express, 14(18), 8305-8310, 2006). On the other hand, explicit marching on-in-time (MOT)-based time domain integral equation (TDIE) solvers have never been used for the same purpose even though they offer several advantages over FDTD (E. Michielssen, et al., ECCOMAS CFD, The Netherlands, Sep. 5-8, 2006). This is because explicit MOT solvers have never been stabilized until not so long ago. Recently an explicit but stable MOT scheme has been proposed for solving the time domain surface magnetic field integral equation (H.A. Ulku, et al., IEEE Trans. Antennas Propag., 61(8), 4120-4131, 2013) and later it has been extended for the time domain volume electric field integral equation (TDVEFIE) (S. B. Sayed, et al., Pr. Electromagn. Res. S., 378, Stockholm, 2013). This explicit MOT scheme uses predictor-corrector updates together with successive over relaxation during time marching to stabilize the solution even when time step is as large as in the implicit counterpart. In this work, an explicit MOT-TDVEFIE solver is proposed for analyzing electromagnetic wave interactions on scatterers exhibiting Kerr nonlinearity. Nonlinearity is accounted for using the constitutive relation between the electric field intensity and flux density. Then, this relation and the TDVEFIE are discretized together by expanding the intensity and flux - sing half

Learning Domain-Specific Heuristics for Answer Set Solvers

OpenAIRE

Balduccini, Marcello

2010-01-01

In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search algorithm to mistakenly focus on areas of the search space that contain no solutions or very few. When that happens, performance degrades substantially, even to the point that the solver may need to be terminated before returning an answer. This prospect is a concern when one is considering using such a solver in an in...

Analysis of transient plasmonic interactions using an MOT-PMCHWT integral equation solver

KAUST Repository

Uysal, Ismail Enes; Ulku, Huseyin Arda; Bagci, Hakan

2014-01-01

that discretize only on the interfaces. Additionally, IE solvers implicitly enforce the radiation condition and consequently do not need (approximate) absorbing boundary conditions. Despite these advantages, IE solvers, especially in time domain, have not been

Accurate characterization of 3D diffraction gratings using time domain discontinuous Galerkin method with exact absorbing boundary conditions

KAUST Repository

Sirenko, Kostyantyn

2013-07-01

Exact absorbing and periodic boundary conditions allow to truncate grating problems\\' infinite physical domains without introducing any errors. This work presents exact absorbing boundary conditions for 3D diffraction gratings and describes their discretization within a high-order time-domain discontinuous Galerkin finite element method (TD-DG-FEM). The error introduced by the boundary condition discretization matches that of the TD-DG-FEM; this results in an optimal solver in terms of accuracy and computation time. Numerical results demonstrate the superiority of this solver over TD-DG-FEM with perfectly matched layers (PML)-based domain truncation. © 2013 IEEE.

High-speed extended-term time-domain simulation for online cascading analysis of power system

Science.gov (United States)

Fu, Chuan

A high-speed extended-term (HSET) time domain simulator (TDS), intended to become a part of an energy management system (EMS), has been newly developed for use in online extended-term dynamic cascading analysis of power systems. HSET-TDS includes the following attributes for providing situational awareness of high-consequence events: (i) online analysis, including n-1 and n-k events, (ii) ability to simulate both fast and slow dynamics for 1-3 hours in advance, (iii) inclusion of rigorous protection-system modeling, (iv) intelligence for corrective action ID, storage, and fast retrieval, and (v) high-speed execution. Very fast on-line computational capability is the most desired attribute of this simulator. Based on the process of solving algebraic differential equations describing the dynamics of power system, HSET-TDS seeks to develop computational efficiency at each of the following hierarchical levels, (i) hardware, (ii) strategies, (iii) integration methods, (iv) nonlinear solvers, and (v) linear solver libraries. This thesis first describes the Hammer-Hollingsworth 4 (HH4) implicit integration method. Like the trapezoidal rule, HH4 is symmetrically A-Stable but it possesses greater high-order precision (h4 ) than the trapezoidal rule. Such precision enables larger integration steps and therefore improves simulation efficiency for variable step size implementations. This thesis provides the underlying theory on which we advocate use of HH4 over other numerical integration methods for power system time-domain simulation. Second, motivated by the need to perform high speed extended-term time domain simulation (HSET-TDS) for on-line purposes, this thesis presents principles for designing numerical solvers of differential algebraic systems associated with power system time-domain simulation, including DAE construction strategies (Direct Solution Method), integration methods(HH4), nonlinear solvers(Very Dishonest Newton), and linear solvers(SuperLU). We have

Two-dimensional time dependent Riemann solvers for neutron transport

International Nuclear Information System (INIS)

Brunner, Thomas A.; Holloway, James Paul

2005-01-01

A two-dimensional Riemann solver is developed for the spherical harmonics approximation to the time dependent neutron transport equation. The eigenstructure of the resulting equations is explored, giving insight into both the spherical harmonics approximation and the Riemann solver. The classic Roe-type Riemann solver used here was developed for one-dimensional problems, but can be used in multidimensional problems by treating each face of a two-dimensional computation cell in a locally one-dimensional way. Several test problems are used to explore the capabilities of both the Riemann solver and the spherical harmonics approximation. The numerical solution for a simple line source problem is compared to the analytic solution to both the P 1 equation and the full transport solution. A lattice problem is used to test the method on a more challenging problem

Quasi-exact evaluation of time domain MFIE MOT matrix elements

KAUST Repository

Shi, Yifei; Bagci, Hakan; Shanker, Balasubramaniam; Lu, Mingyu; Michielssen, Eric

2013-01-01

A previously proposed quasi-exact scheme for evaluating matrix elements resulting from the marching-on-in-time (MOT) discretization of the time domain electric field integral equation (EFIE) is extended to matrix entries resulting from the discretization of its magnetic field integral equation (MFIE) counterpart. Numerical results demonstrate the accuracy of the scheme as well as the late-time stability of the resulting MOT-MFIE solver. © 2013 IEEE.

Quasi-exact evaluation of time domain MFIE MOT matrix elements

KAUST Repository

Shi, Yifei

2013-07-01

A previously proposed quasi-exact scheme for evaluating matrix elements resulting from the marching-on-in-time (MOT) discretization of the time domain electric field integral equation (EFIE) is extended to matrix entries resulting from the discretization of its magnetic field integral equation (MFIE) counterpart. Numerical results demonstrate the accuracy of the scheme as well as the late-time stability of the resulting MOT-MFIE solver. © 2013 IEEE.

A wavelet-based PWTD algorithm-accelerated time domain surface integral equation solver

KAUST Repository

Liu, Yang; Yucel, Abdulkadir C.; Gilbert, Anna C.; Bagci, Hakan; Michielssen, Eric

2015-01-01

© 2015 IEEE. The multilevel plane-wave time-domain (PWTD) algorithm allows for fast and accurate analysis of transient scattering from, and radiation by, electrically large and complex structures. When used in tandem with marching-on-in-time (MOT

Java Based Symbolic Circuit Solver For Electrical Engineering Curriculum

Directory of Open Access Journals (Sweden)

Ruba Akram Amarin

2012-11-01

Full Text Available The interactive technical electronic book, TechEBook, currently under development at the University of Central Florida (UCF, introduces a paradigm shift by replacing the traditional electrical engineering course with topic-driven modules that provide a useful tool for engineers and scientists. The TechEBook comprises the two worlds of classical circuit books and interactive operating platforms such as iPads, laptops and desktops. The TechEBook provides an interactive applets screen that holds many modules, each of which has a specific application in the self learning process. This paper describes one of the interactive techniques in the TechEBook known as Symbolic Circuit Solver (SymCirc. The SymCirc develops a versatile symbolic based linear circuit with a switches solver. The solver works by accepting a Netlist and the element that the user wants to find the voltage across or current on, as input parameters. Then it either produces the plot or the time domain expression of the output. Frequency domain plots or Symbolic Transfer Functions are also produced. The solver gets its input from a Web-based GUI circuit drawer developed at UCF. Typical simulation tools that electrical engineers encounter are numerical in nature, that is, when presented with an input circuit they iteratively solve the circuit across a set of small time steps. The result is represented as a data set of output versus time, which can be plotted for further inspection. Such results do not help users understand the ultimate nature of circuits as Linear Time Invariant systems with a finite dimensional basis in the solution space. SymCirc provides all simulation results as time domain expressions composed of the basic functions that exclusively include exponentials, sines, cosines and/or t raised to any power. This paper explains the motivation behind SymCirc, the Graphical User Interface front end and how the solver actually works. The paper also presents some examples and

A Stable Marching on-in-time Scheme for Solving the Time Domain Electric Field Volume Integral Equation on High-contrast Scatterers

KAUST Repository

Sayed, Sadeed Bin

2015-05-05

A time domain electric field volume integral equation (TD-EFVIE) solver is proposed for characterizing transient electromagnetic wave interactions on high-contrast dielectric scatterers. The TD-EFVIE is discretized using the Schaubert- Wilton-Glisson (SWG) and approximate prolate spherical wave (APSW) functions in space and time, respectively. The resulting system of equations can not be solved by a straightforward application of the marching on-in-time (MOT) scheme since the two-sided APSW interpolation functions require the knowledge of unknown “future” field samples during time marching. Causality of the MOT scheme is restored using an extrapolation technique that predicts the future samples from known “past” ones. Unlike the extrapolation techniques developed for MOT schemes that are used in solving time domain surface integral equations, this scheme trains the extrapolation coefficients using samples of exponentials with exponents on the complex frequency plane. This increases the stability of the MOT-TD-EFVIE solver significantly, since the temporal behavior of decaying and oscillating electromagnetic modes induced inside the scatterers is very accurately taken into account by this new extrapolation scheme. Numerical results demonstrate that the proposed MOT solver maintains its stability even when applied to analyzing wave interactions on high-contrast scatterers.

A Stable Marching on-in-time Scheme for Solving the Time Domain Electric Field Volume Integral Equation on High-contrast Scatterers

KAUST Repository

Sayed, Sadeed Bin; Ulku, Huseyin; Bagci, Hakan

2015-01-01

A time domain electric field volume integral equation (TD-EFVIE) solver is proposed for characterizing transient electromagnetic wave interactions on high-contrast dielectric scatterers. The TD-EFVIE is discretized using the Schaubert- Wilton-Glisson (SWG) and approximate prolate spherical wave (APSW) functions in space and time, respectively. The resulting system of equations can not be solved by a straightforward application of the marching on-in-time (MOT) scheme since the two-sided APSW interpolation functions require the knowledge of unknown “future” field samples during time marching. Causality of the MOT scheme is restored using an extrapolation technique that predicts the future samples from known “past” ones. Unlike the extrapolation techniques developed for MOT schemes that are used in solving time domain surface integral equations, this scheme trains the extrapolation coefficients using samples of exponentials with exponents on the complex frequency plane. This increases the stability of the MOT-TD-EFVIE solver significantly, since the temporal behavior of decaying and oscillating electromagnetic modes induced inside the scatterers is very accurately taken into account by this new extrapolation scheme. Numerical results demonstrate that the proposed MOT solver maintains its stability even when applied to analyzing wave interactions on high-contrast scatterers.

A higher order space-time Galerkin scheme for time domain integral equations

KAUST Repository

Pray, Andrew J.

2014-12-01

Stability of time domain integral equation (TDIE) solvers has remained an elusive goal formany years. Advancement of this research has largely progressed on four fronts: 1) Exact integration, 2) Lubich quadrature, 3) smooth temporal basis functions, and 4) space-time separation of convolutions with the retarded potential. The latter method\\'s efficacy in stabilizing solutions to the time domain electric field integral equation (TD-EFIE) was previously reported for first-order surface descriptions (flat elements) and zeroth-order functions as the temporal basis. In this work, we develop the methodology necessary to extend the scheme to higher order surface descriptions as well as to enable its use with higher order basis functions in both space and time. These basis functions are then used in a space-time Galerkin framework. A number of results are presented that demonstrate convergence in time. The viability of the space-time separation method in producing stable results is demonstrated experimentally for these examples.

A higher order space-time Galerkin scheme for time domain integral equations

KAUST Repository

Pray, Andrew J.; Beghein, Yves; Nair, Naveen V.; Cools, Kristof; Bagci, Hakan; Shanker, Balasubramaniam

2014-01-01

Stability of time domain integral equation (TDIE) solvers has remained an elusive goal formany years. Advancement of this research has largely progressed on four fronts: 1) Exact integration, 2) Lubich quadrature, 3) smooth temporal basis functions, and 4) space-time separation of convolutions with the retarded potential. The latter method's efficacy in stabilizing solutions to the time domain electric field integral equation (TD-EFIE) was previously reported for first-order surface descriptions (flat elements) and zeroth-order functions as the temporal basis. In this work, we develop the methodology necessary to extend the scheme to higher order surface descriptions as well as to enable its use with higher order basis functions in both space and time. These basis functions are then used in a space-time Galerkin framework. A number of results are presented that demonstrate convergence in time. The viability of the space-time separation method in producing stable results is demonstrated experimentally for these examples.

Acceleration of FDTD mode solver by high-performance computing techniques.

Science.gov (United States)

Han, Lin; Xi, Yanping; Huang, Wei-Ping

2010-06-21

A two-dimensional (2D) compact finite-difference time-domain (FDTD) mode solver is developed based on wave equation formalism in combination with the matrix pencil method (MPM). The method is validated for calculation of both real guided and complex leaky modes of typical optical waveguides against the bench-mark finite-difference (FD) eigen mode solver. By taking advantage of the inherent parallel nature of the FDTD algorithm, the mode solver is implemented on graphics processing units (GPUs) using the compute unified device architecture (CUDA). It is demonstrated that the high-performance computing technique leads to significant acceleration of the FDTD mode solver with more than 30 times improvement in computational efficiency in comparison with the conventional FDTD mode solver running on CPU of a standard desktop computer. The computational efficiency of the accelerated FDTD method is in the same order of magnitude of the standard finite-difference eigen mode solver and yet require much less memory (e.g., less than 10%). Therefore, the new method may serve as an efficient, accurate and robust tool for mode calculation of optical waveguides even when the conventional eigen value mode solvers are no longer applicable due to memory limitation.

Analysis of electromagnetic wave interactions on nonlinear scatterers using time domain volume integral equations

KAUST Repository

Ulku, Huseyin Arda; Sayed, Sadeed Bin; Bagci, Hakan

2014-01-01

solvers are the method of choice when it comes simulating these nonlinear effects. Oftentimes, finite difference time domain (FDTD) method is used for this purpose. This is simply due to the fact that explicitness of the FDTD renders the implementation

Analysis of transient plasmonic interactions using an MOT-PMCHWT integral equation solver

KAUST Repository

Uysal, Ismail Enes

2014-07-01

Device design involving metals and dielectrics at nano-scales and optical frequencies calls for simulation tools capable of analyzing plasmonic interactions. To this end finite difference time domain (FDTD) and finite element methods have been used extensively. Since these methods require volumetric meshes, the discretization size should be very small to accurately resolve fast-decaying fields in the vicinity of metal/dielectric interfaces. This can be avoided using integral equation (IE) techniques that discretize only on the interfaces. Additionally, IE solvers implicitly enforce the radiation condition and consequently do not need (approximate) absorbing boundary conditions. Despite these advantages, IE solvers, especially in time domain, have not been used for analyzing plasmonic interactions.

Transient analysis of electromagnetic wave interactions on plasmonic nanostructures using a surface integral equation solver

KAUST Repository

Uysal, Ismail Enes

2016-08-09

Transient electromagnetic interactions on plasmonic nanostructures are analyzed by solving the Poggio-Miller-Chan-Harrington-Wu-Tsai (PMCHWT) surface integral equation (SIE). Equivalent (unknown) electric and magnetic current densities, which are introduced on the surfaces of the nanostructures, are expanded using Rao-Wilton-Glisson and polynomial basis functions in space and time, respectively. Inserting this expansion into the PMCHWT-SIE and Galerkin testing the resulting equation at discrete times yield a system of equations that is solved for the current expansion coefficients by a marching on-in-time (MOT) scheme. The resulting MOT-PMCHWT-SIE solver calls for computation of additional convolutions between the temporal basis function and the plasmonic medium\\'s permittivity and Green function. This computation is carried out with almost no additional cost and without changing the computational complexity of the solver. Time-domain samples of the permittivity and the Green function required by these convolutions are obtained from their frequency-domain samples using a fast relaxed vector fitting algorithm. Numerical results demonstrate the accuracy and applicability of the proposed MOT-PMCHWT solver. © 2016 Optical Society of America.

A Highly Stable Marching-on-in-Time Volume Integral Equation Solver for Analyzing Transient Wave Interactions on High-Contrast Scatterers

KAUST Repository

Bagci, Hakan

2014-01-06

Time domain integral equation (TDIE) solvers represent an attractive alternative to finite difference (FDTD) and finite element (FEM) schemes for analyzing transient electromagnetic interactions on composite scatterers. Current induced on a scatterer, in response to a transient incident field, generates a scattered field. First, the scattered field is expressed as a spatio-temporal convolution of the current and the Green function of the background medium. Then, a TDIE is obtained by enforcing boundary conditions and/or fundamental field relations. TDIEs are often solved for the unknown current using marching on-in-time (MOT) schemes. MOT-TDIE solvers expand the current using local spatio-temporal basis functions. Inserting this expansion into the TDIE and testing the resulting equation in space and time yields a lower triangular system of equations (termed MOT system), which can be solved by marching in time for the coefficients of the current expansion. Stability of the MOT scheme often depends on how accurately the spatio-temporal convolution of the current and the Green function is discretized. In this work, band-limited prolate-based interpolation functions are used as temporal bases in expanding the current and discretizing the spatio-temporal convolution. Unfortunately, these functions are two sided, i.e., they require ”future” current samples for interpolation, resulting in a non-causal MOT system. To alleviate the effect of non-causality and restore the ability to march in time, an extrapolation scheme can be used to estimate the future values of the currents from their past values. Here, an accurate, stable and band-limited extrapolation scheme is developed for this purpose. This extrapolation scheme uses complex exponents, rather than commonly used harmonics, so that propagating and decaying mode fields inside the dielectric scatterers are accurately modeled. The resulting MOT scheme is applied to solving the time domain volume integral equation (VIE

Parallel PWTD-Accelerated Explicit Solution of the Time Domain Electric Field Volume Integral Equation

KAUST Repository

Liu, Yang

2016-03-25

A parallel plane-wave time-domain (PWTD)-accelerated explicit marching-on-in-time (MOT) scheme for solving the time domain electric field volume integral equation (TD-EFVIE) is presented. The proposed scheme leverages pulse functions and Lagrange polynomials to spatially and temporally discretize the electric flux density induced throughout the scatterers, and a finite difference scheme to compute the electric fields from the Hertz electric vector potentials radiated by the flux density. The flux density is explicitly updated during time marching by a predictor-corrector (PC) scheme and the vector potentials are efficiently computed by a scalar PWTD scheme. The memory requirement and computational complexity of the resulting explicit PWTD-PC-EFVIE solver scale as ( log ) s s O N N and ( ) s t O N N , respectively. Here, s N is the number of spatial basis functions and t N is the number of time steps. A scalable parallelization of the proposed MOT scheme on distributed- memory CPU clusters is described. The efficiency, accuracy, and applicability of the resulting (parallelized) PWTD-PC-EFVIE solver are demonstrated via its application to the analysis of transient electromagnetic wave interactions on canonical and real-life scatterers represented with up to 25 million spatial discretization elements.

Parallel PWTD-Accelerated Explicit Solution of the Time Domain Electric Field Volume Integral Equation

KAUST Repository

Liu, Yang; Al-Jarro, Ahmed; Bagci, Hakan; Michielssen, Eric

2016-01-01

A parallel plane-wave time-domain (PWTD)-accelerated explicit marching-on-in-time (MOT) scheme for solving the time domain electric field volume integral equation (TD-EFVIE) is presented. The proposed scheme leverages pulse functions and Lagrange polynomials to spatially and temporally discretize the electric flux density induced throughout the scatterers, and a finite difference scheme to compute the electric fields from the Hertz electric vector potentials radiated by the flux density. The flux density is explicitly updated during time marching by a predictor-corrector (PC) scheme and the vector potentials are efficiently computed by a scalar PWTD scheme. The memory requirement and computational complexity of the resulting explicit PWTD-PC-EFVIE solver scale as ( log ) s s O N N and ( ) s t O N N , respectively. Here, s N is the number of spatial basis functions and t N is the number of time steps. A scalable parallelization of the proposed MOT scheme on distributed- memory CPU clusters is described. The efficiency, accuracy, and applicability of the resulting (parallelized) PWTD-PC-EFVIE solver are demonstrated via its application to the analysis of transient electromagnetic wave interactions on canonical and real-life scatterers represented with up to 25 million spatial discretization elements.

Parallel linear solvers for simulations of reactor thermal hydraulics

International Nuclear Information System (INIS)

Yan, Y.; Antal, S.P.; Edge, B.; Keyes, D.E.; Shaver, D.; Bolotnov, I.A.; Podowski, M.Z.

2011-01-01

The state-of-the-art multiphase fluid dynamics code, NPHASE-CMFD, performs multiphase flow simulations in complex domains using implicit nonlinear treatment of the governing equations and in parallel, which is a very challenging environment for the linear solver. The present work illustrates how the Portable, Extensible Toolkit for Scientific Computation (PETSc) and scalable Algebraic Multigrid (AMG) preconditioner from Hypre can be utilized to construct robust and scalable linear solvers for the Newton correction equation obtained from the discretized system of governing conservation equations in NPHASE-CMFD. The overall long-tem objective of this work is to extend the NPHASE-CMFD code into a fully-scalable solver of multiphase flow and heat transfer problems, applicable to both steady-state and stiff time-dependent phenomena in complete fuel assemblies of nuclear reactors and, eventually, the entire reactor core (such as the Virtual Reactor concept envisioned by CASL). This campaign appropriately begins with the linear algebraic equation solver, which is traditionally a bottleneck to scalability in PDE-based codes. The computational complexity of the solver is usually superlinear in problem size, whereas the rest of the code, the “physics” portion, usually has its complexity linear in the problem size. (author)

Modeling of frequency-domain scalar wave equation with the average-derivative optimal scheme based on a multigrid-preconditioned iterative solver

Science.gov (United States)

Cao, Jian; Chen, Jing-Bo; Dai, Meng-Xue

2018-01-01

An efficient finite-difference frequency-domain modeling of seismic wave propagation relies on the discrete schemes and appropriate solving methods. The average-derivative optimal scheme for the scalar wave modeling is advantageous in terms of the storage saving for the system of linear equations and the flexibility for arbitrary directional sampling intervals. However, using a LU-decomposition-based direct solver to solve its resulting system of linear equations is very costly for both memory and computational requirements. To address this issue, we consider establishing a multigrid-preconditioned BI-CGSTAB iterative solver fit for the average-derivative optimal scheme. The choice of preconditioning matrix and its corresponding multigrid components is made with the help of Fourier spectral analysis and local mode analysis, respectively, which is important for the convergence. Furthermore, we find that for the computation with unequal directional sampling interval, the anisotropic smoothing in the multigrid precondition may affect the convergence rate of this iterative solver. Successful numerical applications of this iterative solver for the homogenous and heterogeneous models in 2D and 3D are presented where the significant reduction of computer memory and the improvement of computational efficiency are demonstrated by comparison with the direct solver. In the numerical experiments, we also show that the unequal directional sampling interval will weaken the advantage of this multigrid-preconditioned iterative solver in the computing speed or, even worse, could reduce its accuracy in some cases, which implies the need for a reasonable control of directional sampling interval in the discretization.

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid

Energy Technology Data Exchange (ETDEWEB)

Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Lijewski, Mike [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Almgren, Ann [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Straalen, Brian Van [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Carson, Erin [Univ. of California, Berkeley, CA (United States); Knight, Nicholas [Univ. of California, Berkeley, CA (United States); Demmel, James [Univ. of California, Berkeley, CA (United States)

2014-08-14

Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual sub domain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence grows with problem size, and the time for each collective operation increases with machine scale, bottom solves in large-scale applications can constitute a significant fraction of the overall multigrid solve time. In this paper, we implement, evaluate, and optimize a communication-avoiding s-step formulation of BiCGStab (CABiCGStab for short) as a high-performance, distributed-memory bottom solver for geometric multigrid solvers. This is the first time s-step Krylov subspace methods have been leveraged to improve multigrid bottom solver performance. We use a synthetic benchmark for detailed analysis and integrate the best implementation into BoxLib in order to evaluate the benefit of a s-step Krylov subspace method on the multigrid solves found in the applications LMC and Nyx on up to 32,768 cores on the Cray XE6 at NERSC. Overall, we see bottom solver improvements of up to 4.2x on synthetic problems and up to 2.7x in real applications. This results in as much as a 1.5x improvement in solver performance in real applications.

Explicit solution of the time domain magnetic field integral equation using a predictor-corrector scheme

KAUST Repository

Ulku, Huseyin Arda; Bagci, Hakan; Michielssen, Eric

2012-01-01

An explicit yet stable marching-on-in-time (MOT) scheme for solving the time domain magnetic field integral equation (TD-MFIE) is presented. The stability of the explicit scheme is achieved via (i) accurate evaluation of the MOT matrix elements using closed form expressions and (ii) a PE(CE) m type linear multistep method for time marching. Numerical results demonstrate the accuracy and stability of the proposed explicit MOT-TD-MFIE solver. © 2012 IEEE.

Explicit solution of the time domain magnetic field integral equation using a predictor-corrector scheme

KAUST Repository

Ulku, Huseyin Arda

2012-09-01

An explicit yet stable marching-on-in-time (MOT) scheme for solving the time domain magnetic field integral equation (TD-MFIE) is presented. The stability of the explicit scheme is achieved via (i) accurate evaluation of the MOT matrix elements using closed form expressions and (ii) a PE(CE) m type linear multistep method for time marching. Numerical results demonstrate the accuracy and stability of the proposed explicit MOT-TD-MFIE solver. © 2012 IEEE.

An efficient domain decomposition strategy for wave loads on surface piercing circular cylinders

DEFF Research Database (Denmark)

Paulsen, Bo Terp; Bredmose, Henrik; Bingham, Harry B.

2014-01-01

A fully nonlinear domain decomposed solver is proposed for efficient computations of wave loads on surface piercing structures in the time domain. A fully nonlinear potential flow solver was combined with a fully nonlinear Navier–Stokes/VOF solver via generalized coupling zones of arbitrary shape....... Sensitivity tests of the extent of the inner Navier–Stokes/VOF domain were carried out. Numerical computations of wave loads on surface piercing circular cylinders at intermediate water depths are presented. Four different test cases of increasing complexity were considered; 1) weakly nonlinear regular waves...

Time-Domain Techniques for Computation and Reconstruction of One-Dimensional Profiles

Directory of Open Access Journals (Sweden)

M. Rahman

2005-01-01

Full Text Available This paper presents a time-domain technique to compute the electromagnetic fields and to reconstruct the permittivity profile within a one-dimensional medium of finite length. The medium is characterized by a permittivity as well as conductivity profile which vary only with depth. The discussed scattering problem is thus one-dimensional. The modeling tool is divided into two different schemes which are named as the forward solver and the inverse solver. The task of the forward solver is to compute the internal fields of the specimen which is performed by Green’s function approach. When a known electromagnetic wave is incident normally on the media, the resulting electromagnetic field within the media can be calculated by constructing a Green’s operator. This operator maps the incident field on either side of the medium to the field at an arbitrary observation point. It is nothing but a matrix of integral operators with kernels satisfying known partial differential equations. The reflection and transmission behavior of the medium is also determined from the boundary values of the Green's operator. The inverse solver is responsible for solving an inverse scattering problem by reconstructing the permittivity profile of the medium. Though it is possible to use several algorithms to solve this problem, the invariant embedding method, also known as the layer-stripping method, has been implemented here due to the advantage that it requires a finite time trace of reflection data. Here only one round trip of reflection data is used, where one round trip is defined by the time required by the pulse to propagate through the medium and back again. The inversion process begins by retrieving the reflection kernel from the reflected wave data by simply using a deconvolution technique. The rest of the task can easily be performed by applying a numerical approach to determine different profile parameters. Both the solvers have been found to have the

Open problems in CEM: Porting an explicit time-domain volume-integral- equation solver on GPUs with OpenACC

KAUST Repository

Ergü l, Ö zgü r; Feki, Saber; Al-Jarro, Ahmed; Clo, Alain M.; Bagci, Hakan

2014-01-01

-level approach, utilizing the OpenACC directive-based parallel programming model, is used to minimize two often-faced challenges in GPU programming: developer productivity and code portability. The MOT-TDVIE solver code, originally developed for CPUs

Development and validation of a local time stepping-based PaSR solver for combustion and radiation modeling

DEFF Research Database (Denmark)

Pang, Kar Mun; Ivarsson, Anders; Haider, Sajjad

2013-01-01

In the current work, a local time stepping (LTS) solver for the modeling of combustion, radiative heat transfer and soot formation is developed and validated. This is achieved using an open source computational fluid dynamics code, OpenFOAM. Akin to the solver provided in default assembly i...... library in the edcSimpleFoam solver which was introduced during the 6th OpenFOAM workshop is modified and coupled with the current solver. One of the main amendments made is the integration of soot radiation submodel since this is significant in rich flames where soot particles are formed. The new solver...

Lattice QCD with Domain Decomposition on Intel Xeon Phi Co-Processors

Energy Technology Data Exchange (ETDEWEB)

Heybrock, Simon; Joo, Balint; Kalamkar, Dhiraj D; Smelyanskiy, Mikhail; Vaidyanathan, Karthikeyan; Wettig, Tilo; Dubey, Pradeep

2014-12-01

The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale architectures. This problem can be alleviated by alternative algorithms that reduce the amount of data movement. We investigate this in the context of Lattice Quantum Chromodynamics and implement such an alternative solver algorithm, based on domain decomposition, on Intel Xeon Phi co-processor (KNC) clusters. We demonstrate close-to-linear on-chip scaling to all 60 cores of the KNC. With a mix of single- and half-precision the domain-decomposition method sustains 400-500 Gflop/s per chip. Compared to an optimized KNC implementation of a standard solver [1], our full multi-node domain-decomposition solver strong-scales to more nodes and reduces the time-to-solution by a factor of 5.

Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics

KAUST Repository

Pavarino, L.F.; Scacchi, S.; Zampini, Stefano

2015-01-01

The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.

Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics

KAUST Repository

Pavarino, L.F.

2015-07-18

The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.

Parallel Solver for Diffuse Optical Tomography on Realistic Head Models With Scattering and Clear Regions.

Science.gov (United States)

Placati, Silvio; Guermandi, Marco; Samore, Andrea; Scarselli, Eleonora Franchi; Guerrieri, Roberto

2016-09-01

Diffuse optical tomography is an imaging technique, based on evaluation of how light propagates within the human head to obtain the functional information about the brain. Precision in reconstructing such an optical properties map is highly affected by the accuracy of the light propagation model implemented, which needs to take into account the presence of clear and scattering tissues. We present a numerical solver based on the radiosity-diffusion model, integrating the anatomical information provided by a structural MRI. The solver is designed to run on parallel heterogeneous platforms based on multiple GPUs and CPUs. We demonstrate how the solver provides a 7 times speed-up over an isotropic-scattered parallel Monte Carlo engine based on a radiative transport equation for a domain composed of 2 million voxels, along with a significant improvement in accuracy. The speed-up greatly increases for larger domains, allowing us to compute the light distribution of a full human head ( ≈ 3 million voxels) in 116 s for the platform used.

A fast Linear Complementarity Problem (LCP) solver for separating fluid-solid wall boundary Conditions

DEFF Research Database (Denmark)

Andersen, Michael; Abel, Sarah Maria Niebe; Erleben, Kenny

2017-01-01

We address the task of computing solutions for a separating fluid-solid wall boundary condition model. We present an embarrassingly parallel, easy to implement, fluid LCP solver.We are able to use greater domain sizes than previous works have shown, due to our new solver. The solver exploits matr...

Time-Domain Finite Elements for Virtual Testing of Electromagnetic Compatibility

Directory of Open Access Journals (Sweden)

V. Sedenka

2013-04-01

Full Text Available The paper presents a time-domain finite-element solver developed for simulations related to solving electromagnetic compatibility issues. The software is applied as a module integrated into a computational framework developed within a FP7 European project High Intensity Radiated Field – Synthetic Environment (HIRF SE able to simulate a large class of problems. In the paper, the mathematical formulation is briefly presented, and special emphasis is put on the user point of view on the simulation tool-chain. The functionality is demonstrated on the computation of shielding effectiveness of two composite materials. Results are validated through experimental measurements and agreement is confirmed by automatic feature selective algorithms.

Iterative solvers in forming process simulations

NARCIS (Netherlands)

van den Boogaard, Antonius H.; Rietman, Bert; Huetink, Han

1998-01-01

The use of iterative solvers in implicit forming process simulations is studied. The time and memory requirements are compared with direct solvers and assessed in relation with the rest of the Newton-Raphson iteration process. It is shown that conjugate gradient{like solvers with a proper

Time-domain simulations for metallic nano-structures - a Krylov-subspace approach beyond the limitations of FDTD

Energy Technology Data Exchange (ETDEWEB)

Koenig, Michael [Institut fuer Theoretische Festkoerperphysik, Universitaet Karlsruhe (Germany); Karlsruhe School of Optics and Photonics (KSOP), Universitaet Karlsruhe (Germany); Niegemann, Jens; Tkeshelashvili, Lasha; Busch, Kurt [Institut fuer Theoretische Festkoerperphysik, Universitaet Karlsruhe (Germany); DFG Forschungszentrum Center for Functional Nanostructures (CFN), Universitaet Karlsruhe (Germany); Karlsruhe School of Optics and Photonics (KSOP), Universitaet Karlsruhe (Germany)

2008-07-01

Numerical simulations of metallic nano-structures are crucial for the efficient design of plasmonic devices. Conventional time-domain solvers such as FDTD introduce large numerical errors especially at metallic surfaces. Our approach combines a discontinuous Galerkin method on an adaptive mesh for the spatial discretisation with a Krylov-subspace technique for the time-stepping procedure. Thus, the higher-order accuracy in both time and space is supported by unconditional stability. As illustrative examples, we compare numerical results obtained with our method against analytical reference solutions and results from FDTD calculations.

A Matlab-based finite-difference solver for the Poisson problem with mixed Dirichlet-Neumann boundary conditions

Science.gov (United States)

Reimer, Ashton S.; Cheviakov, Alexei F.

2013-03-01

A Matlab-based finite-difference numerical solver for the Poisson equation for a rectangle and a disk in two dimensions, and a spherical domain in three dimensions, is presented. The solver is optimized for handling an arbitrary combination of Dirichlet and Neumann boundary conditions, and allows for full user control of mesh refinement. The solver routines utilize effective and parallelized sparse vector and matrix operations. Computations exhibit high speeds, numerical stability with respect to mesh size and mesh refinement, and acceptable error values even on desktop computers. Catalogue identifier: AENQ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENQ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License v3.0 No. of lines in distributed program, including test data, etc.: 102793 No. of bytes in distributed program, including test data, etc.: 369378 Distribution format: tar.gz Programming language: Matlab 2010a. Computer: PC, Macintosh. Operating system: Windows, OSX, Linux. RAM: 8 GB (8, 589, 934, 592 bytes) Classification: 4.3. Nature of problem: To solve the Poisson problem in a standard domain with “patchy surface”-type (strongly heterogeneous) Neumann/Dirichlet boundary conditions. Solution method: Finite difference with mesh refinement. Restrictions: Spherical domain in 3D; rectangular domain or a disk in 2D. Unusual features: Choice between mldivide/iterative solver for the solution of large system of linear algebraic equations that arise. Full user control of Neumann/Dirichlet boundary conditions and mesh refinement. Running time: Depending on the number of points taken and the geometry of the domain, the routine may take from less than a second to several hours to execute.

Transient analysis of plasmonic nanostructures using an MOT-PMCHWT solver

KAUST Repository

Uysal, Ismail Enes

2015-10-26

A marching on in time (MOT) scheme for solving the Poggio-Miller-Chan-Harrington-Wu-Tsai (PMCHWT) surface integral equation on plasmonic nanostructures is described. The proposed scheme calls for temporal convolutions of the permittivity and Green function of the plasmonic medium with the temporal basis function. Time domain samples of the permittivity and the Green function required by these convolutions are computed using a fast relaxed vector fitting (FRVF) algorithm. Numerical results demonstrate the accuracy and applicability of the proposed MOT-PMCHWT solver.

A General Symbolic PDE Solver Generator: Explicit Schemes

Directory of Open Access Journals (Sweden)

K. Sheshadri

2003-01-01

Full Text Available A symbolic solver generator to deal with a system of partial differential equations (PDEs in functions of an arbitrary number of variables is presented; it can also handle arbitrary domains (geometries of the independent variables. Given a system of PDEs, the solver generates a set of explicit finite-difference methods to any specified order, and a Fourier stability criterion for each method. For a method that is stable, an iteration function is generated symbolically using the PDE and its initial and boundary conditions. This iteration function is dynamically generated for every PDE problem, and its evaluation provides a solution to the PDE problem. A C++/Fortran 90 code for the iteration function is generated using the MathCode system, which results in a performance gain of the order of a thousand over Mathematica, the language that has been used to code the solver generator. Examples of stability criteria are presented that agree with known criteria; examples that demonstrate the generality of the solver and the speed enhancement of the generated C++ and Fortran 90 codes are also presented.

A domain decomposition method for pseudo-spectral electromagnetic simulations of plasmas

International Nuclear Information System (INIS)

Vay, Jean-Luc; Haber, Irving; Godfrey, Brendan B.

2013-01-01

Pseudo-spectral electromagnetic solvers (i.e. representing the fields in Fourier space) have extraordinary precision. In particular, Haber et al. presented in 1973 a pseudo-spectral solver that integrates analytically the solution over a finite time step, under the usual assumption that the source is constant over that time step. Yet, pseudo-spectral solvers have not been widely used, due in part to the difficulty for efficient parallelization owing to global communications associated with global FFTs on the entire computational domains. A method for the parallelization of electromagnetic pseudo-spectral solvers is proposed and tested on single electromagnetic pulses, and on Particle-In-Cell simulations of the wakefield formation in a laser plasma accelerator. The method takes advantage of the properties of the Discrete Fourier Transform, the linearity of Maxwell’s equations and the finite speed of light for limiting the communications of data within guard regions between neighboring computational domains. Although this requires a small approximation, test results show that no significant error is made on the test cases that have been presented. The proposed method opens the way to solvers combining the favorable parallel scaling of standard finite-difference methods with the accuracy advantages of pseudo-spectral methods

Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers

Energy Technology Data Exchange (ETDEWEB)

Tang, Yu-Hang, E-mail: yuhang_tang@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Kudo, Shuhei, E-mail: shuhei-kudo@outlook.jp [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe, 657-8501 (Japan); Bian, Xin, E-mail: xin_bian@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Li, Zhen, E-mail: zhen_li@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Karniadakis, George Em, E-mail: george_karniadakis@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Collaboratory on Mathematics for Mesoscopic Modeling of Materials, Pacific Northwest National Laboratory, Richland, WA 99354 (United States)

2015-09-15

Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)

Solving very large scattering problems using a parallel PWTD-enhanced surface integral equation solver

KAUST Repository

Liu, Yang

2013-07-01

The computational complexity and memory requirements of multilevel plane wave time domain (PWTD)-accelerated marching-on-in-time (MOT)-based surface integral equation (SIE) solvers scale as O(NtNs(log 2)Ns) and O(Ns 1.5); here N t and Ns denote numbers of temporal and spatial basis functions discretizing the current [Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003]. In the past, serial versions of these solvers have been successfully applied to the analysis of scattering from perfect electrically conducting as well as homogeneous penetrable targets involving up to Ns ≈ 0.5 × 106 and Nt ≈ 10 3. To solve larger problems, parallel PWTD-enhanced MOT solvers are called for. Even though a simple parallelization strategy was demonstrated in the context of electromagnetic compatibility analysis [M. Lu et al., in Proc. IEEE Int. Symp. AP-S, 4, 4212-4215, 2004], by and large, progress in this area has been slow. The lack of progress can be attributed wholesale to difficulties associated with the construction of a scalable PWTD kernel. © 2013 IEEE.

Application of Nearly Linear Solvers to Electric Power System Computation

Science.gov (United States)

Grant, Lisa L.

To meet the future needs of the electric power system, improvements need to be made in the areas of power system algorithms, simulation, and modeling, specifically to achieve a time frame that is useful to industry. If power system time-domain simulations could run in real-time, then system operators would have situational awareness to implement online control and avoid cascading failures, significantly improving power system reliability. Several power system applications rely on the solution of a very large linear system. As the demands on power systems continue to grow, there is a greater computational complexity involved in solving these large linear systems within reasonable time. This project expands on the current work in fast linear solvers, developed for solving symmetric and diagonally dominant linear systems, in order to produce power system specific methods that can be solved in nearly-linear run times. The work explores a new theoretical method that is based on ideas in graph theory and combinatorics. The technique builds a chain of progressively smaller approximate systems with preconditioners based on the system's low stretch spanning tree. The method is compared to traditional linear solvers and shown to reduce the time and iterations required for an accurate solution, especially as the system size increases. A simulation validation is performed, comparing the solution capabilities of the chain method to LU factorization, which is the standard linear solver for power flow. The chain method was successfully demonstrated to produce accurate solutions for power flow simulation on a number of IEEE test cases, and a discussion on how to further improve the method's speed and accuracy is included.

Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model

Energy Technology Data Exchange (ETDEWEB)

Baudron, Anne-Marie, E-mail: anne-marie.baudron@cea.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CEA-DRN/DMT/SERMA, CEN-Saclay, 91191 Gif sur Yvette Cedex (France); Lautard, Jean-Jacques, E-mail: jean-jacques.lautard@cea.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CEA-DRN/DMT/SERMA, CEN-Saclay, 91191 Gif sur Yvette Cedex (France); Maday, Yvon, E-mail: maday@ann.jussieu.fr [Sorbonne Universités, UPMC Univ Paris 06, UMR 7598, Laboratoire Jacques-Louis Lions and Institut Universitaire de France, F-75005, Paris (France); Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); Brown Univ, Division of Applied Maths, Providence, RI (United States); Riahi, Mohamed Kamel, E-mail: riahi@cmap.polytechnique.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CMAP, Inria-Saclay and X-Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex (France); Salomon, Julien, E-mail: salomon@ceremade.dauphine.fr [CEREMADE, Univ Paris-Dauphine, Pl. du Mal. de Lattre de Tassigny, F-75016, Paris (France)

2014-12-15

In this paper we present a time-parallel algorithm for the 3D neutrons calculation of a transient model in a nuclear reactor core. The neutrons calculation consists in numerically solving the time dependent diffusion approximation equation, which is a simplified transport equation. The numerical resolution is done with finite elements method based on a tetrahedral meshing of the computational domain, representing the reactor core, and time discretization is achieved using a θ-scheme. The transient model presents moving control rods during the time of the reaction. Therefore, cross-sections (piecewise constants) are taken into account by interpolations with respect to the velocity of the control rods. The parallelism across the time is achieved by an adequate use of the parareal in time algorithm to the handled problem. This parallel method is a predictor corrector scheme that iteratively combines the use of two kinds of numerical propagators, one coarse and one fine. Our method is made efficient by means of a coarse solver defined with large time step and fixed position control rods model, while the fine propagator is assumed to be a high order numerical approximation of the full model. The parallel implementation of our method provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch–Maurer–Werner benchmark.

Finite-element time-domain modeling of electromagnetic data in general dispersive medium using adaptive Padé series

Science.gov (United States)

Cai, Hongzhu; Hu, Xiangyun; Xiong, Bin; Zhdanov, Michael S.

2017-12-01

The induced polarization (IP) method has been widely used in geophysical exploration to identify the chargeable targets such as mineral deposits. The inversion of the IP data requires modeling the IP response of 3D dispersive conductive structures. We have developed an edge-based finite-element time-domain (FETD) modeling method to simulate the electromagnetic (EM) fields in 3D dispersive medium. We solve the vector Helmholtz equation for total electric field using the edge-based finite-element method with an unstructured tetrahedral mesh. We adopt the backward propagation Euler method, which is unconditionally stable, with semi-adaptive time stepping for the time domain discretization. We use the direct solver based on a sparse LU decomposition to solve the system of equations. We consider the Cole-Cole model in order to take into account the frequency-dependent conductivity dispersion. The Cole-Cole conductivity model in frequency domain is expanded using a truncated Padé series with adaptive selection of the center frequency of the series for early and late time. This approach can significantly increase the accuracy of FETD modeling.

Scalability of Direct Solver for Non-stationary Cahn-Hilliard Simulations with Linearized time Integration Scheme

KAUST Repository

Woźniak, M.

2016-06-02

We study the features of a new mixed integration scheme dedicated to solving the non-stationary variational problems. The scheme is composed of the FEM approximation with respect to the space variable coupled with a 3-leveled time integration scheme with a linearized right-hand side operator. It was applied in solving the Cahn-Hilliard parabolic equation with a nonlinear, fourth-order elliptic part. The second order of the approximation along the time variable was proven. Moreover, the good scalability of the software based on this scheme was confirmed during simulations. We verify the proposed time integration scheme by monitoring the Ginzburg-Landau free energy. The numerical simulations are performed by using a parallel multi-frontal direct solver executed over STAMPEDE Linux cluster. Its scalability was compared to the results of the three direct solvers, including MUMPS, SuperLU and PaSTiX.

A volume integral equation solver for quantum-corrected transient analysis of scattering from plasmonic nanostructures

KAUST Repository

Sayed, Sadeed Bin; Uysal, Ismail Enes; Bagci, Hakan; Ulku, H. Arda

2018-01-01

Quantum tunneling is observed between two nanostructures that are separated by a sub-nanometer gap. Electrons “jumping” from one structure to another create an additional current path. An auxiliary tunnel is introduced between the two structures as a support for this so that a classical electromagnetic solver can account for the effects of quantum tunneling. The dispersive permittivity of the tunnel is represented by a Drude model, whose parameters are obtained from the electron tunneling probability. The transient scattering from the connected nanostructures (i.e., nanostructures plus auxiliary tunnel) is analyzed using a time domain volume integral equation solver. Numerical results demonstrating the effect of quantum tunneling on the scattered fields are provided.

A Massively Parallel Solver for the Mechanical Harmonic Analysis of Accelerator Cavities

International Nuclear Information System (INIS)

2015-01-01

ACE3P is a 3D massively parallel simulation suite that developed at SLAC National Accelerator Laboratory that can perform coupled electromagnetic, thermal and mechanical study. Effectively utilizing supercomputer resources, ACE3P has become a key simulation tool for particle accelerator R and D. A new frequency domain solver to perform mechanical harmonic response analysis of accelerator components is developed within the existing parallel framework. This solver is designed to determine the frequency response of the mechanical system to external harmonic excitations for time-efficient accurate analysis of the large-scale problems. Coupled with the ACE3P electromagnetic modules, this capability complements a set of multi-physics tools for a comprehensive study of microphonics in superconducting accelerating cavities in order to understand the RF response and feedback requirements for the operational reliability of a particle accelerator. (auth)

Compact tunable silicon photonic differential-equation solver for general linear time-invariant systems.

Science.gov (United States)

Wu, Jiayang; Cao, Pan; Hu, Xiaofeng; Jiang, Xinhong; Pan, Ting; Yang, Yuxing; Qiu, Ciyuan; Tremblay, Christine; Su, Yikai

2014-10-20

We propose and experimentally demonstrate an all-optical temporal differential-equation solver that can be used to solve ordinary differential equations (ODEs) characterizing general linear time-invariant (LTI) systems. The photonic device implemented by an add-drop microring resonator (MRR) with two tunable interferometric couplers is monolithically integrated on a silicon-on-insulator (SOI) wafer with a compact footprint of ~60 μm × 120 μm. By thermally tuning the phase shifts along the bus arms of the two interferometric couplers, the proposed device is capable of solving first-order ODEs with two variable coefficients. The operation principle is theoretically analyzed, and system testing of solving ODE with tunable coefficients is carried out for 10-Gb/s optical Gaussian-like pulses. The experimental results verify the effectiveness of the fabricated device as a tunable photonic ODE solver.

Asynchronous Parallelization of a CFD Solver

OpenAIRE

Abdi, Daniel S.; Bitsuamlak, Girma T.

2015-01-01

The article of record as published may be found at http://dx.doi.org/10.1155/2015/295393 A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used inCFDcodes; however, it has a potential to alleviate scaling bottlenecks incurred due to process...

Matlab Geochemistry: An open source geochemistry solver based on MRST

Science.gov (United States)

McNeece, C. J.; Raynaud, X.; Nilsen, H.; Hesse, M. A.

2017-12-01

The study of geological systems often requires the solution of complex geochemical relations. To address this need we present an open source geochemical solver based on the Matlab Reservoir Simulation Toolbox (MRST) developed by SINTEF. The implementation supports non-isothermal multicomponent aqueous complexation, surface complexation, ion exchange, and dissolution/precipitation reactions. The suite of tools available in MRST allows for rapid model development, in particular the incorporation of geochemical calculations into transport simulations of multiple phases, complex domain geometry and geomechanics. Different numerical schemes and additional physics can be easily incorporated into the existing tools through the object-oriented framework employed by MRST. The solver leverages the automatic differentiation tools available in MRST to solve arbitrarily complex geochemical systems with any choice of species or element concentration as input. Four mathematical approaches enable the solver to be quite robust: 1) the choice of chemical elements as the basis components makes all entries in the composition matrix positive thus preserving convexity, 2) a log variable transformation is used which transfers the nonlinearity to the convex composition matrix, 3) a priori bounds on variables are calculated from the structure of the problem, constraining Netwon's path and 4) an initial guess is calculated implicitly by sequentially adding model complexity. As a benchmark we compare the model to experimental and semi-analytic solutions of the coupled salinity-acidity transport system. Together with the reservoir simulation capabilities of MRST the solver offers a promising tool for geochemical simulations in reservoir domains for applications in a diversity of fields from enhanced oil recovery to radionuclide storage.

Continuous-time quantum Monte Carlo impurity solvers

Science.gov (United States)

Gull, Emanuel; Werner, Philipp; Fuchs, Sebastian; Surer, Brigitte; Pruschke, Thomas; Troyer, Matthias

2011-04-01

Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states. Program summaryProgram title: dmft Catalogue identifier: AEIL_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: ALPS LIBRARY LICENSE version 1.1 No. of lines in distributed program, including test data, etc.: 899 806 No. of bytes in distributed program, including test data, etc.: 32 153 916 Distribution format: tar.gz Programming language: C++ Operating system: The ALPS libraries have been tested on the following platforms and compilers: Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher) MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0) IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers Compaq Tru64 UNIX with Compq C++ Compiler (cxx) SGI IRIX with MIPSpro C++ Compiler (CC) HP-UX with HP C++ Compiler (aCC) Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher) RAM: 10 MB-1 GB Classification: 7.3 External routines: ALPS [1], BLAS/LAPACK, HDF5 Nature of problem: (See [2].) Quantum impurity models describe an atom or molecule embedded in a host material with which it can exchange electrons. They are basic to nanoscience as

Differences in the Processes of Solving Physics Problems between Good Physics Problem Solvers and Poor Physics Problem Solvers.

Science.gov (United States)

Finegold, M.; Mass, R.

1985-01-01

Good problem solvers and poor problem solvers in advanced physics (N=8) were significantly different in their ability in translating, planning, and physical reasoning, as well as in problem solving time; no differences in reliance on algebraic solutions and checking problems were noted. Implications for physics teaching are discussed. (DH)

libmpdata++ 1.0: a library of parallel MPDATA solvers for systems of generalised transport equations

Science.gov (United States)

Jaruga, A.; Arabas, S.; Jarecka, D.; Pawlowska, H.; Smolarkiewicz, P. K.; Waruszewski, M.

2015-04-01

This paper accompanies the first release of libmpdata++, a C++ library implementing the multi-dimensional positive-definite advection transport algorithm (MPDATA) on regular structured grid. The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; a shallow-water system compared with analytical solution (originally derived for a 2-D case); and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.

libmpdata++ 0.1: a library of parallel MPDATA solvers for systems of generalised transport equations

Science.gov (United States)

Jaruga, A.; Arabas, S.; Jarecka, D.; Pawlowska, H.; Smolarkiewicz, P. K.; Waruszewski, M.

2014-11-01

This paper accompanies first release of libmpdata++, a C++ library implementing the Multidimensional Positive-Definite Advection Transport Algorithm (MPDATA). The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include: homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; shallow-water system compared with analytical solution (originally derived for a 2-D case); and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.

Explicit solution of Calderon preconditioned time domain integral equations

KAUST Repository

Ulku, Huseyin Arda; Bagci, Hakan; Michielssen, Eric

2013-01-01

operators and a PE(CE)m type linear multistep to march on in time. Unlike its implicit counterpart, the proposed explicit solver requires the solution of an MOT system with a Gram matrix that is sparse and well-conditioned independent of the time step size

Hybrid Fourier pseudospectral/discontinuous Galerkin time-domain method for wave propagation

Science.gov (United States)

Pagán Muñoz, Raúl; Hornikx, Maarten

2017-11-01

The Fourier Pseudospectral time-domain (Fourier PSTD) method was shown to be an efficient way of modelling acoustic propagation problems as described by the linearized Euler equations (LEE), but is limited to real-valued frequency independent boundary conditions and predominantly staircase-like boundary shapes. This paper presents a hybrid approach to solve the LEE, coupling Fourier PSTD with a nodal Discontinuous Galerkin (DG) method. DG exhibits almost no restrictions with respect to geometrical complexity or boundary conditions. The aim of this novel method is to allow the computation of complex geometries and to be a step towards the implementation of frequency dependent boundary conditions by using the benefits of DG at the boundaries, while keeping the efficient Fourier PSTD in the bulk of the domain. The hybridization approach is based on conformal meshes to avoid spatial interpolation of the DG solutions when transferring values from DG to Fourier PSTD, while the data transfer from Fourier PSTD to DG is done utilizing spectral interpolation of the Fourier PSTD solutions. The accuracy of the hybrid approach is presented for one- and two-dimensional acoustic problems and the main sources of error are investigated. It is concluded that the hybrid methodology does not introduce significant errors compared to the Fourier PSTD stand-alone solver. An example of a cylinder scattering problem is presented and accurate results have been obtained when using the proposed approach. Finally, no instabilities were found during long-time calculation using the current hybrid methodology on a two-dimensional domain.

A Numerical Study of Scalable Cardiac Electro-Mechanical Solvers on HPC Architectures

Directory of Open Access Journals (Sweden)

Piero Colli Franzone

2018-04-01

Full Text Available We introduce and study some scalable domain decomposition preconditioners for cardiac electro-mechanical 3D simulations on parallel HPC (High Performance Computing architectures. The electro-mechanical model of the cardiac tissue is composed of four coupled sub-models: (1 the static finite elasticity equations for the transversely isotropic deformation of the cardiac tissue; (2 the active tension model describing the dynamics of the intracellular calcium, cross-bridge binding and myofilament tension; (3 the anisotropic Bidomain model describing the evolution of the intra- and extra-cellular potentials in the deforming cardiac tissue; and (4 the ionic membrane model describing the dynamics of ionic currents, gating variables, ionic concentrations and stretch-activated channels. This strongly coupled electro-mechanical model is discretized in time with a splitting semi-implicit technique and in space with isoparametric finite elements. The resulting scalable parallel solver is based on Multilevel Additive Schwarz preconditioners for the solution of the Bidomain system and on BDDC preconditioned Newton-Krylov solvers for the non-linear finite elasticity system. The results of several 3D parallel simulations show the scalability of both linear and non-linear solvers and their application to the study of both physiological excitation-contraction cardiac dynamics and re-entrant waves in the presence of different mechano-electrical feedbacks.

Parallel implementations of 2D explicit Euler solvers

International Nuclear Information System (INIS)

Giraud, L.; Manzini, G.

1996-01-01

In this work we present a subdomain partitioning strategy applied to an explicit high-resolution Euler solver. We describe the design of a portable parallel multi-domain code suitable for parallel environments. We present several implementations on a representative range of MlMD computers that include shared memory multiprocessors, distributed virtual shared memory computers, as well as networks of workstations. Computational results are given to illustrate the efficiency, the scalability, and the limitations of the different approaches. We discuss also the effect of the communication protocol on the optimal domain partitioning strategy for the distributed memory computers

Neutron transport solver parallelization using a Domain Decomposition method

International Nuclear Information System (INIS)

Van Criekingen, S.; Nataf, F.; Have, P.

2008-01-01

A domain decomposition (DD) method is investigated for the parallel solution of the second-order even-parity form of the time-independent Boltzmann transport equation. The spatial discretization is performed using finite elements, and the angular discretization using spherical harmonic expansions (P N method). The main idea developed here is due to P.L. Lions. It consists in having sub-domains exchanging not only interface point flux values, but also interface flux 'derivative' values. (The word 'derivative' is here used with quotes, because in the case considered here, it in fact consists in the Ω.∇ operator, with Ω the angular variable vector and ∇ the spatial gradient operator.) A parameter α is introduced, as proportionality coefficient between point flux and 'derivative' values. This parameter can be tuned - so far heuristically - to optimize the method. (authors)

Refined isogeometric analysis for a preconditioned conjugate gradient solver

KAUST Repository

Garcia, Daniel

2018-02-12

Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.

Domain decomposition methods for the neutron diffusion problem

International Nuclear Information System (INIS)

Guerin, P.; Baudron, A. M.; Lautard, J. J.

2010-01-01

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, simplified transport (SPN) or diffusion approximations are often used. The MINOS solver developed at CEA Saclay uses a mixed dual finite element method for the resolution of these problems. and has shown his efficiency. In order to take into account the heterogeneities of the geometry, a very fine mesh is generally required, and leads to expensive calculations for industrial applications. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose here two domain decomposition methods based on the MINOS solver. The first approach is a component mode synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is an iterative method based on a non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the adjacent sub-domains estimated at the previous iteration. Numerical results on parallel computers are presented for the diffusion model on realistic 2D and 3D cores. (authors)

Parallel time domain solvers for electrically large transient scattering problems

KAUST Repository

Liu, Yang; Yucel, Abdulkadir; Bagcý , Hakan; Michielssen, Eric

2014-01-01

scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary

Differential equations problem solver

CERN Document Server

Arterburn, David R

2012-01-01

REA's Problem Solvers is a series of useful, practical, and informative study guides. Each title in the series is complete step-by-step solution guide. The Differential Equations Problem Solver enables students to solve difficult problems by showing them step-by-step solutions to Differential Equations problems. The Problem Solvers cover material ranging from the elementary to the advanced and make excellent review books and textbook companions. They're perfect for undergraduate and graduate studies.The Differential Equations Problem Solver is the perfect resource for any class, any exam, and

BCYCLIC: A parallel block tridiagonal matrix cyclic solver

Science.gov (United States)

Hirshman, S. P.; Perumalla, K. S.; Lynch, V. E.; Sanchez, R.

2010-09-01

A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved using multithreaded routines (OpenMP, GotoBLAS) for block matrix manipulation. This dual scalability is a noteworthy feature of this new solver, as well as its ability to efficiently handle arbitrary (non-powers-of-2) block row and processor numbers. Comparison with a state-of-the art parallel sparse solver is presented. It is expected that this new solver will allow many physical applications to optimally use the parallel resources on current supercomputers. Example usage of the solver in magneto-hydrodynamic (MHD), three-dimensional equilibrium solvers for high-temperature fusion plasmas is cited.

BRAIN initiative: fast and parallel solver for real-time monitoring of the eddy current in the brain for TMS applications.

Science.gov (United States)

Sabouni, Abas; Pouliot, Philippe; Shmuel, Amir; Lesage, Frederic

2014-01-01

This paper introduce a fast and efficient solver for simulating the induced (eddy) current distribution in the brain during transcranial magnetic stimulation procedure. This solver has been integrated with MRI and neuronavigation software to accurately model the electromagnetic field and show eddy current in the head almost in real-time. To examine the performance of the proposed technique, we used a 3D anatomically accurate MRI model of the 25 year old female subject.

A new iterative solver for the time-harmonic wave equation

NARCIS (Netherlands)

Riyanti, C.D.; Erlangga, Y.A.; Plessix, R.E.; Mulder, W.A.; Vuik, C.; Oosterlee, C.

2006-01-01

The time-harmonic wave equation, also known as the Helmholtz equation, is obtained if the constant-density acoustic wave equation is transformed from the time domain to the frequency domain. Its discretization results in a large, sparse, linear system of equations. In two dimensions, this system can

Algorithms for parallel flow solvers on message passing architectures

Science.gov (United States)

Vanderwijngaart, Rob F.

1995-01-01

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those

Full-Wave Analysis of Traveling-Wave Field-Effect Transistors Using Finite-Difference Time-Domain Method

Directory of Open Access Journals (Sweden)

Koichi Narahara

2012-01-01

Full Text Available Nonlinear transmission lines, which define transmission lines periodically loaded with nonlinear devices such as varactors, diodes, and transistors, are modeled in the framework of finite-difference time-domain (FDTD method. Originally, some root-finding routine is needed to evaluate the contributions of nonlinear device currents appropriately to the temporally advanced electrical fields. Arbitrary nonlinear transmission lines contain large amount of nonlinear devices; therefore, it costs too much time to complete calculations. To reduce the calculation time, we recently developed a simple model of diodes to eliminate root-finding routines in an FDTD solver. Approximating the diode current-voltage relation by a piecewise-linear function, an extended Ampere's law is solved in a closed form for the time-advanced electrical fields. In this paper, we newly develop an FDTD model of field-effect transistors (FETs, together with several numerical examples that demonstrate pulse-shortening phenomena in a traveling-wave FET.

GPU accelerated FDTD solver and its application in MRI.

Science.gov (United States)

Chi, J; Liu, F; Jin, J; Mason, D G; Crozier, S

2010-01-01

The finite difference time domain (FDTD) method is a popular technique for computational electromagnetics (CEM). The large computational power often required, however, has been a limiting factor for its applications. In this paper, we will present a graphics processing unit (GPU)-based parallel FDTD solver and its successful application to the investigation of a novel B1 shimming scheme for high-field magnetic resonance imaging (MRI). The optimized shimming scheme exhibits considerably improved transmit B(1) profiles. The GPU implementation dramatically shortened the runtime of FDTD simulation of electromagnetic field compared with its CPU counterpart. The acceleration in runtime has made such investigation possible, and will pave the way for other studies of large-scale computational electromagnetic problems in modern MRI which were previously impractical.

A parallel direct solver for the self-adaptive hp Finite Element Method

KAUST Repository

Paszyński, Maciej R.

2010-03-01

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.

Chromatographic peak resolution using Microsoft Excel Solver. The merit of time shifting input arrays.

Science.gov (United States)

Dasgupta, Purnendu K

2008-12-05

Resolution of overlapped chromatographic peaks is generally accomplished by modeling the peaks as Gaussian or modified Gaussian functions. It is possible, even preferable, to use actual single analyte input responses for this purpose and a nonlinear least squares minimization routine such as that provided by Microsoft Excel Solver can then provide the resolution. In practice, the quality of the results obtained varies greatly due to small shifts in retention time. I show here that such deconvolution can be considerably improved if one or more of the response arrays are iteratively shifted in time.

MINOS: A simplified Pn solver for core calculation

International Nuclear Information System (INIS)

Baudron, A.M.; Lautard, J.J.

2007-01-01

This paper describes a new generation of the neutronic core solver MINOS resulting from developments done in the DESCARTES project. For performance reasons, the numerical method of the existing MINOS solver in the SAPHYR system has been reused in the new system. It is based on the mixed-dual finite element approximation of the simplified transport equation. We have extended the previous method to the treatment of unstructured geometries composed by quadrilaterals, allowing us to treat geometries where fuel pins are exactly represented. For Cartesian geometries, the solver takes into account assembly discontinuity coefficients in the simplified P n context. The solver has been rewritten in C + + programming language using an object-oriented design. Its general architecture was reconsidered in order to improve its capability of evolution and its maintainability. Moreover, the performance of the previous version has been improved mainly regarding the matrix construction time; this result improves significantly the performance of the solver in the context of industrial application requiring thermal-hydraulic feedback and depletion calculations. (authors)

Wing aeroelasticity analysis based on an integral boundary-layer method coupled with Euler solver

Directory of Open Access Journals (Sweden)

Ma Yanfeng

2016-10-01

Full Text Available An interactive boundary-layer method, which solves the unsteady flow, is developed for aeroelastic computation in the time domain. The coupled method combines the Euler solver with the integral boundary-layer solver (Euler/BL in a “semi-inverse” manner to compute flows with the inviscid and viscous interaction. Unsteady boundary conditions on moving surfaces are taken into account by utilizing the approximate small-perturbation method without moving the computational grids. The steady and unsteady flow calculations for the LANN wing are presented. The wing tip displacement of high Reynolds number aero-structural dynamics (HIRENASD Project is simulated under different angles of attack. The flutter-boundary predictions for the AGARD 445.6 wing are provided. The results of the interactive boundary-layer method are compared with those of the Euler method and experimental data. The study shows that viscous effects are significant for these cases and the further data analysis confirms the validity and practicability of the coupled method.

A multi-solver quasi-Newton method for the partitioned simulation of fluid-structure interaction

International Nuclear Information System (INIS)

Degroote, J; Annerel, S; Vierendeels, J

2010-01-01

In partitioned fluid-structure interaction simulations, the flow equations and the structural equations are solved separately. Consequently, the stresses and displacements on both sides of the fluid-structure interface are not automatically in equilibrium. Coupling techniques like Aitken relaxation and the Interface Block Quasi-Newton method with approximate Jacobians from Least-Squares models (IBQN-LS) enforce this equilibrium, even with black-box solvers. However, all existing coupling techniques use only one flow solver and one structural solver. To benefit from the large number of multi-core processors in modern clusters, a new Multi-Solver Interface Block Quasi-Newton (MS-IBQN-LS) algorithm has been developed. This algorithm uses more than one flow solver and structural solver, each running in parallel on a number of cores. One-dimensional and three-dimensional numerical experiments demonstrate that the run time of a simulation decreases as the number of solvers increases, albeit at a slower pace. Hence, the presented multi-solver algorithm accelerates fluid-structure interaction calculations by increasing the number of solvers, especially when the run time does not decrease further if more cores are used per solver.

Parallel iterative solvers and preconditioners using approximate hierarchical methods

Energy Technology Data Exchange (ETDEWEB)

Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

1996-12-31

In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.

A high-order finite-difference linear seakeeping solver tool for calculation of added resistance in waves

DEFF Research Database (Denmark)

Amini Afshar, Mostafa; Bingham, Harry B.; Read, Robert

During recent years a computational strategy has been developed at the Technical University of Denmark for numerical simulation of water wave problems based on the high-order nite-dierence method, [2],[4]. These methods exhibit a linear scaling of the computational eort as the number of grid points...... increases. This understanding is being applied to develop a tool for predicting the added resistance (drift force) of ships in ocean waves. We expect that the optimal scaling properties of this solver will allow us to make a convincing demonstration of convergence of the added resistance calculations based...... on both near-eld and far-eld methods. The solver has been written inside a C++ library known as Overture [3], which can be used to solve partial dierential equations on overlapping grids based on the high-order nite-dierence method. The resulting code is able to solve, in the time domain, the linearised...

Heliborne time domain electromagnetic system

International Nuclear Information System (INIS)

Bhattacharya, S.

2009-01-01

Atomic Minerals Directorate (AMD), are using heliborne and ground time domain electromagnetic (TDEM) system for the exploration of deep seated unconformity type uranium deposits. Uranium has been explored in various parts of the world like Athabasca basin using time domain electromagnetic system. AMD has identified some areas in India where such deposits are available. Apart from uranium exploration, the TDEM systems are used for the exploration of deep seated minerals like diamonds. Bhabha Atomic Research Centre (BARC) is involved in the indigenous design of the heliborne time domain system since this system is useful for DAE and also it has a scope of wide application. In this paper we discuss about the principle of time domain electromagnetic systems, their capabilities and the development and problems of such system for various other mineral exploration. (author)

A non-conforming 3D spherical harmonic transport solver

Energy Technology Data Exchange (ETDEWEB)

Van Criekingen, S. [Commissariat a l' Energie Atomique CEA-Saclay, DEN/DM2S/SERMA/LENR Bat 470, 91191 Gif-sur-Yvette, Cedex (France)

2006-07-01

A new 3D transport solver for the time-independent Boltzmann transport equation has been developed. This solver is based on the second-order even-parity form of the transport equation. The angular discretization is performed through the expansion of the angular neutron flux in spherical harmonics (PN method). The novelty of this solver is the use of non-conforming finite elements for the spatial discretization. Such elements lead to a discontinuous flux approximation. This interface continuity requirement relaxation property is shared with mixed-dual formulations such as the ones based on Raviart-Thomas finite elements. Encouraging numerical results are presented. (authors)

A non-conforming 3D spherical harmonic transport solver

International Nuclear Information System (INIS)

Van Criekingen, S.

2006-01-01

A new 3D transport solver for the time-independent Boltzmann transport equation has been developed. This solver is based on the second-order even-parity form of the transport equation. The angular discretization is performed through the expansion of the angular neutron flux in spherical harmonics (PN method). The novelty of this solver is the use of non-conforming finite elements for the spatial discretization. Such elements lead to a discontinuous flux approximation. This interface continuity requirement relaxation property is shared with mixed-dual formulations such as the ones based on Raviart-Thomas finite elements. Encouraging numerical results are presented. (authors)

Multilevel domain decomposition for electronic structure calculations

International Nuclear Information System (INIS)

Barrault, M.; Cances, E.; Hager, W.W.; Le Bris, C.

2007-01-01

We introduce a new multilevel domain decomposition method (MDD) for electronic structure calculations within semi-empirical and density functional theory (DFT) frameworks. This method iterates between local fine solvers and global coarse solvers, in the spirit of domain decomposition methods. Using this approach, calculations have been successfully performed on several linear polymer chains containing up to 40,000 atoms and 200,000 atomic orbitals. Both the computational cost and the memory requirement scale linearly with the number of atoms. Additional speed-up can easily be obtained by parallelization. We show that this domain decomposition method outperforms the density matrix minimization (DMM) method for poor initial guesses. Our method provides an efficient preconditioner for DMM and other linear scaling methods, variational in nature, such as the orbital minimization (OM) procedure

Time domain SAR raw data simulation using CST and image focusing of 3D objects

Science.gov (United States)

Saeed, Adnan; Hellwich, Olaf

2017-10-01

This paper presents the use of a general purpose electromagnetic simulator, CST, to simulate realistic synthetic aperture radar (SAR) raw data of three-dimensional objects. Raw data is later focused in MATLAB using range-doppler algorithm. Within CST Microwave Studio a replica of TerraSAR-X chirp signal is incident upon a modeled Corner Reflector (CR) whose design and material properties are identical to that of the real one. Defining mesh and other appropriate settings reflected wave is measured at several distant points within a line parallel to the viewing direction. This is analogous to an array antenna and is synthesized to create a long aperture for SAR processing. The time domain solver in CST is based on the solution of differential form of Maxwells equations. Exported data from CST is arranged into a 2-d matrix of axis range and azimuth. Hilbert transform is applied to convert the real signal to complex data with phase information. Range compression, range cell migration correction (RCMC), and azimuth compression are applied in time domain to obtain the final SAR image. This simulation can provide valuable information to clarify which real world objects cause images suitable for high accuracy identification in the SAR images.

Conversion of Dielectric Data from the Time Domain to the Frequency Domain

Directory of Open Access Journals (Sweden)

Vladimir Durman

2005-01-01

Full Text Available Polarisation and conduction processes in dielectric systems can be identified by the time domain or the frequency domain measurements. If the systems is a linear one, the results of the time domain measurements can be transformed into the frequency domain, and vice versa. Commonly, the time domain data of the absorption conductivity are transformed into the frequency domain data of the dielectric susceptibility. In practice, the relaxation are mainly evaluated by the frequency domain data. In the time domain, the absorption current measurement were prefered up to now. Recent methods are based on the recovery voltage measurements. In this paper a new method of the recovery data conversion from the time the frequency domain is proposed. The method is based on the analysis of the recovery voltage transient based on the Maxwell equation for the current density in a dielectric. Unlike the previous published solutions, the Laplace fransform was used to derive a formula suitable for practical purposes. the proposed procedure allows also calculating of the insulation resistance and separating the polarisation and conduction losses.

Using SPARK as a Solver for Modelica

Energy Technology Data Exchange (ETDEWEB)

Wetter, Michael; Wetter, Michael; Haves, Philip; Moshier, Michael A.; Sowell, Edward F.

2008-06-30

Modelica is an object-oriented acausal modeling language that is well positioned to become a de-facto standard for expressing models of complex physical systems. To simulate a model expressed in Modelica, it needs to be translated into executable code. For generating run-time efficient code, such a translation needs to employ algebraic formula manipulations. As the SPARK solver has been shown to be competitive for generating such code but currently cannot be used with the Modelica language, we report in this paper how SPARK's symbolic and numerical algorithms can be implemented in OpenModelica, an open-source implementation of a Modelica modeling and simulation environment. We also report benchmark results that show that for our air flow network simulation benchmark, the SPARK solver is competitive with Dymola, which is believed to provide the best solver for Modelica.

An accurate, fast, and scalable solver for high-frequency wave propagation

Science.gov (United States)

Zepeda-Núñez, L.; Taus, M.; Hewett, R.; Demanet, L.

2017-12-01

In many science and engineering applications, solving time-harmonic high-frequency wave propagation problems quickly and accurately is of paramount importance. For example, in geophysics, particularly in oil exploration, such problems can be the forward problem in an iterative process for solving the inverse problem of subsurface inversion. It is important to solve these wave propagation problems accurately in order to efficiently obtain meaningful solutions of the inverse problems: low order forward modeling can hinder convergence. Additionally, due to the volume of data and the iterative nature of most optimization algorithms, the forward problem must be solved many times. Therefore, a fast solver is necessary to make solving the inverse problem feasible. For time-harmonic high-frequency wave propagation, obtaining both speed and accuracy is historically challenging. Recently, there have been many advances in the development of fast solvers for such problems, including methods which have linear complexity with respect to the number of degrees of freedom. While most methods scale optimally only in the context of low-order discretizations and smooth wave speed distributions, the method of polarized traces has been shown to retain optimal scaling for high-order discretizations, such as hybridizable discontinuous Galerkin methods and for highly heterogeneous (and even discontinuous) wave speeds. The resulting fast and accurate solver is consequently highly attractive for geophysical applications. To date, this method relies on a layered domain decomposition together with a preconditioner applied in a sweeping fashion, which has limited straight-forward parallelization. In this work, we introduce a new version of the method of polarized traces which reveals more parallel structure than previous versions while preserving all of its other advantages. We achieve this by further decomposing each layer and applying the preconditioner to these new components separately and

High order Poisson Solver for unbounded flows

DEFF Research Database (Denmark)

Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe

2015-01-01

This paper presents a high order method for solving the unbounded Poisson equation on a regular mesh using a Green’s function solution. The high order convergence was achieved by formulating mollified integration kernels, that were derived from a filter regularisation of the solution field....... The method was implemented on a rectangular domain using fast Fourier transforms (FFT) to increase computational efficiency. The Poisson solver was extended to directly solve the derivatives of the solution. This is achieved either by including the differential operator in the integration kernel...... the equations of fluid mechanics as an example, but can be used in many physical problems to solve the Poisson equation on a rectangular unbounded domain. For the two-dimensional case we propose an infinitely smooth test function which allows for arbitrary high order convergence. Using Gaussian smoothing...

Free vibration analysis of elastic structures submerged in an infinite or semi-infinite fluid domain by means of a coupled FE-BE solver

Science.gov (United States)

Zheng, Chang-Jun; Bi, Chuan-Xing; Zhang, Chuanzeng; Gao, Hai-Feng; Chen, Hai-Bo

2018-04-01

The vibration behavior of thin elastic structures can be noticeably influenced by the surrounding water, which represents a kind of heavy fluid. Since the feedback of the acoustic pressure onto the structure cannot be neglected in this case, a strong coupled scheme between the structural and fluid domains is usually required. In this work, a coupled finite element and boundary element (FE-BE) solver is developed for the free vibration analysis of structures submerged in an infinite fluid domain or a semi-infinite fluid domain with a free water surface. The structure is modeled by the finite element method (FEM). The compressibility of the fluid is taken into account, and hence the Helmholtz equation serves as the governing equation of the fluid domain. The boundary element method (BEM) is employed to model the fluid domain, and a boundary integral formulation with a half-space fundamental solution is used to satisfy the Dirichlet boundary condition on the free water surface exactly. The resulting nonlinear eigenvalue problem (NEVP) is converted into a small linear one by using a contour integral method. Adequate modifications are suggested to improve the efficiency of the contour integral method and avoid missing the eigenfrequencies of interest. The Burton-Miller method is used to filter out the fictitious eigenfrequencies of the boundary integral formulations. Numerical examples are given to demonstrate the accuracy and applicability of the developed eigensolver, and also show that the fluid-loading effect strongly depends on both the water depth and the mode shapes.

An Explicit MOT-TD-VIE Solver for Time Varying Media

KAUST Repository

Sayed, Sadeed Bin; Ulku, Huseyin Arda; Bagci, Hakan

2016-01-01

An explicit marching on-in-time (MOT) scheme for solving the time domain electric field integral equation enforced on volumes with time varying dielectric permittivity is proposed. Unknowns of the integral equation and the constitutive relation, i

Toward an optimal solver for time-spectral fluid-dynamic and aeroelastic solutions on unstructured meshes

Science.gov (United States)

Mundis, Nathan L.; Mavriplis, Dimitri J.

2017-09-01

The time-spectral method applied to the Euler and coupled aeroelastic equations theoretically offers significant computational savings for purely periodic problems when compared to standard time-implicit methods. However, attaining superior efficiency with time-spectral methods over traditional time-implicit methods hinges on the ability rapidly to solve the large non-linear system resulting from time-spectral discretizations which become larger and stiffer as more time instances are employed or the period of the flow becomes especially short (i.e. the maximum resolvable wave-number increases). In order to increase the efficiency of these solvers, and to improve robustness, particularly for large numbers of time instances, the Generalized Minimal Residual Method (GMRES) is used to solve the implicit linear system over all coupled time instances. The use of GMRES as the linear solver makes time-spectral methods more robust, allows them to be applied to a far greater subset of time-accurate problems, including those with a broad range of harmonic content, and vastly improves the efficiency of time-spectral methods. In previous work, a wave-number independent preconditioner that mitigates the increased stiffness of the time-spectral method when applied to problems with large resolvable wave numbers has been developed. This preconditioner, however, directly inverts a large matrix whose size increases in proportion to the number of time instances. As a result, the computational time of this method scales as the cube of the number of time instances. In the present work, this preconditioner has been reworked to take advantage of an approximate-factorization approach that effectively decouples the spatial and temporal systems. Once decoupled, the time-spectral matrix can be inverted in frequency space, where it has entries only on the main diagonal and therefore can be inverted quite efficiently. This new GMRES/preconditioner combination is shown to be over an order of

Anisotropic resonator analysis using the Fourier-Bessel mode solver

Science.gov (United States)

Gauthier, Robert C.

2018-03-01

A numerical mode solver for optical structures that conform to cylindrical symmetry using Faraday's and Ampere's laws as starting expressions is developed when electric or magnetic anisotropy is present. The technique builds on the existing Fourier-Bessel mode solver which allows resonator states to be computed exploiting the symmetry properties of the resonator and states to reduce the matrix system. The introduction of anisotropy into the theoretical frame work facilitates the inclusion of PML borders permitting the computation of open ended structures and a better estimation of the resonator state quality factor. Matrix populating expressions are provided that can accommodate any material anisotropy with arbitrary orientation in the computation domain. Several example of electrical anisotropic computations are provided for rationally symmetric structures such as standard optical fibers, axial Bragg-ring fibers and bottle resonators. The anisotropy present in the materials introduces off diagonal matrix elements in the permittivity tensor when expressed in cylindrical coordinates. The effects of the anisotropy of computed states are presented and discussed.

Three-dimensional inverse modelling of damped elastic wave propagation in the Fourier domain

Science.gov (United States)

Petrov, Petr V.; Newman, Gregory A.

2014-09-01

3-D full waveform inversion (FWI) of seismic wavefields is routinely implemented with explicit time-stepping simulators. A clear advantage of explicit time stepping is the avoidance of solving large-scale implicit linear systems that arise with frequency domain formulations. However, FWI using explicit time stepping may require a very fine time step and (as a consequence) significant computational resources and run times. If the computational challenges of wavefield simulation can be effectively handled, an FWI scheme implemented within the frequency domain utilizing only a few frequencies, offers a cost effective alternative to FWI in the time domain. We have therefore implemented a 3-D FWI scheme for elastic wave propagation in the Fourier domain. To overcome the computational bottleneck in wavefield simulation, we have exploited an efficient Krylov iterative solver for the elastic wave equations approximated with second and fourth order finite differences. The solver does not exploit multilevel preconditioning for wavefield simulation, but is coupled efficiently to the inversion iteration workflow to reduce computational cost. The workflow is best described as a series of sequential inversion experiments, where in the case of seismic reflection acquisition geometries, the data has been laddered such that we first image highly damped data, followed by data where damping is systemically reduced. The key to our modelling approach is its ability to take advantage of solver efficiency when the elastic wavefields are damped. As the inversion experiment progresses, damping is significantly reduced, effectively simulating non-damped wavefields in the Fourier domain. While the cost of the forward simulation increases as damping is reduced, this is counterbalanced by the cost of the outer inversion iteration, which is reduced because of a better starting model obtained from the larger damped wavefield used in the previous inversion experiment. For cross-well data, it is

MGLab3D: An interactive environment for iterative solvers for elliptic PDEs in two and three dimensions

Energy Technology Data Exchange (ETDEWEB)

Bordner, J.; Saied, F. [Univ. of Illinois, Urbana, IL (United States)

1996-12-31

GLab3D is an enhancement of an interactive environment (MGLab) for experimenting with iterative solvers and multigrid algorithms. It is implemented in MATLAB. The new version has built-in 3D elliptic pde`s and several iterative methods and preconditioners that were not available in the original version. A sparse direct solver option has also been included. The multigrid solvers have also been extended to 3D. The discretization and pde domains are restricted to standard finite differences on the unit square/cube. The power of this software studies in the fact that no programming is needed to solve, for example, the convection-diffusion equation in 3D with TFQMR and a customized V-cycle preconditioner, for a variety of problem sizes and mesh Reynolds, numbers. In addition to the graphical user interface, some sample drivers are included to show how experiments can be composed using the underlying suite of problems and solvers.

Essential imposition of Neumann condition in Galerkin-Legendre elliptic solvers

CERN Document Server

Auteri, F; Quartapelle, L

2003-01-01

A new Galerkin-Legendre direct spectral solver for the Neumann problem associated with Laplace and Helmholtz operators in rectangular domains is presented. The algorithm differs from other Neumann spectral solvers by the high sparsity of the matrices, exploited in conjunction with the direct product structure of the problem. The homogeneous boundary condition is satisfied exactly by expanding the unknown variable into a polynomial basis of functions which are built upon the Legendre polynomials and have a zero slope at the interval extremes. A double diagonalization process is employed pivoting around the eigenstructure of the pentadiagonal mass matrices in both directions, instead of the full stiffness matrices encountered in the classical variational formulation of the problem with a weak natural imposition of the derivative boundary condition. Nonhomogeneous Neumann data are accounted for by means of a lifting. Numerical results are given to illustrate the performance of the proposed spectral elliptic solv...

Minos: a SPN solver for core calculation in the DESCARTES system

International Nuclear Information System (INIS)

Baudron, A.M.; Lautard, J.J.

2005-01-01

This paper describes a new development of a neutronic core solver done in the context of a new generation neutronic reactor computational system, named DESCARTES. For performance reasons, the numerical method of the existing MINOS solver in the SAPHYR system has been reused in the new system. It is based on the mixed dual finite element approximation of the simplified transport equation. The solver takes into account assembly discontinuity coefficients (ADF) in the simplified transport equation (SPN) context. The solver has been rewritten in C++ programming language using an object oriented design. Its general architecture was reconsidered in order to improve its capability of evolution and its maintainability. Moreover, the performances of the old version have been improved mainly regarding the matrix construction time; this result improves significantly the performance of the solver in the context of industrial application requiring thermal hydraulic feedback and depletion calculations. (authors)

A stable higher order space time Galerkin marching-on-in-time scheme

KAUST Repository

Pray, Andrew J.

2013-07-01

We present a method for the stable solution of time-domain integral equations. The method uses a technique developed in [1] to accurately evaluate matrix elements. As opposed to existing stabilization schemes, the method presented uses higher order basis functions in time to improve the accuracy of the solver. The method is validated by showing convergence in temporal basis function order, time step size, and geometric discretization order. © 2013 IEEE.

A new optimization method using a compressed sensing inspired solver for real-time LDR-brachytherapy treatment planning

International Nuclear Information System (INIS)

Guthier, C; Aschenbrenner, K P; Buergy, D; Ehmann, M; Wenz, F; Hesser, J W

2015-01-01

This work discusses a novel strategy for inverse planning in low dose rate brachytherapy. It applies the idea of compressed sensing to the problem of inverse treatment planning and a new solver for this formulation is developed. An inverse planning algorithm was developed incorporating brachytherapy dose calculation methods as recommended by AAPM TG-43. For optimization of the functional a new variant of a matching pursuit type solver is presented. The results are compared with current state-of-the-art inverse treatment planning algorithms by means of real prostate cancer patient data. The novel strategy outperforms the best state-of-the-art methods in speed, while achieving comparable quality. It is able to find solutions with comparable values for the objective function and it achieves these results within a few microseconds, being up to 542 times faster than competing state-of-the-art strategies, allowing real-time treatment planning. The sparse solution of inverse brachytherapy planning achieved with methods from compressed sensing is a new paradigm for optimization in medical physics. Through the sparsity of required needles and seeds identified by this method, the cost of intervention may be reduced. (paper)

A new optimization method using a compressed sensing inspired solver for real-time LDR-brachytherapy treatment planning

Science.gov (United States)

Guthier, C.; Aschenbrenner, K. P.; Buergy, D.; Ehmann, M.; Wenz, F.; Hesser, J. W.

2015-03-01

This work discusses a novel strategy for inverse planning in low dose rate brachytherapy. It applies the idea of compressed sensing to the problem of inverse treatment planning and a new solver for this formulation is developed. An inverse planning algorithm was developed incorporating brachytherapy dose calculation methods as recommended by AAPM TG-43. For optimization of the functional a new variant of a matching pursuit type solver is presented. The results are compared with current state-of-the-art inverse treatment planning algorithms by means of real prostate cancer patient data. The novel strategy outperforms the best state-of-the-art methods in speed, while achieving comparable quality. It is able to find solutions with comparable values for the objective function and it achieves these results within a few microseconds, being up to 542 times faster than competing state-of-the-art strategies, allowing real-time treatment planning. The sparse solution of inverse brachytherapy planning achieved with methods from compressed sensing is a new paradigm for optimization in medical physics. Through the sparsity of required needles and seeds identified by this method, the cost of intervention may be reduced.

Comparison of open-source linear programming solvers.

Energy Technology Data Exchange (ETDEWEB)

Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph

2013-10-01

When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.

A High Performance QDWH-SVD Solver using Hardware Accelerators

KAUST Repository

Sukkari, Dalal E.

2015-04-08

This paper describes a new high performance implementation of the QR-based Dynamically Weighted Halley Singular Value Decomposition (QDWH-SVD) solver on multicore architecture enhanced with multiple GPUs. The standard QDWH-SVD algorithm was introduced by Nakatsukasa and Higham (SIAM SISC, 2013) and combines three successive computational stages: (1) the polar decomposition calculation of the original matrix using the QDWH algorithm, (2) the symmetric eigendecomposition of the resulting polar factor to obtain the singular values and the right singular vectors and (3) the matrix-matrix multiplication to get the associated left singular vectors. A comprehensive test suite highlights the numerical robustness of the QDWH-SVD solver. Although it performs up to two times more flops when computing all singular vectors compared to the standard SVD solver algorithm, our new high performance implementation on single GPU results in up to 3.8x improvements for asymptotic matrix sizes, compared to the equivalent routines from existing state-of-the-art open-source and commercial libraries. However, when only singular values are needed, QDWH-SVD is penalized by performing up to 14 times more flops. The singular value only implementation of QDWH-SVD on single GPU can still run up to 18% faster than the best existing equivalent routines. Integrating mixed precision techniques in the solver can additionally provide up to 40% improvement at the price of losing few digits of accuracy, compared to the full double precision floating point arithmetic. We further leverage the single GPU QDWH-SVD implementation by introducing the first multi-GPU SVD solver to study the scalability of the QDWH-SVD framework.

Time-domain modeling of electromagnetic diffusion with a frequency-domain code

NARCIS (Netherlands)

Mulder, W.A.; Wirianto, M.; Slob, E.C.

2007-01-01

We modeled time-domain EM measurements of induction currents for marine and land applications with a frequency-domain code. An analysis of the computational complexity of a number of numerical methods shows that frequency-domain modeling followed by a Fourier transform is an attractive choice if a

IGA-ADS: Isogeometric analysis FEM using ADS solver

Science.gov (United States)

Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav

2017-08-01

In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).

Motivation, Challenge, and Opportunity of Successful Solvers on an Innovation Platform

DEFF Research Database (Denmark)

Hossain, Mokter

2017-01-01

. The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...... other experts, the ability to work in a diverse environment, options of work after retirement and from distant locations, and a new source of income....

Implementation of density-based solver for all speeds in the framework of OpenFOAM

Science.gov (United States)

Shen, Chun; Sun, Fengxian; Xia, Xinlin

2014-10-01

In the framework of open source CFD code OpenFOAM, a density-based solver for all speeds flow field is developed. In this solver the preconditioned all speeds AUSM+(P) scheme is adopted and the dual time scheme is implemented to complete the unsteady process. Parallel computation could be implemented to accelerate the solving process. Different interface reconstruction algorithms are implemented, and their accuracy with respect to convection is compared. Three benchmark tests of lid-driven cavity flow, flow crossing over a bump, and flow over a forward-facing step are presented to show the accuracy of the AUSM+(P) solver for low-speed incompressible flow, transonic flow, and supersonic/hypersonic flow. Firstly, for the lid driven cavity flow, the computational results obtained by different interface reconstruction algorithms are compared. It is indicated that the one dimensional reconstruction scheme adopted in this solver possesses high accuracy and the solver developed in this paper can effectively catch the features of low incompressible flow. Then via the test cases regarding the flow crossing over bump and over forward step, the ability to capture characteristics of the transonic and supersonic/hypersonic flows are confirmed. The forward-facing step proves to be the most challenging for the preconditioned solvers with and without the dual time scheme. Nonetheless, the solvers described in this paper reproduce the main features of this flow, including the evolution of the initial transient.

3D airborne EM modeling based on the spectral-element time-domain (SETD) method

Science.gov (United States)

Cao, X.; Yin, C.; Huang, X.; Liu, Y.; Zhang, B., Sr.; Cai, J.; Liu, L.

2017-12-01

In the field of 3D airborne electromagnetic (AEM) modeling, both finite-difference time-domain (FDTD) method and finite-element time-domain (FETD) method have limitations that FDTD method depends too much on the grids and time steps, while FETD requires large number of grids for complex structures. We propose a time-domain spectral-element (SETD) method based on GLL interpolation basis functions for spatial discretization and Backward Euler (BE) technique for time discretization. The spectral-element method is based on a weighted residual technique with polynomials as vector basis functions. It can contribute to an accurate result by increasing the order of polynomials and suppressing spurious solution. BE method is a stable tine discretization technique that has no limitation on time steps and can guarantee a higher accuracy during the iteration process. To minimize the non-zero number of sparse matrix and obtain a diagonal mass matrix, we apply the reduced order integral technique. A direct solver with its speed independent of the condition number is adopted for quickly solving the large-scale sparse linear equations system. To check the accuracy of our SETD algorithm, we compare our results with semi-analytical solutions for a three-layered earth model within the time lapse 10-6-10-2s for different physical meshes and SE orders. The results show that the relative errors for magnetic field B and magnetic induction are both around 3-5%. Further we calculate AEM responses for an AEM system over a 3D earth model in Figure 1. From numerical experiments for both 1D and 3D model, we draw the conclusions that: 1) SETD can deliver an accurate results for both dB/dt and B; 2) increasing SE order improves the modeling accuracy for early to middle time channels when the EM field diffuses fast so the high-order SE can model the detailed variation; 3) at very late time channels, increasing SE order has little improvement on modeling accuracy, but the time interval plays

Numerical solver for compressible two-fluid flow

NARCIS (Netherlands)

J. Naber (Jorick)

2005-01-01

textabstractThis report treats the development of a numerical solver for the simulation of flows of two non-mixing fluids described by the two-dimensional Euler equations. A level-set equation in conservative form describes the interface. After each time step the deformed level-set function is

Coupling of a 3-D vortex particle-mesh method with a finite volume near-wall solver

Science.gov (United States)

Marichal, Y.; Lonfils, T.; Duponcheel, M.; Chatelain, P.; Winckelmans, G.

2011-11-01

This coupling aims at improving the computational efficiency of high Reynolds number bluff body flow simulations by using two complementary methods and exploiting their respective advantages in distinct parts of the domain. Vortex particle methods are particularly well suited for free vortical flows such as wakes or jets (the computational domain -with non zero vorticity- is then compact and dispersion errors are negligible). Finite volume methods, however, can handle boundary layers much more easily due to anisotropic mesh refinement. In the present approach, the vortex method is used in the whole domain (overlapping domain technique) but its solution is highly underresolved in the vicinity of the wall. It thus has to be corrected by the near-wall finite volume solution at each time step. Conversely, the vortex method provides the outer boundary conditions for the near-wall solver. A parallel multi-resolution vortex particle-mesh approach is used here along with an Immersed Boundary method in order to take the walls into account. The near-wall flow is solved by OpenFOAM® using the PISO algorithm. We validate the methodology on the flow past a sphere at a moderate Reynolds number. F.R.S. - FNRS Research Fellow.

Calibration of TAMA300 in time domain

International Nuclear Information System (INIS)

Telada, Souichi; Tatsumi, Daisuke; Akutsu, Tomomi; Ando, Masaki; Kanda, Nobuyuki

2005-01-01

We could reconstruct the strain of gravitational wave signals from acquired data in the time domain by using the infinite impulse response filter technique in TAMA300. We would like to analyse the waveform in the time domain for burst-like signal, merger phase waveform of binary neutron stars, and so on. We established the way to make a continuous time-series gravitational wave strain signal. We compared the time-domain reconstruction with the Fourier-space reconstruction. Both coincided within 3% in the observation range. We could also produce the voltage signal which would be recorded by the data-acquisition system from a simulated gravitational wave. This is useful for some analyses of simulations and signal injections. We could extract the waveform of the hardware injection signal in an observational run in the time domain. The extracted waveform was similar to the injection signal

Fast Multipole-Based Elliptic PDE Solver and Preconditioner

KAUST Repository

Ibeid, Huda

2016-12-07

Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic PDE solver have opened the possibility to use it as a preconditioner for even a broader range of applications. In this thesis, we (i) discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on inter-node communication, and develop a performance model that considers the communication patterns of the FMM for spatially quasi-uniform distributions, (ii) employ this performance model to guide performance and scaling improvement of FMM for all-atom molecular dynamics simulations of uniformly distributed particles, and (iii) demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, FMM is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity

Self-correcting Multigrid Solver

International Nuclear Information System (INIS)

Lewandowski, Jerome L.V.

2004-01-01

A new multigrid algorithm based on the method of self-correction for the solution of elliptic problems is described. The method exploits information contained in the residual to dynamically modify the source term (right-hand side) of the elliptic problem. It is shown that the self-correcting solver is more efficient at damping the short wavelength modes of the algebraic error than its standard equivalent. When used in conjunction with a multigrid method, the resulting solver displays an improved convergence rate with no additional computational work

Balancing Energy and Performance in Dense Linear System Solvers for Hybrid ARM+GPU platforms

Directory of Open Access Journals (Sweden)

Juan P. Silva

2016-04-01

Full Text Available The high performance computing community has traditionally focused uniquely on the reduction of execution time, though in the last years, the optimization of energy consumption has become a main issue. A reduction of energy usage without a degradation of performance requires the adoption of energy-efficient hardware platforms accompanied by the development of energy-aware algorithms and computational kernels. The solution of linear systems is a key operation for many scientific and engineering problems. Its relevance has motivated an important amount of work, and consequently, it is possible to find high performance solvers for a wide variety of hardware platforms. In this work, we aim to develop a high performance and energy-efficient linear system solver. In particular, we develop two solvers for a low-power CPU-GPU platform, the NVIDIA Jetson TK1. These solvers implement the Gauss-Huard algorithm yielding an efficient usage of the target hardware as well as an efficient memory access. The experimental evaluation shows that the novel proposal reports important savings in both time and energy-consumption when compared with the state-of-the-art solvers of the platform.

Full waveform inversion in the frequency domain using classified time-domain residual wavefields

Science.gov (United States)

Son, Woohyun; Koo, Nam-Hyung; Kim, Byoung-Yeop; Lee, Ho-Young; Joo, Yonghwan

2017-04-01

We perform the acoustic full waveform inversion in the frequency domain using residual wavefields that have been separated in the time domain. We sort the residual wavefields in the time domain according to the order of absolute amplitudes. Then, the residual wavefields are separated into several groups in the time domain. To analyze the characteristics of the residual wavefields, we compare the residual wavefields of conventional method with those of our residual separation method. From the residual analysis, the amplitude spectrum obtained from the trace before separation appears to have little energy at the lower frequency bands. However, the amplitude spectrum obtained from our strategy is regularized by the separation process, which means that the low-frequency components are emphasized. Therefore, our method helps to emphasize low-frequency components of residual wavefields. Then, we generate the frequency-domain residual wavefields by taking the Fourier transform of the separated time-domain residual wavefields. With these wavefields, we perform the gradient-based full waveform inversion in the frequency domain using back-propagation technique. Through a comparison of gradient directions, we confirm that our separation method can better describe the sub-salt image than the conventional approach. The proposed method is tested on the SEG/EAGE salt-dome model. The inversion results show that our algorithm is better than the conventional gradient based waveform inversion in the frequency domain, especially for deeper parts of the velocity model.

VDJSeq-Solver: in silico V(DJ recombination detection tool.

Directory of Open Access Journals (Sweden)

Giulia Paciello

Full Text Available In this paper we present VDJSeq-Solver, a methodology and tool to identify clonal lymphocyte populations from paired-end RNA Sequencing reads derived from the sequencing of mRNA neoplastic cells. The tool detects the main clone that characterises the tissue of interest by recognizing the most abundant V(DJ rearrangement among the existing ones in the sample under study. The exact sequence of the clone identified is capable of accounting for the modifications introduced by the enzymatic processes. The proposed tool overcomes limitations of currently available lymphocyte rearrangements recognition methods, working on a single sequence at a time, that are not applicable to high-throughput sequencing data. In this work, VDJSeq-Solver has been applied to correctly detect the main clone and identify its sequence on five Mantle Cell Lymphoma samples; then the tool has been tested on twelve Diffuse Large B-Cell Lymphoma samples. In order to comply with the privacy, ethics and intellectual property policies of the University Hospital and the University of Verona, data is available upon request to supporto.utenti@ateneo.univr.it after signing a mandatory Materials Transfer Agreement. VDJSeq-Solver JAVA/Perl/Bash software implementation is free and available at http://eda.polito.it/VDJSeq-Solver/.

Parallel Solver for H(div) Problems Using Hybridization and AMG

Energy Technology Data Exchange (ETDEWEB)

Lee, Chak S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2016-01-15

In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examined through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.

Time versus frequency domain measurements: layered model ...

African Journals Online (AJOL)

... their high frequency content while among TEM data sets with low frequency content, the averaging times for the FEM ellipticity were shorter than the TEM quality. Keywords: ellipticity, frequency domain, frequency electromagnetic method, model parameter, orientation error, time domain, transient electromagnetic method

A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS

International Nuclear Information System (INIS)

Davis, Shane W.; Stone, James M.; Jiang Yanfei

2012-01-01

We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.

Efficiency optimization of a fast Poisson solver in beam dynamics simulation

Science.gov (United States)

Zheng, Dawei; Pöplau, Gisela; van Rienen, Ursula

2016-01-01

Calculating the solution of Poisson's equation relating to space charge force is still the major time consumption in beam dynamics simulations and calls for further improvement. In this paper, we summarize a classical fast Poisson solver in beam dynamics simulations: the integrated Green's function method. We introduce three optimization steps of the classical Poisson solver routine: using the reduced integrated Green's function instead of the integrated Green's function; using the discrete cosine transform instead of discrete Fourier transform for the Green's function; using a novel fast convolution routine instead of an explicitly zero-padded convolution. The new Poisson solver routine preserves the advantages of fast computation and high accuracy. This provides a fast routine for high performance calculation of the space charge effect in accelerators.

Motivations, Challenges, and Opportunities of Successful Solvers on an Innovation Intermediary Platform

DEFF Research Database (Denmark)

Hossain, Mokter

2018-01-01

. The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...... other experts, the ability to work in a diverse environment, options of work after retirement and from distant locations, and a new source of income....

Controlling the numerical Cerenkov instability in PIC simulations using a customized finite difference Maxwell solver and a local FFT based current correction

International Nuclear Information System (INIS)

Li, Fei; Yu, Peicheng; Xu, Xinlu; Fiuza, Frederico; Decyk, Viktor K.

2017-01-01

In this study we present a customized finite-difference-time-domain (FDTD) Maxwell solver for the particle-in-cell (PIC) algorithm. The solver is customized to effectively eliminate the numerical Cerenkov instability (NCI) which arises when a plasma (neutral or non-neutral) relativistically drifts on a grid when using the PIC algorithm. We control the EM dispersion curve in the direction of the plasma drift of a FDTD Maxwell solver by using a customized higher order finite difference operator for the spatial derivative along the direction of the drift (1^ direction). We show that this eliminates the main NCI modes with moderate |k_1|, while keeps additional main NCI modes well outside the range of physical interest with higher |k_1|. These main NCI modes can be easily filtered out along with first spatial aliasing NCI modes which are also at the edge of the fundamental Brillouin zone. The customized solver has the possible advantage of improved parallel scalability because it can be easily partitioned along 1^ which typically has many more cells than other directions for the problems of interest. We show that FFTs can be performed locally to current on each partition to filter out the main and first spatial aliasing NCI modes, and to correct the current so that it satisfies the continuity equation for the customized spatial derivative. This ensures that Gauss’ Law is satisfied. Lastly, we present simulation examples of one relativistically drifting plasma, of two colliding relativistically drifting plasmas, and of nonlinear laser wakefield acceleration (LWFA) in a Lorentz boosted frame that show no evidence of the NCI can be observed when using this customized Maxwell solver together with its NCI elimination scheme.

Time domain passivity controller for 4-channel time-delay bilateral teleoperation.

Science.gov (United States)

Rebelo, Joao; Schiele, Andre

2015-01-01

This paper presents an extension of the time-domain passivity control approach to a four-channel bilateral controller under the effects of time delays. Time-domain passivity control has been used successfully to stabilize teleoperation systems with position-force and position-position controllers; however, the performance with such control architectures is sub-optimal both with and without time delays. This work extends the network representation of the time-domain passivity controller to the four-channel architecture, which provides perfect transparency to the user without time delay. The proposed architecture is based on modelling the controllers as dependent voltage sources and using only series passivity controllers. The obtained results are shown on a one degree-of-freedom setup and illustrate the stabilization behaviour of the proposed controller when time delay is present in the communication channel.

A 3D, fully Eulerian, VOF-based solver to study the interaction between two fluids and moving rigid bodies using the fictitious domain method

Science.gov (United States)

Pathak, Ashish; Raessi, Mehdi

2016-04-01

We present a three-dimensional (3D) and fully Eulerian approach to capturing the interaction between two fluids and moving rigid structures by using the fictitious domain and volume-of-fluid (VOF) methods. The solid bodies can have arbitrarily complex geometry and can pierce the fluid-fluid interface, forming contact lines. The three-phase interfaces are resolved and reconstructed by using a VOF-based methodology. Then, a consistent scheme is employed for transporting mass and momentum, allowing for simulations of three-phase flows of large density ratios. The Eulerian approach significantly simplifies numerical resolution of the kinematics of rigid bodies of complex geometry and with six degrees of freedom. The fluid-structure interaction (FSI) is computed using the fictitious domain method. The methodology was developed in a message passing interface (MPI) parallel framework accelerated with graphics processing units (GPUs). The computationally intensive solution of the pressure Poisson equation is ported to GPUs, while the remaining calculations are performed on CPUs. The performance and accuracy of the methodology are assessed using an array of test cases, focusing individually on the flow solver and the FSI in surface-piercing configurations. Finally, an application of the proposed methodology in simulations of the ocean wave energy converters is presented.

COMPARATIVE STUDY OF THREE LINEAR SYSTEM SOLVER APPLIED TO FAST DECOUPLED LOAD FLOW METHOD FOR CONTINGENCY ANALYSIS

Directory of Open Access Journals (Sweden)

Syafii

2017-03-01

Full Text Available This paper presents the assessment of fast decoupled load flow computation using three linear system solver scheme. The full matrix version of the fast decoupled load flow based on XB methods used in this study. The numerical investigations are carried out on the small and large test systems. The execution time of small system such as IEEE 14, 30, and 57 are very fast, therefore the computation time can not be compared for these cases. Another cases IEEE 118, 300 and TNB 664 produced significant execution speedup. The superLU factorization sparse matrix solver has best performance and speedup of load flow solution as well as in contigency analysis. The invers full matrix solver can solved only for IEEE 118 bus test system in 3.715 second and for another cases take too long time. However for superLU factorization linear solver can solved all of test system in 7.832 second for a largest of test system. Therefore the superLU factorization linear solver can be a viable alternative applied in contingency analysis.

A 3D approximate maximum likelihood solver for localization of fish implanted with acoustic transmitters

Science.gov (United States)

Li, Xinya; Deng, Z. Daniel; Sun, Yannan; Martinez, Jayson J.; Fu, Tao; McMichael, Geoffrey A.; Carlson, Thomas J.

2014-11-01

Better understanding of fish behavior is vital for recovery of many endangered species including salmon. The Juvenile Salmon Acoustic Telemetry System (JSATS) was developed to observe the out-migratory behavior of juvenile salmonids tagged by surgical implantation of acoustic micro-transmitters and to estimate the survival when passing through dams on the Snake and Columbia Rivers. A robust three-dimensional solver was needed to accurately and efficiently estimate the time sequence of locations of fish tagged with JSATS acoustic transmitters, to describe in sufficient detail the information needed to assess the function of dam-passage design alternatives. An approximate maximum likelihood solver was developed using measurements of time difference of arrival from all hydrophones in receiving arrays on which a transmission was detected. Field experiments demonstrated that the developed solver performed significantly better in tracking efficiency and accuracy than other solvers described in the literature.

Gauss-Seidel Iterative Method as a Real-Time Pile-Up Solver of Scintillation Pulses

Science.gov (United States)

Novak, Roman; Vencelj, Matja¿

2009-12-01

The pile-up rejection in nuclear spectroscopy has been confronted recently by several pile-up correction schemes that compensate for distortions of the signal and subsequent energy spectra artifacts as the counting rate increases. We study here a real-time capability of the event-by-event correction method, which at the core translates to solving many sets of linear equations. Tight time limits and constrained front-end electronics resources make well-known direct solvers inappropriate. We propose a novel approach based on the Gauss-Seidel iterative method, which turns out to be a stable and cost-efficient solution to improve spectroscopic resolution in the front-end electronics. We show the method convergence properties for a class of matrices that emerge in calorimetric processing of scintillation detector signals and demonstrate the ability of the method to support the relevant resolutions. The sole iteration-based error component can be brought below the sliding window induced errors in a reasonable number of iteration steps, thus allowing real-time operation. An area-efficient hardware implementation is proposed that fully utilizes the method's inherent parallelism.

Fast linear solver for radiative transport equation with multiple right hand sides in diffuse optical tomography

International Nuclear Information System (INIS)

Jia, Jingfei; Kim, Hyun K.; Hielscher, Andreas H.

2015-01-01

It is well known that radiative transfer equation (RTE) provides more accurate tomographic results than its diffusion approximation (DA). However, RTE-based tomographic reconstruction codes have limited applicability in practice due to their high computational cost. In this article, we propose a new efficient method for solving the RTE forward problem with multiple light sources in an all-at-once manner instead of solving it for each source separately. To this end, we introduce here a novel linear solver called block biconjugate gradient stabilized method (block BiCGStab) that makes full use of the shared information between different right hand sides to accelerate solution convergence. Two parallelized block BiCGStab methods are proposed for additional acceleration under limited threads situation. We evaluate the performance of this algorithm with numerical simulation studies involving the Delta–Eddington approximation to the scattering phase function. The results show that the single threading block RTE solver proposed here reduces computation time by a factor of 1.5–3 as compared to the traditional sequential solution method and the parallel block solver by a factor of 1.5 as compared to the traditional parallel sequential method. This block linear solver is, moreover, independent of discretization schemes and preconditioners used; thus further acceleration and higher accuracy can be expected when combined with other existing discretization schemes or preconditioners. - Highlights: • We solve the multiple-right-hand-side problem in DOT with a block BiCGStab method. • We examine the CPU times of the block solver and the traditional sequential solver. • The block solver is faster than the sequential solver by a factor of 1.5–3.0. • Multi-threading block solvers give additional speedup under limited threads situation.

Parallel sparse direct solver for integrated circuit simulation

CERN Document Server

Chen, Xiaoming; Yang, Huazhong

2017-01-01

This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...

Transformation Algorithm of Dielectric Response in Time-Frequency Domain

Directory of Open Access Journals (Sweden)

Ji Liu

2014-01-01

Full Text Available A transformation algorithm of dielectric response from time domain to frequency domain is presented. In order to shorten measuring time of low or ultralow frequency dielectric response characteristics, the transformation algorithm is used in this paper to transform the time domain relaxation current to frequency domain current for calculating the low frequency dielectric dissipation factor. In addition, it is shown from comparing the calculation results with actual test data that there is a coincidence for both results over a wide range of low frequencies. Meanwhile, the time domain test data of depolarization currents in dry and moist pressboards are converted into frequency domain results on the basis of the transformation. The frequency domain curves of complex capacitance and dielectric dissipation factor at the low frequency range are obtained. Test results of polarization and depolarization current (PDC in pressboards are also given at the different voltage and polarization time. It is demonstrated from the experimental results that polarization and depolarization current are affected significantly by moisture contents of the test pressboards, and the transformation algorithm is effective in ultralow frequency of 10−3 Hz. Data analysis and interpretation of the test results conclude that analysis of time-frequency domain dielectric response can be used for assessing insulation system in power transformer.

Space moving target detection using time domain feature

Science.gov (United States)

Wang, Min; Chen, Jin-yong; Gao, Feng; Zhao, Jin-yu

2018-01-01

The traditional space target detection methods mainly use the spatial characteristics of the star map to detect the targets, which can not make full use of the time domain information. This paper presents a new space moving target detection method based on time domain features. We firstly construct the time spectral data of star map, then analyze the time domain features of the main objects (target, stars and the background) in star maps, finally detect the moving targets using single pulse feature of the time domain signal. The real star map target detection experimental results show that the proposed method can effectively detect the trajectory of moving targets in the star map sequence, and the detection probability achieves 99% when the false alarm rate is about 8×10-5, which outperforms those of compared algorithms.

Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems

KAUST Repository

Chávez, Gustavo

2017-12-15

We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.

Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems

KAUST Repository

Chá vez, Gustavo; Turkiyyah, George; Zampini, Stefano; Ltaief, Hatem; Keyes, David E.

2017-01-01

We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.

An Explicit MOT-TD-VIE Solver for Time Varying Media

KAUST Repository

Sayed, Sadeed Bin

2016-03-15

An explicit marching on-in-time (MOT) scheme for solving the time domain electric field integral equation enforced on volumes with time varying dielectric permittivity is proposed. Unknowns of the integral equation and the constitutive relation, i.e., flux density and field intensity, are discretized using full and half Schaubert-Wilton-Glisson functions in space. Temporal interpolation is carried out using band limited approximate prolate spherical wave functions. The discretized coupled system of integral equation and constitutive relation is integrated in time using a PE(CE)m type linear multistep scheme. Unlike the existing MOT methods, the resulting explicit MOT scheme allows for straightforward incorporation of the time variation in the dielectric permittivity.

Impedance models in time domain

NARCIS (Netherlands)

Rienstra, S.W.

2005-01-01

Necessary conditions for an impedance function are derived. Methods available in the literature are discussed. A format with recipe is proposed for an exact impedance condition in time domain on a time grid, based on the Helmholtz resonator model. An explicit solution is given of a pulse reflecting

A fast direct solver for boundary value problems on locally perturbed geometries

Science.gov (United States)

Zhang, Yabin; Gillman, Adrianna

2018-03-01

Many applications including optimal design and adaptive discretization techniques involve solving several boundary value problems on geometries that are local perturbations of an original geometry. This manuscript presents a fast direct solver for boundary value problems that are recast as boundary integral equations. The idea is to write the discretized boundary integral equation on a new geometry as a low rank update to the discretized problem on the original geometry. Using the Sherman-Morrison formula, the inverse can be expressed in terms of the inverse of the original system applied to the low rank factors and the right hand side. Numerical results illustrate for problems where perturbation is localized the fast direct solver is three times faster than building a new solver from scratch.

Flexible time domain averaging technique

Science.gov (United States)

Zhao, Ming; Lin, Jing; Lei, Yaguo; Wang, Xiufeng

2013-09-01

Time domain averaging(TDA) is essentially a comb filter, it cannot extract the specified harmonics which may be caused by some faults, such as gear eccentric. Meanwhile, TDA always suffers from period cutting error(PCE) to different extent. Several improved TDA methods have been proposed, however they cannot completely eliminate the waveform reconstruction error caused by PCE. In order to overcome the shortcomings of conventional methods, a flexible time domain averaging(FTDA) technique is established, which adapts to the analyzed signal through adjusting each harmonic of the comb filter. In this technique, the explicit form of FTDA is first constructed by frequency domain sampling. Subsequently, chirp Z-transform(CZT) is employed in the algorithm of FTDA, which can improve the calculating efficiency significantly. Since the signal is reconstructed in the continuous time domain, there is no PCE in the FTDA. To validate the effectiveness of FTDA in the signal de-noising, interpolation and harmonic reconstruction, a simulated multi-components periodic signal that corrupted by noise is processed by FTDA. The simulation results show that the FTDA is capable of recovering the periodic components from the background noise effectively. Moreover, it can improve the signal-to-noise ratio by 7.9 dB compared with conventional ones. Experiments are also carried out on gearbox test rigs with chipped tooth and eccentricity gear, respectively. It is shown that the FTDA can identify the direction and severity of the eccentricity gear, and further enhances the amplitudes of impulses by 35%. The proposed technique not only solves the problem of PCE, but also provides a useful tool for the fault symptom extraction of rotating machinery.

Modern solvers for Helmholtz problems

CERN Document Server

Tang, Jok; Vuik, Kees

2017-01-01

This edited volume offers a state of the art overview of fast and robust solvers for the Helmholtz equation. The book consists of three parts: new developments and analysis in Helmholtz solvers, practical methods and implementations of Helmholtz solvers, and industrial applications. The Helmholtz equation appears in a wide range of science and engineering disciplines in which wave propagation is modeled. Examples are: seismic inversion, ultrasone medical imaging, sonar detection of submarines, waves in harbours and many more. The partial differential equation looks simple but is hard to solve. In order to approximate the solution of the problem numerical methods are needed. First a discretization is done. Various methods can be used: (high order) Finite Difference Method, Finite Element Method, Discontinuous Galerkin Method and Boundary Element Method. The resulting linear system is large, where the size of the problem increases with increasing frequency. Due to higher frequencies the seismic images need to b...

POSSOL, 2-D Poisson Equation Solver for Nonuniform Grid

International Nuclear Information System (INIS)

Orvis, W.J.

1988-01-01

1 - Description of program or function: POSSOL is a two-dimensional Poisson equation solver for problems with arbitrary non-uniform gridding in Cartesian coordinates. It is an adaptation of the uniform grid PWSCRT routine developed by Schwarztrauber and Sweet at the National Center for Atmospheric Research (NCAR). 2 - Method of solution: POSSOL will solve the Helmholtz equation on an arbitrary, non-uniform grid on a rectangular domain allowing only one type of boundary condition on any one side. It can also be used to handle more than one type of boundary condition on a side by means of a capacitance matrix technique. There are three types of boundary conditions that can be applied: fixed, derivative, or periodic

Linear optical response of finite systems using multishift linear system solvers

Energy Technology Data Exchange (ETDEWEB)

Hübener, Hannes; Giustino, Feliciano [Department of Materials, University of Oxford, Oxford OX1 3PH (United Kingdom)

2014-07-28

We discuss the application of multishift linear system solvers to linear-response time-dependent density functional theory. Using this technique the complete frequency-dependent electronic density response of finite systems to an external perturbation can be calculated at the cost of a single solution of a linear system via conjugate gradients. We show that multishift time-dependent density functional theory yields excitation energies and oscillator strengths in perfect agreement with the standard diagonalization of the response matrix (Casida's method), while being computationally advantageous. We present test calculations for benzene, porphin, and chlorophyll molecules. We argue that multishift solvers may find broad applicability in the context of excited-state calculations within density-functional theory and beyond.

A TFETI domain decomposition solver for elastoplastic problems

Czech Academy of Sciences Publication Activity Database

Čermák, M.; Kozubek, T.; Sysala, Stanislav; Valdman, J.

2014-01-01

Roč. 231, č. 1 (2014), s. 634-653 ISSN 0096-3003 Institutional support: RVO:68145535 Keywords : elastoplasticity * Total FETI domain decomposition method * Finite element method * Semismooth Newton method Subject RIV: BA - General Mathematics Impact factor: 1.551, year: 2014 http://ac.els-cdn.com/S0096300314000253/1-s2.0-S0096300314000253-main.pdf?_tid=33a29cf4-996a-11e3-8c5a-00000aacb360&acdnat=1392816896_4584697dc26cf934dcf590c63f0dbab7

Finite difference time domain analysis of a chiro plasma

International Nuclear Information System (INIS)

Torres-Silva, H.; Obligado, A.; Reggiani, N.; Sakanaka, P.H.

1995-01-01

The finite difference time-domain (FDTD) method is one of the most widely used computational methods in electromagnetics. Using FDTD, Maxwell's equations are solved directly in the time domain via finite differences and time stepping. The basic approach is relatively easy to understand and is an alternative to the more usual frequency-domain approaches. (author). 5 refs

A finite different field solver for dipole modes

International Nuclear Information System (INIS)

Nelson, E.M.

1992-08-01

A finite element field solver for dipole modes in axisymmetric structures has been written. The second-order elements used in this formulation yield accurate mode frequencies with no spurious modes. Quasi-periodic boundaries are included to allow travelling waves in periodic structures. The solver is useful in applications requiring precise frequency calculations such as detuned accelerator structures for linear colliders. Comparisons are made with measurements and with the popular but less accurate field solver URMEL

A fast mass spring model solver for high-resolution elastic objects

Science.gov (United States)

Zheng, Mianlun; Yuan, Zhiyong; Zhu, Weixu; Zhang, Guian

2017-03-01

Real-time simulation of elastic objects is of great importance for computer graphics and virtual reality applications. The fast mass spring model solver can achieve visually realistic simulation in an efficient way. Unfortunately, this method suffers from resolution limitations and lack of mechanical realism for a surface geometry model, which greatly restricts its application. To tackle these problems, in this paper we propose a fast mass spring model solver for high-resolution elastic objects. First, we project the complex surface geometry model into a set of uniform grid cells as cages through *cages mean value coordinate method to reflect its internal structure and mechanics properties. Then, we replace the original Cholesky decomposition method in the fast mass spring model solver with a conjugate gradient method, which can make the fast mass spring model solver more efficient for detailed surface geometry models. Finally, we propose a graphics processing unit accelerated parallel algorithm for the conjugate gradient method. Experimental results show that our method can realize efficient deformation simulation of 3D elastic objects with visual reality and physical fidelity, which has a great potential for applications in computer animation.

Galerkin CFD solvers for use in a multi-disciplinary suite for modeling advanced flight vehicles

Science.gov (United States)

Moffitt, Nicholas J.

This work extends existing Galerkin CFD solvers for use in a multi-disciplinary suite. The suite is proposed as a means of modeling advanced flight vehicles, which exhibit strong coupling between aerodynamics, structural dynamics, controls, rigid body motion, propulsion, and heat transfer. Such applications include aeroelastics, aeroacoustics, stability and control, and other highly coupled applications. The suite uses NASA STARS for modeling structural dynamics and heat transfer. Aerodynamics, propulsion, and rigid body dynamics are modeled in one of the five CFD solvers below. Euler2D and Euler3D are Galerkin CFD solvers created at OSU by Cowan (2003). These solvers are capable of modeling compressible inviscid aerodynamics with modal elastics and rigid body motion. This work reorganized these solvers to improve efficiency during editing and at run time. Simple and efficient propulsion models were added, including rocket, turbojet, and scramjet engines. Viscous terms were added to the previous solvers to create NS2D and NS3D. The viscous contributions were demonstrated in the inertial and non-inertial frames. Variable viscosity (Sutherland's equation) and heat transfer boundary conditions were added to both solvers but not verified in this work. Two turbulence models were implemented in NS2D and NS3D: Spalart-Allmarus (SA) model of Deck, et al. (2002) and Menter's SST model (1994). A rotation correction term (Shur, et al., 2000) was added to the production of turbulence. Local time stepping and artificial dissipation were adapted to each model. CFDsol is a Taylor-Galerkin solver with an SA turbulence model. This work improved the time accuracy, far field stability, viscous terms, Sutherland?s equation, and SA model with NS3D as a guideline and added the propulsion models from Euler3D to CFDsol. Simple geometries were demonstrated to utilize current meshing and processing capabilities. Air-breathing hypersonic flight vehicles (AHFVs) represent the ultimate

Application of multi-thread computing and domain decomposition to the 3-D neutronics Fem code Cronos

International Nuclear Information System (INIS)

Ragusa, J.C.

2003-01-01

The purpose of this paper is to present the parallelization of the flux solver and the isotopic depletion module of the code, either using Message Passing Interface (MPI) or OpenMP. Thread parallelism using OpenMP was used to parallelize the mixed dual FEM (finite element method) flux solver MINOS. Investigations regarding the opportunity of mixing parallelism paradigms will be discussed. The isotopic depletion module was parallelized using domain decomposition and MPI. An attempt at using OpenMP was unsuccessful and will be explained. This paper is organized as follows: the first section recalls the different types of parallelism. The mixed dual flux solver and its parallelization are then presented. In the third section, we describe the isotopic depletion solver and its parallelization; and finally conclude with some future perspectives. Parallel applications are mandatory for fine mesh 3-dimensional transport and simplified transport multigroup calculations. The MINOS solver of the FEM neutronics code CRONOS2 was parallelized using the directive based standard OpenMP. An efficiency of 80% (resp. 60%) was achieved with 2 (resp. 4) threads. Parallelization of the isotopic depletion solver was obtained using domain decomposition principles and MPI. Efficiencies greater than 90% were reached. These parallel implementations were tested on a shared memory symmetric multiprocessor (SMP) cluster machine. The OpenMP implementation in the solver MINOS is only the first step towards fully using the SMPs cluster potential with a mixed mode parallelism. Mixed mode parallelism can be achieved by combining message passing interface between clusters with OpenMP implicit parallelism within a cluster

Application of multi-thread computing and domain decomposition to the 3-D neutronics Fem code Cronos

Energy Technology Data Exchange (ETDEWEB)

Ragusa, J.C. [CEA Saclay, Direction de l' Energie Nucleaire, Service d' Etudes des Reacteurs et de Modelisations Avancees (DEN/SERMA), 91 - Gif sur Yvette (France)

2003-07-01

The purpose of this paper is to present the parallelization of the flux solver and the isotopic depletion module of the code, either using Message Passing Interface (MPI) or OpenMP. Thread parallelism using OpenMP was used to parallelize the mixed dual FEM (finite element method) flux solver MINOS. Investigations regarding the opportunity of mixing parallelism paradigms will be discussed. The isotopic depletion module was parallelized using domain decomposition and MPI. An attempt at using OpenMP was unsuccessful and will be explained. This paper is organized as follows: the first section recalls the different types of parallelism. The mixed dual flux solver and its parallelization are then presented. In the third section, we describe the isotopic depletion solver and its parallelization; and finally conclude with some future perspectives. Parallel applications are mandatory for fine mesh 3-dimensional transport and simplified transport multigroup calculations. The MINOS solver of the FEM neutronics code CRONOS2 was parallelized using the directive based standard OpenMP. An efficiency of 80% (resp. 60%) was achieved with 2 (resp. 4) threads. Parallelization of the isotopic depletion solver was obtained using domain decomposition principles and MPI. Efficiencies greater than 90% were reached. These parallel implementations were tested on a shared memory symmetric multiprocessor (SMP) cluster machine. The OpenMP implementation in the solver MINOS is only the first step towards fully using the SMPs cluster potential with a mixed mode parallelism. Mixed mode parallelism can be achieved by combining message passing interface between clusters with OpenMP implicit parallelism within a cluster.

Evaluation of Damping Using Time Domain OMA Techniques

DEFF Research Database (Denmark)

Bajric, Anela; Brincker, Rune; Georgakis, Christos T.

2014-01-01

. In this paper a comparison is made of the effectiveness of three existing OMA techniques in providing accurate damping estimates for varying loadings, levels of noise, number of added measurement channels and structural damping. The evaluated techniques are derived in the time domain and are namely the Ibrahim...... Time Domain (ITD), Eigenvalue Realization Algorithm (ERA) and the Polyreference Time Domain (PTD). The response of a two degree-of-freedom (2DOF) system is numerically established from specified modal parameters with well separated and closely spaced modes. Two types of response are considered, free...

A GPU-based incompressible Navier-Stokes solver on moving overset grids

Science.gov (United States)

Chandar, Dominic D. J.; Sitaraman, Jayanarayanan; Mavriplis, Dimitri J.

2013-07-01

In pursuit of obtaining high fidelity solutions to the fluid flow equations in a short span of time, graphics processing units (GPUs) which were originally intended for gaming applications are currently being used to accelerate computational fluid dynamics (CFD) codes. With a high peak throughput of about 1 TFLOPS on a PC, GPUs seem to be favourable for many high-resolution computations. One such computation that involves a lot of number crunching is computing time accurate flow solutions past moving bodies. The aim of the present paper is thus to discuss the development of a flow solver on unstructured and overset grids and its implementation on GPUs. In its present form, the flow solver solves the incompressible fluid flow equations on unstructured/hybrid/overset grids using a fully implicit projection method. The resulting discretised equations are solved using a matrix-free Krylov solver using several GPU kernels such as gradient, Laplacian and reduction. Some of the simple arithmetic vector calculations are implemented using the CU++: An Object Oriented Framework for Computational Fluid Dynamics Applications using Graphics Processing Units, Journal of Supercomputing, 2013, doi:10.1007/s11227-013-0985-9 approach where GPU kernels are automatically generated at compile time. Results are presented for two- and three-dimensional computations on static and moving grids.

Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities

KAUST Repository

Paszyńska, Anna; Jopek, Konrad; Banaś, Krzysztof; Paszyński, Maciej; Gurgul, Piotr; Lenerth, Andrew; Nguyen, Donald; Pingali, Keshav; Dalcind, Lisandro; Calo, Victor M.

2015-01-01

This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.

Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities

KAUST Repository

Paszyńska, Anna

2015-06-01

This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.

A high-performance Riccati based solver for tree-structured quadratic programs

DEFF Research Database (Denmark)

Frison, Gianluca; Kouzoupis, Dimitris; Diehl, Moritz

2017-01-01

the online solution of such problems challenging and the development of tailored solvers crucial. In this paper, an interior point method is presented that can solve Quadratic Programs (QPs) arising in multi-stage MPC efficiently by means of a tree-structured Riccati recursion and a high-performance linear...... algebra library. A performance comparison with code-generated and general purpose sparse QP solvers shows that the computation times can be significantly reduced for all problem sizes that are practically relevant in embedded MPC applications. The presented implementation is freely available as part...

Generating Dynamic Persistence in the Time Domain

Science.gov (United States)

Guerrero, A.; Smith, L. A.; Smith, L. A.; Kaplan, D. T.

2001-12-01

Many dynamical systems present long-range correlations. Physically, these systems vary from biological to economical, including geological or urban systems. Important geophysical candidates for this type of behaviour include weather (or climate) and earthquake sequences. Persistence is characterised by slowly decaying correlation function; that, in theory, never dies out. The Persistence exponent reflects the degree of memory in the system and much effort has been expended creating and analysing methods that successfully estimate this parameter and model data that exhibits persistence. The most widely used methods for generating long correlated time series are not dynamical systems in the time domain, but instead are derived from a given spectral density. Little attention has been drawn to modelling persistence in the time domain. The time domain approach has the advantage that an observation at certain time can be calculated using previous observations which is particularly suitable when investigating the predictability of a long memory process. We will describe two of these methods in the time domain. One is a traditional approach using fractional ARIMA (autoregressive and moving average) models; the second uses a novel approach to extending a given series using random Fourier basis functions. The statistical quality of the two methods is compared, and they are contrasted with weather data which shows, reportedly, persistence. The suitability of this approach both for estimating predictability and for making predictions is discussed.

Grammar-Based Multi-Frontal Solver for One Dimensional Isogeometric Analysis with Multiple Right-Hand-Sides

KAUST Repository

Kuźnik, Krzysztof

2013-06-01

This paper introduces a grammar-based model for developing a multi-thread multi-frontal parallel direct solver for one- dimensional isogeometric finite element method. The model includes the integration of B-splines for construction of the element local matrices and the multi-frontal solver algorithm. The integration and the solver algorithm are partitioned into basic indivisible tasks, namely the grammar productions, that can be executed squentially. The partial order of execution of the basic tasks is analyzed to provide the scheduling for the execution of the concurrent integration and multi-frontal solver algo- rithm. This graph grammar analysis allows for optimal concurrent execution of all tasks. The model has been implemented and tested on NVIDIA CUDA GPU, delivering logarithmic execution time for linear, quadratic, cubic and higher order B-splines. Thus, the CUDA implementation delivers the optimal performance predicted by our graph grammar analysis. We utilize the solver for multiple right hand sides related to the solution of non-stationary or inverse problems.

3D casing-distributor analysis with a novel block coupled OpenFOAM solver for hydraulic design application

International Nuclear Information System (INIS)

Devals, C; Zhang, Y; Dompierre, J; Guibault, F; Vu, T C; Mangani, L

2014-01-01

Nowadays, computational fluid dynamics is commonly used by design engineers to evaluate and compare losses in hydraulic components as it is less expensive and less time consuming than model tests. For that purpose, an automatic tool for casing and distributor analysis will be presented in this paper. An in-house mesh generator and a Reynolds Averaged Navier-Stokes equation solver using the standard k-ω SST turbulence model will be used to perform all computations. Two solvers based on the C++ OpenFOAM library will be used and compared to a commercial solver. The performance of the new fully coupled block solver developed by the University of Lucerne and Andritz will be compared to the standard 1.6ext segregated simpleFoam solver and to a commercial solver. In this study, relative comparisons of different geometries of casing and distributor will be performed. The present study is thus aimed at validating the block solver and the tool chain and providing design engineers with a faster and more reliable analysis tool that can be integrated into their design process

Test set for initial value problem solvers

NARCIS (Netherlands)

W.M. Lioen (Walter); J.J.B. de Swart (Jacques)

1998-01-01

textabstractThe CWI test set for IVP solvers presents a collection of Initial Value Problems to test solvers for implicit differential equations. This test set can both decrease the effort for the code developer to test his software in a reliable way, and cross the bridge between the application

Direct time-domain techniques for transient radiation and scattering

International Nuclear Information System (INIS)

Miller, E.K.; Landt, J.A.

1976-01-01

A tutorial introduction to transient electromagnetics, focusing on direct time-domain techniques, is presented. Physical, mathematical, numerical, and experimental aspects of time-domain methods, with emphasis on wire objects excited as antennas or scatters are examined. Numerous computed examples illustrate the characteristics of direct time-domain procedures, especially where they may offer advantages over procedures in the more familiar frequency domain. These advantages include greater solution efficiency for many types of problems, the ability to handle nonlinearities, improved physical insight and interpretability, availability of wide-band information from a single calculation, and the possibility of isolating interactions among various parts of an object using time-range gating

Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers

Science.gov (United States)

Bjorner, Nikolaj

2010-01-01

The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is a state-of-the-art SMT solver. It is developed at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays. The talk describes some of the technology behind modern SMT solvers, including the solver Z3. Z3 is currently mainly targeted at solving problems that arise in software analysis and verification. It has been applied to various contexts, such as systems for dynamic symbolic simulation (Pex, SAGE, Vigilante), for program verification and extended static checking (Spec#/Boggie, VCC, HAVOC), for software model checking (Yogi, SLAM), model-based design (FORMULA), security protocol code (F7), program run-time analysis and invariant generation (VS3). We will describe how it integrates support for a variety of theories that arise naturally in the context of the applications. There are several new promising avenues and the talk will touch on some of these and the challenges related to SMT solvers. Proceedings

A finite element field solver for dipole modes

International Nuclear Information System (INIS)

Nelson, E.M.

1992-01-01

A finite element field solver for dipole modes in axisymmetric structures has been written. The second-order elements used in this formulation yield accurate mode frequencies with no spurious modes. Quasi-periodic boundaries are included to allow travelling waves in periodic structures. The solver is useful in applications requiring precise frequency calculations such as detuned accelerator structures for linear colliders. Comparisons are made with measurements and with the popular but less accurate field solver URMEL. (author). 7 refs., 4 figs

A heterogeneous CPU+GPU Poisson solver for space charge calculations in beam dynamics studies

Energy Technology Data Exchange (ETDEWEB)

Zheng, Dawei; Rienen, Ursula van [University of Rostock, Institute of General Electrical Engineering (Germany)

2016-07-01

In beam dynamics studies in accelerator physics, space charge plays a central role in the low energy regime of an accelerator. Numerical space charge calculations are required, both, in the design phase and in the operation of the machines as well. Due to its efficiency, mostly the Particle-In-Cell (PIC) method is chosen for the space charge calculation. Then, the solution of Poisson's equation for the charge distribution in the rest frame is the most prominent part within the solution process. The Poisson solver directly affects the accuracy of the self-field applied on the charged particles when the equation of motion is solved in the laboratory frame. As the Poisson solver consumes the major part of the computing time in most simulations it has to be as fast as possible since it has to be carried out once per time step. In this work, we demonstrate a novel heterogeneous CPU+GPU routine for the Poisson solver. The novel solver also benefits from our new research results on the utilization of a discrete cosine transform within the classical Hockney and Eastwood's convolution routine.

Fast Multipole-Based Preconditioner for Sparse Iterative Solvers

KAUST Repository

Ibeid, Huda; Yokota, Rio; Keyes, David E.

2014-01-01

Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.

Fast Multipole-Based Preconditioner for Sparse Iterative Solvers

KAUST Repository

Ibeid, Huda

2014-05-04

Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.

An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU

International Nuclear Information System (INIS)

Yoon, Jong Seon; Choi, Hyoung Gwon; Jeon, Byoung Jin

2017-01-01

The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.

An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU

Energy Technology Data Exchange (ETDEWEB)

Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of)

2017-02-15

The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.

PUFoam : A novel open-source CFD solver for the simulation of polyurethane foams

Science.gov (United States)

Karimi, M.; Droghetti, H.; Marchisio, D. L.

2017-08-01

In this work a transient three-dimensional mathematical model is formulated and validated for the simulation of polyurethane (PU) foams. The model is based on computational fluid dynamics (CFD) and is coupled with a population balance equation (PBE) to describe the evolution of the gas bubbles/cells within the PU foam. The front face of the expanding foam is monitored on the basis of the volume-of-fluid (VOF) method using a compressible solver available in OpenFOAM version 3.0.1. The solver is additionally supplemented to include the PBE, solved with the quadrature method of moments (QMOM), the polymerization kinetics, an adequate rheological model and a simple model for the foam thermal conductivity. The new solver is labelled as PUFoam and is, for the first time in this work, validated for 12 different mixing-cup experiments. Comparison of the time evolution of the predicted and experimentally measured density and temperature of the PU foam shows the potentials and limitations of the approach.

A hybrid method combining the Time-Domain Method of Moments, the Time-Domain Uniform Theory of Diffraction and the FDTD

Directory of Open Access Journals (Sweden)

A. Becker

2007-06-01

Full Text Available In this paper a hybrid method combining the Time-Domain Method of Moments (TD-MoM, the Time-Domain Uniform Theory of Diffraction (TD-UTD and the Finite-Difference Time-Domain Method (FDTD is presented. When applying this new hybrid method, thin-wire antennas are modeled with the TD-MoM, inhomogeneous bodies are modelled with the FDTD and large perfectly conducting plates are modelled with the TD-UTD. All inhomogeneous bodies are enclosed in a so-called FDTD-volume and the thin-wire antennas can be embedded into this volume or can lie outside. The latter avoids the simulation of white space between antennas and inhomogeneous bodies. If the antennas are positioned into the FDTD-volume, their discretization does not need to agree with the grid of the FDTD. By using the TD-UTD large perfectly conducting plates can be considered efficiently in the solution-procedure. Thus this hybrid method allows time-domain simulations of problems including very different classes of objects, applying the respective most appropriate numerical techniques to every object.

A non overlapping parallel domain decomposition method applied to the simplified transport equations

International Nuclear Information System (INIS)

Lathuiliere, B.; Barrault, M.; Ramet, P.; Roman, J.

2009-01-01

A reactivity computation requires to compute the highest eigenvalue of a generalized eigenvalue problem. An inverse power algorithm is used commonly. Very fine modelizations are difficult to tackle for our sequential solver, based on the simplified transport equations, in terms of memory consumption and computational time. So, we propose a non-overlapping domain decomposition method for the approximate resolution of the linear system to solve at each inverse power iteration. Our method brings to a low development effort as the inner multigroup solver can be re-use without modification, and allows us to adapt locally the numerical resolution (mesh, finite element order). Numerical results are obtained by a parallel implementation of the method on two different cases with a pin by pin discretization. This results are analyzed in terms of memory consumption and parallel efficiency. (authors)

Three-Dimensional Inverse Transport Solver Based on Compressive Sensing Technique

Science.gov (United States)

Cheng, Yuxiong; Wu, Hongchun; Cao, Liangzhi; Zheng, Youqi

2013-09-01

According to the direct exposure measurements from flash radiographic image, a compressive sensing-based method for three-dimensional inverse transport problem is presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. It is always very expensive to obtain enough measurements. With limited measurements, compressive sensing sparse reconstruction technique orthogonal matching pursuit is applied to obtain the sparse coefficients by solving an optimization problem. A three-dimensional inverse transport solver is developed based on a compressive sensing-based technique. There are three features in this solver: (1) AutoCAD is employed as a geometry preprocessor due to its powerful capacity in graphic. (2) The forward projection matrix rather than Gauss matrix is constructed by the visualization tool generator. (3) Fourier transform and Daubechies wavelet transform are adopted to convert an underdetermined system to a well-posed system in the algorithm. Simulations are performed and numerical results in pseudo-sine absorption problem, two-cube problem and two-cylinder problem when using compressive sensing-based solver agree well with the reference value.

A high order solver for the unbounded Poisson equation

DEFF Research Database (Denmark)

Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe

2013-01-01

. The method is extended to directly solve the derivatives of the solution to Poissonʼs equation. In this way differential operators such as the divergence or curl of the solution field can be solved to the same high order convergence without additional computational effort. The method, is applied......A high order converging Poisson solver is presented, based on the Greenʼs function solution to Poissonʼs equation subject to free-space boundary conditions. The high order convergence is achieved by formulating regularised integration kernels, analogous to a smoothing of the solution field...... and validated, however not restricted, to the equations of fluid mechanics, and can be used in many applications to solve Poissonʼs equation on a rectangular unbounded domain....

Comparing direct and iterative equation solvers in a large structural analysis software system

Science.gov (United States)

Poole, E. L.

1991-01-01

Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.

Casimir forces in the time domain: Theory

International Nuclear Information System (INIS)

Rodriguez, Alejandro W.; McCauley, Alexander P.; Joannopoulos, John D.; Johnson, Steven G.

2009-01-01

We present a method to compute Casimir forces in arbitrary geometries and for arbitrary materials based on the finite-difference time-domain (FDTD) scheme. The method involves the time evolution of electric and magnetic fields in response to a set of current sources, in a modified medium with frequency-independent conductivity. The advantage of this approach is that it allows one to exploit existing FDTD software, without modification, to compute Casimir forces. In this paper, we focus on the derivation, implementation choices, and essential properties of the time-domain algorithm, both considered analytically and illustrated in the simplest parallel-plate geometry.

Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis

KAUST Repository

Kuźnik, Krzysztof

2012-06-02

This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU.

Time-domain finite elements in optimal control with application to launch-vehicle guidance. PhD. Thesis

Science.gov (United States)

Bless, Robert R.

1991-01-01

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Eulerian Time-Domain Filtering for Spatial LES

Science.gov (United States)

Pruett, C. David

1997-01-01

Eulerian time-domain filtering seems to be appropriate for LES (large eddy simulation) of flows whose large coherent structures convect approximately at a common characteristic velocity; e.g., mixing layers, jets, and wakes. For these flows, we develop an approach to LES based on an explicit second-order digital Butterworth filter, which is applied in,the time domain in an Eulerian context. The approach is validated through a priori and a posteriori analyses of the simulated flow of a heated, subsonic, axisymmetric jet.

Three Dimensional Energy Transmitting Boundary in the Time Domain

Directory of Open Access Journals (Sweden)

Naohiro eNakamura

2015-11-01

Full Text Available Although the energy transmitting boundary is accurate and efficient for the FEM earthquake response analysis, it could be applied in the frequency domain only. In the previous papers, the author proposed an earthquake response analysis method using the time domain energy transmitting boundary for two dimensional problems. In this paper, this technique is expanded for three dimensional problems. The inner field is supposed to be a hexahedron shape and the approximate time domain boundary is explained, first. Next, two dimensional anti-plane time domain boundary is studied for a part of the approximate three dimensional boundary method. Then, accuracy and efficiency of the proposed method are confirmed by example problems.

New iterative solvers for the NAG Libraries

Energy Technology Data Exchange (ETDEWEB)

Salvini, S.; Shaw, G. [Numerical Algorithms Group Ltd., Oxford (United Kingdom)

1996-12-31

The purpose of this paper is to introduce the work which has been carried out at NAG Ltd to update the iterative solvers for sparse systems of linear equations, both symmetric and unsymmetric, in the NAG Fortran 77 Library. Our current plans to extend this work and include it in our other numerical libraries in our range are also briefly mentioned. We have added to the Library the new Chapter F11, entirely dedicated to sparse linear algebra. At Mark 17, the F11 Chapter includes sparse iterative solvers, preconditioners, utilities and black-box routines for sparse symmetric (both positive-definite and indefinite) linear systems. Mark 18 will add solvers, preconditioners, utilities and black-boxes for sparse unsymmetric systems: the development of these has already been completed.

An Unsplit Monte-Carlo solver for the resolution of the linear Boltzmann equation coupled to (stiff) Bateman equations

Science.gov (United States)

Bernede, Adrien; Poëtte, Gaël

2018-02-01

In this paper, we are interested in the resolution of the time-dependent problem of particle transport in a medium whose composition evolves with time due to interactions. As a constraint, we want to use of Monte-Carlo (MC) scheme for the transport phase. A common resolution strategy consists in a splitting between the MC/transport phase and the time discretization scheme/medium evolution phase. After going over and illustrating the main drawbacks of split solvers in a simplified configuration (monokinetic, scalar Bateman problem), we build a new Unsplit MC (UMC) solver improving the accuracy of the solutions, avoiding numerical instabilities, and less sensitive to time discretization. The new solver is essentially based on a Monte Carlo scheme with time dependent cross sections implying the on-the-fly resolution of a reduced model for each MC particle describing the time evolution of the matter along their flight path.

Frequency-domain and time-domain methods for feedback nonlinear systems and applications to chaos control

International Nuclear Information System (INIS)

Duan Zhisheng; Wang Jinzhi; Yang Ying; Huang Lin

2009-01-01

This paper surveys frequency-domain and time-domain methods for feedback nonlinear systems and their possible applications to chaos control, coupled systems and complex dynamical networks. The absolute stability of Lur'e systems with single equilibrium and global properties of a class of pendulum-like systems with multi-equilibria are discussed. Time-domain and frequency-domain criteria for the convergence of solutions are presented. Some latest results on analysis and control of nonlinear systems with multiple equilibria and applications to chaos control are reviewed. Finally, new chaotic oscillating phenomena are shown in a pendulum-like system and a new nonlinear system with an attraction/repulsion function.

Calculation of nonzero-temperature Casimir forces in the time domain

International Nuclear Information System (INIS)

Pan, Kai; Reid, M. T. Homer; McCauley, Alexander P.; Rodriguez, Alejandro W.; White, Jacob K.; Johnson, Steven G.

2011-01-01

We show how to compute Casimir forces at nonzero temperatures with time-domain electromagnetic simulations, for example, using a finite-difference time-domain (FDTD) method. Compared to our previous zero-temperature time-domain method, only a small modification is required, but we explain that some care is required to properly capture the zero-frequency contribution. We validate the method against analytical and numerical frequency-domain calculations, and show a surprising high-temperature disappearance of a nonmonotonic behavior previously demonstrated in a pistonlike geometry.

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

Science.gov (United States)

Povitsky, A.

1998-01-01

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Computational aeroelasticity using a pressure-based solver

Science.gov (United States)

Kamakoti, Ramji

A computational methodology for performing fluid-structure interaction computations for three-dimensional elastic wing geometries is presented. The flow solver used is based on an unsteady Reynolds-Averaged Navier-Stokes (RANS) model. A well validated k-ε turbulence model with wall function treatment for near wall region was used to perform turbulent flow calculations. Relative merits of alternative flow solvers were investigated. The predictor-corrector-based Pressure Implicit Splitting of Operators (PISO) algorithm was found to be computationally economic for unsteady flow computations. Wing structure was modeled using Bernoulli-Euler beam theory. A fully implicit time-marching scheme (using the Newmark integration method) was used to integrate the equations of motion for structure. Bilinear interpolation and linear extrapolation techniques were used to transfer necessary information between fluid and structure solvers. Geometry deformation was accounted for by using a moving boundary module. The moving grid capability was based on a master/slave concept and transfinite interpolation techniques. Since computations were performed on a moving mesh system, the geometric conservation law must be preserved. This is achieved by appropriately evaluating the Jacobian values associated with each cell. Accurate computation of contravariant velocities for unsteady flows using the momentum interpolation method on collocated, curvilinear grids was also addressed. Flutter computations were performed for the AGARD 445.6 wing at subsonic, transonic and supersonic Mach numbers. Unsteady computations were performed at various dynamic pressures to predict the flutter boundary. Results showed favorable agreement of experiment and previous numerical results. The computational methodology exhibited capabilities to predict both qualitative and quantitative features of aeroelasticity.

A Novel Interactive MINLP Solver for CAPE Applications

DEFF Research Database (Denmark)

Henriksen, Jens Peter; Støy, S.; Russel, Boris Mariboe

2000-01-01

This paper presents an interactive MINLP solver that is particularly suitable for solution of process synthesis, design and analysis problems. The interactive MINLP solver is based on the decomposition based MINLP algorithms, where a NLP sub-problem is solved in the innerloop and a MILP master pr...

Inversion of time-domain induced polarization data based on time-lapse concept

Science.gov (United States)

Kim, Bitnarae; Nam, Myung Jin; Kim, Hee Joon

2018-05-01

Induced polarization (IP) surveys, measuring overvoltage phenomena of the medium, are widely and increasingly performed not only for exploration of mineral resources but also for engineering applications. Among several IP survey methods such as time-domain, frequency-domain and spectral IP surveys, this study introduces a noble inversion method for time-domain IP data to recover the chargeability structure of target medium. The inversion method employs the concept of 4D inversion of time-lapse resistivity data sets, considering the fact that measured voltage in time-domain IP survey is distorted by IP effects to increase from the instantaneous voltage measured at the moment the source current injection starts. Even though the increase is saturated very fast, we can consider the saturated and instantaneous voltages as a time-lapse data set. The 4D inversion method is one of the most powerful method for inverting time-lapse resistivity data sets. Using the developed IP inversion algorithm, we invert not only synthetic but also field IP data to show the effectiveness of the proposed method by comparing the recovered chargeability models with those from linear inversion that was used for the inversion of the field data in a previous study. Numerical results confirm that the proposed inversion method generates reliable chargeability models even though the anomalous bodies have large IP effects.

Time-Reversal MUSIC Imaging with Time-Domain Gating Technique

Science.gov (United States)

Choi, Heedong; Ogawa, Yasutaka; Nishimura, Toshihiko; Ohgane, Takeo

A time-reversal (TR) approach with multiple signal classification (MUSIC) provides super-resolution for detection and localization using multistatic data collected from an array antenna system. The theory of TR-MUSIC assumes that the number of antenna elements is greater than that of scatterers (targets). Furthermore, it requires many sets of frequency-domain data (snapshots) in seriously noisy environments. Unfortunately, these conditions are not practical for real environments due to the restriction of a reasonable antenna structure as well as limited measurement time. We propose an approach that treats both noise reduction and relaxation of the transceiver restriction by using a time-domain gating technique accompanied with the Fourier transform before applying the TR-MUSIC imaging algorithm. Instead of utilizing the conventional multistatic data matrix (MDM), we employ a modified MDM obtained from the gating technique. The resulting imaging functions yield more reliable images with only a few snapshots regardless of the limitation of the antenna arrays.

A two-dimensional time domain near zone to far zone transformation

Science.gov (United States)

Luebbers, Raymond J.; Ryan, Deirdre; Beggs, John H.; Kunz, Karl S.

1991-01-01

In a previous paper, a time domain transformation useful for extrapolating 3-D near zone finite difference time domain (FDTD) results to the far zone was presented. In this paper, the corresponding 2-D transform is outlined. While the 3-D transformation produced a physically observable far zone time domain field, this is not convenient to do directly in 2-D, since a convolution would be required. However, a representative 2-D far zone time domain result can be obtained directly. This result can then be transformed to the frequency domain using a Fast Fourier Transform, corrected with a simple multiplicative factor, and used, for example, to calculate the complex wideband scattering width of a target. If an actual time domain far zone result is required it can be obtained by inverse Fourier transform of the final frequency domain result.

Chemical Mechanism Solvers in Air Quality Models

Directory of Open Access Journals (Sweden)

John C. Linford

2011-09-01

Full Text Available The solution of chemical kinetics is one of the most computationally intensivetasks in atmospheric chemical transport simulations. Due to the stiff nature of the system,implicit time stepping algorithms which repeatedly solve linear systems of equations arenecessary. This paper reviews the issues and challenges associated with the construction ofefficient chemical solvers, discusses several families of algorithms, presents strategies forincreasing computational efficiency, and gives insight into implementing chemical solverson accelerated computer architectures.

Metrology for terahertz time-domain spectrometers

Science.gov (United States)

Molloy, John F.; Naftaly, Mira

2015-12-01

In recent years the terahertz time-domain spectrometer (THz TDS) [1] has emerged as a key measurement device for spectroscopic investigations in the frequency range of 0.1-5 THz. To date, almost every type of material has been studied using THz TDS, including semiconductors, ceramics, polymers, metal films, liquid crystals, glasses, pharmaceuticals, DNA molecules, proteins, gases, composites, foams, oils, and many others. Measurements with a TDS are made in the time domain; conversion from the time domain data to a frequency spectrum is achieved by applying the Fourier Transform, calculated numerically using the Fast Fourier Transform (FFT) algorithm. As in many other types of spectrometer, THz TDS requires that the sample data be referenced to similarly acquired data with no sample present. Unlike frequency-domain spectrometers which detect light intensity and measure absorption spectra, a TDS records both amplitude and phase information, and therefore yields both the absorption coefficient and the refractive index of the sample material. The analysis of the data from THz TDS relies on the assumptions that: a) the frequency scale is accurate; b) the measurement of THz field amplitude is linear; and c) that the presence of the sample does not affect the performance characteristics of the instrument. The frequency scale of a THz TDS is derived from the displacement of the delay line; via FFT, positioning errors may give rise to frequency errors that are difficult to quantify. The measurement of the field amplitude in a THz TDS is required to be linear with a dynamic range of the order of 10 000. And attention must be given to the sample positioning and handling in order to avoid sample-related errors.

An FFT-accelerated time-domain multiconductor transmission line simulator

KAUST Repository

Bagci, Hakan; Yilmaz, Ali E.; Michielssen, Eric

2010-01-01

simulator is amenable to hybridization, is fast Fourier transform (FFT)-accelerated, and is highly accurate: 1) It can easily be hybridized with TDIE-based field solvers (in a fully rigorous mathematical framework) for performing electromagnetic interference

Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids

KAUST Repository

AbouEisha, Hassan M.

2014-06-06

In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm.

Iterative linear solvers in a 2D radiation-hydrodynamics code: Methods and performance

International Nuclear Information System (INIS)

Baldwin, C.; Brown, P.N.; Falgout, R.; Graziani, F.; Jones, J.

1999-01-01

Computer codes containing both hydrodynamics and radiation play a central role in simulating both astrophysical and inertial confinement fusion (ICF) phenomena. A crucial aspect of these codes is that they require an implicit solution of the radiation diffusion equations. The authors present in this paper the results of a comparison of five different linear solvers on a range of complex radiation and radiation-hydrodynamics problems. The linear solvers used are diagonally scaled conjugate gradient, GMRES with incomplete LU preconditioning, conjugate gradient with incomplete Cholesky preconditioning, multigrid, and multigrid-preconditioned conjugate gradient. These problems involve shock propagation, opacities varying over 5--6 orders of magnitude, tabular equations of state, and dynamic ALE (Arbitrary Lagrangian Eulerian) meshes. They perform a problem size scalability study by comparing linear solver performance over a wide range of problem sizes from 1,000 to 100,000 zones. The fundamental question they address in this paper is: Is it more efficient to invert the matrix in many inexpensive steps (like diagonally scaled conjugate gradient) or in fewer expensive steps (like multigrid)? In addition, what is the answer to this question as a function of problem size and is the answer problem dependent? They find that the diagonally scaled conjugate gradient method performs poorly with the growth of problem size, increasing in both iteration count and overall CPU time with the size of the problem and also increasing for larger time steps. For all problems considered, the multigrid algorithms scale almost perfectly (i.e., the iteration count is approximately independent of problem size and problem time step). For pure radiation flow problems (i.e., no hydrodynamics), they see speedups in CPU time of factors of ∼15--30 for the largest problems, when comparing the multigrid solvers relative to diagonal scaled conjugate gradient

CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. II. GRAY RADIATION HYDRODYNAMICS

International Nuclear Information System (INIS)

Zhang, W.; Almgren, A.; Bell, J.; Howell, L.; Burrows, A.

2011-01-01

We describe the development of a flux-limited gray radiation solver for the compressible astrophysics code, CASTRO. CASTRO uses an Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. The gray radiation solver is based on a mixed-frame formulation of radiation hydrodynamics. In our approach, the system is split into two parts, one part that couples the radiation and fluid in a hyperbolic subsystem, and another parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem is solved explicitly with a high-order Godunov scheme, whereas the parabolic part is solved implicitly with a first-order backward Euler method.

The impact of improved sparse linear solvers on industrial engineering applications

Energy Technology Data Exchange (ETDEWEB)

Heroux, M. [Cray Research, Inc., Eagan, MN (United States); Baddourah, M.; Poole, E.L.; Yang, Chao Wu

1996-12-31

There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.

Development of axisymmetric lattice Boltzmann flux solver for complex multiphase flows

Science.gov (United States)

Wang, Yan; Shu, Chang; Yang, Li-Ming; Yuan, Hai-Zhuan

2018-05-01

This paper presents an axisymmetric lattice Boltzmann flux solver (LBFS) for simulating axisymmetric multiphase flows. In the solver, the two-dimensional (2D) multiphase LBFS is applied to reconstruct macroscopic fluxes excluding axisymmetric effects. Source terms accounting for axisymmetric effects are introduced directly into the governing equations. As compared to conventional axisymmetric multiphase lattice Boltzmann (LB) method, the present solver has the kinetic feature for flux evaluation and avoids complex derivations of external forcing terms. In addition, the present solver also saves considerable computational efforts in comparison with three-dimensional (3D) computations. The capability of the proposed solver in simulating complex multiphase flows is demonstrated by studying single bubble rising in a circular tube. The obtained results compare well with the published data.

Implementation of a Forth-Order Aeroelastic Coupling into a Viscous-Inviscid Flow Solver with Experimental Validation (for One Degree of Freedom)

Science.gov (United States)

Bartholomay, Sirko; Ramos-García, Néstor; Mikkelsen, Robert Flemming; Technical University of Denmark (DTU)-WInd Energy Team

2014-11-01

The viscous-inviscid flow solver Q3UIC for 2D aerodynamics has recently been developed at the Technical University of Denmark. The Q3UIC solver takes viscous and unsteady effects into account by coupling an unsteady inviscid panel method with the integral boundary layer equations by means of a strong coupling between the viscous and inviscid parts, and in this respect differs from other classic panel codes e.g. Xfoil. In the current work a Runge-Kutta-Nyström scheme was employed to couple inertial, elastic and aerodynamical forces and moments calculated by Q3UIC for a two-dimensional blade section in the time-domain. Numerical simulations are validated by a three step experimental verification process carried out in the low-turbulence wind tunnel at DTU. First, a comparison against steady experiments for a NACA 64418 profile and a flexible trailing edge flap is presented for different fixed flap angles, and second, the measured aerodynamic characteristics considering prescribed motion of the airfoil with a moving flap are compared to the Q3UIC predictions. Finally, an aeroelastic experiment for one degree of freedom-airfoil pitching- is used to evaluate the accuracy of aeroelastic coupling.

Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation

KAUST Repository

Chen, Meng-Huo

2015-09-13

In this research we are particularly interested in extending the robustness of multigrid solvers to encounter complex systems related to subsurface reservoir applications for flow problems in porous media. In many cases, the step for solving the pressure filed in subsurface flow simulation becomes a bottleneck for the performance of the simulator. For solving large sparse linear system arising from MPFA discretization, we choose multigrid methods as the linear solver. The possible difficulties and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately goal which we desire to achieve.

Strongly coupled partitioned six degree-of-freedom rigid body motion solver with Aitken's dynamic under-relaxation

Directory of Open Access Journals (Sweden)

Jeng Hei Chow

2016-07-01

Full Text Available An implicit method of solving the six degree-of-freedom rigid body motion equations based on the second order Adams-Bashforth-Moulten method was utilised as an improvement over the leapfrog scheme by making modifications to the rigid body motion solver libraries directly. The implementation will depend on predictor-corrector steps still residing within the hybrid Pressure Implicit with Splitting of Operators - Semi-Implicit Method for Pressure Linked Equations (PIMPLE outer corrector loops to ensure strong coupling between fluid and motion. Aitken's under-relaxation is also introduced in this study to optimise the convergence rate and stability of the coupled solver. The resulting coupled solver ran on a free floating object tutorial test case when converged matches the original solver. It further allows a varying 70%–80% reduction in simulation times compared using a fixed under-relaxation to achieve the required stability.

Time and frequency domain analyses of the Hualien Large-Scale Seismic Test

International Nuclear Information System (INIS)

Kabanda, John; Kwon, Oh-Sung; Kwon, Gunup

2015-01-01

Highlights: • Time- and frequency-domain analysis methods are verified against each other. • The two analysis methods are validated against Hualien LSST. • The nonlinear time domain (NLTD) analysis resulted in more realistic response. • The frequency domain (FD) analysis shows amplification at resonant frequencies. • The NLTD analysis requires significant modeling and computing time. - Abstract: In the nuclear industry, the equivalent-linear frequency domain analysis method has been the de facto standard procedure primarily due to the method's computational efficiency. This study explores the feasibility of applying the nonlinear time domain analysis method for the soil–structure-interaction analysis of nuclear power facilities. As a first step, the equivalency of the time and frequency domain analysis methods is verified through a site response analysis of one-dimensional soil, a dynamic impedance analysis of soil–foundation system, and a seismic response analysis of the entire soil–structure system. For the verifications, an idealized elastic soil–structure system is used to minimize variables in the comparison of the two methods. Then, the verified analysis methods are used to develop time and frequency domain models of Hualien Large-Scale Seismic Test. The predicted structural responses are compared against field measurements. The models are also analyzed with an amplified ground motion to evaluate discrepancies of the time and frequency domain analysis methods when the soil–structure system behaves beyond the elastic range. The analysis results show that the equivalent-linear frequency domain analysis method amplifies certain frequency bands and tends to result in higher structural acceleration than the nonlinear time domain analysis method. A comparison with field measurements shows that the nonlinear time domain analysis method better captures the frequency distribution of recorded structural responses than the frequency domain

High-Performance Small-Scale Solvers for Moving Horizon Estimation

DEFF Research Database (Denmark)

Frison, Gianluca; Vukov, Milan; Poulsen, Niels Kjølstad

2015-01-01

implementation techniques focusing on small-scale problems. The proposed MHE solver is implemented using custom linear algebra routines and is compared against implementations using BLAS libraries. Additionally, the MHE solver is interfaced to a code generation tool for nonlinear model predictive control (NMPC...

Users are problem solvers!

NARCIS (Netherlands)

Brouwer-Janse, M.D.

1991-01-01

Most formal problem-solving studies use verbal protocol and observational data of problem solvers working on a task. In user-centred product-design projects, observational studies of users are frequently used too. In the latter case, however, systematic control of conditions, indepth analysis and

Scalable Nonlinear Solvers for Fully Implicit Coupled Nuclear Fuel Modeling. Final Report

International Nuclear Information System (INIS)

Cai, Xiao-Chuan; Yang, Chao; Pernice, Michael

2014-01-01

The focus of the project is on the development and customization of some highly scalable domain decomposition based preconditioning techniques for the numerical solution of nonlinear, coupled systems of partial differential equations (PDEs) arising from nuclear fuel simulations. These high-order PDEs represent multiple interacting physical fields (for example, heat conduction, oxygen transport, solid deformation), each is modeled by a certain type of Cahn-Hilliard and/or Allen-Cahn equations. Most existing approaches involve a careful splitting of the fields and the use of field-by-field iterations to obtain a solution of the coupled problem. Such approaches have many advantages such as ease of implementation since only single field solvers are needed, but also exhibit disadvantages. For example, certain nonlinear interactions between the fields may not be fully captured, and for unsteady problems, stable time integration schemes are difficult to design. In addition, when implemented on large scale parallel computers, the sequential nature of the field-by-field iterations substantially reduces the parallel efficiency. To overcome the disadvantages, fully coupled approaches have been investigated in order to obtain full physics simulations.

An alternative solver for the nodal expansion method equations - 106

International Nuclear Information System (INIS)

Carvalho da Silva, F.; Carlos Marques Alvim, A.; Senra Martinez, A.

2010-01-01

An automated procedure for nuclear reactor core design is accomplished by using a quick and accurate 3D nodal code, aiming at solving the diffusion equation, which describes the spatial neutron distribution in the reactor. This paper deals with an alternative solver for nodal expansion method (NEM), with only two inner iterations (mesh sweeps) per outer iteration, thus having the potential to reduce the time required to calculate the power distribution in nuclear reactors, but with accuracy similar to the ones found in conventional NEM. The proposed solver was implemented into a computational system which, besides solving the diffusion equation, also solves the burnup equations governing the gradual changes in material compositions of the core due to fuel depletion. Results confirm the effectiveness of the method for practical purposes. (authors)

Ramses-GPU: Second order MUSCL-Handcock finite volume fluid solver

Science.gov (United States)

Kestener, Pierre

2017-10-01

RamsesGPU is a reimplementation of RAMSES (ascl:1011.007) which drops the adaptive mesh refinement (AMR) features to optimize 3D uniform grid algorithms for modern graphics processor units (GPU) to provide an efficient software package for astrophysics applications that do not need AMR features but do require a very large number of integration time steps. RamsesGPU provides an very efficient C++/CUDA/MPI software implementation of a second order MUSCL-Handcock finite volume fluid solver for compressible hydrodynamics as a magnetohydrodynamics solver based on the constraint transport technique. Other useful modules includes static gravity, dissipative terms (viscosity, resistivity), and forcing source term for turbulence studies, and special care was taken to enhance parallel input/output performance by using state-of-the-art libraries such as HDF5 and parallel-netcdf.

A Generic High-performance GPU-based Library for PDE solvers

DEFF Research Database (Denmark)

Glimberg, Stefan Lemvig; Engsig-Karup, Allan Peter

, the privilege of high-performance parallel computing is now in principle accessible for many scientific users, no matter their economic resources. Though being highly effective units, GPUs and parallel architectures in general, pose challenges for software developers to utilize their efficiency. Sequential...... legacy codes are not always easily parallelized and the time spent on conversion might not pay o in the end. We present a highly generic C++ library for fast assembling of partial differential equation (PDE) solvers, aiming at utilizing the computational resources of GPUs. The library requires a minimum...... of GPU computing knowledge, while still oering the possibility to customize user-specic solvers at kernel level if desired. Spatial dierential operators are based on matrix free exible order nite dierence approximations. These matrix free operators minimize both memory consumption and main memory access...

iTesla Power Systems Library (iPSL): A Modelica library for phasor time-domain simulations

Science.gov (United States)

Vanfretti, L.; Rabuzin, T.; Baudette, M.; Murad, M.

The iTesla Power Systems Library (iPSL) is a Modelica package providing a set of power system components for phasor time-domain modeling and simulation. The Modelica language provides a systematic approach to develop models using a formal mathematical description, that uniquely specifies the physical behavior of a component or the entire system. Furthermore, the standardized specification of the Modelica language (Modelica Association [1]) enables unambiguous model exchange by allowing any Modelica-compliant tool to utilize the models for simulation and their analyses without the need of a specific model transformation tool. As the Modelica language is being developed with open specifications, any tool that implements these requirements can be utilized. This gives users the freedom of choosing an Integrated Development Environment (IDE) of their choice. Furthermore, any integration solver can be implemented within a Modelica tool to simulate Modelica models. Additionally, Modelica is an object-oriented language, enabling code factorization and model re-use to improve the readability of a library by structuring it with object-oriented hierarchy. The developed library is released under an open source license to enable a wider distribution and let the user customize it to their specific needs. This paper describes the iPSL and provides illustrative application examples.

An acceleration technique for 2D MOC based on Krylov subspace and domain decomposition methods

International Nuclear Information System (INIS)

Zhang Hongbo; Wu Hongchun; Cao Liangzhi

2011-01-01

Highlights: → We convert MOC into linear system solved by GMRES as an acceleration method. → We use domain decomposition method to overcome the inefficiency on large matrices. → Parallel technology is applied and a matched ray tracing system is developed. → Results show good efficiency even in large-scale and strong scattering problems. → The emphasis is that the technique is geometry-flexible. - Abstract: The method of characteristics (MOC) has great geometrical flexibility but poor computational efficiency in neutron transport calculations. The generalized minimal residual (GMRES) method, a type of Krylov subspace method, is utilized to accelerate a 2D generalized geometry characteristics solver AutoMOC. In this technique, a form of linear algebraic equation system for angular flux moments and boundary fluxes is derived to replace the conventional characteristics sweep (i.e. inner iteration) scheme, and then the GMRES method is implemented as an efficient linear system solver. This acceleration method is proved to be reliable in theory and simple for implementation. Furthermore, as introducing no restriction in geometry treatment, it is suitable for acceleration of an arbitrary geometry MOC solver. However, it is observed that the speedup decreases when the matrix becomes larger. The spatial domain decomposition method and multiprocessing parallel technology are then employed to overcome the problem. The calculation domain is partitioned into several sub-domains. For each of them, a smaller matrix is established and solved by GMRES; and the adjacent sub-domains are coupled by 'inner-edges', where the trajectory mismatches are considered adequately. Moreover, a matched ray tracing system is developed on the basis of AutoCAD, which allows a user to define the sub-domains on demand conveniently. Numerical results demonstrate that the acceleration techniques are efficient without loss of accuracy, even in the case of large-scale and strong scattering

Differences between time domain and Fourier domain optical coherence tomography in imaging tissues.

Science.gov (United States)

Gao, W; Wu, X

2017-11-01

It has been numerously demonstrated that both time domain and Fourier domain optical coherence tomography (OCT) can generate high-resolution depth-resolved images of living tissues and cells. In this work, we compare the common points and differences between two methods when the continuous and random properties of live tissue are taken into account. It is found that when relationships that exist between the scattered light and tissue structures are taken into account, spectral interference measurements in Fourier domain OCT (FDOCT) is more advantageous than interference fringe envelope measurements in time domain OCT (TDOCT) in the cases where continuous property of tissue is taken into account. It is also demonstrated that when random property of tissue is taken into account FDOCT measures the Fourier transform of the spatial correlation function of the refractive index and speckle phenomena will limit the effective limiting imaging resolution in both TDOCT and FDOCT. Finally, the effective limiting resolution of both TDOCT and FDOCT are given which can be used to estimate the effective limiting resolution in various practical applications. © 2017 The Authors Journal of Microscopy © 2017 Royal Microscopical Society.

A Wavelet-Enhanced PWTD-Accelerated Time-Domain Integral Equation Solver for Analysis of Transient Scattering from Electrically Large Conducting Objects

KAUST Repository

Liu, Yang; Yucel, Abdulkadir C.; Bagci, Hakan; Gilbert, Anna C.; Michielssen, Eric

2018-01-01

requirement and computational cost of the PWTD algorithm by representing the PWTD ray data using local cosine wavelet bases (LCBs) and performing PWTD operations in the wavelet domain. The memory requirement and computational cost of the LCB-enhanced PWTD

Time Domain Induced Polarization

DEFF Research Database (Denmark)

Fiandaca, Gianluca; Auken, Esben; Christiansen, Anders Vest

2012-01-01

Time-domain-induced polarization has significantly broadened its field of reference during the last decade, from mineral exploration to environmental geophysics, e.g., for clay and peat identification and landfill characterization. Though, insufficient modeling tools have hitherto limited the use...... of time-domaininduced polarization for wider purposes. For these reasons, a new forward code and inversion algorithm have been developed using the full-time decay of the induced polarization response, together with an accurate description of the transmitter waveform and of the receiver transfer function......, to reconstruct the distribution of the Cole-Cole parameters of the earth. The accurate modeling of the transmitter waveform had a strong influence on the forward response, and we showed that the difference between a solution using a step response and a solution using the accurate modeling often is above 100...

A Nonlinear Modal Aeroelastic Solver for FUN3D

Science.gov (United States)

Goldman, Benjamin D.; Bartels, Robert E.; Biedron, Robert T.; Scott, Robert C.

2016-01-01

A nonlinear structural solver has been implemented internally within the NASA FUN3D computational fluid dynamics code, allowing for some new aeroelastic capabilities. Using a modal representation of the structure, a set of differential or differential-algebraic equations are derived for general thin structures with geometric nonlinearities. ODEPACK and LAPACK routines are linked with FUN3D, and the nonlinear equations are solved at each CFD time step. The existing predictor-corrector method is retained, whereby the structural solution is updated after mesh deformation. The nonlinear solver is validated using a test case for a flexible aeroshell at transonic, supersonic, and hypersonic flow conditions. Agreement with linear theory is seen for the static aeroelastic solutions at relatively low dynamic pressures, but structural nonlinearities limit deformation amplitudes at high dynamic pressures. No flutter was found at any of the tested trajectory points, though LCO may be possible in the transonic regime.

Microresonator-Based Optical Frequency Combs: A Time Domain Perspective

Science.gov (United States)

2016-04-19

AFRL-AFOSR-VA-TR-2016-0165 (BRI) Microresonator-Based Optical Frequency Combs: A Time Domain Perspective Andrew Weiner PURDUE UNIVERSITY 401 SOUTH...Optical Frequency Combs: A Time Domain Perspective 5a. CONTRACT NUMBER 5b. GRANT NUMBER FA9550-12-1-0236 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S...average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data

A Time Marching Scheme for Solving Volume Integral Equations on Nonlinear Scatterers

KAUST Repository

Bagci, Hakan

2015-01-07

Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are oftentimes solved using marchingon-in-time (MOT) schemes. Unlike finite difference and finite element schemes, MOT-TDVIE solvers require discretization of only the scatterers, do not call for artificial absorbing boundary conditions, and are more robust to numerical phase dispersion. On the other hand, their computational cost is high, they suffer from late-time instabilities, and their implicit nature makes incorporation of nonlinear constitutive relations more difficult. Development of plane-wave time-domain (PWTD) and FFT-based schemes has significantly reduced the computational cost of the MOT-TDVIE solvers. Additionally, latetime instability problem has been alleviated for all practical purposes with the development of accurate integration schemes and specially designed temporal basis functions. Addressing the third challenge is the topic of this presentation. I will talk about an explicit MOT scheme developed for solving the TDVIE on scatterers with nonlinear material properties. The proposed scheme separately discretizes the TDVIE and the nonlinear constitutive relation between electric field intensity and flux density. The unknown field intensity and flux density are expanded using half and full Schaubert-Wilton-Glisson (SWG) basis functions in space and polynomial temporal interpolators in time. The resulting coupled system of the discretized TDVIE and constitutive relation is integrated in time using an explicit P E(CE) m scheme to yield the unknown expansion coefficients. Explicitness of time marching allows for straightforward incorporation of the nonlinearity as a function evaluation on the right hand side of the coupled system of equations. Consequently, the resulting MOT scheme does not call for a Newton-like nonlinear solver. Numerical examples, which demonstrate the applicability

A Time Marching Scheme for Solving Volume Integral Equations on Nonlinear Scatterers

KAUST Repository

Bagci, Hakan

2015-01-01

Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are oftentimes solved using marchingon-in-time (MOT) schemes. Unlike finite difference and finite element schemes, MOT-TDVIE solvers require discretization of only the scatterers, do not call for artificial absorbing boundary conditions, and are more robust to numerical phase dispersion. On the other hand, their computational cost is high, they suffer from late-time instabilities, and their implicit nature makes incorporation of nonlinear constitutive relations more difficult. Development of plane-wave time-domain (PWTD) and FFT-based schemes has significantly reduced the computational cost of the MOT-TDVIE solvers. Additionally, latetime instability problem has been alleviated for all practical purposes with the development of accurate integration schemes and specially designed temporal basis functions. Addressing the third challenge is the topic of this presentation. I will talk about an explicit MOT scheme developed for solving the TDVIE on scatterers with nonlinear material properties. The proposed scheme separately discretizes the TDVIE and the nonlinear constitutive relation between electric field intensity and flux density. The unknown field intensity and flux density are expanded using half and full Schaubert-Wilton-Glisson (SWG) basis functions in space and polynomial temporal interpolators in time. The resulting coupled system of the discretized TDVIE and constitutive relation is integrated in time using an explicit P E(CE) m scheme to yield the unknown expansion coefficients. Explicitness of time marching allows for straightforward incorporation of the nonlinearity as a function evaluation on the right hand side of the coupled system of equations. Consequently, the resulting MOT scheme does not call for a Newton-like nonlinear solver. Numerical examples, which demonstrate the applicability

Finite-difference time-domain analysis of time-resolved terahertz spectroscopy experiments

DEFF Research Database (Denmark)

Larsen, Casper; Cooke, David G.; Jepsen, Peter Uhd

2011-01-01

In this paper we report on the numerical analysis of a time-resolved terahertz (THz) spectroscopy experiment using a modified finite-difference time-domain method. Using this method, we show that ultrafast carrier dynamics can be extracted with a time resolution smaller than the duration of the T...

Hypersonic simulations using open-source CFD and DSMC solvers

Science.gov (United States)

Casseau, V.; Scanlon, T. J.; John, B.; Emerson, D. R.; Brown, R. E.

2016-11-01

Hypersonic hybrid hydrodynamic-molecular gas flow solvers are required to satisfy the two essential requirements of any high-speed reacting code, these being physical accuracy and computational efficiency. The James Weir Fluids Laboratory at the University of Strathclyde is currently developing an open-source hybrid code which will eventually reconcile the direct simulation Monte-Carlo method, making use of the OpenFOAM application called dsmcFoam, and the newly coded open-source two-temperature computational fluid dynamics solver named hy2Foam. In conjunction with employing the CVDV chemistry-vibration model in hy2Foam, novel use is made of the QK rates in a CFD solver. In this paper, further testing is performed, in particular with the CFD solver, to ensure its efficacy before considering more advanced test cases. The hy2Foam and dsmcFoam codes have shown to compare reasonably well, thus providing a useful basis for other codes to compare against.

Cafesat: A modern sat solver for scala

OpenAIRE

Blanc Régis

2013-01-01

We present CafeSat a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state of the art techniques and heuristics. It uses two watched literals for Boolean constraint propagation conict driven learning along with clause deletion a restarting strategy and the VSIDS heuristics for choosing the branching literal. CafeSat is both sound and complete. In order to achieve reasonable performance low level and hand tuned data structures a...

Simplified Eigen-structure decomposition solver for the simulation of two-phase flow systems

International Nuclear Information System (INIS)

Kumbaro, Anela

2012-01-01

This paper discusses the development of a new solver for a system of first-order non-linear differential equations that model the dynamics of compressible two-phase flow. The solver presents a lower-complexity alternative to Roe-type solvers because it only makes use of a partial Eigen-structure information while maintaining its accuracy: the outcome is hence a good complexity-tractability trade-off to consider as relevant in a large number of situations in the scope of two-phase flow numerical simulation. A number of numerical and physical benchmarks are presented to assess the solver. Comparison between the computational results from the simplified Eigen-structure decomposition solver and the conventional Roe-type solver gives insight upon the issues of accuracy, robustness and efficiency. (authors)

Using random response input in Ibrahim Time Domain

DEFF Research Database (Denmark)

Olsen, Peter; Brincker, R.

2013-01-01

In this paper the time domain technique Ibrahim Time Domain (ITD) is used to analyze random time data. ITD is known to be a technique for identification of output only systems. The traditional formulation of ITD is claimed to be limited, when identifying closely spaced modes, because....... In this article it is showed that when using the modified ITD random time data can be analyzed. The application of the technique is displayed by a case study, with simulations and experimental data....... of the technique being Single Input Multiple Output (SIMO). It has earlier been showed that when modifying ITD with Toeplitz matrix averaging. Identification of time data with closely spaced modes is improved. In the traditional formulation of ITD the time data has to be free decays or impulse response functions...

VCODE, Ordinary Differential Equation Solver for Stiff and Non-Stiff Problems

International Nuclear Information System (INIS)

Cohen, Scott D.; Hindmarsh, Alan C.

2001-01-01

1 - Description of program or function: CVODE is a package written in ANSI standard C for solving initial value problems for ordinary differential equations. It solves both stiff and non stiff systems. In the stiff case, it includes a variety of options for treating the Jacobian of the system, including dense and band matrix solvers, and a preconditioned Krylov (iterative) solver. 2 - Method of solution: Integration is by Adams or BDF (Backward Differentiation Formula) methods, at user option. Corrector iteration is by functional iteration or Newton iteration. For the solution of linear systems within Newton iteration, users can select a dense solver, a band solver, a diagonal approximation, or a preconditioned Generalized Minimal Residual (GMRES) solver. In the dense and band cases, the user can supply a Jacobian approximation or let CVODE generate it internally. In the GMRES case, the pre-conditioner is user-supplied

A distributed-memory hierarchical solver for general sparse linear systems

Energy Technology Data Exchange (ETDEWEB)

Chen, Chao [Stanford Univ., CA (United States). Inst. for Computational and Mathematical Engineering; Pouransari, Hadi [Stanford Univ., CA (United States). Dept. of Mechanical Engineering; Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Center for Computing Research; Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Center for Computing Research; Darve, Eric [Stanford Univ., CA (United States). Inst. for Computational and Mathematical Engineering and Dept. of Mechanical Engineering

2017-12-20

We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and more memory-efficient than sparse direct solvers because it exploits the low-rank structure of fill-in blocks. Depending on the accuracy of low-rank approximations, the hierarchical solver can be used either as a direct solver or as a preconditioner. The parallel algorithm is based on data decomposition and requires only local communication for updating boundary data on every processor. Moreover, the computation-to-communication ratio of the parallel algorithm is approximately the volume-to-surface-area ratio of the subdomain owned by every processor. We also provide various numerical results to demonstrate the versatility and scalability of the parallel algorithm.

Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft

Directory of Open Access Journals (Sweden)

Yuma Fukushima

2015-01-01

Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.

Parametric time-frequency domain spatial audio

CERN Document Server

Delikaris-Manias, Symeon; Politis, Archontis

2018-01-01

This book provides readers with the principles and best practices in spatial audio signal processing. It describes how sound fields and their perceptual attributes are captured and analyzed within the time-frequency domain, how essential representation parameters are coded, and how such signals are efficiently reproduced for practical applications. The book is split into four parts starting with an overview of the fundamentals. It then goes on to explain the reproduction of spatial sound before offering an examination of signal-dependent spatial filtering. The book finishes with coverage of both current and future applications and the direction that spatial audio research is heading in. Parametric Time-frequency Domain Spatial Audio focuses on applications in entertainment audio, including music, home cinema, and gaming--covering the capturing and reproduction of spatial sound as well as its generation, transduction, representation, transmission, and perception. This book will teach readers the tools needed...

CP Methods for Scheduling and Routing with Time-Dependent Task Costs

DEFF Research Database (Denmark)

Tierney, Kevin; Kelareva, Elena; Kilby, Philip

2013-01-01

a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, Constraint Programming (CP), particularly with Lazy Clause Genera- tion (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we...... compare CP and LCG against a solve-and-improve approach for two recently introduced problems in maritime logistics with time-varying action costs: the Liner Shipping Fleet Repositioning Problem (LSFRP) and the Bulk Port Cargo Throughput Optimisation Problem (BPCTOP). We present a novel CP model...... for the LSFRP, which is faster than all previous methods and outperforms a simplified automated planning model without time-varying costs. We show that a LCG solver is faster for solving the BPCTOP than a standard finite domain CP solver with a simplified model. We find that CP and LCG are effective methods...

Parallelizable approximate solvers for recursions arising in preconditioning

Energy Technology Data Exchange (ETDEWEB)

Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

1996-12-31

For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

A Linear-Elasticity Solver for Higher-Order Space-Time Mesh Deformation

Science.gov (United States)

Diosady, Laslo T.; Murman, Scott M.

2018-01-01

A linear-elasticity approach is presented for the generation of meshes appropriate for a higher-order space-time discontinuous finite-element method. The equations of linear-elasticity are discretized using a higher-order, spatially-continuous, finite-element method. Given an initial finite-element mesh, and a specified boundary displacement, we solve for the mesh displacements to obtain a higher-order curvilinear mesh. Alternatively, for moving-domain problems we use the linear-elasticity approach to solve for a temporally discontinuous mesh velocity on each time-slab and recover a continuous mesh deformation by integrating the velocity. The applicability of this methodology is presented for several benchmark test cases.

Sherlock Holmes, Master Problem Solver.

Science.gov (United States)

Ballew, Hunter

1994-01-01

Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)

Experiences with linear solvers for oil reservoir simulation problems

Energy Technology Data Exchange (ETDEWEB)

Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); Biswas, D.; Carey, G.

1996-12-31

This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.

Multiple Shooting and Time Domain Decomposition Methods

CERN Document Server

Geiger, Michael; Körkel, Stefan; Rannacher, Rolf

2015-01-01

This book offers a comprehensive collection of the most advanced numerical techniques for the efficient and effective solution of simulation and optimization problems governed by systems of time-dependent differential equations. The contributions present various approaches to time domain decomposition, focusing on multiple shooting and parareal algorithms.  The range of topics covers theoretical analysis of the methods, as well as their algorithmic formulation and guidelines for practical implementation. Selected examples show that the discussed approaches are mandatory for the solution of challenging practical problems. The practicability and efficiency of the presented methods is illustrated by several case studies from fluid dynamics, data compression, image processing and computational biology, giving rise to possible new research topics.  This volume, resulting from the workshop Multiple Shooting and Time Domain Decomposition Methods, held in Heidelberg in May 2013, will be of great interest to applied...

Shallow-water sloshing in a moving vessel with variable cross-section and wetting-drying using an extension of George's well-balanced finite volume solver

Science.gov (United States)

Alemi Ardakani, Hamid; Bridges, Thomas J.; Turner, Matthew R.

2016-06-01

A class of augmented approximate Riemann solvers due to George (2008) [12] is extended to solve the shallow-water equations in a moving vessel with variable bottom topography and variable cross-section with wetting and drying. A class of Roe-type upwind solvers for the system of balance laws is derived which respects the steady-state solutions. The numerical solutions of the new adapted augmented f-wave solvers are validated against the Roe-type solvers. The theory is extended to solve the shallow-water flows in moving vessels with arbitrary cross-section with influx-efflux boundary conditions motivated by the shallow-water sloshing in the ocean wave energy converter (WEC) proposed by Offshore Wave Energy Ltd. (OWEL) [1]. A fractional step approach is used to handle the time-dependent forcing functions. The numerical solutions are compared to an extended new Roe-type solver for the system of balance laws with a time-dependent source function. The shallow-water sloshing finite volume solver can be coupled to a Runge-Kutta integrator for the vessel motion.

Experimental validation of GADRAS's coupled neutron-photon inverse radiation transport solver

International Nuclear Information System (INIS)

Mattingly, John K.; Mitchell, Dean James; Harding, Lee T.

2010-01-01

Sandia National Laboratories has developed an inverse radiation transport solver that applies nonlinear regression to coupled neutron-photon deterministic transport models. The inverse solver uses nonlinear regression to fit a radiation transport model to gamma spectrometry and neutron multiplicity counting measurements. The subject of this paper is the experimental validation of that solver. This paper describes a series of experiments conducted with a 4.5 kg sphere of α-phase, weapons-grade plutonium. The source was measured bare and reflected by high-density polyethylene (HDPE) spherical shells with total thicknesses between 1.27 and 15.24 cm. Neutron and photon emissions from the source were measured using three instruments: a gross neutron counter, a portable neutron multiplicity counter, and a high-resolution gamma spectrometer. These measurements were used as input to the inverse radiation transport solver to evaluate the solver's ability to correctly infer the configuration of the source from its measured radiation signatures.

RELATIVISTIC MAGNETOHYDRODYNAMICS: RENORMALIZED EIGENVECTORS AND FULL WAVE DECOMPOSITION RIEMANN SOLVER

International Nuclear Information System (INIS)

Anton, Luis; MartI, Jose M; Ibanez, Jose M; Aloy, Miguel A.; Mimica, Petar; Miralles, Juan A.

2010-01-01

We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wave front in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numerical problems allows us to conclude that our solver is very robust. When compared with a family of simpler solvers that avoid the knowledge of the full characteristic structure of the equations in the computation of the numerical fluxes, our solver turns out to be less diffusive than HLL and HLLC, and comparable in accuracy to the HLLD solver. The amount of operations needed by the FWD solver makes it less efficient computationally than those of the HLL family in one-dimensional problems. However, its relative efficiency increases in multidimensional simulations.

Architecture for time or transform domain decoding of reed-solomon codes

Science.gov (United States)

Shao, Howard M. (Inventor); Truong, Trieu-Kie (Inventor); Hsu, In-Shek (Inventor); Deutsch, Leslie J. (Inventor)

1989-01-01

Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.

PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem.

Science.gov (United States)

Schmidhuber, Jürgen

2013-01-01

Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, 2011) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing

Modern EMC analysis I time-domain computational schemes

CERN Document Server

Kantartzis, Nikolaos V

2008-01-01

The objective of this two-volume book is the systematic and comprehensive description of the most competitive time-domain computational methods for the efficient modeling and accurate solution of contemporary real-world EMC problems. Intended to be self-contained, it performs a detailed presentation of all well-known algorithms, elucidating on their merits or weaknesses, and accompanies the theoretical content with a variety of applications. Outlining the present volume, the analysis covers the theory of the finite-difference time-domain, the transmission-line matrix/modeling, and the finite i

Implementation of Generalized Adjoint Equation Solver for DeCART

International Nuclear Information System (INIS)

Han, Tae Young; Cho, Jin Young; Lee, Hyun Chul; Noh, Jae Man

2013-01-01

In this paper, the generalized adjoint solver based on the generalized perturbation theory is implemented on DeCART and the verification calculations were carried out. As the results, the adjoint flux for the general response coincides with the reference solution and it is expected that the solver could produce the parameters for the sensitivity and uncertainty analysis. Recently, MUSAD (Modules of Uncertainty and Sensitivity Analysis for DeCART) was developed for the uncertainty analysis of PMR200 core and the fundamental adjoint solver was implemented into DeCART. However, the application of the code was limited to the uncertainty to the multiplication factor, k eff , because it was based on the classical perturbation theory. For the uncertainty analysis to the general response as like the power density, it is necessary to develop the analysis module based on the generalized perturbation theory and it needs the generalized adjoint solutions from DeCART. In this paper, the generalized adjoint solver is implemented on DeCART and the calculation results are compared with the results by TSUNAMI of SCALE 6.1

Multidimensional Riemann problem with self-similar internal structure - part III - a multidimensional analogue of the HLLI Riemann solver for conservative hyperbolic systems

Science.gov (United States)

Balsara, Dinshaw S.; Nkonga, Boniface

2017-10-01

Just as the quality of a one-dimensional approximate Riemann solver is improved by the inclusion of internal sub-structure, the quality of a multidimensional Riemann solver is also similarly improved. Such multidimensional Riemann problems arise when multiple states come together at the vertex of a mesh. The interaction of the resulting one-dimensional Riemann problems gives rise to a strongly-interacting state. We wish to endow this strongly-interacting state with physically-motivated sub-structure. The fastest way of endowing such sub-structure consists of making a multidimensional extension of the HLLI Riemann solver for hyperbolic conservation laws. Presenting such a multidimensional analogue of the HLLI Riemann solver with linear sub-structure for use on structured meshes is the goal of this work. The multidimensional MuSIC Riemann solver documented here is universal in the sense that it can be applied to any hyperbolic conservation law. The multidimensional Riemann solver is made to be consistent with constraints that emerge naturally from the Galerkin projection of the self-similar states within the wave model. When the full eigenstructure in both directions is used in the present Riemann solver, it becomes a complete Riemann solver in a multidimensional sense. I.e., all the intermediate waves are represented in the multidimensional wave model. The work also presents, for the very first time, an important analysis of the dissipation characteristics of multidimensional Riemann solvers. The present Riemann solver results in the most efficient implementation of a multidimensional Riemann solver with sub-structure. Because it preserves stationary linearly degenerate waves, it might also help with well-balancing. Implementation-related details are presented in pointwise fashion for the one-dimensional HLLI Riemann solver as well as the multidimensional MuSIC Riemann solver.

Advanced field-solver techniques for RC extraction of integrated circuits

CERN Document Server

Yu, Wenjian

2014-01-01

Resistance and capacitance (RC) extraction is an essential step in modeling the interconnection wires and substrate coupling effect in nanometer-technology integrated circuits (IC). The field-solver techniques for RC extraction guarantee the accuracy of modeling, and are becoming increasingly important in meeting the demand for accurate modeling and simulation of VLSI designs. Advanced Field-Solver Techniques for RC Extraction of Integrated Circuits presents a systematic introduction to, and treatment of, the key field-solver methods for RC extraction of VLSI interconnects and substrate coupling in mixed-signal ICs. Various field-solver techniques are explained in detail, with real-world examples to illustrate the advantages and disadvantages of each algorithm. This book will benefit graduate students and researchers in the field of electrical and computer engineering, as well as engineers working in the IC design and design automation industries. Dr. Wenjian Yu is an Associate Professor at the Department of ...

On the implicit density based OpenFOAM solver for turbulent compressible flows

Science.gov (United States)

Fürst, Jiří

The contribution deals with the development of coupled implicit density based solver for compressible flows in the framework of open source package OpenFOAM. However the standard distribution of OpenFOAM contains several ready-made segregated solvers for compressible flows, the performance of those solvers is rather week in the case of transonic flows. Therefore we extend the work of Shen [15] and we develop an implicit semi-coupled solver. The main flow field variables are updated using lower-upper symmetric Gauss-Seidel method (LU-SGS) whereas the turbulence model variables are updated using implicit Euler method.

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.

Science.gov (United States)

Reddy, C. J.

2000-01-01

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Integrated tokamak modelling with the fast-ion Fokker–Planck solver adapted for transient analyses

International Nuclear Information System (INIS)

Toma, M; Hamamatsu, K; Hayashi, N; Honda, M; Ide, S

2015-01-01

Integrated tokamak modelling that enables the simulation of an entire discharge period is indispensable for designing advanced tokamak plasmas. For this purpose, we extend the integrated code TOPICS to make it more suitable for transient analyses in the fast-ion part. The fast-ion Fokker–Planck solver is integrated into TOPICS at the same level as the bulk transport solver so that the time evolutions of the fast ion and the bulk plasma are consistent with each other as well as with the equilibrium magnetic field. The fast-ion solver simultaneously handles neutral beam-injected ions and alpha particles. Parallelisation of the fast-ion solver in addition to its computational lightness owing to a dimensional reduction in the phase space enables transient analyses for long periods in the order of tens of seconds. The fast-ion Fokker–Planck calculation is compared and confirmed to be in good agreement with an orbit following a Monte Carlo calculation. The integrated code is applied to ramp-up simulations for JT-60SA and ITER to confirm its capability and effectiveness in transient analyses. In the integrated simulations, the coupled evolution of the fast ions, plasma profiles, and equilibrium magnetic fields are presented. In addition, the electric acceleration effect on fast ions is shown and discussed. (paper)

Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs

Energy Technology Data Exchange (ETDEWEB)

Clark, M. A. [NVIDIA Corp., Santa Clara; Strelchenko, Alexei [Fermilab; Vaquero, Alejandro [Utah U.; Wagner, Mathias [NVIDIA Corp., Santa Clara; Weinberg, Evan [Boston U.

2017-10-26

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.

On Cafesat: A Modern SAT Solver for Scala

OpenAIRE

Blanc, Régis William

2013-01-01

We present CafeSat, a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state-of-the-art techniques and heuristics. It uses two-watched literals for Boolean constraint propagation, conflict-driven learning along with clause deletion, a restarting strategy, and the VSIDS heuristics for choosing the branching literal. CafeSat is both sound and complete. In order to achieve reasonnable performances, low level and hand-tuned data ...

Development of RBDGG Solver and Its Application to System Reliability Analysis

International Nuclear Information System (INIS)

Kim, Man Cheol

2010-01-01

For the purpose of making system reliability analysis easier and more intuitive, RBDGG (Reliability Block diagram with General Gates) methodology was introduced as an extension of the conventional reliability block diagram. The advantage of the RBDGG methodology is that the structure of a RBDGG model is very similar to the actual structure of the analyzed system, and therefore the modeling of a system for system reliability and unavailability analysis becomes very intuitive and easy. The main idea of the development of the RBDGG methodology is similar with that of the development of the RGGG (Reliability Graph with General Gates) methodology, which is an extension of a conventional reliability graph. The newly proposed methodology is now implemented into a software tool, RBDGG Solver. RBDGG Solver was developed as a WIN32 console application. RBDGG Solver receives information on the failure modes and failure probabilities of each component in the system, along with the connection structure and connection logics among the components in the system. Based on the received information, RBDGG Solver automatically generates a system reliability analysis model for the system, and then provides the analysis results. In this paper, application of RBDGG Solver to the reliability analysis of an example system, and verification of the calculation results are provided for the purpose of demonstrating how RBDGG Solver is used for system reliability analysis

Drug detection by terahertz time-domain spectroscopy

International Nuclear Information System (INIS)

Duan Ruixin; Zhu Yiming; Zhao Hongwei

2013-01-01

Due to unique spectral region, functional imaging ability, excellent penetration and safety characteristics of terahertz radiation, the terahertz technology rapidly becomes a vital method to detect and analyze drugs. In this paper, firstly, we identify the functional groups of anti-diabetic drugs by density functional theory (DFT), HIPHOP models and experimental results from terahertz time-domain spectroscopy measurements. Secondly, we identify four kinds of herbs of radix curcumae by using the support vector machine (SVM) analysis. Besides, we analyze the absorption of anhydrous and hydrous glucose, and determine the state of water in the crystalized D-glucose·H 2 O through the results of differential scanning calorimetry measurement. Finally, we summarize the advantages and disadvantages of terahertz time-domain spectroscopy method in drug detection and analyzing. (authors)

A parallel direct solver for the self-adaptive hp Finite Element Method

KAUST Repository

Paszyński, Maciej R.; Pardo, David; Torres-Verdí n, Carlos; Demkowicz, Leszek F.; Calo, Victor M.

2010-01-01

measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements

Time Domain Partitioning of Electricity Production Cost Simulations

Energy Technology Data Exchange (ETDEWEB)

Barrows, C. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Hummon, M. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Jones, W. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Hale, E. [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2014-01-01

Production cost models are often used for planning by simulating power system operations over long time horizons. The simulation of a day-ahead energy market can take several weeks to compute. Tractability improvements are often made through model simplifications, such as: reductions in transmission modeling detail, relaxation of commitment variable integrality, reductions in cost modeling detail, etc. One common simplification is to partition the simulation horizon so that weekly or monthly horizons can be simulated in parallel. However, horizon partitions are often executed with overlap periods of arbitrary and sometimes zero length. We calculate the time domain persistence of historical unit commitment decisions to inform time domain partitioning of production cost models. The results are implemented using PLEXOS production cost modeling software in an HPC environment to improve the computation time of simulations while maintaining solution integrity.

Time-domain Green's Function Method for three-dimensional nonlinear subsonic flows

Science.gov (United States)

Tseng, K.; Morino, L.

1978-01-01

The Green's Function Method for linearized 3D unsteady potential flow (embedded in the computer code SOUSSA P) is extended to include the time-domain analysis as well as the nonlinear term retained in the transonic small disturbance equation. The differential-delay equations in time, as obtained by applying the Green's Function Method (in a generalized sense) and the finite-element technique to the transonic equation, are solved directly in the time domain. Comparisons are made with both linearized frequency-domain calculations and existing nonlinear results.

Coupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver

Czech Academy of Sciences Publication Activity Database

Kůs, Pavel; Šístek, Jakub

2017-01-01

Roč. 110, August (2017), s. 34-54 ISSN 0965-9978 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : adaptive mesh refinement * parallel algorithms * domain decomposition Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016 http://www.sciencedirect.com/science/article/pii/S0965997816305737

Coupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver

Czech Academy of Sciences Publication Activity Database

Kůs, Pavel; Šístek, Jakub

2017-01-01

Roč. 110, August (2017), s. 34-54 ISSN 0965-9978 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : adaptive mesh refinement * parallel algorithms * domain decomposition Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016 http://www.sciencedirect.com/science/ article /pii/S0965997816305737

Migration of vectorized iterative solvers to distributed memory architectures

Energy Technology Data Exchange (ETDEWEB)

Pommerell, C. [AT& T Bell Labs., Murray Hill, NJ (United States); Ruehl, R. [CSCS-ETH, Manno (Switzerland)

1994-12-31

Both necessity and opportunity motivate the use of high-performance computers for iterative linear solvers. Necessity results from the size of the problems being solved-smaller problems are often better handled by direct methods. Opportunity arises from the formulation of the iterative methods in terms of simple linear algebra operations, even if this {open_quote}natural{close_quotes} parallelism is not easy to exploit in irregularly structured sparse matrices and with good preconditioners. As a result, high-performance implementations of iterative solvers have attracted a lot of interest in recent years. Most efforts are geared to vectorize or parallelize the dominating operation-structured or unstructured sparse matrix-vector multiplication, or to increase locality and parallelism by reformulating the algorithm-reducing global synchronization in inner products or local data exchange in preconditioners. Target architectures for iterative solvers currently include mostly vector supercomputers and architectures with one or few optimized (e.g., super-scalar and/or super-pipelined RISC) processors and hierarchical memory systems. More recently, parallel computers with physically distributed memory and a better price/performance ratio have been offered by vendors as a very interesting alternative to vector supercomputers. However, programming comfort on such distributed memory parallel processors (DMPPs) still lags behind. Here the authors are concerned with iterative solvers and their changing computing environment. In particular, they are considering migration from traditional vector supercomputers to DMPPs. Application requirements force one to use flexible and portable libraries. They want to extend the portability of iterative solvers rather than reimplementing everything for each new machine, or even for each new architecture.

Developing a multi-physics solver in APOLLO3 and applications to cross section homogenization

International Nuclear Information System (INIS)

Dugan, Kevin-James

2016-01-01

Multi-physics coupling is becoming of large interest in the nuclear engineering and computational science fields. The ability to obtain accurate solutions to realistic models is important to the design and licensing of novel reactor designs, especially in design basis accident situations. The physical models involved in calculating accident behavior in nuclear reactors includes: neutron transport, thermal conduction/convection, thermo-mechanics in fuel and support structure, fuel stoichiometry, among others. However, this thesis focuses on the coupling between two models, neutron transport and thermal conduction/convection.The goal of this thesis is to develop a multi-physics solver for simulating accidents in nuclear reactors. The focus is both on the simulation environment and the data treatment used in such simulations.This work discusses the development of a multi-physics framework based around the Jacobian-Free Newton-Krylov (JFNK) method. The framework includes linear and nonlinear solvers, along with interfaces to existing numerical codes that solve neutron transport and thermal hydraulics models (APOLLO3 and MCTH respectively) through the computation of residuals. a new formulation for the neutron transport residual is explored, which reduces the solution size and search space by a large factor; instead of the residual being based on the angular flux, it is based on the fission source.The question of whether using a fundamental mode distribution of the neutron flux for cross section homogenization is sufficiently accurate during fast transients is also explored. It is shown that in an infinite homogeneous medium, using homogenized cross sections produced with a fundamental mode flux differ significantly from a reference solution. The error is remedied by using an alternative weighting flux taken from a time dependent calculation; either a time-integrated flux or an asymptotic solution. The time-integrated flux comes from the multi-physics solution of the

A multi-domain spectral method for time-fractional differential equations

Science.gov (United States)

Chen, Feng; Xu, Qinwu; Hesthaven, Jan S.

2015-07-01

This paper proposes an approach for high-order time integration within a multi-domain setting for time-fractional differential equations. Since the kernel is singular or nearly singular, two main difficulties arise after the domain decomposition: how to properly account for the history/memory part and how to perform the integration accurately. To address these issues, we propose a novel hybrid approach for the numerical integration based on the combination of three-term-recurrence relations of Jacobi polynomials and high-order Gauss quadrature. The different approximations used in the hybrid approach are justified theoretically and through numerical examples. Based on this, we propose a new multi-domain spectral method for high-order accurate time integrations and study its stability properties by identifying the method as a generalized linear method. Numerical experiments confirm hp-convergence for both time-fractional differential equations and time-fractional partial differential equations.

PENBURN - A 3-D Zone-Based Depletion/Burnup Solver

International Nuclear Information System (INIS)

Manalo, Kevin; Plower, Thomas; Rowe, Mireille; Mock, Travis; Sjoden, Glenn E.

2008-01-01

PENBURN (Parallel Environment Burnup) is a general depletion/burnup solver which, when provided with zone-based reaction rates, computes time-dependent isotope concentrations for a set of actinides and fission products. Burnup analysis in PENBURN is performed with a direct Bateman-solver chain solution technique. Specifically, in tandem with PENBURN is the use of PENTRAN, a parallel multi-group anisotropic Sn code for 3-D Cartesian geometries. In PENBURN, the linear chain method is actively used to solve individual isotope chains which are then fully attributed by the burnup code to yield integrated isotope concentrations for each nuclide specified. Included with the discussion of code features, a single PWR fuel pin calculation with the burnup code is performed and detailed with a benchmark comparison to PIE (Post-Irradiation Examination) data within the SFCOMPO (Spent Fuel Composition / NEA) database, and also with burnup codes in SCALE5.1. Conclusions within the paper detail, in PENBURN, the accuracy of major actinides, flux profile behavior as a function of burnup, and criticality calculations for the PWR fuel pin model. (authors)

Time- and Frequency-domain Comparisons of the Wavepiston Wave Energy Converter

DEFF Research Database (Denmark)

Read, Robert; Bingham, Harry

Analysis of wave-energy converters is most frequently undertaken in the time-domain. This formulation allows the direct inclusion of nonlinear time-varying loads such as power take-off (PTO) reactions, mooring forces, and viscous drag. However, integrating the governing equations of motion...... forces arising from both the PTO reactions and the non-negligible viscous drag acting on the plate. Equivalent linear damping coeffcients are used to model these forces in the frequency domain, while they are included explicitly in the time domain. The main idea of this paper is to quantify...

CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. III. MULTIGROUP RADIATION HYDRODYNAMICS

International Nuclear Information System (INIS)

Zhang, W.; Almgren, A.; Bell, J.; Howell, L.; Burrows, A.; Dolence, J.

2013-01-01

We present a formulation for multigroup radiation hydrodynamics that is correct to order O(v/c) using the comoving-frame approach and the flux-limited diffusion approximation. We describe a numerical algorithm for solving the system, implemented in the compressible astrophysics code, CASTRO. CASTRO uses a Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. In our multigroup radiation solver, the system is split into three parts: one part that couples the radiation and fluid in a hyperbolic subsystem, another part that advects the radiation in frequency space, and a parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem and the frequency space advection are solved explicitly with high-order Godunov schemes, whereas the parabolic part is solved implicitly with a first-order backward Euler method. Our multigroup radiation solver works for both neutrino and photon radiation.

Application of alternating decision trees in selecting sparse linear solvers

KAUST Repository

Bhowmick, Sanjukta; Eijkhout, Victor; Freund, Yoav; Fuentes, Erika; Keyes, David E.

2010-01-01

The solution of sparse linear systems, a fundamental and resource-intensive task in scientific computing, can be approached through multiple algorithms. Using an algorithm well adapted to characteristics of the task can significantly enhance the performance, such as reducing the time required for the operation, without compromising the quality of the result. However, the best solution method can vary even across linear systems generated in course of the same PDE-based simulation, thereby making solver selection a very challenging problem. In this paper, we use a machine learning technique, Alternating Decision Trees (ADT), to select efficient solvers based on the properties of sparse linear systems and runtime-dependent features, such as the stages of simulation. We demonstrate the effectiveness of this method through empirical results over linear systems drawn from computational fluid dynamics and magnetohydrodynamics applications. The results also demonstrate that using ADT can resolve the problem of over-fitting, which occurs when limited amount of data is available. © 2010 Springer Science+Business Media LLC.

An efficient spectral crystal plasticity solver for GPU architectures

Science.gov (United States)

Malahe, Michael

2018-03-01

We present a spectral crystal plasticity (CP) solver for graphics processing unit (GPU) architectures that achieves a tenfold increase in efficiency over prior GPU solvers. The approach makes use of a database containing a spectral decomposition of CP simulations performed using a conventional iterative solver over a parameter space of crystal orientations and applied velocity gradients. The key improvements in efficiency come from reducing global memory transactions, exposing more instruction-level parallelism, reducing integer instructions and performing fast range reductions on trigonometric arguments. The scheme also makes more efficient use of memory than prior work, allowing for larger problems to be solved on a single GPU. We illustrate these improvements with a simulation of 390 million crystal grains on a consumer-grade GPU, which executes at a rate of 2.72 s per strain step.

POWERPLAY: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

Directory of Open Access Journals (Sweden)

Jürgen eSchmidhuber

2013-06-01

Full Text Available Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. The novel algorithmic framework POWERPLAY (2011 continually searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Wow-effects are achieved by continually making previously learned skills more efficient such that they require less time and space. New skills may (partially re-use previously learned skills. POWERPLAY's search orders candidate pairs of tasks and solver modifications by their conditional computational (time & space complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. The computational costs of validating new tasks need not grow with task repertoire size. POWERPLAY's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Goedel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. POWERPLAY may be viewed as a greedy but practical implementation of basic principles of creativity. A first experimental analysis can be found in separate papers [58, 56, 57].

DRK methods for time-domain oscillator simulation

NARCIS (Netherlands)

Sevat, M.F.; Houben, S.H.M.J.; Maten, ter E.J.W.; Di Bucchianico, A.; Mattheij, R.M.M.; Peletier, M.A.

2006-01-01

This paper presents a new Runge-Kutta type integration method that is well-suited for time-domain simulation of oscillators. A unique property of the new method is that its damping characteristics can be controlled by a continuous parameter.

Time-domain multiple-quantum NMR

International Nuclear Information System (INIS)

Weitekamp, D.P.

1982-11-01

The development of time-domain multiple-quantum nuclear magnetic resonance is reviewed through mid 1982 and some prospects for future development are indicated. Particular attention is given to the problem of obtaining resolved, interpretable, many-quantum spectra for anisotropic magnetically isolated systems of coupled spins. New results are presented on a number of topics including the optimization of multiple-quantum-line intensities, analysis of noise in two-dimensional spectroscopy, and the use of order-selective excitation for cross polarization between nuclear-spin species

Optimización con Solver

Directory of Open Access Journals (Sweden)

Sánchez Álvarez , I.

1998-01-01

Full Text Available La relevancia de los problemas de optimización en el mundo empresarial ha generado la introducción de herramientas de optimización cada vez más sofisticadas en las últimas versiones de las hojas de cálculo de utilización generalizada. Estas utilidades, conocidas habitualmente como «solvers», constituyen una alternativa a los programas especializados de optimización cuando no se trata de problemas de gran escala, presentado la ventaja de su facilidad de uso y de comunicación con el usuario final. Frontline Systems Inc es la empresa que desarrolla el «solver» de Excel, si bien existen asimismo versiones para Lotus y Quattro Pro con ligeras diferencias de uso. En su dirección de internet (www.frontsys.com se puede obtener información técnica sobre las diferentes versiones de dicha utilidad y diversos aspectos operativos del programa, algunos de los cuales se comentan en este trabajo.

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2018-01-01

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim

2018-02-28

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

Scalable Newton-Krylov solver for very large power flow problems

NARCIS (Netherlands)

Idema, R.; Lahaye, D.J.P.; Vuik, C.; Van der Sluis, L.

2010-01-01

The power flow problem is generally solved by the Newton-Raphson method with a sparse direct solver for the linear system of equations in each iteration. While this works fine for small power flow problems, we will show that for very large problems the direct solver is very slow and we present

Fast time- and frequency-domain finite-element methods for electromagnetic analysis

Science.gov (United States)

Lee, Woochan

Fast electromagnetic analysis in time and frequency domain is of critical importance to the design of integrated circuits (IC) and other advanced engineering products and systems. Many IC structures constitute a very large scale problem in modeling and simulation, the size of which also continuously grows with the advancement of the processing technology. This results in numerical problems beyond the reach of existing most powerful computational resources. Different from many other engineering problems, the structure of most ICs is special in the sense that its geometry is of Manhattan type and its dielectrics are layered. Hence, it is important to develop structure-aware algorithms that take advantage of the structure specialties to speed up the computation. In addition, among existing time-domain methods, explicit methods can avoid solving a matrix equation. However, their time step is traditionally restricted by the space step for ensuring the stability of a time-domain simulation. Therefore, making explicit time-domain methods unconditionally stable is important to accelerate the computation. In addition to time-domain methods, frequency-domain methods have suffered from an indefinite system that makes an iterative solution difficult to converge fast. The first contribution of this work is a fast time-domain finite-element algorithm for the analysis and design of very large-scale on-chip circuits. The structure specialty of on-chip circuits such as Manhattan geometry and layered permittivity is preserved in the proposed algorithm. As a result, the large-scale matrix solution encountered in the 3-D circuit analysis is turned into a simple scaling of the solution of a small 1-D matrix, which can be obtained in linear (optimal) complexity with negligible cost. Furthermore, the time step size is not sacrificed, and the total number of time steps to be simulated is also significantly reduced, thus achieving a total cost reduction in CPU time. The second contribution

Implementation and testing of a multivariate inverse radiation transport solver

International Nuclear Information System (INIS)

Mattingly, John; Mitchell, Dean J.

2012-01-01

Detection, identification, and characterization of special nuclear materials (SNM) all face the same basic challenge: to varying degrees, each must infer the presence, composition, and configuration of the SNM by analyzing a set of measured radiation signatures. Solutions to this problem implement inverse radiation transport methods. Given a set of measured radiation signatures, inverse radiation transport estimates properties of the source terms and transport media that are consistent with those signatures. This paper describes one implementation of a multivariate inverse radiation transport solver. The solver simultaneously analyzes gamma spectrometry and neutron multiplicity measurements to fit a one-dimensional radiation transport model with variable layer thicknesses using nonlinear regression. The solver's essential components are described, and its performance is illustrated by application to benchmark experiments conducted with plutonium metal. - Highlights: ► Inverse problems, specifically applied to identifying and characterizing radiation sources . ► Radiation transport. ► Analysis of gamma spectroscopy and neutron multiplicity counting measurements. ► Experimental testing of the inverse solver against measurements of plutonium.

MULTILOOP PI CONTROLLER FOR ACHIEVING SIMULTANEOUS TIME AND FREQUENCY DOMAIN SPECIFICATIONS

Directory of Open Access Journals (Sweden)

M. SENTHILKUMAR

2015-08-01

Full Text Available Most of the controllers in control system are designed to satisfy either time domain or frequency domain specifications. This work presents the computation of a multiloop PI controller for achieving time and frequency domain specifications simultaneously. The desired time and frequency domain measures are to be specified initially to the design. To obtain the desired value of the performance measures the graphical relationship between the PI controller and the performance criteria is given. Thus by using graphical method a set of PI controller parameters to meet the desired performance measures are obtained in an effective and simpler way. The coupled tank has become a classic design of control engineering for multivariable process. The proposed control strategy has been implemented in the same coupled tank process and validated through simulation studies.

Molecular Frame Reconstruction Using Time-Domain Photoionization Interferometry.

Science.gov (United States)

Marceau, Claude; Makhija, Varun; Platzer, Dominique; Naumov, A Yu; Corkum, P B; Stolow, Albert; Villeneuve, D M; Hockett, Paul

2017-08-25

Photoionization of molecular species is, essentially, a multipath interferometer with both experimentally controllable and intrinsic molecular characteristics. In this work, XUV photoionization of impulsively aligned molecular targets (N_{2}) is used to provide a time-domain route to "complete" photoionization experiments, in which the rotational wave packet controls the geometric part of the photoionization interferometer. The data obtained is sufficient to determine the magnitudes and phases of the ionization matrix elements for all observed channels, and to reconstruct molecular frame interferograms from lab frame measurements. In principle, this methodology provides a time-domain route to complete photoionization experiments and the molecular frame, which is generally applicable to any molecule (no prerequisites), for all energies and ionization channels.

T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2

International Nuclear Information System (INIS)

Moridis, G.; Pruess, K.; Antunez, E.

1994-03-01

Most of the computational work in the numerical simulation of fluid and heat flows in permeable media arises in the solution of large systems of linear equations. The simplest technique for solving such equations is by direct methods. However, because of large storage requirements and accumulation of roundoff errors, the application of direct solution techniques is limited, depending on matrix bandwidth, to systems of a few hundred to at most a few thousand simultaneous equations. T2CG1, a package of preconditioned conjugate gradient solvers, has been added to TOUGH2 to complement its direct solver and significantly increase the size of problems tractable on PCs. T2CG1 includes three different solvers: a Bi-Conjugate Gradient (BCG) solver, a Bi-Conjugate Gradient Squared (BCGS) solver, and a Generalized Minimum Residual (GMRES) solver. Results from six test problems with up to 30,000 equations show that T2CG1 (1) is significantly (and invariably) faster and requires far less memory than the MA28 direct solver, (2) it makes possible the solution of very large three-dimensional problems on PCs, and (3) that the BCGS solver is the fastest of the three in the tested problems. Sample problems are presented related to heat and fluid flow at Yucca Mountain and WIPP, environmental remediation by the Thermal Enhanced Vapor Extraction System, and geothermal resources

The cost of continuity: A study of the performance of isogeometric finite elements using direct solvers

KAUST Repository

Collier, Nathan

2012-03-01

We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.

The cost of continuity: A study of the performance of isogeometric finite elements using direct solvers

KAUST Repository

Collier, Nathan; Pardo, David; Dalcí n, Lisandro D.; Paszyński, Maciej R.; Calo, Victor M.

2012-01-01

We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.

Fast damage imaging using the time-reversal technique in the frequency–wavenumber domain

International Nuclear Information System (INIS)

Zhu, R; Huang, G L; Yuan, F G

2013-01-01

The time-reversal technique has been successfully used in structural health monitoring (SHM) for quantitative imaging of damage. However, the technique is very time-consuming when it is implemented in the time domain. In this paper, we study the technique in the frequency–wavenumber (f–k) domain for fast real-time imaging of multiple damage sites in plates using scattered flexural plate waves. Based on Mindlin plate theory, the time reversibility of dispersive flexural waves in an isotropic plate is theoretically investigated in the f–k domain. A fast damage imaging technique is developed by using the cross-correlation between the back-propagated scattered wavefield and the incident wavefield in the frequency domain. Numerical simulations demonstrate that the proposed technique cannot only localize multiple damage sites but also potentially identify their sizes. Moreover, the time-reversal technique in the f–k domain is about two orders of magnitude faster than the method in the time domain. Finally, experimental testing of an on-line SHM system with a sparse piezoelectric sensor array is conducted for fast multiple damage identification using the proposed technique. (paper)

Hybrid direct and iterative solvers for h refined grids with singularities

KAUST Repository

Paszyński, Maciej R.

2015-04-27

This paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to the standard algorithm performing static condensation over the entire mesh and executing the ILUPCG algorithm on top of it. The hybrid solver is applied for two or three dimensional grids automatically h refined towards point or edge singularities. The automatic refinement is based on the relative error estimations between the coarse and fine mesh solutions [2], and the optimal refinements are selected using the projection based interpolation. The computational mesh is partitioned into sub-meshes with local point and edge singularities separated. This is done by using the following greedy algorithm.

GeN-Foam: a novel OpenFOAM"® based multi-physics solver for 2D/3D transient analysis of nuclear reactors

International Nuclear Information System (INIS)

Fiorina, Carlo; Clifford, Ivor; Aufiero, Manuele; Mikityuk, Konstantin

2015-01-01

Highlights: • Development of a new multi-physics solver based on OpenFOAM"®. • Tight coupling of thermal-hydraulics, thermal-mechanics and neutronics. • Combined use of traditional RANS and porous-medium models. • Mesh for neutronics deformed according to the predicted displacement field. • Use of three unstructured meshes, adaptive time step, parallel computing. - Abstract: The FAST group at the Paul Scherrer Institut has been developing a code system for reactor analysis for many years. For transient analysis, this code system is currently based on a state-of-the-art coupled TRACE-PARCS routine. This work presents an attempt to supplement the FAST code system with a novel solver characterized by tight coupling between the different equations, parallel computing capabilities, adaptive time-stepping and more accurate treatment of some of the phenomena involved in a reactor transient. The new solver is based on OpenFOAM"®, an open-source C++ library for the solution of partial differential equations using finite-volume discretization. It couples together a multi-scale fine/coarse mesh sub-solver for thermal-hydraulics, a multi-group diffusion sub-solver for neutronics, a displacement-based sub-solver for thermal-mechanics and a finite-difference model for the temperature field in the fuel. It is targeted toward the analysis of pin-based reactors (e.g., liquid metal fast reactors or light water reactors) or homogeneous reactors (e.g., fast-spectrum molten salt reactors). This paper presents each “single-physics” sub-solver and the overall coupling strategy, using the sodium-cooled fast reactor as a test case, and essential code verification tests are described.

A Time Domain Waveform for Testing General Relativity

International Nuclear Information System (INIS)

Huwyler, Cédric; Jetzer, Philippe; Porter, Edward K

2015-01-01

Gravitational-wave parameter estimation is only as good as the theory the waveform generation models are based upon. It is therefore crucial to test General Relativity (GR) once data becomes available. Many previous works, such as studies connected with the ppE framework by Yunes and Pretorius, rely on the stationary phase approximation (SPA) to model deviations from GR in the frequency domain. As Fast Fourier Transform algorithms have become considerably faster and in order to circumvent possible problems with the SPA, we test GR with corrected time domain waveforms instead of SPA waveforms. Since a considerable amount of work has been done already in the field using SPA waveforms, we establish a connection between leading-order-corrected waveforms in time and frequency domain, concentrating on phase-only corrected terms. In a Markov Chain Monte Carlo study, whose results are preliminary and will only be available later, we will assess the ability of the eLISA detector to measure deviations from GR for signals coming from supermassive black hole inspirals using these corrected waveforms. (paper)

The Use of Sparse Direct Solver in Vector Finite Element Modeling for Calculating Two Dimensional (2-D) Magnetotelluric Responses in Transverse Electric (TE) Mode

Science.gov (United States)

Yihaa Roodhiyah, Lisa’; Tjong, Tiffany; Nurhasan; Sutarno, D.

2018-04-01

The late research, linear matrices of vector finite element in two dimensional(2-D) magnetotelluric (MT) responses modeling was solved by non-sparse direct solver in TE mode. Nevertheless, there is some weakness which have to be improved especially accuracy in the low frequency (10-3 Hz-10-5 Hz) which is not achieved yet and high cost computation in dense mesh. In this work, the solver which is used is sparse direct solver instead of non-sparse direct solverto overcome the weaknesses of solving linear matrices of vector finite element metod using non-sparse direct solver. Sparse direct solver will be advantageous in solving linear matrices of vector finite element method because of the matrix properties which is symmetrical and sparse. The validation of sparse direct solver in solving linear matrices of vector finite element has been done for a homogen half-space model and vertical contact model by analytical solution. Thevalidation result of sparse direct solver in solving linear matrices of vector finite element shows that sparse direct solver is more stable than non-sparse direct solver in computing linear problem of vector finite element method especially in low frequency. In the end, the accuracy of 2D MT responses modelling in low frequency (10-3 Hz-10-5 Hz) has been reached out under the efficient allocation memory of array and less computational time consuming.

A CFD Heterogeneous Parallel Solver Based on Collaborating CPU and GPU

Science.gov (United States)

Lai, Jianqi; Tian, Zhengyu; Li, Hua; Pan, Sha

2018-03-01

Since Graphic Processing Unit (GPU) has a strong ability of floating-point computation and memory bandwidth for data parallelism, it has been widely used in the areas of common computing such as molecular dynamics (MD), computational fluid dynamics (CFD) and so on. The emergence of compute unified device architecture (CUDA), which reduces the complexity of compiling program, brings the great opportunities to CFD. There are three different modes for parallel solution of NS equations: parallel solver based on CPU, parallel solver based on GPU and heterogeneous parallel solver based on collaborating CPU and GPU. As we can see, GPUs are relatively rich in compute capacity but poor in memory capacity and the CPUs do the opposite. We need to make full use of the GPUs and CPUs, so a CFD heterogeneous parallel solver based on collaborating CPU and GPU has been established. Three cases are presented to analyse the solver’s computational accuracy and heterogeneous parallel efficiency. The numerical results agree well with experiment results, which demonstrate that the heterogeneous parallel solver has high computational precision. The speedup on a single GPU is more than 40 for laminar flow, it decreases for turbulent flow, but it still can reach more than 20. What’s more, the speedup increases as the grid size becomes larger.

Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem; Methodes de decomposition de domaine pour la formulation mixte duale du probleme critique de la diffusion des neutrons

Energy Technology Data Exchange (ETDEWEB)

Guerin, P

2007-12-15

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

Numerical simulation of electromagnetic wave propagation using time domain meshless method

International Nuclear Information System (INIS)

Ikuno, Soichiro; Fujita, Yoshihisa; Itoh, Taku; Nakata, Susumu; Nakamura, Hiroaki; Kamitani, Atsushi

2012-01-01

The electromagnetic wave propagation in various shaped wave guide is simulated by using meshless time domain method (MTDM). Generally, Finite Differential Time Domain (FDTD) method is applied for electromagnetic wave propagation simulation. However, the numerical domain should be divided into rectangle meshes if FDTD method is applied for the simulation. On the other hand, the node disposition of MTDM can easily describe the structure of arbitrary shaped wave guide. This is the large advantage of the meshless time domain method. The results of computations show that the damping rate is stably calculated in case with R < 0.03, where R denotes a support radius of the weight function for the shape function. And the results indicate that the support radius R of the weight functions should be selected small, and monomials must be used for calculating the shape functions. (author)

Methodology for time-domain estimation of storm time geoelectric fields using the 3-D magnetotelluric response tensors

Science.gov (United States)

Kelbert, Anna; Balch, Christopher C.; Pulkkinen, Antti; Egbert, Gary D.; Love, Jeffrey J.; Rigler, E. Joshua; Fujii, Ikuko

2017-07-01

Geoelectric fields at the Earth's surface caused by magnetic storms constitute a hazard to the operation of electric power grids and related infrastructure. The ability to estimate these geoelectric fields in close to real time and provide local predictions would better equip the industry to mitigate negative impacts on their operations. Here we report progress toward this goal: development of robust algorithms that convolve a magnetic storm time series with a frequency domain impedance for a realistic three-dimensional (3-D) Earth, to estimate the local, storm time geoelectric field. Both frequency domain and time domain approaches are presented and validated against storm time geoelectric field data measured in Japan. The methods are then compared in the context of a real-time application.

Quantum-corrected transient analysis of plasmonic nanostructures

KAUST Repository

Uysal, Ismail Enes

2017-03-08

A time domain surface integral equation (TD-SIE) solver is developed for quantum-corrected analysis of transient electromagnetic field interactions on plasmonic nanostructures with sub-nanometer gaps. “Quantum correction” introduces an auxiliary tunnel to support the current path that is generated by electrons tunneled between the nanostructures. The permittivity of the auxiliary tunnel and the nanostructures is obtained from density functional theory (DFT) computations. Electromagnetic field interactions on the combined structure (nanostructures plus auxiliary tunnel connecting them) are computed using a TD-SIE solver. Time domain samples of the permittivity and the Green function required by this solver are obtained from their frequency domain samples (generated from DFT computations) using a semi-analytical method. Accuracy and applicability of the resulting quantum-corrected solver scheme are demonstrated via numerical examples.

Aleph Field Solver Challenge Problem Results Summary

Energy Technology Data Exchange (ETDEWEB)

Hooper, Russell [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Moore, Stan Gerald [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-01-01

Aleph models continuum electrostatic and steady and transient thermal fields using a finite-element method. Much work has gone into expanding the core solver capability to support enriched modeling consisting of multiple interacting fields, special boundary conditions and two-way interfacial coupling with particles modeled using Aleph's complementary particle-in-cell capability. This report provides quantitative evidence for correct implementation of Aleph's field solver via order- of-convergence assessments on a collection of problems of increasing complexity. It is intended to provide Aleph with a pedigree and to establish a basis for confidence in results for more challenging problems important to Sandia's mission that Aleph was specifically designed to address.

High performance simplex solver

OpenAIRE

Huangfu, Qi

2013-01-01

The dual simplex method is frequently the most efficient technique for solving linear programming (LP) problems. This thesis describes an efficient implementation of the sequential dual simplex method and the design and development of two parallel dual simplex solvers. In serial, many advanced techniques for the (dual) simplex method are implemented, including sparse LU factorization, hyper-sparse linear system solution technique, efficient approaches to updating LU factors and...

NITSOL: A Newton iterative solver for nonlinear systems

Energy Technology Data Exchange (ETDEWEB)

Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)

1996-12-31

Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.

Reduced order for nuclear reactor model in frequency and time domain

International Nuclear Information System (INIS)

Nugroho, D.H.

1997-01-01

In control system theory, a model can be represented by frequency or time domain. In frequency domain, the model was represented by transfer function. in time domain, the model was represented by state space. for the sake of simplification in computation, it is necessary to reduce the model order. the main aim of this research is to find the best in nuclear reactor model. Model order reduction in frequency domain can be done utilizing pole-zero cancellation method; while in time domain utilizing balanced aggregation method the balanced aggregation method was developed by moore (1981). In this paper, the two kinds of method were applied to reduce a nuclear reactor model which was constructed by neutron dynamics and heat transfer equations. to validate that the model characteristics were not change when model order reduction applied, the response was utilized for full and reduced order. it was shown that the nuclear reactor order model can be reduced from order 8 to 2 order 2 is the best order for nuclear reactor model

Time domain optical spectrometry with fiber optic waveguides

International Nuclear Information System (INIS)

Whitten, W.B.

1983-01-01

Spectrometers which use optical fibers to obtain time domain spectral dispersion are reviewed. Pulse transmission through fiber optic waveguides is discussed and the basic requirements for sources and detectors are given. Multiplex spectrometry and time-of-flight spectrometry are then discussed. Resolution, fiber requirements, instrumentation and specific spectrometers are presented

Time-domain representation of frequency-dependent foundation impedance functions

Science.gov (United States)

Safak, E.

2006-01-01

Foundation impedance functions provide a simple means to account for soil-structure interaction (SSI) when studying seismic response of structures. Impedance functions represent the dynamic stiffness of the soil media surrounding the foundation. The fact that impedance functions are frequency dependent makes it difficult to incorporate SSI in standard time-history analysis software. This paper introduces a simple method to convert frequency-dependent impedance functions into time-domain filters. The method is based on the least-squares approximation of impedance functions by ratios of two complex polynomials. Such ratios are equivalent, in the time-domain, to discrete-time recursive filters, which are simple finite-difference equations giving the relationship between foundation forces and displacements. These filters can easily be incorporated into standard time-history analysis programs. Three examples are presented to show the applications of the method.

Towards Green Multi-frontal Solver for Adaptive Finite Element Method

KAUST Repository

AbbouEisha, H.

2015-06-01

In this paper we present the optimization of the energy consumption for the multi-frontal solver algorithm executed over two dimensional grids with point singularities. The multi-frontal solver algorithm is controlled by so-called elimination tree, defining the order of elimination of rows from particular frontal matrices, as well as order of memory transfers for Schur complement matrices. For a given mesh there are many possible elimination trees resulting in different number of floating point operations (FLOPs) of the solver or different amount of data trans- ferred via memory transfers. In this paper we utilize the dynamic programming optimization procedure and we compare elimination trees optimized with respect to FLOPs with elimination trees optimized with respect to energy consumption.

Towards Green Multi-frontal Solver for Adaptive Finite Element Method

KAUST Repository

AbbouEisha, H.; Moshkov, Mikhail; Jopek, K.; Gepner, P.; Kitowski, J.; Paszyn'ski, M.

2015-01-01

In this paper we present the optimization of the energy consumption for the multi-frontal solver algorithm executed over two dimensional grids with point singularities. The multi-frontal solver algorithm is controlled by so-called elimination tree, defining the order of elimination of rows from particular frontal matrices, as well as order of memory transfers for Schur complement matrices. For a given mesh there are many possible elimination trees resulting in different number of floating point operations (FLOPs) of the solver or different amount of data trans- ferred via memory transfers. In this paper we utilize the dynamic programming optimization procedure and we compare elimination trees optimized with respect to FLOPs with elimination trees optimized with respect to energy consumption.

An immersed interface vortex particle-mesh solver

Science.gov (United States)

Marichal, Yves; Chatelain, Philippe; Winckelmans, Gregoire

2014-11-01

An immersed interface-enabled vortex particle-mesh (VPM) solver is presented for the simulation of 2-D incompressible viscous flows, in the framework of external aerodynamics. Considering the simulation of free vortical flows, such as wakes and jets, vortex particle-mesh methods already provide a valuable alternative to standard CFD methods, thanks to the interesting numerical properties arising from its Lagrangian nature. Yet, accounting for solid bodies remains challenging, despite the extensive research efforts that have been made for several decades. The present immersed interface approach aims at improving the consistency and the accuracy of one very common technique (based on Lighthill's model) for the enforcement of the no-slip condition at the wall in vortex methods. Targeting a sharp treatment of the wall calls for substantial modifications at all computational levels of the VPM solver. More specifically, the solution of the underlying Poisson equation, the computation of the diffusion term and the particle-mesh interpolation are adapted accordingly and the spatial accuracy is assessed. The immersed interface VPM solver is subsequently validated on the simulation of some challenging impulsively started flows, such as the flow past a cylinder and that past an airfoil. Research Fellow (PhD student) of the F.R.S.-FNRS of Belgium.

Direct solvers performance on h-adapted grids

KAUST Repository

Paszynski, Maciej; Pardo, David; Calo, Victor M.

2015-01-01

We analyse the performance of direct solvers when applied to a system of linear equations arising from an hh-adapted, C0C0 finite element space. Theoretical estimates are derived for typical hh-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of hh-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones.

Direct solvers performance on h-adapted grids

KAUST Repository

Paszynski, Maciej

2015-05-27

We analyse the performance of direct solvers when applied to a system of linear equations arising from an hh-adapted, C0C0 finite element space. Theoretical estimates are derived for typical hh-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of hh-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones.

Real-time all-optical OFDM transmission system based on time-domain optical fourier transformation

DEFF Research Database (Denmark)

Guan, Pengyu; Kong, Deming; Røge, Kasper Meldgaard

2014-01-01

We propose a novel simple all-optical OFDM transmission system based on time-domain OFT using time-lenses. A real-time 160 Gbit/s DPSK OFDM transmission with 16 decorrelated data subcarriers is successfully demonstrated over 100 km....

Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem

International Nuclear Information System (INIS)

Guerin, P.

2007-12-01

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

Microprocessor-controlled time domain reflectometer for dynamic shock position measurements

International Nuclear Information System (INIS)

Virchow, C.F.; Conrad, G.E.; Holt, D.M.; Hodson, E.K.

1980-01-01

Time-domain reflectometry is used in a novel way to measure dynamically shock propagation in various media. The primary component in this measurement system is a digital time domain reflectometer, which uses local intelligence, a Motorola 6800 microprocessor, to make the unit adaptable and versatile. The recorder, its operating theory and its method of implementation are described and typical data are reviewed. Applications include nuclear explosion yield estimates and explosive energy flow measurements

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments

International Nuclear Information System (INIS)

Fisicaro, G.; Goedecker, S.; Genovese, L.; Andreussi, O.; Marzari, N.

2016-01-01

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments.

Science.gov (United States)

Fisicaro, G; Genovese, L; Andreussi, O; Marzari, N; Goedecker, S

2016-01-07

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments

Energy Technology Data Exchange (ETDEWEB)

Fisicaro, G., E-mail: giuseppe.fisicaro@unibas.ch; Goedecker, S. [Department of Physics, University of Basel, Klingelbergstrasse 82, 4056 Basel (Switzerland); Genovese, L. [University of Grenoble Alpes, CEA, INAC-SP2M, L-Sim, F-38000 Grenoble (France); Andreussi, O. [Institute of Computational Science, Università della Svizzera Italiana, Via Giuseppe Buffi 13, CH-6904 Lugano (Switzerland); Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland); Marzari, N. [Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland)

2016-01-07

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.

Analysis of noise in energy-dispersive spectrometers using time-domain methods

CERN Document Server

Goulding, F S

2002-01-01

This paper presents an integrated time domain approach to the optimization of the signal-to-noise ratio in all spectrometer systems that contain a detector that converts incoming quanta of radiation into electrical pulse signals that are amplified and shaped by an electronic pulse shaper. It allows analysis of normal passive pulse shapers as well as time-variant systems where switching of shaping elements occurs in synchronism with the signal. It also deals comfortably with microcalorimeters (sometimes referred to as bolometers), where noise-determining elements, such as the temperature-sensing element's resistance and temperature, change with time in the presence of a signal. As part of the purely time-domain approach, a new method of calculating the Johnson noise in resistors using only the statistics of electron motion is presented. The result is a time-domain analog of the Nyquist formula.

Positioning of aquatic animals based on time-of-arrival and random walk models using YAPS (Yet Another Positioning Solver)

DEFF Research Database (Denmark)

Baktoft, Henrik; Gjelland, Karl Øystein; Økland, Finn

2017-01-01

Aquatic positional telemetry offers vast opportunities to study in vivo behaviour of wild animals, but there is room for improvement in the data quality provided by current procedures for estimating positions. Here we present a novel positioning method called YAPS (Yet Another Positioning Solver...

Comparative study of incompressible and isothermal compressible flow solvers for cavitating flow dynamics

Energy Technology Data Exchange (ETDEWEB)

Park, Sun Ho [Korea Maritime and Ocean University, Busan (Korea, Republic of); Rhee, Shin Hyung [Seoul National University, Seoul (Korea, Republic of)

2015-08-15

Incompressible flow solvers are generally used for numerical analysis of cavitating flows, but with limitations in handling compressibility effects on vapor phase. To study compressibility effects on vapor phase and cavity interface, pressure-based incompressible and isothermal compressible flow solvers based on a cell-centered finite volume method were developed using the OpenFOAM libraries. To validate the solvers, cavitating flow around a hemispherical head-form body was simulated and validated against the experimental data. The cavity shedding behavior, length of a re-entrant jet, drag history, and the Strouhal number were compared between the two solvers. The results confirmed that computations of the cavitating flow including compressibility effects improved the reproduction of cavitation dynamics.

GeN-Foam: a novel OpenFOAM{sup ®} based multi-physics solver for 2D/3D transient analysis of nuclear reactors

Energy Technology Data Exchange (ETDEWEB)

Fiorina, Carlo, E-mail: carlo.fiorina@psi.ch [Paul Scherrer Institut, Nuclear Energy and Safety Department, Laboratory for Reactor Physics and Systems Behaviour – PSI, Villigen 5232 (Switzerland); Clifford, Ivor [Paul Scherrer Institut, Nuclear Energy and Safety Department, Laboratory for Reactor Physics and Systems Behaviour – PSI, Villigen 5232 (Switzerland); Aufiero, Manuele [LPSC-IN2P3-CNRS/UJF/Grenoble INP, 53 avenue des Martyrs, 38026 Grenoble Cedex (France); Mikityuk, Konstantin [Paul Scherrer Institut, Nuclear Energy and Safety Department, Laboratory for Reactor Physics and Systems Behaviour – PSI, Villigen 5232 (Switzerland)

2015-12-01

Highlights: • Development of a new multi-physics solver based on OpenFOAM{sup ®}. • Tight coupling of thermal-hydraulics, thermal-mechanics and neutronics. • Combined use of traditional RANS and porous-medium models. • Mesh for neutronics deformed according to the predicted displacement field. • Use of three unstructured meshes, adaptive time step, parallel computing. - Abstract: The FAST group at the Paul Scherrer Institut has been developing a code system for reactor analysis for many years. For transient analysis, this code system is currently based on a state-of-the-art coupled TRACE-PARCS routine. This work presents an attempt to supplement the FAST code system with a novel solver characterized by tight coupling between the different equations, parallel computing capabilities, adaptive time-stepping and more accurate treatment of some of the phenomena involved in a reactor transient. The new solver is based on OpenFOAM{sup ®}, an open-source C++ library for the solution of partial differential equations using finite-volume discretization. It couples together a multi-scale fine/coarse mesh sub-solver for thermal-hydraulics, a multi-group diffusion sub-solver for neutronics, a displacement-based sub-solver for thermal-mechanics and a finite-difference model for the temperature field in the fuel. It is targeted toward the analysis of pin-based reactors (e.g., liquid metal fast reactors or light water reactors) or homogeneous reactors (e.g., fast-spectrum molten salt reactors). This paper presents each “single-physics” sub-solver and the overall coupling strategy, using the sodium-cooled fast reactor as a test case, and essential code verification tests are described.

Riemann solvers and undercompressive shocks of convex FPU chains

International Nuclear Information System (INIS)

Herrmann, Michael; Rademacher, Jens D M

2010-01-01

We consider FPU-type atomic chains with general convex potentials. The naive continuum limit in the hyperbolic space–time scaling is the p-system of mass and momentum conservation. We systematically compare Riemann solutions to the p-system with numerical solutions to discrete Riemann problems in FPU chains, and argue that the latter can be described by modified p-system Riemann solvers. We allow the flux to have a turning point, and observe a third type of elementary wave (conservative shocks) in the atomistic simulations. These waves are heteroclinic travelling waves and correspond to non-classical, undercompressive shocks of the p-system. We analyse such shocks for fluxes with one or more turning points. Depending on the convexity properties of the flux we propose FPU-Riemann solvers. Our numerical simulations confirm that Lax shocks are replaced by so-called dispersive shocks. For convex–concave flux we provide numerical evidence that convex FPU chains follow the p-system in generating conservative shocks that are supersonic. For concave–convex flux, however, the conservative shocks of the p-system are subsonic and do not appear in FPU-Riemann solutions

A Python interface to Diffpack-based classes and solvers

OpenAIRE

Munthe-Kaas, Heidi Vikki

2013-01-01

Python is a programming language that has gained a lot of popularity during the last 15 years, and as a very easy-to-learn and flexible scripting language it is very well suited for computa- tional science, both in mathematics and in physics. Diffpack is a PDE library written in C++, made for easier implementation of both smaller PDE solvers and for larger libraries of simu- lators. It contains large class hierarchies for different solvers, grids, arrays, parallel computing and almost everyth...

Grammar-Based Multi-Frontal Solver for One Dimensional Isogeometric Analysis with Multiple Right-Hand-Sides

KAUST Repository

Kuźnik, Krzysztof; Paszyński, Maciej; Calo, Victor M.

2013-01-01

on NVIDIA CUDA GPU, delivering logarithmic execution time for linear, quadratic, cubic and higher order B-splines. Thus, the CUDA implementation delivers the optimal performance predicted by our graph grammar analysis. We utilize the solver for multiple

The value of continuity: Refined isogeometric analysis and fast direct solvers

KAUST Repository

Garcia, Daniel

2016-08-26

We propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce . C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method

The value of continuity: Refined isogeometric analysis and fast direct solvers

KAUST Repository

Garcia, Daniel; Pardo, David; Dalcin, Lisandro; Paszyński, Maciej; Collier, Nathan; Calo, Victor M.

2016-01-01

We propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce . C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method

Mixed Precision Solver Scalable to 16000 MPI Processes for Lattice Quantum Chromodynamics Simulations on the Oakforest-PACS System

OpenAIRE

Boku, Taisuke; Ishikawa, Ken-Ichi; Kuramashi, Yoshinobu; Meadows, Lawrence

2017-01-01

Lattice Quantum Chromodynamics (Lattice QCD) is a quantum field theory on a finite discretized space-time box so as to numerically compute the dynamics of quarks and gluons to explore the nature of subatomic world. Solving the equation of motion of quarks (quark solver) is the most compute-intensive part of the lattice QCD simulations and is one of the legacy HPC applications. We have developed a mixed-precision quark solver for a large Intel Xeon Phi (KNL) system named "Oakforest-PACS", empl...

A Kohn–Sham equation solver based on hexahedral finite elements

International Nuclear Information System (INIS)

Fang Jun; Gao Xingyu; Zhou Aihui

2012-01-01

We design a Kohn–Sham equation solver based on hexahedral finite element discretizations. The solver integrates three schemes proposed in this paper. The first scheme arranges one a priori locally-refined hexahedral mesh with appropriate multiresolution. The second one is a modified mass-lumping procedure which accelerates the diagonalization in the self-consistent field iteration. The third one is a finite element recovery method which enhances the eigenpair approximations with small extra work. We carry out numerical tests on each scheme to investigate the validity and efficiency, and then apply them to calculate the ground state total energies of nanosystems C 60 , C 120 , and C 275 H 172 . It is shown that our solver appears to be computationally attractive for finite element applications in electronic structure study.

THz time domain spectroscopy of biomolecular conformational modes

International Nuclear Information System (INIS)

Markelz, Andrea; Whitmire, Scott; Hillebrecht, Jay; Birge, Robert

2002-01-01

We discuss the use of terahertz time domain spectroscopy for studies of conformational flexibility and conformational change in biomolecules. Protein structural dynamics are vital to biological function with protein flexibility affecting enzymatic reaction rates and sensory transduction cycling times. Conformational mode dynamics occur on the picosecond timescale and with the collective vibrational modes associated with these large scale structural motions in the 1-100 cm -1 range. We have performed THz time domain spectroscopy (TTDS) of several biomolecular systems to explore the sensitivity of TTDS to distinguish different molecular species, different mutations within a single species and different conformations of a given biomolecule. We compare the measured absorbances to normal mode calculations and find that the TTDS absorbance reflects the density of normal modes determined by molecular mechanics calculations, and is sensitive to both conformation and mutation. These early studies demonstrate some of the advantages and limitations of using TTDS for the study of biomolecules

Quantum-corrected plasmonic field analysis using a time domain PMCHWT integral equation

KAUST Repository

Uysal, Ismail E.; Ulku, H. Arda; Bagci, Hakan

2016-01-01

When two structures are within sub-nanometer distance of each other, quantum tunneling, i.e., electrons "jumping" from one structure to another, becomes relevant. Classical electromagnetic solvers do not directly account for this additional path

Structural Time Domain Identification Toolbox User's Guide

DEFF Research Database (Denmark)

Andersen, P.; Kirkegaard, Poul Henning; Brincker, Rune

This manual describes the Structural Time Domain Identification toolbox for use with MA TLAB. This version of the tool box has been developed using the PC-based MA TLAB version 4.2c, but is compatible with prior versions of MATLAB and UNIX-based versions. The routines of the toolbox are the so...

Development of a CANDU Moderator Analysis Model; Based on Coupled Solver

International Nuclear Information System (INIS)

Yoon, Churl; Park, Joo Hwan

2006-01-01

A CFD model for predicting the CANDU-6 moderator temperature has been developed for several years in KAERI, which is based on CFX-4. This analytic model(CFX4-CAMO) has some strength in the modeling of hydraulic resistance in the core region and in the treatment of heat source term in the energy equations. But the convergence difficulties and slow computing speed reveal to be the limitations of this model, because the CFX-4 code adapts a segregated solver to solve the governing equations with strong coupled-effect. Compared to CFX-4 using segregated solver, CFX-10 adapts high efficient and robust coupled-solver. Before December 2005 when CFX-10 was distributed, the previous version of CFX-10(CFX-5. series) also adapted coupled solver but didn't have any capability to apply porous media approaches correctly. In this study, the developed moderator analysis model based on CFX- 4 (CFX4-CAMO) is transformed into a new moderator analysis model based on CFX-10. The new model is examined and the results are compared to the former

Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers

KAUST Repository

Woźniak, Maciej; Kuźnik, Krzysztof M.; Paszyński, Maciej R.; Calo, Victor M.; Pardo, D.

2014-01-01

In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers

KAUST Repository

Woźniak, Maciej

2014-06-01

In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

Performance of uncertainty quantification methodologies and linear solvers in cardiovascular simulations

Science.gov (United States)

Seo, Jongmin; Schiavazzi, Daniele; Marsden, Alison

2017-11-01

Cardiovascular simulations are increasingly used in clinical decision making, surgical planning, and disease diagnostics. Patient-specific modeling and simulation typically proceeds through a pipeline from anatomic model construction using medical image data to blood flow simulation and analysis. To provide confidence intervals on simulation predictions, we use an uncertainty quantification (UQ) framework to analyze the effects of numerous uncertainties that stem from clinical data acquisition, modeling, material properties, and boundary condition selection. However, UQ poses a computational challenge requiring multiple evaluations of the Navier-Stokes equations in complex 3-D models. To achieve efficiency in UQ problems with many function evaluations, we implement and compare a range of iterative linear solver and preconditioning techniques in our flow solver. We then discuss applications to patient-specific cardiovascular simulation and how the problem/boundary condition formulation in the solver affects the selection of the most efficient linear solver. Finally, we discuss performance improvements in the context of uncertainty propagation. Support from National Institute of Health (R01 EB018302) is greatly appreciated.

A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements

KAUST Repository

Chávez, Gustavo

2017-03-17

A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.

Efficient CUDA Polynomial Preconditioned Conjugate Gradient Solver for Finite Element Computation of Elasticity Problems

Directory of Open Access Journals (Sweden)

Jianfei Zhang

2013-01-01

Full Text Available Graphics processing unit (GPU has obtained great success in scientific computations for its tremendous computational horsepower and very high memory bandwidth. This paper discusses the efficient way to implement polynomial preconditioned conjugate gradient solver for the finite element computation of elasticity on NVIDIA GPUs using compute unified device architecture (CUDA. Sliced block ELLPACK (SBELL format is introduced to store sparse matrix arising from finite element discretization of elasticity with fewer padding zeros than traditional ELLPACK-based formats. Polynomial preconditioning methods have been investigated both in convergence and running time. From the overall performance, the least-squares (L-S polynomial method is chosen as a preconditioner in PCG solver to finite element equations derived from elasticity for its best results on different example meshes. In the PCG solver, mixed precision algorithm is used not only to reduce the overall computational, storage requirements and bandwidth but to make full use of the capacity of the GPU devices. With SBELL format and mixed precision algorithm, the GPU-based L-S preconditioned CG can get a speedup of about 7–9 to CPU-implementation.

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

Science.gov (United States)

Zubair, Mohammad; Nielsen, Eric; Luitjens, Justin; Hammond, Dana

2016-01-01

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Applications of an implicit HLLC-based Godunov solver for steady state hypersonic problems

International Nuclear Information System (INIS)

Link, R.A.; Sharman, B.

2005-01-01

Over the past few years, there has been considerable activity developing research vehicles for studying hypersonic propulsion. Successful launches of the Australian Hyshot and the US Hyper-X vehicles have added a significant amount of flight test data to a field that had previously been limited to numerical simulation. A number of approaches have been proposed for hypersonics propulsion, including attached detonation wave, supersonics combustion, and shock induced combustion. Due to the high cost of developing flight hardware, CFD simulations will continue to be a key tool for investigating the feasibility of these concepts. Capturing the interactions of the vehicle body with the boundary layer and chemical reactions pushes the limits of available modelling tools and computer hardware. Explicit formulations are extremely slow in converging to a steady state; therefore, the use of implicit methods are warranted. An implicit LLC-based Godunov solver has been developed at Martec in collaboration with DRDC Valcartier to solve hypersonic problems with a minimum of CPU time and RAM storage. The solver, Chinook Implicit, is based upon the implicit formulation adopted by Batten et. al. The solver is based on a point implicit Gauss-Seidel method for unstructured grids, and includes fully implicit boundary conditions. Preliminary results for small and large scale inviscid hypersonics problems will be presented. (author)

AQUASOL: An efficient solver for the dipolar Poisson-Boltzmann-Langevin equation.

Science.gov (United States)

Koehl, Patrice; Delarue, Marc

2010-02-14

The Poisson-Boltzmann (PB) formalism is among the most popular approaches to modeling the solvation of molecules. It assumes a continuum model for water, leading to a dielectric permittivity that only depends on position in space. In contrast, the dipolar Poisson-Boltzmann-Langevin (DPBL) formalism represents the solvent as a collection of orientable dipoles with nonuniform concentration; this leads to a nonlinear permittivity function that depends both on the position and on the local electric field at that position. The differences in the assumptions underlying these two models lead to significant differences in the equations they generate. The PB equation is a second order, elliptic, nonlinear partial differential equation (PDE). Its response coefficients correspond to the dielectric permittivity and are therefore constant within each subdomain of the system considered (i.e., inside and outside of the molecules considered). While the DPBL equation is also a second order, elliptic, nonlinear PDE, its response coefficients are nonlinear functions of the electrostatic potential. Many solvers have been developed for the PB equation; to our knowledge, none of these can be directly applied to the DPBL equation. The methods they use may adapt to the difference; their implementations however are PBE specific. We adapted the PBE solver originally developed by Holst and Saied [J. Comput. Chem. 16, 337 (1995)] to the problem of solving the DPBL equation. This solver uses a truncated Newton method with a multigrid preconditioner. Numerical evidences suggest that it converges for the DPBL equation and that the convergence is superlinear. It is found however to be slow and greedy in memory requirement for problems commonly encountered in computational biology and computational chemistry. To circumvent these problems, we propose two variants, a quasi-Newton solver based on a simplified, inexact Jacobian and an iterative self-consistent solver that is based directly on the PBE

Time-resolved single-shot terahertz time-domain spectroscopy for ultrafast irreversible processes

Science.gov (United States)

Zhai, Zhao-Hui; Zhong, Sen-Cheng; Li, Jun; Zhu, Li-Guo; Meng, Kun; Li, Jiang; Liu, Qiao; Peng, Qi-Xian; Li, Ze-Ren; Zhao, Jian-Heng

2016-09-01

Pulsed terahertz spectroscopy is suitable for spectroscopic diagnostics of ultrafast events. However, the study of irreversible or single shot ultrafast events requires ability to record transient properties at multiple time delays, i.e., time resolved at single shot level, which is not available currently. Here by angular multiplexing use of femtosecond laser pulses, we developed and demonstrated a time resolved, transient terahertz time domain spectroscopy technique, where burst mode THz pulses were generated and then detected in a single shot measurement manner. The burst mode THz pulses contain 2 sub-THz pulses, and the time gap between them is adjustable up to 1 ns with picosecond accuracy, thus it can be used to probe the single shot event at two different time delays. The system can detect the sub-THz pulses at 0.1 THz-2.5 THz range with signal to noise ratio (SNR) of ˜400 and spectrum resolution of 0.05 THz. System design was described here, and optimizations of single shot measurement of THz pulses were discussed in detail. Methods to improve SNR were also discussed in detail. A system application was demonstrated where pulsed THz signals at different time delays of the ultrafast process were successfully acquired within single shot measurement. This time resolved transient terahertz time domain spectroscopy technique provides a new diagnostic tool for irreversible or single shot ultrafast events where dynamic information can be extracted at terahertz range within one-shot experiment.

Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB

Science.gov (United States)

Rose, Geoffrey K.; Nguyen, Duc T.; Newman, Brett A.

2017-01-01

Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB's Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.

Measuring time and risk preferences: Reliability, stability, domain specificity

NARCIS (Netherlands)

Wölbert, E.M.; Riedl, A.M.

2013-01-01

To accurately predict behavior economists need reliable measures of individual time preferences and attitudes toward risk and typically need to assume stability of these characteristics over time and across decision domains. We test the reliability of two choice tasks for eliciting discount rates,

The Application Strategy of Iterative Solution Methodology to Matrix Equations in Hydraulic Solver Package, SPACE

International Nuclear Information System (INIS)

Na, Y. W.; Park, C. E.; Lee, S. Y.

2009-01-01

As a part of the Ministry of Knowledge Economy (MKE) project, 'Development of safety analysis codes for nuclear power plants', KOPEC has been developing the hydraulic solver code package applicable to the safety analyses of nuclear power plants (NPP's). The matrices of the hydraulic solver are usually sparse and may be asymmetric. In the earlier stage of this project, typical direct matrix solver packages MA48 and MA28 had been tested as matrix solver for the hydraulic solver code, SPACE. The selection was based on the reasonably reliable performance experience from their former version MA18 in RELAP computer code. In the later stage of this project, the iterative methodologies have been being tested in the SPACE code. Among a few candidate iterative solution methodologies tested so far, the biconjugate gradient stabilization methodology (BICGSTAB) has shown the best performance in the applicability test and in the application to the SPACE code. Regardless of all the merits of using the direct solver packages, there are some other aspects of tackling the iterative solution methodologies. The algorithm is much simpler and easier to handle. The potential problems related to the robustness of the iterative solution methodologies have been resolved by applying pre-conditioning methods adjusted and modified as appropriate to the application in the SPACE code. The application strategy of conjugate gradient method was introduced in detail by Schewchuk, Golub and Saad in the middle of 1990's. The application of his methodology to nuclear engineering in Korea started about the same time and is still going on and there are quite a few examples of application to neutronics. Besides, Yang introduced a conjugate gradient method programmed in C++ language. The purpose of this study is to assess the performance and behavior of the iterative solution methodology compared to those of the direct solution methodology still being preferred due to its robustness and reliability. The

Integrating Problem Solvers from Analogous Markets in New Product Ideation

DEFF Research Database (Denmark)

Franke, Nikolaus; Poetz, Marion; Schreier, Martin

2014-01-01

Who provides better inputs to new product ideation tasks, problem solvers with expertise in the area for which new products are to be developed or problem solvers from “analogous” markets that are distant but share an analogous problem or need? Conventional wisdom appears to suggest that target...... market expertise is indispensable, which is why most managers searching for new ideas tend to stay within their own market context even when they do search outside their firms' boundaries. However, in a unique symmetric experiment that isolates the effect of market origin, we find evidence...... for the opposite: Although solutions provided by problem solvers from analogous markets show lower potential for immediate use, they demonstrate substantially higher levels of novelty. Also, compared to established novelty drivers, this effect appears highly relevant from a managerial perspective: we find...

PCX, Interior-Point Linear Programming Solver

International Nuclear Information System (INIS)

Czyzyk, J.

2004-01-01

1 - Description of program or function: PCX solves linear programming problems using the Mehrota predictor-corrector interior-point algorithm. PCX can be called as a subroutine or used in stand-alone mode, with data supplied from an MPS file. The software incorporates modules that can be used separately from the linear programming solver, including a pre-solve routine and data structure definitions. 2 - Methods: The Mehrota predictor-corrector method is a primal-dual interior-point method for linear programming. The starting point is determined from a modified least squares heuristic. Linear systems of equations are solved at each interior-point iteration via a sparse Cholesky algorithm native to the code. A pre-solver is incorporated in the code to eliminate inefficiencies in the user's formulation of the problem. 3 - Restriction on the complexity of the problem: There are no size limitations built into the program. The size of problem solved is limited by RAM and swap space on the user's computer

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2017-01-01

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim

2017-07-30

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators

International Nuclear Information System (INIS)

Gonzalez, Juan; Nunez, Rafael C

2009-01-01

We present LAPACKrc, a family of FPGA-based linear algebra solvers able to achieve more than 100x speedup per commodity processor on certain problems. LAPACKrc subsumes some of the LAPACK and ScaLAPACK functionalities, and it also incorporates sparse direct and iterative matrix solvers. Current LAPACKrc prototypes demonstrate between 40x-150x speedup compared against top-of-the-line hardware/software systems. A technology roadmap is in place to validate current performance of LAPACKrc in HPC applications, and to increase the computational throughput by factors of hundreds within the next few years.

Fostering Creative Problem Solvers in Higher Education

DEFF Research Database (Denmark)

Zhou, Chunfang

2016-01-01

to meet such challenges. This chapter aims to illustrate how to understand: 1) complexity as the nature of professional practice; 2) creative problem solving as the core skill in professional practice; 3) creativity as interplay between persons and their environment; 4) higher education as the context......Recent studies have emphasized issues of social emergence based on thinking of societies as complex systems. The complexity of professional practice has been recognized as the root of challenges for higher education. To foster creative problem solvers is a key response of higher education in order...... of fostering creative problem solvers; and 5) some innovative strategies such as Problem-Based Learning (PBL) and building a learning environment by Information Communication Technology (ICT) as potential strategies of creativity development. Accordingly, this chapter contributes to bridge the complexity...

On-chip Brownian relaxation measurements of magnetic nanobeads in the time domain

DEFF Research Database (Denmark)

Østerberg, Frederik Westergaard; Rizzi, Giovanni; Hansen, Mikkel Fougt

2013-01-01

the time and frequency domain methods on Brownian relaxation detection of clustering of streptavidin coated magnetic beads in the presence of different concentrations of biotin-conjugated bovine serum albumin and obtain comparable results. In the time domain, a measurement is carried out in less than 30 s...

A LAGRANGIAN GAUSS-NEWTON-KRYLOV SOLVER FOR MASS- AND INTENSITY-PRESERVING DIFFEOMORPHIC IMAGE REGISTRATION.

Science.gov (United States)

Mang, Andreas; Ruthotto, Lars

2017-01-01

We present an efficient solver for diffeomorphic image registration problems in the framework of Large Deformations Diffeomorphic Metric Mappings (LDDMM). We use an optimal control formulation, in which the velocity field of a hyperbolic PDE needs to be found such that the distance between the final state of the system (the transformed/transported template image) and the observation (the reference image) is minimized. Our solver supports both stationary and non-stationary (i.e., transient or time-dependent) velocity fields. As transformation models, we consider both the transport equation (assuming intensities are preserved during the deformation) and the continuity equation (assuming mass-preservation). We consider the reduced form of the optimal control problem and solve the resulting unconstrained optimization problem using a discretize-then-optimize approach. A key contribution is the elimination of the PDE constraint using a Lagrangian hyperbolic PDE solver. Lagrangian methods rely on the concept of characteristic curves. We approximate these curves using a fourth-order Runge-Kutta method. We also present an efficient algorithm for computing the derivatives of the final state of the system with respect to the velocity field. This allows us to use fast Gauss-Newton based methods. We present quickly converging iterative linear solvers using spectral preconditioners that render the overall optimization efficient and scalable. Our method is embedded into the image registration framework FAIR and, thus, supports the most commonly used similarity measures and regularization functionals. We demonstrate the potential of our new approach using several synthetic and real world test problems with up to 14.7 million degrees of freedom.

Improving the energy efficiency of sparse linear system solvers on multicore and manycore systems.

Science.gov (United States)

Anzt, H; Quintana-Ortí, E S

2014-06-28

While most recent breakthroughs in scientific research rely on complex simulations carried out in large-scale supercomputers, the power draft and energy spent for this purpose is increasingly becoming a limiting factor to this trend. In this paper, we provide an overview of the current status in energy-efficient scientific computing by reviewing different technologies used to monitor power draft as well as power- and energy-saving mechanisms available in commodity hardware. For the particular domain of sparse linear algebra, we analyse the energy efficiency of a broad collection of hardware architectures and investigate how algorithmic and implementation modifications can improve the energy performance of sparse linear system solvers, without negatively impacting their performance. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Multi-domain, higher order level set scheme for 3D image segmentation on the GPU

DEFF Research Database (Denmark)

Sharma, Ojaswa; Zhang, Qin; Anton, François

2010-01-01

to evaluate level set surfaces that are $C^2$ continuous, but are slow due to high computational burden. In this paper, we provide a higher order GPU based solver for fast and efficient segmentation of large volumetric images. We also extend the higher order method to multi-domain segmentation. Our streaming...

Accelerating solutions of one-dimensional unsteady PDEs with GPU-based swept time-space decomposition

Science.gov (United States)

Magee, Daniel J.; Niemeyer, Kyle E.

2018-03-01

The expedient design of precision components in aerospace and other high-tech industries requires simulations of physical phenomena often described by partial differential equations (PDEs) without exact solutions. Modern design problems require simulations with a level of resolution difficult to achieve in reasonable amounts of time-even in effectively parallelized solvers. Though the scale of the problem relative to available computing power is the greatest impediment to accelerating these applications, significant performance gains can be achieved through careful attention to the details of memory communication and access. The swept time-space decomposition rule reduces communication between sub-domains by exhausting the domain of influence before communicating boundary values. Here we present a GPU implementation of the swept rule, which modifies the algorithm for improved performance on this processing architecture by prioritizing use of private (shared) memory, avoiding interblock communication, and overwriting unnecessary values. It shows significant improvement in the execution time of finite-difference solvers for one-dimensional unsteady PDEs, producing speedups of 2 - 9 × for a range of problem sizes, respectively, compared with simple GPU versions and 7 - 300 × compared with parallel CPU versions. However, for a more sophisticated one-dimensional system of equations discretized with a second-order finite-volume scheme, the swept rule performs 1.2 - 1.9 × worse than a standard implementation for all problem sizes.

Wavelet-Based Poisson Solver for Use in Particle-in-Cell Simulations

CERN Document Server

Terzic, Balsa; Mihalcea, Daniel; Pogorelov, Ilya V

2005-01-01

We report on a successful implementation of a wavelet-based Poisson solver for use in 3D particle-in-cell simulations. One new aspect of our algorithm is its ability to treat the general (inhomogeneous) Dirichlet boundary conditions. The solver harnesses advantages afforded by the wavelet formulation, such as sparsity of operators and data sets, existence of effective preconditioners, and the ability simultaneously to remove numerical noise and further compress relevant data sets. Having tested our method as a stand-alone solver on two model problems, we merged it into IMPACT-T to obtain a fully functional serial PIC code. We present and discuss preliminary results of application of the new code to the modelling of the Fermilab/NICADD and AES/JLab photoinjectors.

Wavelet-based Poisson Solver for use in Particle-In-Cell Simulations

International Nuclear Information System (INIS)

Terzic, B.; Mihalcea, D.; Bohn, C.L.; Pogorelov, I.V.

2005-01-01

We report on a successful implementation of a wavelet based Poisson solver for use in 3D particle-in-cell (PIC) simulations. One new aspect of our algorithm is its ability to treat the general(inhomogeneous) Dirichlet boundary conditions (BCs). The solver harnesses advantages afforded by the wavelet formulation, such as sparsity of operators and data sets, existence of effective preconditioners, and the ability simultaneously to remove numerical noise and further compress relevant data sets. Having tested our method as a stand-alone solver on two model problems, we merged it into IMPACT-T to obtain a fully functional serial PIC code. We present and discuss preliminary results of application of the new code to the modeling of the Fermilab/NICADD and AES/JLab photoinjectors

DWDM-TO-OTDM Conversion by Time-Domain Optical Fourier Transformation

DEFF Research Database (Denmark)

Mulvad, Hans Christian Hansen; Hu, Hao; Galili, Michael

2011-01-01

We propose DWDM-OTDM conversion by time-domain optical Fourier transformation. Error-free conversion of a 16×10 Gbit/s 50 GHz-spacing DWDM data signal to a 160 Gbit/s OTDM signal with a 2.1 dB average penalty is demonstrated.......We propose DWDM-OTDM conversion by time-domain optical Fourier transformation. Error-free conversion of a 16×10 Gbit/s 50 GHz-spacing DWDM data signal to a 160 Gbit/s OTDM signal with a 2.1 dB average penalty is demonstrated....

Design of a Modular Monolithic Implicit Solver for Multi-Physics Applications

Science.gov (United States)

Carton De Wiart, Corentin; Diosady, Laslo T.; Garai, Anirban; Burgess, Nicholas; Blonigan, Patrick; Ekelschot, Dirk; Murman, Scott M.

2018-01-01

The design of a modular multi-physics high-order space-time finite-element framework is presented together with its extension to allow monolithic coupling of different physics. One of the main objectives of the framework is to perform efficient high- fidelity simulations of capsule/parachute systems. This problem requires simulating multiple physics including, but not limited to, the compressible Navier-Stokes equations, the dynamics of a moving body with mesh deformations and adaptation, the linear shell equations, non-re effective boundary conditions and wall modeling. The solver is based on high-order space-time - finite element methods. Continuous, discontinuous and C1-discontinuous Galerkin methods are implemented, allowing one to discretize various physical models. Tangent and adjoint sensitivity analysis are also targeted in order to conduct gradient-based optimization, error estimation, mesh adaptation, and flow control, adding another layer of complexity to the framework. The decisions made to tackle these challenges are presented. The discussion focuses first on the "single-physics" solver and later on its extension to the monolithic coupling of different physics. The implementation of different physics modules, relevant to the capsule/parachute system, are also presented. Finally, examples of coupled computations are presented, paving the way to the simulation of the full capsule/parachute system.

Identification of severe wind conditions using a Reynolds averaged Navier-Stokes solver

DEFF Research Database (Denmark)

Sørensen, Niels N.; Bechmann, Andreas; Johansen, Jeppe

2007-01-01

The present paper describes the application of a Navier-Stokes solver to predict the presence of severe flow conditions in complex terrain, capturing conditions that may be critical to the siting of wind turbines in the terrain. First it is documented that the flow solver is capable of predicting...

Time-Domain Optical Fourier Transformation for OTDM-DWDM and DWDM-OTDM Conversion

DEFF Research Database (Denmark)

Mulvad, Hans Christian Hansen; Palushani, Evarist; Galili, Michael

2011-01-01

Applications of time-domain optical Fourier transformation (OFT) in ultra-high-speed optical time-division multiplexed systems (OTDM) are reviewed, with emphasis on the recent demonstrations of OFT-based conversion between the OTDM and DWDM formats.......Applications of time-domain optical Fourier transformation (OFT) in ultra-high-speed optical time-division multiplexed systems (OTDM) are reviewed, with emphasis on the recent demonstrations of OFT-based conversion between the OTDM and DWDM formats....

Partial Fourier analysis of time-harmonic Maxwell's equations in axisymmetric domains

International Nuclear Information System (INIS)

Nkemzi, Boniface

2003-01-01

We analyze the Fourier method for treating time-harmonic Maxwell's equations in three-dimensional axisymmetric domains with non-axisymmetric data. The Fourier method reduces the three-dimensional boundary value problem to a system of decoupled two-dimensional boundary value problems on the plane meridian domain of the axisymmetric domain. The reduction process is fully described and suitable weighted spaces are introduced on the meridian domain to characterize the two-dimensional solutions. In particular, existence and uniqueness of solutions of the two-dimensional problems is proved and a priori estimates for the solutions are given. (author)

Assessment of perceptual diffuseness in the time domain

DEFF Research Database (Denmark)

Garcia, Julian Martinez-Villalba; Jeong, Cheol-Ho; Brunskog, Jonas

2017-01-01

This study proposes a numerical and experimental framework for evaluating the perceptual aspect of the diffuse field condition with intended final use in music auditoria. Multiple Impulse Responses are simulated based on the time domain Poisson process with increasing reflection density. Different...

Fast Laplace solver approach to pore-scale permeability

Science.gov (United States)

Arns, C. H.; Adler, P. M.

2018-02-01

We introduce a powerful and easily implemented method to calculate the permeability of porous media at the pore scale using an approximation based on the Poiseulle equation to calculate permeability to fluid flow with a Laplace solver. The method consists of calculating the Euclidean distance map of the fluid phase to assign local conductivities and lends itself naturally to the treatment of multiscale problems. We compare with analytical solutions as well as experimental measurements and lattice Boltzmann calculations of permeability for Fontainebleau sandstone. The solver is significantly more stable than the lattice Boltzmann approach, uses less memory, and is significantly faster. Permeabilities are in excellent agreement over a wide range of porosities.

Influence of an SN solver in a fine-mesh neutronics/thermal-hydraulics framework

International Nuclear Information System (INIS)

Jareteg, Klas; Vinai, Paolo; Demaziere, Christophe; Sasic, Srdjan

2015-01-01

In this paper a study on the influence of a neutron discrete ordinates (S N ) solver within a fine-mesh neutronic/thermal-hydraulic methodology is presented. The methodology consists of coupling a neutronic solver with a single-phase fluid solver, and it is aimed at computing the two fields on a three-dimensional (3D) sub-pin level. The cross-sections needed for the neutron transport equations are pre-generated using a Monte Carlo approach. The coupling is resolved in an iterative manner with full convergence of both fields. A conservative transfer of the full 3D information is achieved, allowing for a proper coupling between the neutronic and the thermal-hydraulic meshes on the finest calculated scales. The discrete ordinates solver is benchmarked against a Monte Carlo reference solution for a two-dimensional (2D) system. The results confirm the need of a high number of ordinates, giving a satisfactory accuracy in k eff and scalar flux profile applying S 16 for 16 energy groups. The coupled framework is used to compare the S N implementation and a solver based on the neutron diffusion approximation for a full 3D system of a quarter of a symmetric, 7x7 array in an infinite lattice setup. In this case, the impact of the discrete ordinates solver shows to be significant for the coupled system, as demonstrated in the calculations of the temperature distributions. (author)

Time domain calculation of connector loads of a very large floating structure

Science.gov (United States)

Gu, Jiayang; Wu, Jie; Qi, Enrong; Guan, Yifeng; Yuan, Yubo

2015-06-01

Loads generated after an air crash, ship collision, and other accidents may destroy very large floating structures (VLFSs) and create additional connector loads. In this study, the combined effects of ship collision and wave loads are considered to establish motion differential equations for a multi-body VLFS. A time domain calculation method is proposed to calculate the connector load of the VLFS in waves. The Longuet-Higgins model is employed to simulate the stochastic wave load. Fluid force and hydrodynamic coefficient are obtained with DNV Sesam software. The motion differential equation is calculated by applying the time domain method when the frequency domain hydrodynamic coefficient is converted into the memory function of the motion differential equation of the time domain. As a result of the combined action of wave and impact loads, high-frequency oscillation is observed in the time history curve of the connector load. At wave directions of 0° and 75°, the regularities of the time history curves of the connector loads in different directions are similar and the connector loads of C1 and C2 in the X direction are the largest. The oscillation load is observed in the connector in the Y direction at a wave direction of 75° and not at 0°. This paper presents a time domain calculation method of connector load to provide a certain reference function for the future development of Chinese VLFS

Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations

KAUST Repository

Chavez Chavez, Gustavo Ivan

2017-01-01

Numerical experiments corroborate the robustness, accuracy, and complexity claims and provide a baseline of the performance and memory footprint by comparisons with competing approaches such as the multigrid solver hypre, and the STRUMPACK implementation of the multifrontal factorization with hierarchically semi-separable matrices. The companion implementation can utilize many thousands of cores of Shaheen, KAUST's Haswell-based Cray XC-40 supercomputer, and compares favorably with other implementations of hierarchical solvers in terms of time-to-solution and memory consumption.

Simulation of compressible viscous flow in time-dependent domains

Czech Academy of Sciences Publication Activity Database

Česenek, J.; Feistauer, M.; Horáček, Jaromír; Kučera, V.; Prokopova, J.

2013-01-01

Roč. 219, č. 13 (2013), s. 7139-7150 ISSN 0096-3003 R&D Projects: GA ČR(CZ) GAP101/11/0207 Institutional support: RVO:61388998 Keywords : time dependent domain * ALE method * semi-implicit time discretization * shock indicator Subject RIV: BI - Acoustics Impact factor: 1.600, year: 2013

Incompressible SPH (ISPH) with fast Poisson solver on a GPU

Science.gov (United States)

Chow, Alex D.; Rogers, Benedict D.; Lind, Steven J.; Stansby, Peter K.

2018-05-01

This paper presents a fast incompressible SPH (ISPH) solver implemented to run entirely on a graphics processing unit (GPU) capable of simulating several millions of particles in three dimensions on a single GPU. The ISPH algorithm is implemented by converting the highly optimised open-source weakly-compressible SPH (WCSPH) code DualSPHysics to run ISPH on the GPU, combining it with the open-source linear algebra library ViennaCL for fast solutions of the pressure Poisson equation (PPE). Several challenges are addressed with this research: constructing a PPE matrix every timestep on the GPU for moving particles, optimising the limited GPU memory, and exploiting fast matrix solvers. The ISPH pressure projection algorithm is implemented as 4 separate stages, each with a particle sweep, including an algorithm for the population of the PPE matrix suitable for the GPU, and mixed precision storage methods. An accurate and robust ISPH boundary condition ideal for parallel processing is also established by adapting an existing WCSPH boundary condition for ISPH. A variety of validation cases are presented: an impulsively started plate, incompressible flow around a moving square in a box, and dambreaks (2-D and 3-D) which demonstrate the accuracy, flexibility, and speed of the methodology. Fragmentation of the free surface is shown to influence the performance of matrix preconditioners and therefore the PPE matrix solution time. The Jacobi preconditioner demonstrates robustness and reliability in the presence of fragmented flows. For a dambreak simulation, GPU speed ups demonstrate up to 10-18 times and 1.1-4.5 times compared to single-threaded and 16-threaded CPU run times respectively.

Benchmarking ICRF Full-wave Solvers for ITER

International Nuclear Information System (INIS)

Budny, R.V.; Berry, L.; Bilato, R.; Bonoli, P.; Brambilla, M.; Dumont, R.J.; Fukuyama, A.; Harvey, R.; Jaeger, E.F.; Indireshkumar, K.; Lerche, E.; McCune, D.; Phillips, C.K.; Vdovin, V.; Wright, J.

2011-01-01

Benchmarking of full-wave solvers for ICRF simulations is performed using plasma profiles and equilibria obtained from integrated self-consistent modeling predictions of four ITER plasmas. One is for a high performance baseline (5.3 T, 15 MA) DT H-mode. The others are for half-field, half-current plasmas of interest for the pre-activation phase with bulk plasma ion species being either hydrogen or He4. The predicted profiles are used by six full-wave solver groups to simulate the ICRF electromagnetic fields and heating, and by three of these groups to simulate the current-drive. Approximate agreement is achieved for the predicted heating power for the DT and He4 cases. Factor of two disagreements are found for the cases with second harmonic He3 heating in bulk H cases. Approximate agreement is achieved simulating the ICRF current drive.

Solving the Schroedinger equation using the finite difference time domain method

International Nuclear Information System (INIS)

Sudiarta, I Wayan; Geldart, D J Wallace

2007-01-01

In this paper, we solve the Schroedinger equation using the finite difference time domain (FDTD) method to determine energies and eigenfunctions. In order to apply the FDTD method, the Schroedinger equation is first transformed into a diffusion equation by the imaginary time transformation. The resulting time-domain diffusion equation is then solved numerically by the FDTD method. The theory and an algorithm are provided for the procedure. Numerical results are given for illustrative examples in one, two and three dimensions. It is shown that the FDTD method accurately determines eigenfunctions and energies of these systems

On a construction of fast direct solvers

Czech Academy of Sciences Publication Activity Database

Práger, Milan

2003-01-01

Roč. 48, č. 3 (2003), s. 225-236 ISSN 0862-7940 Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905 Keywords : Poisson equation * boundary value problem * fast direct solver Subject RIV: BA - General Mathematics

1 D Additive correction strategy for solving tow dimensional problem of heat and mas transfer in porous media with non-rectangular domain

International Nuclear Information System (INIS)

Al Mers, A.; Mimet, A.

2006-01-01

We propose a new procedure using 1 D additive correction strategy (AC), for resolution of tow dimensional problem of heat and mass transfer in field reactor of adsorption cooling machine. The reactor contains a porous medium constituted of activated carbon reacting by adsorption with ammonia. The present paper demonstrated how the new procedure of the (AC) propose here can be used, in the case of non-rectangular domain and strongly anisotropic coefficients, to improve the convergence rate of different iterative solvers currently used: Point Gauss-Seidel (GS), the line Gauss-Seidel (LGS), strongly implicit procedure (SIP) and the strongly implicit solver (SIS). Results shows that for different solvers, the performance of the additive correction strategy is efficiently improved by using the new procedure.(Author)

Managing Time-Based Conflict Across Life Domains In Nigeria: A ...

African Journals Online (AJOL)

Managing Time-Based Conflict Across Life Domains In Nigeria: A Decision Making Perspective. ... which employees in a developing country attempt to resolve time-based conflict between work, family and other activities. A decision making ...

Subjective time pressure: general or domain specific?

Science.gov (United States)

Kleiner, Sibyl

2014-09-01

Chronic time pressure has been identified as a pervasive societal problem, exacerbated by high demands of the labor market and the home. Yet time pressure has not been disaggregated and examined separately across home and work contexts, leaving many unanswered questions regarding the sources and potentially stressful consequences of time pressure. Using data collected in the United States General Social Survey waves 2002 and 2004, this study disaggregates time pressure into the domains of home and work, and asks whether considering time pressures within distinct work and home contexts reveals distinct predictors or associations with stress. Findings show that both predictors and stress associations differ across work and home pressures, revealing both methodological and theoretical implications for the study of time pressure and work and family life more generally. Copyright © 2014 Elsevier Inc. All rights reserved.

A generalized gyrokinetic Poisson solver

International Nuclear Information System (INIS)

Lin, Z.; Lee, W.W.

1995-03-01

A generalized gyrokinetic Poisson solver has been developed, which employs local operations in the configuration space to compute the polarization density response. The new technique is based on the actual physical process of gyrophase-averaging. It is useful for nonlocal simulations using general geometry equilibrium. Since it utilizes local operations rather than the global ones such as FFT, the new method is most amenable to massively parallel algorithms

Time domain optical memories using rare earth ions

International Nuclear Information System (INIS)

Sellars, M.J.; Dyke, T.; Pryde, G.J.; Manson, N.B.

1998-01-01

Full text: Rare earth doped crystals are the chosen materials for the next generation of optical memories where the process of spectral holeburning can be employed to provide an extra dimension of frequency or time to spatial dimensions and with certain rare earth ions increases of the order of 10 7 in storage capacity can be achieved over conventional optical memories. Time domain techniques are preferred over frequency domain techniques and are now well developed. In these techniques arbitrary pulse sequences are stored in the material and read out at some later time with a single read pulse using a stimulated photon echo process. Long pulse sequences will enable more data to be stored but necessitates the use of materials with long dephasing times (corresponding to narrow spectral lines) and it is this characteristic of rare earth systems that makes them the preferred material for the new time domain optical memories. The storage time can range from hours to days but in a practical device will require refreshing or re-enforcing and this puts special requirements on the stability of the laser used for storing the information. The storage process itself can also be weak and more reliable storage can be achieved by recording the data several times with the same pulse sequence. For this to be successful the laser must be at held at a constant frequency and be stable in phase over the entire duration of the pulse sequence. The procedure of reinforcing the data sequence has been proposed before and attempted without attention to the laser frequency stability. However, if the laser is not stable although some data bits will be reinforced or increased in size others will be decreased or even erased. Indeed the reliability of the memory is degraded by the introducing the rewrite process. For our work we have developed a laser with the excellent stability and able to demonstrate reproducible reinforcement of the data sequence. Thus with the rewrite sequence we are able to

Electromagnetic Field Theory in (N+1)-Space-Time : AModern Time-Domain Tensor/Array Introduction

NARCIS (Netherlands)

De Hoop, A.T.

2012-01-01

In this paper, a modern time-domain introduction is presented for electromagnetic field theory in (N+1)-spacetime. It uses a consistent tensor/array notation that accommodates the description of electromagnetic phenomena in N-dimensional space (plus time), a requirement that turns up in present-day

Time-domain analysis of frequency dependent inertial wave forces on cylinders

DEFF Research Database (Denmark)

Krenk, Steen

2013-01-01

a simple time-domain procedure for the inertial force, in which the frequency dependence is represented via a simple explicit time filter on the wave particle acceleration or velocity. The frequency dependence of the inertia coefficient is known analytically as a function of the wave......-number, and the relevant range of waves shorter than about six times the diameter typically corresponds to deep water waves. This permits a universal non-dimensional frequency representation, that is converted to rational form to provide the relevant filter equation. Simple time-domain simulations demonstrate...... the reduction of the resonant part of the response for natural structural frequencies above the dominating wave frequency....

vZ - An Optimizing SMT Solver

DEFF Research Database (Denmark)

Bjørner, Nikolaj; Dung, Phan Anh; Fleckenstein, Lars

2015-01-01

vZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. vZ provi...

GENASIS Mathematics : Object-oriented manifolds, operations, and solvers for large-scale physics simulations

Science.gov (United States)

Cardall, Christian Y.; Budiardja, Reuben D.

2018-01-01

The large-scale computer simulation of a system of physical fields governed by partial differential equations requires some means of approximating the mathematical limit of continuity. For example, conservation laws are often treated with a 'finite-volume' approach in which space is partitioned into a large number of small 'cells,' with fluxes through cell faces providing an intuitive discretization modeled on the mathematical definition of the divergence operator. Here we describe and make available Fortran 2003 classes furnishing extensible object-oriented implementations of simple meshes and the evolution of generic conserved currents thereon, along with individual 'unit test' programs and larger example problems demonstrating their use. These classes inaugurate the Mathematics division of our developing astrophysics simulation code GENASIS (Gen eral A strophysical Si mulation S ystem), which will be expanded over time to include additional meshing options, mathematical operations, solver types, and solver variations appropriate for many multiphysics applications.

Advanced validation of CFD-FDTD combined method using highly applicable solver for reentry blackout prediction

International Nuclear Information System (INIS)

Takahashi, Yusuke

2016-01-01

An analysis model of plasma flow and electromagnetic waves around a reentry vehicle for radio frequency blackout prediction during aerodynamic heating was developed in this study. The model was validated based on experimental results from the radio attenuation measurement program. The plasma flow properties, such as electron number density, in the shock layer and wake region were obtained using a newly developed unstructured grid solver that incorporated real gas effect models and could treat thermochemically non-equilibrium flow. To predict the electromagnetic waves in plasma, a frequency-dependent finite-difference time-domain method was used. Moreover, the complicated behaviour of electromagnetic waves in the plasma layer during atmospheric reentry was clarified at several altitudes. The prediction performance of the combined model was evaluated with profiles and peak values of the electron number density in the plasma layer. In addition, to validate the models, the signal losses measured during communication with the reentry vehicle were directly compared with the predicted results. Based on the study, it was suggested that the present analysis model accurately predicts the radio frequency blackout and plasma attenuation of electromagnetic waves in plasma in communication. (paper)

Advanced calculus problem solver

CERN Document Server

REA, Editors of

2012-01-01

Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of advanced calculus currently av

Electric circuits problem solver

CERN Document Server

REA, Editors of

2012-01-01

Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of electric circuits currently av

A Parallel Algebraic Multigrid Solver on Graphics Processing Units

KAUST Repository

Haase, Gundolf

2010-01-01

The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.

Time domain spectroscopy to monitor the condition of cable insulation

International Nuclear Information System (INIS)

Mopsik, F.I.; Martzloff, F.D.

1989-01-01

The use of Time Domain Spectroscopy, the measurement of dielectric constant and loss using time-domain response, the monitoring the aging of reactor cable insulation is examined. The method is presented, showing its sensitivity, accuracy and wide frequency range. The method's ability to acquire a great deal of information in a short time and its superiority to conventional single frequency data is shown. Different cable samples are examined before and after exposure to radiation and changes with exposure are clearly seen to occur. Also it is shown that a wide range of behavior can be found in different insulation systems. The requirements for performing valid measurements is presented. The need for controlled samples and correlation with other criteria for aging is discussed. 14 refs., 9 figs

Mathematical programming solver based on local search

CERN Document Server

Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain

2014-01-01

This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...

Perturbative evolution of particle orbits around Kerr black holes: time-domain calculation

Energy Technology Data Exchange (ETDEWEB)

Lopez-Aleman, Ramon [Physical Sciences Department, University of Puerto Rico-Rio Piedras, San Juan, PR 00931 (Puerto Rico); Khanna, Gaurav [Natural Science Division, Long Island University, Southampton, NY 11968 (United States); Pullin, Jorge [Department of Physics and Astronomy, Louisiana State University, 202 Nicholson Hall, Baton Rouge, LA 70803-4001 (United States)

2003-07-21

We consider the problem of the gravitational waves produced by a particle of negligible mass orbiting a Kerr black hole. We treat the Teukolsky perturbation equation in the time domain numerically as a 2 + 1 partial differential equation. We model the particle by smearing the singularities in the source term by the use of narrow Gaussian distributions. We have been able to reproduce earlier results for equatorial circular orbits that were computed using the frequency-domain formalism. The time-domain approach is however geared for a more general evolution, for instance of nearly geodesic orbits under the effects of radiation reaction.

Perturbative evolution of particle orbits around Kerr black holes: time-domain calculation

International Nuclear Information System (INIS)

Lopez-Aleman, Ramon; Khanna, Gaurav; Pullin, Jorge

2003-01-01

We consider the problem of the gravitational waves produced by a particle of negligible mass orbiting a Kerr black hole. We treat the Teukolsky perturbation equation in the time domain numerically as a 2 + 1 partial differential equation. We model the particle by smearing the singularities in the source term by the use of narrow Gaussian distributions. We have been able to reproduce earlier results for equatorial circular orbits that were computed using the frequency-domain formalism. The time-domain approach is however geared for a more general evolution, for instance of nearly geodesic orbits under the effects of radiation reaction

Memory transfer optimization for a lattice Boltzmann solver on Kepler architecture nVidia GPUs

Science.gov (United States)

Mawson, Mark J.; Revell, Alistair J.

2014-10-01

The Lattice Boltzmann method (LBM) for solving fluid flow is naturally well suited to an efficient implementation for massively parallel computing, due to the prevalence of local operations in the algorithm. This paper presents and analyses the performance of a 3D lattice Boltzmann solver, optimized for third generation nVidia GPU hardware, also known as 'Kepler'. We provide a review of previous optimization strategies and analyse data read/write times for different memory types. In LBM, the time propagation step (known as streaming), involves shifting data to adjacent locations and is central to parallel performance; here we examine three approaches which make use of different hardware options. Two of which make use of 'performance enhancing' features of the GPU; shared memory and the new shuffle instruction found in Kepler based GPUs. These are compared to a standard transfer of data which relies instead on optimized storage to increase coalesced access. It is shown that the more simple approach is most efficient; since the need for large numbers of registers per thread in LBM limits the block size and thus the efficiency of these special features is reduced. Detailed results are obtained for a D3Q19 LBM solver, which is benchmarked on nVidia K5000M and K20C GPUs. In the latter case the use of a read-only data cache is explored, and peak performance of over 1036 Million Lattice Updates Per Second (MLUPS) is achieved. The appearance of a periodic bottleneck in the solver performance is also reported, believed to be hardware related; spikes in iteration-time occur with a frequency of around 11 Hz for both GPUs, independent of the size of the problem.

A Survey of Solver-Related Geometry and Meshing Issues

Science.gov (United States)

Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris

2016-01-01

There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.

Time-domain analytic Solutions of two-wire transmission line excited by a plane-wave field

Institute of Scientific and Technical Information of China (English)

Ni Gu-Yan; Yan Li; Yuan Nai-Chang

2008-01-01

This paper reports that an analytic method is used to calculate the load responses of the two-wire transmission line excited by a plane-wave directly in the time domain.By the frequency-domain Baum-Liu-Tesche(BLT)equation,the time-domain analytic solutions are obtained and expressed in an infinite geometric series.Moreover,it is shown that there exist only finite nonzero terms in the infinite geometric series if the time variate is at a finite interval.In other word.the time-domain analytic solutions are expanded in a finite geometric series indeed if the time variate is at a finite interval.The computed results are subsequently compared with transient responses obtained by using the frequency-domain BLT equation via a fast Fourier transform,and the agreement is excellent.

Electroporation-Induced Cell Modifications Detected with THz Time-Domain Spectroscopy

Science.gov (United States)

Romeo, Stefania; Vernier, P. Thomas; Zeni, Olga

2018-04-01

Electroporation (electropermeabilization) increases the electrical conductivity of biological cell membranes and lowers transport barriers for normally impermeant materials. Molecular simulations suggest that electroporation begins with the reorganization of water and lipid head group dipoles in the phospholipid bilayer interface, driven by an externally applied electric field, and the evolution of the resulting defects into water-filled, lipid pores. The interior of the electroporated membrane thus contains water, which should provide a signature for detection of the electropermeabilized state. In this feasibility study, we use THz time-domain spectroscopy, a powerful tool for investigating biomolecular systems and their interactions with water, to detect electroporation in human cells subjected to permeabilizing pulsed electric fields (PEFs). The time-domain response of electroporated human monocytes was acquired with a commercial THz, time-domain spectrometer. For each sample, frequency spectra were calculated, and the absorption coefficient and refractive index were extracted in the frequency range between 0.2 and 1.5 THz. This analysis reveals a higher absorption of THz radiation by PEF-exposed cells, with respect to sham-exposed ones, consistent with the intrusion of water into the cell through the permeabilized membrane that is presumed to be associated with electroporation.

Mapping of landfills using time-domain spectral induced polarization data

DEFF Research Database (Denmark)

Gazoty, Aurélie; Fiandaca, Gianluca; Pedersen, Jesper Bjergsted

2012-01-01

This study uses time-domain induced polarization data for the delineation and characterization of the former landfill site at Eskelund, Denmark. With optimized acquisition parameters combined with a new inversion algorithm, we use the full content of the decay curve and retrieve spectral informat......This study uses time-domain induced polarization data for the delineation and characterization of the former landfill site at Eskelund, Denmark. With optimized acquisition parameters combined with a new inversion algorithm, we use the full content of the decay curve and retrieve spectral...... information from time-domain IP data. Thirteen IP/DC profiles were collected in the area, supplemented by el-log drilling for accurate correlation between the geophysics and the lithology. The data were inverted using a laterally constrained 1D inversion considering the full decay curves to retrieve the four......-log measurements giving in situ values, for which the Cole-Cole parameters were computed. The 3D shape of the waste body was pinpointed and well-defined. The inversion of the IP data also shows a strong correlation with the initial stage of the waste dump and its composition combining an aerial map with acquired...

Benchmarking optimization solvers for structural topology optimization

DEFF Research Database (Denmark)

Rojas Labanda, Susana; Stolpe, Mathias

2015-01-01

solvers in IPOPT and FMINCON, and the sequential quadratic programming method in SNOPT, are benchmarked on the library using performance profiles. Whenever possible the methods are applied to both the nested and the Simultaneous Analysis and Design (SAND) formulations of the problem. The performance...

Application of GPU to Multi-interfaces Advection and Reconstruction Solver (MARS)

International Nuclear Information System (INIS)

Nagatake, Taku; Takase, Kazuyuki; Kunugi, Tomoaki

2010-01-01

In the nuclear engineering fields, a high performance computer system is necessary to perform the large scale computations. Recently, a Graphics Processing Unit (GPU) has been developed as a rendering computational system in order to reduce a Central Processing Unit (CPU) load. In the graphics processing, the high performance computing is needed to render the high-quality 3D objects in some video games. Thus the GPU consists of many processing units and a wide memory bandwidth. In this study, the Multi-interfaces Advection and Reconstruction Solver (MARS) which is one of the interface volume tracking methods for multi-phase flows has been performed. The multi-phase flow computation is very important for the nuclear reactors and other engineering fields. The MARS consists of two computing parts: the interface tracking part and the fluid motion computing part. As for the interface tracking part, the performance of GPU (GTX280) was 6 times faster than that of the CPU (Dual-Xeon 5040), and in the fluid motion computing part the Poisson Solver by the GPU (GTX285) was 22 times faster than that by the CPU(Core i7). As for the Dam Breaking Problem, the result of GPU-MARS showed slightly different from the experimental result. Because the GPU-MARS was developed using the single-precision GPU, it can be considered that the round-off error might be accumulated. (author)

An unstructured finite volume solver for two phase water/vapour flows based on an elliptic oriented fractional step method

International Nuclear Information System (INIS)

Mechitoua, N.; Boucker, M.; Lavieville, J.; Pigny, S.; Serre, G.

2003-01-01

Based on experience gained at EDF and Cea, a more general and robust 3-dimensional (3D) multiphase flow solver has been being currently developed for over three years. This solver, based on an elliptic oriented fractional step approach, is able to simulate multicomponent/multiphase flows. Discretization follows a 3D full unstructured finite volume approach, with a collocated arrangement of all variables. The non linear behaviour between pressure and volume fractions and a symmetric treatment of all fields are taken into account in the iterative procedure, within the time step. It greatly enforces the realizability of volume fractions (i.e 0 < α < 1), without artificial numerical needs. Applications to widespread test cases as static sedimentation, water hammer and phase separation are shown to assess the accuracy and the robustness of the flow solver in different flow conditions, encountered in nuclear reactors pipes. (authors)

The SX Solver: A New Computer Program for Analyzing Solvent-Extraction Equilibria

International Nuclear Information System (INIS)

McNamara, B.K.; Rapko, B.M.; Lumetta, G.J.

1999-01-01

A new computer program, the SX Solver, has been developed to analyze solvent-extraction equilibria. The program operates out of Microsoft Excel and uses the built-in ''Solver'' function to minimize the sum of the square of the residuals between measured and calculated distribution coefficients. The extraction of nitric acid by tributylphosphate has been modeled to illustrate the program's use

A hybrid time-domain discontinuous galerkin-boundary integral method for electromagnetic scattering analysis

KAUST Repository

Li, Ping; Shi, Yifei; Jiang, Lijun; Bagci, Hakan

2014-01-01

A scheme hybridizing discontinuous Galerkin time-domain (DGTD) and time-domain boundary integral (TDBI) methods for accurately analyzing transient electromagnetic scattering is proposed. Radiation condition is enforced using the numerical flux on the truncation boundary. The fields required by the flux are computed using the TDBI from equivalent currents introduced on a Huygens' surface enclosing the scatterer. The hybrid DGTDBI ensures that the radiation condition is mathematically exact and the resulting computation domain is as small as possible since the truncation boundary conforms to scatterer's shape and is located very close to its surface. Locally truncated domains can also be defined around each disconnected scatterer additionally reducing the size of the overall computation domain. Numerical examples demonstrating the accuracy and versatility of the proposed method are presented. © 2014 IEEE.

A hybrid time-domain discontinuous galerkin-boundary integral method for electromagnetic scattering analysis

KAUST Repository

Li, Ping

2014-05-01

A scheme hybridizing discontinuous Galerkin time-domain (DGTD) and time-domain boundary integral (TDBI) methods for accurately analyzing transient electromagnetic scattering is proposed. Radiation condition is enforced using the numerical flux on the truncation boundary. The fields required by the flux are computed using the TDBI from equivalent currents introduced on a Huygens\\' surface enclosing the scatterer. The hybrid DGTDBI ensures that the radiation condition is mathematically exact and the resulting computation domain is as small as possible since the truncation boundary conforms to scatterer\\'s shape and is located very close to its surface. Locally truncated domains can also be defined around each disconnected scatterer additionally reducing the size of the overall computation domain. Numerical examples demonstrating the accuracy and versatility of the proposed method are presented. © 2014 IEEE.

Time-domain analytic solutions of two-wire transmission line excited by a plane-wave field

International Nuclear Information System (INIS)

Ni Guyan; Yan Li; Yuan Naichang

2008-01-01

This paper reports that an analytic method is used to calculate the load responses of the two-wire transmission line excited by a plane-wave directly in the time domain. By the frequency-domain Baum–Liu–Tesche (BLT) equation, the time-domain analytic solutions are obtained and expressed in an infinite geometric series. Moreover, it is shown that there exist only finite nonzero terms in the infinite geometric series if the time variate is at a finite interval. In other word, the time-domain analytic solutions are expanded in a finite geometric series indeed if the time variate is at a finite interval. The computed results are subsequently compared with transient responses obtained by using the frequency-domain BLT equation via a fast Fourier transform, and the agreement is excellent. (the physics of elementary particles and fields)

Impact of non-white noises in pulse amplitude measurements: a time-domain approach

International Nuclear Information System (INIS)

Pullia, A.

1998-01-01

The contribution of the 1/f-noise to the spectral line broadening in pulse amplitude measurements is derived with a time-domain analysis. The known time-domain relationships which provide the contributions of the series and parallel white noises are generalised for the case of 1/f and other typical non-white noises, by using the fractional derivative of either the system impulse response (time-invariant linear filters) or its weight function folded (time-variant linear filters). It is shown that a time-domain approach is also effective to determine the contribution of Lorentzian noises. A simple rule suitable to derive numerically the fractional derivative is given, which permits to calculate the effect of non-white noises even when the filter impulse response is not known analytically but only in sampled form. (orig.)

Acceleration of the OpenFOAM-based MHD solver using graphics processing units

International Nuclear Information System (INIS)

He, Qingyun; Chen, Hongli; Feng, Jingchao

2015-01-01

Highlights: • A 3D PISO-MHD was implemented on Kepler-class graphics processing units (GPUs) using CUDA technology. • A consistent and conservative scheme is used in the code which was validated by three basic benchmarks in a rectangular and round ducts. • Parallelized of CPU and GPU acceleration were compared relating to single core CPU in MHD problems and non-MHD problems. • Different preconditions for solving MHD solver were compared and the results showed that AMG method is better for calculations. - Abstract: The pressure-implicit with splitting of operators (PISO) magnetohydrodynamics MHD solver of the couple of Navier–Stokes equations and Maxwell equations was implemented on Kepler-class graphics processing units (GPUs) using the CUDA technology. The solver is developed on open source code OpenFOAM based on consistent and conservative scheme which is suitable for simulating MHD flow under strong magnetic field in fusion liquid metal blanket with structured or unstructured mesh. We verified the validity of the implementation on several standard cases including the benchmark I of Shercliff and Hunt's cases, benchmark II of fully developed circular pipe MHD flow cases and benchmark III of KIT experimental case. Computational performance of the GPU implementation was examined by comparing its double precision run times with those of essentially the same algorithms and meshes. The resulted showed that a GPU (GTX 770) can outperform a server-class 4-core, 8-thread CPU (Intel Core i7-4770k) by a factor of 2 at least.

Acceleration of the OpenFOAM-based MHD solver using graphics processing units

Energy Technology Data Exchange (ETDEWEB)

He, Qingyun; Chen, Hongli, E-mail: hlchen1@ustc.edu.cn; Feng, Jingchao

2015-12-15

Highlights: • A 3D PISO-MHD was implemented on Kepler-class graphics processing units (GPUs) using CUDA technology. • A consistent and conservative scheme is used in the code which was validated by three basic benchmarks in a rectangular and round ducts. • Parallelized of CPU and GPU acceleration were compared relating to single core CPU in MHD problems and non-MHD problems. • Different preconditions for solving MHD solver were compared and the results showed that AMG method is better for calculations. - Abstract: The pressure-implicit with splitting of operators (PISO) magnetohydrodynamics MHD solver of the couple of Navier–Stokes equations and Maxwell equations was implemented on Kepler-class graphics processing units (GPUs) using the CUDA technology. The solver is developed on open source code OpenFOAM based on consistent and conservative scheme which is suitable for simulating MHD flow under strong magnetic field in fusion liquid metal blanket with structured or unstructured mesh. We verified the validity of the implementation on several standard cases including the benchmark I of Shercliff and Hunt's cases, benchmark II of fully developed circular pipe MHD flow cases and benchmark III of KIT experimental case. Computational performance of the GPU implementation was examined by comparing its double precision run times with those of essentially the same algorithms and meshes. The resulted showed that a GPU (GTX 770) can outperform a server-class 4-core, 8-thread CPU (Intel Core i7-4770k) by a factor of 2 at least.

A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids

Science.gov (United States)

Prieto, Manuel; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.

Parallelization of the preconditioned IDR solver for modern multicore computer systems

Science.gov (United States)

Bessonov, O. A.; Fedoseyev, A. I.

2012-10-01

This paper present the analysis, parallelization and optimization approach for the large sparse matrix solver CNSPACK for modern multicore microprocessors. CNSPACK is an advanced solver successfully used for coupled solution of stiff problems arising in multiphysics applications such as CFD, semiconductor transport, kinetic and quantum problems. It employs iterative IDR algorithm with ILU preconditioning (user chosen ILU preconditioning order). CNSPACK has been successfully used during last decade for solving problems in several application areas, including fluid dynamics and semiconductor device simulation. However, there was a dramatic change in processor architectures and computer system organization in recent years. Due to this, performance criteria and methods have been revisited, together with involving the parallelization of the solver and preconditioner using Open MP environment. Results of the successful implementation for efficient parallelization are presented for the most advances computer system (Intel Core i7-9xx or two-processor Xeon 55xx/56xx).

Status and Perspective of the Hydraulic Solver development for SPACE code

International Nuclear Information System (INIS)

Lee, S. Y.; Oh, M. T.; Park, J. C.; Ahn, S. J.; Park, C. E.; Lee, E. J.; Na, Y. W.

2008-01-01

KOPEC has been developing a hydraulic solver for SPACE code. The governing equations for the solver can be obtained through several steps of modeling and approximations from the basic material transport principles. Once the governing equations are fixed, a proper discretization procedure should be followed to get the difference equations that can be solved by well established matrix solvers. Of course, the mesh generation and handling procedures are necessary for the discretization process. At present, the preliminary test version has been constructed and being tested. The selection of the compiler language was debated openly. C++ was chosen as a basis compiler language. But other language such as FORTRAN can be used as it is necessary. The steps mentioned above are explained in the following sections. Test results are presented by other companion papers in this meeting. Future activities will be described in the conclusion section

An investigation of time-dependent domain wall pinning effects in Tb/Fe multilayer thin flms

NARCIS (Netherlands)

Phillips, G.N.; O'grady, K.; El-Hilo, M.

2002-01-01

Reverse domain nucleation time measurements have been performed on two Tb/Fe multilayer magneto-optic films exhibiting different degrees of domain wall pinning.A linear relationship between ln (reverse domain nucleation time) and the applied field has been predicted and observed for a sample

A comparison of viscous-plastic sea ice solvers with and without replacement pressure

Science.gov (United States)

Kimmritz, Madlen; Losch, Martin; Danilov, Sergey

2017-07-01

Recent developments of the explicit elastic-viscous-plastic (EVP) solvers call for a new comparison with implicit solvers for the equations of viscous-plastic sea ice dynamics. In Arctic sea ice simulations, the modified and the adaptive EVP solvers, and the implicit Jacobian-free Newton-Krylov (JFNK) solver are compared against each other. The adaptive EVP method shows convergence rates that are generally similar or even better than those of the modified EVP method, but the convergence of the EVP methods is found to depend dramatically on the use of the replacement pressure (RP). Apparently, using the RP can affect the pseudo-elastic waves in the EVP methods by introducing extra non-physical oscillations so that, in the extreme case, convergence to the VP solution can be lost altogether. The JFNK solver also suffers from higher failure rates with RP implying that with RP the momentum equations are stiffer and more difficult to solve. For practical purposes, both EVP methods can be used efficiently with an unexpectedly low number of sub-cycling steps without compromising the solutions. The differences between the RP solutions and the NoRP solutions (when the RP is not being used) can be reduced with lower thresholds of viscous regularization at the cost of increasing stiffness of the equations, and hence the computational costs of solving them.

Multichannel Signal Enhancement using Non-Causal, Time-Domain Filters

DEFF Research Database (Denmark)

Jensen, Jesper Rindom; Christensen, Mads Græsbøll; Benesty, Jacob

2013-01-01

In the vast amount of time-domain filtering methods for speech enhancement, the filters are designed to be causal. Recently, however, it was shown that the noise reduction and signal distortion capabilities of such single-channel filters can be improved by allowing the filters to be non-causal. W......In the vast amount of time-domain filtering methods for speech enhancement, the filters are designed to be causal. Recently, however, it was shown that the noise reduction and signal distortion capabilities of such single-channel filters can be improved by allowing the filters to be non......-causal, multichannel filters for enhancement based on an orthogonal decomposition is proposed. The evaluation shows that there is a potential gain in noise reduction and signal distortion by introducing non-causality. Moreover, experiments on real-life speech show that we can improve the perceptual quality....

Advances in spectral inversion of time-domain induced polarization

DEFF Research Database (Denmark)

Fiandaca, Gianluca; Auken, Esben; Christiansen, Anders Vest

The extraction of spectral information in the inversion process of time-domain (TD) induced polarization (IP) data is changing the use of the TDIP method. Data interpretation is evolving from a qualitative description of the subsurface, able only to discriminate the presence of contrasts in charg......The extraction of spectral information in the inversion process of time-domain (TD) induced polarization (IP) data is changing the use of the TDIP method. Data interpretation is evolving from a qualitative description of the subsurface, able only to discriminate the presence of contrasts...... in chargeability parameters, towards a quantitative analysis of the investigated media, which allows for detailed soil- and rock-type characterization. In this work a review of the recent advances in spectral inversion of TDIP data is presented, in terms of: supported IP parameterizations; modelling of transmitter...

Nonlinear System Identification via Basis Functions Based Time Domain Volterra Model

Directory of Open Access Journals (Sweden)

Yazid Edwar

2014-07-01

Full Text Available This paper proposes basis functions based time domain Volterra model for nonlinear system identification. The Volterra kernels are expanded by using complex exponential basis functions and estimated via genetic algorithm (GA. The accuracy and practicability of the proposed method are then assessed experimentally from a scaled 1:100 model of a prototype truss spar platform. Identification results in time and frequency domain are presented and coherent functions are performed to check the quality of the identification results. It is shown that results between experimental data and proposed method are in good agreement.

Introduction to the Finite-Difference Time-Domain (FDTD) Method for Electromagnetics

CERN Document Server

Gedney, Stephen

2011-01-01

Introduction to the Finite-Difference Time-Domain (FDTD) Method for Electromagnetics provides a comprehensive tutorial of the most widely used method for solving Maxwell's equations -- the Finite Difference Time-Domain Method. This book is an essential guide for students, researchers, and professional engineers who want to gain a fundamental knowledge of the FDTD method. It can accompany an undergraduate or entry-level graduate course or be used for self-study. The book provides all the background required to either research or apply the FDTD method for the solution of Maxwell's equations to p

A coupled systems code-CFD MHD solver for fusion blanket design

Energy Technology Data Exchange (ETDEWEB)

Wolfendale, Michael J., E-mail: m.wolfendale11@imperial.ac.uk; Bluck, Michael J.

2015-10-15

Highlights: • A coupled systems code-CFD MHD solver for fusion blanket applications is proposed. • Development of a thermal hydraulic systems code with MHD capabilities is detailed. • A code coupling methodology based on the use of TCP socket communications is detailed. • Validation cases are briefly discussed for the systems code and coupled solver. - Abstract: The network of flow channels in a fusion blanket can be modelled using a 1D thermal hydraulic systems code. For more complex components such as junctions and manifolds, the simplifications employed in such codes can become invalid, requiring more detailed analyses. For magnetic confinement reactor blanket designs using a conducting fluid as coolant/breeder, the difficulties in flow modelling are particularly severe due to MHD effects. Blanket analysis is an ideal candidate for the application of a code coupling methodology, with a thermal hydraulic systems code modelling portions of the blanket amenable to 1D analysis, and CFD providing detail where necessary. A systems code, MHD-SYS, has been developed and validated against existing analyses. The code shows good agreement in the prediction of MHD pressure loss and the temperature profile in the fluid and wall regions of the blanket breeding zone. MHD-SYS has been coupled to an MHD solver developed in OpenFOAM and the coupled solver validated for test geometries in preparation for modelling blanket systems.

Use of direct and iterative solvers for estimation of SNP effects in genome-wide selection

Directory of Open Access Journals (Sweden)

Eduardo da Cruz Gouveia Pimentel

2010-01-01

Full Text Available The aim of this study was to compare iterative and direct solvers for estimation of marker effects in genomic selection. One iterative and two direct methods were used: Gauss-Seidel with Residual Update, Cholesky Decomposition and Gentleman-Givens rotations. For resembling different scenarios with respect to number of markers and of genotyped animals, a simulated data set divided into 25 subsets was used. Number of markers ranged from 1,200 to 5,925 and number of animals ranged from 1,200 to 5,865. Methods were also applied to real data comprising 3081 individuals genotyped for 45181 SNPs. Results from simulated data showed that the iterative solver was substantially faster than direct methods for larger numbers of markers. Use of a direct solver may allow for computing (covariances of SNP effects. When applied to real data, performance of the iterative method varied substantially, depending on the level of ill-conditioning of the coefficient matrix. From results with real data, Gentleman-Givens rotations would be the method of choice in this particular application as it provided an exact solution within a fairly reasonable time frame (less than two hours. It would indeed be the preferred method whenever computer resources allow its use.

Finite difference time domain modelling of particle accelerators

International Nuclear Information System (INIS)

Jurgens, T.G.; Harfoush, F.A.

1989-03-01

Finite Difference Time Domain (FDTD) modelling has been successfully applied to a wide variety of electromagnetic scattering and interaction problems for many years. Here the method is extended to incorporate the modelling of wake fields in particle accelerators. Algorithmic comparisons are made to existing wake field codes, such as MAFIA T3. 9 refs., 7 figs

Fast Poisson Solvers for Self-Consistent Beam-Beam and Space-Charge Field Computation in Multiparticle Tracking Simulations

CERN Document Server

Florio, Adrien; Pieloni, Tatiana; CERN. Geneva. ATS Department

2015-01-01

We present two different approaches to solve the 2-dimensional electrostatic problem with open boundary conditions to be used in fast tracking codes for beam-beam and space charge simulations in high energy accelerators. We compare a fast multipoles method with a hybrid Poisson solver based on the fast Fourier transform and finite differences in polar coordinates. We show that the latter outperforms the first in terms of execution time and precision, allowing for a reduction of the noise in the tracking simulation. Furthermore the new algorithm is shown to scale linearly on parallel architectures with shared memory. We conclude by effectively replacing the HFMM by the new Poisson solver in the COMBI code.

Time domain electromagnetic metal detectors

International Nuclear Information System (INIS)

Hoekstra, P.

1996-01-01

This presentation focuses on illustrating by case histories the range of applications and limitations of time domain electromagnetic (TDEM) systems for buried metal detection. Advantages claimed for TDEM metal detectors are: independent of instrument response (Geonics EM61) to surrounding soil and rock type; simple anomaly shape; mitigation of interference by ambient electromagnetic noise; and responsive to both ferrous and non-ferrous metallic targets. The data in all case histories to be presented were acquired with the Geonics EM61 TDEM system. Case histories are a test bed site on Molokai, Hawaii; Fort Monroe, Virginia; and USDOE, Rocky Flats Plant. The present limitations of this technology are: discrimination capabilities in terms of type of ordnance, and depth of burial is limited, and ability of resolving targets with small metallic ambient needs to be improved

Progress in parallel implementation of the multilevel plane wave time domain algorithm

KAUST Repository

Liu, Yang

2013-07-01

The computational complexity and memory requirements of classical schemes for evaluating transient electromagnetic fields produced by Ns dipoles active for Nt time steps scale as O(NtN s 2) and O(Ns 2), respectively. The multilevel plane wave time domain (PWTD) algorithm [A.A. Ergin et al., Antennas and Propagation Magazine, IEEE, vol. 41, pp. 39-52, 1999], viz. the extension of the frequency domain fast multipole method (FMM) to the time domain, reduces the above costs to O(NtNslog2Ns) and O(Ns α) with α = 1.5 for surface current distributions and α = 4/3 for volumetric ones. Its favorable computational and memory costs notwithstanding, serial implementations of the PWTD scheme unfortunately remain somewhat limited in scope and ill-suited to tackle complex real-world scattering problems, and parallel implementations are called for. © 2013 IEEE.

Scalable multi-grid preconditioning techniques for the even-parity S_N solver in UNIC

International Nuclear Information System (INIS)

Mahadevan, Vijay S.; Smith, Michael A.

2011-01-01

The Even-parity neutron transport equation with FE-S_N discretization is solved traditionally using SOR preconditioned CG method at the lowest level of iterations in order to compute the criticality in reactor analysis problems. The use of high order isoparametric finite elements prohibits the formation of the discrete operator explicitly due to memory constraints in peta scale architectures. Hence, a h-p multi-grid preconditioner based on linear tessellation of the higher order mesh is introduced here for the space-angle system and compared against SOR and Algebraic MG black-box solvers. The performance and scalability of the multi-grid scheme was determined for two test problems and found to be competitive in terms of both computational time and memory requirements. The implementation of this preconditioner in an even-parity solver like UNIC from ANL can further enable high fidelity calculations in a scalable manner on peta flop machines. (author)

Two-Dimensional Time-Domain Antenna Arrays for Optimum Steerable Energy Pattern with Low Side Lobes

Directory of Open Access Journals (Sweden)

Alberto Reyna

2014-01-01

Full Text Available This document presents the synthesis of different two-dimensional time-domain antenna arrays for steerable energy patterns with side lobe levels. The research is focused on the uniform and nonuniform distributions of true-time exciting delays and positions of antenna elements. The uniform square array, random array, uniform concentric ring array, and rotated nonuniform concentric ring array geometries are particularly studied. These geometries are synthesized by using the well-known sequential quadratic programming. The synthesis regards the optimal true-time exciting delays and optimal positions of pulsed antenna elements. The results show the capabilities of the different antenna arrays to steer the beam in their energy pattern in time domain and how their performance is in frequency domain after the synthesis in time domain.

Scalable parallel prefix solvers for discrete ordinates transport

International Nuclear Information System (INIS)

Pautz, S.; Pandya, T.; Adams, M.

2009-01-01

The well-known 'sweep' algorithm for inverting the streaming-plus-collision term in first-order deterministic radiation transport calculations has some desirable numerical properties. However, it suffers from parallel scaling issues caused by a lack of concurrency. The maximum degree of concurrency, and thus the maximum parallelism, grows more slowly than the problem size for sweeps-based solvers. We investigate a new class of parallel algorithms that involves recasting the streaming-plus-collision problem in prefix form and solving via cyclic reduction. This method, although computationally more expensive at low levels of parallelism than the sweep algorithm, offers better theoretical scalability properties. Previous work has demonstrated this approach for one-dimensional calculations; we show how to extend it to multidimensional calculations. Notably, for multiple dimensions it appears that this approach is limited to long-characteristics discretizations; other discretizations cannot be cast in prefix form. We implement two variants of the algorithm within the radlib/SCEPTRE transport code library at Sandia National Laboratories and show results on two different massively parallel systems. Both the 'forward' and 'symmetric' solvers behave similarly, scaling well to larger degrees of parallelism then sweeps-based solvers. We do observe some issues at the highest levels of parallelism (relative to the system size) and discuss possible causes. We conclude that this approach shows good potential for future parallel systems, but the parallel scalability will depend heavily on the architecture of the communication networks of these systems. (authors)

Fast Multipole-Based Elliptic PDE Solver and Preconditioner

KAUST Repository

Ibeid, Huda

2016-01-01

extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM

Determination of beam coupling impedance in the frequency domain

Energy Technology Data Exchange (ETDEWEB)

Niedermayer, Uwe

2016-07-01

The concept of beam coupling impedance describes the electromagnetic interaction of uniformly moving charged particles with their surrounding structures in the Frequency Domain (FD). In synchrotron accelerators, beam coupling impedances can lead to beam induced component heating and coherent beam instabilities. Thus, in order to ensure the stable operation of a synchrotron, its impedances have to be quantified and their effects have to be controlled. Nowadays, beam coupling impedances are mostly obtained by Fourier transform of wake potentials, which are the results of Time Domain (TD) simulations. However, at low frequencies, low beam velocity, or for dispersive materials, TD simulations become unhandy. In this area, analytical calculations of beam coupling impedance in the FD, combined with geometry approximations, are still widely used. This thesis describes the development of two electromagnetic field solvers to obtain the beam coupling impedance directly in the FD, where the beam velocity is only a parameter and dispersive materials can be included easily. One solver is based on the Finite Integration Technique (FIT) on a staircase mesh. It is implemented both in 2D and 3D. However, the staircase mesh is inefficient on curved structures, which is particularly problematic for the modeling of a dipole source, that is required for the computation of the transverse beam coupling impedance. This issue is overcome by the second solver developed in this thesis, which is based on the Finite Element Method (FEM) on an unstructured triangular mesh. It is implemented in 2D and includes an optional Surface Impedance Boundary Condition (SIBC). Thus, it is well suited for the computation of longitudinal and transverse impedances of long beam pipe structures of arbitrary cross-section. Besides arbitrary frequency and beam velocity, also dispersive materials can be chosen, which is crucial for the computation of the impedance of ferrite kicker magnets. Numerical impedance

A comparison of SuperLU solvers on the intel MIC architecture

Science.gov (United States)

Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.

2016-10-01

In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.

Comparison between time-and frequency-domain induced polarisation parameters

CSIR Research Space (South Africa)

Van Schoor, Abraham M

2009-09-01

Full Text Available of mineralised rocks and of the contrast between different rock types. It is further shown that a multi-frequency (spectral) approach can be used to avoid this pitfall; similarly, the calculation of different time-domain induced polarisation (IP) parameters...

The Openpipeflow Navier–Stokes solver

Directory of Open Access Journals (Sweden)

Ashley P. Willis

2017-01-01

Full Text Available Pipelines are used in a huge range of industrial processes involving fluids, and the ability to accurately predict properties of the flow through a pipe is of fundamental engineering importance. Armed with parallel MPI, Arnoldi and Newton–Krylov solvers, the Openpipeflow code can be used in a range of settings, from large-scale simulation of highly turbulent flow, to the detailed analysis of nonlinear invariant solutions (equilibria and periodic orbits and their influence on the dynamics of the flow.

Adaptive multi-resolution 3D Hartree-Fock-Bogoliubov solver for nuclear structure

Science.gov (United States)

Pei, J. C.; Fann, G. I.; Harrison, R. J.; Nazarewicz, W.; Shi, Yue; Thornton, S.

2014-08-01

Background: Complex many-body systems, such as triaxial and reflection-asymmetric nuclei, weakly bound halo states, cluster configurations, nuclear fragments produced in heavy-ion fusion reactions, cold Fermi gases, and pasta phases in neutron star crust, are all characterized by large sizes and complex topologies in which many geometrical symmetries characteristic of ground-state configurations are broken. A tool of choice to study such complex forms of matter is an adaptive multi-resolution wavelet analysis. This method has generated much excitement since it provides a common framework linking many diversified methodologies across different fields, including signal processing, data compression, harmonic analysis and operator theory, fractals, and quantum field theory. Purpose: To describe complex superfluid many-fermion systems, we introduce an adaptive pseudospectral method for solving self-consistent equations of nuclear density functional theory in three dimensions, without symmetry restrictions. Methods: The numerical method is based on the multi-resolution and computational harmonic analysis techniques with a multi-wavelet basis. The application of state-of-the-art parallel programming techniques include sophisticated object-oriented templates which parse the high-level code into distributed parallel tasks with a multi-thread task queue scheduler for each multi-core node. The internode communications are asynchronous. The algorithm is variational and is capable of solving coupled complex-geometric systems of equations adaptively, with functional and boundary constraints, in a finite spatial domain of very large size, limited by existing parallel computer memory. For smooth functions, user-defined finite precision is guaranteed. Results: The new adaptive multi-resolution Hartree-Fock-Bogoliubov (HFB) solver madness-hfb is benchmarked against a two-dimensional coordinate-space solver hfb-ax that is based on the B-spline technique and a three-dimensional solver

Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation

KAUST Repository

Chen, Meng-Huo; Sun, Shuyu; Salama, Amgad

2015-01-01

and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately

Dancing with the Electrons: Time-Domain and CW EPR Imaging

Directory of Open Access Journals (Sweden)

Sankaran Subramanian

2008-01-01

Full Text Available The progress in the development of imaging the distribution of unpaired electrons in living systems and the functional and the potential diagnostic dimensions of such an imaging process, using Electron Paramagnetic Resonance Imaging (EPRI, is traced from its origins with emphasis on our own work. The importance of EPR imaging stems from the fact that many paramagnetic probes show oxygen dependent spectral broadening. Assessment of in vivo oxygen concentration is an important factor in radiation oncology in treatment-planning and monitoring treatment-outcome. The emergence of narrow-line trairylmethyl based, bio-compatible spin probes has enabled the development of radiofrequency time-domain EPRI. Spectral information in time-domain EPRI can be achieved by generating a time sequence of T 2 * or T 2 weighted images. Progress in CW imaging has led to the use of rotating gradients, more recently rapid scan with direct detection, and a combination of all the three. Very low field MRI employing Dynamic Nuclear polarization (Overhauser effect is also employed for monitoring tumor hypoxia, and re-oxygenation in vivo . We have also been working on the co-registration of MRI and time domain EPRI on mouse tumor models at 300 MHz using a specially designed resonator assembly. The mapping of the unpaired electron distribution and unraveling the spectral characteristics by using magnetic resonance in presence of stationary and rotating gradients in indeed ‘dancing with the ( unpaired electrons’, metaphorically speaking.

A space-time mixed galerkin marching-on-in-time scheme for the time-domain combined field integral equation

KAUST Repository

Beghein, Yves

2013-03-01

The time domain combined field integral equation (TD-CFIE), which is constructed from a weighted sum of the time domain electric and magnetic field integral equations (TD-EFIE and TD-MFIE) for analyzing transient scattering from closed perfect electrically conducting bodies, is free from spurious resonances. The standard marching-on-in-time technique for discretizing the TD-CFIE uses Galerkin and collocation schemes in space and time, respectively. Unfortunately, the standard scheme is theoretically not well understood: stability and convergence have been proven for only one class of space-time Galerkin discretizations. Moreover, existing discretization schemes are nonconforming, i.e., the TD-MFIE contribution is tested with divergence conforming functions instead of curl conforming functions. We therefore introduce a novel space-time mixed Galerkin discretization for the TD-CFIE. A family of temporal basis and testing functions with arbitrary order is introduced. It is explained how the corresponding interactions can be computed efficiently by existing collocation-in-time codes. The spatial mixed discretization is made fully conforming and consistent by leveraging both Rao-Wilton-Glisson and Buffa-Christiansen basis functions and by applying the appropriate bi-orthogonalization procedures. The combination of both techniques is essential when high accuracy over a broad frequency band is required. © 2012 IEEE.

Windowing of THz time-domain spectroscopy signals: A study based on lactose

Science.gov (United States)

Vázquez-Cabo, José; Chamorro-Posada, Pedro; Fraile-Peláez, Francisco Javier; Rubiños-López, Óscar; López-Santos, José María; Martín-Ramos, Pablo

2016-05-01

Time-domain spectroscopy has established itself as a reference method for determining material parameters in the terahertz spectral range. This procedure requires the processing of the measured time-domain signals in order to estimate the spectral data. In this work, we present a thorough study of the properties of the signal windowing, a step previous to the parameter extraction algorithm, that permits to improve the accuracy of the results. Lactose has been used as sample material in the study.

Nonlinear behavior in the time domain in argon atmospheric dielectric-barrier discharges

International Nuclear Information System (INIS)

Shi Hong; Wang Yanhui; Wang Dezhen

2008-01-01

A vast majority of nonlinear behavior in atmospheric pressure discharges has so far been studied in the space domain, and their time-domain characters are often believed to exact the periodicity of the externally applied voltage. In this paper, based on one-dimensional fluid mode, we study complex nonlinear behavior in the time domain in argon atmospheric dielectric-barrier discharges at very broad frequency range from kilohertz to megahertz. Under certain conditions, the discharge not only can be driven to chaos from time-periodic state through period-doubling bifurcation, but also can return stable periodic motion from chaotic state through an inverse period-doubling bifurcation sequence. Upon changing the parameter the discharge undergoes alternatively chaotic and periodic behavior. Some periodic windows embedded in chaos, as well as the secondary bifurcation occurring in the periodic windows can also be observed. The corresponding discharge characteristics are investigated.

The time domain triple probe method

International Nuclear Information System (INIS)

Meier, M.A.; Hallock, G.A.; Tsui, H.Y.W.; Bengtson, R.D.

1994-01-01

A new Langmuir probe technique based on the triple probe method is being developed to provide simultaneous measurement of plasma temperature, potential, and density with the temporal and spatial resolution required to accurately characterize plasma turbulence. When the conventional triple probe method is used in an inhomogeneous plasma, local differences in the plasma measured at each probe introduce significant error in the estimation of turbulence parameters. The Time Domain Triple Probe method (TDTP) uses high speed switching of Langmuir probe potential, rather than spatially separated probes, to gather the triple probe information thus avoiding these errors. Analysis indicates that plasma response times and recent electronics technology meet the requirements to implement the TDTP method. Data reduction techniques of TDTP data are to include linear and higher order correlation analysis to estimate fluctuation induced particle and thermal transport, as well as energy relationships between temperature, density, and potential fluctuations

Domain-Generality of Timing-Based Serial Order Processes in Short-Term Memory: New Insights from Musical and Verbal Domains.

Directory of Open Access Journals (Sweden)

Simon Gorin

Full Text Available Several models in the verbal domain of short-term memory (STM consider a dissociation between item and order processing. This view is supported by data demonstrating that different types of time-based interference have a greater effect on memory for the order of to-be-remembered items than on memory for the items themselves. The present study investigated the domain-generality of the item versus serial order dissociation by comparing the differential effects of time-based interfering tasks, such as rhythmic interference and articulatory suppression, on item and order processing in verbal and musical STM domains. In Experiment 1, participants had to maintain sequences of verbal or musical information in STM, followed by a probe sequence, this under different conditions of interference (no-interference, rhythmic interference, articulatory suppression. They were required to decide whether all items of the probe list matched those of the memory list (item condition or whether the order of the items in the probe sequence matched the order in the memory list (order condition. In Experiment 2, participants performed a serial order probe recognition task for verbal and musical sequences ensuring sequential maintenance processes, under no-interference or rhythmic interference conditions. For Experiment 1, serial order recognition was not significantly more impacted by interfering tasks than was item recognition, this for both verbal and musical domains. For Experiment 2, we observed selective interference of the rhythmic interference condition on both musical and verbal order STM tasks. Overall, the results suggest a similar and selective sensitivity to time-based interference for serial order STM in verbal and musical domains, but only when the STM tasks ensure sequential maintenance processes.

Domain-Generality of Timing-Based Serial Order Processes in Short-Term Memory: New Insights from Musical and Verbal Domains.

Science.gov (United States)

Gorin, Simon; Kowialiewski, Benjamin; Majerus, Steve

2016-01-01

Several models in the verbal domain of short-term memory (STM) consider a dissociation between item and order processing. This view is supported by data demonstrating that different types of time-based interference have a greater effect on memory for the order of to-be-remembered items than on memory for the items themselves. The present study investigated the domain-generality of the item versus serial order dissociation by comparing the differential effects of time-based interfering tasks, such as rhythmic interference and articulatory suppression, on item and order processing in verbal and musical STM domains. In Experiment 1, participants had to maintain sequences of verbal or musical information in STM, followed by a probe sequence, this under different conditions of interference (no-interference, rhythmic interference, articulatory suppression). They were required to decide whether all items of the probe list matched those of the memory list (item condition) or whether the order of the items in the probe sequence matched the order in the memory list (order condition). In Experiment 2, participants performed a serial order probe recognition task for verbal and musical sequences ensuring sequential maintenance processes, under no-interference or rhythmic interference conditions. For Experiment 1, serial order recognition was not significantly more impacted by interfering tasks than was item recognition, this for both verbal and musical domains. For Experiment 2, we observed selective interference of the rhythmic interference condition on both musical and verbal order STM tasks. Overall, the results suggest a similar and selective sensitivity to time-based interference for serial order STM in verbal and musical domains, but only when the STM tasks ensure sequential maintenance processes.

Investigation on the Use of a Multiphase Eulerian CFD solver to simulate breaking waves

DEFF Research Database (Denmark)

Tomaselli, Pietro D.; Christensen, Erik Damgaard

2015-01-01

investigation on a CFD model capable of handling this problem. The model is based on a solver, available in the open-source CFD toolkit OpenFOAM, which combines the Eulerian multi-fluid approach for dispersed flows with a numerical interface sharpening method. The solver, enhanced with additional formulations...

Development and verification of the neutron diffusion solver for the GeN-Foam multi-physics platform

International Nuclear Information System (INIS)

Fiorina, Carlo; Kerkar, Nordine; Mikityuk, Konstantin; Rubiolo, Pablo; Pautz, Andreas

2016-01-01

Highlights: • Development and verification of a neutron diffusion solver based on OpenFOAM. • Integration in the GeN-Foam multi-physics platform. • Implementation and verification of acceleration techniques. • Implementation of isotropic discontinuity factors. • Automatic adjustment of discontinuity factors. - Abstract: The Laboratory for Reactor Physics and Systems Behaviour at the PSI and the EPFL has been developing in recent years a new code system for reactor analysis based on OpenFOAM®. The objective is to supplement available legacy codes with a modern tool featuring state-of-the-art characteristics in terms of scalability, programming approach and flexibility. As part of this project, a new solver has been developed for the eigenvalue and transient solution of multi-group diffusion equations. Several features distinguish the developed solver from other available codes, in particular: object oriented programming to ease code modification and maintenance; modern parallel computing capabilities; use of general unstructured meshes; possibility of mesh deformation; cell-wise parametrization of cross-sections; and arbitrary energy group structure. In addition, the solver is integrated into the GeN-Foam multi-physics solver. The general features of the solver and its integration with GeN-Foam have already been presented in previous publications. The present paper describes the diffusion solver in more details and provides an overview of new features recently implemented, including the use of acceleration techniques and discontinuity factors. In addition, a code verification is performed through a comparison with Monte Carlo results for both a thermal and a fast reactor system.

Common-image gathers in the offset domain from reverse-time migration

KAUST Repository

Zhan, Ge

2014-04-01

Kirchhoff migration is flexible to output common-image gathers (CIGs) in the offset domain by imaging data with different offsets separately. These CIGs supply important information for velocity model updates and amplitude-variation-with-offset (AVO) analysis. Reverse-time migration (RTM) offers more insights into complex geology than Kirchhoff migration by accurately describing wave propagation using the two-way wave equation. But, it has difficulty to produce offset domain CIGs like Kirchhoff migration. In this paper, we develop a method for obtaining offset domain CIGs from RTM. The method first computes the RTM operator of an offset gather, followed by a dot product of the operator and the offset data to form a common-offset RTM image. The offset domain CIGs are then achieved after separately migrating data with different offsets. We generate offset domain CIGs on both the Marmousi synthetic data and 2D Gulf of Mexico real data using this approach. © 2014.

Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines

KAUST Repository

Woźniak, Maciej

2015-02-01

This paper derives theoretical estimates of the computational cost for isogeometric multi-frontal direct solver executed on parallel distributed memory machines. We show theoretically that for the Cp-1 global continuity of the isogeometric solution, both the computational cost and the communication cost of a direct solver are of order O(log(N)p2) for the one dimensional (1D) case, O(Np2) for the two dimensional (2D) case, and O(N4/3p2) for the three dimensional (3D) case, where N is the number of degrees of freedom and p is the polynomial order of the B-spline basis functions. The theoretical estimates are verified by numerical experiments performed with three parallel multi-frontal direct solvers: MUMPS, PaStiX and SuperLU, available through PETIGA toolkit built on top of PETSc. Numerical results confirm these theoretical estimates both in terms of p and N. For a given problem size, the strong efficiency rapidly decreases as the number of processors increases, becoming about 20% for 256 processors for a 3D example with 1283 unknowns and linear B-splines with C0 global continuity, and 15% for a 3D example with 643 unknowns and quartic B-splines with C3 global continuity. At the same time, one cannot arbitrarily increase the problem size, since the memory required by higher order continuity spaces is large, quickly consuming all the available memory resources even in the parallel distributed memory version. Numerical results also suggest that the use of distributed parallel machines is highly beneficial when solving higher order continuity spaces, although the number of processors that one can efficiently employ is somehow limited.

Time-Domain Diversity in Ultra-Wideband MIMO Communications

Directory of Open Access Journals (Sweden)

Alain Sibille

2005-03-01

Full Text Available The development of ultra-wideband (UWB communications is impeded by the drastic transmitted power limitations imposed by regulation authorities due to the “polluting” character of these radio emissions with respect to existing services. Technical solutions must be researched in order either to limit the level of spectral pollution by UWB devices or to increase their reception sensitivity. In the present work, we consider pulse-based modulations and investigate time-domain multiple-input multiple-output (MIMO diversity as one such possible solution. The basic principles of time-domain diversity in the extreme (low multipath density or intermediate (dense multipath UWB regimes are addressed, which predict the possibility of a MIMO gain equal to the product Nt×Nr of the numbers of transmit/receive antenna elements when the channel is not too severe. This analysis is confirmed by simulations using a parametric empirical stochastic double-directional channel model. They confirm the potential interest of MIMO approaches solutions in order to bring a valuable performance gain in UWB communications.

A pseudospectral collocation time-domain method for diffractive optics

DEFF Research Database (Denmark)

Dinesen, P.G.; Hesthaven, J.S.; Lynov, Jens-Peter

2000-01-01

We present a pseudospectral method for the analysis of diffractive optical elements. The method computes a direct time-domain solution of Maxwell's equations and is applied to solving wave propagation in 2D diffractive optical elements. (C) 2000 IMACS. Published by Elsevier Science B.V. All rights...

Tests of a 3D Self Magnetic Field Solver in the Finite Element Gun Code MICHELLE

CERN Document Server

Nelson, Eric M

2005-01-01

We have recently implemented a prototype 3d self magnetic field solver in the finite-element gun code MICHELLE. The new solver computes the magnetic vector potential on unstructured grids. The solver employs edge basis functions in the curl-curl formulation of the finite-element method. A novel current accumulation algorithm takes advantage of the unstructured grid particle tracker to produce a compatible source vector, for which the singular matrix equation is easily solved by the conjugate gradient method. We will present some test cases demonstrating the capabilities of the prototype 3d self magnetic field solver. One test case is self magnetic field in a square drift tube. Another is a relativistic axisymmetric beam freely expanding in a round pipe.

Time-domain single-source integral equations for analyzing scattering from homogeneous penetrable objects

KAUST Repository

Valdés, Felipe

2013-03-01

Single-source time-domain electric-and magnetic-field integral equations for analyzing scattering from homogeneous penetrable objects are presented. Their temporal discretization is effected by using shifted piecewise polynomial temporal basis functions and a collocation testing procedure, thus allowing for a marching-on-in-time (MOT) solution scheme. Unlike dual-source formulations, single-source equations involve space-time domain operator products, for which spatial discretization techniques developed for standalone operators do not apply. Here, the spatial discretization of the single-source time-domain integral equations is achieved by using the high-order divergence-conforming basis functions developed by Graglia alongside the high-order divergence-and quasi curl-conforming (DQCC) basis functions of Valdés The combination of these two sets allows for a well-conditioned mapping from div-to curl-conforming function spaces that fully respects the space-mapping properties of the space-time operators involved. Numerical results corroborate the fact that the proposed procedure guarantees accuracy and stability of the MOT scheme. © 2012 IEEE.

Simulation of two-phase flows by domain decomposition

International Nuclear Information System (INIS)

Dao, T.H.

2013-01-01

This thesis deals with numerical simulations of compressible fluid flows by implicit finite volume methods. Firstly, we studied and implemented an implicit version of the Roe scheme for compressible single-phase and two-phase flows. Thanks to Newton method for solving nonlinear systems, our schemes are conservative. Unfortunately, the resolution of nonlinear systems is very expensive. It is therefore essential to use an efficient algorithm to solve these systems. For large size matrices, we often use iterative methods whose convergence depends on the spectrum. We have studied the spectrum of the linear system and proposed a strategy, called Scaling, to improve the condition number of the matrix. Combined with the classical ILU pre-conditioner, our strategy has reduced significantly the GMRES iterations for local systems and the computation time. We also show some satisfactory results for low Mach-number flows using the implicit centered scheme. We then studied and implemented a domain decomposition method for compressible fluid flows. We have proposed a new interface variable which makes the Schur complement method easy to build and allows us to treat diffusion terms. Using GMRES iterative solver rather than Richardson for the interface system also provides a better performance compared to other methods. We can also decompose the computational domain into any number of sub-domains. Moreover, the Scaling strategy for the interface system has improved the condition number of the matrix and reduced the number of GMRES iterations. In comparison with the classical distributed computing, we have shown that our method is more robust and efficient. (author) [fr

Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations

KAUST Repository

AbouEisha, Hassan M.

2016-06-02

In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particular, the problem of optimal ordering of elimination of rows in the sparse matrices resulting from adaptive finite element method computations is reduced to the problem of finding of optimal element partition trees. Given a two dimensional h refined mesh, we find all optimal element partition trees by using the dynamic programming approach. An element partition tree defines a prescribed order of elimination of degrees of freedom over the mesh. We utilize three different metrics to estimate the quality of the element partition tree. As the first criterion we consider the number of floating point operations(FLOPs) performed by the multi-frontal solver. As the second criterion we consider the number of memory transfers (MEMOPS) performed by the multi-frontal solver algorithm. As the third criterion we consider memory usage (NONZEROS) of the multi-frontal direct solver. We show the optimization results for FLOPs vs MEMOPS as well as for the execution time estimated as FLOPs+100MEMOPS vs NONZEROS. We obtain Pareto fronts with multiple optimal trees, for each mesh, and for each refinement level. We generate a library of optimal elimination trees for small grids with local singularities. We also propose an algorithm that for a given large mesh with identified local sub-grids, each one with local singularity. We compute Schur complements over the sub-grids using the optimal trees from the library, and we submit the sequence of Schur complements into the iterative solver ILUPCG.

Measurement of electron paramagnetic resonance using terahertz time-domain spectroscopy.

Science.gov (United States)

Kozuki, Kohei; Nagashima, Takeshi; Hangyo, Masanori

2011-12-05

We present a frequency-domain electron spin resonance (ESR) measurement system using terahertz time-domain spectroscopy. A crossed polarizer technique is utilized to increase the sensitivity in detecting weak ESR signals of paramagnets caused by magnetic dipole transitions between magnetic sublevels. We demonstrate the measurements of ESR signal of paramagnetic copper(II) sulfate pentahydrate with uniaxial anisotropy of the g-factor under magnetic fields up to 10 T. The lineshape of the obtained ESR signals agrees well with the theoretical predictions for a powder sample with the uniaxial anisotropy.

Reduction of Poisson noise in measured time-resolved data for time-domain diffuse optical tomography.

Science.gov (United States)

Okawa, S; Endo, Y; Hoshi, Y; Yamada, Y

2012-01-01

A method to reduce noise for time-domain diffuse optical tomography (DOT) is proposed. Poisson noise which contaminates time-resolved photon counting data is reduced by use of maximum a posteriori estimation. The noise-free data are modeled as a Markov random process, and the measured time-resolved data are assumed as Poisson distributed random variables. The posterior probability of the occurrence of the noise-free data is formulated. By maximizing the probability, the noise-free data are estimated, and the Poisson noise is reduced as a result. The performances of the Poisson noise reduction are demonstrated in some experiments of the image reconstruction of time-domain DOT. In simulations, the proposed method reduces the relative error between the noise-free and noisy data to about one thirtieth, and the reconstructed DOT image was smoothed by the proposed noise reduction. The variance of the reconstructed absorption coefficients decreased by 22% in a phantom experiment. The quality of DOT, which can be applied to breast cancer screening etc., is improved by the proposed noise reduction.

PyOperators: Operators and solvers for high-performance computing

Science.gov (United States)

Chanial, P.; Barbey, N.

2012-12-01

PyOperators is a publicly available library that provides basic operators and solvers for small-to-very large inverse problems ({http://pchanial.github.com/pyoperators}). It forms the backbone of the package PySimulators, which implements specific operators to construct an instrument model and means to conveniently represent a map, a timeline or a time-dependent observation ({http://pchanial.github.com/pysimulators}). Both are part of the Tamasis (Tools for Advanced Map-making, Analysis and SImulations of Submillimeter surveys) toolbox, aiming at providing versatile, reliable, easy-to-use, and optimal map-making tools for Herschel and future generation of sub-mm instruments. The project is a collaboration between 4 institutes (ESO Garching, IAS Orsay, CEA Saclay, Univ. Leiden).

Joint time-frequency domain proportional fair scheduler with HARQ for 3GPP LTE systems

OpenAIRE

Beh, KC; Doufexi, A; Armour, SMD

2008-01-01

This paper explores the potential gain of joint diversity in both frequency domain and time domain which can be exploited to achieve spectral efficiency gains whilst simultaneously facilitating QoS/ fairness in an OFDMA system particularly in 3GPP Long Term Evolution (LTE)). The performance of several joint time-frequency schedulers is investigated. Simulation results show that joint time frequency schedulers achieve significantly superior performance compared to a more conventional time doma...

Parallelization of pressure equation solver for incompressible N-S equations

International Nuclear Information System (INIS)

Ichihara, Kiyoshi; Yokokawa, Mitsuo; Kaburaki, Hideo.

1996-03-01

A pressure equation solver in a code for 3-dimensional incompressible flow analysis has been parallelized by using red-black SOR method and PCG method on Fujitsu VPP500, a vector parallel computer with distributed memory. For the comparison of scalability, the solver using the red-black SOR method has been also parallelized on the Intel Paragon, a scalar parallel computer with a distributed memory. The scalability of the red-black SOR method on both VPP500 and Paragon was lost, when number of processor elements was increased. The reason of non-scalability on both systems is increasing communication time between processor elements. In addition, the parallelization by DO-loop division makes the vectorizing efficiency lower on VPP500. For an effective implementation on VPP500, a large scale problem which holds very long vectorized DO-loops in the parallel program should be solved. PCG method with red-black SOR method applied to incomplete LU factorization (red-black PCG) has more iteration steps than normal PCG method with forward and backward substitution, in spite of same number of the floating point operations in a DO-loop of incomplete LU factorization. The parallelized red-black PCG method has less merits than the parallelized red-black SOR method when the computational region has fewer grids, because the low vectorization efficiency is obtained in red-black PCG method. (author)

Spectral phase encoding of ultra-short optical pulse in time domain for OCDMA application.

Science.gov (United States)

Wang, Xu; Wada, Naoya

2007-06-11

We propose a novel reconfigurable time domain spectral phase encoding (SPE) scheme for coherent optical code-division-multiple-access application. In the proposed scheme, the ultra-short optical pulse is stretched by dispersive device and the SPE is done in time domain using high speed phase modulator. The time domain SPE scheme is robust to wavelength drift of the light source and is very flexible and compatible with the fiber optical system. Proof-of-principle experiments of encoding with 16-chip, 20 GHz/chip binary-phase-shift-keying codes and 1.25 Gbps data transmission have been successfully demonstrated together with an arrayed-wave-guide decoder.

Effects of high-frequency damping on iterative convergence of implicit viscous solver

Science.gov (United States)

Nishikawa, Hiroaki; Nakashima, Yoshitaka; Watanabe, Norihiko

2017-11-01

This paper discusses effects of high-frequency damping on iterative convergence of an implicit defect-correction solver for viscous problems. The study targets a finite-volume discretization with a one parameter family of damped viscous schemes. The parameter α controls high-frequency damping: zero damping with α = 0, and larger damping for larger α (> 0). Convergence rates are predicted for a model diffusion equation by a Fourier analysis over a practical range of α. It is shown that the convergence rate attains its minimum at α = 1 on regular quadrilateral grids, and deteriorates for larger values of α. A similar behavior is observed for regular triangular grids. In both quadrilateral and triangular grids, the solver is predicted to diverge for α smaller than approximately 0.5. Numerical results are shown for the diffusion equation and the Navier-Stokes equations on regular and irregular grids. The study suggests that α = 1 and 4/3 are suitable values for robust and efficient computations, and α = 4 / 3 is recommended for the diffusion equation, which achieves higher-order accuracy on regular quadrilateral grids. Finally, a Jacobian-Free Newton-Krylov solver with the implicit solver (a low-order Jacobian approximately inverted by a multi-color Gauss-Seidel relaxation scheme) used as a variable preconditioner is recommended for practical computations, which provides robust and efficient convergence for a wide range of α.