Exact diagonalization library for quantum electron models
Iskakov, Sergei; Danilov, Michael
2018-04-01
We present an exact diagonalization C++ template library (EDLib) for solving quantum electron models, including the single-band finite Hubbard cluster and the multi-orbital impurity Anderson model. The observables that can be computed using EDLib are single particle Green's functions and spin-spin correlation functions. This code provides three different types of Hamiltonian matrix storage that can be chosen based on the model.
Thermodynamics of Rh nuclear spins calculated by exact diagonalization
DEFF Research Database (Denmark)
Lefmann, K.; Ipsen, J.; Rasmussen, F.B.
2000-01-01
We have employed the method of exact diagonalization to obtain the full-energy spectrum of a cluster of 16 Rh nuclear spins, having dipolar and RK interactions between first and second nearest neighbours only. We have used this to calculate the nuclear spin entropy, and our results at both positi...
Benchmarking GW against exact diagonalization for semiempirical models
DEFF Research Database (Denmark)
Kaasbjerg, Kristen; Thygesen, Kristian Sommer
2010-01-01
We calculate ground-state total energies and single-particle excitation energies of seven pi-conjugated molecules described with the semiempirical Pariser-Parr-Pople model using self-consistent many-body perturbation theory at the GW level and exact diagonalization. For the total energies GW capt...... (Hubbard models) where correlation effects dominate over screening/relaxation effects. Finally we illustrate the important role of the derivative discontinuity of the true exchange-correlation functional by computing the exact Kohn-Sham levels of benzene....
Off-diagonal Bethe ansatz for exactly solvable models
Wang, Yupeng; Cao, Junpeng; Shi, Kangjie
2015-01-01
This book serves as an introduction of the off-diagonal Bethe Ansatz method, an analytic theory for the eigenvalue problem of quantum integrable models. It also presents some fundamental knowledge about quantum integrability and the algebraic Bethe Ansatz method. Based on the intrinsic properties of R-matrix and K-matrices, the book introduces a systematic method to construct operator identities of transfer matrix. These identities allow one to establish the inhomogeneous T-Q relation formalism to obtain Bethe Ansatz equations and to retrieve corresponding eigenstates. Several longstanding models can thus be solved via this method since the lack of obvious reference states is made up. Both the exact results and the off-diagonal Bethe Ansatz method itself may have important applications in the fields of quantum field theory, low-dimensional condensed matter physics, statistical physics and cold atom systems.
Exact diagonalization: the Bose-Hubbard model as an example
International Nuclear Information System (INIS)
Zhang, J M; Dong, R X
2010-01-01
We take the Bose-Hubbard model to illustrate exact diagonalization techniques in a pedagogical way. We follow the route of first generating all the basis vectors, then setting up the Hamiltonian matrix with respect to this basis and finally using the Lanczos algorithm to solve low lying eigenstates and eigenvalues. Emphasis is placed on how to enumerate all the basis vectors and how to use the hashing trick to set up the Hamiltonian matrix or matrices corresponding to other quantities. Although our route is not necessarily the most efficient one in practice, the techniques and ideas introduced are quite general and may find use in many other problems.
Large-scale exact diagonalizations reveal low-momentum scales of nuclei
Forssén, C.; Carlsson, B. D.; Johansson, H. T.; Sääf, D.; Bansal, A.; Hagen, G.; Papenbrock, T.
2018-03-01
Ab initio methods aim to solve the nuclear many-body problem with controlled approximations. Virtually exact numerical solutions for realistic interactions can only be obtained for certain special cases such as few-nucleon systems. Here we extend the reach of exact diagonalization methods to handle model spaces with dimension exceeding 1010 on a single compute node. This allows us to perform no-core shell model (NCSM) calculations for 6Li in model spaces up to Nmax=22 and to reveal the 4He+d halo structure of this nucleus. Still, the use of a finite harmonic-oscillator basis implies truncations in both infrared (IR) and ultraviolet (UV) length scales. These truncations impose finite-size corrections on observables computed in this basis. We perform IR extrapolations of energies and radii computed in the NCSM and with the coupled-cluster method at several fixed UV cutoffs. It is shown that this strategy enables information gain also from data that is not fully UV converged. IR extrapolations improve the accuracy of relevant bound-state observables for a range of UV cutoffs, thus making them profitable tools. We relate the momentum scale that governs the exponential IR convergence to the threshold energy for the first open decay channel. Using large-scale NCSM calculations we numerically verify this small-momentum scale of finite nuclei.
Hagymási, I.; Itai, K.; Sólyom, J.
2012-06-01
We investigate an extended version of the periodic Anderson model (the so-called periodic Anderson-Hubbard model) with the aim to understand the role of interaction between conduction electrons in the formation of the heavy-fermion and mixed-valence states. Two methods are used: (i) variational calculation with the Gutzwiller wave function optimizing numerically the ground-state energy and (ii) exact diagonalization of the Hamiltonian for short chains. The f-level occupancy and the renormalization factor of the quasiparticles are calculated as a function of the energy of the f orbital for a wide range of the interaction parameters. The results obtained by the two methods are in reasonably good agreement for the periodic Anderson model. The agreement is maintained even when the interaction between band electrons, Ud, is taken into account, except for the half-filled case. This discrepancy can be explained by the difference between the physics of the one- and higher-dimensional models. We find that this interaction shifts and widens the energy range of the bare f level, where heavy-fermion behavior can be observed. For large-enough Ud this range may lie even above the bare conduction band. The Gutzwiller method indicates a robust transition from Kondo insulator to Mott insulator in the half-filled model, while Ud enhances the quasiparticle mass when the filling is close to half filling.
Spin-1/2 Heisenberg antiferromagnet on the pyrochlore lattice: An exact diagonalization study
Chandra, V. Ravi; Sahoo, Jyotisman
2018-04-01
We present exact diagonalization calculations for the spin-1/2 nearest-neighbor antiferromagnet on the pyrochlore lattice. We study a section of the lattice in the [111] direction and analyze the Hamiltonian of the breathing pyrochlore system with two coupling constants J1 and J2 for tetrahedra of different orientations and investigate the evolution of the system from the limit of disconnected tetrahedra (J2=0 ) to a correlated state at J1=J2 . We evaluate the low-energy spectrum, two and four spin correlations, and spin chirality correlations for a system size of up to 36 sites. The model shows a fast decay of spin correlations and we confirm the presence of several singlet excitations below the lowest magnetic excitation. We find chirality correlations near J1=J2 to be small at the length scales available at this system size. Evaluation of dimer-dimer correlations and analysis of the nature of the entanglement of the tetrahedral unit shows that the triplet sector of the tetrahedron contributes significantly to the ground-state entanglement at J1=J2 .
Exact diagonalization of the D-dimensional spatially confined quantum harmonic oscillator
Directory of Open Access Journals (Sweden)
Kunle Adegoke
2016-01-01
Full Text Available In the existing literature various numerical techniques have been developed to quantize the confined harmonic oscillator in higher dimensions. In obtaining the energy eigenvalues, such methods often involve indirect approaches such as searching for the roots of hypergeometric functions or numerically solving a differential equation. In this paper, however, we derive an explicit matrix representation for the Hamiltonian of a confined quantum harmonic oscillator in higher dimensions, thus facilitating direct diagonalization.
Kumar, Santosh; Dietz, Barbara; Guhr, Thomas; Richter, Achim
2017-12-15
The recently derived distributions for the scattering-matrix elements in quantum chaotic systems are not accessible in the majority of experiments, whereas the cross sections are. We analytically compute distributions for the off-diagonal cross sections in the Heidelberg approach, which is applicable to a wide range of quantum chaotic systems. Thus, eventually, we fully solve a problem that already arose more than half a century ago in compound-nucleus scattering. We compare our results with data from microwave and compound-nucleus experiments, particularly addressing the transition from isolated resonances towards the Ericson regime of strongly overlapping ones.
Macfarlane, J. J.
1992-01-01
We investigate the convergence properties of Lambda-acceleration methods for non-LTE radiative transfer problems in planar and spherical geometry. Matrix elements of the 'exact' A-operator are used to accelerate convergence to a solution in which both the radiative transfer and atomic rate equations are simultaneously satisfied. Convergence properties of two-level and multilevel atomic systems are investigated for methods using: (1) the complete Lambda-operator, and (2) the diagonal of the Lambda-operator. We find that the convergence properties for the method utilizing the complete Lambda-operator are significantly better than those of the diagonal Lambda-operator method, often reducing the number of iterations needed for convergence by a factor of between two and seven. However, the overall computational time required for large scale calculations - that is, those with many atomic levels and spatial zones - is typically a factor of a few larger for the complete Lambda-operator method, suggesting that the approach should be best applied to problems in which convergence is especially difficult.
Independent oscillator model of a heat bath: exact diagonalization of the Hamiltonian
International Nuclear Information System (INIS)
Ford, G.W.; Lewis, J.T.; O'Connell, R.F.
1988-01-01
The problem of a quantum oscillator coupled to an independent-oscillator model of a heat bath is discussed. The transformation to normal coordinates is explicitly constructed using the method of Ullersma. With this transformation an alternative derivation of an exact formula for the oscillator free energy is constructed. The various contributions to the oscillator energy are calculated, with the aim of further understanding this formula. Finally, the limitations of linear coupling models, such as that used by Ullersma, are discussed in the form of some critical remarks
Syaina, L. P.; Majidi, M. A.
2018-04-01
Single impurity Anderson model describes a system consisting of non-interacting conduction electrons coupled with a localized orbital having strongly interacting electrons at a particular site. This model has been proven successful to explain the phenomenon of metal-insulator transition through Anderson localization. Despite the well-understood behaviors of the model, little has been explored theoretically on how the model properties gradually evolve as functions of hybridization parameter, interaction energy, impurity concentration, and temperature. Here, we propose to do a theoretical study on those aspects of a single impurity Anderson model using the distributional exact diagonalization method. We solve the model Hamiltonian by randomly generating sampling distribution of some conducting electron energy levels with various number of occupying electrons. The resulting eigenvalues and eigenstates are then used to define the local single-particle Green function for each sampled electron energy distribution using Lehmann representation. Later, we extract the corresponding self-energy of each distribution, then average over all the distributions and construct the local Green function of the system to calculate the density of states. We repeat this procedure for various values of those controllable parameters, and discuss our results in connection with the criteria of the occurrence of metal-insulator transition in this system.
International Nuclear Information System (INIS)
Weinstein, M.
2012-01-01
I will talk about a new way of implementing Lanczos and contraction algorithms to diagonalize lattice Hamiltonians that dramatically reduces the memory required to do the computation, without restricting to variational ansatzes. (author)
An Exact, Compressible One-Dimensional Riemann Solver for General, Convex Equations of State
Energy Technology Data Exchange (ETDEWEB)
Kamm, James Russell [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-03-05
This note describes an algorithm with which to compute numerical solutions to the one- dimensional, Cartesian Riemann problem for compressible flow with general, convex equations of state. While high-level descriptions of this approach are to be found in the literature, this note contains most of the necessary details required to write software for this problem. This explanation corresponds to the approach used in the source code that evaluates solutions for the 1D, Cartesian Riemann problem with a JWL equation of state in the ExactPack package [16, 29]. Numerical examples are given with the proposed computational approach for a polytropic equation of state and for the JWL equation of state.
Exact diagonalization of the interacting propagator for the 2D-electron gas in a magnetic field
International Nuclear Information System (INIS)
Burke, A.; Cabo, A.
1990-07-01
The spatial dependence of the exact one electron propagator for an interacting 2D-electron gas in a magnetic field is shown to be the same as for a non-interacting gas. This happens whenever the translational symmetry is unbroken in the ground state. The result may be extended to a more general class of systems. The translational symmetry also implies that the density of states has the same kind of discrete character as in the non-interacting case. This is shown explicitly in the Hartree-Fock approximation by solving the Dyson equation. (author). 10 refs
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav
-, č. 2 (2017), s. 33-43 ISSN 0567-8293 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : diagonalization * cardinality * Russell’s paradox * incompleteness of arithmetic Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
Diagonalization of Hamiltonian; Diagonalization of Hamiltonian
Energy Technology Data Exchange (ETDEWEB)
Garrido, L M; Pascual, P
1960-07-01
We present a general method to diagonalized the Hamiltonian of particles of arbitrary spin. In particular we study the cases of spin 0,1/2, 1 and see that for spin 1/2 our transformation agrees with Foldy's and obtain the expression for different observables for particles of spin C and 1 in the new representation. (Author) 7 refs.
International Nuclear Information System (INIS)
Ushveridze, A.G.
1992-01-01
This paper reports that quasi-exactly solvable (QES) models realize principally new type of exact solvability in quantum physics. These models are distinguished by the fact that the Schrodinger equations for them can be solved exactly only for certain limited parts of the spectrum, but not for the whole spectrum. They occupy an intermediate position between the exactly the authors solvable (ES) models and all the others. The number of energy levels for which the spectral problems can be solved exactly refer below to as the order of QES model. From the mathematical point of view the existence of QES models is not surprising. Indeed, if the term exact solvability expresses the possibility of total explicit diagonalization of infinite Hamiltonian matrix, then the term quasi-exact solvability implies the situation when the Hamiltonian matrix can be reduced explicitly to the block-diagonal form with one of the appearing blocks being finite
Essential imposition of Neumann condition in Galerkin-Legendre elliptic solvers
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...
Chaotic diagonal recurrent neural network
International Nuclear Information System (INIS)
Wang Xing-Yuan; Zhang Yi
2012-01-01
We propose a novel neural network based on a diagonal recurrent neural network and chaos, and its structure and learning algorithm are designed. The multilayer feedforward neural network, diagonal recurrent neural network, and chaotic diagonal recurrent neural network are used to approach the cubic symmetry map. The simulation results show that the approximation capability of the chaotic diagonal recurrent neural network is better than the other two neural networks. (interdisciplinary physics and related areas of science and technology)
Vaidya spacetime in the diagonal coordinates
Energy Technology Data Exchange (ETDEWEB)
Berezin, V. A., E-mail: berezin@inr.ac.ru; Dokuchaev, V. I., E-mail: dokuchaev@inr.ac.ru; Eroshenko, Yu. N., E-mail: eroshenko@inr.ac.ru [Russian Academy of Sciences, Institute for Nuclear Research (Russian Federation)
2017-03-15
We have analyzed the transformation from initial coordinates (v, r) of the Vaidya metric with light coordinate v to the most physical diagonal coordinates (t, r). An exact solution has been obtained for the corresponding metric tensor in the case of a linear dependence of the mass function of the Vaidya metric on light coordinate v. In the diagonal coordinates, a narrow region (with a width proportional to the mass growth rate of a black hole) has been detected near the visibility horizon of the Vaidya accreting black hole, in which the metric differs qualitatively from the Schwarzschild metric and cannot be represented as a small perturbation. It has been shown that, in this case, a single set of diagonal coordinates (t, r) is insufficient to cover the entire range of initial coordinates (v, r) outside the visibility horizon; at least three sets of diagonal coordinates are required, the domains of which are separated by singular surfaces on which the metric components have singularities (either g{sub 00} = 0 or g{sub 00} = ∞). The energy–momentum tensor diverges on these surfaces; however, the tidal forces turn out to be finite, which follows from an analysis of the deviation equations for geodesics. Therefore, these singular surfaces are exclusively coordinate singularities that can be referred to as false fire-walls because there are no physical singularities on them. We have also considered the transformation from the initial coordinates to other diagonal coordinates (η, y), in which the solution is obtained in explicit form, and there is no energy–momentum tensor divergence.
Off-diagonal Bethe ansatz solution of the XXX spin chain with arbitrary boundary conditions
Energy Technology Data Exchange (ETDEWEB)
Cao, Junpeng [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China); Yang, Wen-Li, E-mail: wlyang@nwu.edu.cn [Institute of Modern Physics, Northwest University, Xian 710069 (China); Shi, Kangjie [Institute of Modern Physics, Northwest University, Xian 710069 (China); Wang, Yupeng, E-mail: yupeng@iphy.ac.cn [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China)
2013-10-01
Employing the off-diagonal Bethe ansatz method proposed recently by the present authors, we exactly diagonalize the XXX spin chain with arbitrary boundary fields. By constructing a functional relation between the eigenvalues of the transfer matrix and the quantum determinant, the associated T–Q relation and the Bethe ansatz equations are derived.
Off-diagonal Bethe ansatz solution of the XXX spin chain with arbitrary boundary conditions
International Nuclear Information System (INIS)
Cao, Junpeng; Yang, Wen-Li; Shi, Kangjie; Wang, Yupeng
2013-01-01
Employing the off-diagonal Bethe ansatz method proposed recently by the present authors, we exactly diagonalize the XXX spin chain with arbitrary boundary fields. By constructing a functional relation between the eigenvalues of the transfer matrix and the quantum determinant, the associated T–Q relation and the Bethe ansatz equations are derived
Self-consistent cluster theories for alloys with diagonal and off-diagonal disorder
International Nuclear Information System (INIS)
Gonis, A.; Garland, J.W.
1978-01-01
The molecular coherent-potential approximation (MCPA) and other, simpler cluster approximations for disordered alloys are studied both analytically and numerically for alloys with diagonal and off-diagonal disorder (ODD). First, the MCPA for alloys with only diagonal disorder is rederived within the interactor formalism of Blackman, Esterling, and Berk. This formalism, which simplifies the numerical implementation of the MCPA, is then used to generalize the MCPA so as to take account of ODD. It is shown that the analytic properties of the MCPA are preserved under this generalization. Also, two computationally simple cluster approximations, the self-consistent central-site approximation (SCCSA) and the self-consistent boundary-site approximation (SCBSA), are generalized to include the effects of ODD. It is shown that for one-dimensional systems with only nearest-neighbor hopping the SCBSA yields Green's functions which are identical to those given by the MCPA and thus are analytic, even in the presence of ODD. Finally, the results of numerical calculations are reported for one-dimensional systems with only nearest-neighbor hopping but with both diagonal and off-diagonal disorder. These calculations were performed using the single-site approximation of Blackman, Esterling, and Berk and three different cluster approximations: the multishell method previously proposed by the authors, the SCCSA, and the SCBSA. The results of these calculations are compared with exact results and with previous results obtained using the truncated t-matix approximation and the recent method of Kaplan and Gray. These comparisons suggest that the multishell method and the generalization of the SCBSA given in this paper are more efficient and accurate for the calculation of densities of states for systems with ODD. On the other hand, as expected, the SCCSA was found to yield severely nonanalytic results for the values of band parameters used
Exact diagonalization of quantum lattice models on coprocessors
Siro, T.; Harju, A.
2016-10-01
We implement the Lanczos algorithm on an Intel Xeon Phi coprocessor and compare its performance to a multi-core Intel Xeon CPU and an NVIDIA graphics processor. The Xeon and the Xeon Phi are parallelized with OpenMP and the graphics processor is programmed with CUDA. The performance is evaluated by measuring the execution time of a single step in the Lanczos algorithm. We study two quantum lattice models with different particle numbers, and conclude that for small systems, the multi-core CPU is the fastest platform, while for large systems, the graphics processor is the clear winner, reaching speedups of up to 7.6 compared to the CPU. The Xeon Phi outperforms the CPU with sufficiently large particle number, reaching a speedup of 2.5.
Computational Lower Bounds Using Diagonalization
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 14; Issue 7. Computational Lower Bounds Using Diagonalization - Languages, Turing Machines and Complexity Classes. M V Panduranga Rao. General Article Volume 14 Issue 7 July 2009 pp 682-690 ...
A progressive diagonalization scheme for the Rabi Hamiltonian
International Nuclear Information System (INIS)
Pan, Feng; Guan, Xin; Wang, Yin; Draayer, J P
2010-01-01
A diagonalization scheme for the Rabi Hamiltonian, which describes a qubit interacting with a single-mode radiation field via a dipole interaction, is proposed. It is shown that the Rabi Hamiltonian can be solved almost exactly using a progressive scheme that involves a finite set of one variable polynomial equations. The scheme is especially efficient for the lower part of the spectrum. Some low-lying energy levels of the model with several sets of parameters are calculated and compared to those provided by the recently proposed generalized rotating-wave approximation and a full matrix diagonalization.
Diagonalization of the mass matrices
International Nuclear Information System (INIS)
Rhee, S.S.
1984-01-01
It is possible to make 20 types of 3x3 mass matrices which are hermitian. We have obtained unitary matrices which could diagonalize each mass matrix. Since the three elements of mass matrix can be expressed in terms of the three eigenvalues, msub(i), we can also express the unitary matrix in terms of msub(i). (Author)
The modified Gauss diagonalization of polynomial matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-10-01
The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)
Differential equations problem solver
Arterburn, David R
2012-01-01
REA's Problem Solvers is a series of useful, practical, and informative study guides. Each title in the series is complete step-by-step solution guide. The Differential Equations Problem Solver enables students to solve difficult problems by showing them step-by-step solutions to Differential Equations problems. The Problem Solvers cover material ranging from the elementary to the advanced and make excellent review books and textbook companions. They're perfect for undergraduate and graduate studies.The Differential Equations Problem Solver is the perfect resource for any class, any exam, and
Nondestructive identification of the Bell diagonal state
International Nuclear Information System (INIS)
Jin Jiasen; Yu Changshui; Song Heshan
2011-01-01
We propose a scheme for identifying an unknown Bell diagonal state. In our scheme the measurements are performed on the probe qubits instead of the Bell diagonal state. The distinct advantage is that the quantum state of the evolved Bell diagonal state ensemble plus probe states will still collapse on the original Bell diagonal state ensemble after the measurement on probe states; i.e., our identification is quantum state nondestructive. How to realize our scheme in the framework of cavity electrodynamics is also shown.
Zingl, Manuel; Nuss, Martin; Bauernfeind, Daniel; Aichhorn, Markus
2018-05-01
Recently solvers for the Anderson impurity model (AIM) working directly on the real-frequency axis have gained much interest. A simple and yet frequently used impurity solver is exact diagonalization (ED), which is based on a discretization of the AIM bath degrees of freedom. Usually, the bath parameters cannot be obtained directly on the real-frequency axis, but have to be determined by a fit procedure on the Matsubara axis. In this work we present an approach where the bath degrees of freedom are first discretized directly on the real-frequency axis using a large number of bath sites (≈ 50). Then, the bath is optimized by unitary transformations such that it separates into two parts that are weakly coupled. One part contains the impurity site and its interacting Green's functions can be determined with ED. The other (larger) part is a non-interacting system containing all the remaining bath sites. Finally, the Green's function of the full AIM is calculated via coupling these two parts with cluster perturbation theory.
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
International Nuclear Information System (INIS)
Bello-Rivas, Juan M.; Elber, Ron
2015-01-01
A new theory and an exact computer algorithm for calculating kinetics and thermodynamic properties of a particle system are described. The algorithm avoids trapping in metastable states, which are typical challenges for Molecular Dynamics (MD) simulations on rough energy landscapes. It is based on the division of the full space into Voronoi cells. Prior knowledge or coarse sampling of space points provides the centers of the Voronoi cells. Short time trajectories are computed between the boundaries of the cells that we call milestones and are used to determine fluxes at the milestones. The flux function, an essential component of the new theory, provides a complete description of the statistical mechanics of the system at the resolution of the milestones. We illustrate the accuracy and efficiency of the exact Milestoning approach by comparing numerical results obtained on a model system using exact Milestoning with the results of long trajectories and with a solution of the corresponding Fokker-Planck equation. The theory uses an equation that resembles the approximate Milestoning method that was introduced in 2004 [A. K. Faradjian and R. Elber, J. Chem. Phys. 120(23), 10880-10889 (2004)]. However, the current formulation is exact and is still significantly more efficient than straightforward MD simulations on the system studied
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
Virial expansion for almost diagonal random matrices
Yevtushenko, Oleg; Kravtsov, Vladimir E.
2003-08-01
Energy level statistics of Hermitian random matrices hat H with Gaussian independent random entries Higeqj is studied for a generic ensemble of almost diagonal random matrices with langle|Hii|2rangle ~ 1 and langle|Hi\
Strictly diagonal holomorphic functions on Banach spaces
Directory of Open Access Journals (Sweden)
O. I. Fedak
2016-01-01
Full Text Available In this paper we investigate the boundedness of holomorphic functionals on a Banach space with a normalized basis $\\{e_n\\}$ which have a very special form $f(x=f(0+\\sum_{n=1}^\\infty c_nx_n^n$ and which we call strictly diagonal. We consider under which conditions strictly diagonal functions are entire and uniformly continuous on every ball of a fixed radius.
A fast Poisson solver for unsteady incompressible Navier-Stokes equations on the half-staggered grid
Golub, G. H.; Huang, L. C.; Simon, H.; Tang, W. -P.
1995-01-01
In this paper, a fast Poisson solver for unsteady, incompressible Navier-Stokes equations with finite difference methods on the non-uniform, half-staggered grid is presented. To achieve this, new algorithms for diagonalizing a semi-definite pair are developed. Our fast solver can also be extended to the three dimensional case. The motivation and related issues in using this second kind of staggered grid are also discussed. Numerical testing has indicated the effectiveness of this algorithm.
Energy Technology Data Exchange (ETDEWEB)
Pieper, Andreas [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Kreutzer, Moritz [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Alvermann, Andreas, E-mail: alvermann@physik.uni-greifswald.de [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Galgon, Martin [Bergische Universität Wuppertal (Germany); Fehske, Holger [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Hager, Georg [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Lang, Bruno [Bergische Universität Wuppertal (Germany); Wellein, Gerhard [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)
2016-11-15
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.
International Nuclear Information System (INIS)
Zeger, J.
1993-01-01
Organized criminals also tried to illegally transfer nuclear material through Austria. Two important questions have to be answered after the material is sized by police authorities: What is the composition of the material and where does it come from? By application of a broad range of analytical techniques, which were developed or refined by our experts, it is possible to measure the exact amount and isotopic composition of uranium and plutonium in any kind of samples. The criminalistic application is only a byproduct of the large scale work on controlling the peaceful application of nuclear energy, which is done in contract with the IAEA in the context of the 'Network of Analytical Laboratories'
High performance simplex solver
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...
Off-Diagonal Geometric Phase in a Neutron Interferometer Experiment
International Nuclear Information System (INIS)
Hasegawa, Y.; Loidl, R.; Baron, M.; Badurek, G.; Rauch, H.
2001-01-01
Off-diagonal geometric phases acquired by an evolution of a 1/2 -spin system have been observed by means of a polarized neutron interferometer. We have successfully measured the off-diagonal phase for noncyclic evolutions even when the diagonal geometric phase is undefined. Our data confirm theoretical predictions and the results illustrate the significance of the off-diagonal phase
Using a satisfiability solver to identify deterministic finite state automata
Heule, M.J.H.; Verwer, S.
2009-01-01
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we
Diagonal chromatography to study plant protein modifications.
Walton, Alan; Tsiatsiani, Liana; Jacques, Silke; Stes, Elisabeth; Messens, Joris; Van Breusegem, Frank; Goormachtig, Sofie; Gevaert, Kris
2016-08-01
An interesting asset of diagonal chromatography, which we have introduced for contemporary proteome research, is its high versatility concerning proteomic applications. Indeed, the peptide modification or sorting step that is required between consecutive peptide separations can easily be altered and thereby allows for the enrichment of specific, though different types of peptides. Here, we focus on the application of diagonal chromatography for the study of modifications of plant proteins. In particular, we show how diagonal chromatography allows for studying proteins processed by proteases, protein ubiquitination, and the oxidation of protein-bound methionines. We discuss the actual sorting steps needed for each of these applications and the obtained results. This article is part of a Special Issue entitled: Plant Proteomics--a bridge between fundamental processes and crop production, edited by Dr. Hans-Peter Mock. Copyright © 2016 Elsevier B.V. All rights reserved.
Nonlinear Spinor Field in Non-Diagonal Bianchi Type Space-Time
Directory of Open Access Journals (Sweden)
Saha Bijan
2018-01-01
Full Text Available Within the scope of the non-diagonal Bianchi cosmological models we have studied the role of the spinor field in the evolution of the Universe. In the non-diagonal Bianchi models the spinor field distribution along the main axis is anisotropic and does not vanish in the absence of the spinor field nonlinearity. Hence within these models perfect fluid, dark energy etc. cannot be simulated by the spinor field nonlinearity. The equation for volume scale V in the case of non-diagonal Bianchi models contains a term with first derivative of V explicitly and does not allow exact solution by quadratures. Like the diagonal models the non-diagonal Bianchi space-time becomes locally rotationally symmetric even in the presence of a spinor field. It was found that depending on the sign of the coupling constant the model allows either an open Universe that rapidly grows up or a close Universe that ends in a Big Crunch singularity.
Electric circuits problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of electric circuits currently av
Advanced calculus problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of advanced calculus currently av
Enumeration of diagonally colored Young diagrams
Gyenge, Ádám
2015-01-01
In this note we give a new proof of a closed formula for the multivariable generating series of diagonally colored Young diagrams. This series also describes the Euler characteristics of certain Nakajima quiver varieties. Our proof is a direct combinatorial argument, based on Andrews' work on generalized Frobenius partitions. We also obtain representations of these series in some particular cases as infinite products.
Diagonal Pade approximations for initial value problems
International Nuclear Information System (INIS)
Reusch, M.F.; Ratzan, L.; Pomphrey, N.; Park, W.
1987-06-01
Diagonal Pade approximations to the time evolution operator for initial value problems are applied in a novel way to the numerical solution of these problems by explicitly factoring the polynomials of the approximation. A remarkable gain over conventional methods in efficiency and accuracy of solution is obtained. 20 refs., 3 figs., 1 tab
Diagonalization and Many-Body Localization for a Disordered Quantum Spin Chain
Imbrie, John Z
2016-01-01
We consider a weakly interacting quantum spin chain with random local interactions. We prove that many-body localization follows from a physically reasonable assumption that limits the extent of level attraction in the statistics of eigenvalues. In a KAM-style construction, a sequence of local unitary transformations is used to diagonalize the Hamiltonian by deforming the initial tensor product basis into a complete set of exact many-body eigenfunctions.
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
Fast Approximate Joint Diagonalization Incorporating Weight Matrices
Czech Academy of Sciences Publication Activity Database
Tichavský, Petr; Yeredor, A.
2009-01-01
Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf
Diagonalizing sensing matrix of broadband RSE
International Nuclear Information System (INIS)
Sato, Shuichi; Kokeyama, Keiko; Kawazoe, Fumiko; Somiya, Kentaro; Kawamura, Seiji
2006-01-01
For a broadband-operated RSE interferometer, a simple and smart length sensing and control scheme was newly proposed. The sensing matrix could be diagonal, owing to a simple allocation of two RF modulations and to a macroscopic displacement of cavity mirrors, which cause a detuning of the RF modulation sidebands. In this article, the idea of the sensing scheme and an optimization of the relevant parameters will be described
On diagonalization in map(M,G)
International Nuclear Information System (INIS)
Blau, M.; Thompson, G.
1995-01-01
Motivated by some questions in the path integral approach to (topological) gauge theories, we are led to address the following question: given a smooth map from a manifold M to a compact group G, is it possible to smoothly ''diagonalize'' it, i.e. conjugate it into a map to a maximal torus T of G? We analyze the local and global obstructions and give a complete solution to the problem for regular maps. We establish that these can always be smoothly diagonalized locally and that the obstructions to doing this globally are non-trivial Weyl group and torus bundles on M. We explain the relation of the obstructions to winding numbers of maps into G/T and restrictions of the structure group of a principal G bundle to T and examine the behaviour of gauge fields under this diagonalization. We also discuss the complications that arise in the presence of non-trivial G-bundles and for non-regular maps. We use these results to justify a Weyl integral formula for functional integrals which, as a novel feature not seen in the finite-dimensional case, contains a summation over all those topological T-sectors which arise as restrictions of a trivial principal G bundle and which was used previously to solve completely Yang-Mills theory and the G/ G model in two dimensions. (orig.)
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)
Sherlock Holmes, Master Problem Solver.
Ballew, Hunter
1994-01-01
Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)
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.
Simultaneous diagonal and off-diagonal order in the Bose-Hubbard Hamiltonian
International Nuclear Information System (INIS)
Scalettar, R.T.; Batrouni, G.G.; Kampf, A.P.; Zimanyi, G.T.
1995-01-01
The Bose-Hubbard model exhibits a rich phase diagram consisting both of insulating regimes where diagonal long-range (solid) order dominates as well as conducting regimes where off-diagonal long-range order (superfluidity) is present. In this paper we describe the results of quantum Monte Carlo calculations of the phase diagram, both for the hard- and soft-core cases, with a particular focus on the possibility of simultaneous superfluid and solid order. We also discuss the appearance of phase separation in the model. The simulations are compared with analytic calculations of the phase diagram and spin-wave dispersion
Exact diagonalization study of domain structures in integer filling factor quantum Hall ferromagnets
Czech Academy of Sciences Publication Activity Database
Rezayi, E. H.; Jungwirth, Tomáš; MacDonald, A. H.; Haldane, F. D. M.
2003-01-01
Roč. 67, č. 20 (2003), s. 201305-1 - 201305-4 ISSN 0163-1829 R&D Projects: GA ČR GA202/01/0754 Institutional research plan: CEZ:AV0Z1010914 Keywords : domain structure * integer filling factor * quantum Hall ferromagnets Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 2.962, year: 2003
Modern solvers for Helmholtz problems
Tang, Jok; Vuik, Kees
2017-01-01
This edited volume offers a state of the art overview of fast and robust solvers for the Helmholtz equation. The book consists of three parts: new developments and analysis in Helmholtz solvers, practical methods and implementations of Helmholtz solvers, and industrial applications. The Helmholtz equation appears in a wide range of science and engineering disciplines in which wave propagation is modeled. Examples are: seismic inversion, ultrasone medical imaging, sonar detection of submarines, waves in harbours and many more. The partial differential equation looks simple but is hard to solve. In order to approximate the solution of the problem numerical methods are needed. First a discretization is done. Various methods can be used: (high order) Finite Difference Method, Finite Element Method, Discontinuous Galerkin Method and Boundary Element Method. The resulting linear system is large, where the size of the problem increases with increasing frequency. Due to higher frequencies the seismic images need to b...
ACORNS, Covariance and Correlation Matrix Diagonalization
International Nuclear Information System (INIS)
Szondi, E.J.
1990-01-01
1 - Description of program or function: The program allows the user to verify the different types of covariance/correlation matrices used in the activation neutron spectrometry. 2 - Method of solution: The program performs the diagonalization of the input covariance/relative covariance/correlation matrices. The Eigen values are then analyzed to determine the rank of the matrices. If the Eigen vectors of the pertinent correlation matrix have also been calculated, the program can perform a complete factor analysis (generation of the factor matrix and its rotation in Kaiser's 'varimax' sense to select the origin of the correlations). 3 - Restrictions on the complexity of the problem: Matrix size is limited to 60 on PDP and to 100 on IBM PC/AT
Breaking Megrelishvili protocol using matrix diagonalization
Arzaki, Muhammad; Triantoro Murdiansyah, Danang; Adi Prabowo, Satrio
2018-03-01
In this article we conduct a theoretical security analysis of Megrelishvili protocol—a linear algebra-based key agreement between two participants. We study the computational complexity of Megrelishvili vector-matrix problem (MVMP) as a mathematical problem that strongly relates to the security of Megrelishvili protocol. In particular, we investigate the asymptotic upper bounds for the running time and memory requirement of the MVMP that involves diagonalizable public matrix. Specifically, we devise a diagonalization method for solving the MVMP that is asymptotically faster than all of the previously existing algorithms. We also found an important counterintuitive result: the utilization of primitive matrix in Megrelishvili protocol makes the protocol more vulnerable to attacks.
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
Off-diagonal deformations of Kerr metrics and black ellipsoids in heterotic supergravity
Energy Technology Data Exchange (ETDEWEB)
Vacaru, Sergiu I. [Quantum Gravity Research, Topanga, CA (United States); University ' ' Al. I. Cuza' ' , Project IDEI, Iasi (Romania); Irwin, Klee [Quantum Gravity Research, Topanga, CA (United States)
2017-01-15
Geometric methods for constructing exact solutions of equations of motion with first order α{sup '} corrections to the heterotic supergravity action implying a nontrivial Yang-Mills sector and six-dimensional, 6-d, almost-Kaehler internal spaces are studied. In 10-d spacetimes, general parametrizations for generic off-diagonal metrics, nonlinear and linear connections, and matter sources, when the equations of motion decouple in very general forms are considered. This allows us to construct a variety of exact solutions when the coefficients of fundamental geometric/physical objects depend on all higher-dimensional spacetime coordinates via corresponding classes of generating and integration functions, generalized effective sources and integration constants. Such generalized solutions are determined by generic off-diagonal metrics and nonlinear and/or linear connections; in particular, as configurations which are warped/compactified to lower dimensions and for Levi-Civita connections. The corresponding metrics can have (non-) Killing and/or Lie algebra symmetries and/or describe (1+2)-d and/or (1+3)-d domain wall configurations, with possible warping nearly almost-Kaehler manifolds, with gravitational and gauge instantons for nonlinear vacuum configurations and effective polarizations of cosmological and interaction constants encoding string gravity effects. A series of examples of exact solutions describing generic off-diagonal supergravity modifications to black hole/ellipsoid and solitonic configurations are provided and analyzed. We prove that it is possible to reproduce the Kerr and other type black solutions in general relativity (with certain types of string corrections) in the 4-d case and to generalize the solutions to non-vacuum configurations in (super-) gravity/string theories. (orig.)
Off-diagonal deformations of Kerr metrics and black ellipsoids in heterotic supergravity
International Nuclear Information System (INIS)
Vacaru, Sergiu I.; Irwin, Klee
2017-01-01
Geometric methods for constructing exact solutions of equations of motion with first order α ' corrections to the heterotic supergravity action implying a nontrivial Yang-Mills sector and six-dimensional, 6-d, almost-Kaehler internal spaces are studied. In 10-d spacetimes, general parametrizations for generic off-diagonal metrics, nonlinear and linear connections, and matter sources, when the equations of motion decouple in very general forms are considered. This allows us to construct a variety of exact solutions when the coefficients of fundamental geometric/physical objects depend on all higher-dimensional spacetime coordinates via corresponding classes of generating and integration functions, generalized effective sources and integration constants. Such generalized solutions are determined by generic off-diagonal metrics and nonlinear and/or linear connections; in particular, as configurations which are warped/compactified to lower dimensions and for Levi-Civita connections. The corresponding metrics can have (non-) Killing and/or Lie algebra symmetries and/or describe (1+2)-d and/or (1+3)-d domain wall configurations, with possible warping nearly almost-Kaehler manifolds, with gravitational and gauge instantons for nonlinear vacuum configurations and effective polarizations of cosmological and interaction constants encoding string gravity effects. A series of examples of exact solutions describing generic off-diagonal supergravity modifications to black hole/ellipsoid and solitonic configurations are provided and analyzed. We prove that it is possible to reproduce the Kerr and other type black solutions in general relativity (with certain types of string corrections) in the 4-d case and to generalize the solutions to non-vacuum configurations in (super-) gravity/string theories. (orig.)
Finite-Time Attractivity for Diagonally Dominant Systems with Off-Diagonal Delays
Directory of Open Access Journals (Sweden)
T. S. Doan
2012-01-01
Full Text Available We introduce a notion of attractivity for delay equations which are defined on bounded time intervals. Our main result shows that linear delay equations are finite-time attractive, provided that the delay is only in the coupling terms between different components, and the system is diagonally dominant. We apply this result to a nonlinear Lotka-Volterra system and show that the delay is harmless and does not destroy finite-time attractivity.
A comparison of SuperLU solvers on the intel MIC architecture
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.
Quantum Monte Carlo diagonalization method as a variational calculation
International Nuclear Information System (INIS)
Mizusaki, Takahiro; Otsuka, Takaharu; Honma, Michio.
1997-01-01
A stochastic method for performing large-scale shell model calculations is presented, which utilizes the auxiliary field Monte Carlo technique and diagonalization method. This method overcomes the limitation of the conventional shell model diagonalization and can extremely widen the feasibility of shell model calculations with realistic interactions for spectroscopic study of nuclear structure. (author)
Anisotropic resonator analysis using the Fourier-Bessel mode solver
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.
Iterative solvers in forming process simulations
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
Minaret, a deterministic neutron transport solver for nuclear core calculations
International Nuclear Information System (INIS)
Moller, J-Y.; Lautard, J-J.
2011-01-01
We present here MINARET a deterministic transport solver for nuclear core calculations to solve the steady state Boltzmann equation. The code follows the multi-group formalism to discretize the energy variable. It uses discrete ordinate method to deal with the angular variable and a DGFEM to solve spatially the Boltzmann equation. The mesh is unstructured in 2D and semi-unstructured in 3D (cylindrical). Curved triangles can be used to fit the exact geometry. For the curved elements, two different sets of basis functions can be used. Transport solver is accelerated with a DSA method. Diffusion and SPN calculations are made possible by skipping the transport sweep in the source iteration. The transport calculations are parallelized with respect to the angular directions. Numerical results are presented for simple geometries and for the C5G7 Benchmark, JHR reactor and the ESFR (in 2D and 3D). Straight and curved finite element results are compared. (author)
Minaret, a deterministic neutron transport solver for nuclear core calculations
Energy Technology Data Exchange (ETDEWEB)
Moller, J-Y.; Lautard, J-J., E-mail: jean-yves.moller@cea.fr, E-mail: jean-jacques.lautard@cea.fr [CEA - Centre de Saclay , Gif sur Yvette (France)
2011-07-01
We present here MINARET a deterministic transport solver for nuclear core calculations to solve the steady state Boltzmann equation. The code follows the multi-group formalism to discretize the energy variable. It uses discrete ordinate method to deal with the angular variable and a DGFEM to solve spatially the Boltzmann equation. The mesh is unstructured in 2D and semi-unstructured in 3D (cylindrical). Curved triangles can be used to fit the exact geometry. For the curved elements, two different sets of basis functions can be used. Transport solver is accelerated with a DSA method. Diffusion and SPN calculations are made possible by skipping the transport sweep in the source iteration. The transport calculations are parallelized with respect to the angular directions. Numerical results are presented for simple geometries and for the C5G7 Benchmark, JHR reactor and the ESFR (in 2D and 3D). Straight and curved finite element results are compared. (author)
Application of Nearly Linear Solvers to Electric Power System Computation
Grant, Lisa L.
To meet the future needs of the electric power system, improvements need to be made in the areas of power system algorithms, simulation, and modeling, specifically to achieve a time frame that is useful to industry. If power system time-domain simulations could run in real-time, then system operators would have situational awareness to implement online control and avoid cascading failures, significantly improving power system reliability. Several power system applications rely on the solution of a very large linear system. As the demands on power systems continue to grow, there is a greater computational complexity involved in solving these large linear systems within reasonable time. This project expands on the current work in fast linear solvers, developed for solving symmetric and diagonally dominant linear systems, in order to produce power system specific methods that can be solved in nearly-linear run times. The work explores a new theoretical method that is based on ideas in graph theory and combinatorics. The technique builds a chain of progressively smaller approximate systems with preconditioners based on the system's low stretch spanning tree. The method is compared to traditional linear solvers and shown to reduce the time and iterations required for an accurate solution, especially as the system size increases. A simulation validation is performed, comparing the solution capabilities of the chain method to LU factorization, which is the standard linear solver for power flow. The chain method was successfully demonstrated to produce accurate solutions for power flow simulation on a number of IEEE test cases, and a discussion on how to further improve the method's speed and accuracy is included.
Virial expansion for almost diagonal random matrices
International Nuclear Information System (INIS)
Yevtushenko, Oleg; Kravtsov, Vladimir E
2003-01-01
Energy level statistics of Hermitian random matrices H-circumflex with Gaussian independent random entries H i≥j is studied for a generic ensemble of almost diagonal random matrices with (vertical bar H ii vertical bar 2 ) ∼ 1 and (vertical bar H i≠j vertical bar 2 ) bF(vertical bar i - j vertical bar) parallel 1. We perform a regular expansion of the spectral form-factor K(τ) = 1 + bK 1 (τ) + b 2 K 2 (τ) + c in powers of b parallel 1 with the coefficients K m (τ) that take into account interaction of (m + 1) energy levels. To calculate K m (τ), we develop a diagrammatic technique which is based on the Trotter formula and on the combinatorial problem of graph edges colouring with (m + 1) colours. Expressions for K 1 (τ) and K 2 (τ) in terms of infinite series are found for a generic function F(vertical bar i - j vertical bar ) in the Gaussian orthogonal ensemble (GOE), the Gaussian unitary ensemble (GUE) and in the crossover between them (the almost unitary Gaussian ensemble). The Rosenzweig-Porter and power-law banded matrix ensembles are considered as examples
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
Separability of three qubit Greenberger-Horne-Zeilinger diagonal states
Han, Kyung Hoon; Kye, Seung-Hyeok
2017-04-01
We characterize the separability of three qubit GHZ diagonal states in terms of entries. This enables us to check separability of GHZ diagonal states without decomposition into the sum of pure product states. In the course of discussion, we show that the necessary criterion of Gühne (2011 Entanglement criteria and full separability of multi-qubit quantum states Phys. Lett. A 375 406-10) for (full) separability of three qubit GHZ diagonal states is sufficient with a simpler formula. The main tool is to use entanglement witnesses which are tri-partite Choi matrices of positive bi-linear maps.
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.
Non-diagonal processes of singlet and ordinary quark production
International Nuclear Information System (INIS)
Bejlin, V.A.; Vereshkov, G.M.; Kuksa, V.I.
1995-01-01
Non-diagonal processes of singlet and ordinary quark production are analyzed in the model where the down singlet quark mixes with the ordinary ones. The possibility of experimental selection of h-quark effects is demonstrated
Classical limit of diagonal form factors and HHL correlators
Energy Technology Data Exchange (ETDEWEB)
Bajnok, Zoltan [MTA Lendület Holographic QFT Group, Wigner Research Centre,H-1525 Budapest 114, P.O.B. 49 (Hungary); Janik, Romuald A. [Institute of Physics, Jagiellonian University,ul. Łojasiewicza 11, 30-348 Kraków (Poland)
2017-01-16
We propose an expression for the classical limit of diagonal form factors in which we integrate the corresponding observable over the moduli space of classical solutions. In infinite volume the integral has to be regularized by proper subtractions and we present the one, which corresponds to the classical limit of the connected diagonal form factors. In finite volume the integral is finite and can be expressed in terms of the classical infinite volume diagonal form factors and subvolumes of the moduli space. We analyze carefully the periodicity properties of the finite volume moduli space and found a classical analogue of the Bethe-Yang equations. By applying the results to the heavy-heavy-light three point functions we can express their strong coupling limit in terms of the classical limit of the sine-Gordon diagonal form factors.
MVDR Algorithm Based on Estimated Diagonal Loading for Beamforming
Directory of Open Access Journals (Sweden)
Yuteng Xiao
2017-01-01
Full Text Available Beamforming algorithm is widely used in many signal processing fields. At present, the typical beamforming algorithm is MVDR (Minimum Variance Distortionless Response. However, the performance of MVDR algorithm relies on the accurate covariance matrix. The MVDR algorithm declines dramatically with the inaccurate covariance matrix. To solve the problem, studying the beamforming array signal model and beamforming MVDR algorithm, we improve MVDR algorithm based on estimated diagonal loading for beamforming. MVDR optimization model based on diagonal loading compensation is established and the interval of the diagonal loading compensation value is deduced on the basis of the matrix theory. The optimal diagonal loading value in the interval is also determined through the experimental method. The experimental results show that the algorithm compared with existing algorithms is practical and effective.
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, Huda
2016-12-07
architecture supercomputers. Compared with other methods exploiting the low rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. Fast multipole-based solvers and preconditioners are demonstrably poised to play a leading role in exascale computing.
Determining Diagonal Branches in Mine Ventilation Networks
Krach, Andrzej
2014-12-01
The present paper discusses determining diagonal branches in a mine ventilation network by means of a method based on the relationship A⊗ PT(k, l) = M, which states that the nodal-branch incidence matrix A, modulo-2 multiplied by the transposed path matrix PT(k, l ) from node no. k to node no. l, yields the matrix M where all the elements in rows k and l - corresponding to the start and the end node - are 1, and where the elements in the remaining rows are 0, exclusively. If a row of the matrix M is to contain only "0" elements, the following condition has to be fulfilled: after multiplying the elements of a row of the matrix A by the elements of a column of the matrix PT(k, l), i.e. by the elements of a proper row of the matrix P(k, l ), the result row must display only "0" elements or an even number of "1" entries, as only such a number of "1" entries yields 0 when modulo-2 added - and since the rows of the matrix A correspond to the graph nodes, and the path nodes level is 2 (apart from the nodes k and l, whose level is 1), then the number of "1" elements in a row has to be 0 or 2. If, in turn, the rows k and l of the matrix M are to contain only "1" elements, the following condition has to be fulfilled: after multiplying the elements of the row k or l of the matrix A by the elements of a column of the matrix PT(k, l), the result row must display an uneven number of "1" entries, as only such a number of "1" entries yields 1 when modulo-2 added - and since the rows of the matrix A correspond to the graph nodes, and the level of the i and j path nodes is 1, then the number of "1" elements in a row has to be 1. The process of determining diagonal branches by means of this method was demonstrated using the example of a simple ventilation network with two upcast shafts and one downcast shaft. W artykule przedstawiono metodę wyznaczania bocznic przekątnych w sieci wentylacyjnej kopalni metodą bazującą na zależności A⊗PT(k, l) = M, która podaje, że macierz
Energy Technology Data Exchange (ETDEWEB)
Singleton, Robert Jr. [Los Alamos National Laboratory; Israel, Daniel M. [Los Alamos National Laboratory; Doebling, Scott William [Los Alamos National Laboratory; Woods, Charles Nathan [Los Alamos National Laboratory; Kaul, Ann [Los Alamos National Laboratory; Walter, John William Jr [Los Alamos National Laboratory; Rogers, Michael Lloyd [Los Alamos National Laboratory
2016-05-09
For code verification, one compares the code output against known exact solutions. There are many standard test problems used in this capacity, such as the Noh and Sedov problems. ExactPack is a utility that integrates many of these exact solution codes into a common API (application program interface), and can be used as a stand-alone code or as a python package. ExactPack consists of python driver scripts that access a library of exact solutions written in Fortran or Python. The spatial profiles of the relevant physical quantities, such as the density, fluid velocity, sound speed, or internal energy, are returned at a time specified by the user. The solution profiles can be viewed and examined by a command line interface or a graphical user interface, and a number of analysis tools and unit tests are also provided. We have documented the physics of each problem in the solution library, and provided complete documentation on how to extend the library to include additional exact solutions. ExactPack’s code architecture makes it easy to extend the solution-code library to include additional exact solutions in a robust, reliable, and maintainable manner.
Navas-Montilla, A.; Murillo, J.
2016-07-01
In this work, an arbitrary order HLL-type numerical scheme is constructed using the flux-ADER methodology. The proposed scheme is based on an augmented Derivative Riemann solver that was used for the first time in Navas-Montilla and Murillo (2015) [1]. Such solver, hereafter referred to as Flux-Source (FS) solver, was conceived as a high order extension of the augmented Roe solver and led to the generation of a novel numerical scheme called AR-ADER scheme. Here, we provide a general definition of the FS solver independently of the Riemann solver used in it. Moreover, a simplified version of the solver, referred to as Linearized-Flux-Source (LFS) solver, is presented. This novel version of the FS solver allows to compute the solution without requiring reconstruction of derivatives of the fluxes, nevertheless some drawbacks are evidenced. In contrast to other previously defined Derivative Riemann solvers, the proposed FS and LFS solvers take into account the presence of the source term in the resolution of the Derivative Riemann Problem (DRP), which is of particular interest when dealing with geometric source terms. When applied to the shallow water equations, the proposed HLLS-ADER and AR-ADER schemes can be constructed to fulfill the exactly well-balanced property, showing that an arbitrary quadrature of the integral of the source inside the cell does not ensure energy balanced solutions. As a result of this work, energy balanced flux-ADER schemes that provide the exact solution for steady cases and that converge to the exact solution with arbitrary order for transient cases are constructed.
New exact approaches to the nuclear eigenvalue problem
International Nuclear Information System (INIS)
Andreozzi, F.; Lo Iudice, N.; Porrino, A.; Knapp, F.; Kvasil, J.
2005-01-01
In a recent past some of us have developed a new algorithm for diagonalizing the shell model Hamiltonian which consists of an iterative sequence of diagonalization of sub-matrices of small dimensions. The method, apart from being easy to implement, is robust, yielding always stable numerical solutions, and free of ghost eigenvalues. Subsequently, we have endowed the algorithm with an importance sampling, which leads to a drastic truncation of the shell model space, while keeping the accuracy of the solutions under control. Applications to typical nuclei show that the sampling yields also an extrapolation law to the exact eigenvalues. Complementary to the shell model algorithm is a method we are developing for studying collective and non collective excitations. To this purpose we solve the nuclear eigenvalue problem in a space which is the direct sum of Tamm-Dancoff n-phonon subspaces (n=0,1, ...N). The multiphonon basis is constructed by an iterative equation of motion method, which generates an over complete set of n-phonon states from the (n-1)-phonon basis. The redundancy is removed completely and exactly by a method based on the Choleski decomposition. The full Hamiltonian matrix comes out to have a simple structure and, therefore, can be drastically truncated before diagonalization by the mentioned importance sampling method. The phonon composition of the basis states allows removing naturally and maximally the spurious admixtures induced by the centre of mass motion. An application of the method to 16 O will be given for illustrative purposes. (authors)
Gheorghiu, Tamara; Vacaru, Sergiu I
2014-01-01
We find general parameterizations for generic off-diagonal spacetime metrics and matter sources in general relativity, GR, and modified gravity theories when the field equations decouple with respect to certain types of nonholonomic frames of reference. This allows us to construct various classes of exact solutions when the coefficients of fundamental geometric/ physical objects depend on all spacetime coordinates via corresponding classes of generating and integration functions and/or constants. Such (modified) spacetimes can be with Killing and non-Killing symmetries, describe nonlinear vacuum configurations and effective polarizations of cosmological and interaction constants. Our method can be extended to higher dimensions which simplifies some proofs for imbedded and nonholonomically constrained four dimensional configurations. We reproduce the Kerr solution and show how to deform it nonholonomically into new classes of generic off-diagonal solutions depending on 3-8 spacetime coordinates. There are anal...
Clock Math — a System for Solving SLEs Exactly
Directory of Open Access Journals (Sweden)
Jakub Hladík
2013-01-01
Full Text Available In this paper, we present a GPU-accelerated hybrid system that solves ill-conditioned systems of linear equations exactly. Exactly means without rounding errors due to using integer arithmetics. First, we scale floating-point numbers up to integers, then we solve dozens of SLEs within different modular arithmetics and then we assemble sub-solutions back using the Chinese remainder theorem. This approach effectively bypasses current CPU floating-point limitations. The system is capable of solving Hilbert’s matrix without losing a single bit of precision, and with a significant speedup compared to existing CPU solvers.
Test set for initial value problem solvers
W.M. Lioen (Walter); J.J.B. de Swart (Jacques)
1998-01-01
textabstractThe CWI test set for IVP solvers presents a collection of Initial Value Problems to test solvers for implicit differential equations. This test set can both decrease the effort for the code developer to test his software in a reliable way, and cross the bridge between the application
AbouEisha, Hassan M.
2014-01-01
The problem of attribute reduction is an important problem related to feature selection and knowledge discovery. The problem of finding reducts with minimum cardinality is NP-hard. This paper suggests a new algorithm for finding exact reducts
Loading factor and inclination parameter of diagonal type MHD generators
International Nuclear Information System (INIS)
Ishikawa, Motoo
1979-01-01
Regarding diagonal type MHD generators is studied the relation between the loading factor and inclination parameter which is required for attaining the maximum power density with a given electrical efficiency on the assumption of infinitely segmented electrodes. The average current density on electrodes is calculated against the Hall parameter, loading factor, and inclination parameter. The diagonal type generator is compared with Faraday type generator regarding the average current density. Decreasing the loading factor from inlet to outlet is appropriate to small size generators but increasing to large size generators. The inclination parameter had better decrease in both generators, being smaller for small generators than for large ones. The average current density on electrodes of diagonal type generators varies less with the loading factor than the Faraday type. In large size generators its value can become smaller compared with that of the Faraday type. (author)
Diagonal Limit for Conformal Blocks in d Dimensions
Hogervorst, Matthijs; Rychkov, Slava
2013-01-01
Conformal blocks in any number of dimensions depend on two variables z, zbar. Here we study their restrictions to the special "diagonal" kinematics z = zbar, previously found useful as a starting point for the conformal bootstrap analysis. We show that conformal blocks on the diagonal satisfy ordinary differential equations, third-order for spin zero and fourth-order for the general case. These ODEs determine the blocks uniquely and lead to an efficient numerical evaluation algorithm. For equal external operator dimensions, we find closed-form solutions in terms of finite sums of 3F2 functions.
Spectral Sharpening of Color Sensors: Diagonal Color Constancy and Beyond
Vazquez-Corral, Javier; Bertalmío, Marcelo
2014-01-01
It has now been 20 years since the seminal work by Finlayson et al. on the use/nof spectral sharpening of sensors to achieve diagonal color constancy. Spectral sharpening is/nstill used today by numerous researchers for different goals unrelated to the original goal/nof diagonal color constancy e.g., multispectral processing, shadow removal, location of/nunique hues. This paper reviews the idea of spectral sharpening through the lens of what/nis known today in color constancy, describes the d...
ALPS - A LINEAR PROGRAM SOLVER
Viterna, L. A.
1994-01-01
Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.
Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations
DEFF Research Database (Denmark)
Nam, Phan Thanh; Napiorkowski, Marcin; Solovej, Jan Philip
2016-01-01
We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our...
Biomechanical pole and leg characteristics during uphill diagonal roller skiing.
Lindinger, Stefan Josef; Göpfert, Caroline; Stöggl, Thomas; Müller, Erich; Holmberg, Hans-Christer
2009-11-01
Diagonal skiing as a major classical technique has hardly been investigated over the last two decades, although technique and racing velocities have developed substantially. The aims of the present study were to 1) analyse pole and leg kinetics and kinematics during submaximal uphill diagonal roller skiing and 2) identify biomechanical factors related to performance. Twelve elite skiers performed a time to exhaustion (performance) test on a treadmill. Joint kinematics and pole/plantar forces were recorded separately during diagonal roller skiing (9 degrees; 11 km/h). Performance was correlated to cycle length (r = 0.77; P Push-off demonstrated performance correlations for impulse of leg force (r = 0.84), relative duration (r= -0.76) and knee flexion (r = 0.73) and extension ROM (r = 0.74). Relative time to peak pole force was associated with performance (r = 0.73). In summary, diagonal roller skiing performance was linked to 1) longer cycle length, 2) greater impulse of force during a shorter push-off with larger flexion/extension ROMs in leg joints, 3) longer leg swing, and 4) later peak pole force, demonstrating the major key characteristics to be emphasised in training.
Diagonalization of Bounded Linear Operators on Separable Quaternionic Hilbert Space
International Nuclear Information System (INIS)
Feng Youling; Cao, Yang; Wang Haijun
2012-01-01
By using the representation of its complex-conjugate pairs, we have investigated the diagonalization of a bounded linear operator on separable infinite-dimensional right quaternionic Hilbert space. The sufficient condition for diagonalizability of quaternionic operators is derived. The result is applied to anti-Hermitian operators, which is essential for solving Schroedinger equation in quaternionic quantum mechanics.
Diagonal Cracking and Shear Strength of Reinforced Concrete Beams
DEFF Research Database (Denmark)
Zhang, Jin-Ping
1997-01-01
The shear failure of non-shear-reinforced concrete beams with normal shear span ratios is observed to be governed in general by the formation of a critical diagonal crack. Under the hypothesis that the cracking of concrete introduces potential yield lines which may be more dangerous than the ones...
International Nuclear Information System (INIS)
Na, Y. W.; Park, C. E.; Lee, S. Y.
2009-01-01
main object of this work is not to investigate the whole transient behavior of the models at hand but to focus on the behavior of numerical solutions part of the sparse asymmetric matrix equations in the transient of hydraulic system. It is outside of the scope of this work to improve the diagonal dominance or to pre-condition the matrix in the process of differencing and linearizing the governing equation, even though it is better to do it that way before applying the solver if there is any efficient way available
Ferencz, Donald C.; Viterna, Larry A.
1991-01-01
ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.
Exact solutions and ladder operators for a new anharmonic oscillator
International Nuclear Information System (INIS)
Dong Shihai; Sun Guohua; Lozada-Cassou, M.
2005-01-01
In this Letter, we propose a new anharmonic oscillator and present the exact solutions of the Schrodinger equation with this oscillator. The ladder operators are established directly from the normalized radial wave functions and used to evaluate the closed expressions of matrix elements for some related functions. Some comments are made on the general calculation formula and recurrence relation for off-diagonal matrix elements. Finally, we show that this anharmonic oscillator possesses a hidden symmetry between E(r) and E(ir) by substituting r->ir
International Nuclear Information System (INIS)
Raju Viswanathan, R.
1991-09-01
We study examples of one dimensional matrix models whose potentials possess an energy spectrum that can be explicitly determined. This allows for an exact solution in the continuum limit. Specifically, step-like potentials and the Morse potential are considered. The step-like potentials show no scaling behaviour and the Morse potential (which corresponds to a γ = -1 model) has the interesting feature that there are no quantum corrections to the scaling behaviour in the continuum limit. (author). 5 refs
Exact Relativistic `Antigravity' Propulsion
Felber, Franklin S.
2006-01-01
The Schwarzschild solution is used to find the exact relativistic motion of a payload in the gravitational field of a mass moving with constant velocity. At radial approach or recession speeds faster than 3-1/2 times the speed of light, even a small mass gravitationally repels a payload. At relativistic speeds, a suitable mass can quickly propel a heavy payload from rest nearly to the speed of light with negligible stresses on the payload.
Exact approaches for scaffolding
Weller, Mathias; Chateau, Annie; Giroudeau, Rodolphe
2015-01-01
This paper presents new structural and algorithmic results around the scaffolding problem, which occurs prominently in next generation sequencing. The problem can be formalized as an optimization problem on a special graph, the "scaffold graph". We prove that the problem is polynomial if this graph is a tree by providing a dynamic programming algorithm for this case. This algorithm serves as a basis to deduce an exact algorithm for general graphs using a tree decomposition of the input. We ex...
A diagonal address generator for a Josephson memory circuit
International Nuclear Information System (INIS)
Suzuki, H.; Hasuo, S.
1987-01-01
The authors propose that a diagonal D address generator, which is useful for a single flux quantum (SFQ) memory cell in the triple coincidence scheme, can be performed by a full adder circuit. For the purpose of evaluating the D address generator for a 16-kbit memory circuit, a 6-bit full adder circuit, using a current-steering flip-flop circuit, has been designed and fabricated with the lead-alloy process. Operating times for the address latch, carry generator, and sum generator were 150 ps, 250 ps/stage, and 1.4 ns, respectively. From these results, they estimate that the time necessary for the diagonal signal generation is 2.8 ns
Diagonalizing quadratic bosonic operators by non-autonomous flow equations
Bach, Volker
2016-01-01
The authors study a non-autonomous, non-linear evolution equation on the space of operators on a complex Hilbert space. They specify assumptions that ensure the global existence of its solutions and allow them to derive its asymptotics at temporal infinity. They demonstrate that these assumptions are optimal in a suitable sense and more general than those used before. The evolution equation derives from the Brocketâe"Wegner flow that was proposed to diagonalize matrices and operators by a strongly continuous unitary flow. In fact, the solution of the non-linear flow equation leads to a diagonalization of Hamiltonian operators in boson quantum field theory which are quadratic in the field.
A CLT on the SNR of Diagonally Loaded MVDR Filters
Rubio, Francisco; Mestre, Xavier; Hachem, Walid
2012-08-01
This paper studies the fluctuations of the signal-to-noise ratio (SNR) of minimum variance distorsionless response (MVDR) filters implementing diagonal loading in the estimation of the covariance matrix. Previous results in the signal processing literature are generalized and extended by considering both spatially as well as temporarily correlated samples. Specifically, a central limit theorem (CLT) is established for the fluctuations of the SNR of the diagonally loaded MVDR filter, under both supervised and unsupervised training settings in adaptive filtering applications. Our second-order analysis is based on the Nash-Poincar\\'e inequality and the integration by parts formula for Gaussian functionals, as well as classical tools from statistical asymptotic theory. Numerical evaluations validating the accuracy of the CLT confirm the asymptotic Gaussianity of the fluctuations of the SNR of the MVDR filter.
Isovector and flavor-diagonal charges of the nucleon
Gupta, Rajan; Bhattacharya, Tanmoy; Jang, Yong-Chull; Lin, Huey-Wen; Yoon, Boram
2018-03-01
We present an update on the status of the calculations of isovector and flavor-diagonal charges of the nucleon. The calculations of the isovector charges are being done using ten 2+1+1-flavor HISQ ensembles generated by the MILC collaboration covering the range of lattice spacings a ≈ 0.12, 0.09, 0.06 fm and pion masses Mπ ≈ 310, 220, 130 MeV. Excited-states contamination is controlled by using four-state fits to two-point correlators and three-states fits to the three-point correlators. The calculations of the disconnected diagrams needed to estimate flavor-diagonal charges are being done on a subset of six ensembles using the stocastic method. Final results are obtained using a simultaneous fit in M2π, the lattice spacing a and the finite volume parameter MπL keeping only the leading order corrections.
Spectral properties and scaling relations in off diagonally disordered chains
International Nuclear Information System (INIS)
Ure, J.E.; Majlis, N.
1987-07-01
We obtain the localization length L as a function of the energy E and the disorder width W for an off-diagonally disordered chain. This is done performing numerical simulations involving the continued fraction representations of the transfer matrix. The scaling relation L=W s is obtained with values of the exponent s in agreement with calculations of other authors. We also obtain the relation L ∼ |E| v for E → 0, and use it in the Herbert-Spencer-Thouless formula for L to describe the singularity of the density of states near E=0. We show that the slightest diagonal disorder obliterates this singularity. A practical method is presented to calculate the Green function by exploiting its continued fraction expansion. (author). 20 refs, 4 figs
Algorithms for parallel flow solvers on message passing architectures
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
An efficient numerical progressive diagonalization scheme for the quantum Rabi model revisited
International Nuclear Information System (INIS)
Pan, Feng; Bao, Lina; Dai, Lianrong; Draayer, Jerry P
2017-01-01
An efficient numerical progressive diagonalization scheme for the quantum Rabi model is revisited. The advantage of the scheme lies in the fact that the quantum Rabi model can be solved almost exactly by using the scheme that only involves a finite set of one variable polynomial equations. The scheme is especially efficient for a specified eigenstate of the model, for example, the ground state. Some low-lying level energies of the model for several sets of parameters are calculated, of which one set of the results is compared to that obtained from the Braak’s exact solution proposed recently. It is shown that the derivative of the entanglement measure defined in terms of the reduced von Neumann entropy with respect to the coupling parameter does reach the maximum near the critical point deduced from the classical limit of the Dicke model, which may provide a probe of the critical point of the crossover in finite quantum many-body systems, such as that in the quantum Rabi model. (paper)
Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections.
Meek, Garrett A; Levine, Benjamin G
2016-05-14
We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplings at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.
Prepotential approach to exact and quasi-exact solvabilities
International Nuclear Information System (INIS)
Ho, C.-L.
2008-01-01
Exact and quasi-exact solvabilities of the one-dimensional Schroedinger equation are discussed from a unified viewpoint based on the prepotential together with Bethe ansatz equations. This is a constructive approach which gives the potential as well as the eigenfunctions and eigenvalues simultaneously. The novel feature of the present work is the realization that both exact and quasi-exact solvabilities can be solely classified by two integers, the degrees of two polynomials which determine the change of variable and the zeroth order prepotential. Most of the well-known exactly and quasi-exactly solvable models, and many new quasi-exactly solvable ones, can be generated by appropriately choosing the two polynomials. This approach can be easily extended to the constructions of exactly and quasi-exactly solvable Dirac, Pauli, and Fokker-Planck equations
Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications
Sun, Xian-He
1997-01-01
Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm
Lee, Jun Chang; Nam, Kyoung Won; Jang, Dong Pyo; Kim, In Young
2015-12-01
Previously suggested diagonal-steering algorithms for binaural hearing support devices have commonly assumed that the direction of the speech signal is known in advance, which is not always the case in many real circumstances. In this study, a new diagonal-steering-based binaural speech localization (BSL) algorithm is proposed, and the performances of the BSL algorithm and the binaural beamforming algorithm, which integrates the BSL and diagonal-steering algorithms, were evaluated using actual speech-in-noise signals in several simulated listening scenarios. Testing sounds were recorded in a KEMAR mannequin setup and two objective indices, improvements in signal-to-noise ratio (SNRi ) and segmental SNR (segSNRi ), were utilized for performance evaluation. Experimental results demonstrated that the accuracy of the BSL was in the 90-100% range when input SNR was -10 to +5 dB range. The average differences between the γ-adjusted and γ-fixed diagonal-steering algorithms (for -15 to +5 dB input SNR) in the talking in the restaurant scenario were 0.203-0.937 dB for SNRi and 0.052-0.437 dB for segSNRi , and in the listening while car driving scenario, the differences were 0.387-0.835 dB for SNRi and 0.259-1.175 dB for segSNRi . In addition, the average difference between the BSL-turned-on and the BSL-turned-off cases for the binaural beamforming algorithm in the listening while car driving scenario was 1.631-4.246 dB for SNRi and 0.574-2.784 dB for segSNRi . In all testing conditions, the γ-adjusted diagonal-steering and BSL algorithm improved the values of the indices more than the conventional algorithms. The binaural beamforming algorithm, which integrates the proposed BSL and diagonal-steering algorithm, is expected to improve the performance of the binaural hearing support devices in noisy situations. Copyright © 2015 International Center for Artificial Organs and Transplantation and Wiley Periodicals, Inc.
Direct calculation of off-diagonal matrix elements
International Nuclear Information System (INIS)
Killingbeck, J P; Jolicard, G
2011-01-01
Gauss elimination is used in a sequence of calculations which give the squares of the off-diagonal matrix elements of x between quartic oscillator eigenstates, in a modification of the original sum rule approach of Tipping et al to the problem. New and more flexible methods are then devised and tested and are shown to permit the isolation and calculation of individual squared matrix elements of x and x 2 .
Why the South Pacific Convergence Zone is diagonal
Van Der Wiel, Karin; Matthews, Adrian; Joshi, Manoj; Stevens, David
2016-01-01
During austral summer, the majority of precipitation over the Pacific Ocean is concentrated in the South Pacific Convergence Zone (SPCZ). The surface boundary conditions required to support the diagonally (northwest-southeast) oriented SPCZ are determined through a series of experiments with an atmospheric general circulation model. Continental configuration and orography do not have a significant influence on SPCZ orientation and strength. The key necessary boundary condition is the zonally ...
Energy Technology Data Exchange (ETDEWEB)
Catterall, Simon; Kaplan, David B.; Unsal, Mithat
2009-03-31
We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of N = 4 SYM in four dimensions. We discuss approaches based both on twisted supersymmetry and orbifold-deconstruction techniques and show their equivalence in the case of gauge theories. The presence of an exact supersymmetry reduces and in some cases eliminates the need for fine tuning to achieve a continuum limit invariant under the full supersymmetry of the target theory. We discuss open problems.
AbouEisha, Hassan M.
2014-01-01
The problem of attribute reduction is an important problem related to feature selection and knowledge discovery. The problem of finding reducts with minimum cardinality is NP-hard. This paper suggests a new algorithm for finding exact reducts with minimum cardinality. This algorithm transforms the initial table to a decision table of a special kind, apply a set of simplification steps to this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. I present results of computer experiments for a collection of decision tables from UCIML Repository. For many of the experimented tables, the simplification steps solved the problem.
Exact wave packet decoherence dynamics in a discrete spectrum environment
International Nuclear Information System (INIS)
Tu, Matisse W Y; Zhang Weimin
2008-01-01
We find an exact analytical solution of the reduced density matrix from the Feynman-Vernon influence functional theory for a wave packet in an environment containing a few discrete modes. We obtain two intrinsic energy scales relating to the time scales of the system and the environment. The different relationship between these two scales alters the overall form of the solution of the system. We also introduce a decoherence measure for a single wave packet which is defined as the ratio of Schroedinger uncertainty over the delocalization extension of the wave packet and characterizes the time-evolution behaviour of the off-diagonal reduced density matrix element. We utilize the exact solution and the decoherence measure to study the wave packet decoherence dynamics. We further demonstrate how the dynamical diffusion of the wave packet leads to non-Markovian decoherence in such a microscopic environment.
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.
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.
Exact Methods for Solving the Train Departure Matching Problem
DEFF Research Database (Denmark)
Haahr, Jørgen Thorlund; Bull, Simon Henry
In this paper we consider the train departure matching problem which is an important subproblem of the Rolling Stock Unit Management on Railway Sites problem introduced in the ROADEF/EURO Challenge 2014. The subproblem entails matching arriving train units to scheduled departing trains at a railway...... site while respecting multiple physical and operational constraints. In this paper we formally define that subproblem, prove its NP- hardness, and present two exact method approaches for solving the problem. First, we present a compact Mixed Integer Program formulation which we solve using a MIP solver...
DEFF Research Database (Denmark)
Burrello, M.; Fulga, Ion Cosma; Lepori, L.
2017-01-01
of a translational invariant non-Abelian coupling for multi-component spinors does not affect the dimension of the minimal Hamiltonian blocks, nor the dimension of the magnetic Brillouin zone. General formulas are presented for the U(2) case and explicit examples are investigated involving π and 2π/3 magnetic fluxes......We present a general analytical formalism to determine the energy spectrum of a quantum particle in a cubic lattice subject to translationally invariant commensurate magnetic fluxes and in the presence of a general spaceindependent non-Abelian gauge potential. We first review and analyze the case...... of purely Abelian potentials, showing also that the so-called Hasegawa gauge yields a decomposition of the Hamiltonian into sub-matrices having minimal dimension. Explicit expressions for such matrices are derived, also for general anisotropic fluxes. Later on, we show that the introduction...
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.
Cafesat: A modern sat solver for scala
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...
International Nuclear Information System (INIS)
Golden, L.B.
1968-01-01
In atomic structure calculations, one has to evaluate the Slater integrals. In the present program, the authors evaluate exactly the Slater integral when hydrogenic wave functions are used for the bound-state orbitals. When hydrogenic wave functions are used, the Slater integrals involve integrands which can be written in the form of a product of an exponential, exp(ax) and a known analytic polynomial function, f(x). By repeated partial integration such an integral can be expressed in terms of a finite series involving the exponential, the polynomial function and its derivatives. PL/1-FORMAC has a built-in subroutine that will analytically find the derivatives of any multinomial. Thus, the finite series and hence the Slater integral can be evaluated analytically. (Auth.)
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/.
Off-diagonal series expansion for quantum partition functions
Hen, Itay
2018-05-01
We derive an integral-free thermodynamic perturbation series expansion for quantum partition functions which enables an analytical term-by-term calculation of the series. The expansion is carried out around the partition function of the classical component of the Hamiltonian with the expansion parameter being the strength of the off-diagonal, or quantum, portion. To demonstrate the usefulness of the technique we analytically compute to third order the partition functions of the 1D Ising model with longitudinal and transverse fields, and the quantum 1D Heisenberg model.
Exact solution of the one-dimensional Hubbard model with arbitrary boundary magnetic fields
Energy Technology Data Exchange (ETDEWEB)
Li, Yuan-Yuan; Cao, Junpeng [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China); Yang, Wen-Li [Institute of Modern Physics, Northwest University, Xian 710069 (China); Beijing Center for Mathematics and Information Interdisciplinary Sciences, Beijing, 100048 (China); Shi, Kangjie [Institute of Modern Physics, Northwest University, Xian 710069 (China); Wang, Yupeng, E-mail: yupeng@iphy.ac.cn [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China)
2014-02-15
The one-dimensional Hubbard model with arbitrary boundary magnetic fields is solved exactly via the Bethe ansatz methods. With the coordinate Bethe ansatz in the charge sector, the second eigenvalue problem associated with the spin sector is constructed. It is shown that the second eigenvalue problem can be transformed into that of the inhomogeneous XXX spin chain with arbitrary boundary fields which can be solved via the off-diagonal Bethe ansatz method.
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...
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
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...
Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States)
1994-12-31
Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.
Permuting sparse rectangular matrices into block-diagonal form
Energy Technology Data Exchange (ETDEWEB)
Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.
2002-12-09
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.
On the performance of diagonal lattice space-time codes
Abediseid, Walid
2013-11-01
There has been tremendous work done on designing space-time codes for the quasi-static multiple-input multiple output (MIMO) channel. All the coding design up-to-date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria [1]-[9]. In this paper, we analyze in details the performance limits of diagonal lattice space-time codes under lattice decoding. We present both lower and upper bounds on the average decoding error probability. We first derive a new closed-form expression for the lower bound using the so-called sphere lower bound. This bound presents the ultimate performance limit a diagonal lattice space-time code can achieve at any signal-to-noise ratio (SNR). The upper bound is then derived using the union-bound which demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. Combining both the lower and the upper bounds on the average error probability yields a simple upper bound on the the minimum product distance that any (complex) lattice code can achieve. At high-SNR regime, we discuss the outage performance of such codes and provide the achievable diversity-multiplexing tradeoff under lattice decoding. © 2013 IEEE.
Significance of matrix diagonalization in modelling inelastic electron scattering
Energy Technology Data Exchange (ETDEWEB)
Lee, Z. [University of Ulm, Ulm 89081 (Germany); Hambach, R. [University of Ulm, Ulm 89081 (Germany); University of Jena, Jena 07743 (Germany); Kaiser, U.; Rose, H. [University of Ulm, Ulm 89081 (Germany)
2017-04-15
Electron scattering is always applied as one of the routines to investigate nanostructures. Nowadays the development of hardware offers more and more prospect for this technique. For example imaging nanostructures with inelastic scattered electrons may allow to produce component-sensitive images with atomic resolution. Modelling inelastic electron scattering is therefore essential for interpreting these images. The main obstacle to study inelastic scattering problem is its complexity. During inelastic scattering, incident electrons entangle with objects, and the description of this process involves a multidimensional array. Since the simulation usually involves fourdimensional Fourier transforms, the computation is highly inefficient. In this work we have offered one solution to handle the multidimensional problem. By transforming a high dimensional array into twodimensional array, we are able to perform matrix diagonalization and approximate the original multidimensional array with its twodimensional eigenvectors. Our procedure reduces the complicated multidimensional problem to a twodimensional problem. In addition, it minimizes the number of twodimensional problems. This method is very useful for studying multiple inelastic scattering. - Highlights: • 4D problems are involved in modelling inelastic electron scattering. • By means of matrix diagonalization, the 4D problems can be simplified as 2D problems. • The number of 2D problems is minimized by using this approach.
Extending the Finite Domain Solver of GNU Prolog
Bloemen, Vincent; Diaz, Daniel; van der Bijl, Machiel; Abreu, Salvador; Ströder, Thomas; Swift, Terrance
This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, the internal representation of sparse domains has been redesigned to
A fast, high-order solver for the Grad–Shafranov equation
International Nuclear Information System (INIS)
Pataki, Andras; Cerfon, Antoine J.; Freidberg, Jeffrey P.; Greengard, Leslie; O’Neil, Michael
2013-01-01
We present a new fast solver to calculate fixed-boundary plasma equilibria in toroidally axisymmetric geometries. By combining conformal mapping with Fourier and integral equation methods on the unit disk, we show that high-order accuracy can be achieved for the solution of the equilibrium equation and its first and second derivatives. Smooth arbitrary plasma cross-sections as well as arbitrary pressure and poloidal current profiles are used as initial data for the solver. Equilibria with large Shafranov shifts can be computed without difficulty. Spectral convergence is demonstrated by comparing the numerical solution with a known exact analytic solution. A fusion-relevant example of an equilibrium with a pressure pedestal is also presented
Exactly and quasi-exactly solvable 'discrete' quantum mechanics.
Sasaki, Ryu
2011-03-28
A brief introduction to discrete quantum mechanics is given together with the main results on various exactly solvable systems. Namely, the intertwining relations, shape invariance, Heisenberg operator solutions, annihilation/creation operators and dynamical symmetry algebras, including the q-oscillator algebra and the Askey-Wilson algebra. A simple recipe to construct exactly and quasi-exactly solvable (QES) Hamiltonians in one-dimensional 'discrete' quantum mechanics is presented. It reproduces all the known Hamiltonians whose eigenfunctions consist of the Askey scheme of hypergeometric orthogonal polynomials of a continuous or a discrete variable. Several new exactly and QES Hamiltonians are constructed. The sinusoidal coordinate plays an essential role.
Preston, L. A.
2017-12-01
Marine hydrokinetic (MHK) devices offer a clean, renewable alternative energy source for the future. Responsible utilization of MHK devices, however, requires that the effects of acoustic noise produced by these devices on marine life and marine-related human activities be well understood. Paracousti is a 3-D full waveform acoustic modeling suite that can accurately propagate MHK noise signals in the complex bathymetry found in the near-shore to open ocean environment and considers real properties of the seabed, water column, and air-surface interface. However, this is a deterministic simulation that assumes the environment and source are exactly known. In reality, environmental and source characteristics are often only known in a statistical sense. Thus, to fully characterize the expected noise levels within the marine environment, this uncertainty in environmental and source factors should be incorporated into the acoustic simulations. One method is to use Monte Carlo (MC) techniques where simulation results from a large number of deterministic solutions are aggregated to provide statistical properties of the output signal. However, MC methods can be computationally prohibitive since they can require tens of thousands or more simulations to build up an accurate representation of those statistical properties. An alternative method, using the technique of stochastic partial differential equations (SPDE), allows computation of the statistical properties of output signals at a small fraction of the computational cost of MC. We are developing a SPDE solver for the 3-D acoustic wave propagation problem called Paracousti-UQ to help regulators and operators assess the statistical properties of environmental noise produced by MHK devices. In this presentation, we present the SPDE method and compare statistical distributions of simulated acoustic signals in simple models to MC simulations to show the accuracy and efficiency of the SPDE method. Sandia National Laboratories
Kinematic approach to off-diagonal geometric phases of nondegenerate and degenerate mixed states
International Nuclear Information System (INIS)
Tong, D.M.; Oh, C.H.; Sjoeqvist, Erik; Filipp, Stefan; Kwek, L.C.
2005-01-01
Off-diagonal geometric phases have been developed in order to provide information of the geometry of paths that connect noninterfering quantal states. We propose a kinematic approach to off-diagonal geometric phases for pure and mixed states. We further extend the mixed-state concept proposed in [Phys. Rev. Lett. 90, 050403 (2003)] to degenerate density operators. The first- and second-order off-diagonal geometric phases are analyzed for unitarily evolving pairs of pseudopure states
Hopping transport and electrical conductivity in one-dimensional systems with off-diagonal disorder
International Nuclear Information System (INIS)
Ma Songshan; Xu Hui; Li Yanfeng; Song Zhaoquan
2007-01-01
In this paper, we present a model to describe hopping transport and electrical conductivity of one-dimensional systems with off-diagonal disorder, in which electrons are transported via hopping between localized states. We find that off-diagonal disorder leads to delocalization and drastically enhances the electrical conductivity of systems. The model also quantitatively explains the temperature and electrical field dependence of the conductivity in one-dimensional systems with off-diagonal disorder. In addition, we also show the dependence of the conductivity on the strength of off-diagonal disorder
Self-consistent cluster theory for systems with off-diagonal disorder
International Nuclear Information System (INIS)
Kaplan, T.; Leath, P.L.; Gray, L.J.; Diehl, H.W.
1980-01-01
A self-consistent cluster theory for elementary excitations in systems with diagonal, off-diagonal, and environmental disorder is presented. The theory is developed in augmented space where the configurational average over the disorder is replaced by a ground-state matrix element in a translationally invariant system. The analyticity of the resulting approximate Green's function is proved. Numerical results for the self-consistent single-site and pair approximations are presented for the vibrational and electronic properties of disordered linear chains with diagonal, off-diagonal, and environmental disorder
AQUASOL: An efficient solver for the dipolar Poisson-Boltzmann-Langevin equation.
Koehl, Patrice; Delarue, Marc
2010-02-14
solver. While both methods are not guaranteed to converge, numerical evidences suggest that they do and that their convergence is also superlinear. Both variants are significantly faster than the solver based on the exact Jacobian, with a much smaller memory footprint. All three methods have been implemented in a new code named AQUASOL, which is freely available.
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...
Mathematical programming solver based on local search
Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain
2014-01-01
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...
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.
Diagonal ordering operation technique applied to Morse oscillator
Energy Technology Data Exchange (ETDEWEB)
Popov, Dušan, E-mail: dusan_popov@yahoo.co.uk [Politehnica University Timisoara, Department of Physical Foundations of Engineering, Bd. V. Parvan No. 2, 300223 Timisoara (Romania); Dong, Shi-Hai [CIDETEC, Instituto Politecnico Nacional, Unidad Profesional Adolfo Lopez Mateos, Mexico D.F. 07700 (Mexico); Popov, Miodrag [Politehnica University Timisoara, Department of Steel Structures and Building Mechanics, Traian Lalescu Street, No. 2/A, 300223 Timisoara (Romania)
2015-11-15
We generalize the technique called as the integration within a normally ordered product (IWOP) of operators referring to the creation and annihilation operators of the harmonic oscillator coherent states to a new operatorial approach, i.e. the diagonal ordering operation technique (DOOT) about the calculations connected with the normally ordered product of generalized creation and annihilation operators that generate the generalized hypergeometric coherent states. We apply this technique to the coherent states of the Morse oscillator including the mixed (thermal) state case and get the well-known results achieved by other methods in the corresponding coherent state representation. Also, in the last section we construct the coherent states for the continuous dynamics of the Morse oscillator by using two new methods: the discrete–continuous limit, respectively by solving a finite difference equation. Finally, we construct the coherent states corresponding to the whole Morse spectrum (discrete plus continuous) and demonstrate their properties according the Klauder’s prescriptions.
Performance Study of Diagonally Segmented Piezoelectric Vibration Energy Harvester
Energy Technology Data Exchange (ETDEWEB)
Kim, Jae Eun [Catholic Univ. of Daegu, Daegu (Korea, Republic of)
2013-08-15
This study proposes a piezoelectric vibration energy harvester composed of two diagonally segmented energy harvesting units. An auxiliary structural unit is attached to the tip of a host structural unit cantilevered to a vibrating base, where the two components have beam axes in opposite directions from each other and matched short-circuit resonant frequencies. Contrary to the usual observations in two resonant frequency-matched structures, the proposed structure shows little eigenfrequency separation and yields a mode sequence change between the first two modes. These lead to maximum power generation around a specific frequency. By using commercial finite element software, it is shown that the magnitude of the output power from the proposed vibration energy harvester can be substantially improved in comparison with those from conventional cantilevered energy harvesters with the same footprint area and magnitude of a tip mass.
The Diagonal Compression Field Method using Circular Fans
DEFF Research Database (Denmark)
Hansen, Thomas
2005-01-01
This paper presents a new design method, which is a modification of the diagonal compression field method, the modification consisting of the introduction of circular fan stress fields. The traditional method does not allow changes of the concrete compression direction throughout a given beam...... if equilibrium is strictly required. This is conservative, since it is not possible fully to utilize the concrete strength in regions with low shear stresses. The larger inclination (the smaller -value) of the uniaxial concrete stress the more transverse shear reinforcement is needed; hence it would be optimal...... if the -value for a given beam could be set to a low value in regions with high shear stresses and thereafter increased in regions with low shear stresses. Thus the shear reinforcement would be reduced and the concrete strength would be utilized in a better way. In the paper it is shown how circular fan stress...
Quantum Glass of Interacting Bosons with Off-Diagonal Disorder
Piekarska, A. M.; Kopeć, T. K.
2018-04-01
We study disordered interacting bosons described by the Bose-Hubbard model with Gaussian-distributed random tunneling amplitudes. It is shown that the off-diagonal disorder induces a spin-glass-like ground state, characterized by randomly frozen quantum-mechanical U(1) phases of bosons. To access criticality, we employ the "n -replica trick," as in the spin-glass theory, and the Trotter-Suzuki method for decomposition of the statistical density operator, along with numerical calculations. The interplay between disorder, quantum, and thermal fluctuations leads to phase diagrams exhibiting a glassy state of bosons, which are studied as a function of model parameters. The considered system may be relevant for quantum simulators of optical-lattice bosons, where the randomness can be introduced in a controlled way. The latter is supported by a proposition of experimental realization of the system in question.
Bott–Kitaev periodic table and the diagonal map
International Nuclear Information System (INIS)
Kennedy, R; Zirnbauer, M R
2015-01-01
Building on the ten-way symmetry classification of disordered fermions, the authors have recently given a homotopy-theoretic proof of Kitaev's ‘periodic table’ for topological insulators and superconductors. The present paper offers an introduction to the physical setting and the mathematical model used. Basic to the proof is the so-called diagonal map, a natural transformation akin to the Bott map of algebraic topology, which increases by one unit both the momentum-space dimension and the symmetry index of translation-invariant ground states of gapped free-fermion systems. This mapping is illustrated here with a few examples of interest. (Based on a talk delivered by the senior author at the Nobel Symposium on ‘New Forms of Matter: Topological Insulators and Superconductors’; Stockholm, 13–15 June, 2014.) (topical article)
Modified conjugate gradient method for diagonalizing large matrices.
Jie, Quanlin; Liu, Dunhuan
2003-11-01
We present an iterative method to diagonalize large matrices. The basic idea is the same as the conjugate gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroducing errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trial vectors, play a similar role as the conjugate gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitable for first principle calculations.
Evolving effective incremental SAT solvers with GP
Bader, Mohamed; Poli, R.
2008-01-01
Hyper-Heuristics could simply be defined as heuristics to choose other heuristics, and it is a way of combining existing heuristics to generate new ones. In a Hyper-Heuristic framework, the framework is used for evolving effective incremental (Inc*) solvers for SAT. We test the evolved heuristics (IncHH) against other known local search heuristics on a variety of benchmark SAT problems.
Asynchronous Parallelization of a CFD Solver
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...
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.
Exact piecewise flat gravitational waves
van de Meent, M.
2011-01-01
We generalize our previous linear result (van de Meent 2011 Class. Quantum Grav 28 075005) in obtaining gravitational waves from our piecewise flat model for gravity in 3+1 dimensions to exact piecewise flat configurations describing exact planar gravitational waves. We show explicitly how to
CONDITIONS FOR EXACT CAVALIERI ESTIMATION
Directory of Open Access Journals (Sweden)
Mónica Tinajero-Bravo
2014-03-01
Full Text Available Exact Cavalieri estimation amounts to zero variance estimation of an integral with systematic observations along a sampling axis. A sufficient condition is given, both in the continuous and the discrete cases, for exact Cavalieri sampling. The conclusions suggest improvements on the current stereological application of fractionator-type sampling.
Ke, Rihuan; Ng, Michael K.; Sun, Hai-Wei
2015-12-01
In this paper, we study the block lower triangular Toeplitz-like with tri-diagonal blocks system which arises from the time-fractional partial differential equation. Existing fast numerical solver (e.g., fast approximate inversion method) cannot handle such linear system as the main diagonal blocks are different. The main contribution of this paper is to propose a fast direct method for solving this linear system, and to illustrate that the proposed method is much faster than the classical block forward substitution method for solving this linear system. Our idea is based on the divide-and-conquer strategy and together with the fast Fourier transforms for calculating Toeplitz matrix-vector multiplication. The complexity needs O (MNlog2 M) arithmetic operations, where M is the number of blocks (the number of time steps) in the system and N is the size (number of spatial grid points) of each block. Numerical examples from the finite difference discretization of time-fractional partial differential equations are also given to demonstrate the efficiency of the proposed method.
Parallel preconditioning techniques for sparse CG solvers
Energy Technology Data Exchange (ETDEWEB)
Basermann, A.; Reichel, B.; Schelthoff, C. [Central Institute for Applied Mathematics, Juelich (Germany)
1996-12-31
Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial differential equations. The large size and the condition of many technical or physical applications in this area result in the need for efficient parallelization and preconditioning techniques of the CG method. In particular for very ill-conditioned matrices, sophisticated preconditioner are necessary to obtain both acceptable convergence and accuracy of CG. Here, we investigate variants of polynomial and incomplete Cholesky preconditioners that markedly reduce the iterations of the simply diagonally scaled CG and are shown to be well suited for massively parallel machines.
Advanced features of the fault tree solver FTREX
International Nuclear Information System (INIS)
Jung, Woo Sik; Han, Sang Hoon; Ha, Jae Joo
2005-01-01
This paper presents advanced features of a fault tree solver FTREX (Fault Tree Reliability Evaluation eXpert). Fault tree analysis is one of the most commonly used methods for the safety analysis of industrial systems especially for the probabilistic safety analysis (PSA) of nuclear power plants. Fault trees are solved by the classical Boolean algebra, conventional Binary Decision Diagram (BDD) algorithm, coherent BDD algorithm, and Bayesian networks. FTREX could optionally solve fault trees by the conventional BDD algorithm or the coherent BDD algorithm and could convert the fault trees into the form of the Bayesian networks. The algorithm based on the classical Boolean algebra solves a fault tree and generates MCSs. The conventional BDD algorithm generates a BDD structure of the top event and calculates the exact top event probability. The BDD structure is a factorized form of the prime implicants. The MCSs of the top event could be extracted by reducing the prime implicants in the BDD structure. The coherent BDD algorithm is developed to overcome the shortcomings of the conventional BDD algorithm such as the huge memory requirements and a long run time
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.
Quasi-exact evaluation of time domain MFIE MOT matrix elements
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.
Quasi-exact evaluation of time domain MFIE MOT matrix elements
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.
Diagonalization of quark mass matrices and the Cabibbo-Kobayashi-Maskawa matrix
International Nuclear Information System (INIS)
Rasin, A.
1997-08-01
I discuss some general aspect of diagonalizing the quark mass matrices and list all possible parametrizations of the Cabibbo-Kobayashi-Maskawa matrix (CKM) in terms of three rotation angles and a phase. I systematically study the relation between the rotations needed to diagonalize the Yukawa matrices and various parametrizations of the CKM. (author). 17 refs, 1 tab
Diagonalization and Jordan Normal Form--Motivation through "Maple"[R
Glaister, P.
2009-01-01
Following an introduction to the diagonalization of matrices, one of the more difficult topics for students to grasp in linear algebra is the concept of Jordan normal form. In this note, we show how the important notions of diagonalization and Jordan normal form can be introduced and developed through the use of the computer algebra package…
Chaos in non-diagonal spatially homogeneous cosmological models in spacetime dimensions <=10
Demaret, Jacques; de Rop, Yves; Henneaux, Marc
1988-08-01
It is shown that the chaotic oscillatory behaviour, absent in diagonal homogeneous cosmological models in spacetime dimensions between 5 and 10, can be reestablished when off-diagonal terms are included. Also at Centro de Estudios Cientificos de Santiago, Casilla 16443, Santiago 9, Chile
Iterative algorithm for joint zero diagonalization with application in blind source separation.
Zhang, Wei-Tao; Lou, Shun-Tian
2011-07-01
A new iterative algorithm for the nonunitary joint zero diagonalization of a set of matrices is proposed for blind source separation applications. On one hand, since the zero diagonalizer of the proposed algorithm is constructed iteratively by successive multiplications of an invertible matrix, the singular solutions that occur in the existing nonunitary iterative algorithms are naturally avoided. On the other hand, compared to the algebraic method for joint zero diagonalization, the proposed algorithm requires fewer matrices to be zero diagonalized to yield even better performance. The extension of the algorithm to the complex and nonsquare mixing cases is also addressed. Numerical simulations on both synthetic data and blind source separation using time-frequency distributions illustrate the performance of the algorithm and provide a comparison to the leading joint zero diagonalization schemes.
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.
Exact Riemann solutions of the Ripa model for flat and non-flat bottom topographies
Rehman, Asad; Ali, Ishtiaq; Qamar, Shamsul
2018-03-01
This article is concerned with the derivation of exact Riemann solutions for Ripa model considering flat and non-flat bottom topographies. The Ripa model is a system of shallow water equations accounting for horizontal temperature gradients. In the case of non-flat bottom topography, the mass, momentum and energy conservation principles are utilized to relate the left and right states across the step-type bottom topography. The resulting system of algebraic equations is solved iteratively. Different numerical case studies of physical interest are considered. The solutions obtained from developed exact Riemann solvers are compared with the approximate solutions of central upwind scheme.
Exact cosmological solutions for MOG
International Nuclear Information System (INIS)
Roshan, Mahmood
2015-01-01
We find some new exact cosmological solutions for the covariant scalar-tensor-vector gravity theory, the so-called modified gravity (MOG). The exact solution of the vacuum field equations has been derived. Also, for non-vacuum cases we have found some exact solutions with the aid of the Noether symmetry approach. More specifically, the symmetry vector and also the Noether conserved quantity associated to the point-like Lagrangian of the theory have been found. Also we find the exact form of the generic vector field potential of this theory by considering the behavior of the relevant point-like Lagrangian under the infinitesimal generator of the Noether symmetry. Finally, we discuss the cosmological implications of the solutions. (orig.)
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.
New multigrid solver advances in TOPS
International Nuclear Information System (INIS)
Falgout, R D; Brannick, J; Brezina, M; Manteuffel, T; McCormick, S
2005-01-01
In this paper, we highlight new multigrid solver advances in the Terascale Optimal PDE Simulations (TOPS) project in the Scientific Discovery Through Advanced Computing (SciDAC) program. We discuss two new algebraic multigrid (AMG) developments in TOPS: the adaptive smoothed aggregation method (αSA) and a coarse-grid selection algorithm based on compatible relaxation (CR). The αSA method is showing promising results in initial studies for Quantum Chromodynamics (QCD) applications. The CR method has the potential to greatly improve the applicability of AMG
Metaheuristics progress as real problem solvers
Nonobe, Koji; Yagiura, Mutsunori
2005-01-01
Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.
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 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 diagonal approach for the catalytic transformation of carbon dioxide
International Nuclear Information System (INIS)
Gomes, Christophe
2013-01-01
Emissions of carbon dioxide are growing with the massive utilization of hydrocarbons for the production of energy and chemicals, resulting in a threatening global warming. The development of a more sustainable economy is urging to reduce the fingerprint of our current way of life. In this perspective, the organic chemistry industry will face important challenges in the next decades to replace hydrocarbons as a feedstock and use carbon-free energy sources. To tackle this challenge, new catalytic processes have been designed to convert CO 2 to high energy and value-added chemicals (formamides, N-heterocycles and methanol), using a novel diagonal approach. The energy efficiency of the new transformations is ensured by the utilization of mild reductants such as hydro-silanes and hydro-boranes. Importantly the reactions are promoted by organic catalysts, which circumvent the problems of cost, abundance and toxicity usually encountered with metal complexes. Based on theoretical and experimental studies, the understanding of the mechanisms involved in these reactions allowed the rational optimization of the catalysts as well as the reaction conditions, in order to match the requirements of sustainable chemistry. (author) [fr
Nuclear fuel rod grip with modified diagonal spring structures
International Nuclear Information System (INIS)
DeMario, E.E.
1990-01-01
This patent describes a spring structure in a nuclear fuel rod grid including a plurality of inner and outer straps being interleaved with one another to form a matrix of hollow cells. Each of the cells is for receiving one fuel rod and being defined by pairs of opposing wall sections of the straps which wall sections are shared with adjacent cells. Each of the cells has a central longitudinal axis, a fuel rod engaging spring structure of resiliently yieldable material being integrally formed on each wall section of the inner straps. The spring structure comprising: a pair of spaced apart opposite outer portions being integrally attached at their outer ends to the respective wall section. The portions extending in alignment with one another and in generally diagonal relation to the direction of the central longitudinal axis of the one cell; and a middle portion disposed between and integrally connected at its outer ends with respective inner ends of the outer portions. The middle portion extending in generally transverse relation to the direction of the central longitudinal axis of the one cell
Separability of diagonal symmetric states: a quadratic conic optimization problem
Directory of Open Access Journals (Sweden)
Jordi Tura
2018-01-01
Full Text Available We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS states. First, we show that separability in the case of DS in $C^d\\otimes C^d$ (symmetric qudits can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT is sufficient and necessary for separability of DS states for $d \\leq 4$. Furthermore, for $d \\geq 5$, we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus on $N$-partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.
Improvement of child survival in Mexico: the diagonal approach.
Sepúlveda, Jaime; Bustreo, Flavia; Tapia, Roberto; Rivera, Juan; Lozano, Rafael; Oláiz, Gustavo; Partida, Virgilio; García-García, Lourdes; Valdespino, José Luis
2006-12-02
Public health interventions aimed at children in Mexico have placed the country among the seven countries on track to achieve the goal of child mortality reduction by 2015. We analysed census data, mortality registries, the nominal registry of children, national nutrition surveys, and explored temporal association and biological plausibility to explain the reduction of child, infant, and neonatal mortality rates. During the past 25 years, child mortality rates declined from 64 to 23 per 1000 livebirths. A dramatic decline in diarrhoea mortality rates was recorded. Polio, diphtheria, and measles were eliminated. Nutritional status of children improved significantly for wasting, stunting, and underweight. A selection of highly cost-effective interventions bridging clinics and homes, what we called the diagonal approach, were central to this progress. Although a causal link to the reduction of child mortality was not possible to establish, we saw evidence of temporal association and biological plausibility to the high level of coverage of public health interventions, as well as significant association to the investments in women education, social protection, water, and sanitation. Leadership and continuity of public health policies, along with investments on institutions and human resources strengthening, were also among the reasons for these achievements.
[Improvement of child survival in Mexico: the diagonal approach].
Sepúlveda, Jaime; Bustreo, Flavia; Tapia, Roberto; Rivera, Juan; Lozano, Rafael; Olaiz, Gustavo; Partida, Virgilio; García-García, Ma de Lourdes; Valdespino, José Luis
2007-01-01
Public health interventions aimed at children in Mexico have placed the country among the seven countries on track to achieve the goal of child mortality reduction by 2015. We analysed census data, mortality registries, the nominal registry of children, national nutrition surveys, and explored temporal association and biological plausibility to explain the reduction of child, infant, and neonatal mortality rates. During the past 25 years, child mortality rates declined from 64 to 23 per 1000 livebirths. A dramatic decline in diarrhoea mortality rates was recorded. Polio, diphtheria, and measles were eliminated. Nutritional status of children improved significantly for wasting, stunting, and underweight. A selection of highly cost-effective interventions bridging clinics and homes, what we called the diagonal approach, were central to this progress. Although a causal link to the reduction of child mortality was not possible to establish, we saw evidence of temporal association and biological plausibility to the high level of coverage of public health interventions, as well as significant association to the investments in women education, social protection, water, and sanitation. Leadership and continuity of public health policies, along with investments on institutions and human resources strengthening, were also among the reasons for these achievements.
Power take-off analysis for diagonally connected MHD channels
International Nuclear Information System (INIS)
Pan, Y.C.; Doss, E.D.
1980-01-01
The electrical loading of the power take-off region of diagonally connected MHD channels is investigated by a two-dimensional model. The study examines the loading schemes typical of those proposed for the U-25 and U-25 Bypass channels. The model is applicable for the following four cases: (1) connection with diodes only, (2) connection with diodes and equal resistors, (3) connection with diodes and variable resistances to obtain a given current distribution, and (4) connection with diodes and variable resistors under changing load. The analysis is applicable for the power take-off regions of single or multiple-output systems. The general behaviors of the current and the potential distributions in all four cases are discussed. The analytical results are in good agreement with the experimental data. It is found possible to design the electrical circuit of the channel in the take-off region so as to achieve a fairly even load current output under changing total load current
A new algorithm of the coupled solver for an incompressible flow
International Nuclear Information System (INIS)
Morii, Tadashi; Akamatsu, Mikio
2009-01-01
Verification and Validation (V and V) of CFD results is the key issue on applying CFD to nuclear reactor safety that needs high reliability of calculated results. Those include quantification of uncertainty by grid convergence studies (verification) and comparison with experiments (validation). The task for the systematic refinement of the grid size to demonstrate grid convergence of CFD results demands a large amount of computer resources because the calculation time tends to increase drastically with an increase of the number of the grid points. The segregated method employed by almost all commercial codes has the drawback that the iterations required for convergence are strongly dependent on the number of grid points. Since a decoupling between the momentum and continuity equations is attributed to the drawback, the coupled solution method in which the momentum and continuity equations are solved simultaneously can be an effective alternative to the segregated method. In fact, the coupled solution method has the preferable characteristics for iteration, which is little dependence on the number of grid points and requires no relaxation factors. However, the coefficient matrix of the coupled linear equation has a notable feature that the diagonal elements corresponding to the continuity are zero. In order to employ the iterative method for matrix solver such as the SOR and ICCG, preconditioning of the coefficient matrix of the original coupled linear equation is required. Constructing preconditioners has been and remains a most active area of research, and nevertheless no single 'best' method exists. Considering this issue from the physical viewpoint of the fluid dynamics, the new method SOAR has been developed to avoid the zero diagonal problem by replacing the real velocity field with newly defined artificial velocity field. This paper described to extend the SOAR to be applied to a wide range of flow encountered in nuclear reactor safety problems. (author)
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
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
Beck, Joakim
2018-02-28
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A sparse version of IGA solvers
Beck, Joakim
2017-07-30
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A sparse-grid isogeometric solver
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 version of IGA solvers
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.
Riemann solvers for multi-component gas mixtures with temperature dependent heat capacities
International Nuclear Information System (INIS)
Beccantini, A.
2001-01-01
This thesis represents a contribution to the development of upwind splitting schemes for the Euler equations for ideal gaseous mixtures and their investigation in computing multidimensional flows in irregular geometries. In the preliminary part we develop and investigate the parameterization of the shock and rarefaction curves in the phase space. Then, we apply them to perform some field-by-field decompositions of the Riemann problem: the entropy-respecting one, the one which supposes that genuinely-non-linear (GNL) waves are both shocks (shock-shock one) and the one which supposes that GNL waves are both rarefactions (rarefaction-rarefaction one). We emphasize that their analysis is fundamental in Riemann solvers developing: the simpler the field-by-field decomposition, the simpler the Riemann solver based on it. As the specific heat capacities of the gases depend on the temperature, the shock-shock field-by-field decomposition is the easiest to perform. Then, in the second part of the thesis, we develop an upwind splitting scheme based on such decomposition. Afterwards, we investigate its robustness, precision and CPU-time consumption, with respect to some of the most popular upwind splitting schemes for polytropic/non-polytropic ideal gases. 1-D test-cases show that this scheme is both precise (exact capturing of stationary shock and stationary contact) and robust in dealing with strong shock and rarefaction waves. Multidimensional test-cases show that it suffers from some of the typical deficiencies which affect the upwind splitting schemes capable of exact capturing stationary contact discontinuities i.e the developing of non-physical instabilities in computing strong shock waves. In the final part, we use the high-order multidimensional solver here developed to compute fully-developed detonation flows. (author)
Exact results for the spectra of bosons and fermions with contact interaction
Energy Technology Data Exchange (ETDEWEB)
Mashkevich, Stefan [Schroedinger, 120 West 45th St., New York, NY 10036 (United States)]. E-mail: mash@mashke.org; Matveenko, Sergey [Landau Institute for Theoretical Physics, Kosygina Str. 2, 119334 Moscow (Russian Federation)]. E-mail: matveen@landau.ac.ru; Ouvry, Stephane [Laboratoire de Physique Theorique et Modeles Statistiques, Unite de Recherche de l' Universite Paris 11 associee au CNRS, UMR 8626., Bat. 100, Universite Paris-Sud, 91405 Orsay (France)]. E-mail: ouvry@lptms.u-psud.fr
2007-02-19
An N-body bosonic model with delta-contact interactions projected on the lowest Landau level is considered. For a given number of particles in a given angular momentum sector, any energy level can be obtained exactly by means of diagonalizing a finite matrix: they are roots of algebraic equations. A complete solution of the three-body problem is presented, some general properties of the N-body spectrum are pointed out, and a number of novel exact analytic eigenstates are obtained. The FQHE N-fermion model with Laplacian-delta interactions is also considered along the same lines of analysis. New exact eigenstates are proposed, along with the Slater determinant, whose eigenvalues are shown to be related to Catalan numbers.
Comparative study on diagonal equivalent methods of masonry infill panel
Amalia, Aniendhita Rizki; Iranata, Data
2017-06-01
ratio of height to width of 1 to 1.5. Load used in the experiment was based on Uniform Building Code (UBC) 1991. Every method compared was calculated first to get equivalent diagonal strut width. The second step was modelling method using structure analysis software as a frame with a diagonal in a linear mode. The linear mode was chosen based on structure analysis commonly used by structure designers. The frame was loaded and for every model, its load and deformation values were identified. The values of load - deformation of every method were compared to those of experimental test specimen by Mehrabi and open frame. From comparative study performed, Holmes' and Bazan-Meli's equations gave results the closest to the experimental test specimen by Mehrabi. Other equations that gave close values within the limit (by comparing it to the open frame) are Saneinejad-Hobbs, Stafford-Smith, Bazan-Meli, Liauw Kwan, Paulay and Priestley, FEMA 356, Durani Luo, Hendry, Papia and Chen-Iranata.
Diagonal earlobe crease: Prevalence and association with medical ailments
Directory of Open Access Journals (Sweden)
Yugantara Ramesh Kadam
2018-01-01
Full Text Available Context: It has been hypothesized that diagonal earlobe crease (DELC, “Frank's sign” is indicative of coronary artery disease (CAD and/or diabetes mellitus (DM. Several studies have confirmed an association between DELC and cardiac morbidity, mortality, and hypertension (HTN. However, some studies have not found any significant association. Aims: This study aims to find out the prevalence of DELC and its association with CAD, DM, and HTN. Settings and Design: Sangli-Miraj-Kupwad Corporation area. This was a cross-sectional analytical study. Subjects and Methods: Study participants: Adults from 18 to 60 years age. Inclusion criteria: willing to participate in the study Exclusion criteria: Wearing heavy ear rings and excessive normal generalized wrinkling of the skin. Sample size: Sample size 6310, determined after a pilot study revealing DELC in 1.5%. Sampling technique: Two-stage cluster sampling. Duration of study: 6 months. Study tools: Predesigned, pilot tested pro forma. Statistical Analysis: Statistical analysis was done by using SPSS 22 software. Prevalence and percentages were calculated, and Chi-square test was applied. Results: Out of 6638 participants, 179 had DELC. The prevalence of bilateral DELC was 2.7%. The prevalence was significantly high among males (4.13% and in the 51–60 years age group (5.29%. The prevalence of Grade 3 DELC was high and 91% of young adults had Grade 3 DELC. There were 408 (6.15% participants who gave a history of CAD, 827 (12.46% of DM, and 670 (10.09% HTN. Significantly high association observed between DELC and CAD, DM, and HTN. CAD, DM, and HTN were significantly associated with Grade 3. Conclusions: The prevalence of bilateral DELC was 2.7% and is significantly associated with CAD, DM, and HTN.
Exact analysis of discrete data
Hirji, Karim F
2005-01-01
Researchers in fields ranging from biology and medicine to the social sciences, law, and economics regularly encounter variables that are discrete or categorical in nature. While there is no dearth of books on the analysis and interpretation of such data, these generally focus on large sample methods. When sample sizes are not large or the data are otherwise sparse, exact methods--methods not based on asymptotic theory--are more accurate and therefore preferable.This book introduces the statistical theory, analysis methods, and computation techniques for exact analysis of discrete data. After reviewing the relevant discrete distributions, the author develops the exact methods from the ground up in a conceptually integrated manner. The topics covered range from univariate discrete data analysis, a single and several 2 x 2 tables, a single and several 2 x K tables, incidence density and inverse sampling designs, unmatched and matched case -control studies, paired binary and trinomial response models, and Markov...
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...
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.
Exact vacuum polarization in 1 + 1 dimensional finite nuclei
International Nuclear Information System (INIS)
Ferree, T.C.
1992-01-01
There is considerable interest in the use of renormalizable quantum field theories to describe nuclear structure. In particular, theories which employ hadronic degrees of freedom are used widely and lead to efficient models which allow self-consistent solutions of the many-body problem. An interesting feature inherent to relativistic field theories (like QHD) is the presence of an infinite sea of negative energy fermion (nucleon) states, which interact dynamically with positive energy fermions via other fields. Such interactions give rise to, for example, vacuum polarization effects, in which virtual particle-antiparticle pairs interact with positive energy valence nucleons as well as with each other, and can significantly influence the ground and excited states of nuclear systems. Several authors have addressed this question in various approximations for finite nuclei, mostly based on extensions of results derived for a uniform system of nucleons. Some attempts have also been made to include vacuum effects in finite systems exactly, but the presence of a vector potential can be problematic when working in a spectral representation. In this paper, the author presents a computational method by which vacuum polarization effects in finite nuclei can be calculated exactly in the RHA by employing matrix diagonalization methods in a discrete Fourier representation of the Dirac equation, and an approximate method for including deep negative energy states based on a derivative expansion of the effective action. This efficient approach is shown to provide well-behaved vacuum polarization densities which remain so even in the presence of strong vector potential
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
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...
Optimising a parallel conjugate gradient solver
Energy Technology Data Exchange (ETDEWEB)
Field, M.R. [O`Reilly Institute, Dublin (Ireland)
1996-12-31
This work arises from the introduction of a parallel iterative solver to a large structural analysis finite element code. The code is called FEX and it was developed at Hitachi`s Mechanical Engineering Laboratory. The FEX package can deal with a large range of structural analysis problems using a large number of finite element techniques. FEX can solve either stress or thermal analysis problems of a range of different types from plane stress to a full three-dimensional model. These problems can consist of a number of different materials which can be modelled by a range of material models. The structure being modelled can have the load applied at either a point or a surface, or by a pressure, a centrifugal force or just gravity. Alternatively a thermal load can be applied with a given initial temperature. The displacement of the structure can be constrained by having a fixed boundary or by prescribing the displacement at a boundary.
Exact solitary waves of the Fisher equation
International Nuclear Information System (INIS)
Kudryashov, Nikolai A.
2005-01-01
New method is presented to search exact solutions of nonlinear differential equations. This approach is used to look for exact solutions of the Fisher equation. New exact solitary waves of the Fisher equation are given
Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.
2009-01-01
We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by
Localization for off-diagonal disorder and for continuous Schroedinger operators
International Nuclear Information System (INIS)
Delyon, F.; Souillard, B.; Simon, B.
1987-01-01
We extend the proof of localization by Delyon, Levy, and Souillard to accommodate the Anderson model with off-diagonal disorder and the continuous Schroedinger equation with a random potential. (orig.)
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)
Algebraic aspects of exact models
International Nuclear Information System (INIS)
Gaudin, M.
1983-01-01
Spin chains, 2-D spin lattices, chemical crystals, and particles in delta function interaction share the same underlying structures: the applicability of Bethe's superposition ansatz for wave functions, the commutativity of transfer matrices, and the existence of a ternary operator algebra. The appearance of these structures and interrelations from the eight vortex model, for delta function interreacting particles of general spin, and for spin 1/2, are outlined as follows: I. Eight Vortex Model. Equivalences to Ising model and the dimer system. Transfer matrix and symmetry of the Self Conjugate model. Relation between the XYZ Hamiltonian and the transfer matrix. One parameter family of commuting transfer matrices. A representation of the symmetric group spin. Diagonalization of the transfer matrix. The Coupled Spectrum equations. II. Identical particles with Delta Function interaction. The Bethe ansatz. Yang's representation. The Ternary Algebra and intergrability. III. Identical particles with delta function interaction: general solution for two internal states. The problem of spin 1/2 fermions. The Operator method
Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María
2014-06-01
We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the
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.
Quantum speed limits for Bell-diagonal states
International Nuclear Information System (INIS)
Han Wei; Jiang Ke-Xia; Zhang Ying-Jie; Xia Yun-Jie
2015-01-01
The lower bounds of the evolution time between two distinguishable states of a system, defined as quantum speed limit time, can characterize the maximal speed of quantum computers and communication channels. We study the quantum speed limit time between the composite quantum states and their target states in the presence of nondissipative decoherence. For the initial states with maximally mixed marginals, we obtain the exact expressions of the quantum speed limit time which mainly depend on the parameters of the initial states and the decoherence channels. Furthermore, by calculating the quantum speed limit time for the time-dependent states started from a class of initial states, we discover that the quantum speed limit time gradually decreases in time, and the decay rate of the quantum speed limit time would show a sudden change at a certain critical time. Interestingly, at the same critical time, the composite system dynamics would exhibit a sudden transition from classical decoherence to quantum decoherence. (paper)
Exact models for isotropic matter
Thirukkanesh, S.; Maharaj, S. D.
2006-04-01
We study the Einstein-Maxwell system of equations in spherically symmetric gravitational fields for static interior spacetimes. The condition for pressure isotropy is reduced to a recurrence equation with variable, rational coefficients. We demonstrate that this difference equation can be solved in general using mathematical induction. Consequently, we can find an explicit exact solution to the Einstein-Maxwell field equations. The metric functions, energy density, pressure and the electric field intensity can be found explicitly. Our result contains models found previously, including the neutron star model of Durgapal and Bannerji. By placing restrictions on parameters arising in the general series, we show that the series terminate and there exist two linearly independent solutions. Consequently, it is possible to find exact solutions in terms of elementary functions, namely polynomials and algebraic functions.
Exact solutions to quadratic gravity
Czech Academy of Sciences Publication Activity Database
Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.
2017-01-01
Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals.aps.org/prd/abstract/10.1103/PhysRevD.95.084025
Exact solutions to quadratic gravity
Czech Academy of Sciences Publication Activity Database
Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.
2017-01-01
Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals. aps .org/prd/abstract/10.1103/PhysRevD.95.084025
Learning Domain-Specific Heuristics for Answer Set Solvers
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...
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)
Criteria for exact qudit universality
International Nuclear Information System (INIS)
Brennen, Gavin K.; O'Leary, Dianne P.; Bullock, Stephen S.
2005-01-01
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states vertical bar 0>, vertical bar 1>, ..., vertical bar d-1>. An important earlier work [A. Muthukrishnan and C.R. Stroud, Jr., Phys. Rev. A 62, 052309 (2000)] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the QR-matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of H jk x =(ℎ/2π)Ω(vertical bar k> jk y =(ℎ/2π)Ω(i vertical bar k> jk x,y are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian H=(ℎ/2π)Ω vertical bar d-1,d-1> 87 Rb and construct an optimal gate sequence using Raman laser pulses
Measurement of off-diagonal transport coefficients in two-phase flow in porous media.
Ramakrishnan, T S; Goode, P A
2015-07-01
The prevalent description of low capillary number two-phase flow in porous media relies on the independence of phase transport. An extended Darcy's law with a saturation dependent effective permeability is used for each phase. The driving force for each phase is given by its pressure gradient and the body force. This diagonally dominant form neglects momentum transfer from one phase to the other. Numerical and analytical modeling in regular geometries have however shown that while this approximation is simple and acceptable in some cases, many practical problems require inclusion of momentum transfer across the interface. Its inclusion leads to a generalized form of extended Darcy's law in which both the diagonal relative permeabilities and the off-diagonal terms depend not only on saturation but also on the viscosity ratio. Analogous to application of thermodynamics to dynamical systems, any of the extended forms of Darcy's law assumes quasi-static interfaces of fluids for describing displacement problems. Despite the importance of the permeability coefficients in oil recovery, soil moisture transport, contaminant removal, etc., direct measurements to infer the magnitude of the off-diagonal coefficients have been lacking. The published data based on cocurrent and countercurrent displacement experiments are necessarily indirect. In this paper, we propose a null experiment to measure the off-diagonal term directly. For a given non-wetting phase pressure-gradient, the null method is based on measuring a counter pressure drop in the wetting phase required to maintain a zero flux. The ratio of the off-diagonal coefficient to the wetting phase diagonal coefficient (relative permeability) may then be determined. The apparatus is described in detail, along with the results obtained. We demonstrate the validity of the experimental results and conclude the paper by comparing experimental data to numerical simulation. Copyright © 2015 Elsevier Inc. All rights reserved.
Refined isogeometric analysis for a preconditioned conjugate gradient solver
Garcia, Daniel; Pardo, D.; Dalcin, Lisandro; Calo, Victor M.
2018-01-01
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
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
Resolving Neighbourhood Relations in a Parallel Fluid Dynamic Solver
Frisch, Jerome; Mundani, Ralf-Peter; Rank, Ernst
2012-01-01
solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on different processes. A special server concept keeps track of every grid over all processes while
Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation
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
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 Python interface to Diffpack-based classes and solvers
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...
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
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.
BeamDyn: A High-Fidelity Wind Turbine Blade Solver in the FAST Modular Framework: Preprint
Energy Technology Data Exchange (ETDEWEB)
Wang, Q.; Sprague, M.; Jonkman, J.; Johnson, N.
2015-01-01
BeamDyn, a Legendre-spectral-finite-element implementation of geometrically exact beam theory (GEBT), was developed to meet the design challenges associated with highly flexible composite wind turbine blades. In this paper, the governing equations of GEBT are reformulated into a nonlinear state-space form to support its coupling within the modular framework of the FAST wind turbine computer-aided engineering (CAE) tool. Different time integration schemes (implicit and explicit) were implemented and examined for wind turbine analysis. Numerical examples are presented to demonstrate the capability of this new beam solver. An example analysis of a realistic wind turbine blade, the CX-100, is also presented as validation.
Anjos, Pedro H. A.; Lira, Sérgio A.; Miranda, José A.
2018-04-01
We examine the formation of interfacial patterns when a magnetic liquid droplet (ferrofluid, or a magnetorheological fluid), surrounded by a nonmagnetic fluid, is subjected to a radial magnetic field in a Hele-Shaw cell. By using a vortex-sheet formalism, we find exact stationary solutions for the fluid-fluid interface in the form of n -fold polygonal shapes. A weakly nonlinear, mode-coupling method is then utilized to find time-evolving perturbative solutions for the interfacial patterns. The stability of such nonzero surface tension exact solutions is checked and discussed, by trying to systematically approach the exact stationary shapes through perturbative solutions containing an increasingly larger number of participating Fourier modes. Our results indicate that the exact stationary solutions of the problem are stable, and that a good matching between exact and perturbative shape solutions is achieved just by using a few Fourier modes. The stability of such solutions is substantiated by a linearization process close to the stationary shape, where a system of mode-coupling equations is diagonalized, determining the eigenvalues which dictate the stability of a fixed point.
Comparing direct and iterative equation solvers in a large structural analysis software system
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.
Energy Technology Data Exchange (ETDEWEB)
Haertle, Rainer [Institut fuer Theoretische Physik, Georg-August-Universitaet Goettingen, Goettingen (Germany); Millis, Andrew J. [Department of Physics, Columbia University, New York (United States)
2016-07-01
We present a new impurity solver for real-time and nonequilibrium dynamical mean field theory applications, based on the recently developed hierarchical quantum master equation approach. Our method employs a hybridization expansion of the time evolution operator, including an advanced, systematic truncation scheme. Convergence to exact results for not too low temperatures has been demonstrated by a direct comparison to quantum Monte Carlo simulations. The approach is time-local, which gives us access to slow dynamics such as, e.g., in the presence of magnetic fields or exchange interactions and to nonequilibrium steady states. Here, we present first results of this new scheme for the description of strongly correlated materials in the framework of dynamical mean field theory, including benchmark and new results for the Hubbard and periodic Anderson model.
A robust multilevel simultaneous eigenvalue solver
Costiner, Sorin; Taasan, Shlomo
1993-01-01
Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.
Fast Solvers for Dense Linear Systems
Energy Technology Data Exchange (ETDEWEB)
Kauers, Manuel [Research Institute for Symbolic Computation (RISC), Altenbergerstrasse 69, A4040 Linz (Austria)
2008-10-15
It appears that large scale calculations in particle physics often require to solve systems of linear equations with rational number coefficients exactly. If classical Gaussian elimination is applied to a dense system, the time needed to solve such a system grows exponentially in the size of the system. In this tutorial paper, we present a standard technique from computer algebra that avoids this exponential growth: homomorphic images. Using this technique, big dense linear systems can be solved in a much more reasonable time than using Gaussian elimination over the rationals.
Exact axially symmetric galactic dynamos
Henriksen, R. N.; Woodfinden, A.; Irwin, J. A.
2018-05-01
We give a selection of exact dynamos in axial symmetry on a galactic scale. These include some steady examples, at least one of which is wholly analytic in terms of simple functions and has been discussed elsewhere. Most solutions are found in terms of special functions, such as associated Lagrange or hypergeometric functions. They may be considered exact in the sense that they are known to any desired accuracy in principle. The new aspect developed here is to present scale-invariant solutions with zero resistivity that are self-similar in time. The time dependence is either a power law or an exponential factor, but since the geometry of the solution is self-similar in time we do not need to fix a time to study it. Several examples are discussed. Our results demonstrate (without the need to invoke any other mechanisms) X-shaped magnetic fields and (axially symmetric) magnetic spiral arms (both of which are well observed and documented) and predict reversing rotation measures in galaxy haloes (now observed in the CHANG-ES sample) as well as the fact that planar magnetic spirals are lifted into the galactic halo.
Directory of Open Access Journals (Sweden)
Arif GÜRAY
2002-01-01
Full Text Available In this work, the diagonal tensile strength of furniture edge joints such as wooden dowel, minifix, and alyan screw was investigated in panel-constructed boards for Suntalam and MDF Lam. For this purpose, a diagonal tensile strength test was applied to the 72 samples. According to the results, the maximum diagonal tensile strength was found to be in MDF Lam boards that jointed with alyan screw.
Multi-subject Manifold Alignment of Functional Network Structures via Joint Diagonalization.
Nenning, Karl-Heinz; Kollndorfer, Kathrin; Schöpf, Veronika; Prayer, Daniela; Langs, Georg
2015-01-01
Functional magnetic resonance imaging group studies rely on the ability to establish correspondence across individuals. This enables location specific comparison of functional brain characteristics. Registration is often based on morphology and does not take variability of functional localization into account. This can lead to a loss of specificity, or confounds when studying diseases. In this paper we propose multi-subject functional registration by manifold alignment via coupled joint diagonalization. The functional network structure of each subject is encoded in a diffusion map, where functional relationships are decoupled from spatial position. Two-step manifold alignment estimates initial correspondences between functionally equivalent regions. Then, coupled joint diagonalization establishes common eigenbases across all individuals, and refines the functional correspondences. We evaluate our approach on fMRI data acquired during a language paradigm. Experiments demonstrate the benefits in matching accuracy achieved by coupled joint diagonalization compared to previously proposed functional alignment approaches, or alignment based on structural correspondences.
Noble, J. H.; Lubasch, M.; Stevens, J.; Jentschura, U. D.
2017-12-01
We describe a matrix diagonalization algorithm for complex symmetric (not Hermitian) matrices, A ̲ =A̲T, which is based on a two-step algorithm involving generalized Householder reflections based on the indefinite inner product 〈 u ̲ , v ̲ 〉 ∗ =∑iuivi. This inner product is linear in both arguments and avoids complex conjugation. The complex symmetric input matrix is transformed to tridiagonal form using generalized Householder transformations (first step). An iterative, generalized QL decomposition of the tridiagonal matrix employing an implicit shift converges toward diagonal form (second step). The QL algorithm employs iterative deflation techniques when a machine-precision zero is encountered "prematurely" on the super-/sub-diagonal. The algorithm allows for a reliable and computationally efficient computation of resonance and antiresonance energies which emerge from complex-scaled Hamiltonians, and for the numerical determination of the real energy eigenvalues of pseudo-Hermitian and PT-symmetric Hamilton matrices. Numerical reference values are provided.
Nonconformal scalar field in uniform isotropic space and the method of Hamiltonian diagonalization
International Nuclear Information System (INIS)
Pavlov, Yu.V.
2001-01-01
One diagonalized metric Hamiltonian of scalar field with arbitrary relation with curvature in N-dimensional uniform isotropic space. One derived spectrum of energies of the appropriate quasi-particles. One calculated energy of quasi-particle appropriate to the canonical Hamiltonian diagonal shape. One structured a modified tensor of energy-pulse with the following features. In case of conformal scalar field it coincides with the metric tensor of energy-pulse. When it is diagonalized the energies of the appropriate particles of nonconformal field are equal to oscillation frequency and the number of such particles produced in non-stationary metric is the finite one. It is shown that Hamiltonian calculated on the basis of the modified tensor of energy-pulse may be derived as a canonical one at certain selection of variables [ru
A new three-dimensional equivalent circuit of diagonal type MHD generator
International Nuclear Information System (INIS)
Yoshida, Masahrau; Komaya, Kiyotoshi; Umoto, Juro
1979-01-01
For a large scale diagonal type generator with oil combustion gas plasma, a new three-dimensional equivalent circuit is proposed, in which threre are considered the leakage resistance of the duct insulator surface, the boundary layer, the ion slip, the effect of the finite electrode segmentation etc. Next, through the relation between the Hall voltage per one electrode pitch region and the load current obtained by use of the equivalent circuit, a suitable size and number of the space elements per region and determined. Further, by comparing in detail the electrical performances of two types of the diagonal generators with diagonal conducting and insulating sidewalls, three-dimensional effects of the sidewalls are discussed. (author)
Rossi-Arnaud, Clelia; Pieroni, Laura; Spataro, Pietro; Baddeley, Alan
2012-09-01
Previous studies, using a modified version of the sequential Corsi block task to examine the impact of symmetry on visuospatial memory, showed an advantage of vertical symmetry over non-symmetrical sequences, but no effect of horizontal or diagonal symmetry. The present four experiments investigated the mechanisms underlying the encoding of vertical, horizontal and diagonal configurations using simultaneous presentation and a dual-task paradigm. Results indicated that the recall of vertically symmetric arrays was always better than that of all other patterns and was not influenced by any of the concurrent tasks. Performance with horizontally or diagonally symmetrical patterns differed, with high performing participants showing little effect of concurrent tasks, while low performers were disrupted by concurrent visuospatial and executive tasks. A verbal interference had no effect on either group. Implications for processes involved in the encoding of symmetry are discussed, together with the crucial importance of individual differences. Copyright © 2012 Elsevier B.V. All rights reserved.
Novel Diagonal Reloading Based Direction of Arrival Estimation in Unknown Non-Uniform Noise
Directory of Open Access Journals (Sweden)
Hao Zhou
2018-01-01
Full Text Available Nested array can expand the degrees of freedom (DOF from difference coarray perspective, but suffering from the performance degradation of direction of arrival (DOA estimation in unknown non-uniform noise. In this paper, a novel diagonal reloading (DR based DOA estimation algorithm is proposed using a recently developed nested MIMO array. The elements in the main diagonal of the sample covariance matrix are eliminated; next the smallest MN-K eigenvalues of the revised matrix are obtained and averaged to estimate the sum value of the signal power. Further the estimated sum value is filled into the main diagonal of the revised matrix for estimating the signal covariance matrix. In this case, the negative effect of noise is eliminated without losing the useful information of the signal matrix. Besides, the degrees of freedom are expanded obviously, resulting in the performance improvement. Several simulations are conducted to demonstrate the effectiveness of the proposed algorithm.
Diagonal Likelihood Ratio Test for Equality of Mean Vectors in High-Dimensional Data
Hu, Zongliang; Tong, Tiejun; Genton, Marc G.
2017-01-01
We propose a likelihood ratio test framework for testing normal mean vectors in high-dimensional data under two common scenarios: the one-sample test and the two-sample test with equal covariance matrices. We derive the test statistics under the assumption that the covariance matrices follow a diagonal matrix structure. In comparison with the diagonal Hotelling's tests, our proposed test statistics display some interesting characteristics. In particular, they are a summation of the log-transformed squared t-statistics rather than a direct summation of those components. More importantly, to derive the asymptotic normality of our test statistics under the null and local alternative hypotheses, we do not require the assumption that the covariance matrix follows a diagonal matrix structure. As a consequence, our proposed test methods are very flexible and can be widely applied in practice. Finally, simulation studies and a real data analysis are also conducted to demonstrate the advantages of our likelihood ratio test method.
DEFF Research Database (Denmark)
Zhang, Shuai; Zhao, Kun; Ying, Zhinong
2015-01-01
mechanism of the mismatch of these three bandwidth ranges is also explained. Furthermore, the diagonal antenna-chassis mode is also studied for MIMO elements in the adjacent and diagonal corner locations. As a practical example, a wideband collocated LTE MIMO antenna is proposed and measured. It covers......A diagonal antenna-chassis mode is investigated in long-term evolution multiple-input-multiple-output (LTE MIMO) antennas. The MIMO bandwidth is defined in this paper as the overlap range of the low-envelope correlation coefficient, high total efficiency, and -6-dB impedance matching bandwidths...... the bands of 740960 and 1700-2700 MHz, where the total efficiencies are better than -3.4 and -1.8 dB, with lower than 0.5 and 0.1, respectively. The measurements agree well with the simulations. Since the proposed method only needs to modify the excitation locations of the MIMO elements on the chassis...
Chavez, Gustavo Ivan
2017-07-10
This dissertation introduces a novel fast direct solver and preconditioner for the solution of block tridiagonal linear systems that arise from the discretization of elliptic partial differential equations on a Cartesian product mesh, such as the variable-coefficient Poisson equation, the convection-diffusion equation, and the wave Helmholtz equation in heterogeneous media. The algorithm extends the traditional cyclic reduction method with hierarchical matrix techniques. The resulting method exposes substantial concurrency, and its arithmetic operations and memory consumption grow only log-linearly with problem size, assuming bounded rank of off-diagonal matrix blocks, even for problems with arbitrary coefficient structure. The method can be used as a standalone direct solver with tunable accuracy, or as a black-box preconditioner in conjunction with Krylov methods. The challenges that distinguish this work from other thrusts in this active field are the hybrid distributed-shared parallelism that can demonstrate the algorithm at large-scale, full three-dimensionality, and the three stressors of the current state-of-the-art multigrid technology: high wavenumber Helmholtz (indefiniteness), high Reynolds convection (nonsymmetry), and high contrast diffusion (inhomogeneity). 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.
International Nuclear Information System (INIS)
Jiang, Tongsong; Jiang, Ziwu; Zhang, Zhaozhong
2015-01-01
In the study of the relation between complexified classical and non-Hermitian quantum mechanics, physicists found that there are links to quaternionic and split quaternionic mechanics, and this leads to the possibility of employing algebraic techniques of split quaternions to tackle some problems in complexified classical and quantum mechanics. This paper, by means of real representation of a split quaternion matrix, studies the problem of diagonalization of a split quaternion matrix and gives algebraic techniques for diagonalization of split quaternion matrices in split quaternionic mechanics
AESS: Accelerated Exact Stochastic Simulation
Jenkins, David D.; Peterson, Gregory D.
2011-12-01
The Stochastic Simulation Algorithm (SSA) developed by Gillespie provides a powerful mechanism for exploring the behavior of chemical systems with small species populations or with important noise contributions. Gene circuit simulations for systems biology commonly employ the SSA method, as do ecological applications. This algorithm tends to be computationally expensive, so researchers seek an efficient implementation of SSA. In this program package, the Accelerated Exact Stochastic Simulation Algorithm (AESS) contains optimized implementations of Gillespie's SSA that improve the performance of individual simulation runs or ensembles of simulations used for sweeping parameters or to provide statistically significant results. Program summaryProgram title: AESS Catalogue identifier: AEJW_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJW_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: University of Tennessee copyright agreement No. of lines in distributed program, including test data, etc.: 10 861 No. of bytes in distributed program, including test data, etc.: 394 631 Distribution format: tar.gz Programming language: C for processors, CUDA for NVIDIA GPUs Computer: Developed and tested on various x86 computers and NVIDIA C1060 Tesla and GTX 480 Fermi GPUs. The system targets x86 workstations, optionally with multicore processors or NVIDIA GPUs as accelerators. Operating system: Tested under Ubuntu Linux OS and CentOS 5.5 Linux OS Classification: 3, 16.12 Nature of problem: Simulation of chemical systems, particularly with low species populations, can be accurately performed using Gillespie's method of stochastic simulation. Numerous variations on the original stochastic simulation algorithm have been developed, including approaches that produce results with statistics that exactly match the chemical master equation (CME) as well as other approaches that approximate the CME. Solution
Topological order in an exactly solvable 3D spin model
International Nuclear Information System (INIS)
Bravyi, Sergey; Leemhuis, Bernhard; Terhal, Barbara M.
2011-01-01
Research highlights: RHtriangle We study exactly solvable spin model with six-qubit nearest neighbor interactions on a 3D face centered cubic lattice. RHtriangle The ground space of the model exhibits topological quantum order. RHtriangle Elementary excitations can be geometrically described as the corners of rectangular-shaped membranes. RHtriangle The ground space can encode 4g qubits where g is the greatest common divisor of the lattice dimensions. RHtriangle Logical operators acting on the encoded qubits are described in terms of closed strings and closed membranes. - Abstract: We study a 3D generalization of the toric code model introduced recently by Chamon. This is an exactly solvable spin model with six-qubit nearest-neighbor interactions on an FCC lattice whose ground space exhibits topological quantum order. The elementary excitations of this model which we call monopoles can be geometrically described as the corners of rectangular-shaped membranes. We prove that the creation of an isolated monopole separated from other monopoles by a distance R requires an operator acting on Ω(R 2 ) qubits. Composite particles that consist of two monopoles (dipoles) and four monopoles (quadrupoles) can be described as end-points of strings. The peculiar feature of the model is that dipole-type strings are rigid, that is, such strings must be aligned with face-diagonals of the lattice. For periodic boundary conditions the ground space can encode 4g qubits where g is the greatest common divisor of the lattice dimensions. We describe a complete set of logical operators acting on the encoded qubits in terms of closed strings and closed membranes.
Perturbation of an exact strong gravity solution
International Nuclear Information System (INIS)
Baran, S.A.
1982-10-01
Perturbations of an exact strong gravity solution are investigated. It is shown, by using the new multipole expansions previously presented, that this exact and static spherically symmetric solution is stable under odd parity perturbations. (author)
Refined isogeometric analysis for a preconditioned conjugate gradient solver
Garcia, Daniel
2018-02-12
Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.
Exact Bremsstrahlung and effective couplings
Energy Technology Data Exchange (ETDEWEB)
Mitev, Vladimir [Institut für Physik, WA THEP, Johannes Gutenberg-Universität Mainz,Staudingerweg 7, 55128 Mainz (Germany); Institut für Mathematik und Institut für Physik, Humboldt-Universität zu Berlin,IRIS Haus, Zum Großen Windkanal 6, 12489 Berlin (Germany); Pomoni, Elli [DESY Hamburg, Theory Group, Notkestrasse 85, D-22607 Hamburg (Germany); Physics Division, National Technical University of Athens,15780 Zografou Campus, Athens (Greece)
2016-06-13
We calculate supersymmetric Wilson loops on the ellipsoid for a large class of N=2 SCFT using the localization formula of Hama and Hosomichi. From them we extract the radiation emitted by an accelerating heavy probe quark as well as the entanglement entropy following the recent works of Lewkowycz-Maldacena and Fiol-Gerchkovitz-Komargodski. Comparing our results with the N=4 SYM ones, we obtain interpolating functions f(g{sup 2}) such that a given N=2 SCFT observable is obtained by replacing in the corresponding N=4 SYM result the coupling constant by f(g{sup 2}). These “exact effective couplings” encode the finite, relative renormalization between the N=2 and the N=4 gluon propagator and they interpolate between the weak and the strong coupling. We discuss the range of their applicability.
High Resolution Thermometry for EXACT
Panek, J. S.; Nash, A. E.; Larson, M.; Mulders, N.
2000-01-01
High Resolution Thermometers (HRTs) based on SQUID detection of the magnetization of a paramagnetic salt or a metal alloy has been commonly used for sub-nano Kelvin temperature resolution in low temperature physics experiments. The main applications to date have been for temperature ranges near the lambda point of He-4 (2.177 K). These thermometers made use of materials such as Cu(NH4)2Br4 *2H2O, GdCl3, or PdFe. None of these materials are suitable for EXACT, which will explore the region of the He-3/He-4 tricritical point at 0.87 K. The experiment requirements and properties of several candidate paramagnetic materials will be presented, as well as preliminary test results.
Vacaru, Sergiu I.; Yazici, Enis
2014-01-01
We show that a geometric techniques can be elaborated and applied for constructing generic off-diagonal exact solutions in $f(R,T)$--modified gravity for systems of gravitational-Yang-Mills-Higgs equations. The corresponding classes of metrics and generalized connections are determined by generating and integration functions which depend, in general, on all space and time coordinates and may possess, or not, Killing symmetries. For nonholonomic constraints resulting in Levi-Civita configurations, we can extract solutions of the Einstein-Yang-Mills-Higgs equations. We show that the constructions simplify substantially for metrics with at least one Killing vector. There are provided and analyzed some examples of exact solutions describing generic off-diagonal modifications to black hole/ellipsoid and solitonic configurations.
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)
BCYCLIC: A parallel block tridiagonal matrix cyclic solver
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.
Yildiz Ulus, Aysegul
2013-01-01
This paper examines experimental and algorithmic contributions of advanced calculators (graphing and computer algebra system, CAS) in teaching the concept of "diagonalization," one of the key topics in Linear Algebra courses taught at the undergraduate level. Specifically, the proposed hypothesis of this study is to assess the effective…
Off-diagonal ekpyrotic scenarios and equivalence of modified, massive and/or Einstein gravity
Directory of Open Access Journals (Sweden)
Sergiu I. Vacaru
2016-01-01
Full Text Available Using our anholonomic frame deformation method, we show how generic off-diagonal cosmological solutions depending, in general, on all spacetime coordinates and undergoing a phase of ultra-slow contraction can be constructed in massive gravity. In this paper, there are found and studied new classes of locally anisotropic and (inhomogeneous cosmological metrics with open and closed spatial geometries. The late time acceleration is present due to effective cosmological terms induced by nonlinear off-diagonal interactions and graviton mass. The off-diagonal cosmological metrics and related Stückelberg fields are constructed in explicit form up to nonholonomic frame transforms of the Friedmann–Lamaître–Robertson–Walker (FLRW coordinates. We show that the solutions include matter, graviton mass and other effective sources modeling nonlinear gravitational and matter fields interactions in modified and/or massive gravity, with polarization of physical constants and deformations of metrics, which may explain certain dark energy and dark matter effects. There are stated and analyzed the conditions when such configurations mimic interesting solutions in general relativity and modifications and recast the general Painlevé–Gullstrand and FLRW metrics. Finally, we elaborate on a reconstruction procedure for a subclass of off-diagonal cosmological solutions which describe cyclic and ekpyrotic universes, with an emphasis on open issues and observable signatures.
Relation between Feynman Cycles and Off-Diagonal Long-Range Order
International Nuclear Information System (INIS)
Ueltschi, Daniel
2006-01-01
The usual order parameter for Bose-Einstein condensation involves the off-diagonal correlation function of Penrose and Onsager, but an alternative is Feynman's notion of infinite cycles. We present a formula that relates both order parameters. We discuss its validity with the help of rigorous results and heuristic arguments. The conclusion is that infinite cycles do not always represent the Bose condensate
Stability of matrices with sufficiently strong negative-dominant-diagonal submatrices
Nieuwenhuis, H.J.; Schoonbeek, L.
A well-known sufficient condition for stability of a system of linear first-order differential equations is that the matrix of the homogeneous dynamics has a negative dominant diagonal. However, this condition cannot be applied to systems of second-order differential equations. In this paper we
Correlation between eigenvalues and sorted diagonal matrix elements of a large dimensional matrix
International Nuclear Information System (INIS)
Arima, A.
2008-01-01
Functional dependences of eigenvalues as functions of sorted diagonal elements are given for realistic nuclear shell model (NSM) hamiltonian, the uniform distribution hamiltonian and the GOE hamiltonian. In the NSM case, the dependence is found to be linear. We discuss extrapolation methods for more accurate predictions for low-lying states. (author)
A dynamical characterization of diagonal-preserving *-isomorphisms of graph C*-algebras
DEFF Research Database (Denmark)
Arklint, Sara; Eilers, Søren; Ruiz, Efren
2017-01-01
We characterize when there exists a diagonal-preserving (Formula presented.)-isomorphism between two graph (Formula presented.)-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of ‘orbit equivalence’ between the boundary path spaces of the directe...
Hamiltonian diagonalization in foliable space-times: A method to find the modes
International Nuclear Information System (INIS)
Castagnino, M.; Ferraro, R.
1989-01-01
A way to obtain modes diagonalizing the canonical Hamiltonian of a minimally coupled scalar quantum field, in a foliable space-time, is shown. The Cauchy data for these modes are found to be the eigenfunctions of a second-order differential operator that could be interpreted as the squared Hamiltonian for the first-quantized relativistic particle in curved space
Relativistic density matrix in the diagonal momentum representation. Bose-gas
International Nuclear Information System (INIS)
Makhlin, A.N.; Sinyukov, Yu.M.
1984-01-01
The relativistic-invariance treatment of the ideal Bose-system arising from the diagonal momentum representation for the density matrix is developed. The average occupation members and their correlators for statistical systems in arbitrary inertial frames are found on the equal-time hypersurfaces. The relativistic partition function method for the calculation of thermodynamic properties of gases moving as a whole is constructed
Mahomed, Ozayr Haroon; Asmall, Shaidah; Freeman, Melvyn
2014-11-01
The integrated chronic disease management model provides a systematic framework for creating a fundamental change in the orientation of the health system. This model adopts a diagonal approach to health system strengthening by establishing a service-linked base to training, supervision, and the opportunity to try out, assess, and implement integrated interventions.
Hathout, Leith
2007-01-01
Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be…
Diagonal K-matrices and transfer matrix eigenspectra associated with the G(1)2 R-matrix
International Nuclear Information System (INIS)
Yung, C.M.; Batchelor, M.T.
1995-01-01
We find all the diagonal K-matrices for the R-matrix associated with the minimal representation of the exceptional affine algebra G (1) 2 . The corresponding transfer matrices are diagonalized with a variation of the analytic Bethe ansatz. We find many similarities with the case of the Izergin-Korepin R-matrix associated with the affine algebra A (2) 2 . ((orig.))
Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation
Chen, Meng-Huo
2015-09-13
In this research we are particularly interested in extending the robustness of multigrid solvers to encounter complex systems related to subsurface reservoir applications for flow problems in porous media. In many cases, the step for solving the pressure filed in subsurface flow simulation becomes a bottleneck for the performance of the simulator. For solving large sparse linear system arising from MPFA discretization, we choose multigrid methods as the linear solver. The possible difficulties and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately goal which we desire to achieve.
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...
An efficient spectral crystal plasticity solver for GPU architectures
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.
Efficiently computing exact geodesic loops within finite steps.
Xin, Shi-Qing; He, Ying; Fu, Chi-Wing
2012-06-01
Closed geodesics, or geodesic loops, are crucial to the study of differential topology and differential geometry. Although the existence and properties of closed geodesics on smooth surfaces have been widely studied in mathematics community, relatively little progress has been made on how to compute them on polygonal surfaces. Most existing algorithms simply consider the mesh as a graph and so the resultant loops are restricted only on mesh edges, which are far from the actual geodesics. This paper is the first to prove the existence and uniqueness of geodesic loop restricted on a closed face sequence; it contributes also with an efficient algorithm to iteratively evolve an initial closed path on a given mesh into an exact geodesic loop within finite steps. Our proposed algorithm takes only an O(k) space complexity and an O(mk) time complexity (experimentally), where m is the number of vertices in the region bounded by the initial loop and the resultant geodesic loop, and k is the average number of edges in the edge sequences that the evolving loop passes through. In contrast to the existing geodesic curvature flow methods which compute an approximate geodesic loop within a predefined threshold, our method is exact and can apply directly to triangular meshes without needing to solve any differential equation with a numerical solver; it can run at interactive speed, e.g., in the order of milliseconds, for a mesh with around 50K vertices, and hence, significantly outperforms existing algorithms. Actually, our algorithm could run at interactive speed even for larger meshes. Besides the complexity of the input mesh, the geometric shape could also affect the number of evolving steps, i.e., the performance. We motivate our algorithm with an interactive shape segmentation example shown later in the paper.
Directory of Open Access Journals (Sweden)
Sebastián B. Lamot
2007-08-01
Full Text Available El surco diagonal es un signo encontrado en el lóbulo de la oreja, que estaría relacionado con la enfermedad arterial coronaria. Nuestro objetivo fue estudiar la utilidad del signo. Se examinaron 104 pacientes (entre 30 y 80 años clasificados por sexo y edad. Cuarenta y nueve tenían enfermedad arterial coronaria diagnosticada por coronariografía (obstrucción > del 70% en una de las grandes arterias y/o gamagrafía de perfusión miocárdica con Talio 201 (defecto fijo. El grupo control estuvo compuesto por 55 pacientes (asintomáticos, con electrocardiograma normal. Los datos obtenidos fueron sensibilidad (61.2%, especificidad (78.2%, valor predictivo positivo de (71.4% y valor predictivo negativo (69.3%.. Observamos una relación significativa entre la presencia de surco diagonal y enfermedad arterial coronaria. Consideramos que este signo podría resultar de utilidad en la práctica clínica, fundamentalmente para los pacientes entre 30 y 60 años.The diagonal earlobe crease is a sign theorically related to coronary artery disease. The purpose of this study was to prove the usefulness of this sign. A total of 104 patients were examined (ages 30 to 80 grouped by age and sex. Forty nine of them were diagnosed of having coronary artery disease by coronary angiography (a 70% obstruction of one of the major arteries, and/or myocardial perfusion imaging with Thallium 201 (fixed defects. The control group included 55 patients (asymptomatic with normal electrocardiogram. Data here obtained included sensitivity (61.2%, specificity (78.2%, positive predictive value (71.4% and negative predictive value (69.3%. We found a significant relation between the presence of the diagonal earlobe crease and coronary artery disease. We consider it a sign that could prove useful in clinical practice, mainly among patients aged between 30 and 60.
On Cafesat: A Modern SAT Solver for Scala
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 ...
MINARET: Towards a time-dependent neutron transport parallel solver
International Nuclear Information System (INIS)
Baudron, A.M.; Lautard, J.J.; Maday, Y.; Mula, O.
2013-01-01
We present the newly developed time-dependent 3D multigroup discrete ordinates neutron transport solver that has recently been implemented in the MINARET code. The solver is the support for a study about computing acceleration techniques that involve parallel architectures. In this work, we will focus on the parallelization of two of the variables involved in our equation: the angular directions and the time. This last variable has been parallelized by a (time) domain decomposition method called the para-real in time algorithm. (authors)
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.
Fast Laplace solver approach to pore-scale permeability
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.
Exact Dynamics via Poisson Process: a unifying Monte Carlo paradigm
Gubernatis, James
2014-03-01
A common computational task is solving a set of ordinary differential equations (o.d.e.'s). A little known theorem says that the solution of any set of o.d.e.'s is exactly solved by the expectation value over a set of arbitary Poisson processes of a particular function of the elements of the matrix that defines the o.d.e.'s. The theorem thus provides a new starting point to develop real and imaginary-time continous-time solvers for quantum Monte Carlo algorithms, and several simple observations enable various quantum Monte Carlo techniques and variance reduction methods to transfer to a new context. I will state the theorem, note a transformation to a very simple computational scheme, and illustrate the use of some techniques from the directed-loop algorithm in context of the wavefunction Monte Carlo method that is used to solve the Lindblad master equation for the dynamics of open quantum systems. I will end by noting that as the theorem does not depend on the source of the o.d.e.'s coming from quantum mechanics, it also enables the transfer of continuous-time methods from quantum Monte Carlo to the simulation of various classical equations of motion heretofore only solved deterministically.
Optimizing communication satellites payload configuration with exact approaches
Stathakis, Apostolos; Danoy, Grégoire; Bouvry, Pascal; Talbi, El-Ghazali; Morelli, Gianluigi
2015-12-01
The satellite communications market is competitive and rapidly evolving. The payload, which is in charge of applying frequency conversion and amplification to the signals received from Earth before their retransmission, is made of various components. These include reconfigurable switches that permit the re-routing of signals based on market demand or because of some hardware failure. In order to meet modern requirements, the size and the complexity of current communication payloads are increasing significantly. Consequently, the optimal payload configuration, which was previously done manually by the engineers with the use of computerized schematics, is now becoming a difficult and time consuming task. Efficient optimization techniques are therefore required to find the optimal set(s) of switch positions to optimize some operational objective(s). In order to tackle this challenging problem for the satellite industry, this work proposes two Integer Linear Programming (ILP) models. The first one is single-objective and focuses on the minimization of the length of the longest channel path, while the second one is bi-objective and additionally aims at minimizing the number of switch changes in the payload switch matrix. Experiments are conducted on a large set of instances of realistic payload sizes using the CPLEX® solver and two well-known exact multi-objective algorithms. Numerical results demonstrate the efficiency and limitations of the ILP approach on this real-world problem.
Exact solutions for rotating charged dust
International Nuclear Information System (INIS)
Islam, J.N.
1984-01-01
Earlier work by the author on rotating charged dust is summarized. An incomplete class of exact solutions for differentially rotating charged dust in Newton-Maxwell theory for the equal mass and charge case that was found earlier is completed. A new global exact solution for cylindrically symmetric differentially rotating charged dust in Newton-Maxwell theory is presented. Lastly, a new exact solution for cylindrically symmetric rigidly rotating charged dust in general relativity is given. (author)
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.
Numerical solver for compressible two-fluid flow
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
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang
2014-09-26
Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
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
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.
A High Performance QDWH-SVD Solver using Hardware Accelerators
Sukkari, Dalal E.; Ltaief, Hatem; Keyes, David E.
2015-01-01
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.
Hypersonic simulations using open-source CFD and DSMC solvers
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.
Implementing parallel elliptic solver on a Beowulf cluster
Directory of Open Access Journals (Sweden)
Marcin Paprzycki
1999-12-01
Full Text Available In a recent paper cite{zara} a parallel direct solver for the linear systems arising from elliptic partial differential equations has been proposed. The aim of this note is to present the initial evaluation of the performance characteristics of this algorithm on Beowulf-type cluster. In this context the performance of PVM and MPI based implementations is compared.
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
SolveDB: Integrating Optimization Problem Solvers Into SQL Databases
DEFF Research Database (Denmark)
Siksnys, Laurynas; Pedersen, Torben Bach
2016-01-01
for optimization problems, (2) an extensible infrastructure for integrating different solvers, and (3) query optimization techniques to achieve the best execution performance and/or result quality. Extensive experiments with the PostgreSQL-based implementation show that SolveDB is a versatile tool offering much...
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf; Liebmann, Manfred; Douglas, Craig C.; Plank, Gernot
2010-01-01
-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
Analysis of transient plasmonic interactions using an MOT-PMCHWT integral equation solver
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
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.
The resolution of field identification fixed points in diagonal coset theories
International Nuclear Information System (INIS)
Fuchs, J.; Schellekens, B.; Schweigert, C.
1995-09-01
The fixed point resolution problem is solved for diagonal coset theories. The primary fields into which the fixed points are resolved are described by submodules of the branching spaces, obtained as eigenspaces of the automorphisms that implement field identification. To compute the characters and the modular S-matrix we use ''orbit Lie algebras'' and ''twining characters'', which were introduced in a previous paper. The characters of the primary fields are expressed in terms branching functions of twining characters. This allows us to express the modular S-matrix through the S-matrices of the orbit Lie algebras associated to the identification group. Our results can be extended to the larger class of ''generalized diagonal cosets''. (orig.)
Using Volunteer Computing to Study Some Features of Diagonal Latin Squares
Vatutin, Eduard; Zaikin, Oleg; Kochemazov, Stepan; Valyaev, Sergey
2017-12-01
In this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs. According to this algorithm, all DLSs of a particular order are generated, and for each square all its transversals and diagonal transversals are constructed. The algorithm was implemented and applied to DLSs of order at most 7 on a personal computer. The experiment for order 8 was performed in the volunteer computing project Gerasim@home. In addition, the problem of finding pairs of orthogonal DLSs of order 10 was considered and reduced to Boolean satisfiability problem. The obtained problem turned out to be very hard, therefore it was decomposed into a family of subproblems. In order to solve the problem, the volunteer computing project SAT@home was used. As a result, several dozen pairs of described kind were found.
Wu, Sheng-Jhih; Chu, Moody T.
2017-08-01
An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing-Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations.
Direct current hopping conductance in one-dimensional diagonal disordered systems
Institute of Scientific and Technical Information of China (English)
Ma Song-Shan; Xu Hui; Liu Xiao-Liang; Xiao Jian-Rong
2006-01-01
Based on a tight-binding disordered model describing a single electron band, we establish a direct current (dc) electronic hopping transport conductance model of one-dimensional diagonal disordered systems, and also derive a dc conductance formula. By calculating the dc conductivity, the relationships between electric field and conductivity and between temperature and conductivity are analysed, and the role played by the degree of disorder in electronic transport is studied. The results indicate the conductivity of systems decreasing with the increase of the degree of disorder, characteristics of negative differential dependence of resistance on temperature at low temperatures in diagonal disordered systems, and the conductivity of systems decreasing with the increase of electric field, featuring the non-Ohm's law conductivity.
International Nuclear Information System (INIS)
Wu, Sheng-Jhih; Chu, Moody T
2017-01-01
An inverse eigenvalue problem usually entails two constraints, one conditioned upon the spectrum and the other on the structure. This paper investigates the problem where triple constraints of eigenvalues, singular values, and diagonal entries are imposed simultaneously. An approach combining an eclectic mix of skills from differential geometry, optimization theory, and analytic gradient flow is employed to prove the solvability of such a problem. The result generalizes the classical Mirsky, Sing–Thompson, and Weyl-Horn theorems concerning the respective majorization relationships between any two of the arrays of main diagonal entries, eigenvalues, and singular values. The existence theory fills a gap in the classical matrix theory. The problem might find applications in wireless communication and quantum information science. The technique employed can be implemented as a first-step numerical method for constructing the matrix. With slight modification, the approach might be used to explore similar types of inverse problems where the prescribed entries are at general locations. (paper)
Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan
2017-06-01
In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.
A High Performance QDWH-SVD Solver using Hardware Accelerators
Sukkari, Dalal E.
2015-04-08
This paper describes a new high performance implementation of the QR-based Dynamically Weighted Halley Singular Value Decomposition (QDWH-SVD) solver on multicore architecture enhanced with multiple GPUs. The standard QDWH-SVD algorithm was introduced by Nakatsukasa and Higham (SIAM SISC, 2013) and combines three successive computational stages: (1) the polar decomposition calculation of the original matrix using the QDWH algorithm, (2) the symmetric eigendecomposition of the resulting polar factor to obtain the singular values and the right singular vectors and (3) the matrix-matrix multiplication to get the associated left singular vectors. A comprehensive test suite highlights the numerical robustness of the QDWH-SVD solver. Although it performs up to two times more flops when computing all singular vectors compared to the standard SVD solver algorithm, our new high performance implementation on single GPU results in up to 3.8x improvements for asymptotic matrix sizes, compared to the equivalent routines from existing state-of-the-art open-source and commercial libraries. However, when only singular values are needed, QDWH-SVD is penalized by performing up to 14 times more flops. The singular value only implementation of QDWH-SVD on single GPU can still run up to 18% faster than the best existing equivalent routines. Integrating mixed precision techniques in the solver can additionally provide up to 40% improvement at the price of losing few digits of accuracy, compared to the full double precision floating point arithmetic. We further leverage the single GPU QDWH-SVD implementation by introducing the first multi-GPU SVD solver to study the scalability of the QDWH-SVD framework.
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)
Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers
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
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.
Exactly energy conserving semi-implicit particle in cell formulation
International Nuclear Information System (INIS)
Lapenta, Giovanni
2017-01-01
We report a new particle in cell (PIC) method based on the semi-implicit approach. The novelty of the new method is that unlike any of its semi-implicit predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. Recent research has presented fully implicit methods where energy conservation is obtained as part of a non-linear iteration procedure. The new method (referred to as Energy Conserving Semi-Implicit Method, ECSIM), instead, does not require any non-linear iteration and its computational cycle is similar to that of explicit PIC. The properties of the new method are: i) it conserves energy exactly to round-off for any time step or grid spacing; ii) it is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency and allowing the user to select any desired time step; iii) it eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length; iv) the particle mover has a computational complexity identical to that of the explicit PIC, only the field solver has an increased computational cost. The new ECSIM is tested in a number of benchmarks where accuracy and computational performance are tested. - Highlights: • We present a new fully energy conserving semi-implicit particle in cell (PIC) method based on the implicit moment method (IMM). The new method is called Energy Conserving Implicit Moment Method (ECIMM). • The novelty of the new method is that unlike any of its predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. • The new method is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency. • The new method eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length. • These
Exactly energy conserving semi-implicit particle in cell formulation
Energy Technology Data Exchange (ETDEWEB)
Lapenta, Giovanni, E-mail: giovanni.lapenta@kuleuven.be
2017-04-01
We report a new particle in cell (PIC) method based on the semi-implicit approach. The novelty of the new method is that unlike any of its semi-implicit predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. Recent research has presented fully implicit methods where energy conservation is obtained as part of a non-linear iteration procedure. The new method (referred to as Energy Conserving Semi-Implicit Method, ECSIM), instead, does not require any non-linear iteration and its computational cycle is similar to that of explicit PIC. The properties of the new method are: i) it conserves energy exactly to round-off for any time step or grid spacing; ii) it is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency and allowing the user to select any desired time step; iii) it eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length; iv) the particle mover has a computational complexity identical to that of the explicit PIC, only the field solver has an increased computational cost. The new ECSIM is tested in a number of benchmarks where accuracy and computational performance are tested. - Highlights: • We present a new fully energy conserving semi-implicit particle in cell (PIC) method based on the implicit moment method (IMM). The new method is called Energy Conserving Implicit Moment Method (ECIMM). • The novelty of the new method is that unlike any of its predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. • The new method is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency. • The new method eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length. • These
Modeling animal-vehicle collisions using diagonal inflated bivariate Poisson regression.
Lao, Yunteng; Wu, Yao-Jan; Corey, Jonathan; Wang, Yinhai
2011-01-01
Two types of animal-vehicle collision (AVC) data are commonly adopted for AVC-related risk analysis research: reported AVC data and carcass removal data. One issue with these two data sets is that they were found to have significant discrepancies by previous studies. In order to model these two types of data together and provide a better understanding of highway AVCs, this study adopts a diagonal inflated bivariate Poisson regression method, an inflated version of bivariate Poisson regression model, to fit the reported AVC and carcass removal data sets collected in Washington State during 2002-2006. The diagonal inflated bivariate Poisson model not only can model paired data with correlation, but also handle under- or over-dispersed data sets as well. Compared with three other types of models, double Poisson, bivariate Poisson, and zero-inflated double Poisson, the diagonal inflated bivariate Poisson model demonstrates its capability of fitting two data sets with remarkable overlapping portions resulting from the same stochastic process. Therefore, the diagonal inflated bivariate Poisson model provides researchers a new approach to investigating AVCs from a different perspective involving the three distribution parameters (λ(1), λ(2) and λ(3)). The modeling results show the impacts of traffic elements, geometric design and geographic characteristics on the occurrences of both reported AVC and carcass removal data. It is found that the increase of some associated factors, such as speed limit, annual average daily traffic, and shoulder width, will increase the numbers of reported AVCs and carcass removals. Conversely, the presence of some geometric factors, such as rolling and mountainous terrain, will decrease the number of reported AVCs. Published by Elsevier Ltd.
Diagonalization of propagators in thermo field dynamics for relativistic quantum fields
International Nuclear Information System (INIS)
Henning, P.A.; Umezawa, H.
1992-09-01
Two-point functions for interacting quantum fields in statistical systems can be diagnolized by matrix transformations. It is shown, that within the framework of time-dependent Thermo Field Dynamics this diagonalization can be understood as a thermal Bogoliubov transformation to non-interacting statistical quasi-particles. The condition for their unperturbed propagation relates these states to the thermodynamic properties of the system: It requires global equilibrium for stationary situations, or specifies the time evolution according to a kinetic equation. (orig.)
Gradient $L^q$ theory for a class of non-diagonal nonlinear elliptic systems
Czech Academy of Sciences Publication Activity Database
Bulíček, M.; Kalousek, M.; Kaplický, P.; Mácha, Václav
2018-01-01
Roč. 171, June (2018), s. 156-169 ISSN 0362-546X R&D Projects: GA ČR GA16-03230S Institutional support: RVO:67985840 Keywords : regularity * gradient estimates * non-diagonal elliptic systems Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.192, year: 2016 https://www.sciencedirect.com/science/ article /pii/S0362546X18300385
Off-diagonal helicity density matrix elements for vector mesons produced at LEP
International Nuclear Information System (INIS)
Anselmino, M.; Bertini, M.; Quintairos, P.
1997-05-01
Final state q q-bar interactions may give origin to non zero values of the off-diagonal element ρ 1 of the helicity density matrix of vector mesons produced in e + e - annihilations, as confirmed by recent OPAL data on φ and D * 's. Predictions are given for ρ1,-1 of several mesons produced at large z and small PT, collinear with the parent jet; the values obtained for θ and D * are in agreement with data. (author)
International Nuclear Information System (INIS)
Filippov, G.F.; Chopovsky, L.L.; Vasilevsky, V.S.
1982-01-01
The states of continuous spectrum in a system of two interacting clusters are studied. It is shown that the Hamiltonian diagonalization on the oscillator basis isolates those states in a continuous spectrum whose amplitudes have a node at a certain number of oscillator quanta. As an example the interaction of the 4 He and 3 H nuclei is considered. These nuclei form a coupled system - 7 Li
Gradient $L^q$ theory for a class of non-diagonal nonlinear elliptic systems
Czech Academy of Sciences Publication Activity Database
Bulíček, M.; Kalousek, M.; Kaplický, P.; Mácha, Václav
2018-01-01
Roč. 171, June (2018), s. 156-169 ISSN 0362-546X R&D Projects: GA ČR GA16-03230S Institutional support: RVO:67985840 Keywords : regularity * gradient estimates * non-diagonal elliptic systems Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.192, year: 2016 https://www.sciencedirect.com/science/article/pii/S0362546X18300385
Workshop report on large-scale matrix diagonalization methods in chemistry theory institute
Energy Technology Data Exchange (ETDEWEB)
Bischof, C.H.; Shepard, R.L.; Huss-Lederman, S. [eds.
1996-10-01
The Large-Scale Matrix Diagonalization Methods in Chemistry theory institute brought together 41 computational chemists and numerical analysts. The goal was to understand the needs of the computational chemistry community in problems that utilize matrix diagonalization techniques. This was accomplished by reviewing the current state of the art and looking toward future directions in matrix diagonalization techniques. This institute occurred about 20 years after a related meeting of similar size. During those 20 years the Davidson method continued to dominate the problem of finding a few extremal eigenvalues for many computational chemistry problems. Work on non-diagonally dominant and non-Hermitian problems as well as parallel computing has also brought new methods to bear. The changes and similarities in problems and methods over the past two decades offered an interesting viewpoint for the success in this area. One important area covered by the talks was overviews of the source and nature of the chemistry problems. The numerical analysts were uniformly grateful for the efforts to convey a better understanding of the problems and issues faced in computational chemistry. An important outcome was an understanding of the wide range of eigenproblems encountered in computational chemistry. The workshop covered problems involving self- consistent-field (SCF), configuration interaction (CI), intramolecular vibrational relaxation (IVR), and scattering problems. In atomic structure calculations using the Hartree-Fock method (SCF), the symmetric matrices can range from order hundreds to thousands. These matrices often include large clusters of eigenvalues which can be as much as 25% of the spectrum. However, if Cl methods are also used, the matrix size can be between 10{sup 4} and 10{sup 9} where only one or a few extremal eigenvalues and eigenvectors are needed. Working with very large matrices has lead to the development of
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...
Energy Technology Data Exchange (ETDEWEB)
Yu, Hua-Gen, E-mail: hgy@bnl.gov [Division of Chemistry, Department of Energy and Photon Sciences, Brookhaven National Laboratory, Upton, New York 11973-5000 (United States)
2016-08-28
We report a new full-dimensional variational algorithm to calculate rovibrational spectra of polyatomic molecules using an exact quantum mechanical Hamiltonian. The rovibrational Hamiltonian of system is derived in a set of orthogonal polyspherical coordinates in the body-fixed frame. It is expressed in an explicitly Hermitian form. The Hamiltonian has a universal formulation regardless of the choice of orthogonal polyspherical coordinates and the number of atoms in molecule, which is suitable for developing a general program to study the spectra of many polyatomic systems. An efficient coupled-state approach is also proposed to solve the eigenvalue problem of the Hamiltonian using a multi-layer Lanczos iterative diagonalization approach via a set of direct product basis set in three coordinate groups: radial coordinates, angular variables, and overall rotational angles. A simple set of symmetric top rotational functions is used for the overall rotation whereas a potential-optimized discrete variable representation method is employed in radial coordinates. A set of contracted vibrationally diabatic basis functions is adopted in internal angular variables. Those diabatic functions are first computed using a neural network iterative diagonalization method based on a reduced-dimension Hamiltonian but only once. The final rovibrational energies are computed using a modified Lanczos method for a given total angular momentum J, which is usually fast. Two numerical applications to CH{sub 4} and H{sub 2}CO are given, together with a comparison with previous results.
An exact solution to the extended Hubbard model in 2D for finite size system
Harir, S.; Bennai, M.; Boughaleb, Y.
2008-08-01
An exact analytical diagonalization is used to solve the two-dimensional extended Hubbard model (EHM) for a system with finite size. We have considered an EHM including on-site and off-site interactions with interaction energies U and V, respectively, for a square lattice containing 4×4 sites at one-eighth filling with periodic boundary conditions, recently treated by Kovacs and Gulacsi (2006 Phil. Mag. 86 2073). Taking into account the symmetric properties of this square lattice and using a translation linear operator, we have constructed a r-space basis only with 85 state-vectors which describe all possible distributions for four electrons in the 4×4 square lattice. The diagonalization of the 85×85 matrix energy allows us to study the local properties of the above system as a function of the on-site and off-site interactions energies, where we have shown that the off-site interaction encourages the existence of the double occupancies at the first excited state and induces a supplementary conductivity of the system.
Diagonal Likelihood Ratio Test for Equality of Mean Vectors in High-Dimensional Data
Hu, Zongliang
2017-10-27
We propose a likelihood ratio test framework for testing normal mean vectors in high-dimensional data under two common scenarios: the one-sample test and the two-sample test with equal covariance matrices. We derive the test statistics under the assumption that the covariance matrices follow a diagonal matrix structure. In comparison with the diagonal Hotelling\\'s tests, our proposed test statistics display some interesting characteristics. In particular, they are a summation of the log-transformed squared t-statistics rather than a direct summation of those components. More importantly, to derive the asymptotic normality of our test statistics under the null and local alternative hypotheses, we do not require the assumption that the covariance matrix follows a diagonal matrix structure. As a consequence, our proposed test methods are very flexible and can be widely applied in practice. Finally, simulation studies and a real data analysis are also conducted to demonstrate the advantages of our likelihood ratio test method.
Directory of Open Access Journals (Sweden)
Yutaka Misawa
2015-06-01
Full Text Available Building facades play an important role in creating the urban landscape and they can be used effectively to reduce energy usage and environmental impacts, while also incorporating structural seismic-resistant elements in the building perimeter zone. To address these opportunities, the authors propose an integrated facade concept which satisfies architectural facade and environmental design requirements. In Europe, remarkable facade engineering developments have taken place over the last two decades resulting in elegant facades and a reduction in environmental impact; however modifications are needed in Japan to take account of the different seismic and environmental situations. To satisfy these requirements, this paper proposes the use of a diagonally disposed louver system. Diagonally arranged louvers have the potential to provide both seismic resistance and environment adaptation. In many cases, louvers have been designed but not installed due to concerns relating to restricted external sight lines and low levels of natural lighting in the building interior. To overcome these problems, full-scale diagonally arranged louver mock-ups were created to evaluate illumination levels, the quality of the internal daylight environment and external appearance. Interior illumination levels resulting from a series of mock-up experiments were evaluated and correlated with results from a daylight analysis tool.
Images of a Bose-Einstein condensates: diagonal dynamical Bogoliubov vacuum
International Nuclear Information System (INIS)
Dziarmaga, J.; Sacha, K.; Karkuszewski, Z.
2005-01-01
Evolution of a Bose-Einstein condensate subject to a time-dependent external perturbation can be described by a time-dependent Bogoliubov theory: a condensate initially in its ground state evolves into a time-dependent excited state which can be formally written as a time-dependent Bogoliubov vacuum annihilated by time-dependent quasiparticle annihilation operators. We prove that any Bogoliubov vacuum can be brought to a diagonal form in a time-dependent orthonormal basis. This diagonal form is taylored for simulations of quantum measurements on excited condensates. As an example we work out a model of atomic interferometer where a trap potential is split in two parts by a potential barrier, and then atoms are released by opening the double-well trap potential. In the Gross-Pitaevskii approximation the released atoms give a high contrast interference pattern with repeatable position of interference fringes. In the two-mode tight-binding approximation the effect of phase diffusion makes the position of fringes fluctuate from experiment to experiment but every single realisation of experiment gives a high quality interference pattern. The time-dependent Bogoliubov theory is a more realistic description of the experiment which goes beyond both approximations. Using the diagonal time-dependent Bogoliubov vacuum we show that in addition to position fluctuations the interference pattern is also loosing its high quality contrast. (author)
Adaptive PVD Steganography Using Horizontal, Vertical, and Diagonal Edges in Six-Pixel Blocks
Directory of Open Access Journals (Sweden)
Anita Pradhan
2017-01-01
Full Text Available The traditional pixel value differencing (PVD steganographical schemes are easily detected by pixel difference histogram (PDH analysis. This problem could be addressed by adding two tricks: (i utilizing horizontal, vertical, and diagonal edges and (ii using adaptive quantization ranges. This paper presents an adaptive PVD technique using 6-pixel blocks. There are two variants. The proposed adaptive PVD for 2×3-pixel blocks is known as variant 1, and the proposed adaptive PVD for 3×2-pixel blocks is known as variant 2. For every block in variant 1, the four corner pixels are used to hide data bits using the middle column pixels for detecting the horizontal and diagonal edges. Similarly, for every block in variant 2, the four corner pixels are used to hide data bits using the middle row pixels for detecting the vertical and diagonal edges. The quantization ranges are adaptive and are calculated using the correlation of the two middle column/row pixels with the four corner pixels. The technique performs better as compared to the existing adaptive PVD techniques by possessing higher hiding capacity and lesser distortion. Furthermore, it has been proven that the PDH steganalysis and RS steganalysis cannot detect this proposed technique.
Off-diagonal generalization of the mixed-state geometric phase
International Nuclear Information System (INIS)
Filipp, Stefan; Sjoeqvist, Erik
2003-01-01
The concept of off-diagonal geometric phases for mixed quantal states in unitary evolution is developed. We show that these phases arise from three basic ideas: (1) fulfillment of quantum parallel transport of a complete basis, (2) a concept of mixed-state orthogonality adapted to unitary evolution, and (3) a normalization condition. We provide a method for computing the off-diagonal mixed-state phases to any order for unitarities that divide the parallel transported basis of Hilbert space into two parts: one part where each basis vector undergoes cyclic evolution and one part where all basis vectors are permuted among each other. We also demonstrate a purification based experimental procedure for the two lowest-order mixed-state phases and consider a physical scenario for a full characterization of the qubit mixed-state geometric phases in terms of polarization-entangled photon pairs. An alternative second order off-diagonal mixed-state geometric phase, which can be tested in single-particle experiments, is proposed
Directory of Open Access Journals (Sweden)
Jaroslav Peregrin
2017-11-01
Full Text Available It is a trivial fact that if we have a square table filled with numbers, we can always form a column which is not yet contained in the table. Despite its apparent triviality, this fact can lead us the most of the path-breaking results of logic in the second half of the nineteenth and the first half of the twentieth century. We explain how this fact can be used to show that there are more sequences of natural numbers than there are natural numbers, that there are more real numbers than natural numbers and that every set has more subsets than elements (all results due to Cantor; we indicate how this fact can be seen as underlying the celebrated Russell’s paradox; and we show how it can be employed to expose the most fundamental result of mathematical logic of the twentieth century, Gödel’s incompleteness theorem. Finally, we show how this fact yields the unsolvability of the halting problem for Turing machines.
Extremal black holes as exact string solutions
International Nuclear Information System (INIS)
Horowitz, G.T.; Tseytlin, A.A.
1994-01-01
We show that the leading order solution describing an extremal electrically charged black hole in string theory is, in fact, an exact solution to all orders in α' when interpreted in a Kaluza-Klein fashion. This follows from the observation that it can be obtained via dimensional reduction from a five-dimensional background which is proved to be an exact string solution
Exact Solutions for Einstein's Hyperbolic Geometric Flow
International Nuclear Information System (INIS)
He Chunlei
2008-01-01
In this paper we investigate the Einstein's hyperbolic geometric flow and obtain some interesting exact solutions for this kind of flow. Many interesting properties of these exact solutions have also been analyzed and we believe that these properties of Einstein's hyperbolic geometric flow are very helpful to understanding the Einstein equations and the hyperbolic geometric flow
On exact solutions of scattering problems
International Nuclear Information System (INIS)
Nikishov, P.Yu.; Plekhanov, E.B.; Zakhariev, B.N.
1982-01-01
Examples illustrating the quality of the reconstruction of potentials from single-channel scattering data by using exactly solvable models are given. Simple exact solutions for multi-channel systems with non-degenerated resonance singularities of the scattering matrix are derived
Quasi exact solution of the Rabi Hamiltonian
Koç, R; Tuetuencueler, H
2002-01-01
A method is suggested to obtain the quasi exact solution of the Rabi Hamiltonian. It is conceptually simple and can be easily extended to other systems. The analytical expressions are obtained for eigenstates and eigenvalues in terms of orthogonal polynomials. It is also demonstrated that the Rabi system, in a particular case, coincides with the quasi exactly solvable Poeschl-Teller potential.
Exact, almost and delayed fault detection
DEFF Research Database (Denmark)
Niemann, Hans Henrik; Saberi, Ali; Stoorvogel, Anton A.
1999-01-01
Considers the problem of fault detection and isolation while using zero or almost zero threshold. A number of different fault detection and isolation problems using exact or almost exact disturbance decoupling are formulated. Solvability conditions are given for the formulated design problems....... The l-step delayed fault detection problem is also considered for discrete-time systems....
Exact optics - III. Schwarzschild's spectrograph camera revised
Willstrop, R. V.
2004-03-01
Karl Schwarzschild identified a system of two mirrors, each defined by conic sections, free of third-order spherical aberration, coma and astigmatism, and with a flat focal surface. He considered it impractical, because the field was too restricted. This system was rediscovered as a quadratic approximation to one of Lynden-Bell's `exact optics' designs which have wider fields. Thus the `exact optics' version has a moderate but useful field, with excellent definition, suitable for a spectrograph camera. The mirrors are strongly aspheric in both the Schwarzschild design and the exact optics version.
Quaternionic formulation of the exact parity model
Energy Technology Data Exchange (ETDEWEB)
Brumby, S.P.; Foot, R.; Volkas, R.R.
1996-02-28
The exact parity model (EPM) is a simple extension of the standard model which reinstates parity invariance as an unbroken symmetry of nature. The mirror matter sector of the model can interact with ordinary matter through gauge boson mixing, Higgs boson mixing and, if neutrinos are massive, through neutrino mixing. The last effect has experimental support through the observed solar and atmospheric neutrino anomalies. In the paper it is shown that the exact parity model can be formulated in a quaternionic framework. This suggests that the idea of mirror matter and exact parity may have profound implications for the mathematical formulation of quantum theory. 13 refs.
Quaternionic formulation of the exact parity model
International Nuclear Information System (INIS)
Brumby, S.P.; Foot, R.; Volkas, R.R.
1996-01-01
The exact parity model (EPM) is a simple extension of the standard model which reinstates parity invariance as an unbroken symmetry of nature. The mirror matter sector of the model can interact with ordinary matter through gauge boson mixing, Higgs boson mixing and, if neutrinos are massive, through neutrino mixing. The last effect has experimental support through the observed solar and atmospheric neutrino anomalies. In the paper it is shown that the exact parity model can be formulated in a quaternionic framework. This suggests that the idea of mirror matter and exact parity may have profound implications for the mathematical formulation of quantum theory. 13 refs
Approximate Riemann solver for the two-fluid plasma model
International Nuclear Information System (INIS)
Shumlak, U.; Loverich, J.
2003-01-01
An algorithm is presented for the simulation of plasma dynamics using the two-fluid plasma model. The two-fluid plasma model is more general than the magnetohydrodynamic (MHD) model often used for plasma dynamic simulations. The two-fluid equations are derived in divergence form and an approximate Riemann solver is developed to compute the fluxes of the electron and ion fluids at the computational cell interfaces and an upwind characteristic-based solver to compute the electromagnetic fields. The source terms that couple the fluids and fields are treated implicitly to relax the stiffness. The algorithm is validated with the coplanar Riemann problem, Langmuir plasma oscillations, and the electromagnetic shock problem that has been simulated with the MHD plasma model. A numerical dispersion relation is also presented that demonstrates agreement with analytical plasma waves
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.
Comparison of Einstein-Boltzmann solvers for testing general relativity
Bellini, E.; Barreira, A.; Frusciante, N.; Hu, B.; Peirone, S.; Raveri, M.; Zumalacárregui, M.; Avilez-Lopez, A.; Ballardini, M.; Battye, R. A.; Bolliet, B.; Calabrese, E.; Dirian, Y.; Ferreira, P. G.; Finelli, F.; Huang, Z.; Ivanov, M. M.; Lesgourgues, J.; Li, B.; Lima, N. A.; Pace, F.; Paoletti, D.; Sawicki, I.; Silvestri, A.; Skordis, C.; Umiltà, C.; Vernizzi, F.
2018-01-01
We compare Einstein-Boltzmann solvers that include modifications to general relativity and find that, for a wide range of models and parameters, they agree to a high level of precision. We look at three general purpose codes that primarily model general scalar-tensor theories, three codes that model Jordan-Brans-Dicke (JBD) gravity, a code that models f (R ) gravity, a code that models covariant Galileons, a code that models Hořava-Lifschitz gravity, and two codes that model nonlocal models of gravity. Comparing predictions of the angular power spectrum of the cosmic microwave background and the power spectrum of dark matter for a suite of different models, we find agreement at the subpercent level. This means that this suite of Einstein-Boltzmann solvers is now sufficiently accurate for precision constraints on cosmological and gravitational parameters.
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)
A Nonlinear Modal Aeroelastic Solver for FUN3D
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.
Parallel Auxiliary Space AMG Solver for $H(div)$ Problems
Energy Technology Data Exchange (ETDEWEB)
Kolev, Tzanio V. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2012-12-18
We present a family of scalable preconditioners for matrices arising in the discretization of $H(div)$ problems using the lowest order Raviart--Thomas finite elements. Our approach belongs to the class of “auxiliary space''--based methods and requires only the finite element stiffness matrix plus some minimal additional discretization information about the topology and orientation of mesh entities. Also, we provide a detailed algebraic description of the theory, parallel implementation, and different variants of this parallel auxiliary space divergence solver (ADS) and discuss its relations to the Hiptmair--Xu (HX) auxiliary space decomposition of $H(div)$ [SIAM J. Numer. Anal., 45 (2007), pp. 2483--2509] and to the auxiliary space Maxwell solver AMS [J. Comput. Math., 27 (2009), pp. 604--623]. Finally, an extensive set of numerical experiments demonstrates the robustness and scalability of our implementation on large-scale $H(div)$ problems with large jumps in the material coefficients.
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter
The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...... are compared to FAS on a nonlinear saddle point problem with applications to porous media flow. It is demonstrated that FAS is faster than Newton’s method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate...
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.
Matlab Geochemistry: An open source geochemistry solver based on MRST
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.
Boltzmann Solver with Adaptive Mesh in Velocity Space
International Nuclear Information System (INIS)
Kolobov, Vladimir I.; Arslanbekov, Robert R.; Frolova, Anna A.
2011-01-01
We describe the implementation of direct Boltzmann solver with Adaptive Mesh in Velocity Space (AMVS) using quad/octree data structure. The benefits of the AMVS technique are demonstrated for the charged particle transport in weakly ionized plasmas where the collision integral is linear. We also describe the implementation of AMVS for the nonlinear Boltzmann collision integral. Test computations demonstrate both advantages and deficiencies of the current method for calculations of narrow-kernel distributions.
Resolving Neighbourhood Relations in a Parallel Fluid Dynamic Solver
Frisch, Jerome
2012-06-01
Computational Fluid Dynamics simulations require an enormous computational effort if a physically reasonable accuracy should be reached. Therefore, a parallel implementation is inevitable. This paper describes the basics of our implemented fluid solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on different processes. A special server concept keeps track of every grid over all processes while minimising data transfer between the nodes. © 2012 IEEE.
Menu-Driven Solver Of Linear-Programming Problems
Viterna, L. A.; Ferencz, D.
1992-01-01
Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).
A contribution to the great Riemann solver debate
Quirk, James J.
1992-01-01
The aims of this paper are threefold: to increase the level of awareness within the shock capturing community to the fact that many Godunov-type methods contain subtle flaws that can cause spurious solutions to be computed; to identify one mechanism that might thwart attempts to produce very high resolution simulations; and to proffer a simple strategy for overcoming the specific failings of individual Riemann solvers.
Applications of 3-D Maxwell solvers to accelerator design
International Nuclear Information System (INIS)
Chou, W.
1990-01-01
This paper gives a brief discussion on various applications of 3-D Maxwell solvers to accelerator design. The work is based on our experience gained during the design of the storage ring of the 7-GeV Advanced Photon Source (APS). It shows that 3-D codes are not replaceable in many cases, and that a lot of work remains to be done in order to establish a solid base for 3-D simulations
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)
An immersed interface vortex particle-mesh solver
Marichal, Yves; Chatelain, Philippe; Winckelmans, Gregoire
2014-11-01
An immersed interface-enabled vortex particle-mesh (VPM) solver is presented for the simulation of 2-D incompressible viscous flows, in the framework of external aerodynamics. Considering the simulation of free vortical flows, such as wakes and jets, vortex particle-mesh methods already provide a valuable alternative to standard CFD methods, thanks to the interesting numerical properties arising from its Lagrangian nature. Yet, accounting for solid bodies remains challenging, despite the extensive research efforts that have been made for several decades. The present immersed interface approach aims at improving the consistency and the accuracy of one very common technique (based on Lighthill's model) for the enforcement of the no-slip condition at the wall in vortex methods. Targeting a sharp treatment of the wall calls for substantial modifications at all computational levels of the VPM solver. More specifically, the solution of the underlying Poisson equation, the computation of the diffusion term and the particle-mesh interpolation are adapted accordingly and the spatial accuracy is assessed. The immersed interface VPM solver is subsequently validated on the simulation of some challenging impulsively started flows, such as the flow past a cylinder and that past an airfoil. Research Fellow (PhD student) of the F.R.S.-FNRS of Belgium.
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
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.
Direct solvers performance on h-adapted grids
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.
A Survey of Solver-Related Geometry and Meshing Issues
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.
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Energy Technology Data Exchange (ETDEWEB)
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
Pavarino, L.F.
2015-07-18
The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.
Direct solvers performance on h-adapted grids
Paszynski, Maciej
2015-05-27
We analyse the performance of direct solvers when applied to a system of linear equations arising from an hh-adapted, C0C0 finite element space. Theoretical estimates are derived for typical hh-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of hh-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones.
IGA-ADS: Isogeometric analysis FEM using ADS solver
Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav
2017-08-01
In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).
NITSOL: A Newton iterative solver for nonlinear systems
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)
1996-12-31
Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.
An Exact Confidence Region in Multivariate Calibration
Mathew, Thomas; Kasala, Subramanyam
1994-01-01
In the multivariate calibration problem using a multivariate linear model, an exact confidence region is constructed. It is shown that the region is always nonempty and is invariant under nonsingular transformations.
Euclidean shortest paths exact or approximate algorithms
Li, Fajie
2014-01-01
This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.
Exact solutions, numerical relativity and gravitational radiation
International Nuclear Information System (INIS)
Winicour, J.
1986-01-01
In recent years, there has emerged a new use for exact solutions to Einstein's equation as checks on the accuracy of numerical relativity codes. Much has already been written about codes based upon the space-like Cauchy problem. In the case of two Killing vectors, a numerical characteristic initial value formulation based upon two intersecting families of null hypersurfaces has successfully evolved the Schwarzschild and the colliding plane wave vacuum solutions. Here the author discusses, in the context of exact solutions, numerical studies of gravitational radiation based upon the null cone initial value problem. Every stage of progress in the null cone approach has been associated with exact solutions in some sense. He begins by briefly recapping this history. Then he presents two new examples illustrating how exact solutions can be useful
Fast Exact Euclidean Distance (FEED) Transformation
Schouten, Theo; Kittler, J.; van den Broek, Egon; Petrou, M.; Nixon, M.
2004-01-01
Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the distance transformation. The prohibitive computational cost of a naive implementation of traditional Euclidean Distance Transformation, is tackled by three operations: restriction of both the number
New exact wave solutions for Hirota equation
Indian Academy of Sciences (India)
2Department of Engineering Sciences, Faculty of Technology and Engineering,. University ... of nonlinear partial differential equations (NPDEs) in mathematical physics. Keywords. ... This method has been successfully applied to obtain exact.
Exact Algorithms for Solving Stochastic Games
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Koucky, Michal; Lauritzen, Niels
2012-01-01
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games....
On exactly soluble model in quantum electrodynamics
International Nuclear Information System (INIS)
Bogolubov, N.N.; Shumovsky, A.S.; Fam Le Kien
1984-01-01
Equations of motion describing the dynamics of three-level atom of ladder type interacting with two modes of quantized radiation field are solved exactly. Evolution of level population and photon rumbers under different unitial conditions is irvestigated
Analytic progress on exact lattice chiral symmetry
International Nuclear Information System (INIS)
Kikukawa, Y.
2002-01-01
Theoretical issues of exact chiral symmetry on the lattice are discussed and related recent works are reviewed. For chiral theories, the construction with exact gauge invariance is reconsidered from the point of view of domain wall fermion. The issue in the construction of electroweak theory is also discussed. For vector-like theories, we discuss unitarity (positivity), Hamiltonian approach, and several generalizations of the Ginsparg-Wilson relation (algebraic and odd-dimensional)
Exact and approximate multiple diffraction calculations
International Nuclear Information System (INIS)
Alexander, Y.; Wallace, S.J.; Sparrow, D.A.
1976-08-01
A three-body potential scattering problem is solved in the fixed scatterer model exactly and approximately to test the validity of commonly used assumptions of multiple scattering calculations. The model problem involves two-body amplitudes that show diffraction-like differential scattering similar to high energy hadron-nucleon amplitudes. The exact fixed scatterer calculations are compared to Glauber approximation, eikonal-expansion results and a noneikonal approximation
Mang, Andreas; Biros, George
2017-01-01
We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.
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
Tunneling splitting in double-proton transfer: direct diagonalization results for porphycene.
Smedarchina, Zorka; Siebrand, Willem; Fernández-Ramos, Antonio
2014-11-07
Zero-point and excited level splittings due to double-proton tunneling are calculated for porphycene and the results are compared with experiment. The calculation makes use of a multidimensional imaginary-mode Hamiltonian, diagonalized directly by an effective reduction of its dimensionality. Porphycene has a complex potential energy surface with nine stationary configurations that allow a variety of tunneling paths, many of which include classically accessible regions. A symmetry-based approach is used to show that the zero-point level, although located above the cis minimum, corresponds to concerted tunneling along a direct trans - trans path; a corresponding cis - cis path is predicted at higher energy. This supports the conclusion of a previous paper [Z. Smedarchina, W. Siebrand, and A. Fernández-Ramos, J. Chem. Phys. 127, 174513 (2007)] based on the instanton approach to a model Hamiltonian of correlated double-proton transfer. A multidimensional tunneling Hamiltonian is then generated, based on a double-minimum potential along the coordinate of concerted proton motion, which is newly evaluated at the RI-CC2/cc-pVTZ level of theory. To make it suitable for diagonalization, its dimensionality is reduced by treating fast weakly coupled modes in the adiabatic approximation. This results in a coordinate-dependent mass of tunneling, which is included in a unique Hermitian form into the kinetic energy operator. The reduced Hamiltonian contains three symmetric and one antisymmetric mode coupled to the tunneling mode and is diagonalized by a modified Jacobi-Davidson algorithm implemented in the Jadamilu software for sparse matrices. The results are in satisfactory agreement with the observed splitting of the zero-point level and several vibrational fundamentals after a partial reassignment, imposed by recently derived selection rules. They also agree well with instanton calculations based on the same Hamiltonian.
Energy Technology Data Exchange (ETDEWEB)
Fisher, A. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Bailey, D. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Kaiser, T. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eder, D. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Gunney, B. T. N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Masters, N. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Koniges, A. E. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Anderson, R. W. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-02-01
Here, we present a novel method for the solution of the diffusion equation on a composite AMR mesh. This approach is suitable for including diffusion based physics modules to hydrocodes that support ALE and AMR capabilities. To illustrate, we proffer our implementations of diffusion based radiation transport and heat conduction in a hydrocode called ALE-AMR. Numerical experiments conducted with the diffusion solver and associated physics packages yield 2nd order convergence in the L_{2} norm.
Single-Channel Noise Reduction using Unified Joint Diagonalization and Optimal Filtering
DEFF Research Database (Denmark)
Nørholm, Sidsel Marie; Benesty, Jacob; Jensen, Jesper Rindom
2014-01-01
consider two cases, where, respectively, no distortion and distortion are incurred on the desired signal. The former can be achieved when the covariance matrix of the desired signal is rank deficient, which is the case, for example, for voiced speech. In the latter case, the covariance matrix......In this paper, the important problem of single-channel noise reduction is treated from a new perspective. The problem is posed as a filtering problem based on joint diagonalization of the covariance matrices of the desired and noise signals. More specifically, the eigenvectors from the joint...
Caracterización constitutiva de las arenas limosas de Diagonal Mar
Sánchez Rodríguez, Raúl
2004-01-01
La construcción del centro comercial Diagonal Mar en el extremo este del litoral de Barcelona, sobre el depósito deltaico del río Besòs, requirió la ejecución de una gran excavación en arenas limosas saturadas, que alcanzara la cota -18.00 metros con respecto al nivel del mar, protegida por pantallas de unos 60 metros de profundidad. Desde las primeras fases de su ejecución, la instrumentación instalada detectó un comportamiento no esperado por parte del conjunto pantalla/terreno que poní...
Subspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions
DEFF Research Database (Denmark)
Hansen, Per Christian; Jensen, Søren Holdt
We survey the definitions and use of rank-revealing matrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both...... diagonal (eigenvalue and singular value) decompositions and rank-revealing triangular decompositions (ULV, URV, VSV, ULLV and ULLIV). In addition we show how the subspace-based algorithms can be evaluated and compared by means of simple FIR filter interpretations. The algorithms are illustrated...... with working Matlab code and applications in speech processing....
Randomly Generating Four Mixed Bell-Diagonal States with a Concurrences Sum to Unity
International Nuclear Information System (INIS)
Toh, S. P.; Zainuddin Hishamuddin; Foo Kim Eng
2012-01-01
A two-qubit system in quantum information theory is the simplest bipartite quantum system and its concurrence for pure and mixed states is well known. As a subset of two-qubit systems, Bell-diagonal states can be depicted by a very simple geometrical representation of a tetrahedron with sides of length 2√2. Based on this geometric representation, we propose a simple approach to randomly generate four mixed Bell decomposable states in which the sum of their concurrence is equal to one. (general)
International Nuclear Information System (INIS)
McGhee, J.M.; Roberts, R.M.; Morel, J.E.
1997-01-01
A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner for scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated
Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
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
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.
Directory of Open Access Journals (Sweden)
Musa Atar
2010-02-01
Full Text Available The goal of this study was to determine the effects of different joint angles and adhesives on diagonal tension performances of the box-type furniture made from solid wood and medium density fiberboard (MDF. After drilling joints of 75º, 78º, 81º, 84º, and 87º degrees on Oriental beech, European oak, Scotch pine, and MDF samples, a diagonal tensile test was applied on corners glued with polyvinyl acetate (PVAc and polyurethane (D-VTKA = Desmodur-Vinyl Trieketonol Acetate according to ASTM D 1037 standard. With reference to the obtained results, the highest tensile strength was obtained in European oak with PVAc glue and joint angle of 84º, while the lowest value was obtained in MDF with D-VTKA glue and joint angle of 75º. Considering the interaction of wood, adhesive, and joint angle, the highest tensile strength was obtained in European oak with joint angle of 81º and D-VTKA glue (1.089 N.mm-2, whereas the lowest tensile strength was determined in MDF with joint angle of 75º and PVAc glue (0.163 N.mm-2. Therefore, PVAc as glue and 81º as joint angle could be suggested to obtain some advantageous on the dovetail joint process for box-type furniture made from both solid wood and MDF.
The effects of skiing velocity on mechanical aspects of diagonal cross-country skiing.
Andersson, Erik; Pellegrini, Barbara; Sandbakk, Oyvind; Stüggl, Thomas; Holmberg, Hans-Christer
2014-09-01
Cycle and force characteristics were examined in 11 elite male cross-country skiers using the diagonal stride technique while skiing uphill (7.5°) on snow at moderate (3.5 ± 0.3 m/s), high (4.5 ± 0.4 m/s), and maximal (5.6 ± 0.6 m/s) velocities. Video analysis (50 Hz) was combined with plantar (leg) force (100 Hz), pole force (1,500 Hz), and photocell measurements. Both cycle rate and cycle length increased from moderate to high velocity, while cycle rate increased and cycle length decreased at maximal compared to high velocity. The kick time decreased 26% from moderate to maximal velocity, reaching 0.14 s at maximal. The relative kick and gliding times were only altered at maximal velocity, where these were longer and shorter, respectively. The rate of force development increased with higher velocity. At maximal velocity, sprint-specialists were 14% faster than distance-specialists due to greater cycle rate, peak leg force, and rate of leg force development. In conclusion, large peak leg forces were applied rapidly across all velocities and the shorter relative gliding and longer relative kick phases at maximal velocity allow maintenance of kick duration for force generation. These results emphasise the importance of rapid leg force generation in diagonal skiing.
Shrinkage-based diagonal Hotelling’s tests for high-dimensional small sample size data
Dong, Kai
2015-09-16
DNA sequencing techniques bring novel tools and also statistical challenges to genetic research. In addition to detecting differentially expressed genes, testing the significance of gene sets or pathway analysis has been recognized as an equally important problem. Owing to the “large pp small nn” paradigm, the traditional Hotelling’s T2T2 test suffers from the singularity problem and therefore is not valid in this setting. In this paper, we propose a shrinkage-based diagonal Hotelling’s test for both one-sample and two-sample cases. We also suggest several different ways to derive the approximate null distribution under different scenarios of pp and nn for our proposed shrinkage-based test. Simulation studies show that the proposed method performs comparably to existing competitors when nn is moderate or large, but it is better when nn is small. In addition, we analyze four gene expression data sets and they demonstrate the advantage of our proposed shrinkage-based diagonal Hotelling’s test.
Spectral/spatial optical CDMA code based on Diagonal Eigenvalue Unity
Najjar, Monia; Jellali, Nabiha; Ferchichi, Moez; Rezig, Houria
2017-11-01
A new two dimensional Diagonal Eigenvalue Unity (2D-DEU) code is developed for the spectral⧹spatial optical code division multiple access (OCDMA) system. It has a lower cross correlation value compared to two dimensional diluted perfect difference (2D-DPD), two dimensional Extended Enhanced Double Weight (2D-Extended-EDW) codes. Also, for the same code length, the number of users can be generated by the 2D-DEU code is higher than that provided by the others codes. The Bit Error Rate (BER) numerical analysis is developed by considering the effects of shot noise, phase induced intensity noise (PIIN), and thermal noise. The main result shows that BER is strongly affected by PIIN for the higher source power. The 2D-DEU code performance is compared with 2D-DPD, 2D-Extended-EDW and two dimensional multi-diagonals (2D-MD) codes. This comparison proves that the proposed 2D-DEU system outperforms the related codes.
Shrinkage-based diagonal Hotelling’s tests for high-dimensional small sample size data
Dong, Kai; Pang, Herbert; Tong, Tiejun; Genton, Marc G.
2015-01-01
DNA sequencing techniques bring novel tools and also statistical challenges to genetic research. In addition to detecting differentially expressed genes, testing the significance of gene sets or pathway analysis has been recognized as an equally important problem. Owing to the “large pp small nn” paradigm, the traditional Hotelling’s T2T2 test suffers from the singularity problem and therefore is not valid in this setting. In this paper, we propose a shrinkage-based diagonal Hotelling’s test for both one-sample and two-sample cases. We also suggest several different ways to derive the approximate null distribution under different scenarios of pp and nn for our proposed shrinkage-based test. Simulation studies show that the proposed method performs comparably to existing competitors when nn is moderate or large, but it is better when nn is small. In addition, we analyze four gene expression data sets and they demonstrate the advantage of our proposed shrinkage-based diagonal Hotelling’s test.
Numerical Aspects of Atomic Physics: Helium Basis Sets and Matrix Diagonalization
Jentschura, Ulrich; Noble, Jonathan
2014-03-01
We present a matrix diagonalization algorithm for complex symmetric matrices, which can be used in order to determine the resonance energies of auto-ionizing states of comparatively simple quantum many-body systems such as helium. The algorithm is based in multi-precision arithmetic and proceeds via a tridiagonalization of the complex symmetric (not necessarily Hermitian) input matrix using generalized Householder transformations. Example calculations involving so-called PT-symmetric quantum systems lead to reference values which pertain to the imaginary cubic perturbation (the imaginary cubic anharmonic oscillator). We then proceed to novel basis sets for the helium atom and present results for Bethe logarithms in hydrogen and helium, obtained using the enhanced numerical techniques. Some intricacies of ``canned'' algorithms such as those used in LAPACK will be discussed. Our algorithm, for complex symmetric matrices such as those describing cubic resonances after complex scaling, is faster than LAPACK's built-in routines, for specific classes of input matrices. It also offer flexibility in terms of the calculation of the so-called implicit shift, which is used in order to ``pivot'' the system toward the convergence to diagonal form. We conclude with a wider overview.
A combined joint diagonalization-MUSIC algorithm for subsurface targets localization
Wang, Yinlin; Sigman, John B.; Barrowes, Benjamin E.; O'Neill, Kevin; Shubitidze, Fridon
2014-06-01
This paper presents a combined joint diagonalization (JD) and multiple signal classification (MUSIC) algorithm for estimating subsurface objects locations from electromagnetic induction (EMI) sensor data, without solving ill-posed inverse-scattering problems. JD is a numerical technique that finds the common eigenvectors that diagonalize a set of multistatic response (MSR) matrices measured by a time-domain EMI sensor. Eigenvalues from targets of interest (TOI) can be then distinguished automatically from noise-related eigenvalues. Filtering is also carried out in JD to improve the signal-to-noise ratio (SNR) of the data. The MUSIC algorithm utilizes the orthogonality between the signal and noise subspaces in the MSR matrix, which can be separated with information provided by JD. An array of theoreticallycalculated Green's functions are then projected onto the noise subspace, and the location of the target is estimated by the minimum of the projection owing to the orthogonality. This combined method is applied to data from the Time-Domain Electromagnetic Multisensor Towed Array Detection System (TEMTADS). Examples of TEMTADS test stand data and field data collected at Spencer Range, Tennessee are analyzed and presented. Results indicate that due to its noniterative mechanism, the method can be executed fast enough to provide real-time estimation of objects' locations in the field.
Modified Dynamical Supergravity Breaking and Off-Diagonal Super-Higgs Effects
Gheorghiu, Tamara; Vacaru, Sergiu
2015-01-01
We argue that generic off-diagonal vacuum and nonvacuum solutions for Einstein manifolds mimic physical effects in modified gravity theories (MGTs) and encode certain models of $f(R,T,...)$, Ho\\vrava type with dynamical Lorentz symmetry breaking, induced effective mass for graviton etc. Our main goal is to investigate the dynamical breaking of local supersymmetry determined by off--diagonal solutions in MGTs encoded as effective Einstein spaces. This includes the Deser-Zumino super--Higgs effect, for instance, for an one--loop potential in a (simple but representative) model of $\\mathcal{N}=1, D=4$ supergravity. We develop and apply a new geometric techniques which allows us to decouple the gravitational field equations and integrate them in very general forms with metrics and vierbein fields depending on all spacetime coordinates via various generating and integration functions and parameters. We study how solutions in MGTs may be related to dynamical generation of a gravitino mass and supergravity breaking.
Theory and applications of generalized operator transforms for diagonalization of spin hamiltonians
International Nuclear Information System (INIS)
Schweiger, A.; Graf, F.; Rist, G.; Guenthard, Hs.H.
1976-01-01
A generalized transform formalism for vector operators is devised for diagonalization of a rather wide class of spin hamiltonians. The operator technique leads to equations for transformation matrices, for which analytical solutions are given. These allow analytical formulation of the transformed electron Zeeman term, the sum of the magnetic hyperfine and nuclear Zeeman term, the electric quadrupole term and the electronic and nuclear Zeeman coupling terms. The angular dependence of energy eigenvalues, frequencies and line strengths of ESR and ENDOR transitions to first order will be expressed as compact bilinear and quadratic forms of the columns of the matrix relating the molecular coordinate system to the laboratory system. Thereby the explicit calculation of rotation matrices may be completely avoided, though the latter formally express the operator transforms. The generalized operator transform is also carried out for the off-diagonal blocks originating from hyperfine interaction terms. This allows the second order energy terms to be expressed explicitly as compact hermitean forms of a simple structure, in particular the explicit structure of mixing terms between hyperfine interactions of different (sets of) nuclei is obtained. The relationship to the conventional Bleaney transform is discussed and the analogy to the generalized operator transform is worked out. (Auth.)
Impact of off-diagonal cross-shell interaction on 14C
Yuan, Cen-Xi
2017-10-01
A shell-model investigation is performed to show the impact on the structure of 14C from the off-diagonal cross-shell interaction, 〈pp|V|sdsd〉, which represents the mixing between the 0 and 2ħω configurations in the psd model space. The observed levels of the positive states in 14C can be nicely described in 0-4ħω or a larger model space through the well defined Hamiltonians, YSOX and WBP, with a reduction of the strength of the 〈pp|V|sdsd〉 interaction in the latter. The observed B(GT) values for 14C can be generally described by YSOX, while WBP and their modifications of the 〈pp|V|sdsd〉 interaction fail for some values. Further investigation shows the effect of such interactions on the configuration mixing and occupancy. The present work shows examples of how the off-diagonal cross-shell interaction strongly drives the nuclear structure. Supported by National Natural Science Foundation of China (11305272), Special Program for Applied Research on Super Computation of the NSFC Guangdong Joint Fund (the second phase), the Guangdong Natural Science Foundation (2014A030313217), the Pearl River S&T Nova Program of Guangzhou (201506010060), the Tip-top Scientific and Technical Innovative Youth Talents of Guangdong special support program (2016TQ03N575), and the Fundamental Research Funds for the Central Universities (17lgzd34)
The Diagon/Gel Implant: A Preliminary Report of 894 Cases
Directory of Open Access Journals (Sweden)
Constantin Stan, MD
2017-07-01
Full Text Available Background:. The breast has always been perceived as the emblem of femininity. Desire of having an ideal breast form has been of interest for a long time. Methods:. This preliminary article is a retrospective analysis of 894 cases of breast augmentation with Diagon/Gel breast implants covered with a micropolyurethane foam (Microthane. The surgical technique employed is a modified dual plane, which enables us to use a new anatomical implant to move the glandular parenchyma into a higher position. Results:. The study extended from January 2010 to September 2015, during which no breast implant developed Baker grade III or IV capsular contracture (CC and only a few adverse events occurred. Patients reported to be highly satisfied with the final outcome, which was very natural both in the form and movement. Conclusions:. The new concept of Diagon/Gel represents the next step in the evolutionary progress of breast implants and allows the surgeon to perform not only a breast augmentation but also parenchymal elevation, which otherwise would have required a mastopexy, and we have called it breast enhancement.
Han, Song; Zhang, Wei; Zhang, Jie
2017-09-01
A fast sweeping method (FSM) determines the first arrival traveltimes of seismic waves by sweeping the velocity model in different directions meanwhile applying a local solver. It is an efficient way to numerically solve Hamilton-Jacobi equations for traveltime calculations. In this study, we develop an improved FSM to calculate the first arrival traveltimes of quasi-P (qP) waves in 2-D tilted transversely isotropic (TTI) media. A local solver utilizes the coupled slowness surface of qP and quasi-SV (qSV) waves to form a quartic equation, and solve it numerically to obtain possible traveltimes of qP-wave. The proposed quartic solver utilizes Fermat's principle to limit the range of the possible solution, then uses the bisection procedure to efficiently determine the real roots. With causality enforced during sweepings, our FSM converges fast in a few iterations, and the exact number depending on the complexity of the velocity model. To improve the accuracy, we employ high-order finite difference schemes and derive the second-order formulae. There is no weak anisotropy assumption, and no approximation is made to the complex slowness surface of qP-wave. In comparison to the traveltimes calculated by a horizontal slowness shooting method, the validity and accuracy of our FSM is demonstrated.
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)
Exact solutions in three-dimensional gravity
Garcia-Diaz, Alberto A
2017-01-01
A self-contained text, systematically presenting the determination and classification of exact solutions in three-dimensional Einstein gravity. This book explores the theoretical framework and general physical and geometrical characteristics of each class of solutions, and includes information on the researchers responsible for their discovery. Beginning with the physical character of the solutions, these are identified and ordered on the basis of their geometrical invariant properties, symmetries, and algebraic classifications, or from the standpoint of their physical nature, for example electrodynamic fields, fluid, scalar field, or dilaton. Consequently, this text serves as a thorough catalogue on 2+1 exact solutions to the Einstein equations coupled to matter and fields, and on vacuum solutions of topologically massive gravity with a cosmological constant. The solutions are also examined from different perspectives, enabling a conceptual bridge between exact solutions of three- and four-dimensional gravit...
Exact solution of the hidden Markov processes
Saakian, David B.
2017-11-01
We write a master equation for the distributions related to hidden Markov processes (HMPs) and solve it using a functional equation. Thus the solution of HMPs is mapped exactly to the solution of the functional equation. For a general case the latter can be solved only numerically. We derive an exact expression for the entropy of HMPs. Our expression for the entropy is an alternative to the ones given before by the solution of integral equations. The exact solution is possible because actually the model can be considered as a generalized random walk on a one-dimensional strip. While we give the solution for the two second-order matrices, our solution can be easily generalized for the L values of the Markov process and M values of observables: We should be able to solve a system of L functional equations in the space of dimension M -1 .
Classes of exact Einstein Maxwell solutions
Komathiraj, K.; Maharaj, S. D.
2007-12-01
We find new classes of exact solutions to the Einstein Maxwell system of equations for a charged sphere with a particular choice of the electric field intensity and one of the gravitational potentials. The condition of pressure isotropy is reduced to a linear, second order differential equation which can be solved in general. Consequently we can find exact solutions to the Einstein Maxwell field equations corresponding to a static spherically symmetric gravitational potential in terms of hypergeometric functions. It is possible to find exact solutions which can be written explicitly in terms of elementary functions, namely polynomials and product of polynomials and algebraic functions. Uncharged solutions are regainable with our choice of electric field intensity; in particular we generate the Einstein universe for particular parameter values.
Using Solver Interfaced Virtual Reality in PEACER Design Process
International Nuclear Information System (INIS)
Lee, Hyong Won; Nam, Won Chang; Jeong, Seung Ho; Hwang, Il Soon; Shin, Jong Gye; Kim, Chang Hyo
2006-01-01
The recent research progress in the area of plant design and simulation highlighted the importance of integrating design and analysis models on a unified environment. For currently developed advanced reactors, either for power production or research, this effort has embraced impressive state-of-the-art information and automation technology. The PEACER (Proliferation-resistant, Environment friendly, Accident-tolerant, Continual and Economical Reactor) is one of the conceptual fast reactor system cooled by LBE (Lead Bismuth Eutectic) for nuclear waste transmutation. This reactor system is composed of innovative combination between design process and analysis. To establish an integrated design process by coupling design, analysis, and post-processing technology while minimizing the repetitive and costly manual interactions for design changes, a solver interfaced virtual reality simulation system (SIVR) has been developed for a nuclear transmutation energy system as PEACER. The SIVR was developed using Virtual Reality Modeling Language (VRML) in order to interface a commercial 3D CAD tool with various engineering solvers and to implement virtual reality presentation of results in a neutral format. In this paper, we have shown the SIVR approach viable and effective in the life-cycle management of complex nuclear energy systems, including design, construction and operation. For instance, The HELIOS is a down scaled model of the PEACER prototype to demonstrate the operability and safety as well as preliminary test of PEACER PLM (Product Life-cycle Management) with SIVR (Solver Interfaced Virtual Reality) concepts. Most components are designed by CATIA, which is 3D CAD tool. During the construction, 3D drawing by CATIA was effective to handle and arrange the loop configuration, especially when we changed the design. Most of all, This system shows the transparency of design and operational status of an energy complex to operators and inspectors can help ensure accident
Computational aeroelasticity using a pressure-based solver
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.
Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Vassilevski, Panayot S.; Villa, Umberto
2017-01-01
discretizations on general unstructured grids for a large class of nonlinear partial differential equations, including saddle point problems. The approximation properties of the coarse spaces ensure that our FAS approach for general unstructured meshes leads to optimal mesh-independent convergence rates similar...... to those achieved by geometric FAS on a nested hierarchy of refined meshes. In the numerical results, Newton’s method and Picard iterations with state-of-the-art inner linear solvers are compared to our FAS algorithm for the solution of a nonlinear saddle point problem arising from porous media flow...
Modeling Microbunching from Shot Noise Using Vlasov Solvers
International Nuclear Information System (INIS)
Venturini, Marco; Venturini, Marco; Zholents, Alexander
2008-01-01
Unlike macroparticle simulations, which are sensitive to unphysical statistical fluctuations when the number of macroparticles is smaller than the bunch population, direct methods for solving the Vlasov equation are free from sampling noise and are ideally suited for studying microbunching instabilities evolving from shot noise. We review a 2D (longitudinal dynamics) Vlasov solver we have recently developed to study the microbunching instability in the beam delivery systems for x-ray FELs and present an application to FERMI(at)Elettra. We discuss, in particular, the impact of the spreader design on microbunching
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
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf
2010-01-01
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.
Modelo de selección de cartera con Solver
Directory of Open Access Journals (Sweden)
P. Fogués Zornoza
2012-04-01
Full Text Available In this paper, we present an example of linear optimization in the context of degrees in Economics or Business Administration and Management. We show techniques that enable students to go deep and investigate in real problems that have been modelled using the Excel platform. The model shown here has been developed by a student and it consists in minimizing the absolute deviations over the average expected return of a portfolio of securities, using the solver tool that it is included in this software.
Exactly solvable birth and death processes
International Nuclear Information System (INIS)
Sasaki, Ryu
2009-01-01
Many examples of exactly solvable birth and death processes, a typical stationary Markov chain, are presented together with the explicit expressions of the transition probabilities. They are derived by similarity transforming exactly solvable 'matrix' quantum mechanics, which is recently proposed by Odake and the author [S. Odake and R. Sasaki, J. Math. Phys. 49, 053503 (2008)]. The (q-) Askey scheme of hypergeometric orthogonal polynomials of a discrete variable and their dual polynomials play a central role. The most generic solvable birth/death rates are rational functions of q x (with x being the population) corresponding to the q-Racah polynomial.
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
Exact finite volume expectation values of local operators in excited states
Energy Technology Data Exchange (ETDEWEB)
Pozsgay, B. [MTA-BME “Momentum” Statistical Field Theory Research Group,Budafoki út 8, 1111 Budapest (Hungary); Szécsényi, I.M. [Department of Mathematical Sciences, Durham University, South Road, Durham, DH1 3LE (United Kingdom); Institute of Theoretical Physics, Eötvös Loránd University,Pázmány Péter sétány 1/A, 1117 Budapest (Hungary); Takács, G. [MTA-BME “Momentum” Statistical Field Theory Research Group,Budafoki út 8, 1111 Budapest (Hungary); Department of Theoretical Physics, Budapest University of Technology and Economics,Budafoki út 8, 1111 Budapest (Hungary)
2015-04-07
We present a conjecture for the exact expression of finite volume expectation values in excited states in integrable quantum field theories, which is an extension of an earlier conjecture to the case of general diagonal factorized scattering with bound states and a nontrivial bootstrap structure. The conjectured expression is a spectral expansion which uses the exact form factors and the excited state thermodynamic Bethe Ansatz as building blocks. The conjecture is proven for the case of the trace of the energy-moment tensor. Concerning its validity for more general operators, we provide numerical evidence using the truncated conformal space approach. It is found that the expansion fails to be well-defined for small values of the volume in cases when the singularity structure of the TBA equations undergoes a non-trivial rearrangement under some critical value of the volume. Despite these shortcomings, the conjectured expression is expected to be valid for all volumes for most of the excited states, and as an expansion above the critical volume for the rest.
Multishell method: Exact treatment of a cluster in an effective medium
International Nuclear Information System (INIS)
Gonis, A.; Garland, J.W.
1977-01-01
A method is presented for the exact determination of the Green's function of a cluster embedded in a given effective medium. This method, the multishell method, is applicable even to systems with off-diagonal disorder, extended-range hopping, multiple bands, and/or hybridization, and is computationally practicable for any system described by a tight-binding or interpolation-scheme Hamiltonian. It allows one to examine the effects of local environment on the densities of states and site spectral weight functions of disordered systems. For any given analytic effective medium characterized by a non-negative density of states the method yields analytic cluster Green's functions and non-negative site spectral weight functions. Previous methods used for the calculation of the Green's function of a cluster embedded in a given effective medium have not been exact. The results of numerical calculations for model systems show that even the best of these previous methods can lead to substantial errors, at least for small clusters in two- and three-dimensional lattices. These results also show that fluctuations in local environment have large effects on site spectral weight functions, even in cases in which the single-site coherent-potential approximation yields an accurate overall density of states
Construction of exact constants of motion and effective models for many-body localized systems
Goihl, M.; Gluza, M.; Krumnow, C.; Eisert, J.
2018-04-01
One of the defining features of many-body localization is the presence of many quasilocal conserved quantities. These constants of motion constitute a cornerstone to an intuitive understanding of much of the phenomenology of many-body localized systems arising from effective Hamiltonians. They may be seen as local magnetization operators smeared out by a quasilocal unitary. However, accurately identifying such constants of motion remains a challenging problem. Current numerical constructions often capture the conserved operators only approximately, thus restricting a conclusive understanding of many-body localization. In this work, we use methods from the theory of quantum many-body systems out of equilibrium to establish an alternative approach for finding a complete set of exact constants of motion which are in addition guaranteed to represent Pauli-z operators. By this we are able to construct and investigate the proposed effective Hamiltonian using exact diagonalization. Hence, our work provides an important tool expected to further boost inquiries into the breakdown of transport due to quenched disorder.
Exact finite volume expectation values of local operators in excited states
International Nuclear Information System (INIS)
Pozsgay, B.; Szécsényi, I.M.; Takács, G.
2015-01-01
We present a conjecture for the exact expression of finite volume expectation values in excited states in integrable quantum field theories, which is an extension of an earlier conjecture to the case of general diagonal factorized scattering with bound states and a nontrivial bootstrap structure. The conjectured expression is a spectral expansion which uses the exact form factors and the excited state thermodynamic Bethe Ansatz as building blocks. The conjecture is proven for the case of the trace of the energy-moment tensor. Concerning its validity for more general operators, we provide numerical evidence using the truncated conformal space approach. It is found that the expansion fails to be well-defined for small values of the volume in cases when the singularity structure of the TBA equations undergoes a non-trivial rearrangement under some critical value of the volume. Despite these shortcomings, the conjectured expression is expected to be valid for all volumes for most of the excited states, and as an expansion above the critical volume for the rest.
Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds
National Research Council Canada - National Science Library
MacDonald, Jason E
2007-01-01
The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources...
On the implicit density based OpenFOAM solver for turbulent compressible flows
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.
Energy Technology Data Exchange (ETDEWEB)
Sun, Ke-Wei [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China); Division of Materials Science, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798 (Singapore); Fujihashi, Yuta; Ishizaki, Akihito [Institute for Molecular Science, National Institutes of Natural Sciences, Okazaki 444-8585 (Japan); Zhao, Yang, E-mail: YZhao@ntu.edu.sg [Division of Materials Science, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798 (Singapore)
2016-05-28
A master equation approach based on an optimized polaron transformation is adopted for dynamics simulation with simultaneous diagonal and off-diagonal spin-boson coupling. Two types of bath spectral density functions are considered, the Ohmic and the sub-Ohmic. The off-diagonal coupling leads asymptotically to a thermal equilibrium with a nonzero population difference P{sub z}(t → ∞) ≠ 0, which implies localization of the system, and it also plays a role in restraining coherent dynamics for the sub-Ohmic case. Since the new method can extend to the stronger coupling regime, we can investigate the coherent-incoherent transition in the sub-Ohmic environment. Relevant phase diagrams are obtained for different temperatures. It is found that the sub-Ohmic environment allows coherent dynamics at a higher temperature than the Ohmic environment.
Exactly solvable energy-dependent potentials
International Nuclear Information System (INIS)
Garcia-Martinez, J.; Garcia-Ravelo, J.; Pena, J.J.; Schulze-Halberg, A.
2009-01-01
We introduce a method for constructing exactly-solvable Schroedinger equations with energy-dependent potentials. Our method is based on converting a general linear differential equation of second order into a Schroedinger equation with energy-dependent potential. Particular examples presented here include harmonic oscillator, Coulomb and Morse potentials with various types of energy dependence.
Exact relativistic cylindrical solution of disordered radiation
International Nuclear Information System (INIS)
Fonseca Teixeira, A.F. da; Wolk, I.; Som, M.M.
1976-05-01
A source free disordered distribution of electromagnetic radiation is considered in Einstein' theory, and a time independent exact solution with cylindrical symmetry is obtained. The gravitation and pressure effects of the radiation alone are sufficient to give the distribution an equilibrium. A finite maximum concentration is found on the axis of symmetry, and decreases monotonically to zero outwards. Timelike and null geodesics are discussed
New exact solutions for two nonlinear equations
International Nuclear Information System (INIS)
Wang Quandi; Tang Minying
2008-01-01
In this Letter, we investigate two nonlinear equations given by u t -u xxt +3u 2 u x =2u x u xx +uu xxx and u t -u xxt +4u 2 u x =3u x u xx +uu xxx . Through some special phase orbits we obtain four new exact solutions for each equation above. Some previous results are extended
Exact Optimum Design of Segmented Thermoelectric Generators
Directory of Open Access Journals (Sweden)
M. Zare
2016-01-01
Full Text Available A considerable difference between experimental and theoretical results has been observed in the studies of segmented thermoelectric generators (STEGs. Because of simplicity, the approximate methods are widely used for design and optimization of the STEGs. This study is focused on employment of exact method for design and optimization of STEGs and comparison of exact and approximate results. Thus, using new highly efficient thermoelectric materials, four STEGs are proposed to operate in the temperature range of 300 to 1300 kelvins. The proposed STEGs are optimally designed to achieve maximum efficiency. Design and performance characteristics of the optimized generators including maximum conversion efficiency and length of elements are calculated through both exact and approximate methods. The comparison indicates that the approximate method can cause a difference up to 20% in calculation of some design characteristics despite its appropriate results in efficiency calculation. The results also show that the maximum theoretical efficiency of 23.08% is achievable using the new proposed STEGs. Compatibility factor of the selected materials for the proposed STEGs is also calculated using both exact and approximate methods. The comparison indicates a negligible difference in calculation of compatibility factor, despite the considerable difference in calculation of reduced efficiency (temperature independence efficiency.
Exactly marginal deformations from exceptional generalised geometry
Energy Technology Data Exchange (ETDEWEB)
Ashmore, Anthony [Merton College, University of Oxford,Merton Street, Oxford, OX1 4JD (United Kingdom); Mathematical Institute, University of Oxford,Andrew Wiles Building, Woodstock Road, Oxford, OX2 6GG (United Kingdom); Gabella, Maxime [Institute for Advanced Study,Einstein Drive, Princeton, NJ 08540 (United States); Graña, Mariana [Institut de Physique Théorique, CEA/Saclay,91191 Gif-sur-Yvette (France); Petrini, Michela [Sorbonne Université, UPMC Paris 05, UMR 7589, LPTHE,75005 Paris (France); Waldram, Daniel [Department of Physics, Imperial College London,Prince Consort Road, London, SW7 2AZ (United Kingdom)
2017-01-27
We apply exceptional generalised geometry to the study of exactly marginal deformations of N=1 SCFTs that are dual to generic AdS{sub 5} flux backgrounds in type IIB or eleven-dimensional supergravity. In the gauge theory, marginal deformations are parametrised by the space of chiral primary operators of conformal dimension three, while exactly marginal deformations correspond to quotienting this space by the complexified global symmetry group. We show how the supergravity analysis gives a geometric interpretation of the gauge theory results. The marginal deformations arise from deformations of generalised structures that solve moment maps for the generalised diffeomorphism group and have the correct charge under the generalised Reeb vector, generating the R-symmetry. If this is the only symmetry of the background, all marginal deformations are exactly marginal. If the background possesses extra isometries, there are obstructions that come from fixed points of the moment maps. The exactly marginal deformations are then given by a further quotient by these extra isometries. Our analysis holds for any N=2 AdS{sub 5} flux background. Focussing on the particular case of type IIB Sasaki-Einstein backgrounds we recover the result that marginal deformations correspond to perturbing the solution by three-form flux at first order. In various explicit examples, we show that our expression for the three-form flux matches those in the literature and the obstruction conditions match the one-loop beta functions of the dual SCFT.
Exactly solvable position dependent mass schroedinger equation
International Nuclear Information System (INIS)
Koc, R.; Tuetuencueler, H.; Koercuek, E.
2002-01-01
Exact solution of the Schrodinger equation with a variable mass is presented. We have derived general expressions for the eigenstates and eigenvalues of the position dependent mass systems. We provide supersymmetric and Lie algebraic methods to discuss the position dependent mass systems
Compiling Relational Bayesian Networks for Exact Inference
DEFF Research Database (Denmark)
Jaeger, Manfred; Darwiche, Adnan; Chavira, Mark
2006-01-01
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available PRIMULA tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference...
Compiling Relational Bayesian Networks for Exact Inference
DEFF Research Database (Denmark)
Jaeger, Manfred; Chavira, Mark; Darwiche, Adnan
2004-01-01
We describe a system for exact inference with relational Bayesian networks as defined in the publicly available \\primula\\ tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference by evaluating...
Development of a Cartesian grid based CFD solver (CARBS)
International Nuclear Information System (INIS)
Vaidya, A.M.; Maheshwari, N.K.; Vijayan, P.K.
2013-12-01
Formulation for 3D transient incompressible CFD solver is developed. The solution of variable property, laminar/turbulent, steady/unsteady, single/multi specie, incompressible with heat transfer in complex geometry will be obtained. The formulation can handle a flow system in which any number of arbitrarily shaped solid and fluid regions are present. The solver is based on the use of Cartesian grids. A method is proposed to handle complex shaped objects and boundaries on Cartesian grids. Implementation of multi-material, different types of boundary conditions, thermo physical properties is also considered. The proposed method is validated by solving two test cases. 1 st test case is that of lid driven flow in inclined cavity. 2 nd test case is the flow over cylinder. The 1 st test case involved steady internal flow subjected to WALL boundaries. The 2 nd test case involved unsteady external flow subjected to INLET, OUTLET and FREE-SLIP boundary types. In both the test cases, non-orthogonal geometry was involved. It was found that, under such a wide conditions, the Cartesian grid based code was found to give results which were matching well with benchmark data. Convergence characteristics are excellent. In all cases, the mass residue was converged to 1E-8. Based on this, development of 3D general purpose code based on the proposed approach can be taken up. (author)
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
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.
Domain decomposition solvers for nonlinear multiharmonic finite element equations
Copeland, D. M.
2010-01-01
In many practical applications, for instance, in computational electromagnetics, the excitation is time-harmonic. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple elliptic equation for the amplitude. This is true for linear problems, but not for nonlinear problems. However, due to the periodicity of the solution, we can expand the solution in a Fourier series. Truncating this Fourier series and approximating the Fourier coefficients by finite elements, we arrive at a large-scale coupled nonlinear system for determining the finite element approximation to the Fourier coefficients. The construction of fast solvers for such systems is very crucial for the efficiency of this multiharmonic approach. In this paper we look at nonlinear, time-harmonic potential problems as simple model problems. We construct and analyze almost optimal solvers for the Jacobi systems arising from the Newton linearization of the large-scale coupled nonlinear system that one has to solve instead of performing the expensive time-integration procedure. © 2010 de Gruyter.
Application of alternating decision trees in selecting sparse linear solvers
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.
Dissipative motion perturbation theory and exact solutions
International Nuclear Information System (INIS)
Lodder, J.J.
1976-06-01
Dissipative motion of classical and quantum systems is described. In particular, attention is paid to systems coupled to the radiation field. A dissipative equation of motion for a particle in an arbitrary potential coupled to the radiation field is derived by means of perturbation theory. The usual divrgencies associated with the radiation field are eliminated by the application of a theory of generalized functions. This theory is developed as a subject in its own right and is presented independently. The introduction of classical zero-point energy makes the classical equa tion of motion for the phase density formally the same as its quantum counterpart. In particular, it is shown that the classical zero-point energy prevents the collapse of a classical H-atom and gives rise to a classical ground state. For systems with a quadratic Hamiltoian, the equation of motion can be solved exactly, even in the continuum limit for the radiation field, by means of the new generalized functions. Classically, the Fokker-Planck equation is found without any approximations, and quantum mechanically, the only approximation is the neglect of the change in the ground state caused by the interaction. The derivation is valid even for strong damping and arbitrarily short times. There is no transient time. For harmonic oscillators complete equivalence is shown to exist between quantum mechanics and classical mechanics with zero-point energy. A discussion of the derivation of the Pauli equation is given and perturbation theory is compared with the exact derivation. The exactly solvable models are used to calculate the Langevin force of the radiation field. The result is that the classical Langevin force is exactly delta-correlated, while the quantum Langevin force is not delta-correlated at all. The fluctuation-dissipation theorem is shown to be an exact consequence of the solution to the equations of motion
International Nuclear Information System (INIS)
Nagashima, Keisuke; Fukuda, Takeshi
1991-12-01
Evidence of temperature gradient driven particle flux was observed from the sawtooth induced density propagation phenomenon in JT-60. This off-diagonal particle flux was confirmed using the numerical calculation of measured chord integrated electron density. It was shown that the discrepancies between thermal and particle diffusivities estimated from the perturbation method and energy/particle balance analysis can be explained by considering the flux equations with off-diagonal transport terms. These flux equations were compared with the E x B convective fluxes in an electro-static drift wave instability and it was found that the E x B fluxes are consistent with several experimental observations. (author)
Directory of Open Access Journals (Sweden)
Yurisman
2010-11-01
Full Text Available This paper presents results of numerical and experimental study of shear link behavior, utilizing diagonal stiffener on web of steel profile to increase shear link performance in an eccentric braced frame (EBF of a steel structure system. The specimen is to examine the behavior of shear link by using diagonal stiffener on web part under static monotonic and cyclic load. The cyclic loading pattern conducted in the experiment is adjusted according to AISC loading standards 2005. Analysis was carried out using non-linear finite element method using MSC/NASTRAN software. Link was modeled as CQUAD shell element. Along the boundary of the loading area the nodal are constraint to produce only one direction loading. The length of the link in this analysis is 400mm of the steel profile of WF 200.100. Important parameters considered to effect significantly to the performance of shear link have been analyzed, namely flange and web thicknesses, , thickness and length of web stiffener, thickness of diagonal stiffener and geometric of diagonal stiffener. The behavior of shear link with diagonal web stiffener was compared with the behavior of standard link designed based on AISC 2005 criteria. Analysis results show that diagonal web stiffener is capable to increase shear link performance in terms of stiffness, strength and energy dissipation in supporting lateral load. However, differences in displacement ductility’s between shear links with diagonal stiffener and shear links based on AISC standards have not shown to be significant. Analysis results also show thickness of diagonal stiffener and geometric model of stiffener to have a significant influence on the performance of shear links. To perform validation of the numerical study, the research is followed by experimental work conducted in Structural Mechanic Laboratory Center for Industrial Engineering ITB. The Structures and Mechanics Lab rotary PAU-ITB. The experiments were carried out using three test
KRYSI, Ordinary Differential Equations Solver with Sdirk Krylov Method
International Nuclear Information System (INIS)
Hindmarsh, A.C.; Norsett, S.P.
2001-01-01
1 - Description of program or function: KRYSI is a set of FORTRAN subroutines for solving ordinary differential equations initial value problems. It is suitable for both stiff and non-stiff systems. When solving the implicit stage equations in the stiff case, KRYSI uses a Krylov subspace iteration method called the SPIGMR (Scaled Preconditioned Incomplete Generalized Minimum Residual) method. No explicit Jacobian storage is required, except where used in pre- conditioning. A demonstration problem is included with a description of two pre-conditioners that are natural for its solution by KRYSI. 2 - Method of solution: KRYSI uses a three-stage, third-order singly diagonally implicit Runge-Kutta (SDIRK) method. In the stiff case, a preconditioned Krylov subspace iteration within a (so-called) inexact Newton iteration is used to solve the system of nonlinear algebraic equations
Off-diagonal mass generation for Yang-Mills theories in the maximal Abelian gauge
International Nuclear Information System (INIS)
Dudal, D.; Verschelde, H.; Sarandy, M.S.
2007-01-01
We investigate a dynamical mass generation mechanism for the off-diagonal gluons and ghosts in SU(N) Yang-Mills theories, quantized in the maximal Abelian gauge. Such a mass can be seen as evidence for the Abelian dominance in that gauge. It originates from the condensation of a mixed gluon-ghost operator of mass dimension two, which lowers the vacuum energy. We construct an effective potential for this operator by a combined use of the local composite operators technique with algebraic renormalization and we discuss the gauge parameter independence of the results. We also show that it is possible to connect the vacuum energy, due to the mass dimension two condensate discussed here, with the non-trivial vacuum energy originating from the condensate 2 μ >, which has attracted much attention in the Landau gauge. (author)
Energy Technology Data Exchange (ETDEWEB)
Serra, Maria; Husar, Attila; Feroldi, Diego; Riera, Jordi [Institut de Robotica i Informatica Industrial, Universitat Politecnica de Catalunya, Consejo Superior de Investigaciones Cientificas, C. Llorens i Artigas 4, 08028 Barcelona (Spain)
2006-08-25
This work is focused on the selection of operating conditions in polymer electrolyte membrane fuel cells. It analyses efficiency and controllability aspects, which change from one operating point to another. Specifically, several operating points that deliver the same amount of net power are compared, and the comparison is done at different net power levels. The study is based on a complex non-linear model, which has been linearised at the selected operating points. Different linear analysis tools are applied to the linear models and results show important controllability differences between operating points. The performance of diagonal control structures with PI controllers at different operating points is also studied. A method for the tuning of the controllers is proposed and applied. The behaviour of the controlled system is simulated with the non-linear model. Conclusions indicate a possible trade-off between controllability and optimisation of hydrogen consumption. (author)
Zhang, Li-qiang; Ma, Ting-ting; Yu, Chang-shui
2018-03-01
The computability of the quantifier of a given quantum resource is the essential challenge in the resource theory and the inevitable bottleneck for its application. Here we focus on the measurement-induced nonlocality and present a redefinition in terms of the skew information subject to a broken observable. It is shown that the obtained quantity possesses an obvious operational meaning, can tackle the noncontractivity of the measurement-induced nonlocality and has analytic expressions for pure states, (2 ⊗d )-dimensional quantum states, and some particular high-dimensional quantum states. Most importantly, an inverse approximate joint diagonalization algorithm, due to its simplicity, high efficiency, stability, and state independence, is presented to provide almost-analytic expressions for any quantum state, which can also shed light on other aspects in physics. To illustrate applications as well as demonstrate the validity of the algorithm, we compare the analytic and numerical expressions of various examples and show their perfect consistency.
Zoeller, Ludwig
2016-04-01
Modern methods of low temperature thermochronology are able to throw light on the geomorphological development of macrorelief landforms. A rarely investigated problem concerns the orientation and morphotectonic evolution of Central European uplands (low to mid-elevation mountain ranges). A conspicuous NW-SE striking boundary takes course through Germany from the Osning and Teutoburg Forest in the NW to the Bavarian Forest in the SE. I call this line the "geomorphological diagonal". East of this line, more or less NW-SE striking morphotectonic features (e.g., Harz Mountains, Sudety) dominate the macrorelief up to the eastern border of Central Europe (Thornquist-Teysseire Lineament), with the exception of the Ohre Rift and Central Bohemia. West of this line, the macrorelief is either characterized by NNE-SSW to N-S oriented structures (e.g., Upper Rhine Rift) and, to a lesser extent, by (S)SW-(E)NE mountain ranges (southern Rhenish Slate Mountains and Ore Mountains) or by no predominance at all. In the Lower Rhine Embayment and along the Middle Rhine River, (N)NW-(S)SE directed morphotectonic features influence the low mountain ranges. In several cases geologists have proven that NW-SE morphotectonic structures are related to the Upper Cretaceous (Santonian to Campanian) "basin inversion" (e.g., von Eynatten et al. 2008). A compilation of low temperature thermochronological data (AFT, [U-Th]/He) from Central Europe clearly supports strong crustal cooling during the Upper Cretaceous and lowermost Tertiary in morphotectonically protruded crustal blocks east of the geomorphological diagonal, whereas west of it the age data available so far exhibit a much larger scatter from Upper Paleozoic to Tertiary without clear evidence of an outstanding Upper Cretaceous crustal cooling event. Based on this data I hypothesize that east of the diagonal macroforms of uplifted denudation surfaces ("peneplains" or "etchplains") may be inherited from the Cretaceous whereas west of it
Chui, S T; Wang, Weihua; Zhou, L; Lin, Z F
2009-07-22
We study the propagation of plane electromagnetic waves through different systems consisting of arrays of split rings of different orientations. Many extraordinary EM phenomena were discovered in such systems, contributed by the off-diagonal magnetoelectric susceptibilities. We find a mode such that the electric field becomes elliptically polarized with a component in the longitudinal direction (i.e. parallel to the wavevector). Even though the group velocity [Formula: see text] and the wavevector k are parallel, in the presence of damping, the Poynting vector does not just get 'broadened', but can possess a component perpendicular to the wavevector. The speed of light can be real even when the product ϵμ is negative. Other novel properties are explored.
Thermoelectric behavior of conducting polymers: On the possibility of off-diagonal thermoelectricity
Energy Technology Data Exchange (ETDEWEB)
Mateeva, N; Niculescu, H; Schlenoff, J; Testardi, L
1997-07-01
Non-cubic materials, when structurally aligned, possess sufficient anisotropy to exhibit thermoelectric effects where the electrical and thermal currents are orthogonal (off-diagonal thermoelectricity). The authors discuss the benefits of this form of thermoelectricity for devices and describe a search for suitable properties in the air-stable conducting polymers polyaniline and polypyrrole. They find the simple and general correlation that the logarithm of the electrical conductivity scales linearly with the Seebeck coefficient on doping but with proportionality in excess of the conventional prediction for thermoelectricity. The correlation is unexpected in its universality and unfavorable for thermoelectric applications. A simple model suggests that mobile charges of both signs exist in these polymers, and this leads to reduced thermoelectric efficiency. They also briefly discuss non air-stable polyacetylene, where ambipolar transport does not appear to occur, and where properties seem more favorable for thermoelectricity.
International Nuclear Information System (INIS)
Lay-Ekuakille, Aimé; Pariset, Carlo; Trotta, Amerigo
2010-01-01
The FDM (filter diagonalization method), an interesting technique used in nuclear magnetic resonance data processing for tackling FFT (fast Fourier transform) limitations, can be used by considering pipelines, especially complex configurations, as a vascular apparatus with arteries, veins, capillaries, etc. Thrombosis, which might occur in humans, can be considered as a leakage for the complex pipeline, the human vascular apparatus. The choice of eigenvalues in FDM or in spectra-based techniques is a key issue in recovering the solution of the main equation (for FDM) or frequency domain transformation (for FFT) in order to determine the accuracy in detecting leaks in pipelines. This paper deals with the possibility of improving the leak detection accuracy of the FDM technique thanks to a robust algorithm by assessing the problem of eigenvalues, making it less experimental and more analytical using Tikhonov-based regularization techniques. The paper starts from the results of previous experimental procedures carried out by the authors
A class of symmetric Bell diagonal entanglement witnesses—a geometric perspective
International Nuclear Information System (INIS)
Chruściński, Dariusz
2014-01-01
We provide a class of Bell diagonal entanglement witnesses displaying an additional local symmetry—a maximal commutative subgroup of the unitary group U(n). Remarkably, this class of witnesses is parameterized by a torus being a maximal commutative subgroup of an orthogonal group SO(n−1). It is shown that a generic element from the class defines an indecomposable entanglement witness. The paper provides a geometric perspective for some aspects of the entanglement theory and an interesting interplay between group theory and block-positive operators in C n ⊗C n . This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘50 years of Bell’s theorem’. (paper)
Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable
Energy Technology Data Exchange (ETDEWEB)
Menkov, V. [Indiana Univ., Bloomington, IN (United States)
1996-12-31
An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.
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...
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
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...
Scalable Newton-Krylov solver for very large power flow problems
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
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...
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
The SX Solver: A Computer Program for Analyzing Solvent-Extraction Equilibria: Version 3.0
International Nuclear Information System (INIS)
Lumetta, Gregg J.
2001-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 tributyl phosphate has been modeled to illustrate the programs use
Exact WKB analysis and cluster algebras
International Nuclear Information System (INIS)
Iwaki, Kohei; Nakanishi, Tomoki
2014-01-01
We develop the mutation theory in the exact WKB analysis using the framework of cluster algebras. Under a continuous deformation of the potential of the Schrödinger equation on a compact Riemann surface, the Stokes graph may change the topology. We call this phenomenon the mutation of Stokes graphs. Along the mutation of Stokes graphs, the Voros symbols, which are monodromy data of the equation, also mutate due to the Stokes phenomenon. We show that the Voros symbols mutate as variables of a cluster algebra with surface realization. As an application, we obtain the identities of Stokes automorphisms associated with periods of cluster algebras. The paper also includes an extensive introduction of the exact WKB analysis and the surface realization of cluster algebras for nonexperts. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Cluster algebras in mathematical physics’. (paper)
Exact computation of the 9-j symbols
International Nuclear Information System (INIS)
Lai Shantao; Chiu Jingnan
1992-01-01
A useful algebraic formula for the 9-j symbol has been rewritten for convenient use on a computer. A simple FORTRAN program for the exact computation of 9-j symbols has been written for the VAX with VMS version V5,4-1 according to this formula. The results agree with the approximate values in existing literature. Some specific values of 9-j symbols needed for the intensity and alignments of three-photon nonresonant transitions are tabulated. Approximate 9-j symbol values beyond the limitation of the computer can also be computed by this program. The computer code of the exact computation of 3-j, 6-j and 9-j symbols are available through electronic mail upon request. (orig.)
Lattice sigma models with exact supersymmetry
International Nuclear Information System (INIS)
Simon Catterall; Sofiane Ghadab
2004-01-01
We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and twisted versions of conventional supersymmetric sigma models with N=2 supersymmetry. The fermionic symmetry corresponds to a scalar BRST charge built from the original supercharges. The lattice theories possess local actions and exhibit no fermion doubling. In the two and four dimensional theories we show that these lattice theories are invariant under additional discrete symmetries. We argue that the presence of these exact symmetries ensures that no fine tuning is required to achieve N=2 supersymmetry in the continuum limit. As a concrete example we show preliminary numerical results from a simulation of the O(3) supersymmetric sigma model in two dimensions. (author)
Model checking exact cost for attack scenarios
DEFF Research Database (Denmark)
Aslanyan, Zaruhi; Nielson, Flemming
2017-01-01
Attack trees constitute a powerful tool for modelling security threats. Many security analyses of attack trees can be seamlessly expressed as model checking of Markov Decision Processes obtained from the attack trees, thus reaping the benefits of a coherent framework and a mature tool support....... However, current model checking does not encompass the exact cost analysis of an attack, which is standard for attack trees. Our first contribution is the logic erPCTL with cost-related operators. The extended logic allows to analyse the probability of an event satisfying given cost bounds and to compute...... the exact cost of an event. Our second contribution is the model checking algorithm for erPCTL. Finally, we apply our framework to the analysis of attack trees....
Exact folded-band chaotic oscillator.
Corron, Ned J; Blakely, Jonathan N
2012-06-01
An exactly solvable chaotic oscillator with folded-band dynamics is shown. The oscillator is a hybrid dynamical system containing a linear ordinary differential equation and a nonlinear switching condition. Bounded oscillations are provably chaotic, and successive waveform maxima yield a one-dimensional piecewise-linear return map with segments of both positive and negative slopes. Continuous-time dynamics exhibit a folded-band topology similar to Rössler's oscillator. An exact solution is written as a linear convolution of a fixed basis pulse and a discrete binary sequence, from which an equivalent symbolic dynamics is obtained. The folded-band topology is shown to be dependent on the symbol grammar.
Exact geodesic distances in FLRW spacetimes
Cunningham, William J.; Rideout, David; Halverson, James; Krioukov, Dmitri
2017-11-01
Geodesics are used in a wide array of applications in cosmology and astrophysics. However, it is not a trivial task to efficiently calculate exact geodesic distances in an arbitrary spacetime. We show that in spatially flat (3 +1 )-dimensional Friedmann-Lemaître-Robertson-Walker (FLRW) spacetimes, it is possible to integrate the second-order geodesic differential equations, and derive a general method for finding both timelike and spacelike distances given initial-value or boundary-value constraints. In flat spacetimes with either dark energy or matter, whether dust, radiation, or a stiff fluid, we find an exact closed-form solution for geodesic distances. In spacetimes with a mixture of dark energy and matter, including spacetimes used to model our physical universe, there exists no closed-form solution, but we provide a fast numerical method to compute geodesics. A general method is also described for determining the geodesic connectedness of an FLRW manifold, provided only its scale factor.
New exact solutions of the Dirac equation
International Nuclear Information System (INIS)
Bagrov, V.G.; Gitman, D.M.; Zadorozhnyj, V.N.; Lavrov, P.M.; Shapovalov, V.N.
1980-01-01
Search for new exact solutions of the Dirac and Klein-Gordon equations are in progress. Considered are general properties of the Dirac equation solutions for an electron in a purely magnetic field, in combination with a longitudinal magnetic and transverse electric fields. New solutions for the equations of charge motion in an electromagnetic field of axial symmetry and in a nonstationary field of a special form have been found for potentials selected concretely
Exact BPS bound for noncommutative baby Skyrmions
International Nuclear Information System (INIS)
Domrin, Andrei; Lechtenfeld, Olaf; Linares, Román; Maceda, Marco
2013-01-01
The noncommutative baby Skyrme model is a Moyal deformation of the two-dimensional sigma model plus a Skyrme term, with a group-valued or Grassmannian target. Exact abelian solitonic solutions have been identified analytically in this model, with a singular commutative limit. Inside any given Grassmannian, we establish a BPS bound for the energy functional, which is saturated by these baby Skyrmions. This asserts their stability for unit charge, as we also test in second-order perturbation theory
Exact solutions and singularities in string theory
International Nuclear Information System (INIS)
Horowitz, G.T.; Tseytlin, A.A.
1994-01-01
We construct two new classes of exact solutions to string theory which are not of the standard plane wave of gauged WZW type. Many of these solutions have curvature singularities. The first class includes the fundamental string solution, for which the string coupling vanishes near the singularity. This suggests that the singularity may not be removed by quantum corrections. The second class consists of hybrids of plane wave and gauged WZW solutions. We discuss a four-dimensional example in detail
Exactly and completely integrable nonlinear dynamical systems
International Nuclear Information System (INIS)
Leznov, A.N.; Savel'ev, M.V.
1987-01-01
The survey is devoted to a consitent exposition of the group-algebraic methods for the integration of systems of nonlinear partial differential equations possessing a nontrivial internal symmetry algebra. Samples of exactly and completely integrable wave and evolution equations are considered in detail, including generalized (periodic and finite nonperiodic Toda lattice, nonlinear Schroedinger, Korteweg-de Vries, Lotka-Volterra equations, etc.) For exactly integrable systems the general solutions of the Cauchy and Goursat problems are given in an explicit form, while for completely integrable systems an effective method for the construction of their soliton solutions is developed. Application of the developed methods to a differential geometry problem of classification of the integrable manifolds embeddings is discussed. For exactly integrable systems the supersymmetric extensions are constructed. By the example of the generalized Toda lattice a quantization scheme is developed. It includes an explicit derivation of the corresponding Heisenberg operators and their desription in terms of the quantum algebras of the Hopf type. Among multidimensional systems the four-dimensional self-dual Yang-Mills equations are investigated most attentively with a goal of constructing their general solutions
International Nuclear Information System (INIS)
Cannoni, Mirco
2015-01-01
We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature x * = m χ /T * . The point x., which coincides with the stationary point of the equation for the quantity Δ = Y-Y 0 , is where the maximum departure of the WIMPs abundance Y from the thermal value Y 0 is reached. For each mass m χ and total annihilation cross section left angle σ ann υ r right angle, the temperature x * and the actual WIMPs abundance Y(x * ) are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval x ≥ x * . The matching of the two abundances at x * is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1.2 % in the case of S-wave and P-wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics. (orig.)
Cannoni, Mirco
2015-03-01
We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature . The point , which coincides with the stationary point of the equation for the quantity , is where the maximum departure of the WIMPs abundance from the thermal value is reached. For each mass and total annihilation cross section , the temperature and the actual WIMPs abundance are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval . The matching of the two abundances at is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1-2 % in the case of -wave and -wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics.
Exact Theory of Compressible Fluid Turbulence
Drivas, Theodore; Eyink, Gregory
2017-11-01
We obtain exact results for compressible turbulence with any equation of state, using coarse-graining/filtering. We find two mechanisms of turbulent kinetic energy dissipation: scale-local energy cascade and ``pressure-work defect'', or pressure-work at viscous scales exceeding that in the inertial-range. Planar shocks in an ideal gas dissipate all kinetic energy by pressure-work defect, but the effect is omitted by standard LES modeling of pressure-dilatation. We also obtain a novel inverse cascade of thermodynamic entropy, injected by microscopic entropy production, cascaded upscale, and removed by large-scale cooling. This nonlinear process is missed by the Kovasznay linear mode decomposition, treating entropy as a passive scalar. For small Mach number we recover the incompressible ``negentropy cascade'' predicted by Obukhov. We derive exact Kolmogorov 4/5th-type laws for energy and entropy cascades, constraining scaling exponents of velocity, density, and internal energy to sub-Kolmogorov values. Although precise exponents and detailed physics are Mach-dependent, our exact results hold at all Mach numbers. Flow realizations at infinite Reynolds are ``dissipative weak solutions'' of compressible Euler equations, similarly as Onsager proposed for incompressible turbulence.
Development of axisymmetric lattice Boltzmann flux solver for complex multiphase flows
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.
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.
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)
Litofsky, Joshua; Viswanathan, Rama
2015-01-01
Matrix diagonalization, the key technique at the heart of modern computational chemistry for the numerical solution of the Schrödinger equation, can be easily introduced in the physical chemistry curriculum in a pedagogical context using simple Hückel molecular orbital theory for p bonding in molecules. We present details and results of…
International Nuclear Information System (INIS)
Tanaka, Takeshi; Aizawa, Tadanori; Katou, Kazuzo; Ogasawara, Ken; Kirigaya, Hajime
1993-01-01
Characteristics of 201 Tl myocardial SPECT and ventriculography were studied in 13 patients with acute diagonal branch myocardial infarction. Rest 201 Tl myocardial SPECT and left ventriculography were underwent in chronic phase. In 5 patients electrocardiogram (ECG) changes in acute phase were not definite. In 6 patients it was difficult to identify the obstructed coronary artery with coronary angiography in acute phase. Mean value of maximum creatine phosphokinese (CPK) was 854 (458-1,774) U/l. It seemed to be difficult to diagnose acute diagonal branch myocardial infarction with ECG and/or coronary angiography. In all patients defects were noted on 201 Tl SPECT. Defects were small and noted in the central anterior wall and not in the septum. In 2 patients defects were noted at apex. In left ventriculography dyskinetic motion was noted in 10 patients; one patient showed apical aneurysm and 3 patients showed anterior wall aneurysm. In 3 patients anterior wall showed akinesis. It was concluded that 201 Tl myocardial SPECT were useful for detecting diagonal branch lesion. In case of diagonal branch myocardial infarction size of defects were small and defects were not noted in the septum, however aneurysmal motion was frequently noted. (author)
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
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.
Workload Characterization of CFD Applications Using Partial Differential Equation Solvers
Waheed, Abdul; Yan, Jerry; Saini, Subhash (Technical Monitor)
1998-01-01
Workload characterization is used for modeling and evaluating of computing systems at different levels of detail. We present workload characterization for a class of Computational Fluid Dynamics (CFD) applications that solve Partial Differential Equations (PDEs). This workload characterization focuses on three high performance computing platforms: SGI Origin2000, EBM SP-2, a cluster of Intel Pentium Pro bases PCs. We execute extensive measurement-based experiments on these platforms to gather statistics of system resource usage, which results in workload characterization. Our workload characterization approach yields a coarse-grain resource utilization behavior that is being applied for performance modeling and evaluation of distributed high performance metacomputing systems. In addition, this study enhances our understanding of interactions between PDE solver workloads and high performance computing platforms and is useful for tuning these applications.
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
Extending the QUDA Library with the eigCG Solver
Energy Technology Data Exchange (ETDEWEB)
Strelchenko, Alexei [Fermilab; Stathopoulos, Andreas [William-Mary Coll.
2014-12-12
While the incremental eigCG algorithm [ 1 ] is included in many LQCD software packages, its realization on GPU micro-architectures was still missing. In this session we report our experi- ence of the eigCG implementation in the QUDA library. In particular, we will focus on how to employ the mixed precision technique to accelerate solutions of large sparse linear systems with multiple right-hand sides on GPUs. Although application of mixed precision techniques is a well-known optimization approach for linear solvers, its utilization for the eigenvector com- puting within eigCG requires special consideration. We will discuss implementation aspects of the mixed precision deflation and illustrate its numerical behavior on the example of the Wilson twisted mass fermion matrix inversions
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan; Kolmbauer, Michael; Langer, Ulrich
2010-01-01
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan
2010-10-05
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Diffusion of Zonal Variables Using Node-Centered Diffusion Solver
Energy Technology Data Exchange (ETDEWEB)
Yang, T B
2007-08-06
Tom Kaiser [1] has done some preliminary work to use the node-centered diffusion solver (originally developed by T. Palmer [2]) in Kull for diffusion of zonal variables such as electron temperature. To avoid numerical diffusion, Tom used a scheme developed by Shestakov et al. [3] and found their scheme could, in the vicinity of steep gradients, decouple nearest-neighbor zonal sub-meshes leading to 'alternating-zone' (red-black mode) errors. Tom extended their scheme to couple the sub-meshes with appropriate chosen artificial diffusion and thereby solved the 'alternating-zone' problem. Because the choice of the artificial diffusion coefficient could be very delicate, it is desirable to use a scheme that does not require the artificial diffusion but still able to avoid both numerical diffusion and the 'alternating-zone' problem. In this document we present such a scheme.
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....
A General Symbolic PDE Solver Generator: Beyond Explicit Schemes
Directory of Open Access Journals (Sweden)
K. Sheshadri
2003-01-01
Full Text Available This paper presents an extension of our Mathematica- and MathCode-based symbolic-numeric framework for solving a variety of partial differential equation (PDE problems. The main features of our earlier work, which implemented explicit finite-difference schemes, include the ability to handle (1 arbitrary number of dependent variables, (2 arbitrary dimensionality, and (3 arbitrary geometry, as well as (4 developing finite-difference schemes to any desired order of approximation. In the present paper, extensions of this framework to implicit schemes and the method of lines are discussed. While C++ code is generated, using the MathCode system for the implicit method, Modelica code is generated for the method of lines. The latter provides a preliminary PDE support for the Modelica language. Examples illustrating the various aspects of the solver generator are presented.
GPU accelerated FDTD solver and its application in MRI.
Chi, J; Liu, F; Jin, J; Mason, D G; Crozier, S
2010-01-01
The finite difference time domain (FDTD) method is a popular technique for computational electromagnetics (CEM). The large computational power often required, however, has been a limiting factor for its applications. In this paper, we will present a graphics processing unit (GPU)-based parallel FDTD solver and its successful application to the investigation of a novel B1 shimming scheme for high-field magnetic resonance imaging (MRI). The optimized shimming scheme exhibits considerably improved transmit B(1) profiles. The GPU implementation dramatically shortened the runtime of FDTD simulation of electromagnetic field compared with its CPU counterpart. The acceleration in runtime has made such investigation possible, and will pave the way for other studies of large-scale computational electromagnetic problems in modern MRI which were previously impractical.
Visualising magnetic fields numerical equation solvers in action
Beeteson, John Stuart
2001-01-01
Visualizing Magnetic Fields: Numerical Equation Solvers in Action provides a complete description of the theory behind a new technique, a detailed discussion of the ways of solving the equations (including a software visualization of the solution algorithms), the application software itself, and the full source code. Most importantly, there is a succinct, easy-to-follow description of each procedure in the code.The physicist Michael Faraday said that the study of magnetic lines of force was greatly influential in leading him to formulate many of those concepts that are now so fundamental to our modern world, proving to him their "great utility as well as fertility." Michael Faraday could only visualize these lines in his mind's eye and, even with modern computers to help us, it has been very expensive and time consuming to plot lines of force in magnetic fields
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Ibeid, Huda
2014-05-04
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
Directory of Open Access Journals (Sweden)
Jaime Sepúlveda
2007-01-01
Full Text Available Las intervenciones en salud pública dirigidas a niños en México han ubicado a este país entre los siete países encaminados a cumplir las metas de reducción de la mortalidad infantil para 2015. La información para este estudio se ha tomado de diferentes fuentes: los censos poblacionales; los registros de mortalidad de la Secretaría de Salud y del Instituto Nacional de Estadística, Geografía e Informática; el registro nominal de niños recolectado por el Programa de Vacunación Universal; y las encuestas nacionales de nutrición. Con estos datos se estudió la asociación temporal y la plausibilidad biológica de las diferentes intervenciones en salud pública, para explicar la reducción de las tasas de mortalidad entre niños, infantes y recién nacidos. Las tasas de mortalidad en menores de cinco años han descendido de casi 64 muertes a menos de 23 por cada 1 000 niños nacidos vivos registrados en los últimos 25 años. Se observó una reducción drástica en las tasas de mortalidad por diarrea, junto con la eliminación de polio, difteria y sarampión. El estado nutricional de los niños mejoró de manera significativa en cuanto a bajo peso para la talla, baja talla para la edad y bajo peso para la edad. En los últimos 25 años, se mantuvieron intervenciones altamente costo-efectivas que acercaron los servicios de salud de atención primaria a los hogares, lo que aquí se ha llamado estrategia diagonal. A pesar de que no es posible establecer una relación de causalidad entre la reducción de la mortalidad en menores de cinco años y los factores investigados, se presenta evidencia basada en la asociación temporal y en la plausibilidad biológica que indica que la alta cobertura de las intervenciones de salud pública, los avances en educación de las mujeres, protección social, disponibilidad de agua potable y saneamiento, así como nutrición, impactaron en el resultado observado. Por otro lado, el liderazgo y la continuidad
Incompressible SPH (ISPH) with fast Poisson solver on a GPU
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.
Quasi-exact solutions of nonlinear differential equations
Kudryashov, Nikolay A.; Kochanov, Mark B.
2014-01-01
The concept of quasi-exact solutions of nonlinear differential equations is introduced. Quasi-exact solution expands the idea of exact solution for additional values of parameters of differential equation. These solutions are approximate solutions of nonlinear differential equations but they are close to exact solutions. Quasi-exact solutions of the the Kuramoto--Sivashinsky, the Korteweg--de Vries--Burgers and the Kawahara equations are founded.
D'Alessandro, Valerio; Binci, Lorenzo; Montelpare, Sergio; Ricci, Renato
2018-01-01
Open-source CFD codes provide suitable environments for implementing and testing low-dissipative algorithms typically used to simulate turbulence. In this research work we developed CFD solvers for incompressible flows based on high-order explicit and diagonally implicit Runge-Kutta (RK) schemes for time integration. In particular, an iterated PISO-like procedure based on Rhie-Chow correction was used to handle pressure-velocity coupling within each implicit RK stage. For the explicit approach, a projected scheme was used to avoid the "checker-board" effect. The above-mentioned approaches were also extended to flow problems involving heat transfer. It is worth noting that the numerical technology available in the OpenFOAM library was used for space discretization. In this work, we additionally explore the reliability and effectiveness of the proposed implementations by computing several unsteady flow benchmarks; we also show that the numerical diffusion due to the time integration approach is completely canceled using the solution techniques proposed here.
Energy Technology Data Exchange (ETDEWEB)
Cannoni, Mirco [Universidad de Huelva, Departamento de Fisica Aplicada, Facultad de Ciencias Experimentales, Huelva (Spain)
2015-03-01
We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature x{sub *} = m{sub χ}/T{sub *}. The point x., which coincides with the stationary point of the equation for the quantity Δ = Y-Y{sub 0}, is where the maximum departure of the WIMPs abundance Y from the thermal value Y{sub 0} is reached. For each mass m{sub χ} and total annihilation cross section left angle σ{sub ann}υ{sub r} right angle, the temperature x{sub *} and the actual WIMPs abundance Y(x{sub *}) are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval x ≥ x{sub *}. The matching of the two abundances at x{sub *} is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1.2 % in the case of S-wave and P-wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics. (orig.)
An exact solution in Einstein-Cartan
International Nuclear Information System (INIS)
Roque, W.L.
1982-01-01
The exact solution of the field equations of the Einstein-Cartan theory is obtained for an artificial dust of radially polarized spins, with spherical symmetry and static. For a best estimation of the effect due the spin, the energy-momentum metric tensor is considered null. The gravitational field dynamics is studied for several torsion strengths, through the massive and spinless test-particle moviment, in particular for null torsion Schwarzschild solutions is again obtained. It is observed that the gravitational effects related to the torsin (spin) sometimes are attractives sometimes are repulsives, depending of the torsion values and of the test-particle position and velocity. (L.C.) [pt
Exact renormalization group equations: an introductory review
Bagnuls, C.; Bervillier, C.
2001-07-01
We critically review the use of the exact renormalization group equations (ERGE) in the framework of the scalar theory. We lay emphasis on the existence of different versions of the ERGE and on an approximation method to solve it: the derivative expansion. The leading order of this expansion appears as an excellent textbook example to underline the nonperturbative features of the Wilson renormalization group theory. We limit ourselves to the consideration of the scalar field (this is why it is an introductory review) but the reader will find (at the end of the review) a set of references to existing studies on more complex systems.
Exactly soluble problems in statistical mechanics
International Nuclear Information System (INIS)
Yang, C.N.
1983-01-01
In the last few years, a number of two-dimensional classical and one-dimensional quantum mechanical problems in statistical mechanics have been exactly solved. Although these problems range over models of diverse physical interest, their solutions were obtained using very similar mathematical methods. In these lectures, the main points of the methods are discussed. In this introductory lecture, an overall survey of all these problems without going into the detailed method of solution is given. In later lectures, they shall concentrate on one particular problem: the delta function interaction in one dimension, and go into the details of that problem
An exact approach for aggregated formulations
DEFF Research Database (Denmark)
Gamst, Mette; Spoorendonk, Simon; Røpke, Stefan
Aggregating formulations is a powerful approach for problems to take on tractable forms. Aggregation may lead to loss of information, i.e. the aggregated formulation may be an approximation of the original problem. In branch-and-bound context, aggregation can also complicate branching, e.g. when...... optimality cannot be guaranteed by branching on aggregated variables. We present a generic exact solution method to remedy the drawbacks of aggregation. It combines the original and aggregated formulations and applies Benders' decomposition. We apply the method to the Split Delivery Vehicle Routing Problem....
Implementation of density-based solver for all speeds in the framework of OpenFOAM
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.
Acceleration of FDTD mode solver by high-performance computing techniques.
Han, Lin; Xi, Yanping; Huang, Wei-Ping
2010-06-21
A two-dimensional (2D) compact finite-difference time-domain (FDTD) mode solver is developed based on wave equation formalism in combination with the matrix pencil method (MPM). The method is validated for calculation of both real guided and complex leaky modes of typical optical waveguides against the bench-mark finite-difference (FD) eigen mode solver. By taking advantage of the inherent parallel nature of the FDTD algorithm, the mode solver is implemented on graphics processing units (GPUs) using the compute unified device architecture (CUDA). It is demonstrated that the high-performance computing technique leads to significant acceleration of the FDTD mode solver with more than 30 times improvement in computational efficiency in comparison with the conventional FDTD mode solver running on CPU of a standard desktop computer. The computational efficiency of the accelerated FDTD method is in the same order of magnitude of the standard finite-difference eigen mode solver and yet require much less memory (e.g., less than 10%). Therefore, the new method may serve as an efficient, accurate and robust tool for mode calculation of optical waveguides even when the conventional eigen value mode solvers are no longer applicable due to memory limitation.
The impact of improved sparse linear solvers on industrial engineering applications
Energy Technology Data Exchange (ETDEWEB)
Heroux, M. [Cray Research, Inc., Eagan, MN (United States); Baddourah, M.; Poole, E.L.; Yang, Chao Wu
1996-12-31
There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.
van der Waal, Jeroen; Daenekindt, Stijn; de Koster, Willem
2017-12-01
Various studies on the health consequences of socio-economic position address social mobility. They aim to uncover whether health outcomes are affected by: (1) social mobility, besides, (2) social origin, and (3) social destination. Conventional methods do not, however, estimate these three effects separately, which may produce invalid conclusions. We highlight that diagonal reference models (DRMs) overcome this problem, which we illustrate by focusing on overweight/obesity (OWOB). Using conventional methods (logistic-regression analyses with dummy variables) and DRMs, we examine the effects of intergenerational educational mobility on OWOB (BMI ≥ 25 kg/m 2 ) using survey data representative of the Dutch population aged 18-45 (1569 males, 1771 females). Conventional methods suggest that mobility effects on OWOB are present. Analyses with DRMs, however, indicate that no such effects exist. Conventional analyses of the health consequences of social mobility may produce invalid results. We, therefore, recommend the use of DRMs. DRMs also validly estimate the health consequences of other types of social mobility (e.g. intra- and intergenerational occupational and income mobility) and status inconsistency (e.g. in educational or occupational attainment between partners).
Goodson, James L; Alexander, James P; Linkins, Robert W; Orenstein, Walter A
2017-12-01
In 1988, an estimated 350,000 children were paralyzed by polio and 125 countries reported polio cases, the World Health Assembly passed a resolution to achieve polio eradication by 2000, and the Global Polio Eradication Initiative (GPEI) was established as a partnership focused on eradication. Today, following eradication efforts, polio cases have decreased >99% and eradication of all three types of wild polioviruses is approaching. However, since polio resources substantially support disease surveillance and other health programs, losing polio assets could reverse progress toward achieving Global Vaccine Action Plan goals. Areas covered: As the end of polio approaches and GPEI funds and capacity decrease, we document knowledge, experience, and lessons learned from 30 years of polio eradication. Expert commentary: Transitioning polio assets to measles and rubella (MR) elimination efforts would accelerate progress toward global vaccination coverage and equity. MR elimination feasibility and benefits have long been established. Focusing efforts on MR elimination after achieving polio eradication would make a permanent impact on reducing child mortality but should be done through a 'diagonal approach' of using measles disease transmission to identify areas possibly susceptible to other vaccine-preventable diseases and to strengthen the overall immunization and health systems to achieve disease-specific goals.
Directory of Open Access Journals (Sweden)
Chee Zhou Kam
2013-01-01
Full Text Available A laminated composite plate element with an interface description is developed using the finite element approach to investigate the bending performance of two-layer cross-ply laminated composite plates in presence of a diagonally perturbed localized interfacial degeneration between laminae. The stiffness of the laminate is expressed through the assembly of the stiffnesses of lamina sub-elements and interface element, the latter of which is formulated adopting the well-defined virtually zero-thickness concept. To account for the extent of both shear and axial weak bonding, a degeneration ratio is introduced in the interface formulation. The model has the advantage of simulating a localized weak bonding at arbitrary locations, with various degeneration areas and intensities, under the influence of numerous boundary conditions since the interfacial description is expressed discretely. Numerical results show that the bending behavior of laminate is significantly affected by the aforementioned parameters, the greatest effect of which is experienced by those with a localized total interface degeneration, representing the case of local delamination.
Diagonally Implicit Runge-Kutta Methods for Ordinary Differential Equations. A Review
Kennedy, Christopher A.; Carpenter, Mark H.
2016-01-01
A review of diagonally implicit Runge-Kutta (DIRK) methods applied to rst-order ordinary di erential equations (ODEs) is undertaken. The goal of this review is to summarize the characteristics, assess the potential, and then design several nearly optimal, general purpose, DIRK-type methods. Over 20 important aspects of DIRKtype methods are reviewed. A design study is then conducted on DIRK-type methods having from two to seven implicit stages. From this, 15 schemes are selected for general purpose application. Testing of the 15 chosen methods is done on three singular perturbation problems. Based on the review of method characteristics, these methods focus on having a stage order of two, sti accuracy, L-stability, high quality embedded and dense-output methods, small magnitudes of the algebraic stability matrix eigenvalues, small values of aii, and small or vanishing values of the internal stability function for large eigenvalues of the Jacobian. Among the 15 new methods, ESDIRK4(3)6L[2]SA is recommended as a good default method for solving sti problems at moderate error tolerances.
Triple Diagonal modeling: A mechanism to focus productivity improvement for business success
Energy Technology Data Exchange (ETDEWEB)
Levine, L.O. [Pacific Northwest Lab., Richland, WA (United States); Villareal, L.D. [Army Depot, Corpus Christi, TX (United States)
1993-09-01
Triple Diagonal (M) modeling is a technique to help quickly diagnose an organization`s existing production system and to identify significant improvement opportunities in executing, controlling, and planning operations. TD modeling is derived from ICAM Definition Language (IDEF 0)-also known as Structured Analysis and Design Technique. It has been used successfully at several Department of Defense remanufacturing facilities trying to accomplish significant production system modernization. TD has several advantages over other modeling techniques. First, it quickly does ``As-ls`` analysis and then moves on to identify improvements. Second, creating one large diagram makes it easier to share the TD model throughout an organization, rather than the many linked 8 1/2 {times} 11`` drawings used in traditional decomposition approaches. Third, it acts as a communication mechanism to share understanding about improvement opportunities that may cross existing functional/organizational boundaries. Finally, TD acts as a vehicle to build a consensus on a prioritized list of improvement efforts that ``hangs togethers as an agenda for systemic changes in the production system and the improved integration of support functions.
Replica Fourier Tansforms on Ultrametric Trees, and Block-Diagonalizing Multi-Replica Matrices
de Dominicis, C.; Carlucci, D. M.; Temesvári, T.
1997-01-01
The analysis of objects living on ultrametric trees, in particular the block-diagonalization of 4-replica matrices M^{α β;γ^δ}, is shown to be dramatically simplified through the introduction of properly chosen operations on those objects. These are the Replica Fourier Transforms on ultrametric trees. Those transformations are defined and used in the present work. On montre que l'analyse d'objets vivant sur un arbre ultramétrique, en particulier, la diagonalisation par blocs d'une matrice M^{α β;γ^δ} dépendant de 4-répliques, se simplifie de façon dramatique si l'on introduit les opérations appropriées sur ces objets. Ce sont les Transformées de Fourier de Répliques sur un arbre ultramétrique. Ces transformations sont définies et utilisées dans le présent travail.
Havasi, Ágnes; Kazemi, Ehsan
2018-04-01
In the modeling of wave propagation phenomena it is necessary to use time integration methods which are not only sufficiently accurate, but also properly describe the amplitude and phase of the propagating waves. It is not clear if amending the developed schemes by extrapolation methods to obtain a high order of accuracy preserves the qualitative properties of these schemes in the perspective of dissipation, dispersion and stability analysis. It is illustrated that the combination of various optimized schemes with Richardson extrapolation is not optimal for minimal dissipation and dispersion errors. Optimized third-order and fourth-order methods are obtained, and it is shown that the proposed methods combined with Richardson extrapolation result in fourth and fifth orders of accuracy correspondingly, while preserving optimality and stability. The numerical applications include the linear wave equation, a stiff system of reaction-diffusion equations and the nonlinear Euler equations with oscillatory initial conditions. It is demonstrated that the extrapolated third-order scheme outperforms the recently developed fourth-order diagonally implicit Runge-Kutta scheme in terms of accuracy and stability.
Kumar, Rajesh; Srivastava, Smriti; Gupta, J R P
2017-03-01
In this paper adaptive control of nonlinear dynamical systems using diagonal recurrent neural network (DRNN) is proposed. The structure of DRNN is a modification of fully connected recurrent neural network (FCRNN). Presence of self-recurrent neurons in the hidden layer of DRNN gives it an ability to capture the dynamic behaviour of the nonlinear plant under consideration (to be controlled). To ensure stability, update rules are developed using lyapunov stability criterion. These rules are then used for adjusting the various parameters of DRNN. The responses of plants obtained with DRNN are compared with those obtained when multi-layer feed forward neural network (MLFFNN) is used as a controller. Also, in example 4, FCRNN is also investigated and compared with DRNN and MLFFNN. Robustness of the proposed control scheme is also tested against parameter variations and disturbance signals. Four simulation examples including one-link robotic manipulator and inverted pendulum are considered on which the proposed controller is applied. The results so obtained show the superiority of DRNN over MLFFNN as a controller. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Imtiaz, Waqas A.; Ilyas, M.; Khan, Yousaf
2016-11-01
This paper propose a new code to optimize the performance of spectral amplitude coding-optical code division multiple access (SAC-OCDMA) system. The unique two-matrix structure of the proposed enhanced multi diagonal (EMD) code and effective correlation properties, between intended and interfering subscribers, significantly elevates the performance of SAC-OCDMA system by negating multiple access interference (MAI) and associated phase induce intensity noise (PIIN). Performance of SAC-OCDMA system based on the proposed code is thoroughly analyzed for two detection techniques through analytic and simulation analysis by referring to bit error rate (BER), signal to noise ratio (SNR) and eye patterns at the receiving end. It is shown that EMD code while using SDD technique provides high transmission capacity, reduces the receiver complexity, and provides better performance as compared to complementary subtraction detection (CSD) technique. Furthermore, analysis shows that, for a minimum acceptable BER of 10-9 , the proposed system supports 64 subscribers at data rates of up to 2 Gbps for both up-down link transmission.
Ahmed, Hassan Yousif; Nisar, K. S.
2013-08-01
Code with ideal in-phase cross correlation (CC) and practical code length to support high number of users are required in spectral amplitude coding-optical code division multiple access (SAC-OCDMA) systems. SAC systems are getting more attractive in the field of OCDMA because of its ability to eliminate the influence of multiple access interference (MAI) and also suppress the effect of phase induced intensity noise (PIIN). In this paper, we have proposed new Diagonal Eigenvalue Unity (DEU) code families with ideal in-phase CC based on Jordan block matrix with simple algebraic ways. Four sets of DEU code families based on the code weight W and number of users N for the combination (even, even), (even, odd), (odd, odd) and (odd, even) are constructed. This combination gives DEU code more flexibility in selection of code weight and number of users. These features made this code a compelling candidate for future optical communication systems. Numerical results show that the proposed DEU system outperforms reported codes. In addition, simulation results taken from a commercial optical systems simulator, Virtual Photonic Instrument (VPI™) shown that, using point to multipoint transmission in passive optical network (PON), DEU has better performance and could support long span with high data rate.
Two-band model with off-diagonal occupation dependent hopping rate
International Nuclear Information System (INIS)
Zawadowski, A.
1989-01-01
In this paper two-band hopping model is treated on a two-dimensional square lattice. The atoms are located at the corners and the middles of the edges of the squares. In addition to the strongly overlapping orbitals of the atoms, there are extra orbitals at the corners, which are weakly hybridized. The assumption is made that the Fermi level is inside the broad band and is every near to the narrow band formed by the extra orbitals. The hamiltonian is Hubbard type, but the off-diagonal part of the two-site interaction t is kept also where one creation or annihilation operator acts on the extra orbital and the others on one of its neighbors. The weak coupling t is enhanced by the on-site Coulomb repulsion at the corners, which enhancement is a power function of the ratio of the broad band width and the narrow bank position measured from the Fermi level. That enhancement is obtained by summation of logarithmic Kondo-type corrections of orbital origin, which reflects the formation of a ground state of new type with strong orbital and spin correlations. Interaction between the particles of the broad band is generated by processes with one heavy and one light particle in the intermediate state
Liu, Yongbin; He, Bing; Liu, Fang; Lu, Siliang; Zhao, Yilei
2016-12-01
Fault pattern identification is a crucial step for the intelligent fault diagnosis of real-time health conditions in monitoring a mechanical system. However, many challenges exist in extracting the effective feature from vibration signals for fault recognition. A new feature fusion method is proposed in this study to extract new features using kernel joint approximate diagonalization of eigen-matrices (KJADE). In the method, the input space that is composed of original features is mapped into a high-dimensional feature space by nonlinear mapping. Then, the new features can be estimated through the eigen-decomposition of the fourth-order cumulative kernel matrix obtained from the feature space. Therefore, the proposed method could be used to reduce data redundancy because it extracts the inherent pattern structure of different fault classes as it is nonlinear by nature. The integration evaluation factor of between-class and within-class scatters (SS) is employed to depict the clustering performance quantitatively, and the new feature subset extracted by the proposed method is fed into a multi-class support vector machine for fault pattern identification. Finally, the effectiveness of the proposed method is verified by experimental vibration signals with different bearing fault types and severities. Results of several cases show that the KJADE algorithm is efficient in feature fusion for bearing fault identification.
Miranda, Elder Assis; Batalha-Filho, Henrique; Congrains, Carlos; Carvalho, Antônio Freire; Ferreira, Kátia Maria; Del Lama, Marco Antonio
2016-01-01
The South America encompasses the highest levels of biodiversity found anywhere in the world and its rich biota is distributed among many different biogeographical regions. However, many regions of South America are still poorly studied, including its xeric environments, such as the threatened Caatinga and Cerrado phytogeographical domains. In particular, the effects of Quaternary climatic events on the demography of endemic species from xeric habitats are poorly understood. The present study uses an integrative approach to reconstruct the evolutionary history of Partamona rustica, an endemic stingless bee from dry forest diagonal in Brazil, in a spatial-temporal framework. In this sense, we sequenced four mitochondrial genes and genotyped eight microsatellite loci. Our results identified two population groups: one to the west and the other to the east of the São Francisco River Valley (SFRV). These groups split in the late Pleistocene, and the Approximate Bayesian Computation approach and phylogenetic reconstruction indicated that P. rustica originated in the west of the SFRV, subsequently colonising eastern region. Our tests of migration detected reduced gene flow between these groups. Finally, our results also indicated that the inferences both from the genetic data analyses and from the spatial distribution modelling are compatible with historical demographic stability.
Directory of Open Access Journals (Sweden)
Elder Assis Miranda
Full Text Available The South America encompasses the highest levels of biodiversity found anywhere in the world and its rich biota is distributed among many different biogeographical regions. However, many regions of South America are still poorly studied, including its xeric environments, such as the threatened Caatinga and Cerrado phytogeographical domains. In particular, the effects of Quaternary climatic events on the demography of endemic species from xeric habitats are poorly understood. The present study uses an integrative approach to reconstruct the evolutionary history of Partamona rustica, an endemic stingless bee from dry forest diagonal in Brazil, in a spatial-temporal framework. In this sense, we sequenced four mitochondrial genes and genotyped eight microsatellite loci. Our results identified two population groups: one to the west and the other to the east of the São Francisco River Valley (SFRV. These groups split in the late Pleistocene, and the Approximate Bayesian Computation approach and phylogenetic reconstruction indicated that P. rustica originated in the west of the SFRV, subsequently colonising eastern region. Our tests of migration detected reduced gene flow between these groups. Finally, our results also indicated that the inferences both from the genetic data analyses and from the spatial distribution modelling are compatible with historical demographic stability.
Meng, Xi; Nguyen, Bao D; Ridge, Clark; Shaka, A J
2009-01-01
High-dimensional (HD) NMR spectra have poorer digital resolution than low-dimensional (LD) spectra, for a fixed amount of experiment time. This has led to "reduced-dimensionality" strategies, in which several LD projections of the HD NMR spectrum are acquired, each with higher digital resolution; an approximate HD spectrum is then inferred by some means. We propose a strategy that moves in the opposite direction, by adding more time dimensions to increase the information content of the data set, even if only a very sparse time grid is used in each dimension. The full HD time-domain data can be analyzed by the filter diagonalization method (FDM), yielding very narrow resonances along all of the frequency axes, even those with sparse sampling. Integrating over the added dimensions of HD FDM NMR spectra reconstitutes LD spectra with enhanced resolution, often more quickly than direct acquisition of the LD spectrum with a larger number of grid points in each of the fewer dimensions. If the extra-dimensions do not appear in the final spectrum, and are used solely to boost information content, we propose the moniker hidden-dimension NMR. This work shows that HD peaks have unmistakable frequency signatures that can be detected as single HD objects by an appropriate algorithm, even though their patterns would be tricky for a human operator to visualize or recognize, and even if digital resolution in an HD FT spectrum is very coarse compared with natural line widths.
Directory of Open Access Journals (Sweden)
Yong Lv
2018-04-01
Full Text Available The vibration signals of bearings and gears measured from rotating machinery usually have nonlinear, nonstationary characteristics. The local projection algorithm cannot only reduce the noise of the nonlinear system, but can also preserve the nonlinear deterministic structure of the signal. The influence of centroid selection on the performance of noise reduction methods is analyzed, and the multiscale local projection method of centroid was proposed in this paper. This method considers both the geometrical shape and statistical error of the signal in high dimensional phase space, which can effectively eliminate the noise and preserve the complete geometric structure of the attractors. The diagonal slice spectrum can identify the frequency components of quadratic phase coupling and enlarge the coupled frequency component in the nonlinear signal. Therefore, the proposed method based on the above two algorithms can achieve more accurate results of fault diagnosis of gears and rolling bearings. The simulated signal is used to verify its effectiveness in a numerical simulation. Then, the proposed method is conducted for fault diagnosis of gears and rolling bearings in application researches. The fault characteristics of faulty bearings and gears can be extracted successfully in the researches. The experimental results indicate the effectiveness of the novel proposed method.
Diagonal Born-Oppenheimer correction for coupled-cluster wave-functions
Shamasundar, K. R.
2018-06-01
We examine how geometry-dependent normalisation freedom of electronic wave-functions affects extraction of a meaningful diagonal Born-Oppenheimer correction (DBOC) to the ground-state Born-Oppenheimer potential energy surface (PES). By viewing this freedom as a kind of gauge-freedom, it is shown that DBOC and the resulting associated mass-dependent adiabatic PES are gauge-invariant quantities. A sum-over-states (SOS) formula for DBOC which explicitly exhibits this invariance is derived. A biorthogonal formulation suitable for DBOC computations using standard unnormalised coupled-cluster (CC) wave-functions is presented. This is shown to lead to a biorthogonal version of SOS formula with similar properties. On this basis, different computational schemes for evaluating DBOC using approximate CC wave-functions are derived. One of this agrees with the formula used in the current literature. The connection to adiabatic-to-diabatic transformations in non-adiabatic dynamics is explored and complications arising from biorthogonal nature of CC theory are identified.
International Nuclear Information System (INIS)
Cao Jiacong; Lin Xingchun
2008-01-01
An accurate forecast of solar irradiation is required for various solar energy applications and environmental impact analyses in recent years. Comparatively, various irradiation forecast models based on artificial neural networks (ANN) perform much better in accuracy than many conventional prediction models. However, the forecast precision of most existing ANN based forecast models has not been satisfactory to researchers and engineers so far, and the generalization capability of these networks needs further improving. Combining the prominent dynamic properties of a recurrent neural network (RNN) with the enhanced ability of a wavelet neural network (WNN) in mapping nonlinear functions, a diagonal recurrent wavelet neural network (DRWNN) is newly established in this paper to perform fine forecasting of hourly and daily global solar irradiance. Some additional steps, e.g. applying historical information of cloud cover to sample data sets and the cloud cover from the weather forecast to network input, are adopted to help enhance the forecast precision. Besides, a specially scheduled two phase training algorithm is adopted. As examples, both hourly and daily irradiance forecasts are completed using sample data sets in Shanghai and Macau, and comparisons between irradiation models show that the DRWNN models are definitely more accurate
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.
A parallel direct solver for the self-adaptive hp Finite Element Method
Paszyński, Maciej R.
2010-03-01
In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.
Exact and Heuristic Algorithms for Runway Scheduling
Malik, Waqar A.; Jung, Yoon C.
2016-01-01
This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.
Exact model reduction of combinatorial reaction networks
Directory of Open Access Journals (Sweden)
Fey Dirk
2008-08-01
Full Text Available Abstract Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.
Exact combinatorial approach to finite coagulating systems
Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr
2018-02-01
This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.
Exact simulation of max-stable processes.
Dombry, Clément; Engelke, Sebastian; Oesting, Marco
2016-06-01
Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are often inexact and computationally inefficient. We present a new algorithm for exact simulation of a max-stable process at a finite number of locations. It relies on the idea of simulating only the extremal functions, that is, those functions in the construction of a max-stable process that effectively contribute to the pointwise maximum. We further generalize the algorithm by Dieker & Mikosch (2015) for Brown-Resnick processes and use it for exact simulation via the spectral measure. We study the complexity of both algorithms, prove that our new approach via extremal functions is always more efficient, and provide closed-form expressions for their implementation that cover most popular models for max-stable processes and multivariate extreme value distributions. For simulation on dense grids, an adaptive design of the extremal function algorithm is proposed.
Exact collisional moments for plasma fluid theories
Pfefferle, David; Hirvijoki, Eero; Lingam, Manasvi
2017-10-01
The velocity-space moments of the often troublesome nonlinear Landau collision operator are expressed exactly in terms of multi-index Hermite-polynomial moments of the distribution functions. The collisional moments are shown to be generated by derivatives of two well-known functions, namely the Rosenbluth-MacDonald-Judd-Trubnikov potentials for a Gaussian distribution. The resulting formula has a nonlinear dependency on the relative mean flow of the colliding species normalised to the root-mean-square of the corresponding thermal velocities, and a bilinear dependency on densities and higher-order velocity moments of the distribution functions, with no restriction on temperature, flow or mass ratio of the species. The result can be applied to both the classic transport theory of plasmas, that relies on the Chapman-Enskog method, as well as to deriving collisional fluid equations that follow Grad's moment approach. As an illustrative example, we provide the collisional ten-moment equations with exact conservation laws for momentum- and energy-transfer rate.