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)

Diagonal Likelihood Ratio Test for Equality of Mean Vectors in High-Dimensional Data

KAUST Repository

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.

Diagonal Likelihood Ratio Test for Equality of Mean Vectors in High-Dimensional Data

KAUST Repository

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.

A Concise Method for Storing and Communicating the Data Covariance Matrix

Energy Technology Data Exchange (ETDEWEB)

Larson, Nancy M [ORNL

2008-10-01

The covariance matrix associated with experimental cross section or transmission data consists of several components. Statistical uncertainties on the measured quantity (counts) provide a diagonal contribution. Off-diagonal components arise from uncertainties on the parameters (such as normalization or background) that figure into the data reduction process; these are denoted systematic or common uncertainties, since they affect all data points. The full off-diagonal data covariance matrix (DCM) can be extremely large, since the size is the square of the number of data points. Fortunately, it is not necessary to explicitly calculate, store, or invert the DCM. Likewise, it is not necessary to explicitly calculate, store, or use the inverse of the DCM. Instead, it is more efficient to accomplish the same results using only the various component matrices that appear in the definition of the DCM. Those component matrices are either diagonal or small (the number of data points times the number of data-reduction parameters); hence, this implicit data covariance method requires far less array storage and far fewer computations while producing more accurate results.

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)

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

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.

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....

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

Iterative algorithm for joint zero diagonalization with application in blind source separation.

Science.gov (United States)

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.

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.

Diagonally Implicit Runge-Kutta Methods for Ordinary Differential Equations. A Review

Science.gov (United States)

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.

Introduction to Computational Chemistry: Teaching Hu¨ckel Molecular Orbital Theory Using an Excel Workbook for Matrix Diagonalization

Science.gov (United States)

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…

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

Off-diagonal helicity density matrix elements for vector mesons produced in polarized e+e- processes

International Nuclear Information System (INIS)

Anselmino, M.; Murgia, F.; Quintairos, P.

1999-04-01

Final state q q-bar interactions give origin to non zero values of the off-diagonal element ρ 1,-1 of the helicity density matrix of vector mesons produced in e + e - annihilations, as confirmed by recent OPAL data on φ, D * and K * 's. New predictions are given for ρ 1,-1 of several mesons produced at large x E and small p T - i.e. collinear with the parent jet - in the annihilation of polarized 3 + and 3 - , the results depend strongly on the elementary dynamics and allow further non trivial tests of the standard model. (author)

A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations

Science.gov (United States)

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.

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.

NLTE steady-state response matrix method.

Science.gov (United States)

Faussurier, G.; More, R. M.

2000-05-01

A connection between atomic kinetics and non-equilibrium thermodynamics has been recently established by using a collisional-radiative model modified to include line absorption. The calculated net emission can be expressed as a non-local thermodynamic equilibrium (NLTE) symmetric response matrix. In the paper, this connection is extended to both cases of the average-atom model and the Busquet's model (RAdiative-Dependent IOnization Model, RADIOM). The main properties of the response matrix still remain valid. The RADIOM source function found in the literature leads to a diagonal response matrix, stressing the absence of any frequency redistribution among the frequency groups at this order of calculation.

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

Neutrinoless double-β decay matrix elements in large shell-model spaces with the generator-coordinate method

Science.gov (United States)

Jiao, C. F.; Engel, J.; Holt, J. D.

2017-11-01

We use the generator-coordinate method (GCM) with realistic shell-model interactions to closely approximate full shell-model calculations of the matrix elements for the neutrinoless double-β decay of 48Ca, 76Ge, and 82Se. We work in one major shell for the first isotope, in the f5 /2p g9 /2 space for the second and third, and finally in two major shells for all three. Our coordinates include not only the usual axial deformation parameter β , but also the triaxiality angle γ and neutron-proton pairing amplitudes. In the smaller model spaces our matrix elements agree well with those of full shell-model diagonalization, suggesting that our Hamiltonian-based GCM captures most of the important valence-space correlations. In two major shells, where exact diagonalization is not currently possible, our matrix elements are only slightly different from those in a single shell.

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 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.

Diagonalization of complex symmetric matrices: Generalized Householder reflections, iterative deflation and implicit shifts

Science.gov (United States)

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.

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.

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

Convergence of Transition Probability Matrix in CLVMarkov Models

Science.gov (United States)

Permana, D.; Pasaribu, U. S.; Indratno, S. W.; Suprayogi, S.

2018-04-01

A transition probability matrix is an arrangement of transition probability from one states to another in a Markov chain model (MCM). One of interesting study on the MCM is its behavior for a long time in the future. The behavior is derived from one property of transition probabilty matrix for n steps. This term is called the convergence of the n-step transition matrix for n move to infinity. Mathematically, the convergence of the transition probability matrix is finding the limit of the transition matrix which is powered by n where n moves to infinity. The convergence form of the transition probability matrix is very interesting as it will bring the matrix to its stationary form. This form is useful for predicting the probability of transitions between states in the future. The method usually used to find the convergence of transition probability matrix is through the process of limiting the distribution. In this paper, the convergence of the transition probability matrix is searched using a simple concept of linear algebra that is by diagonalizing the matrix.This method has a higher level of complexity because it has to perform the process of diagonalization in its matrix. But this way has the advantage of obtaining a common form of power n of the transition probability matrix. This form is useful to see transition matrix before stationary. For example cases are taken from CLV model using MCM called Model of CLV-Markov. There are several models taken by its transition probability matrix to find its convergence form. The result is that the convergence of the matrix of transition probability through diagonalization has similarity with convergence with commonly used distribution of probability limiting method.

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.

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.)

Maximum entropy formalism for the analytic continuation of matrix-valued Green's functions

Science.gov (United States)

Kraberger, Gernot J.; Triebl, Robert; Zingl, Manuel; Aichhorn, Markus

2017-10-01

We present a generalization of the maximum entropy method to the analytic continuation of matrix-valued Green's functions. To treat off-diagonal elements correctly based on Bayesian probability theory, the entropy term has to be extended for spectral functions that are possibly negative in some frequency ranges. In that way, all matrix elements of the Green's function matrix can be analytically continued; we introduce a computationally cheap element-wise method for this purpose. However, this method cannot ensure important constraints on the mathematical properties of the resulting spectral functions, namely positive semidefiniteness and Hermiticity. To improve on this, we present a full matrix formalism, where all matrix elements are treated simultaneously. We show the capabilities of these methods using insulating and metallic dynamical mean-field theory (DMFT) Green's functions as test cases. Finally, we apply the methods to realistic material calculations for LaTiO3, where off-diagonal matrix elements in the Green's function appear due to the distorted crystal structure.

Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements

Science.gov (United States)

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.

Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements

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)

Exact diagonalization library for quantum electron models

Science.gov (United States)

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.

Matrix-product-state method with local basis optimization for nonequilibrium electron-phonon systems

Science.gov (United States)

Heidrich-Meisner, Fabian; Brockt, Christoph; Dorfner, Florian; Vidmar, Lev; Jeckelmann, Eric

We present a method for simulating the time evolution of quasi-one-dimensional correlated systems with strongly fluctuating bosonic degrees of freedom (e.g., phonons) using matrix product states. For this purpose we combine the time-evolving block decimation (TEBD) algorithm with a local basis optimization (LBO) approach. We discuss the performance of our approach in comparison to TEBD with a bare boson basis, exact diagonalization, and diagonalization in a limited functional space. TEBD with LBO can reduce the computational cost by orders of magnitude when boson fluctuations are large and thus it allows one to investigate problems that are out of reach of other approaches. First, we test our method on the non-equilibrium dynamics of a Holstein polaron and show that it allows us to study the regime of strong electron-phonon coupling. Second, the method is applied to the scattering of an electronic wave packet off a region with electron-phonon coupling. Our study reveals a rich physics including transient self-trapping and dissipation. Supported by Deutsche Forschungsgemeinschaft (DFG) via FOR 1807.

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...

Stability of matrices with sufficiently strong negative-dominant-diagonal submatrices

NARCIS (Netherlands)

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

Parallel algorithms for computation of the manipulator inertia matrix

Science.gov (United States)

Amin-Javaheri, Masoud; Orin, David E.

1989-01-01

The development of an O(log2N) parallel algorithm for the manipulator inertia matrix is presented. It is based on the most efficient serial algorithm which uses the composite rigid body method. Recursive doubling is used to reformulate the linear recurrence equations which are required to compute the diagonal elements of the matrix. It results in O(log2N) levels of computation. Computation of the off-diagonal elements involves N linear recurrences of varying-size and a new method, which avoids redundant computation of position and orientation transforms for the manipulator, is developed. The O(log2N) algorithm is presented in both equation and graphic forms which clearly show the parallelism inherent in the algorithm.

Non-LTE radiative transfer with lambda-acceleration - Convergence properties using exact full and diagonal lambda-operators

Science.gov (United States)

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.

Reduced one-body density matrix of Tonks–Girardeau gas at finite temperature

International Nuclear Information System (INIS)

Fu Xiao-Chen; Hao Ya-Jiang

2015-01-01

With thermal Bose–Fermi mapping method, we investigate the Tonks–Girardeau gas at finite temperature. It is shown that at low temperature, the Tonks gas displays the Fermi-like density profiles, and with the increase in temperature, the Tonks gas distributes in wider region. The reduced one-body density matrix is diagonal dominant in the whole temperature region, and the off-diagonal elements shall vanish rapidly with the deviation from the diagonal part at high temperature. (paper)

A combined joint diagonalization-MUSIC algorithm for subsurface targets localization

Science.gov (United States)

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.

Sparse-matrix factorizations for fast symmetric Fourier transforms

International Nuclear Information System (INIS)

Sequel, J.

1987-01-01

This work proposes new fast algorithms computing the discrete Fourier transform of certain families of symmetric sequences. Sequences commonly found in problems of structure determination by x-ray crystallography and in numerical solutions of boundary-value problems in partial differential equations are dealt with. In the algorithms presented, the redundancies in the input and output data, due to the presence of symmetries in the input data sequence, were eliminated. Using ring-theoretical methods a matrix representation is obtained for the remaining calculations; which factors as the product of a complex block-diagonal matrix times as integral matrix. A basic two-step algorithm scheme arises from this factorization with a first step consisting of pre-additions and a second step containing the calculations involved in computing with the blocks in the block-diagonal factor. These blocks are structured as block-Hankel matrices, and two sparse-matrix factoring formulas are developed in order to diminish their arithmetic complexity

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)

Numerical method improvement for a subchannel code

Energy Technology Data Exchange (ETDEWEB)

Ding, W.J.; Gou, J.L.; Shan, J.Q. [Xi' an Jiaotong Univ., Shaanxi (China). School of Nuclear Science and Technology

2016-07-15

Previous studies showed that the subchannel codes need most CPU time to solve the matrix formed by the conservation equations. Traditional matrix solving method such as Gaussian elimination method and Gaussian-Seidel iteration method cannot meet the requirement of the computational efficiency. Therefore, a new algorithm for solving the block penta-diagonal matrix is designed based on Stone's incomplete LU (ILU) decomposition method. In the new algorithm, the original block penta-diagonal matrix will be decomposed into a block upper triangular matrix and a lower block triangular matrix as well as a nonzero small matrix. After that, the LU algorithm is applied to solve the matrix until the convergence. In order to compare the computational efficiency, the new designed algorithm is applied to the ATHAS code in this paper. The calculation results show that more than 80 % of the total CPU time can be saved with the new designed ILU algorithm for a 324-channel PWR assembly problem, compared with the original ATHAS code.

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.

A CLT on the SNR of Diagonally Loaded MVDR Filters

Science.gov (United States)

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.

Quantized Matrix Algebras and Quantum Seeds

DEFF Research Database (Denmark)

Jakobsen, Hans Plesner; Pagani, Chiara

2015-01-01

We determine explicitly quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centres and block diagonal forms of these algebras. In the case where is an arbitrary root of unity, this further determines the degrees.......We determine explicitly quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centres and block diagonal forms of these algebras. In the case where is an arbitrary root of unity, this further determines the degrees....

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...

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

Form of multicomponent Fickian diffusion coefficients matrix

International Nuclear Information System (INIS)

Wambui Mutoru, J.; Firoozabadi, Abbas

2011-01-01

Highlights: → Irreversible thermodynamics establishes form of multicomponent diffusion coefficients. → Phenomenological coefficients and thermodynamic factors affect sign of diffusion coefficients. → Negative diagonal elements of diffusion coefficients matrix can occur in non-ideal mixtures. → Eigenvalues of the matrix of Fickian diffusion coefficients may not be all real. - Abstract: The form of multicomponent Fickian diffusion coefficients matrix in thermodynamically stable mixtures is established based on the form of phenomenological coefficients and thermodynamic factors. While phenomenological coefficients form a symmetric positive definite matrix, the determinant of thermodynamic factors matrix is positive. As a result, the Fickian diffusion coefficients matrix has a positive determinant, but its elements - including diagonal elements - can be negative. Comprehensive survey of reported diffusion coefficients data for ternary and quaternary mixtures, confirms that invariably the determinant of the Fickian diffusion coefficients matrix is positive.

Matrix elements and few-body calculations within the unitary correlation operator method

International Nuclear Information System (INIS)

Roth, R.; Hergert, H.; Papakonstantinou, P.

2005-01-01

We employ the unitary correlation operator method (UCOM) to construct correlated, low-momentum matrix elements of realistic nucleon-nucleon interactions. The dominant short-range central and tensor correlations induced by the interaction are included explicitly by an unitary transformation. Using correlated momentum-space matrix elements of the Argonne V18 potential, we show that the unitary transformation eliminates the strong off-diagonal contributions caused by the short-range repulsion and the tensor interaction and leaves a correlated interaction dominated by low-momentum contributions. We use correlated harmonic oscillator matrix elements as input for no-core shell model calculations for few-nucleon systems. Compared to the bare interaction, the convergence properties are dramatically improved. The bulk of the binding energy can already be obtained in very small model spaces or even with a single Slater determinant. Residual long-range correlations, not treated explicitly by the unitary transformation, can easily be described in model spaces of moderate size allowing for fast convergence. By varying the range of the tensor correlator we are able to map out the Tjon line and can in turn constrain the optimal correlator ranges. (orig.)

Matrix elements and few-body calculations within the unitary correlation operator method

International Nuclear Information System (INIS)

Roth, R.; Hergert, H.; Papakonstantinou, P.; Neff, T.; Feldmeier, H.

2005-01-01

We employ the unitary correlation operator method (UCOM) to construct correlated, low-momentum matrix elements of realistic nucleon-nucleon interactions. The dominant short-range central and tensor correlations induced by the interaction are included explicitly by an unitary transformation. Using correlated momentum-space matrix elements of the Argonne V18 potential, we show that the unitary transformation eliminates the strong off-diagonal contributions caused by the short-range repulsion and the tensor interaction and leaves a correlated interaction dominated by low-momentum contributions. We use correlated harmonic oscillator matrix elements as input for no-core shell model calculations for few-nucleon systems. Compared to the bare interaction, the convergence properties are dramatically improved. The bulk of the binding energy can already be obtained in very small model spaces or even with a single Slater determinant. Residual long-range correlations, not treated explicitly by the unitary transformation, can easily be described in model spaces of moderate size allowing for fast convergence. By varying the range of the tensor correlator we are able to map out the Tjon line and can in turn constrain the optimal correlator ranges

Scaling Mode Shapes in Output-Only Structure by a Mass-Change-Based Method

Directory of Open Access Journals (Sweden)

Liangliang Yu

2017-01-01

Full Text Available A mass-change-based method based on output-only data for the rescaling of mode shapes in operational modal analysis (OMA is introduced. The mass distribution matrix, which is defined as a diagonal matrix whose diagonal elements represent the ratios among the diagonal elements of the mass matrix, is calculated using the unscaled mode shapes. Based on the theory of null space, the mass distribution vector or mass distribution matrix is obtained. A small mass with calibrated weight is added to a certain location of the structure, and then the mass distribution vector of the modified structure is estimated. The mass matrix is identified according to the difference of the mass distribution vectors between the original and modified structures. Additionally, the universal set of modes is unnecessary when calculating the mass distribution matrix, indicating that modal truncation is allowed in the proposed method. The mass-scaled mode shapes estimated in OMA according to the proposed method are compared with those obtained by experimental modal analysis. A simulation is employed to validate the feasibility of the method. Finally, the method is tested on output-only data from an experiment on a five-storey structure, and the results confirm the effectiveness of the method.

Determining Diagonal Branches in Mine Ventilation Networks

Science.gov (United States)

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

An algorithm for calculation of the Jordan canonical form of a matrix

Science.gov (United States)

Sridhar, B.; Jordan, D.

1973-01-01

Jordan canonical forms are used extensively in the literature on control systems. However, very few methods are available to compute them numerically. Most numerical methods compute a set of basis vectors in terms of which the given matrix is diagonalized when such a change of basis is possible. Here, a simple and efficient method is suggested for computing the Jordan canonical form and the corresponding transformation matrix. The method is based on the definition of a generalized eigenvector, and a natural extension of Gauss elimination techniques.

Massively parallel sparse matrix function calculations with NTPoly

Science.gov (United States)

Dawson, William; Nakajima, Takahito

2018-04-01

We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.

Maximum Quantum Entropy Method

OpenAIRE

Sim, Jae-Hoon; Han, Myung Joon

2018-01-01

Maximum entropy method for analytic continuation is extended by introducing quantum relative entropy. This new method is formulated in terms of matrix-valued functions and therefore invariant under arbitrary unitary transformation of input matrix. As a result, the continuation of off-diagonal elements becomes straightforward. Without introducing any further ambiguity, the Bayesian probabilistic interpretation is maintained just as in the conventional maximum entropy method. The applications o...

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.

GENERALIZED MATRIXES OF GALOIS PROTOCOLS EXCHANGE ENCRYPTION KEYS

Directory of Open Access Journals (Sweden)

Anatoly Beletsky

2016-03-01

Full Text Available The methods of construction of matrix formation the secret protocols legalized subscribers of public communications networks encryption keys. Based key exchange protocols laid asymmetric cryptography algorithms. The solution involves the calculation of one-way functions and is based on the use of generalized Galois arrays of isomorphism relationship with forming elements, and depending on the selected irreducible polynomial generating matrix. A simple method for constructing generalized Galois matrix by the method of filling the diagonal. In order to eliminate the isomorphism of Galois arrays and their constituent elements, limiting the possibility of building one-way functions, Galois matrix subjected to similarity transformation carried out by means of permutation matrices. The variant of the organization of the algebraic attacks on encryption keys sharing protocols and discusses options for easing the consequences of an attack.

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

Direct calculation of resonance energies and widths using an R-matrix approach

International Nuclear Information System (INIS)

Schneider, B.I.

1981-01-01

A modified R-matrix technique is presented which determines the eigenvalues and widths of resonant states by the direct diagonalization of a complex, non-Hermitian matrix. The method utilizes only real basis sets and requires a minimum of complex arithmetic. The method is applied to two problems, a set of coupled square wells and the Pi/sub g/ resonance of N 2 in the static-exchange approximation. The results of the calculation are in good agreement with other methods and converge very quickly with basis-set size

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.)

Comparative study on diagonal equivalent methods of masonry infill panel

Science.gov (United States)

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.

Solution of the nonlinear inverse scattering problem by T-matrix completion. I. Theory.

Science.gov (United States)

Levinson, Howard W; Markel, Vadim A

2016-10-01

We propose a conceptually different method for solving nonlinear inverse scattering problems (ISPs) such as are commonly encountered in tomographic ultrasound imaging, seismology, and other applications. The method is inspired by the theory of nonlocality of physical interactions and utilizes the relevant formalism. We formulate the ISP as a problem whose goal is to determine an unknown interaction potential V from external scattering data. Although we seek a local (diagonally dominated) V as the solution to the posed problem, we allow V to be nonlocal at the intermediate stages of iterations. This allows us to utilize the one-to-one correspondence between V and the T matrix of the problem. Here it is important to realize that not every T corresponds to a diagonal V and we, therefore, relax the usual condition of strict diagonality (locality) of V. An iterative algorithm is proposed in which we seek T that is (i) compatible with the measured scattering data and (ii) corresponds to an interaction potential V that is as diagonally dominated as possible. We refer to this algorithm as to the data-compatible T-matrix completion. This paper is Part I in a two-part series and contains theory only. Numerical examples of image reconstruction in a strongly nonlinear regime are given in Part II [H. W. Levinson and V. A. Markel, Phys. Rev. E 94, 043318 (2016)10.1103/PhysRevE.94.043318]. The method described in this paper is particularly well suited for very large data sets that become increasingly available with the use of modern measurement techniques and instrumentation.

Influence of electron correlation and degeneracy on the Fukui matrix and extension of frontier molecular orbital theory to correlated quantum chemical methods.

Science.gov (United States)

Bultinck, Patrick; Van Neck, Dimitri; Acke, Guillaume; Ayers, Paul W

2012-02-21

The Fukui function is considered as the diagonal element of the Fukui matrix in position space, where the Fukui matrix is the derivative of the one particle density matrix (1DM) with respect to the number of electrons. Diagonalization of the Fukui matrix, expressed in an orthogonal orbital basis, explains why regions in space with negative Fukui functions exist. Using a test set of molecules, electron correlation is found to have a remarkable effect on the eigenvalues of the Fukui matrix. The Fukui matrices at the independent electron model level are mathematically proven to always have an eigenvalue equal to exactly unity while the rest of the eigenvalues possibly differ from zero but sum to zero. The loss of idempotency of the 1DM at correlated levels of theory causes the loss of these properties. The influence of electron correlation is examined in detail and the frontier molecular orbital concept is extended to correlated levels of theory by defining it as the eigenvector of the Fukui matrix with the largest eigenvalue. The effect of degeneracy on the Fukui matrix is examined in detail, revealing that this is another way by which the unity eigenvalue and perfect pairing of eigenvalues can disappear.

Diagonal Arguments

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

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

Stopping test of iterative methods for solving PDE

International Nuclear Information System (INIS)

Wang Bangrong

1991-01-01

In order to assure the accuracy of the numerical solution of the iterative method for solving PDE (partial differential equation), the stopping test is very important. If the coefficient matrix of the system of linear algebraic equations is strictly diagonal dominant or irreducible weakly diagonal dominant, the stopping test formulas of the iterative method for solving PDE is proposed. Several numerical examples are given to illustrate the applications of the stopping test formulas

A method for the solution of the RPA eigenvalue

International Nuclear Information System (INIS)

Hoffman, M.J.H.; De Kock, P.R.

1986-01-01

The RPA eigenvalue problem requires the diagonalization of a 2nx2n matrix. In practical calculations, n (the number of particle-hole basis states) can be a few hundred and the diagonalization of such a large non-symmetric matrix may take quite a long time. In this report we firstly discuss sufficient conditions for real and non-zero RPA eigenvalues. The presence of zero or imaginary eigenvalues is related to the relative importance of the groundstate correlations to the total interaction energy. We then rewrite the RPA eigenvalue problem for the cases where these conditions are fulfilled in a form which only requires the diagonalization of two symmetric nxn matrices. The extend to which this method can be applied when zero eigenvalues occur, is also discussed

Improved parallel solution techniques for the integral transport matrix method

Energy Technology Data Exchange (ETDEWEB)

Zerr, R. Joseph, E-mail: rjz116@psu.edu [Department of Mechanical and Nuclear Engineering, The Pennsylvania State University, University Park, PA (United States); Azmy, Yousry Y., E-mail: yyazmy@ncsu.edu [Department of Nuclear Engineering, North Carolina State University, Burlington Engineering Laboratories, Raleigh, NC (United States)

2011-07-01

Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution time by up to 10´ when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing cases are optically thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block pre conditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient pre conditioner. (author)

Improved parallel solution techniques for the integral transport matrix method

International Nuclear Information System (INIS)

Zerr, R. Joseph; Azmy, Yousry Y.

2011-01-01

Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution time by up to 10´ when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing cases are optically thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block pre conditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient pre conditioner. (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)

Matrix theory selected topics and useful results

CERN Document Server

Mehta, Madan Lal

1989-01-01

Matrices and operations on matrices ; determinants ; elementary operations on matrices (continued) ; eigenvalues and eigenvectors, diagonalization of normal matrices ; functions of a matrix ; positive definiteness, various polar forms of a matrix ; special matrices ; matrices with quaternion elements ; inequalities ; generalised inverse of a matrix ; domain of values of a matrix, location and dispersion of eigenvalues ; symmetric functions ; integration over matrix variables ; permanents of doubly stochastic matrices ; infinite matrices ; Alexander matrices, knot polynomials, torsion numbers.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

Science.gov (United States)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

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

An Empirical State Error Covariance Matrix for Batch State Estimation

Science.gov (United States)

Frisbee, Joseph H., Jr.

2011-01-01

State estimation techniques serve effectively to provide mean state estimates. However, the state error covariance matrices provided as part of these techniques suffer from some degree of lack of confidence in their ability to adequately describe the uncertainty in the estimated states. A specific problem with the traditional form of state error covariance matrices is that they represent only a mapping of the assumed observation error characteristics into the state space. Any errors that arise from other sources (environment modeling, precision, etc.) are not directly represented in a traditional, theoretical state error covariance matrix. Consider that an actual observation contains only measurement error and that an estimated observation contains all other errors, known and unknown. It then follows that a measurement residual (the difference between expected and observed measurements) contains all errors for that measurement. Therefore, a direct and appropriate inclusion of the actual measurement residuals in the state error covariance matrix will result in an empirical state error covariance matrix. This empirical state error covariance matrix will fully account for the error in the state estimate. By way of a literal reinterpretation of the equations involved in the weighted least squares estimation algorithm, it is possible to arrive at an appropriate, and formally correct, empirical state error covariance matrix. The first specific step of the method is to use the average form of the weighted measurement residual variance performance index rather than its usual total weighted residual form. Next it is helpful to interpret the solution to the normal equations as the average of a collection of sample vectors drawn from a hypothetical parent population. From here, using a standard statistical analysis approach, it directly follows as to how to determine the standard empirical state error covariance matrix. This matrix will contain the total uncertainty in the

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

The method of covariant symbols in curved space-time

International Nuclear Information System (INIS)

Salcedo, L.L.

2007-01-01

Diagonal matrix elements of pseudodifferential operators are needed in order to compute effective Lagrangians and currents. For this purpose the method of symbols is often used, which however lacks manifest covariance. In this work the method of covariant symbols, introduced by Pletnev and Banin, is extended to curved space-time with arbitrary gauge and coordinate connections. For the Riemannian connection we compute the covariant symbols corresponding to external fields, the covariant derivative and the Laplacian, to fourth order in a covariant derivative expansion. This allows one to obtain the covariant symbol of general operators to the same order. The procedure is illustrated by computing the diagonal matrix element of a nontrivial operator to second order. Applications of the method are discussed. (orig.)

Random Correlation Matrix and De-Noising

OpenAIRE

Ken-ichi Mitsui; Yoshio Tabata

2006-01-01

In Finance, the modeling of a correlation matrix is one of the important problems. In particular, the correlation matrix obtained from market data has the noise. Here we apply the de-noising processing based on the wavelet analysis to the noisy correlation matrix, which is generated by a parametric function with random parameters. First of all, we show that two properties, i.e. symmetry and ones of all diagonal elements, of the correlation matrix preserve via the de-noising processing and the...

Neutrino mass matrix: Inverted hierarchy and CP violation

International Nuclear Information System (INIS)

Frigerio, Michele; Smirnov, Alexei Yu.

2003-01-01

We reconstruct the neutrino mass matrix in the flavor basis, in the case of an inverted mass hierarchy (ordering), using all available experimental data on neutrino masses and oscillations. We analyze the dependence of the matrix elements m αβ on the CP violating Dirac δ and Majorana ρ and σ phases, for different values of the absolute mass scale. We find that the present data admit various structures of the mass matrix: (i) hierarchical structures with a set of small (zero) elements; (ii) structures with equalities among various groups of elements: e-row and/or μτ-block elements, diagonal and/or off-diagonal elements; (iii) 'democratic' structure. We find the values of phases for which these structures are realized. The mass matrix elements can anticorrelate with flavor: inverted partial or complete flavor alignment is possible. For various structures of the mass matrix we identify the possible underlying symmetry. We find that the mass matrix can be reconstructed completely only in particular cases, provided that the absolute scale of the mass is measured. Generally, the freedom related to the Majorana phase σ will not be removed, thus admitting various types of mass matrix

The detection of influential subsets in linear regression using an influence matrix

OpenAIRE

Peña, Daniel; Yohai, Víctor J.

1991-01-01

This paper presents a new method to identify influential subsets in linear regression problems. The procedure uses the eigenstructure of an influence matrix which is defined as the matrix of uncentered covariance of the effect on the whole data set of deleting each observation, normalized to include the univariate Cook's statistics in the diagonal. It is shown that points in an influential subset will appear with large weight in at least one of the eigenvector linked to the largest eigenvalue...

Computing the Density Matrix in Electronic Structure Theory on Graphics Processing Units.

Science.gov (United States)

Cawkwell, M J; Sanville, E J; Mniszewski, S M; Niklasson, Anders M N

2012-11-13

The self-consistent solution of a Schrödinger-like equation for the density matrix is a critical and computationally demanding step in quantum-based models of interatomic bonding. This step was tackled historically via the diagonalization of the Hamiltonian. We have investigated the performance and accuracy of the second-order spectral projection (SP2) algorithm for the computation of the density matrix via a recursive expansion of the Fermi operator in a series of generalized matrix-matrix multiplications. We demonstrate that owing to its simplicity, the SP2 algorithm [Niklasson, A. M. N. Phys. Rev. B2002, 66, 155115] is exceptionally well suited to implementation on graphics processing units (GPUs). The performance in double and single precision arithmetic of a hybrid GPU/central processing unit (CPU) and full GPU implementation of the SP2 algorithm exceed those of a CPU-only implementation of the SP2 algorithm and traditional matrix diagonalization when the dimensions of the matrices exceed about 2000 × 2000. Padding schemes for arrays allocated in the GPU memory that optimize the performance of the CUBLAS implementations of the level 3 BLAS DGEMM and SGEMM subroutines for generalized matrix-matrix multiplications are described in detail. The analysis of the relative performance of the hybrid CPU/GPU and full GPU implementations indicate that the transfer of arrays between the GPU and CPU constitutes only a small fraction of the total computation time. The errors measured in the self-consistent density matrices computed using the SP2 algorithm are generally smaller than those measured in matrices computed via diagonalization. Furthermore, the errors in the density matrices computed using the SP2 algorithm do not exhibit any dependence of system size, whereas the errors increase linearly with the number of orbitals when diagonalization is employed.

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.

General 4–zero texture mass matrix parametrizations

International Nuclear Information System (INIS)

Barranco, J; Delepine, D; Lopez-Lozano, L

2014-01-01

It is performed the diagonalization of a non–Hermitian four–zero texture Yukawa matrix with a general formalism. This procedure leads to 3 possibilities to parametrize the relation between the fermion masses and the elements of the corresponding Yukawa matrix. Then, the matrices that diagonalize each Yukawa mass matrix are combined in order to obtain 9 different theoretical CKM or PMNS mixing matrices [1]. Through a χ 2 analysis, we have constrained the values of the remaining free parameters such as the theoretical mixing matrix matches the latest experimental measurements of the mixing matrices. This analysis was done without assuming any approximations. In the case of the quark sector, it is found that only four different theoretical mixing matrices are compatible with the actual high precision experimental measurement of the CKM matrix elements. For the lepton sector, where the masses of neutrinos are not known, we found that independently of the parametrization that have been chosen, the updated experimental measurements of the mixing angles in the PMNS matrix, imply a mass for the heaviest left–handed neutrino to be ∼ 0.05eV

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

Robust estimation of the correlation matrix of longitudinal data

KAUST Repository

Maadooliat, Mehdi

2011-09-23

We propose a double-robust procedure for modeling the correlation matrix of a longitudinal dataset. It is based on an alternative Cholesky decomposition of the form Σ=DLL⊤D where D is a diagonal matrix proportional to the square roots of the diagonal entries of Σ and L is a unit lower-triangular matrix determining solely the correlation matrix. The first robustness is with respect to model misspecification for the innovation variances in D, and the second is robustness to outliers in the data. The latter is handled using heavy-tailed multivariate t-distributions with unknown degrees of freedom. We develop a Fisher scoring algorithm for computing the maximum likelihood estimator of the parameters when the nonredundant and unconstrained entries of (L,D) are modeled parsimoniously using covariates. We compare our results with those based on the modified Cholesky decomposition of the form LD2L⊤ using simulations and a real dataset. © 2011 Springer Science+Business Media, LLC.

A Diagonal-Steering-Based Binaural Beamforming Algorithm Incorporating a Diagonal Speech Localizer for Persons With Bilateral Hearing Impairment.

Science.gov (United States)

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.

Isovector and flavor-diagonal charges of the nucleon

Science.gov (United States)

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.

Inelastic plasmon and inter-band electron-scattering potentials for Si from dielectric matrix calculations

International Nuclear Information System (INIS)

Josefsson, T.W.; Smith, A.E.

1994-01-01

Inelastic scattering of electrons in a crystalline environment may be represented by a complex non-hermitian potential. Completed generalised expressions for this inelastic electron scattering potential matrix, including virtual inelastic scattering, are derived for outer-shell electron and plasmon excitations. The relationship between these expressions and the general anisotropic dielectric response matrix of the solid is discussed. These generalised expressions necessarily include the off-diagonal terms representing effects due to departure from translational invariance in the interaction. Results are presented for the diagonal back structure dependent inelastic and virtual inelastic scattering potentials for Si, from a calculation of the inverse dielectric matrix in the random phase approximation. Good agreement is found with experiment as a function of incident energies from 10 eV to 100 keV. Anisotropy effects and hence the interaction de localisation represented by the off-diagonal scattering potential terms, are found to be significant below 1 keV. 38 refs., 2 figs

Algorithms for sparse, symmetric, definite quadratic lambda-matrix eigenproblems

International Nuclear Information System (INIS)

Scott, D.S.; Ward, R.C.

1981-01-01

Methods are presented for computing eigenpairs of the quadratic lambda-matrix, M lambda 2 + C lambda + K, where M, C, and K are large and sparse, and have special symmetry-type properties. These properties are sufficient to insure that all the eigenvalues are real and that theory analogous to the standard symmetric eigenproblem exists. The methods employ some standard techniques such as partial tri-diagonalization via the Lanczos Method and subsequent eigenpair calculation, shift-and- invert strategy and subspace iteration. The methods also employ some new techniques such as Rayleigh-Ritz quadratic roots and the inertia of symmetric, definite, quadratic lambda-matrices

Loop Transfer Matrix and Loop Quantum Mechanics

International Nuclear Information System (INIS)

Savvidy, George K.

2000-01-01

The gonihedric model of random surfaces on a 3d Euclidean lattice has equivalent representation in terms of transfer matrix K(Q i ,Q f ), which describes the propagation of loops Q. We extend the previous construction of the loop transfer matrix to the case of nonzero self-intersection coupling constant κ. We introduce the loop generalization of Fourier transformation which allows to diagonalize transfer matrices, that depend on symmetric difference of loops only and express all eigenvalues of 3d loop transfer matrix through the correlation functions of the corresponding 2d statistical system. The loop Fourier transformation allows to carry out the analogy with quantum mechanics of point particles, to introduce conjugate loop momentum P and to define loop quantum mechanics. We also consider transfer matrix on 4d lattice which describes propagation of memebranes. This transfer matrix can also be diagonalized by using the generalized Fourier transformation, and all its eigenvalues are equal to the correlation functions of the corresponding 3d statistical system. In particular the free energy of the 4d membrane system is equal to the free energy of 3d gonihedric system of loops and is equal to the free energy of 2d Ising model. (author)

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.

Measurement of off-diagonal transport coefficients in two-phase flow in porous media.

Science.gov (United States)

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.

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...

Diagonal chromatography to study plant protein modifications.

Science.gov (United States)

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.

Dielectric matrix, dynamical matrix and phonon dispersion in hcp transition metal scandium

International Nuclear Information System (INIS)

Singh, Joginder; Singh, Natthi; Prakash, S.

1976-01-01

Complete dielectric matrix is evaluated for hcp transition metal scandium using the non-interacting s- and d-band model. The local field corrections which are consequence of the non-diagonal part of the dielectric matrix are calculated explicitly. The free electron approximation is used for the s-electrons and the simple tight-binding approximation is used for the d-electrons. The theory developed by Singh and others is used to invert the dielectric matrix and the explicit expressions for the dynamical matrix are obtained. The phonon dispersion relations are investigated by using the renormalized Animalu transition metal model potential (TMMP) for bare ion potential. The contribution due to non-central forces which arise due to local fields is found to be 20%. The results are found in resonably good agreement with the experimental values. (author)

Domain wall partition function of the eight-vertex model with a non-diagonal reflecting end

International Nuclear Information System (INIS)

Yang Wenli; Chen Xi; Feng Jun; Hao Kun; Shi Kangjie; Sun Chengyi; Yang Zhanying; Zhang Yaozhong

2011-01-01

With the help of the Drinfeld twist or factorizing F-matrix for the eight-vertex SOS model, we derive the recursion relations of the partition function for the eight-vertex model with a generic non-diagonal reflecting end and domain wall boundary condition. Solving the recursion relations, we obtain the explicit determinant expression of the partition function. Our result shows that, contrary to the eight-vertex model without a reflecting end, the partition function can be expressed as a single determinant.

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.

Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations

NARCIS (Netherlands)

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

Matrix Elements in Fermion Dynamical Symmetry Model

Institute of Scientific and Technical Information of China (English)

LIU Guang-Zhou; LIU Wei

2002-01-01

In a neutron-proton system, the matrix elements of the generators for SO(8) × SO(8) symmetry areconstructed explicitly, and with these matrix elements the low-lying excitation spectra obtained by diagonalization arepresented. The excitation spectra for SO(7) nuclei Pd and Ru isotopes and SO(6) r-soft rotational nuclei Xe, Ba, andCe isotopes are calculated, and comparison with the experimental results is carried out.

Matrix Elements in Fermion Dynamical Symmetry Model

Institute of Scientific and Technical Information of China (English)

LIUGuang－Zhou; LIUWei

2002-01-01

In a neutron-proton system,the matrix elements of the generators for SO(8)×SO(8) symmetry are constructed exp;icitly,and with these matrix elements the low-lying excitation spsectra obtained by diagonalization are presented.The excitation spectra for SO(7) nuclei Pd and Ru isotopes and SO(6) r-soft rotational nuclei Xe,Ba,and Ce isotopes are calculated,and comparison with the experimental results is carried out.

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.

Matrix method for acoustic levitation simulation.

Science.gov (United States)

Andrade, Marco A B; Perez, Nicolas; Buiochi, Flavio; Adamowski, Julio C

2011-08-01

A matrix method is presented for simulating acoustic levitators. A typical acoustic levitator consists of an ultrasonic transducer and a reflector. The matrix method is used to determine the potential for acoustic radiation force that acts on a small sphere in the standing wave field produced by the levitator. The method is based on the Rayleigh integral and it takes into account the multiple reflections that occur between the transducer and the reflector. The potential for acoustic radiation force obtained by the matrix method is validated by comparing the matrix method results with those obtained by the finite element method when using an axisymmetric model of a single-axis acoustic levitator. After validation, the method is applied in the simulation of a noncontact manipulation system consisting of two 37.9-kHz Langevin-type transducers and a plane reflector. The manipulation system allows control of the horizontal position of a small levitated sphere from -6 mm to 6 mm, which is done by changing the phase difference between the two transducers. The horizontal position of the sphere predicted by the matrix method agrees with the horizontal positions measured experimentally with a charge-coupled device camera. The main advantage of the matrix method is that it allows simulation of non-symmetric acoustic levitators without requiring much computational effort.

Positron collisions with acetylene calculated using the R-matrix with pseudo-states method

Science.gov (United States)

Zhang, Rui; Galiatsatos, Pavlos G.; Tennyson, Jonathan

2011-10-01

Eigenphase sums, total cross sections and differential cross sections are calculated for low-energy collisions of positrons with C2H2. The calculations demonstrate that the use of appropriate pseudo-state expansions very significantly improves the representation of this process giving both realistic eigenphases and cross sections. Differential cross sections are strongly forward peaked in agreement with the measurements. These calculations are computationally very demanding; even with improved procedures for matrix diagonalization, fully converged calculations are too expensive with current computer resources. Nonetheless, the calculations show clear evidence for the formation of a virtual state but no indication that acetylene actually binds a positron at its equilibrium geometry.

Positron collisions with acetylene calculated using the R-matrix with pseudo-states method

Energy Technology Data Exchange (ETDEWEB)

Zhang Rui; Galiatsatos, Pavlos G; Tennyson, Jonathan, E-mail: j.tennyson@ucl.ac.uk [Department of Physics and Astronomy, University College London, Gower St., London WC1E 6BT (United Kingdom)

2011-10-14

Eigenphase sums, total cross sections and differential cross sections are calculated for low-energy collisions of positrons with C{sub 2}H{sub 2}. The calculations demonstrate that the use of appropriate pseudo-state expansions very significantly improves the representation of this process giving both realistic eigenphases and cross sections. Differential cross sections are strongly forward peaked in agreement with the measurements. These calculations are computationally very demanding; even with improved procedures for matrix diagonalization, fully converged calculations are too expensive with current computer resources. Nonetheless, the calculations show clear evidence for the formation of a virtual state but no indication that acetylene actually binds a positron at its equilibrium geometry.

Response matrix method for large LMFBR analysis

International Nuclear Information System (INIS)

King, M.J.

1977-06-01

The feasibility of using response matrix techniques for computational models of large LMFBRs is examined. Since finite-difference methods based on diffusion theory have generally found a place in fast-reactor codes, a brief review of their general matrix foundation is given first in order to contrast it to the general strategy of response matrix methods. Then, in order to present the general method of response matrix technique, two illustrative examples are given. Matrix algorithms arising in the application to large LMFBRs are discussed, and the potential of the response matrix method is explored for a variety of computational problems. Principal properties of the matrices involved are derived with a view to application of numerical methods of solution. The Jacobi iterative method as applied to the current-balance eigenvalue problem is discussed

Consideration of relativistic effects in band structure calculations based on the empirical tight-binding method

International Nuclear Information System (INIS)

Hanke, M.; Hennig, D.; Kaschte, A.; Koeppen, M.

1988-01-01

The energy band structure of cadmium telluride and mercury telluride materials is investigated by means of the tight-binding (TB) method considering relativistic effects and the spin-orbit interaction. Taking into account relativistic effects in the method is rather simple though the size of the Hamilton matrix doubles. Such considerations are necessary for the interesting small-interstice semiconductors, and the experimental results are reflected correctly in the band structures. The transformation behaviour of the eigenvectors within the Brillouin zone gets more complicated, but is, nevertheless, theoretically controllable. If, however, the matrix elements of the Green operator are to be calculated, one has to use formula manipulation programmes in particular for non-diagonal elements. For defect calculations by the Koster-Slater theory of scattering it is necessary to know these matrix elements. Knowledge of the transformation behaviour of eigenfunctions saves frequent diagonalization of the Hamilton matrix and thus permits a numerical solution of the problem. Corresponding results for the sp 3 basis are available

ITMETH, Iterative Routines for Linear System

International Nuclear Information System (INIS)

Greenbaum, A.

1989-01-01

1 - Description of program or function: ITMETH is a collection of iterative routines for solving large, sparse linear systems. 2 - Method of solution: ITMETH solves general linear systems of the form AX=B using a variety of methods: Jacobi iteration; Gauss-Seidel iteration; incomplete LU decomposition or matrix splitting with iterative refinement; diagonal scaling, matrix splitting, or incomplete LU decomposition with the conjugate gradient method for the problem AA'Y=B, X=A'Y; bi-conjugate gradient method with diagonal scaling, matrix splitting, or incomplete LU decomposition; and ortho-min method with diagonal scaling, matrix splitting, or incomplete LU decomposition. ITMETH also solves symmetric positive definite linear systems AX=B using the conjugate gradient method with diagonal scaling or matrix splitting, or the incomplete Cholesky conjugate gradient method

Separability of three qubit Greenberger-Horne-Zeilinger diagonal states

Science.gov (United 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.

Method of forming a ceramic matrix composite and a ceramic matrix component

Science.gov (United States)

de Diego, Peter; Zhang, James

2017-05-30

A method of forming a ceramic matrix composite component includes providing a formed ceramic member having a cavity, filling at least a portion of the cavity with a ceramic foam. The ceramic foam is deposited on a barrier layer covering at least one internal passage of the cavity. The method includes processing the formed ceramic member and ceramic foam to obtain a ceramic matrix composite component. Also provided is a method of forming a ceramic matrix composite blade and a ceramic matrix composite component.

New Implicit General Linear Method | Ibrahim | Journal of the ...

African Journals Online (AJOL)

A New implicit general linear method is designed for the numerical olution of stiff differential Equations. The coefficients matrix is derived from the stability function. The method combines the single-implicitness or diagonal implicitness with property that the first two rows are implicit and third and fourth row are explicit.

Implementation of the diagonalization-free algorithm in the self-consistent field procedure within the four-component relativistic scheme.

Science.gov (United States)

Hrdá, Marcela; Kulich, Tomáš; Repiský, Michal; Noga, Jozef; Malkina, Olga L; Malkin, Vladimir G

2014-09-05

A recently developed Thouless-expansion-based diagonalization-free approach for improving the efficiency of self-consistent field (SCF) methods (Noga and Šimunek, J. Chem. Theory Comput. 2010, 6, 2706) has been adapted to the four-component relativistic scheme and implemented within the program package ReSpect. In addition to the implementation, the method has been thoroughly analyzed, particularly with respect to cases for which it is difficult or computationally expensive to find a good initial guess. Based on this analysis, several modifications of the original algorithm, refining its stability and efficiency, are proposed. To demonstrate the robustness and efficiency of the improved algorithm, we present the results of four-component diagonalization-free SCF calculations on several heavy-metal complexes, the largest of which contains more than 80 atoms (about 6000 4-spinor basis functions). The diagonalization-free procedure is about twice as fast as the corresponding diagonalization. Copyright © 2014 Wiley Periodicals, Inc.

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.)

Magic neutrino mass matrix and the Bjorken-Harrison-Scott parameterization

International Nuclear Information System (INIS)

Lam, C.S.

2006-01-01

Observed neutrino mixing can be described by a tribimaximal MNS matrix. The resulting neutrino mass matrix in the basis of a diagonal charged lepton mass matrix is both 2-3 symmetric and magic. By a magic matrix, I mean one whose row sums and column sums are all identical. I study what happens if 2-3 symmetry is broken but the magic symmetry is kept intact. In that case, the mixing matrix is parameterized by a single complex parameter U e3 , in a form discussed recently by Bjorken, Harrison, and Scott

Modeling animal-vehicle collisions using diagonal inflated bivariate Poisson regression.

Science.gov (United States)

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.

Interface matrix method in AFEN framework

Energy Technology Data Exchange (ETDEWEB)

Pogosbekyan, Leonid; Cho, Jin Young; Kim, Young Jin [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

1998-12-31

In this study, we extend the application of the interface-matrix(IM) method for reflector modeling to Analytic Flux Expansion Nodal (AFEN) method. This include the modifications of the surface-averaged net current continuity and the net leakage balance conditions for IM method in accordance with AFEN formula. AFEN-interface matrix (AFEN-IM) method has been tested against ZION-1 benchmark problem. The numerical result of AFEN-IM method shows 1.24% of maximum error and 0.42% of root-mean square error in assembly power distribution, and 0.006% {Delta} k of neutron multiplication factor. This result proves that the interface-matrix method for reflector modeling can be useful in AFEN method. 3 refs., 4 figs. (Author)

Interface matrix method in AFEN framework

Energy Technology Data Exchange (ETDEWEB)

Pogosbekyan, Leonid; Cho, Jin Young; Kim, Young Jin [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

1997-12-31

In this study, we extend the application of the interface-matrix(IM) method for reflector modeling to Analytic Flux Expansion Nodal (AFEN) method. This include the modifications of the surface-averaged net current continuity and the net leakage balance conditions for IM method in accordance with AFEN formula. AFEN-interface matrix (AFEN-IM) method has been tested against ZION-1 benchmark problem. The numerical result of AFEN-IM method shows 1.24% of maximum error and 0.42% of root-mean square error in assembly power distribution, and 0.006% {Delta} k of neutron multiplication factor. This result proves that the interface-matrix method for reflector modeling can be useful in AFEN method. 3 refs., 4 figs. (Author)

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 ...

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.

Symmetries of the second-difference matrix and the finite Fourier transform

International Nuclear Information System (INIS)

Aguilar, A.; Wolf, K.B.

1979-01-01

The finite Fourier transformation is well known to diagonalize the second-difference matrix and has been thus applied extensively to describe finite crystal lattices and electric networks. In setting out to find all transformations having this property, we obtain a multiparameter class of them. While permutations and unitary scaling of the eigenvectors constitute the trivial freedom of choice common to all diagonalization processes, the second-difference matrix has a larger symmetry group among whose elements we find the dihedral manifest symmetry transformations of the lattice. The latter are nevertheless sufficient for the unique specification of eigenvectors in various symmetry-adapted bases for the constrained lattice. The free symmetry parameters are shown to lead to a complete set of conserved quantities for the physical lattice motion. (author)

Diagonalization and Jordan Normal Form--Motivation through "Maple"[R

Science.gov (United States)

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…

Matrix Krylov subspace methods for image restoration

Directory of Open Access Journals (Sweden)

khalide jbilou

2015-09-01

Full Text Available In the present paper, we consider some matrix Krylov subspace methods for solving ill-posed linear matrix equations and in those problems coming from the restoration of blurred and noisy images. Applying the well known Tikhonov regularization procedure leads to a Sylvester matrix equation depending the Tikhonov regularized parameter. We apply the matrix versions of the well known Krylov subspace methods, namely the Least Squared (LSQR and the conjugate gradient (CG methods to get approximate solutions representing the restored images. Some numerical tests are presented to show the effectiveness of the proposed methods.

Variational principles and Heisenberg matrix mechanics

International Nuclear Information System (INIS)

Klein, A.; Li, C.-T.

1979-01-01

If in Heisenberg's equations of motion for a problem in quantum mechanics (or quantum field theory) one studies matrix elements in the energy representation and by use of completeness conditions expresses the equations solely in terms of matrix elements of the canonical variables, and if one does likewise with the associated kinematical constraints (commutation relations), one arrives at a formulation - largely unexplored hitherto - which can be exploited for both practical and theoretical development. In this contribution, the above theme is developed within the framework of one-dimensional problems. It is shown how this formulation, both dynamics and kinematics, can be derived from a new variational principle, indeed from an entire class of such principles. A powerful method of diagonalizing the Hamiltonians by means of computations utilizing these equations is described. The variational method is shown to be particularly useful for the study of the regime of large quantum numbers. The usual WKB approximation is seen to be contained as well as a basis for the study of systematic corrections to it. Further applications in progress are mentioned. (Auth.)

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections.

Science.gov (United States)

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.

Form factors in quantum integrable models with GL(3)-invariant R-matrix

Energy Technology Data Exchange (ETDEWEB)

Pakuliak, S., E-mail: pakuliak@theor.jinr.ru [Laboratory of Theoretical Physics, JINR, 141980 Dubna, Moscow Reg. (Russian Federation); Moscow Institute of Physics and Technology, 141700 Dolgoprudny, Moscow Reg. (Russian Federation); Institute of Theoretical and Experimental Physics, 117259 Moscow (Russian Federation); Ragoucy, E., E-mail: eric.ragoucy@lapth.cnrs.fr [Laboratoire de Physique Théorique LAPTH, CNRS and Université de Savoie, BP 110, 74941 Annecy-le-Vieux Cedex (France); Slavnov, N.A., E-mail: nslavnov@mi.ras.ru [Steklov Mathematical Institute, Moscow (Russian Federation)

2014-04-15

We study integrable models solvable by the nested algebraic Bethe ansatz and possessing GL(3)-invariant R-matrix. We obtain determinant representations for form factors of off-diagonal entries of the monodromy matrix. These representations can be used for the calculation of form factors and correlation functions of the XXX SU(3)-invariant Heisenberg chain.

Complexity of the positive semidefinite matrix completion problem with a rank constraint.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios); K. Bezdek; A. Deza; Y. Ye

2013-01-01

htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is

Complexity of the positive semidefinite matrix completion problem with a rank constraint.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)

2012-01-01

htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is

Numerical methods in matrix computations

CERN Document Server

Björck, Åke

2015-01-01

Matrix algorithms are at the core of scientific computing and are indispensable tools in most applications in engineering. This book offers a comprehensive and up-to-date treatment of modern methods in matrix computation. It uses a unified approach to direct and iterative methods for linear systems, least squares and eigenvalue problems. A thorough analysis of the stability, accuracy, and complexity of the treated methods is given. Numerical Methods in Matrix Computations is suitable for use in courses on scientific computing and applied technical areas at advanced undergraduate and graduate level. A large bibliography is provided, which includes both historical and review papers as well as recent research papers. This makes the book useful also as a reference and guide to further study and research work. Åke Björck is a professor emeritus at the Department of Mathematics, Linköping University. He is a Fellow of the Society of Industrial and Applied Mathematics.

Graph Transformation and Designing Parallel Sparse Matrix Algorithms beyond Data Dependence Analysis

Directory of Open Access Journals (Sweden)

H.X. Lin

2004-01-01

Full Text Available Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithms. However, for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherently sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed. Its power in designing parallel algorithms beyond the ability of data dependence analysis is shown by means of a new algorithm called ACER (Alternating Cyclic Elimination and Reduction algorithm.

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.)

Feature fusion using kernel joint approximate diagonalization of eigen-matrices for rolling bearing fault identification

Science.gov (United States)

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.

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.

Complexity of the positive semidefinite matrix completion problem with a rank constraint

NARCIS (Netherlands)

Nagy, M.; Laurent, M.; Varvitsiotis, A.; Bezdek, K.; Deza, A.; Ye, Y.

2013-01-01

We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. In other words, for k ≥ 2, it is NP-hard to test

The J-Matrix Method Developments and Applications

CERN Document Server

Alhaidari, Abdulaziz D; Heller, Eric J; Abdelmonem, Mohamed S

2008-01-01

This volume aims to provide the fundamental knowledge to appreciate the advantages of the J-matrix method and to encourage its use and further development. The J-matrix method is an algebraic method of quantum scattering with substantial success in atomic and nuclear physics. The accuracy and convergence property of the method compares favourably with other successful scattering calculation methods. Despite its thirty-year long history new applications are being found for the J-matrix method. This book gives a brief account of the recent developments and some selected applications of the method in atomic and nuclear physics. New findings are reported in which experimental results are compared to theoretical calculations. Modifications, improvements and extensions of the method are discussed using the language of the J-matrix. The volume starts with a Foreword by the two co-founders of the method, E.J. Heller and H.A. Yamani and it contains contributions from 24 prominent international researchers.

Distribution of Off-Diagonal Cross Sections in Quantum Chaotic Scattering: Exact Results and Data Comparison.

Science.gov (United States)

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.

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

Simple expression for the quantum Fisher information matrix

Science.gov (United States)

Šafránek, Dominik

2018-04-01

Quantum Fisher information matrix (QFIM) is a cornerstone of modern quantum metrology and quantum information geometry. Apart from optimal estimation, it finds applications in description of quantum speed limits, quantum criticality, quantum phase transitions, coherence, entanglement, and irreversibility. We derive a surprisingly simple formula for this quantity, which, unlike previously known general expression, does not require diagonalization of the density matrix, and is provably at least as efficient. With a minor modification, this formula can be used to compute QFIM for any finite-dimensional density matrix. Because of its simplicity, it could also shed more light on the quantum information geometry in general.

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

Diagonal Limit for Conformal Blocks in d Dimensions

CERN Document Server

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.

Reorientation-effect measurement of the matrix element in 10Be

Science.gov (United States)

Orce, J. N.; Drake, T. E.; Djongolov, M. K.; Navrátil, P.; Triambak, S.; Ball, G. C.; Al Falou, H.; Churchman, R.; Cross, D. S.; Finlay, P.; Forssén, C.; Garnsworthy, A. B.; Garrett, P. E.; Hackman, G.; Hayes, A. B.; Kshetri, R.; Lassen, J.; Leach, K. G.; Li, R.; Meissner, J.; Pearson, C. J.; Rand, E. T.; Sarazin, F.; Sjue, S. K. L.; Stoyer, M. A.; Sumithrarachchi, C. S.; Svensson, C. E.; Tardiff, E. R.; Teigelhoefer, A.; Williams, S. J.; Wong, J.; Wu, C. Y.

2012-10-01

The highly-efficient and segmented TIGRESS γ-ray spectrometer at TRIUMF has been used to perform a reorientation-effect Coulomb-excitation study of the 21+ state at 3.368 MeV in 10Be. This is the first Coulomb-excitation measurement that enables one to obtain information on diagonal matrix elements for such a high-lying first excited state from γ-ray data. With the availability of accurate lifetime data, a value of -0.110±0.087 eb is determined for the diagonal matrix element, which assuming the rotor model, leads to a negative spectroscopic quadrupole moment of QS(21+)=-0.083±0.066 eb. This result is in agreement with both no-core shell-model calculations performed in this work with the CD-Bonn 2000 two-nucleon potential and large shell-model spaces, and Green's function Monte Carlo predictions with two- plus three-nucleon potentials.

The finite element response matrix method

International Nuclear Information System (INIS)

Nakata, H.; Martin, W.R.

1983-02-01

A new technique is developed with an alternative formulation of the response matrix method implemented with the finite element scheme. Two types of response matrices are generated from the Galerkin solution to the weak form of the diffusion equation subject to an arbitrary current and source. The piecewise polynomials are defined in two levels, the first for the local (assembly) calculations and the second for the global (core) response matrix calculations. This finite element response matrix technique was tested in two 2-dimensional test problems, 2D-IAEA benchmark problem and Biblis benchmark problem, with satisfatory results. The computational time, whereas the current code is not extensively optimized, is of the same order of the well estabilished coarse mesh codes. Furthermore, the application of the finite element technique in an alternative formulation of response matrix method permits the method to easily incorporate additional capabilities such as treatment of spatially dependent cross-sections, arbitrary geometrical configurations, and high heterogeneous assemblies. (Author) [pt

Investigation of Diagonal Antenna-Chassis Mode in Mobile Terminal LTE MIMO Antennas for Bandwidth Enhancement

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...

Fault Diagnosis of Rotating Machinery Based on the Multiscale Local Projection Method and Diagonal Slice Spectrum

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.

A parallel algorithm for Hamiltonian matrix construction in electron-molecule collision calculations: MPI-SCATCI

Science.gov (United States)

Al-Refaie, Ahmed F.; Tennyson, Jonathan

2017-12-01

Construction and diagonalization of the Hamiltonian matrix is the rate-limiting step in most low-energy electron - molecule collision calculations. Tennyson (1996) implemented a novel algorithm for Hamiltonian construction which took advantage of the structure of the wavefunction in such calculations. This algorithm is re-engineered to make use of modern computer architectures and the use of appropriate diagonalizers is considered. Test calculations demonstrate that significant speed-ups can be gained using multiple CPUs. This opens the way to calculations which consider higher collision energies, larger molecules and / or more target states. The methodology, which is implemented as part of the UK molecular R-matrix codes (UKRMol and UKRMol+) can also be used for studies of bound molecular Rydberg states, photoionization and positron-molecule collisions.

An asymptotic expression for the eigenvalues of the normalization kernel of the resonating group method

International Nuclear Information System (INIS)

Lomnitz-Adler, J.; Brink, D.M.

1976-01-01

A generating function for the eigenvalues of the RGM Normalization Kernel is expressed in terms of the diagonal matrix elements of thw GCM Overlap Kernel. An asymptotic expression for the eigenvalues is obtained by using the Method of Steepest Descent. (Auth.)

Biomechanical pole and leg characteristics during uphill diagonal roller skiing.

Science.gov (United States)

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.

Tensor-product preconditioners for higher-order space-time discontinuous Galerkin methods

Science.gov (United States)

Diosady, Laslo T.; Murman, Scott M.

2017-02-01

A space-time discontinuous-Galerkin spectral-element discretization is presented for direct numerical simulation of the compressible Navier-Stokes equations. An efficient solution technique based on a matrix-free Newton-Krylov method is developed in order to overcome the stiffness associated with high solution order. The use of tensor-product basis functions is key to maintaining efficiency at high-order. Efficient preconditioning methods are presented which can take advantage of the tensor-product formulation. A diagonalized Alternating-Direction-Implicit (ADI) scheme is extended to the space-time discontinuous Galerkin discretization. A new preconditioner for the compressible Euler/Navier-Stokes equations based on the fast-diagonalization method is also presented. Numerical results demonstrate the effectiveness of these preconditioners for the direct numerical simulation of subsonic turbulent flows.

Tensor-Product Preconditioners for Higher-Order Space-Time Discontinuous Galerkin Methods

Science.gov (United States)

Diosady, Laslo T.; Murman, Scott M.

2016-01-01

space-time discontinuous-Galerkin spectral-element discretization is presented for direct numerical simulation of the compressible Navier-Stokes equat ions. An efficient solution technique based on a matrix-free Newton-Krylov method is developed in order to overcome the stiffness associated with high solution order. The use of tensor-product basis functions is key to maintaining efficiency at high order. Efficient preconditioning methods are presented which can take advantage of the tensor-product formulation. A diagonalized Alternating-Direction-Implicit (ADI) scheme is extended to the space-time discontinuous Galerkin discretization. A new preconditioner for the compressible Euler/Navier-Stokes equations based on the fast-diagonalization method is also presented. Numerical results demonstrate the effectiveness of these preconditioners for the direct numerical simulation of subsonic turbulent flows.

A variational master equation approach to quantum dynamics with off-diagonal coupling in a sub-Ohmic environment

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.

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

Science.gov (United States)

Stoykov, S.; Atanassov, E.; Margenov, S.

2016-10-01

Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.

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

A nodal method based on matrix-response method

International Nuclear Information System (INIS)

Rocamora Junior, F.D.; Menezes, A.

1982-01-01

A nodal method based in the matrix-response method, is presented, and its application to spatial gradient problems, such as those that exist in fast reactors, near the core - blanket interface, is investigated. (E.G.) [pt

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

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.

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)

Virial expansion for almost diagonal random matrices

Science.gov (United States)

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\

Chaos in non-diagonal spatially homogeneous cosmological models in spacetime dimensions <=10

Science.gov (United States)

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

A wave propagation matrix method in semiclassical theory

International Nuclear Information System (INIS)

Lee, S.Y.; Takigawa, N.

1977-05-01

A wave propagation matrix method is used to derive the semiclassical formulae of the multiturning point problem. A phase shift matrix and a barrier transformation matrix are introduced to describe the processes of a particle travelling through a potential well and crossing a potential barrier respectively. The wave propagation matrix is given by the products of phase shift matrices and barrier transformation matrices. The method to study scattering by surface transparent potentials and the Bloch wave in solids is then applied

A Matrix Splitting Method for Composite Function Minimization

KAUST Repository

Yuan, Ganzhao

2016-12-07

Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art performance. For convex problems, we establish the global convergence, convergence rate, and iteration complexity of MSM, while for non-convex problems, we prove its global convergence. Finally, we validate the performance of our matrix splitting method on two particular applications: nonnegative matrix factorization and cardinality regularized sparse coding. Extensive experiments show that our method outperforms existing composite function minimization techniques in term of both efficiency and efficacy.

A Matrix Splitting Method for Composite Function Minimization

KAUST Repository

Yuan, Ganzhao; Zheng, Wei-Shi; Ghanem, Bernard

2016-01-01

Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art performance. For convex problems, we establish the global convergence, convergence rate, and iteration complexity of MSM, while for non-convex problems, we prove its global convergence. Finally, we validate the performance of our matrix splitting method on two particular applications: nonnegative matrix factorization and cardinality regularized sparse coding. Extensive experiments show that our method outperforms existing composite function minimization techniques in term of both efficiency and efficacy.

Scattering theory on the lattice and with a Monte Carlo method

International Nuclear Information System (INIS)

Kroeger, H.; Moriarty, K.J.M.; Potvin, J.

1990-01-01

We present an alternative time-dependent method of calculating the S matrix in quantum systems governed by a Hamiltonian. In the first step one constructs a new Hamiltonian that describes the physics of scattering at energy E with a reduced number of degrees of freedom. Its matrix elements are computed with a Monte Carlo projector method. In the second step the scattering matrix is computed algebraically via diagonalization and exponentiation of the new Hamiltonian. Although we have in mind applications in many-body systems and quantum field theory, the method should be applicable and useful in such diverse areas as atomic and molecular physics, nuclear physics, high-energy physics and solid-state physics. As an illustration of the method, we compute s-wave scattering of two nucleons in a nonrelativistic potential model (Yamaguchi potential), for which the S matrix is known exactly

The structure of solutions of the matrix linear unilateral polynomial equation with two variables

Directory of Open Access Journals (Sweden)

N. S. Dzhaliuk

2017-07-01

Full Text Available We investigate the structure of solutions of the matrix linear polynomial equation $A(\\lambdaX(\\lambda+B(\\lambdaY(\\lambda=C(\\lambda,$ in particular, possible degrees of the solutions. The solving of this equation is reduced to the solving of the equivalent matrix polynomial equation with matrix coefficients in triangular forms with invariant factors on the main diagonals, to which the matrices $A (\\lambda, B(\\lambda$ \\ and \\ $C(\\lambda$ are reduced by means of semiscalar equivalent transformations. On the basis of it, we have pointed out the bounds of the degrees of the matrix polynomial equation solutions. Necessary and sufficient conditions for the uniqueness of a solution with a minimal degree are established. An effective method for constructing minimal degree solutions of the equations is suggested. In this article, unlike well-known results about the estimations of the degrees of the solutions of the matrix polynomial equations in which both matrix coefficients are regular or at least one of them is regular, we have considered the case when the matrix polynomial equation has arbitrary matrix coefficients $A(\\lambda$ and $B(\\lambda.$ 

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)

ABCD Matrix Method a Case Study

CERN Document Server

Seidov, Zakir F; Yahalom, Asher

2004-01-01

In the Israeli Electrostatic Accelerator FEL, the distance between the accelerator's end and the wiggler's entrance is about 2.1 m, and 1.4 MeV electron beam is transported through this space using four similar quadrupoles (FODO-channel). The transfer matrix method (ABCD matrix method) was used for simulating the beam transport, a set of programs is written in the several programming languages (MATHEMATICA, MATLAB, MATCAD, MAPLE) and reasonable agreement is demonstrated between experimental results and simulations. Comparison of ABCD matrix method with the direct "numerical experiments" using EGUN, ELOP, and GPT programs with and without taking into account the space-charge effects showed the agreement to be good enough as well. Also the inverse problem of finding emittance of the electron beam at the S1 screen position (before FODO-channel), by using the spot image at S2 screen position (after FODO-channel) as function of quad currents, is considered. Spot and beam at both screens are described as tilted eel...

The finite element response Matrix method

International Nuclear Information System (INIS)

Nakata, H.; Martin, W.R.

1983-01-01

A new method for global reactor core calculations is described. This method is based on a unique formulation of the response matrix method, implemented with a higher order finite element method. The unique aspects of this approach are twofold. First, there are two levels to the overall calculational scheme: the local or assembly level and the global or core level. Second, the response matrix scheme, which is formulated at both levels, consists of two separate response matrices rather than one response matrix as is generally the case. These separate response matrices are seen to be quite beneficial for the criticality eigenvalue calculation, because they are independent of k /SUB eff/. The response matrices are generated from a Galerkin finite element solution to the weak form of the diffusion equation, subject to an arbitrary incoming current and an arbitrary distributed source. Calculational results are reported for two test problems, the two-dimensional International Atomic Energy Agency benchmark problem and a two-dimensional pressurized water reactor test problem (Biblis reactor), and they compare well with standard coarse mesh methods with respect to accuracy and efficiency. Moreover, the accuracy (and capability) is comparable to fine mesh for a fraction of the computational cost. Extension of the method to treat heterogeneous assemblies and spatial depletion effects is discussed

Spectral Sharpening of Color Sensors: Diagonal Color Constancy and Beyond

OpenAIRE

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...

Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition

NARCIS (Netherlands)

M. Laurent (Monique); M. Seminaroti (Matteo)

2016-01-01

textabstractWe present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient

Similarity-first search : A new algorithm with application to Robinsonian matrix recognition

NARCIS (Netherlands)

Laurent, Monique; Seminaroti, Matteo

2017-01-01

We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As the main ingredient we

Relativistic atomic matrix elements of rq for arbitrary states in the quantum-defect approximation

International Nuclear Information System (INIS)

Owono Owono, L.C.; Owona Angue, M.L.C.; Kwato Njock, M.G.; Oumarou, B.

2004-01-01

Recurrence relations used in the calculation of matrix elements of r q for arbitrary q and states of the relativistic one-electron atom with a point-like ionic core are obtained with Dirac and quasirelativistic effective radial Hamiltonians. The phenomenological and supersymmetry-inspired quantum-defect approaches introduced in previous works to model the electron-core interactions are employed. The formulas worked out on the basis of a hypervirial inspired method may be viewed as a generalization to off-diagonal cases of our recently reported results on the evaluation of expectation values of r q

Leak detection of complex pipelines based on the filter diagonalization method: robust technique for eigenvalue assessment

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 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

Enumeration of diagonally colored Young diagrams

OpenAIRE

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.

Finite element analysis of multi-material models using a balancing domain decomposition method combined with the diagonal scaling preconditioner

International Nuclear Information System (INIS)

Ogino, Masao

2016-01-01

Actual problems in science and industrial applications are modeled by multi-materials and large-scale unstructured mesh, and the finite element analysis has been widely used to solve such problems on the parallel computer. However, for large-scale problems, the iterative methods for linear finite element equations suffer from slow or no convergence. Therefore, numerical methods having both robust convergence and scalable parallel efficiency are in great demand. The domain decomposition method is well known as an iterative substructuring method, and is an efficient approach for parallel finite element methods. Moreover, the balancing preconditioner achieves robust convergence. However, in case of problems consisting of very different materials, the convergence becomes bad. There are some research to solve this issue, however not suitable for cases of complex shape and composite materials. In this study, to improve convergence of the balancing preconditioner for multi-materials, a balancing preconditioner combined with the diagonal scaling preconditioner, called Scaled-BDD method, is proposed. Some numerical results are included which indicate that the proposed method has robust convergence for the number of subdomains and shows high performances compared with the original balancing preconditioner. (author)

Similarity-First Search : A New Algorithm With Application to Robinsonian Matrix Recognition

NARCIS (Netherlands)

Laurent, Monique; Seminaroti, Matteo

We present a new ecient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultane- ously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce

Modeling cometary photopolarimetric characteristics with Sh-matrix method

Science.gov (United States)

Kolokolova, L.; Petrov, D.

2017-12-01

Cometary dust is dominated by particles of complex shape and structure, which are often considered as fractal aggregates. Rigorous modeling of light scattering by such particles, even using parallelized codes and NASA supercomputer resources, is very computer time and memory consuming. We are presenting a new approach to modeling cometary dust that is based on the Sh-matrix technique (e.g., Petrov et al., JQSRT, 112, 2012). This method is based on the T-matrix technique (e.g., Mishchenko et al., JQSRT, 55, 1996) and was developed after it had been found that the shape-dependent factors could be separated from the size- and refractive-index-dependent factors and presented as a shape matrix, or Sh-matrix. Size and refractive index dependences are incorporated through analytical operations on the Sh-matrix to produce the elements of T-matrix. Sh-matrix method keeps all advantages of the T-matrix method, including analytical averaging over particle orientation. Moreover, the surface integrals describing the Sh-matrix elements themselves can be solvable analytically for particles of any shape. This makes Sh-matrix approach an effective technique to simulate light scattering by particles of complex shape and surface structure. In this paper, we present cometary dust as an ensemble of Gaussian random particles. The shape of these particles is described by a log-normal distribution of their radius length and direction (Muinonen, EMP, 72, 1996). Changing one of the parameters of this distribution, the correlation angle, from 0 to 90 deg., we can model a variety of particles from spheres to particles of a random complex shape. We survey the angular and spectral dependencies of intensity and polarization resulted from light scattering by such particles, studying how they depend on the particle shape, size, and composition (including porous particles to simulate aggregates) to find the best fit to the cometary observations.

Analysis of Nonlinear Dynamics by Square Matrix Method

Energy Technology Data Exchange (ETDEWEB)

Yu, Li Hua [Brookhaven National Lab. (BNL), Upton, NY (United States). Energy and Photon Sciences Directorate. National Synchrotron Light Source II

2016-07-25

The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. In this paper, we show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix from the original large number for high order calculation to low dimension in the first step of the analysis. Then a stable Jordan decomposition is obtained with much lower dimension. The transformation to Jordan form provides an excellent action-angle approximation to the solution of the nonlinear dynamics, in good agreement with trajectories and tune obtained from tracking. And more importantly, the deviation from constancy of the new action-angle variable provides a measure of the stability of the phase space trajectories and their tunes. Thus the square matrix provides a novel method to optimize the nonlinear dynamic system. The method is illustrated by many examples of comparison between theory and numerical simulation. Finally, in particular, we show that the square matrix method can be used for optimization to reduce the nonlinearity of a system.

Transformation Matrix for Time Discretization Based on Tustin’s Method

Directory of Open Access Journals (Sweden)

Yiming Jiang

2014-01-01

Full Text Available This paper studies rules in transformation of transfer function through time discretization. A method of using transformation matrix to realize bilinear transform (also known as Tustin’s method is presented. This method can be described as the conversion between the coefficients of transfer functions, which are expressed as transform by certain matrix. For a polynomial of degree n, the corresponding transformation matrix of order n exists and is unique. Furthermore, the transformation matrix can be decomposed into an upper triangular matrix multiplied with another lower triangular matrix. And both have obvious regularity. The proposed method can achieve rapid bilinear transform used in automatic design of digital filter. The result of numerical simulation verifies the correctness of the theoretical results. Moreover, it also can be extended to other similar problems. Example in the last throws light on this point.

Diagonalizing quadratic bosonic operators by non-autonomous flow equations

CERN Document Server

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.

An iterative method to invert the LTSn matrix

Energy Technology Data Exchange (ETDEWEB)

Cardona, A.V.; Vilhena, M.T. de [UFRGS, Porto Alegre (Brazil)

1996-12-31

Recently Vilhena and Barichello proposed the LTSn method to solve, analytically, the Discrete Ordinates Problem (Sn problem) in transport theory. The main feature of this method consist in the application of the Laplace transform to the set of Sn equations and solve the resulting algebraic system for the transport flux. Barichello solve the linear system containing the parameter s applying the definition of matrix invertion exploiting the structure of the LTSn matrix. In this work, it is proposed a new scheme to invert the LTSn matrix, decomposing it in blocks and recursively inverting this blocks.

Experimental evidence of off-diagonal transport term and the discrepancy between energy/particle balance and perturbation analyses

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)

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.)

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.)

Multi-subject Manifold Alignment of Functional Network Structures via Joint Diagonalization.

Science.gov (United States)

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.

Matrix-based image reconstruction methods for tomography

International Nuclear Information System (INIS)

Llacer, J.; Meng, J.D.

1984-10-01

Matrix methods of image reconstruction have not been used, in general, because of the large size of practical matrices, ill condition upon inversion and the success of Fourier-based techniques. An exception is the work that has been done at the Lawrence Berkeley Laboratory for imaging with accelerated radioactive ions. An extension of that work into more general imaging problems shows that, with a correct formulation of the problem, positron tomography with ring geometries results in well behaved matrices which can be used for image reconstruction with no distortion of the point response in the field of view and flexibility in the design of the instrument. Maximum Likelihood Estimator methods of reconstruction, which use the system matrices tailored to specific instruments and do not need matrix inversion, are shown to result in good preliminary images. A parallel processing computer structure based on multiple inexpensive microprocessors is proposed as a system to implement the matrix-MLE methods. 14 references, 7 figures

Shrinkage-based diagonal Hotelling’s tests for high-dimensional small sample size data

KAUST Repository

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.

Shrinkage-based diagonal Hotelling’s tests for high-dimensional small sample size data

KAUST Repository

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.

A Golub-Kahan-type reduction method for matrix pairs

NARCIS (Netherlands)

Hochstenbach, M.E.; Reichel, L.; Yu, X.

2015-01-01

We describe a novel method for reducing a pair of large matrices {A;B} to a pair of small matrices {H;K}. The method is an extension of Golub-Kahan bidiagonalization to matrix pairs, and simplifies to the latter method when B is the identity matrix. Applications to Tikhonov regularization of large

A Golub-Kahan-type reduction method for matrix pairs

NARCIS (Netherlands)

Hochstenbach, M.E.; Reichel, L.; Yu, X.

2015-01-01

We describe a novel method for reducing a pair of large matrices {A,B} to a pair of small matrices {H,K}. The method is an extension of Golub–Kahan bidiagonalization to matrix pairs, and simplifies to the latter method when B is the identity matrix. Applications to Tikhonov regularization of large

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...

Generation and importance of linked and irreducible moment diagrams in the recursive residue generation method

International Nuclear Information System (INIS)

Schek, I.; Wyatt, R.E.

1986-01-01

Molecular multiphoton processes are treated in the Recursive Residue Generation Method (A. Nauts and R.E. Wyatt, Phys. Rev. Lett 51, 2238 (1983)) by converting the molecular-field Hamiltonian matrix into tridiagonal form, using the Lanczos equations. In this study, the self-energies (diagonal) and linking (off-diagaonal) terms in the tridiagonal matrix are obtained by comparing linked moment diagrams in both representations. The dynamics of the source state is introduced and computed in terms of the linked and the irreducible moments

Improved L-BFGS diagonal preconditioners for a large-scale 4D-Var inversion system: application to CO2 flux constraints and analysis error calculation

Science.gov (United States)

Bousserez, Nicolas; Henze, Daven; Bowman, Kevin; Liu, Junjie; Jones, Dylan; Keller, Martin; Deng, Feng

2013-04-01

This work presents improved analysis error estimates for 4D-Var systems. From operational NWP models to top-down constraints on trace gas emissions, many of today's data assimilation and inversion systems in atmospheric science rely on variational approaches. This success is due to both the mathematical clarity of these formulations and the availability of computationally efficient minimization algorithms. However, unlike Kalman Filter-based algorithms, these methods do not provide an estimate of the analysis or forecast error covariance matrices, these error statistics being propagated only implicitly by the system. From both a practical (cycling assimilation) and scientific perspective, assessing uncertainties in the solution of the variational problem is critical. For large-scale linear systems, deterministic or randomization approaches can be considered based on the equivalence between the inverse Hessian of the cost function and the covariance matrix of analysis error. For perfectly quadratic systems, like incremental 4D-Var, Lanczos/Conjugate-Gradient algorithms have proven to be most efficient in generating low-rank approximations of the Hessian matrix during the minimization. For weakly non-linear systems though, the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS), a quasi-Newton descent algorithm, is usually considered the best method for the minimization. Suitable for large-scale optimization, this method allows one to generate an approximation to the inverse Hessian using the latest m vector/gradient pairs generated during the minimization, m depending upon the available core memory. At each iteration, an initial low-rank approximation to the inverse Hessian has to be provided, which is called preconditioning. The ability of the preconditioner to retain useful information from previous iterations largely determines the efficiency of the algorithm. Here we assess the performance of different preconditioners to estimate the inverse Hessian of a

Behavior of Shear Link of WF Section with Diagonal Web Stiffener of Eccentrically Braced Frame (EBF of Steel Structure

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

Pre-form ceramic matrix composite cavity and method of forming and method of forming a ceramic matrix composite component

Science.gov (United States)

Monaghan, Philip Harold; Delvaux, John McConnell; Taxacher, Glenn Curtis

2015-06-09

A pre-form CMC cavity and method of forming pre-form CMC cavity for a ceramic matrix component includes providing a mandrel, applying a base ply to the mandrel, laying-up at least one CMC ply on the base ply, removing the mandrel, and densifying the base ply and the at least one CMC ply. The remaining densified base ply and at least one CMC ply form a ceramic matrix component having a desired geometry and a cavity formed therein. Also provided is a method of forming a CMC component.

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Cô rtes, A.M.A.; Coutinho, A.L.G.A.; Dalcin, L.; Calo, Victor M.

2015-01-01

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Côrtes, A.M.A.

2015-02-20

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Subspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions

DEFF Research Database (Denmark)

Hansen, Per Christian; Jensen, Søren Holdt

2007-01-01

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...... with working Matlab code and applications in speech processing....

EISPACK, Subroutines for Eigenvalues, Eigenvectors, Matrix Operations

International Nuclear Information System (INIS)

Garbow, Burton S.; Cline, A.K.; Meyering, J.

1993-01-01

: Driver subroutine for a nonsym. tridiag. matrix; SVD: Singular value decomposition of rectangular matrix; TINVIT: Find some vectors of sym. tridiag. matrix; TQLRAT: Find all values of sym. tridiag. matrix; TQL1: Find all values of sym. tridiag. matrix; TQL2: Find all values/vectors of sym. tridiag. matrix; TRBAK1: Back transform vectors of matrix formed by TRED1; TRBAK3: Back transform vectors of matrix formed by TRED3; TRED1: Reduce sym. matrix to sym. tridiag. matrix; TRED2: Reduce sym. matrix to sym. tridiag. matrix; TRED3: Reduce sym. packed matrix to sym. tridiag. matrix; TRIDIB: Find some values of sym. tridiag. matrix; TSTURM: Find some values/vectors of sym. tridiag. matrix. 2 - Method of solution: Almost all the algorithms used in EISPACK are based on similarity transformations. Similarity transformations based on orthogonal and unitary matrices are particularly attractive from a numerical point of view because they do not magnify any errors present in the input data or introduced during the computation. Most of the techniques employed are constructive realizations of variants of Schur's theorem, 'Any matrix can be triangularized by a unitary similarity transformation'. It is usually not possible to compute Schur's transformation with a finite number of rational arithmetic operations. Instead, the algorithms employ a potentially infinite sequence of similarity transformations in which the resultant matrix approaches an upper triangular matrix. The sequence is terminated when all of the sub-diagonal elements of the resulting matrix are less than the roundoff errors involved in the computation. The diagonal elements are then the desired approximations to the eigenvalues of the original matrix and the corresponding eigenvectors can be calculated. Special algorithms deal with symmetric matrices. QR, LR, QL, rational QR, bisection QZ, and inverse iteration methods are used

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

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.

Matrix elements of a hyperbolic vector operator under SO(2,1)

International Nuclear Information System (INIS)

Zettili, N.; Boukahil, A.

2003-01-01

We deal here with the use of Wigner–Eckart type arguments to calculate the matrix elements of a hyperbolic vector operator V-vector by expressing them in terms of reduced matrix elements. In particular, we focus on calculating the matrix elements of this vector operator within the basis of the hyperbolic angular momentum T-vector whose components T-vector 1 , T-vector 2 , T-vector 3 satisfy an SO(2,1) Lie algebra. We show that the commutation rules between the components of V-vector and T-vector can be inferred from the algebra of ordinary angular momentum. We then show that, by analogy to the Wigner–Eckart theorem, we can calculate the matrix elements of V-vector within a representation where T-vector 2 and T-vector 3 are jointly diagonal. (author)

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.

Comparison of matrix methods for elastic wave scattering problems

International Nuclear Information System (INIS)

Tsao, S.J.; Varadan, V.K.; Varadan, V.V.

1983-01-01

This article briefly describes the T-matrix method and the MOOT (method of optimal truncation) of elastic wave scattering as they apply to A-D, SH- wave problems as well as 3-D elastic wave problems. Two methods are compared for scattering by elliptical cylinders as well as oblate spheroids of various eccentricity as a function of frequency. Convergence, and symmetry of the scattering cross section are also compared for ellipses and spheroidal cavities of different aspect ratios. Both the T-matrix approach and the MOOT were programmed on an AMDHL 470 computer using double precision arithmetic. Although the T-matrix method and MOOT are not always in agreement, it is in no way implied that any of the published results using MOOT are in error

Group-theoretical method in the many-beam theory of electron diffraction

International Nuclear Information System (INIS)

Kogiso, Motokazu; Takahashi, Hidewo.

1977-01-01

A group-theoretical method is developed for the many-beam dynamical theory of the symmetric Laue case. When the incident wave is directed so that the Laue point lies on a symmetric position in the reciprocal lattice, the dispersion matrix in the fundamental equation can be reduced to a block diagonal form. The transformation matrix is composed of column vectors belonging to irreducible representations of the group of the incident wave vector. Without performing reduction, the reduced form of the dispersion matrix is determined from characters of representations. Practical application is made to the case of symmorphic crystals, where general reduced forms and all solvable examples are given in terms of some geometrical factors of reciprocal lattice arrangements. (auth.)

A method of orbital analysis for large-scale first-principles simulations

Energy Technology Data Exchange (ETDEWEB)

Ohwaki, Tsukuru [Advanced Materials Laboratory, Nissan Research Center, Nissan Motor Co., Ltd., 1 Natsushima-cho, Yokosuka, Kanagawa 237-8523 (Japan); Otani, Minoru [Nanosystem Research Institute, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Ibaraki 305-8568 (Japan); Ozaki, Taisuke [Research Center for Simulation Science (RCSS), Japan Advanced Institute of Science and Technology (JAIST), 1-1 Asahidai, Nomi, Ishikawa 923-1292 (Japan)

2014-06-28

An efficient method of calculating the natural bond orbitals (NBOs) based on a truncation of the entire density matrix of a whole system is presented for large-scale density functional theory calculations. The method recovers an orbital picture for O(N) electronic structure methods which directly evaluate the density matrix without using Kohn-Sham orbitals, thus enabling quantitative analysis of chemical reactions in large-scale systems in the language of localized Lewis-type chemical bonds. With the density matrix calculated by either an exact diagonalization or O(N) method, the computational cost is O(1) for the calculation of NBOs associated with a local region where a chemical reaction takes place. As an illustration of the method, we demonstrate how an electronic structure in a local region of interest can be analyzed by NBOs in a large-scale first-principles molecular dynamics simulation for a liquid electrolyte bulk model (propylene carbonate + LiBF{sub 4})

A method of orbital analysis for large-scale first-principles simulations

International Nuclear Information System (INIS)

Ohwaki, Tsukuru; Otani, Minoru; Ozaki, Taisuke

2014-01-01

An efficient method of calculating the natural bond orbitals (NBOs) based on a truncation of the entire density matrix of a whole system is presented for large-scale density functional theory calculations. The method recovers an orbital picture for O(N) electronic structure methods which directly evaluate the density matrix without using Kohn-Sham orbitals, thus enabling quantitative analysis of chemical reactions in large-scale systems in the language of localized Lewis-type chemical bonds. With the density matrix calculated by either an exact diagonalization or O(N) method, the computational cost is O(1) for the calculation of NBOs associated with a local region where a chemical reaction takes place. As an illustration of the method, we demonstrate how an electronic structure in a local region of interest can be analyzed by NBOs in a large-scale first-principles molecular dynamics simulation for a liquid electrolyte bulk model (propylene carbonate + LiBF 4 )

The use of semiempirical quantum chemical methods in studying the properties of large series of biologically active molecules

International Nuclear Information System (INIS)

Koeseoglu, Y.

2004-01-01

In this work, the productivity (temporal characteristics) of the so-called Electron Topological Method (ETM) proposed for the structure-activity relationships (SAR) investigation is studied. The method is standing aside the methods proposed for quantitative SAR (QSAR) studies because of the essential difference in the languages chosen for the compound structures description. ETM uses Electron Topological Matrices of Contiguity (ETMC) that include the most comprehensive data on the electronic structure of compounds and their topology. The flexibility of real molecules is taken into account in terms of two parameters, Δ 1 and Δ 2 , that characterise the accuracy allowed for atomic properties (diagonal matrix elements) and for bonds (non-diagonal ones). The dependence of the feature realisation on different values of Δ 1 and Δ 2 is studied and its graphical representation is given

Numerical Method for Darcy Flow Derived Using Discrete Exterior Calculus

Science.gov (United States)

Hirani, A. N.; Nakshatrala, K. B.; Chaudhry, J. H.

2015-05-01

We derive a numerical method for Darcy flow, and also for Poisson's equation in mixed (first order) form, based on discrete exterior calculus (DEC). Exterior calculus is a generalization of vector calculus to smooth manifolds and DEC is one of its discretizations on simplicial complexes such as triangle and tetrahedral meshes. DEC is a coordinate invariant discretization, in that it does not depend on the embedding of the simplices or the whole mesh. We start by rewriting the governing equations of Darcy flow using the language of exterior calculus. This yields a formulation in terms of flux differential form and pressure. The numerical method is then derived by using the framework provided by DEC for discretizing differential forms and operators that act on forms. We also develop a discretization for a spatially dependent Hodge star that varies with the permeability of the medium. This also allows us to address discontinuous permeability. The matrix representation for our discrete non-homogeneous Hodge star is diagonal, with positive diagonal entries. The resulting linear system of equations for flux and pressure are saddle type, with a diagonal matrix as the top left block. The performance of the proposed numerical method is illustrated on many standard test problems. These include patch tests in two and three dimensions, comparison with analytically known solutions in two dimensions, layered medium with alternating permeability values, and a test with a change in permeability along the flow direction. We also show numerical evidence of convergence of the flux and the pressure. A convergence experiment is included for Darcy flow on a surface. A short introduction to the relevant parts of smooth and discrete exterior calculus is included in this article. We also include a discussion of the boundary condition in terms of exterior calculus.

Refractive index inversion based on Mueller matrix method

Science.gov (United States)

Fan, Huaxi; Wu, Wenyuan; Huang, Yanhua; Li, Zhaozhao

2016-03-01

Based on Stokes vector and Jones vector, the correlation between Mueller matrix elements and refractive index was studied with the result simplified, and through Mueller matrix way, the expression of refractive index inversion was deduced. The Mueller matrix elements, under different incident angle, are simulated through the expression of specular reflection so as to analyze the influence of the angle of incidence and refractive index on it, which is verified through the measure of the Mueller matrix elements of polished metal surface. Research shows that, under the condition of specular reflection, the result of Mueller matrix inversion is consistent with the experiment and can be used as an index of refraction of inversion method, and it provides a new way for target detection and recognition technology.

Effective nucleus-nucleus potentials derived from the generator coordinate method

Energy Technology Data Exchange (ETDEWEB)

Friedrich, H; Canto, L F [Oxford Univ. (UK). Dept. of Theoretical Physics

1977-11-07

The equivalence of the generator coordinate method (GCM) and the resonating group method (RGM) and the formal equivalence of the RGM and the orthogonality condition model (OCM) lead to a relation connecting the effective nucleus-nucleus potentials of the OCM with matrix elements of the GCM. This relation may be used to derive effective nucleus-nucleus potentials directly from GCM matrix elements without explicit reference to the potentials of the RGM. In a first application local and l-independent effective potentials are derived from diagonal GCM matrix elements which represent the energy surfaces of a two-centre shell model. Using these potentials the OCM can reproduce the results of a full RGM calculation very well for the elastic scattering of two ..cap alpha..-particles and fairly well for elastic /sup 16/O-/sup 16/O scattering.

INVESTIGATION OF THE EFFECTS OF DIFFERENT EDGE JOINT ELEMENTS ON DIAGONAL TENSILE STRENGTH IN FURNITURE EDGE JOINTS

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.

Direct determination of scattering time delays using the R-matrix propagation method

International Nuclear Information System (INIS)

Walker, R.B.; Hayes, E.F.

1989-01-01

A direct method for determining time delays for scattering processes is developed using the R-matrix propagation method. The procedure involves the simultaneous generation of the global R matrix and its energy derivative. The necessary expressions to obtain the energy derivative of the S matrix are relatively simple and involve many of the same matrix elements required for the R-matrix propagation method. This method is applied to a simple model for a chemical reaction that displays sharp resonance features. The test results of the direct method are shown to be in excellent agreement with the traditional numerical differentiation method for scattering energies near the resonance energy. However, for sharp resonances the numerical differentiation method requires calculation of the S-matrix elements at many closely spaced energies. Since the direct method presented here involves calculations at only a single energy, one is able to generate accurate energy derivatives and time delays much more efficiently and reliably

Efficient implementations of block sparse matrix operations on shared memory vector machines

International Nuclear Information System (INIS)

Washio, T.; Maruyama, K.; Osoda, T.; Doi, S.; Shimizu, F.

2000-01-01

In this paper, we propose vectorization and shared memory-parallelization techniques for block-type random sparse matrix operations in finite element (FEM) applications. Here, a block corresponds to unknowns on one node in the FEM mesh and we assume that the block size is constant over the mesh. First, we discuss some basic vectorization ideas (the jagged diagonal (JAD) format and the segmented scan algorithm) for the sparse matrix-vector product. Then, we extend these ideas to the shared memory parallelization. After that, we show that the techniques can be applied not only to the sparse matrix-vector product but also to the sparse matrix-matrix product, the incomplete or complete sparse LU factorization and preconditioning. Finally, we report the performance evaluation results obtained on an NEC SX-4 shared memory vector machine for linear systems in some FEM applications. (author)

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.)

An improvement of the filter diagonalization-based post-processing method applied to finite difference time domain calculations of three-dimensional phononic band structures

International Nuclear Information System (INIS)

Su Xiaoxing; Zhang Chuanzeng; Ma Tianxue; Wang Yuesheng

2012-01-01

When three-dimensional (3D) phononic band structures are calculated by using the finite difference time domain (FDTD) method with a relatively small number of iterations, the results can be effectively improved by post-processing the FDTD time series (FDTD-TS) based on the filter diagonalization method (FDM), instead of the classical fast Fourier transform. In this paper, we propose a way to further improve the performance of the FDM-based post-processing method by introducing a relatively large number of observing points to record the FDTD-TS. To this end, the existing scheme of FDTD-TS preprocessing is modified. With the new preprocessing scheme, the processing efficiency of a single FDTD-TS can be improved significantly, and thus the entire post-processing method can have sufficiently high efficiency even when a relatively large number of observing points are used. The feasibility of the proposed method for improvement is verified by the numerical results.

The Matrix Element Method at Next-to-Leading Order

OpenAIRE

Campbell, John M.; Giele, Walter T.; Williams, Ciaran

2012-01-01

This paper presents an extension of the matrix element method to next-to-leading order in perturbation theory. To accomplish this we have developed a method to calculate next-to-leading order weights on an event-by-event basis. This allows for the definition of next-to-leading order likelihoods in exactly the same fashion as at leading order, thus extending the matrix element method to next-to-leading order. A welcome by-product of the method is the straightforward and efficient generation of...

Sparse matrix-vector multiplication on GPGPU clusters: A new storage format and a scalable implementation

OpenAIRE

Kreutzer, Moritz; Hager, Georg; Wellein, Gerhard; Fehske, Holger; Basermann, Achim; Bishop, Alan R.

2011-01-01

Sparse matrix-vector multiplication (spMVM) is the dominant operation in many sparse solvers. We investigate performance properties of spMVM with matrices of various sparsity patterns on the nVidia “Fermi” class of GPGPUs. A new “padded jagged diagonals storage” (pJDS) format is proposed which may substantially reduce the memory overhead intrinsic to the widespread ELLPACK-R scheme while making no assumptions about the matrix structure. In our test scenarios the pJDS format cuts the ...

New developments in the discrete ordinate method for the resolution of the radiative transfer equation

International Nuclear Information System (INIS)

Ben Jaffel, L.; Vidal-Madjar, A.

1989-01-01

The discrete ordinate method for the resolution of the radiative transfer equation is developed. We show that the construction of a quasi-analytical solution to the corresponding matrix diagonalization problem reduces the time calculation and allows the use of more dense discrete frequency and angle grids. Comparison with previous work is made, showing that the present method reduces by more than a factor of ten the computational time, and is more appropriate in all cases

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

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)

Experiences with the quadratic Korringa-Kohn-Rostoker band theory method

International Nuclear Information System (INIS)

Faulkner, J.S.

1992-01-01

This paper reports on the Quadratic Korriga-Kohn-Rostoker method which is a fast band theory method in the sense that all eigenvalues for a given k are obtained from one matrix diagonalization, but it differs from other fast band theory methods in that it is derived entirely from multiple-scattering theory, without the introduction of a Rayleigh-Ritz variations step. In this theory, the atomic potentials are shifted by Δσ(r) with Δ equal to E-E 0 and σ(r) equal to one when r is inside the Wigner-Seitz cell and zero otherwise, and it turns out that the matrix of coefficients is an entire function of Δ. This matrix can be terminated to give a linear KKR, quadratic KKR, cubic KKR,..., or not terminated at all to give the pivoted multiple-scattering equations. Full potential are no harder to deal with than potentials with a shape approximation

Off-Diagonal Deformations of Kerr Black Holes in Einstein and Modified Massive Gravity and Higher Dimensions

CERN Document Server

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...

An improved 4-step commutation method application for matrix converter

DEFF Research Database (Denmark)

Guo, Yu; Guo, Yougui; Deng, Wenlang

2014-01-01

A novel four-step commutation method is proposed for matrix converter cell, 3 phase inputs to 1 phase output in this paper, which is obtained on the analysis of published commutation methods for matrix converter. The first and fourth step can be shorter than the second or third one. The discussed...... method here is implemented by programming in VHDL language. Finally, the novel method in this paper is verified by experiments....

Surco diagonal en el lóbulo de la oreja: ¿signo de enfermedad arterial coronaria? Diagonal earlobe crease: a sign of coronary artery disease?

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.

Widening the Scope of R-matrix Methods

Energy Technology Data Exchange (ETDEWEB)

Thompson, Ian J. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Dimitriou, Paraskevi [IAEA, Vienna (Austria); DeBoer, Richard J. [Nieuwland Science Hall, Notre Dame, IN (United States); Kunieda, Satoshi [Nuclear Data Center (JAEA), Tokai (Japan); Paris, Mark [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Thompson, Ian [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Trkov, Andrej [IAEA, Vienna (Austria)

2016-03-01

A Consultant’s Meeting was held at the IAEA Headquarters, from 7 to 9 December 2015, to discuss the status of R-matrix codes currently used in calculations of charged-particle induced reaction cross sections at low energies. The ultimate goal was to initiate an international effort, coordinated by the IAEA, to evaluate charged-particle induced reactions in the resolved-resonance region. Participants reviewed the capabilities of the codes, the different implementations of R-matrix theory and translatability of the R-matrix parameters, the evaluation methods and suitable data formats for broader dissemination. The details of the presentations and technical discussions, as well as the actions that were proposed to achieve the goal of the meeting are summarized in this report.

Application of the R-matrix method to photoionization of molecules.

Science.gov (United States)

Tashiro, Motomichi

2010-04-07

The R-matrix method has been used for theoretical calculation of electron collision with atoms and molecules for long years. The method was also formulated to treat photoionization process, however, its application has been mostly limited to photoionization of atoms. In this work, we implement the R-matrix method to treat molecular photoionization problem based on the UK R-matrix codes. This method can be used for diatomic as well as polyatomic molecules, with multiconfigurational description for electronic states of both target neutral molecule and product molecular ion. Test calculations were performed for valence electron photoionization of nitrogen (N(2)) as well as nitric oxide (NO) molecules. Calculated photoionization cross sections and asymmetry parameters agree reasonably well with the available experimental results, suggesting usefulness of the method for molecular photoionization.

Three-body forces for electrons by the S-matrix method

International Nuclear Information System (INIS)

Margaritelli, R.

1989-01-01

A electromagnetic three-body potential between eletrons is derived by the S-matrix method. This potential can be compared up to a certain point with other electromagnetic potentials (obtained by other methods) encountered in the literature. However, since the potential derived here is far more complete than others, this turns direct comparison with the potentials found in the literature somewhat difficult. These calculations allow a better understanding of the S-matrix method as applied to problems which involve the calculations of three-body nuclear forces (these calculations are performed in order to understand the 3 He form factor). Furthermore, these results enable us to decide between two discrepant works which derive the two-pion exchange three-body potential, both by the S-matrix method. (author) [pt

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...

Hybrid transfer-matrix FDTD method for layered periodic structures.

Science.gov (United States)

Deinega, Alexei; Belousov, Sergei; Valuev, Ilya

2009-03-15

A hybrid transfer-matrix finite-difference time-domain (FDTD) method is proposed for modeling the optical properties of finite-width planar periodic structures. This method can also be applied for calculation of the photonic bands in infinite photonic crystals. We describe the procedure of evaluating the transfer-matrix elements by a special numerical FDTD simulation. The accuracy of the new method is tested by comparing computed transmission spectra of a 32-layered photonic crystal composed of spherical or ellipsoidal scatterers with the results of direct FDTD and layer-multiple-scattering calculations.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

Akbudak, Kadir

2018-02-24

Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

Akbudak, Kadir; Ltaief, Hatem; Mikhalev, Aleksandr; Charara, Ali; Keyes, David E.

2018-01-01

Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.

A nodal method based on the response-matrix method

International Nuclear Information System (INIS)

Cunha Menezes Filho, A. da; Rocamora Junior, F.D.

1983-02-01

A nodal approach based on the Response-Matrix method is presented with the purpose of investigating the possibility of mixing two different allocations in the same problem. It is found that the use of allocation of albedo combined with allocation of direct reflection produces good results for homogeneous fast reactor configurations. (Author) [pt

properties of the SN - equivalent integral transport operator in slab geometry and the iterative acceleration of neutron transport methods

International Nuclear Information System (INIS)

Massimiliano, Rosa; Azmy, Y.Y.; Morel, J.E.

2005-01-01

The general expressions for the matrix elements of the discrete Sn-equivalent integral transport operator have been derived in slab geometry. Their asymptotic behavior has been investigated both for a homogeneous slab and for a heterogeneous slab characterized by a periodic material discontinuity wherein each optically thick cell is surrounded by two optically thin cells in a repeating pattern. In the case of a homogeneous slab, the asymptotic analysis conducted in a diffusive limit obtained as the thick limit of computational cell size for a highly scattering medium, has shown that the discretized integral transport operator is approximated by a sparse matrix characterized by a tri-diagonal diffusion-like coupling stencil. Also, the tri-diagonal matrix structure, characteristic of the diffusion coupling stencil, is approached at a fast exponential rate. In the case of periodically heterogeneous slab configurations, the asymptotic behavior investigated is that in which the cells' optical thicknesses are pushed apart, i.e. the thick is made thicker while the thin is made thinner at a prescribed rate. It has been shown that in this limit the discretized integral transport operator is approximated by a penta-diagonal structure. Notwithstanding, the discrete operator is amenable to algebraic transformations leading to a matrix representation still asymptotically approaching a tri-diagonal structure at a fast exponential rate. The existence of a low order tri-diagonal approximation to the full discrete integral transport operator in the case of a periodically heterogeneous slab might provide a basic understanding of the superior convergence properties of diffusion-based acceleration schemes observed in slab geometry, even in the presence of sharp material discontinuities. The obtained results also suggest that a sparse approximation to the S n -equivalent integral transport operator might itself be used as the low-order operator in an acceleration scheme for the

Matrix method for two-dimensional waveguide mode solution

Science.gov (United States)

Sun, Baoguang; Cai, Congzhong; Venkatesh, Balajee Seshasayee

2018-05-01

In this paper, we show that the transfer matrix theory of multilayer optics can be used to solve the modes of any two-dimensional (2D) waveguide for their effective indices and field distributions. A 2D waveguide, even composed of numerous layers, is essentially a multilayer stack and the transmission through the stack can be analysed using the transfer matrix theory. The result is a transfer matrix with four complex value elements, namely A, B, C and D. The effective index of a guided mode satisfies two conditions: (1) evanescent waves exist simultaneously in the first (cladding) layer and last (substrate) layer, and (2) the complex element D vanishes. For a given mode, the field distribution in the waveguide is the result of a 'folded' plane wave. In each layer, there is only propagation and absorption; at each boundary, only reflection and refraction occur, which can be calculated according to the Fresnel equations. As examples, we show that this method can be used to solve modes supported by the multilayer step-index dielectric waveguide, slot waveguide, gradient-index waveguide and various plasmonic waveguides. The results indicate the transfer matrix method is effective for 2D waveguide mode solution in general.

Finite difference time domain calculation of three-dimensional phononic band structures using a postprocessing method based on the filter diagonalization

International Nuclear Information System (INIS)

Su Xiaoxing; Ma Tianxue; Wang Yuesheng

2011-01-01

If the band structure of a three-dimensional (3D) phononic crystal (PNC) is calculated by using the finite difference time domain (FDTD) method combined with the fast Fourier transform (FFT)-based postprocessing method, good results can only be ensured by a sufficiently large number of FDTD iterations. On a common computer platform, the total computation time will be very long. To overcome this difficulty, an excellent harmonic inversion algorithm called the filter diagonalization method (FDM) can be used in the postprocessing to reduce the number of FDTD iterations. However, the low efficiency of the FDM, which occurs when a relatively long time series is given, does not necessarily ensure an effective reduction of the total computation time. In this paper, a postprocessing method based on the FDM is proposed. The main procedure of the method is designed considering the aim to make the time spent on the method itself far less than the corresponding time spent on the FDTD iterations. To this end, the FDTD time series is preprocessed to be shortened significantly before the FDM frequency extraction. The preprocessing procedure is performed with the filter and decimation operations, which are widely used in narrow-band signal processing. Numerical results for a typical 3D solid PNC system show that the proposed postprocessing method can be used to effectively reduce the total computation time of the FDTD calculation of 3D phononic band structures.

Finite difference time domain calculation of three-dimensional phononic band structures using a postprocessing method based on the filter diagonalization

Energy Technology Data Exchange (ETDEWEB)

Su Xiaoxing [School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044 (China); Ma Tianxue; Wang Yuesheng, E-mail: xxsu@bjtu.edu.cn [Institute of Engineering Mechanics, Beijing Jiaotong University, Beijing 100044 (China)

2011-10-15

If the band structure of a three-dimensional (3D) phononic crystal (PNC) is calculated by using the finite difference time domain (FDTD) method combined with the fast Fourier transform (FFT)-based postprocessing method, good results can only be ensured by a sufficiently large number of FDTD iterations. On a common computer platform, the total computation time will be very long. To overcome this difficulty, an excellent harmonic inversion algorithm called the filter diagonalization method (FDM) can be used in the postprocessing to reduce the number of FDTD iterations. However, the low efficiency of the FDM, which occurs when a relatively long time series is given, does not necessarily ensure an effective reduction of the total computation time. In this paper, a postprocessing method based on the FDM is proposed. The main procedure of the method is designed considering the aim to make the time spent on the method itself far less than the corresponding time spent on the FDTD iterations. To this end, the FDTD time series is preprocessed to be shortened significantly before the FDM frequency extraction. The preprocessing procedure is performed with the filter and decimation operations, which are widely used in narrow-band signal processing. Numerical results for a typical 3D solid PNC system show that the proposed postprocessing method can be used to effectively reduce the total computation time of the FDTD calculation of 3D phononic band structures.

Theoretical treatment of molecular photoionization based on the R-matrix method

International Nuclear Information System (INIS)

Tashiro, Motomichi

2012-01-01

The R-matrix method was implemented to treat molecular photoionization problem based on the UK R-matrix codes. This method was formulated to treat photoionization process long before, however, its application has been mostly limited to photoionization of atoms. Application of the method to valence photoionization as well as inner-shell photoionization process will be presented.

Why the South Pacific Convergence Zone is diagonal

OpenAIRE

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 ...

Interface discontinuity factors in the modal Eigenspace of the multigroup diffusion matrix

International Nuclear Information System (INIS)

Garcia-Herranz, N.; Herrero, J.J.; Cuervo, D.; Ahnert, C.

2011-01-01

Interface discontinuity factors based on the Generalized Equivalence Theory are commonly used in nodal homogenized diffusion calculations so that diffusion average values approximate heterogeneous higher order solutions. In this paper, an additional form of interface correction factors is presented in the frame of the Analytic Coarse Mesh Finite Difference Method (ACMFD), based on a correction of the modal fluxes instead of the physical fluxes. In the ACMFD formulation, implemented in COBAYA3 code, the coupled multigroup diffusion equations inside a homogenized region are reduced to a set of uncoupled modal equations through diagonalization of the multigroup diffusion matrix. Then, physical fluxes are transformed into modal fluxes in the Eigenspace of the diffusion matrix. It is possible to introduce interface flux discontinuity jumps as the difference of heterogeneous and homogeneous modal fluxes instead of introducing interface discontinuity factors as the ratio of heterogeneous and homogeneous physical fluxes. The formulation in the modal space has been implemented in COBAYA3 code and assessed by comparison with solutions using classical interface discontinuity factors in the physical space. (author)

Enhanced spectral resolution by high-dimensional NMR using the filter diagonalization method and "hidden" dimensions.

Science.gov (United States)

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.

Working memory and individual differences in the encoding of vertical, horizontal and diagonal symmetry.

Science.gov (United States)

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.

Quantum Glass of Interacting Bosons with Off-Diagonal Disorder

Science.gov (United States)

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.

Efficient computation method of Jacobian matrix

International Nuclear Information System (INIS)

Sasaki, Shinobu

1995-05-01

As well known, the elements of the Jacobian matrix are complex trigonometric functions of the joint angles, resulting in a matrix of staggering complexity when we write it all out in one place. This article addresses that difficulties to this subject are overcome by using velocity representation. The main point is that its recursive algorithm and computer algebra technologies allow us to derive analytical formulation with no human intervention. Particularly, it is to be noted that as compared to previous results the elements are extremely simplified throughout the effective use of frame transformations. Furthermore, in case of a spherical wrist, it is shown that the present approach is computationally most efficient. Due to such advantages, the proposed method is useful in studying kinematically peculiar properties such as singularity problems. (author)

An analogue of Wagner's theorem for decompositions of matrix algebras

International Nuclear Information System (INIS)

Ivanov, D N

2004-01-01

Wagner's celebrated theorem states that a finite affine plane whose collineation group is transitive on lines is a translation plane. The notion of an orthogonal decomposition (OD) of a classically semisimple associative algebra introduced by the author allows one to draw an analogy between finite affine planes of order n and ODs of the matrix algebra M n (C) into a sum of subalgebras conjugate to the diagonal subalgebra. These ODs are called WP-decompositions and are equivalent to the well-known ODs of simple Lie algebras of type A n-1 into a sum of Cartan subalgebras. In this paper we give a detailed and improved proof of the analogue of Wagner's theorem for WP-decompositions of the matrix algebra of odd non-square order an outline of which was earlier published in a short note in 'Russian Math. Surveys' in 1994. In addition, in the framework of the theory of ODs of associative algebras, based on the method of idempotent bases, we obtain an elementary proof of the well-known Kostrikin-Tiep theorem on irreducible ODs of Lie algebras of type A n-1 in the case where n is a prime-power.

Pseudopotencial method of Waeber and Stoll; application to the lithium case

International Nuclear Information System (INIS)

Oliveira Miguel, S.

1975-01-01

A study and a program for digital computer, using the method of energy bands calculation proposed by Waeber and Stoll in 1972, is made. Such method is based upon the solution of a similar transformed Schroedinger equation, whose solution, lay in a restrict sub-space of Hilbert space. The solution of the transformed equation needs fewer basis function than the other methods to expand the trial wave function. This fact requires the diagonalization of a small order matrix and consequently less machine time is used. For the testing of the method and the program, the energy bands of lithium were evaluated with good results [pt

Performance optimization of spectral amplitude coding OCDMA system using new enhanced multi diagonal code

Science.gov (United States)

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.

Spectral/spatial optical CDMA code based on Diagonal Eigenvalue Unity

Science.gov (United States)

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.

Modified Dynamical Supergravity Breaking and Off-Diagonal Super-Higgs Effects

CERN Document Server

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.

An exploration of the influence of diagonal dissociation and moderate changes in speed on locomotor parameters in trotting horses

Directory of Open Access Journals (Sweden)

Sarah Jane Hobbs

2016-06-01

Full Text Available Background. Although the trot is described as a diagonal gait, contacts of the diagonal pairs of hooves are not usually perfectly synchronized. Although subtle, the timing dissociation between contacts of each diagonal pair could have consequences on gait dynamics and provide insight into the functional strategies employed. This study explores the mechanical effects of different diagonal dissociation patterns when speed was matched between individuals and how these effects link to moderate, natural changes in trotting speed. We anticipate that hind-first diagonal dissociation at contact increases with speed, diagonal dissociation at contact can reduce collision-based energy losses and predominant dissociation patterns will be evident within individuals. Methods. The study was performed in two parts: in the first 17 horses performed speed-matched trotting trials and in the second, five horses each performed 10 trotting trials that represented a range of individually preferred speeds. Standard motion capture provided kinematic data that were synchronized with ground reaction force (GRF data from a series of force plates. The data were analyzed further to determine temporal, speed, GRF, postural, mass distribution, moment, and collision dynamics parameters. Results. Fore-first, synchronous, and hind-first dissociations were found in horses trotting at (3.3 m/s ± 10%. In these speed-matched trials, mean centre of pressure (COP cranio-caudal location differed significantly between the three dissociation categories. The COP moved systematically and significantly (P = .001 from being more caudally located in hind-first dissociation (mean location = 0.41 ± 0.04 through synchronous (0.36 ± 0.02 to a more cranial location in fore-first dissociation (0.32 ± 0.02. Dissociation patterns were found to influence function, posture, and balance parameters. Over a moderate speed range, peak vertical forelimb GRF had a strong relationship with dissociation

Multi-Target Angle Tracking Algorithm for Bistatic Multiple-Input Multiple-Output (MIMO Radar Based on the Elements of the Covariance Matrix

Directory of Open Access Journals (Sweden)

Zhengyan Zhang

2018-03-01

Full Text Available In this paper, we consider the problem of tracking the direction of arrivals (DOA and the direction of departure (DOD of multiple targets for bistatic multiple-input multiple-output (MIMO radar. A high-precision tracking algorithm for target angle is proposed. First, the linear relationship between the covariance matrix difference and the angle difference of the adjacent moment was obtained through three approximate relations. Then, the proposed algorithm obtained the relationship between the elements in the covariance matrix difference. On this basis, the performance of the algorithm was improved by averaging the covariance matrix element. Finally, the least square method was used to estimate the DOD and DOA. The algorithm realized the automatic correlation of the angle and provided better performance when compared with the adaptive asymmetric joint diagonalization (AAJD algorithm. The simulation results demonstrated the effectiveness of the proposed algorithm. The algorithm provides the technical support for the practical application of MIMO radar.

Multi-Target Angle Tracking Algorithm for Bistatic Multiple-Input Multiple-Output (MIMO) Radar Based on the Elements of the Covariance Matrix.

Science.gov (United States)

Zhang, Zhengyan; Zhang, Jianyun; Zhou, Qingsong; Li, Xiaobo

2018-03-07

In this paper, we consider the problem of tracking the direction of arrivals (DOA) and the direction of departure (DOD) of multiple targets for bistatic multiple-input multiple-output (MIMO) radar. A high-precision tracking algorithm for target angle is proposed. First, the linear relationship between the covariance matrix difference and the angle difference of the adjacent moment was obtained through three approximate relations. Then, the proposed algorithm obtained the relationship between the elements in the covariance matrix difference. On this basis, the performance of the algorithm was improved by averaging the covariance matrix element. Finally, the least square method was used to estimate the DOD and DOA. The algorithm realized the automatic correlation of the angle and provided better performance when compared with the adaptive asymmetric joint diagonalization (AAJD) algorithm. The simulation results demonstrated the effectiveness of the proposed algorithm. The algorithm provides the technical support for the practical application of MIMO radar.

The response-matrix based AFEN method for the hexagonal geometry

International Nuclear Information System (INIS)

Noh, Jae Man; Kim, Keung Koo; Zee, Sung Quun; Joo, Hyung Kook; Cho, Byng Oh; Jeong, Hyung Guk; Cho, Jin Young

1998-03-01

The analytic function expansion nodal (AFEN) method, developed to overcome the limitations caused by the transverse integration, has been successfully to predict the neutron behavior in the hexagonal core as well as rectangular core. In the hexagonal node, the transverse leakage resulted from the transverse integration has some singular terms such as delta-function and step-functions near the node center line. In most nodal methods using the transverse integration, the accuracy of nodal method is degraded because the transverse leakage is approximated as a smooth function across the node center line by ignoring singular terms. However, the AFEN method in which there is no transverse leakage term in deriving nodal coupling equations keeps good accuracy for hexagonal node. In this study, the AFEN method which shows excellent accuracy in the hexagonal core analyses is reformulated as a response matrix form. This form of the AFEN method can be implemented easily to nodal codes based on the response matrix method. Therefore, the Coarse Mesh Rebalance (CMR) acceleration technique which is one of main advantages of the response matrix method can be utilized for the AFEN method. The response matrix based AFEN method has been successfully implemented into the MASTER code and its accuracy and computational efficiency were examined by analyzing the two- and three- dimensional benchmark problem of VVER-440. Based on the results, it can be concluded that the newly formulated AFEN method predicts accurately the assembly powers (within 0.2% average error) as well as the effective multiplication factor (within 0.2% average error) as well as the effective multiplication factor (within 20 pcm error). In addition, the CMR acceleration technique is quite efficient in reducing the computation time of the AFEN method by 8 to 10 times. (author). 22 refs., 1 tab., 4 figs

Analytical techniques for instrument design - matrix methods

International Nuclear Information System (INIS)

Robinson, R.A.

1997-01-01

We take the traditional Cooper-Nathans approach, as has been applied for many years for steady-state triple-axis spectrometers, and consider its generalisation to other inelastic scattering spectrometers. This involves a number of simple manipulations of exponentials of quadratic forms. In particular, we discuss a toolbox of matrix manipulations that can be performed on the 6- dimensional Cooper-Nathans matrix: diagonalisation (Moller-Nielsen method), coordinate changes e.g. from (Δk I ,Δk F to ΔE, ΔQ ampersand 2 dummy variables), integration of one or more variables (e.g. over such dummy variables), integration subject to linear constraints (e.g. Bragg's Law for analysers), inversion to give the variance-covariance matrix, and so on. We show how these tools can be combined to solve a number of important problems, within the narrow-band limit and the gaussian approximation. We will argue that a generalised program that can handle multiple different spectrometers could (and should) be written in parallel to the Monte-Carlo packages that are becoming available. We will also discuss the complementarity between detailed Monte-Carlo calculations and the approach presented here. In particular, Monte-Carlo methods traditionally simulate the real experiment as performed in practice, given a model scattering law, while the Cooper-Nathans method asks the inverse question: given that a neutron turns up in a particular spectrometer configuration (e.g. angle and time of flight), what is the probability distribution of possible scattering events at the sample? The Monte-Carlo approach could be applied in the same spirit to this question

Matrix-based system reliability method and applications to bridge networks

International Nuclear Information System (INIS)

Kang, W.-H.; Song Junho; Gardoni, Paolo

2008-01-01

Using a matrix-based system reliability (MSR) method, one can estimate the probabilities of complex system events by simple matrix calculations. Unlike existing system reliability methods whose complexity depends highly on that of the system event, the MSR method describes any general system event in a simple matrix form and therefore provides a more convenient way of handling the system event and estimating its probability. Even in the case where one has incomplete information on the component probabilities and/or the statistical dependence thereof, the matrix-based framework enables us to estimate the narrowest bounds on the system failure probability by linear programming. This paper presents the MSR method and applies it to a transportation network consisting of bridge structures. The seismic failure probabilities of bridges are estimated by use of the predictive fragility curves developed by a Bayesian methodology based on experimental data and existing deterministic models of the seismic capacity and demand. Using the MSR method, the probability of disconnection between each city/county and a critical facility is estimated. The probability mass function of the number of failed bridges is computed as well. In order to quantify the relative importance of bridges, the MSR method is used to compute the conditional probabilities of bridge failures given that there is at least one city disconnected from the critical facility. The bounds on the probability of disconnection are also obtained for cases with incomplete information

CMFD and GPU acceleration on method of characteristics for hexagonal cores

International Nuclear Information System (INIS)

Han, Yu; Jiang, Xiaofeng; Wang, Dezhong

2014-01-01

Highlights: • A merged hex-mesh CMFD method solved via tri-diagonal matrix inversion. • Alternative hardware acceleration of using inexpensive GPU. • A hex-core benchmark with solution to confirm two acceleration methods. - Abstract: Coarse Mesh Finite Difference (CMFD) has been widely adopted as an effective way to accelerate the source iteration of transport calculation. However in a core with hexagonal assemblies there are non-hexagonal meshes around the edges of assemblies, causing a problem for CMFD if the CMFD equations are still to be solved via tri-diagonal matrix inversion by simply scanning the whole core meshes in different directions. To solve this problem, we propose an unequal mesh CMFD formulation that combines the non-hexagonal cells on the boundary of neighboring assemblies into non-regular hexagonal cells. We also investigated the alternative hardware acceleration of using graphics processing units (GPU) with graphics card in a personal computer. The tool CUDA is employed, which is a parallel computing platform and programming model invented by the company NVIDIA for harnessing the power of GPU. To investigate and implement these two acceleration methods, a 2-D hexagonal core transport code using the method of characteristics (MOC) is developed. A hexagonal mini-core benchmark problem is established to confirm the accuracy of the MOC code and to assess the effectiveness of CMFD and GPU parallel acceleration. For this benchmark problem, the CMFD acceleration increases the speed 16 times while the GPU acceleration speeds it up 25 times. When used simultaneously, they provide a speed gain of 292 times

CMFD and GPU acceleration on method of characteristics for hexagonal cores

Energy Technology Data Exchange (ETDEWEB)

Han, Yu, E-mail: hanyu1203@gmail.com [School of Nuclear Science and Engineering, Shanghai Jiaotong University, Shanghai 200240 (China); Jiang, Xiaofeng [Shanghai NuStar Nuclear Power Technology Co., Ltd., No. 81 South Qinzhou Road, XuJiaHui District, Shanghai 200000 (China); Wang, Dezhong [School of Nuclear Science and Engineering, Shanghai Jiaotong University, Shanghai 200240 (China)

2014-12-15

Highlights: • A merged hex-mesh CMFD method solved via tri-diagonal matrix inversion. • Alternative hardware acceleration of using inexpensive GPU. • A hex-core benchmark with solution to confirm two acceleration methods. - Abstract: Coarse Mesh Finite Difference (CMFD) has been widely adopted as an effective way to accelerate the source iteration of transport calculation. However in a core with hexagonal assemblies there are non-hexagonal meshes around the edges of assemblies, causing a problem for CMFD if the CMFD equations are still to be solved via tri-diagonal matrix inversion by simply scanning the whole core meshes in different directions. To solve this problem, we propose an unequal mesh CMFD formulation that combines the non-hexagonal cells on the boundary of neighboring assemblies into non-regular hexagonal cells. We also investigated the alternative hardware acceleration of using graphics processing units (GPU) with graphics card in a personal computer. The tool CUDA is employed, which is a parallel computing platform and programming model invented by the company NVIDIA for harnessing the power of GPU. To investigate and implement these two acceleration methods, a 2-D hexagonal core transport code using the method of characteristics (MOC) is developed. A hexagonal mini-core benchmark problem is established to confirm the accuracy of the MOC code and to assess the effectiveness of CMFD and GPU parallel acceleration. For this benchmark problem, the CMFD acceleration increases the speed 16 times while the GPU acceleration speeds it up 25 times. When used simultaneously, they provide a speed gain of 292 times.

Electronic structure of disordered alloys - I: self-consistent cluster CPA incorporating off-diagonal disorder and short-range order

International Nuclear Information System (INIS)

Kumar, V.; Mookerjee, A.; Srivastava, V.K.

1980-09-01

We have developed here a self-consistent coherent potential approximation generalized to take into account effect of clusters. Off-diagonal disorder and short-range order are taken into account. A graphical method married to the recursion technique, enables us to work on realistic three-dimensional lattices. Calculations are shown for a binary alloy on a diamond lattice. (author)

Recurrence quantity analysis based on matrix eigenvalues

Science.gov (United States)

Yang, Pengbo; Shang, Pengjian

2018-06-01

Recurrence plots is a powerful tool for visualization and analysis of dynamical systems. Recurrence quantification analysis (RQA), based on point density and diagonal and vertical line structures in the recurrence plots, is considered to be alternative measures to quantify the complexity of dynamical systems. In this paper, we present a new measure based on recurrence matrix to quantify the dynamical properties of a given system. Matrix eigenvalues can reflect the basic characteristics of the complex systems, so we show the properties of the system by exploring the eigenvalues of the recurrence matrix. Considering that Shannon entropy has been defined as a complexity measure, we propose the definition of entropy of matrix eigenvalues (EOME) as a new RQA measure. We confirm that EOME can be used as a metric to quantify the behavior changes of the system. As a given dynamical system changes from a non-chaotic to a chaotic regime, the EOME will increase as well. The bigger EOME values imply higher complexity and lower predictability. We also study the effect of some factors on EOME,including data length, recurrence threshold, the embedding dimension, and additional noise. Finally, we demonstrate an application in physiology. The advantage of this measure lies in a high sensitivity and simple computation.

Triple collocation-based estimation of spatially correlated observation error covariance in remote sensing soil moisture data assimilation

Science.gov (United States)

Wu, Kai; Shu, Hong; Nie, Lei; Jiao, Zhenhang

2018-01-01

Spatially correlated errors are typically ignored in data assimilation, thus degenerating the observation error covariance R to a diagonal matrix. We argue that a nondiagonal R carries more observation information making assimilation results more accurate. A method, denoted TC_Cov, was proposed for soil moisture data assimilation to estimate spatially correlated observation error covariance based on triple collocation (TC). Assimilation experiments were carried out to test the performance of TC_Cov. AMSR-E soil moisture was assimilated with a diagonal R matrix computed using the TC and assimilated using a nondiagonal R matrix, as estimated by proposed TC_Cov. The ensemble Kalman filter was considered as the assimilation method. Our assimilation results were validated against climate change initiative data and ground-based soil moisture measurements using the Pearson correlation coefficient and unbiased root mean square difference metrics. These experiments confirmed that deterioration of diagonal R assimilation results occurred when model simulation is more accurate than observation data. Furthermore, nondiagonal R achieved higher correlation coefficient and lower ubRMSD values over diagonal R in experiments and demonstrated the effectiveness of TC_Cov to estimate richly structuralized R in data assimilation. In sum, compared with diagonal R, nondiagonal R may relieve the detrimental effects of assimilation when simulated model results outperform observation data.

ASSET: Analysis of Sequences of Synchronous Events in Massively Parallel Spike Trains

Science.gov (United States)

Canova, Carlos; Denker, Michael; Gerstein, George; Helias, Moritz

2016-01-01

With the ability to observe the activity from large numbers of neurons simultaneously using modern recording technologies, the chance to identify sub-networks involved in coordinated processing increases. Sequences of synchronous spike events (SSEs) constitute one type of such coordinated spiking that propagates activity in a temporally precise manner. The synfire chain was proposed as one potential model for such network processing. Previous work introduced a method for visualization of SSEs in massively parallel spike trains, based on an intersection matrix that contains in each entry the degree of overlap of active neurons in two corresponding time bins. Repeated SSEs are reflected in the matrix as diagonal structures of high overlap values. The method as such, however, leaves the task of identifying these diagonal structures to visual inspection rather than to a quantitative analysis. Here we present ASSET (Analysis of Sequences of Synchronous EvenTs), an improved, fully automated method which determines diagonal structures in the intersection matrix by a robust mathematical procedure. The method consists of a sequence of steps that i) assess which entries in the matrix potentially belong to a diagonal structure, ii) cluster these entries into individual diagonal structures and iii) determine the neurons composing the associated SSEs. We employ parallel point processes generated by stochastic simulations as test data to demonstrate the performance of the method under a wide range of realistic scenarios, including different types of non-stationarity of the spiking activity and different correlation structures. Finally, the ability of the method to discover SSEs is demonstrated on complex data from large network simulations with embedded synfire chains. Thus, ASSET represents an effective and efficient tool to analyze massively parallel spike data for temporal sequences of synchronous activity. PMID:27420734

Transfer matrix method for four-flux radiative transfer.

Science.gov (United States)

Slovick, Brian; Flom, Zachary; Zipp, Lucas; Krishnamurthy, Srini

2017-07-20

We develop a transfer matrix method for four-flux radiative transfer, which is ideally suited for studying transport through multiple scattering layers. The model predicts the specular and diffuse reflection and transmission of multilayer composite films, including interface reflections, for diffuse or collimated incidence. For spherical particles in the diffusion approximation, we derive closed-form expressions for the matrix coefficients and show remarkable agreement with numerical Monte Carlo simulations for a range of absorption values and film thicknesses, and for an example multilayer slab.

Comparison of experimental methods for estimating matrix diffusion coefficients for contaminant transport modeling

Science.gov (United States)

Telfeyan, Katherine; Ware, S. Doug; Reimus, Paul W.; Birdsell, Kay H.

2018-02-01

Diffusion cell and diffusion wafer experiments were conducted to compare methods for estimating effective matrix diffusion coefficients in rock core samples from Pahute Mesa at the Nevada Nuclear Security Site (NNSS). A diffusion wafer method, in which a solute diffuses out of a rock matrix that is pre-saturated with water containing the solute, is presented as a simpler alternative to the traditional through-diffusion (diffusion cell) method. Both methods yielded estimates of effective matrix diffusion coefficients that were within the range of values previously reported for NNSS volcanic rocks. The difference between the estimates of the two methods ranged from 14 to 30%, and there was no systematic high or low bias of one method relative to the other. From a transport modeling perspective, these differences are relatively minor when one considers that other variables (e.g., fracture apertures, fracture spacings) influence matrix diffusion to a greater degree and tend to have greater uncertainty than effective matrix diffusion coefficients. For the same relative random errors in concentration measurements, the diffusion cell method yields effective matrix diffusion coefficient estimates that have less uncertainty than the wafer method. However, the wafer method is easier and less costly to implement and yields estimates more quickly, thus allowing a greater number of samples to be analyzed for the same cost and time. Given the relatively good agreement between the methods, and the lack of any apparent bias between the methods, the diffusion wafer method appears to offer advantages over the diffusion cell method if better statistical representation of a given set of rock samples is desired.

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....

A stochastic method for computing hadronic matrix elements

Energy Technology Data Exchange (ETDEWEB)

Alexandrou, Constantia [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; The Cyprus Institute, Nicosia (Cyprus). Computational-based Science and Technology Research Center; Dinter, Simon; Drach, Vincent [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Jansen, Karl [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Hadjiyiannakou, Kyriakos [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Renner, Dru B. [Thomas Jefferson National Accelerator Facility, Newport News, VA (United States); Collaboration: European Twisted Mass Collaboration

2013-02-15

We present a stochastic method for the calculation of baryon three-point functions that is more versatile compared to the typically used sequential method. We analyze the scaling of the error of the stochastically evaluated three-point function with the lattice volume and find a favorable signal-to-noise ratio suggesting that our stochastic method can be used efficiently at large volumes to compute hadronic matrix elements.

Response Matrix Method Development Program at Savannah River Laboratory

International Nuclear Information System (INIS)

Sicilian, J.M.

1976-01-01

The Response Matrix Method Development Program at Savannah River Laboratory (SRL) has concentrated on the development of an effective system of computer codes for the analysis of Savannah River Plant (SRP) reactors. The most significant contribution of this program to date has been the verification of the accuracy of diffusion theory codes as used for routine analysis of SRP reactor operation. This paper documents the two steps carried out in achieving this verification: confirmation of the accuracy of the response matrix technique through comparison with experiment and Monte Carlo calculations; and establishment of agreement between diffusion theory and response matrix codes in situations which realistically approximate actual operating conditions

A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem

Science.gov (United States)

Pintea, Camelia-M.; Crişan, Gloria-Cerasela; Chira, Camelia

The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investigated {NP}-complete problem, as it has broad applications in industry, logistics, artificial intelligence or information recovery. This paper describes a new attempt to use the Ant Colony Optimization framework in tackling MBMP. The introduced model is based on the hybridization of the Ant Colony System technique with new local search mechanisms. Computational experiments confirm a good performance of the proposed algorithm for the considered set of MBMP instances.

Iterative approach as alternative to S-matrix in modal methods

Science.gov (United States)

Semenikhin, Igor; Zanuccoli, Mauro

2014-12-01

The continuously increasing complexity of opto-electronic devices and the rising demands of simulation accuracy lead to the need of solving very large systems of linear equations making iterative methods promising and attractive from the computational point of view with respect to direct methods. In particular, iterative approach potentially enables the reduction of required computational time to solve Maxwell's equations by Eigenmode Expansion algorithms. Regardless of the particular eigenmodes finding method used, the expansion coefficients are computed as a rule by scattering matrix (S-matrix) approach or similar techniques requiring order of M3 operations. In this work we consider alternatives to the S-matrix technique which are based on pure iterative or mixed direct-iterative approaches. The possibility to diminish the impact of M3 -order calculations to overall time and in some cases even to reduce the number of arithmetic operations to M2 by applying iterative techniques are discussed. Numerical results are illustrated to discuss validity and potentiality of the proposed approaches.

Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

Science.gov (United States)

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 New Method of Creating Technology/Function Matrix for Systematic Innovation without Expert

Directory of Open Access Journals (Sweden)

Tien-Yuan Cheng

2012-02-01

Full Text Available The technology/function matrix is comprised by specific technologies and functions, and through the technology/function matrix we can known what the technologies with functions have opportunities for innovation of product or technology. However, the technology/function matrix is very difficult to create, because the patents need to be read, analyzed and categorized into the technology/function matrix always more than hundreds or thousands. In this research, I propose a method to create a technology/function matrix just need to execute patent search without reading and analyzing patents. Through the proposed method anyone can create a technology/function matrix in a short time without experts’ help even if there are thousands of thousands of patents need to be read and analyzed.

Characteristics of 201Tl myocardial SPECT and left ventriculography in patients with acute diagonal branch myocardial infarction

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)

Enhanced spectral resolution by high-dimensional NMR using the filter diagonalization method and “hidden” dimensions

Science.gov (United States)

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. PMID:18926747

Diagonally arranged louvers in integrated facade systems - effects on the interior lighting environment

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.

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.

Convergence of Chahine's nonlinear relaxation inversion method used for limb viewing remote sensing

Science.gov (United States)

Chu, W. P.

1985-01-01

The application of Chahine's (1970) inversion technique to remote sensing problems utilizing the limb viewing geometry is discussed. The problem considered here involves occultation-type measurements and limb radiance-type measurements from either spacecraft or balloon platforms. The kernel matrix of the inversion problem is either an upper or lower triangular matrix. It is demonstrated that the Chahine inversion technique always converges, provided the diagonal elements of the kernel matrix are nonzero.

Harnessing molecular excited states with Lanczos chains

Science.gov (United States)

Baroni, Stefano; Gebauer, Ralph; Bariş Malcioğlu, O.; Saad, Yousef; Umari, Paolo; Xian, Jiawei

2010-02-01

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Harnessing molecular excited states with Lanczos chains

Energy Technology Data Exchange (ETDEWEB)

Baroni, Stefano; Baris Malcioglu, O; Xian Jiawei [SISSA-Scuola Internazionale Superiore di Studi Avanzati, I-34151 Trieste (Italy); Gebauer, Ralph; Umari, Paolo [CNR DEMOCRITOS Theory-Elettra Group, c/o Sincrotrone Trieste, Area Science Park, I-34012 Basovizza, Trieste (Italy); Saad, Yousef [Department of Computer Science and Engineering, University of Minnesota, and Minnesota Supercomputing Institute, Minneapolis, MN 55455 (United States)

2010-02-24

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Harnessing molecular excited states with Lanczos chains.

Science.gov (United States)

Baroni, Stefano; Gebauer, Ralph; Bariş Malcioğlu, O; Saad, Yousef; Umari, Paolo; Xian, Jiawei

2010-02-24

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Harnessing molecular excited states with Lanczos chains

International Nuclear Information System (INIS)

Baroni, Stefano; Baris Malcioglu, O; Xian Jiawei; Gebauer, Ralph; Umari, Paolo; Saad, Yousef

2010-01-01

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Matrix completion by deep matrix factorization.

Science.gov (United States)

Fan, Jicong; Cheng, Jieyu

2018-02-01

Conventional methods of matrix completion are linear methods that are not effective in handling data of nonlinear structures. Recently a few researchers attempted to incorporate nonlinear techniques into matrix completion but there still exists considerable limitations. In this paper, a novel method called deep matrix factorization (DMF) is proposed for nonlinear matrix completion. Different from conventional matrix completion methods that are based on linear latent variable models, DMF is on the basis of a nonlinear latent variable model. DMF is formulated as a deep-structure neural network, in which the inputs are the low-dimensional unknown latent variables and the outputs are the partially observed variables. In DMF, the inputs and the parameters of the multilayer neural network are simultaneously optimized to minimize the reconstruction errors for the observed entries. Then the missing entries can be readily recovered by propagating the latent variables to the output layer. DMF is compared with state-of-the-art methods of linear and nonlinear matrix completion in the tasks of toy matrix completion, image inpainting and collaborative filtering. The experimental results verify that DMF is able to provide higher matrix completion accuracy than existing methods do and DMF is applicable to large matrices. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Elongation cutoff technique armed with quantum fast multipole method for linear scaling.

Science.gov (United States)

Korchowiec, Jacek; Lewandowski, Jakub; Makowski, Marcin; Gu, Feng Long; Aoki, Yuriko

2009-11-30

A linear-scaling implementation of the elongation cutoff technique (ELG/C) that speeds up Hartree-Fock (HF) self-consistent field calculations is presented. The cutoff method avoids the known bottleneck of the conventional HF scheme, that is, diagonalization, because it operates within the low dimension subspace of the whole atomic orbital space. The efficiency of ELG/C is illustrated for two model systems. The obtained results indicate that the ELG/C is a very efficient sparse matrix algebra scheme. Copyright 2009 Wiley Periodicals, Inc.

Nucleon matrix elements using the variational method in lattice QCD

International Nuclear Information System (INIS)

Dragos, J.; Kamleh, W.; Leinweber, D.B.; Zanotti, J.M.; Rakow, P.E.L.; Young, R.D.; Adelaide Univ., SA

2016-06-01

The extraction of hadron matrix elements in lattice QCD using the standard two- and threepoint correlator functions demands careful attention to systematic uncertainties. One of the most commonly studied sources of systematic error is contamination from excited states. We apply the variational method to calculate the axial vector current g_A, the scalar current g_S and the quark momentum fraction left angle x right angle of the nucleon and we compare the results to the more commonly used summation and two-exponential fit methods. The results demonstrate that the variational approach offers a more efficient and robust method for the determination of nucleon matrix elements.

Positivity of Fundamental Matrix and Exponential Stability of Delay Differential System

Directory of Open Access Journals (Sweden)

Alexander Domoshnitsky

2014-01-01

Full Text Available The classical Wazewski theorem established that nonpositivity of all nondiagonal elements pij  (i≠j,  i,j=1,…,n is necessary and sufficient for nonnegativity of the fundamental (Cauchy matrix and consequently for applicability of the Chaplygin approach of approximate integration for system of linear ordinary differential equations xi′t+∑j=1n‍pijtxjt=fit,   i=1,…,n. Results on nonnegativity of the Cauchy matrix for system of delay differential equations xi′t+∑j=1n‍pijtxjhijt=fit,   i=1,…,n, which were based on nonpositivity of all diagonal elements, were presented in the previous works. Then examples, which demonstrated that nonpositivity of nondiagonal coefficients pij is not necessary for systems of delay equations, were found. In this paper first sufficient results about nonnegativity of the Cauchy matrix of the delay system without this assumption are proven. A necessary condition of nonnegativity of the Cauchy matrix is proposed. On the basis of these results on nonnegativity of the Cauchy matrix, necessary and sufficient conditions of the exponential stability of the delay system are obtained.

Polynomial intelligent states

International Nuclear Information System (INIS)

Milks, Matthew M; Guise, Hubert de

2005-01-01

The construction of su(2) intelligent states is simplified using a polynomial representation of su(2). The cornerstone of the new construction is the diagonalization of a 2 x 2 matrix. The method is sufficiently simple to be easily extended to su(3), where one is required to diagonalize a single 3 x 3 matrix. For two perfectly general su(3) operators, this diagonalization is technically possible but the procedure loses much of its simplicity owing to the algebraic form of the roots of a cubic equation. Simplified expressions can be obtained by specializing the choice of su(3) operators. This simpler construction will be discussed in detail

Use of a preconditioned Bi-conjugate gradient method for hybrid plasma stability analysis

International Nuclear Information System (INIS)

Mikic, Z.; Morse, E.C.

1985-01-01

The numerical stability analysis of compact toroidal plasmas using implicit time differencing requires the solution of a set of coupled, 2-dimensional, elliptic partial differential equations for the field quantities at every timestep. When the equations are spatially finite-differenced and written in matrix form, the resulting matrix is large, sparse, complex, non-Hermitian, and indefinite. The use of the preconditioned bi-conjugate gradient method for solving these equations is discussed. The effect of block-diagonal preconditioning and incomplete block-LU preconditionig on the convergence of the method is investigated. For typical matrices arising in our studies, the eigenvalue spectra of the original and preconditioned matrices are calculated as an illustration of the effectiveness of the preconditioning. We show that the preconditioned bi-conjugate gradient method coverages more rapidly than the conjugate gradient method applied to the normal equations, and that it is an effective iterative method for the class of non-Hermitian, indefinite problems of interest

Angles of total shifts and angles of maxumum crop during development of faces diagonal to seam strike directions

Directory of Open Access Journals (Sweden)

Н. А. Колесник

2017-06-01

Full Text Available When predicting deformations and determining measures to protect underworked objects, angular parameters are used: the boundary angles, the angles of total shift, the angle of maximum crop. The values of these angular parameters are given in the normative documents, but only for sections across and along the strike of the formation. However, at present, longwall face mining is mainly being carried out along a diagonal direction to the strike of the formation. In connection with this, the determination of the values of the angular parameters for such conditions is a topical task.The method of determination and the analytical dependences of the angles of total shifts and angles of maximum crop in sections of the longitudinal and transverse axes of coal-mining faces developed along diagonal directions to the strike of the formation are proposed. These angular parameters are used for prognosis of deformations of the earth's surface and for determining the characteristic zones of influence of mine workings on the local places.

Using Volunteer Computing to Study Some Features of Diagonal Latin Squares

Science.gov (United States)

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.

A New Pseudoinverse Matrix Method For Balancing Chemical Equations And Their Stability

International Nuclear Information System (INIS)

Risteski, Ice B.

2008-01-01

In this work is given a new pseudoniverse matrix method for balancing chemical equations. Here offered method is founded on virtue of the solution of a Diophantine matrix equation by using of a Moore-Penrose pseudoinverse matrix. The method has been tested on several typical chemical equations and found to be very successful for the all equations in our extensive balancing research. This method, which works successfully without any limitations, also has the capability to determine the feasibility of a new chemical reaction, and if it is feasible, then it will balance the equation. Chemical equations treated here possess atoms with fractional oxidation numbers. Also, in the present work are introduced necessary and sufficient criteria for stability of chemical equations over stability of their extended matrices

Chosen interval methods for solving linear interval systems with special type of matrix

Science.gov (United States)

Szyszka, Barbara

2013-10-01

The paper is devoted to chosen direct interval methods for solving linear interval systems with special type of matrix. This kind of matrix: band matrix with a parameter, from finite difference problem is obtained. Such linear systems occur while solving one dimensional wave equation (Partial Differential Equations of hyperbolic type) by using the central difference interval method of the second order. Interval methods are constructed so as the errors of method are enclosed in obtained results, therefore presented linear interval systems contain elements that determining the errors of difference method. The chosen direct algorithms have been applied for solving linear systems because they have no errors of method. All calculations were performed in floating-point interval arithmetic.

On the performance of diagonal lattice space-time codes

KAUST Repository

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.

Successive Over Relaxation Method Which Uses Matrix Norms for ...

African Journals Online (AJOL)

An algorithm for S.O.R functional iteration which uses matrix norms for the Jacobi iteration matrices rather than the usual Power method, feasible in Newton Operator for the solution of nonlinear system of equations is proposed. We modified the S.O.R. iterative method known as Multiphase S.O.R. method for Newton ...

On a novel matrix method for three-dimensional photoelasticity

International Nuclear Information System (INIS)

Theocaris, P.S.; Gdoutos, E.E.

1978-01-01

A non-destructive method for the photoelastic determination of three-dimensional stress distributions, based on the Mueller and Jones calculi, is developed. The differential equations satisfied by the Stokes and Jones vectors, when a polarized light beam passes through a photoelastic model, presenting rotation of the secondary principal stress directions, are established in matrix form. The Peano-Baker method is used for the solution of these differential equations in a matrix series form, establishing the elements of the Mueller and Jones matrices of the photoelastic model. These matrices are experimentally determined by using different wavelengths in conjunction with Jones' 'equivalence theorem'. The Neumann equations are immediately deduced from the above-mentioned differential equations. (orig.) [de

Nonlinear response matrix methods for radiative transfer

International Nuclear Information System (INIS)

Miller, W.F. Jr.; Lewis, E.E.

1987-01-01

A nonlinear response matrix formalism is presented for the solution of time-dependent radiative transfer problems. The essential feature of the method is that within each computational cell the temperature is calculated in response to the incoming photons from all frequency groups. Thus the updating of the temperature distribution is placed within the iterative solution of the spaceangle transport problem, instead of being placed outside of it. The method is formulated for both grey and multifrequency problems and applied in slab geometry. The method is compared to the more conventional source iteration technique. 7 refs., 1 fig., 4 tabs

Theoretical study of the dependence of single impurity Anderson model on various parameters within distributional exact diagonalization method

Science.gov (United States)

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.

High-resolution pyrimidine- and ribose-specific 4D HCCH-COSY spectra of RNA using the filter diagonalization method

International Nuclear Information System (INIS)

Douglas, Justin T.; Latham, Michael P.; Armstrong, Geoffrey S.; Bendiak, Brad; Pardi, Arthur

2008-01-01

The NMR spectra of nucleic acids suffer from severe peak overlap, which complicates resonance assignments. 4D NMR experiments can overcome much of the degeneracy in 2D and 3D spectra; however, the linear increase in acquisition time with each new dimension makes it impractical to acquire high-resolution 4D spectra using standard Fourier transform (FT) techniques. The filter diagonalization method (FDM) is a numerically efficient algorithm that fits the entire multi-dimensional time-domain data to a set of multi-dimensional oscillators. Selective 4D constant-time HCCH-COSY experiments that correlate the H5-C5-C6-H6 base spin systems of pyrimidines or the H1'-C1'-C2'-H2' spin systems of ribose sugars were acquired on the 13 C-labeled iron responsive element (IRE) RNA. FDM-processing of these 4D experiments recorded with only 8 complex points in the indirect dimensions showed superior spectral resolution than FT-processed spectra. Practical aspects of obtaining optimal FDM-processed spectra are discussed. The results here demonstrate that FDM-processing can be used to obtain high-resolution 4D spectra on a medium sized RNA in a fraction of the acquisition time normally required for high-resolution, high-dimensional spectra

Measuring methods of matrix diffusion

International Nuclear Information System (INIS)

Muurinen, A.; Valkiainen, M.

1988-03-01

In Finland the spent nuclear fuel is planned to be disposed of at large depths in crystalline bedrock. The radionuclides which are dissolved in the groundwater may be able to diffuse into the micropores of the porous rock matrix and thus be withdrawn from the flowing water in the fractures. This phenomenon is called matrix diffusion. A review over matrix diffusion is presented in the study. The main interest is directed to the diffusion of non-sorbing species. The review covers diffusion experiments and measurements of porosity, pore size, specific surface area and water permeability

An integrating factor matrix method to find first integrals

International Nuclear Information System (INIS)

Saputra, K V I; Quispel, G R W; Van Veen, L

2010-01-01

In this paper we develop an integrating factor matrix method to derive conditions for the existence of first integrals. We use this novel method to obtain first integrals, along with the conditions for their existence, for two- and three-dimensional Lotka-Volterra systems with constant terms. The results are compared to previous results obtained by other methods.

J-matrix method of scattering in one dimension: The nonrelativistic theory

International Nuclear Information System (INIS)

Alhaidari, A.D.; Bahlouli, H.; Abdelmonem, M.S.

2009-01-01

We formulate a theory of nonrelativistic scattering in one dimension based on the J-matrix method. The scattering potential is assumed to have a finite range such that it is well represented by its matrix elements in a finite subset of a basis that supports a tridiagonal matrix representation for the reference wave operator. Contrary to our expectation, the 1D formulation reveals a rich and highly nontrivial structure compared to the 3D formulation. Examples are given to demonstrate the utility and accuracy of the method. It is hoped that this formulation constitutes a viable alternative to the classical treatment of 1D scattering problem and that it will help unveil new and interesting applications.

A Comparison of Methods for Estimating the Determinant of High-Dimensional Covariance Matrix

KAUST Repository

Hu, Zongliang; Dong, Kai; Dai, Wenlin; Tong, Tiejun

2017-01-01

The determinant of the covariance matrix for high-dimensional data plays an important role in statistical inference and decision. It has many real applications including statistical tests and information theory. Due to the statistical and computational challenges with high dimensionality, little work has been proposed in the literature for estimating the determinant of high-dimensional covariance matrix. In this paper, we estimate the determinant of the covariance matrix using some recent proposals for estimating high-dimensional covariance matrix. Specifically, we consider a total of eight covariance matrix estimation methods for comparison. Through extensive simulation studies, we explore and summarize some interesting comparison results among all compared methods. We also provide practical guidelines based on the sample size, the dimension, and the correlation of the data set for estimating the determinant of high-dimensional covariance matrix. Finally, from a perspective of the loss function, the comparison study in this paper may also serve as a proxy to assess the performance of the covariance matrix estimation.

A Comparison of Methods for Estimating the Determinant of High-Dimensional Covariance Matrix

KAUST Repository

Hu, Zongliang

2017-09-27

The determinant of the covariance matrix for high-dimensional data plays an important role in statistical inference and decision. It has many real applications including statistical tests and information theory. Due to the statistical and computational challenges with high dimensionality, little work has been proposed in the literature for estimating the determinant of high-dimensional covariance matrix. In this paper, we estimate the determinant of the covariance matrix using some recent proposals for estimating high-dimensional covariance matrix. Specifically, we consider a total of eight covariance matrix estimation methods for comparison. Through extensive simulation studies, we explore and summarize some interesting comparison results among all compared methods. We also provide practical guidelines based on the sample size, the dimension, and the correlation of the data set for estimating the determinant of high-dimensional covariance matrix. Finally, from a perspective of the loss function, the comparison study in this paper may also serve as a proxy to assess the performance of the covariance matrix estimation.

A Comparison of Methods for Estimating the Determinant of High-Dimensional Covariance Matrix.

Science.gov (United States)

Hu, Zongliang; Dong, Kai; Dai, Wenlin; Tong, Tiejun

2017-09-21

The determinant of the covariance matrix for high-dimensional data plays an important role in statistical inference and decision. It has many real applications including statistical tests and information theory. Due to the statistical and computational challenges with high dimensionality, little work has been proposed in the literature for estimating the determinant of high-dimensional covariance matrix. In this paper, we estimate the determinant of the covariance matrix using some recent proposals for estimating high-dimensional covariance matrix. Specifically, we consider a total of eight covariance matrix estimation methods for comparison. Through extensive simulation studies, we explore and summarize some interesting comparison results among all compared methods. We also provide practical guidelines based on the sample size, the dimension, and the correlation of the data set for estimating the determinant of high-dimensional covariance matrix. Finally, from a perspective of the loss function, the comparison study in this paper may also serve as a proxy to assess the performance of the covariance matrix estimation.

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

Improvement of the Convergence of the Invariant Imbedding T-Matrix Method

Science.gov (United States)

Zhai, S.; Panetta, R. L.; Yang, P.

2017-12-01

The invariant imbedding T-matrix method (IITM) is based on an electromagnetic volume integral equation to compute the T-matrix of an arbitrary scattering particle. A free-space Green's function is chosen as the integral kernel and thus each source point is placed in an imaginary vacuum spherical shell extending from the center to that source point. The final T-matrix (of the largest circumscribing sphere) is obtained through an iterative relation that, layer by layer, computes the T-matrix from the particle center to the outermost shell. On each spherical shell surface, an integration of the product of the refractive index 𝜀(𝜃, 𝜑) and vector spherical harmonics must be performed, resulting in the so-called U-matrix, which directly leads to the T-matrix on the spherical surface. Our observations indicate that the matrix size and sparseness are determined by the particular refractive index function 𝜀(𝜃, 𝜑). If 𝜀(𝜃, 𝜑) is an analytic function on the surface, then the matrix elements resulting from the integration decay rapidly, leading to sparse matrix; if 𝜀(𝜃, 𝜑) is not (for example, contains jump discontinuities), then the matrix elements decay slowly, leading to a large dense matrix. The intersection between an irregular scatterer and each spherical shell can leave jump discontinuities in 𝜀(𝜃, 𝜑) distributed over the shell surface. The aforementioned feature is analogous to the Gibbs phenomenon appearing in the orthogonal expansion of non-smooth functions with Hermitian eigenfunctions (complex exponential, Legendre, Bessel,...) where poor convergence speed is a direct consequence of the slow decay rate of the expansion coefficients. Various methods have been developed to deal with this slow convergence in the presence of discontinuities. Among the different approaches the most practical one may be a spectral filter: a filter is applied on the

Miscellaneous subjects, ch. 18

International Nuclear Information System (INIS)

Brussaard, P.J.; Glaudemans, P.W.M.

1977-01-01

Attention is paid to a variery of subjects which are related to shell model applications, e.g. the Lanczos method for matrix diagonalization, truncation methods (seniority truncation, single-particle energy truncation and diagonal energy truncation which can be used for reducing the configuration space.) Coulomb energies and spurious states are briefly discussed. Finally attention is paid to the particle-vibrator model

Novel Direction Of Arrival Estimation Method Based on Coherent Accumulation Matrix Reconstruction

Directory of Open Access Journals (Sweden)

Li Lei

2015-04-01

Full Text Available Based on coherent accumulation matrix reconstruction, a novel Direction Of Arrival (DOA estimation decorrelation method of coherent signals is proposed using a small sample. First, the Signal to Noise Ratio (SNR is improved by performing coherent accumulation operation on an array of observed data. Then, according to the structure characteristics of the accumulated snapshot vector, the equivalent covariance matrix, whose rank is the same as the number of array elements, is constructed. The rank of this matrix is proved to be determined just by the number of incident signals, which realize the decorrelation of coherent signals. Compared with spatial smoothing method, the proposed method performs better by effectively avoiding aperture loss with high-resolution characteristics and low computational complexity. Simulation results demonstrate the efficiency of the proposed method.

Off-diagonal series expansion for quantum partition functions

Science.gov (United States)

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.

Decomposition of spectra in EPR dosimetry using the matrix method

International Nuclear Information System (INIS)

Sholom, S.V.; Chumak, V.V.

2003-01-01

The matrix method of EPR spectra decomposition is developed and adapted for routine application in retrospective EPR dosimetry with teeth. According to this method, the initial EPR spectra are decomposed (using methods of matrix algebra) into several reference components (reference matrices) that are specific for each material. Proposed procedure has been tested on the example of tooth enamel. Reference spectra were a spectrum of an empty sample tube and three standard signals of enamel (two at g=2.0045, both for the native signal and one at g perpendicular =2.0018, g parallel =1.9973 for the dosimetric signal). Values of dosimetric signals obtained using the given method have been compared with data obtained by manual manipulation of spectra, and good coincidence was observed. This allows considering the proposed method as potent for application in routine EPR dosimetry

The time-dependent density matrix renormalisation group method

Science.gov (United States)

Ma, Haibo; Luo, Zhen; Yao, Yao

2018-04-01

Substantial progress of the time-dependent density matrix renormalisation group (t-DMRG) method in the recent 15 years is reviewed in this paper. By integrating the time evolution with the sweep procedures in density matrix renormalisation group (DMRG), t-DMRG provides an efficient tool for real-time simulations of the quantum dynamics for one-dimensional (1D) or quasi-1D strongly correlated systems with a large number of degrees of freedom. In the illustrative applications, the t-DMRG approach is applied to investigate the nonadiabatic processes in realistic chemical systems, including exciton dissociation and triplet fission in polymers and molecular aggregates as well as internal conversion in pyrazine molecule.

Standard test method for translaminar fracture toughness of laminated and pultruded polymer matrix composite materials

CERN Document Server

American Society for Testing and Materials. Philadelphia

2004-01-01

1.1 This test method covers the determination of translaminar fracture toughness, KTL, for laminated and pultruded polymer matrix composite materials of various ply orientations using test results from monotonically loaded notched specimens. 1.2 This test method is applicable to room temperature laboratory air environments. 1.3 Composite materials that can be tested by this test method are not limited by thickness or by type of polymer matrix or fiber, provided that the specimen sizes and the test results meet the requirements of this test method. This test method was developed primarily from test results of various carbon fiber – epoxy matrix laminates and from additional results of glass fiber – epoxy matrix, glass fiber-polyester matrix pultrusions and carbon fiber – bismaleimide matrix laminates (1-4, 6, 7). 1.4 A range of eccentrically loaded, single-edge-notch tension, ESE(T), specimen sizes with proportional planar dimensions is provided, but planar size may be variable and adjusted, with asso...

A collocation finite element method with prior matrix condensation

International Nuclear Information System (INIS)

Sutcliffe, W.J.

1977-01-01

For thin shells with general loading, sixteen degrees of freedom have been used for a previous finite element solution procedure using a Collocation method instead of the usual variational based procedures. Although the number of elements required was relatively small, nevertheless the final matrix for the simultaneous solution of all unknowns could become large for a complex compound structure. The purpose of the present paper is to demonstrate a method of reducing the final matrix size, so allowing solution for large structures with comparatively small computer storage requirements while retaining the accuracy given by high order displacement functions. Collocation points, a number are equilibrium conditions which must be satisfied independently of the overall compatibility of forces and deflections for a complete structure. (Auth.)

Fock-space diagonalization of the state-dependent pairing Hamiltonian with the Woods-Saxon mean field

International Nuclear Information System (INIS)

Molique, H.; Dudek, J.

1997-01-01

A particle-number conserving approach is presented to solve the nuclear mean-field plus pairing Hamiltonian problem with a realistic deformed Woods-Saxon single-particle potential. The method is designed for the state-dependent monopole pairing Hamiltonian H pair =summation αβ G αβ c α † c bar α † c bar β c β with an arbitrary set of matrix elements G αβ . Symmetries of the Hamiltonians on the many-body level are discussed using the language of P symmetry introduced earlier in the literature and are employed to diagonalize the problem; the only essential approximation used is a many-body (Fock-space) basis cutoff. An optimal basis construction is discussed and the stability of the final result with respect to the basis cutoff is illustrated in details. Extensions of the concept of P symmetry are introduced and their consequences for an optimal many-body basis cutoff construction are exploited. An algorithm is constructed allowing to solve the pairing problems in the many-body spaces corresponding to p∼40 particles on n∼80 levels and for several dozens of lowest lying states with precision ∼(1 endash 2) % within seconds of the CPU time on a CRAY computer. Among applications, the presence of the low-lying seniority s=0 solutions, that are usually poorly described in terms of the standard approximations (BCS, HFB), is discussed and demonstrated to play a role in the interpretation of the spectra of rotating nuclei. copyright 1997 The American Physical Society

A reduction method for phase equilibrium calculations with cubic equations of state

Directory of Open Access Journals (Sweden)

D. V. Nichita

2006-09-01

Full Text Available In this work we propose a new reduction method for phase equilibrium calculations using a general form of cubic equations of state (CEOS. The energy term in the CEOS is a quadratic form, which is diagonalized by applying a linear transformation. The number of the reduction parameters is related to the rank of the matrix C with elements (1-Cij, where Cij denotes the binary interaction parameters (BIPs. The dimensionality of the problem depends only on the number of reduction parameters, and is independent of the number of components in the mixture.

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems.

Science.gov (United States)

Wang, An; Cao, Yang; Shi, Quan

2018-01-01

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respectively.

A discrete ordinate response matrix method for massively parallel computers

International Nuclear Information System (INIS)

Hanebutte, U.R.; Lewis, E.E.

1991-01-01

A discrete ordinate response matrix method is formulated for the solution of neutron transport problems on massively parallel computers. The response matrix formulation eliminates iteration on the scattering source. The nodal matrices which result from the diamond-differenced equations are utilized in a factored form which minimizes memory requirements and significantly reduces the required number of algorithm utilizes massive parallelism by assigning each spatial node to a processor. The algorithm is accelerated effectively by a synthetic method in which the low-order diffusion equations are also solved by massively parallel red/black iterations. The method has been implemented on a 16k Connection Machine-2, and S 8 and S 16 solutions have been obtained for fixed-source benchmark problems in X--Y geometry

Convergence Improvement of Response Matrix Method with Large Discontinuity Factors

International Nuclear Information System (INIS)

Yamamoto, Akio

2003-01-01

In the response matrix method, a numerical divergence problem has been reported when extremely small or large discontinuity factors are utilized in the calculations. In this paper, an alternative response matrix formulation to solve the divergence problem is discussed, and properties of iteration matrixes are investigated through eigenvalue analyses. In the conventional response matrix formulation, partial currents between adjacent nodes are assumed to be discontinuous, and outgoing partial currents are converted into incoming partial currents by the discontinuity factor matrix. Namely, the partial currents of the homogeneous system (i.e., homogeneous partial currents) are treated in the conventional response matrix formulation. In this approach, the spectral radius of an iteration matrix for the partial currents may exceed unity when an extremely small or large discontinuity factor is used. Contrary to this, an alternative response matrix formulation using heterogeneous partial currents is discussed in this paper. In the latter approach, partial currents are assumed to be continuous between adjacent nodes, and discontinuity factors are directly considered in the coefficients of a response matrix. From the eigenvalue analysis of the iteration matrix for the one-group, one-dimensional problem, the spectral radius for the heterogeneous partial current formulation does not exceed unity even if an extremely small or large discontinuity factor is used in the calculation; numerical stability of the alternative formulation is superior to the conventional one. The numerical stability of the heterogeneous partial current formulation is also confirmed by the two-dimensional light water reactor core analysis. Since the heterogeneous partial current formulation does not require any approximation, the converged solution exactly reproduces the reference solution when the discontinuity factors are directly derived from the reference calculation

A matrix-inversion method for gamma-source mapping from gamma-count data - 59082

International Nuclear Information System (INIS)

Bull, Richard K.; Adsley, Ian; Burgess, Claire

2012-01-01

Gamma ray counting is often used to survey the distribution of active waste material in various locations. Ideally the output from such surveys would be a map of the activity of the waste. In this paper a simple matrix-inversion method is presented. This allows an array of gamma-count data to be converted to an array of source activities. For each survey area the response matrix is computed using the gamma-shielding code Microshield [1]. This matrix links the activity array to the count array. The activity array is then obtained via matrix inversion. The method was tested on artificially-created arrays of count-data onto which statistical noise had been added. The method was able to reproduce, quite faithfully, the original activity distribution used to generate the dataset. The method has been applied to a number of practical cases, including the distribution of activated objects in a hot cell and to activated Nimonic springs amongst fuel-element debris in vaults at a nuclear plant. (authors)

Tunneling splitting in double-proton transfer: direct diagonalization results for porphycene.

Science.gov (United States)

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.

Wavelet crosstalk matrix and its application to assessment of shift-variant imaging systems

Energy Technology Data Exchange (ETDEWEB)

Qi, Jinyi; Huesman, Ronald H.

2002-11-01

The objective assessment of image quality is essential for design of imaging systems. Barrett and Gifford [1] introduced the Fourier cross talk matrix. Because it is diagonal for continuous linear shift-invariant imaging systems, the Fourier cross talk matrix is a powerful technique for discrete imaging systems that are close to shift invariant. However, for a system that is intrinsically shift variant, Fourier techniques are not particularly effective. Because Fourier bases have no localization property, the shift-variance of the imaging system cannot be shown by the response of individual Fourier bases; rather, it is shown in the correlation between the Fourier coefficients. This makes the analysis and optimization quite difficult. In this paper, we introduce a wavelet cross talk matrix based on wavelet series expansions. The wavelet cross talk matrix allows simultaneous study of the imaging system in both the frequency and spatial domains. Hence it is well suited for shift variant systems. We compared the wavelet cross talk matrix with the Fourier cross talk matrix for several simulated imaging systems, namely the interior and exterior tomography problems, limited angle tomography, and a rectangular geometry positron emission tomograph. The results demonstrate the advantages of the wavelet cross talk matrix in analyzing shift-variant imaging systems.

Wavelet crosstalk matrix and its application to assessment of shift-variant imaging systems

International Nuclear Information System (INIS)

Qi, Jinyi; Huesman, Ronald H.

2002-01-01

The objective assessment of image quality is essential for design of imaging systems. Barrett and Gifford [1] introduced the Fourier cross talk matrix. Because it is diagonal for continuous linear shift-invariant imaging systems, the Fourier cross talk matrix is a powerful technique for discrete imaging systems that are close to shift invariant. However, for a system that is intrinsically shift variant, Fourier techniques are not particularly effective. Because Fourier bases have no localization property, the shift-variance of the imaging system cannot be shown by the response of individual Fourier bases; rather, it is shown in the correlation between the Fourier coefficients. This makes the analysis and optimization quite difficult. In this paper, we introduce a wavelet cross talk matrix based on wavelet series expansions. The wavelet cross talk matrix allows simultaneous study of the imaging system in both the frequency and spatial domains. Hence it is well suited for shift variant systems. We compared the wavelet cross talk matrix with the Fourier cross talk matrix for several simulated imaging systems, namely the interior and exterior tomography problems, limited angle tomography, and a rectangular geometry positron emission tomograph. The results demonstrate the advantages of the wavelet cross talk matrix in analyzing shift-variant imaging systems

SLAP, Large Sparse Linear System Solution Package

International Nuclear Information System (INIS)

Greenbaum, A.

1987-01-01

1 - Description of program or function: SLAP is a set of routines for solving large sparse systems of linear equations. One need not store the entire matrix - only the nonzero elements and their row and column numbers. Any nonzero structure is acceptable, so the linear system solver need not be modified when the structure of the matrix changes. Auxiliary storage space is acquired and released within the routines themselves by use of the LRLTRAN POINTER statement. 2 - Method of solution: SLAP contains one direct solver, a band matrix factorization and solution routine, BAND, and several interactive solvers. The iterative routines are as follows: JACOBI, Jacobi iteration; GS, Gauss-Seidel Iteration; ILUIR, incomplete LU decomposition with iterative refinement; DSCG and ICCG, diagonal scaling and incomplete Cholesky decomposition with conjugate gradient iteration (for symmetric positive definite matrices only); DSCGN and ILUGGN, diagonal scaling and incomplete LU decomposition with conjugate gradient interaction on the normal equations; DSBCG and ILUBCG, diagonal scaling and incomplete LU decomposition with bi-conjugate gradient iteration; and DSOMN and ILUOMN, diagonal scaling and incomplete LU decomposition with ORTHOMIN iteration

Discrete-ordinate method with matrix exponential for a pseudo-spherical atmosphere: Vector case

International Nuclear Information System (INIS)

Doicu, A.; Trautmann, T.

2009-01-01

The paper is devoted to the extension of the matrix-exponential formalism for the scalar radiative transfer to the vector case. Using basic results of the theory of matrix-exponential functions we provide a compact and versatile formulation of the vector radiative transfer. As in the scalar case, we operate with the concept of the layer equation incorporating the level values of the Stokes vector. The matrix exponentials which enter in the expression of the layer equation are computed by using the matrix eigenvalue method and the Pade approximation. A discussion of the computational efficiency of the proposed method for both an aerosol-loaded atmosphere as well as a cloudy atmosphere is also provided

Sandia Generated Matrix Tool (SGMT) v. 1.0

Energy Technology Data Exchange (ETDEWEB)

2010-03-24

Provides a tool with which create and characterize a very large set of matrix-based visual analogy problems that have properties that are similar to Raven's Progressive Matrices (RPMs)™. The software uses the same underlying patterns found in RPMs to generate large numbers of unique matrix problems using parameters chosen by the researcher. Specifically, the software is designed so that researchers can choose the type, direction, and number of relations in a problem and then create any number of unique matrices that share the same underlying structure (e.g. changes in numerosity in a diagonal pattern) but have different surface features (e.g. shapes, colors).Raven's Progressive Matrices (RPMs) ™ are a widely-used test for assessing intelligence and reasoning ability. Since the test is non-verbal, it can be applied to many different populations and has been used all over the world. However, there are relatively few matrices in the sets developed by Raven, which limits their use in experiments requiring large numbers of stimuli. This tool creates a matrix set in a systematic way that allows researchers to have a great deal of control over the underlying structure, surface features, and difficulty of the matrix problems while providing a large set of novel matrices with which to conduct experiments.

Mass matrices of weak interaction, quark flavour mixing and exponential form of Cabibbo-Kobayashi-Maskawa matrix

International Nuclear Information System (INIS)

Dattoli, G.; Torre, A.

1995-01-01

The quark mixing matrix is diagonalized. The use of the exponential parametrization leads to straightforward results, obtained in exact form, without simplifying assumptions. In this study, it is defined weak interaction eigenstates in the sense of Fritzch and Planckl. The relevant mass matrices are derived and are shown to belong to Barnhill canonical forms. It is proven that, at lowest order, these matrices exhibit a democratic structure. The mechanism of democracy breaking is finally discussed

Proper comparison among methods using a confusion matrix

CSIR Research Space (South Africa)

Salmon

2015-07-01

Full Text Available -1 IGARSS 2015, Milan, Italy, 26-31 July 2015 Proper comparison among methods using a confusion matrix 1,2 B.P. Salmon, 2,3 W. Kleynhans, 2,3 C.P. Schwegmann and 1J.C. Olivier 1School of Engineering and ICT, University of Tasmania, Australia 2...

A nonlinearity compensation method for a matrix converter drive

DEFF Research Database (Denmark)

Lee, Kyo-Beum; Blaabjerg, Frede

2005-01-01

converter model using the direction of current. The proposed method does not need any additional hardware or complicated software and it is easy to realize by applying the algorithm to the conventional vector control. The proposed compensation method is applied for high-performance induction motor drives...... using a 3-kW matrix converter system without a speed sensor. Experimental results show the proposed method provides good compensating characteristics....

Iterating the Number of Intersection Points of the Diagonals of Irregular Convex Polygons, or C (n, 4) the Hard Way!

Science.gov (United States)

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…

A Predictive-Control-Based Over-Modulation Method for Conventional Matrix Converters

DEFF Research Database (Denmark)

Zhang, Guanguan; Yang, Jian; Sun, Yao

2018-01-01

To increase the voltage transfer ratio of the matrix converter and improve the input/output current performance simultaneously, an over-modulation method based on predictive control is proposed in this paper, where the weighting factor is selected by an automatic adjusting mechanism, which is able...... to further enhance the system performance promptly. This method has advantages like the maximum voltage transfer ratio can reach 0.987 in the experiments; the total harmonic distortion of the input and output current are reduced, and the losses in the matrix converter are decreased. Moreover, the specific...

The Visual Matrix Method: Imagery and Affect in a Group-Based Research Setting

Directory of Open Access Journals (Sweden)

Lynn Froggett

2015-07-01

Full Text Available The visual matrix is a method for researching shared experience, stimulated by sensory material relevant to a research question. It is led by imagery, visualization and affect, which in the matrix take precedence over discourse. The method enables the symbolization of imaginative and emotional material, which might not otherwise be articulated and allows "unthought" dimensions of experience to emerge into consciousness in a participatory setting. We describe the process of the matrix with reference to the study "Public Art and Civic Engagement" (FROGGETT, MANLEY, ROY, PRIOR & DOHERTY, 2014 in which it was developed and tested. Subsequently, examples of its use in other contexts are provided. Both the matrix and post-matrix discussions are described, as is the interpretive process that follows. Theoretical sources are highlighted: its origins in social dreaming; the atemporal, associative nature of the thinking during and after the matrix which we describe through the Deleuzian idea of the rhizome; and the hermeneutic analysis which draws from object relations theory and the Lorenzerian tradition of scenic understanding. The matrix has been conceptualized as a "scenic rhizome" to account for its distinctive quality and hybrid origins in research practice. The scenic rhizome operates as a "third" between participants and the "objects" of contemplation. We suggest that some of the drawbacks of other group-based methods are avoided in the visual matrix—namely the tendency for inter-personal dynamics to dominate the event. URN: http://nbn-resolving.de/urn:nbn:de:0114-fqs150369

Preconditioning for Mixed Finite Element Formulations of Elliptic Problems

KAUST Repository

Wildey, Tim; Xue, Guangri

2013-01-01

In this paper, we discuss a preconditioning technique for mixed finite element discretizations of elliptic equations. The technique is based on a block-diagonal approximation of the mass matrix which maintains the sparsity and positive definiteness of the corresponding Schur complement. This preconditioner arises from the multipoint flux mixed finite element method and is robust with respect to mesh size and is better conditioned for full permeability tensors than a preconditioner based on a diagonal approximation of the mass matrix. © Springer-Verlag Berlin Heidelberg 2013.

Analytical techniques for instrument design - Matrix methods

International Nuclear Information System (INIS)

Robinson, R.A.

1997-01-01

The authors take the traditional Cooper-Nathans approach, as has been applied for many years for steady-state triple-axis spectrometers, and consider its generalization to other inelastic scattering spectrometers. This involves a number of simple manipulations of exponentials of quadratic forms. In particular, they discuss a toolbox of matrix manipulations that can be performed on the 6-dimensional Cooper-Nathans matrix. They show how these tools can be combined to solve a number of important problems, within the narrow-band limit and the gaussian approximation. They will argue that a generalized program that can handle multiple different spectrometers could (and should) be written in parallel to the Monte-Carlo packages that are becoming available. They also discuss the complementarity between detailed Monte-Carlo calculations and the approach presented here. In particular, Monte-Carlo methods traditionally simulate the real experiment as performed in practice, given a model scattering law, while the Cooper-Nathans method asks the inverse question: given that a neutron turns up in a particular spectrometer configuration (e.g. angle and time of flight), what is the probability distribution of possible scattering events at the sample? The Monte-Carlo approach could be applied in the same spirit to this question

A matrix formalism to solve interface condition equations in a reactor system

Energy Technology Data Exchange (ETDEWEB)

Matausek, M V [Boris Kidric Institute of Nuclear Sciences Vinca, Beograd (Yugoslavia)

1970-05-15

When a nuclear reactor or a reactor lattice cell is treated by an approximate procedure to solve the neutron transport equation, as the last computational step often appears a problem of solving systems of algebraic equations stating the interface and boundary conditions for the neutron flux moments. These systems have usually the coefficient matrices of the block-bi diagonal type, containing thus a large number of zero elements. In the present report it is shown how such a system can be solved efficiently accounting for all the zero elements both in the coefficient matrix and in the free term vector. The procedure is presented here for the case of multigroup P{sub 3} calculation of neutron flux distribution in a cylindrical reactor lattice cell. Compared with the standard gaussian elimination method, this procedure is more advantageous both in respect to the number of operations needed to solve a given problem and in respect to the computer memory storage requirements. A similar formalism can also be applied for other approximate methods, for instance for multigroup diffusion treatment of a multi zone reactor. (author)

The determination of the Dirac density matrix of the d-dimensional harmonic oscillator for an arbitrary number of closed shells

International Nuclear Information System (INIS)

Howard, I.A.; March, N.H.; Nieto, L.M.

2002-01-01

In 1959, March and Young (Nucl. Phys. 12 237) rewrote the equation of motion for the Dirac density matrix γ(x, x 0 ) in terms of sum and difference variables. Here, γ(r-bar, r-bar 0 ) for the d-dimensional isotropic harmonic oscillator for an arbitrary number of closed shells is shown to satisfy, using the variables vertical bar r-bar + r-bar 0 vertical bar/2 and vertical bar r-bar - r-bar 0 vertical bar/2, a generalized partial differential equation embracing the March-Young equation for d=1. As applications, we take in turn the cases d=1, 2, 3 and 4, and obtain both the density matrix γ (r-bar, r-bar 0 ) and the diagonal density ρ(r)=γ(r-bar, r-bar 0 ) vertical bar r-bar 0 =r-bar, this diagonal element already being known to satisfy a third-order linear homogeneous differential equation for d=1 through 3. Some comments are finally made on the d-dimensional kinetic energy density, which is important for first-principles density functional theory in allowing one to bypass one-particle Schroedinger equations (the so-called Slater-Kohn-Sham equations). (author)

On Richardson extrapolation for low-dissipation low-dispersion diagonally implicit Runge-Kutta schemes

Science.gov (United States)

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.

Neutrino mass matrices with two vanishing cofactors and Fritzsch texture for charged lepton mass matrix

Science.gov (United States)

Wang, Weijian; Guo, Shu-Yuan; Wang, Zhi-Gang

2016-04-01

In this paper, we study the cofactor 2 zero neutrino mass matrices with the Fritzsch-type structure in charged lepton mass matrix (CLMM). In the numerical analysis, we perform a scan over the parameter space of all the 15 possible patterns to get a large sample of viable scattering points. Among the 15 possible patterns, three of them can accommodate the latest lepton mixing and neutrino mass data. We compare the predictions of the allowed patterns with their counterparts with diagonal CLMM. In this case, the severe cosmology bound on the neutrino mass set a strong constraint on the parameter space, rendering two patterns only marginally allowed. The Fritzsch-type CLMM will have impact on the viable parameter space and give rise to different phenomenological predictions. Each allowed pattern predicts the strong correlations between physical variables, which is essential for model selection and can be probed in future experiments. It is found that under the no-diagonal CLMM, the cofactor zeros structure in neutrino mass matrix is unstable as the running of renormalization group (RG) from seesaw scale to the electroweak scale. A way out of the problem is to propose the flavor symmetry under the models with a TeV seesaw scale. The inverse seesaw model and a loop-induced model are given as two examples.

Comparison of Experimental Methods for Estimating Matrix Diffusion Coefficients for Contaminant Transport Modeling

Energy Technology Data Exchange (ETDEWEB)

Telfeyan, Katherine Christina [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ware, Stuart Douglas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Reimus, Paul William [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Birdsell, Kay Hanson [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-11-06

Diffusion cell and diffusion wafer experiments were conducted to compare methods for estimating matrix diffusion coefficients in rock core samples from Pahute Mesa at the Nevada Nuclear Security Site (NNSS). A diffusion wafer method, in which a solute diffuses out of a rock matrix that is pre-saturated with water containing the solute, is presented as a simpler alternative to the traditional through-diffusion (diffusion cell) method. Both methods yielded estimates of matrix diffusion coefficients that were within the range of values previously reported for NNSS volcanic rocks. The difference between the estimates of the two methods ranged from 14 to 30%, and there was no systematic high or low bias of one method relative to the other. From a transport modeling perspective, these differences are relatively minor when one considers that other variables (e.g., fracture apertures, fracture spacings) influence matrix diffusion to a greater degree and tend to have greater uncertainty than diffusion coefficients. For the same relative random errors in concentration measurements, the diffusion cell method yields diffusion coefficient estimates that have less uncertainty than the wafer method. However, the wafer method is easier and less costly to implement and yields estimates more quickly, thus allowing a greater number of samples to be analyzed for the same cost and time. Given the relatively good agreement between the methods, and the lack of any apparent bias between the methods, the diffusion wafer method appears to offer advantages over the diffusion cell method if better statistical representation of a given set of rock samples is desired.

Diagonal Eigenvalue Unity (DEU) code for spectral amplitude coding-optical code division multiple access

Science.gov (United States)

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.

Novel image analysis methods for quantification of in situ 3-D tendon cell and matrix strain.

Science.gov (United States)

Fung, Ashley K; Paredes, J J; Andarawis-Puri, Nelly

2018-01-23

Macroscopic tendon loads modulate the cellular microenvironment leading to biological outcomes such as degeneration or repair. Previous studies have shown that damage accumulation and the phases of tendon healing are marked by significant changes in the extracellular matrix, but it remains unknown how mechanical forces of the extracellular matrix are translated to mechanotransduction pathways that ultimately drive the biological response. Our overarching hypothesis is that the unique relationship between extracellular matrix strain and cell deformation will dictate biological outcomes, prompting the need for quantitative methods to characterize the local strain environment. While 2-D methods have successfully calculated matrix strain and cell deformation, 3-D methods are necessary to capture the increased complexity that can arise due to high levels of anisotropy and out-of-plane motion, particularly in the disorganized, highly cellular, injured state. In this study, we validated the use of digital volume correlation methods to quantify 3-D matrix strain using images of naïve tendon cells, the collagen fiber matrix, and injured tendon cells. Additionally, naïve tendon cell images were used to develop novel methods for 3-D cell deformation and 3-D cell-matrix strain, which is defined as a quantitative measure of the relationship between matrix strain and cell deformation. The results support that these methods can be used to detect strains with high accuracy and can be further extended to an in vivo setting for observing temporal changes in cell and matrix mechanics during degeneration and healing. Copyright © 2017. Published by Elsevier Ltd.

Another method for a global fit of the Cabibbo-Kobayashi-Maskawa matrix

International Nuclear Information System (INIS)

Dita, Petre

2005-01-01

Recently we proposed a novel method for doing global fits on the entries of the Cabibbo-Kobayashi-Maskawa matrix. The new used ingredients were a clear relationship between the entries of the CKM matrix and the experimental data, as well as the use of the necessary and sufficient condition the data have to satisfy in order to find a unitary matrix compatible with them. This condition writes as -1 ≤ cosδ ≤1 where δ is the phase that accounts for CP violation. Numerical results are provided for the CKM matrix entries, the mixing angles between generations and all the angles of the standard unitarity triangle. (author)

Functional methods for the solution of one-dimensional quantum systems

International Nuclear Information System (INIS)

Wirth, Tobias

2010-01-01

Subject of this work are integrable spin chains with general boundary conditions. In the framework of the Quantum Inverse Scattering Method Sklyanin has shown how to construct a family of commuting operators (transfer matrix) containing the hamiltonian of the XXX or XXZ spin chain with general boundary fields. Key ingredient is the underlying algebraic structure which is a combination of the Yang-Baxter algebra, using the known R-matrix representations, and a so-called Reflection algebra. The latter includes fields of arbitrary strength and direction acting on the first and last position of the chain. This setup is solvable via algebraic Bethe ansatz in the case of diagonal boundaries, i.e. the fields are parallel to each other and in the case of the XXZ model parallel to the distinguished direction. Kitanine et. al. have managed to express local operators in terms of the non-local elements of the underlying algebraic structure in the case of half-infinite chain length hence establishing a possible approach to evaluate expectation values of physical observables. Their results are picked up in this work and generalized to spin chains of arbitrary (including finite) lengths using non-linear integral equations for the lowest lying state with zero magnetization. In the case of non-diagonal boundary fields the lack of a reference state or pseudo vacuum prohibits the solution by algebraic Bethe ansatz. The method of separation of variables proposed by Sklyanin is not constrained in that sense and will be applied to this situation. In this approach for the XXX spin chain no restrictions to the boundary parameters are needed. The result is a TQ-equation on finite discrete set of points and the eigenvalues of the transfer matrix are obtainable from this finite difference equation. As the underlying algebraic structure is independent of the representation, the analysis for the XXX spin chain can be extended to a spin-boson model. Using a known representation of the algebra

The Dirac operator on a finite domain and the R-matrix method

International Nuclear Information System (INIS)

Grant, I P

2008-01-01

Relativistic effects in electron-atom collisions and photo-excitation and -ionization processes increase in importance as the atomic number of the target atom grows and spin-dependent effects increase. A relativistic treatment in which electron motion is described using the Dirac Hamiltonian is then desirable. A version of the popular nonrelativistic R-matrix package incorporating terms from the Breit-Pauli Hamiltonian has been used for modelling such processes for some years. The fully relativistic Dirac R-matrix method has been less popular, but is becoming increasingly relevant for applications to heavy ion targets, where the need to use relativistic wavefunctions is more obvious. The Dirac R-matrix method has been controversial ever since it was first proposed by Goertzel (1948 Phys. Rev. 73 1463-6), and it is therefore important to confirm that recent elaborate and costly applications of the method, such as, Badnell et al (2004 J. Phys. B: At. Mol. Phys. 37 4589) and Ballance and Griffin (2007 J. Phys. B: At. Mol. Opt. Phys. 40 247-58), rest on secure foundations. The first part of this paper analyses the structure of the two-point boundary-value problem for the Dirac operator on a finite domain, from which we construct a unified derivation of the Schroedinger (nonrelativistic) and Dirac (relativistic) R-matrix methods. Suggestions that the usual relativistic theory is not well founded are shown to be without foundation

A transfer-matrix method for spatially modulated structures

International Nuclear Information System (INIS)

Surda, A.

1991-03-01

A cluster transfer-matrix method convenient for calculation of spatially modulated structures of a wide class of lattice-gas models is developed. The method formulates the problem of calculation of the partition function in terms of non-linear mapping of effective multi-site fields. It is applied to a lattice-gas model qualitatively describing the system of oxygen atoms in the basal planes of high-temperature superconductors. The properties of an incommensurate structure occurring at intermediate temperatures are discussed in detail. (author). 21 refs, 15 figs

Optimization of MIMO Systems Capacity Using Large Random Matrix Methods

Directory of Open Access Journals (Sweden)

Philippe Loubaton

2012-11-01

Full Text Available This paper provides a comprehensive introduction of large random matrix methods for input covariance matrix optimization of mutual information of MIMO systems. It is first recalled informally how large system approximations of mutual information can be derived. Then, the optimization of the approximations is discussed, and important methodological points that are not necessarily covered by the existing literature are addressed, including the strict concavity of the approximation, the structure of the argument of its maximum, the accuracy of the large system approach with regard to the number of antennas, or the justification of iterative water-filling optimization algorithms. While the existing papers have developed methods adapted to a specific model, this contribution tries to provide a unified view of the large system approximation approach.

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...

Symmetrized density matrix renormalization group algorithm for low-lying excited states of conjugated carbon systems: Application to 1,12-benzoperylene and polychrysene

Science.gov (United States)

Prodhan, Suryoday; Ramasesha, S.

2018-05-01

The symmetry adapted density matrix renormalization group (SDMRG) technique has been an efficient method for studying low-lying eigenstates in one- and quasi-one-dimensional electronic systems. However, the SDMRG method had bottlenecks involving the construction of linearly independent symmetry adapted basis states as the symmetry matrices in the DMRG basis were not sparse. We have developed a modified algorithm to overcome this bottleneck. The new method incorporates end-to-end interchange symmetry (C2) , electron-hole symmetry (J ) , and parity or spin-flip symmetry (P ) in these calculations. The one-to-one correspondence between direct-product basis states in the DMRG Hilbert space for these symmetry operations renders the symmetry matrices in the new basis with maximum sparseness, just one nonzero matrix element per row. Using methods similar to those employed in the exact diagonalization technique for Pariser-Parr-Pople (PPP) models, developed in the 1980s, it is possible to construct orthogonal SDMRG basis states while bypassing the slow step of the Gram-Schmidt orthonormalization procedure. The method together with the PPP model which incorporates long-range electronic correlations is employed to study the correlated excited-state spectra of 1,12-benzoperylene and a narrow mixed graphene nanoribbon with a chrysene molecule as the building unit, comprising both zigzag and cove-edge structures.

Relativistic density matrix in the diagonal momentum representation. Fermi-gas

International Nuclear Information System (INIS)

Makhlin, A.N.; Sinyukov, Yu.M.

1984-01-01

The relativistically invariant theory of ideal Fermi-gas is built in the framework of the quantum field theory. The average occupation numbers and correlation functions of statistical systems are found on the equal-time surfaces of arbitrary inertial frames. The effects of anisotropy in their behaviour are pointed out. The partition function method is developed to calculate the thermodynamic quantities of Fermi-gases moving as a whole

Unified calculations of the optical band positions and EPR g factors for NaCrS2 crystal

International Nuclear Information System (INIS)

Mei, Yang; Zheng, Wen-Chen; Zhang, Lin

2014-01-01

Six optical band positions and EPR g factors g || , g ⊥ for the trigonal Cr 3+ octahedral clusters in NaCrS 2 crystal are calculated together through the complete diagonalization (of energy matrix) method based on the two-spin–orbit-parameter model, where besides the contribution due to the spin–orbit parameter of central d n ion in the conventional crystal-field theory, the contribution due to the spin–orbit parameter of ligand ion via the covalence effect is also considered. In the calculations, the crystal-field parameters B kl are obtained from the superposition model with the structural data of Cr 3+ octahedral clusters in NaCrS 2 crystal measured exactly by the X-ray diffraction method. The calculated optical and EPR spectral data are in a reasonable agreement with the observed values. So, the reliability of the superposition model in the studies of crystal-field parameters for d n ions in crystals is confirmed, and the complete diagonalization (of energy matrix) method based on the two-spin–orbit-model is effective in the unified calculations of optical and EPR spectral data for d n ions in crystals. - Highlights: • Six optical band positions and g factors g || , g ⊥ of NaCrS 2 are calculated together. • Calculation is using the complete diagonalization (of energy matrix) method. • The diagonalization method is based on the two-spin–orbit-parameter model. • Reliability of superposition model in the studies of CF parameters is confirmed

Large-scale exact diagonalizations reveal low-momentum scales of nuclei

Science.gov (United States)

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.

A square-plate piezoelectric linear motor operating in two orthogonal and isomorphic face-diagonal-bending modes.

Science.gov (United States)

Ci, Penghong; Chen, Zhijiang; Liu, Guoxi; Dong, Shuxiang

2014-01-01

We report a piezoelectric linear motor made of a single Pb(Zr,Ti)O3 square-plate, which operates in two orthogonal and isomorphic face-diagonal-bending modes to produce precision linear motion. A 15 × 15 × 2 mm prototype was fabricated, and the motor generated a driving force of up to 1.8 N and a speed of 170 mm/s under an applied voltage of 100 Vpp at the resonance frequency of 136.5 kHz. The motor shows such advantages as large driving force under relatively low driving voltage, simple structure, and stable motion because of its isomorphic face-diagonal-bending mode.

Solution of the Multigroup-Diffusion equation by the response matrix method

International Nuclear Information System (INIS)

Oliveira, C.R.E.

1980-10-01

A preliminary analysis of the response matrix method is made, considering its application to the solution of the multigroup diffusion equations. The one-dimensional formulation is presented and used to test some flux expansions, seeking the application of the method to the two-dimensional problem. This formulation also solves the equations that arise from the integro-differential synthesis algorithm. The slow convergence of the power method, used to solve the eigenvalue problem, and its acceleration by means of the Chebyshev polynomial method, are also studied. An algorithm for the estimation of the dominance ratio is presented, based on the residues of two successive iteration vectors. This ratio, which is not known a priori, is fundamental for the efficiency of the method. Some numerical problems are solved, testing the 1D formulation of the response matrix method, its application to the synthesis algorithm and also, at the same time, the algorithm to accelerate the source problem. (Author) [pt

A pedagogical derivation of the matrix element method in particle physics data analysis

Science.gov (United States)

Sumowidagdo, Suharyo

2018-03-01

The matrix element method provides a direct connection between the underlying theory of particle physics processes and detector-level physical observables. I am presenting a pedagogically-oriented derivation of the matrix element method, drawing from elementary concepts in probability theory, statistics, and the process of experimental measurements. The level of treatment should be suitable for beginning research student in phenomenology and experimental high energy physics.

A New Normal Form for Multidimensional Mode Conversion

International Nuclear Information System (INIS)

Tracy, E. R.; Richardson, A. S.; Kaufman, A. N.; Zobin, N.

2007-01-01

Linear conversion occurs when two wave types, with distinct polarization and dispersion characteristics, are locally resonant in a nonuniform plasma [1]. In recent work, we have shown how to incorporate a ray-based (WKB) approach to mode conversion in numerical algorithms [2,3]. The method uses the ray geometry in the conversion region to guide the reduction of the full NxN-system of wave equations to a 2x2 coupled pair which can be solved and matched to the incoming and outgoing WKB solutions. The algorithm in [2] assumes the ray geometry is hyperbolic and that, in ray phase space, there is an 'avoided crossing', which is the most common type of conversion. Here, we present a new formulation that can deal with more general types of conversion [4]. This formalism is based upon the fact (first proved in [5]) that it is always possible to put the 2x2 wave equation into a 'normal' form, such that the diagonal elements of the dispersion matrix Poisson-commute with the off-diagonals (at leading order). Therefore, if we use the diagonals (rather than the eigenvalues or the determinant) of the dispersion matrix as ray Hamiltonians, the off-diagonals will be conserved quantities. When cast into normal form, the 2x2 dispersion matrix has a very natural physical interpretation: the diagonals are the uncoupled ray hamiltonians and the off-diagonals are the coupling. We discuss how to incorporate the normal form into ray tracing algorithms

Discrete-ordinate method with matrix exponential for a pseudo-spherical atmosphere: Scalar case

International Nuclear Information System (INIS)

Doicu, A.; Trautmann, T.

2009-01-01

We present a discrete-ordinate algorithm using the matrix-exponential solution for pseudo-spherical radiative transfer. Following the finite-element technique we introduce the concept of layer equation and formulate the discrete radiative transfer problem in terms of the level values of the radiance. The layer quantities are expressed by means of matrix exponentials, which are computed by using the matrix eigenvalue method and the Pade approximation. These solution methods lead to a compact and versatile formulation of the radiative transfer. Simulated nadir and limb radiances for an aerosol-loaded atmosphere and a cloudy atmosphere are presented along with a discussion of the model intercomparisons and timings

Impact of off-diagonal cross-shell interaction on 14C

Science.gov (United States)

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)

Modelling of packet traffic with matrix analytic methods

DEFF Research Database (Denmark)

Andersen, Allan T.

1995-01-01

BISDN network. The heuristic formula did not seem to yield substantially better results than already available approximations. Finally, some results for the finite capacity BMAP/G/1 queue have been obtained. The steady state probability vector of the embedded chain is found by a direct method where...... process. A heuristic formula for the tail behaviour of a single server queue fed by a superposition of renewal processes has been evaluated. The evaluation was performed by applying Matrix Analytic methods. The heuristic formula has applications in the Call Admission Control (CAC) procedure of the future...

Graphene-Reinforced Aluminum Matrix Composites: A Review of Synthesis Methods and Properties

Science.gov (United States)

Chen, Fei; Gupta, Nikhil; Behera, Rakesh K.; Rohatgi, Pradeep K.

2018-03-01

Graphene-reinforced aluminum (Gr-Al) matrix nanocomposites (NCs) have attracted strong interest from both research and industry in high-performance weight-sensitive applications. Due to the vastly different bonding characteristics of the Al matrix (metallic) and graphene (in-plane covalent + inter-plane van der Waals), the graphene phase has a general tendency to agglomerate and phase separate in the metal matrix, which is detrimental for the mechanical and chemical properties of the composite. Thus, synthesis of Gr-Al NCs is extremely challenging. This review summarizes the different methods available to synthesize Gr-Al NCs and the resulting properties achieved in these NCs. Understanding the effect of processing parameters on the realized properties opens up the possibility of tailoring the synthesis methods to achieve the desired properties for a given application.

Graphene-Reinforced Aluminum Matrix Composites: A Review of Synthesis Methods and Properties

Science.gov (United States)

Chen, Fei; Gupta, Nikhil; Behera, Rakesh K.; Rohatgi, Pradeep K.

2018-06-01

Graphene-reinforced aluminum (Gr-Al) matrix nanocomposites (NCs) have attracted strong interest from both research and industry in high-performance weight-sensitive applications. Due to the vastly different bonding characteristics of the Al matrix (metallic) and graphene (in-plane covalent + inter-plane van der Waals), the graphene phase has a general tendency to agglomerate and phase separate in the metal matrix, which is detrimental for the mechanical and chemical properties of the composite. Thus, synthesis of Gr-Al NCs is extremely challenging. This review summarizes the different methods available to synthesize Gr-Al NCs and the resulting properties achieved in these NCs. Understanding the effect of processing parameters on the realized properties opens up the possibility of tailoring the synthesis methods to achieve the desired properties for a given application.

Energy-dependent applications of the transfer matrix method

International Nuclear Information System (INIS)

Oeztunali, O.I.; Aronson, R.

1975-01-01

The transfer matrix method is applied to energy-dependent neutron transport problems for multiplying and nonmultiplying media in one-dimensional plane geometry. Experimental cross sections are used for total, elastic, and inelastic scattering and fission. Numerical solutions are presented for the problem of a unit point isotropic source in an infinite medium of water and for the problem of the critical 235 U slab with finite water reflectors. No iterations were necessary in this method. Numerical results obtained are consistent with physical considerations and compare favorably with the moments method results for the problem of the unit point isotropic source in an infinite water medium. (U.S.)

Comparative Study of Inference Methods for Bayesian Nonnegative Matrix Factorisation

DEFF Research Database (Denmark)

Brouwer, Thomas; Frellsen, Jes; Liò, Pietro

2017-01-01

In this paper, we study the trade-offs of different inference approaches for Bayesian matrix factorisation methods, which are commonly used for predicting missing values, and for finding patterns in the data. In particular, we consider Bayesian nonnegative variants of matrix factorisation and tri......-factorisation, and compare non-probabilistic inference, Gibbs sampling, variational Bayesian inference, and a maximum-a-posteriori approach. The variational approach is new for the Bayesian nonnegative models. We compare their convergence, and robustness to noise and sparsity of the data, on both synthetic and real...

Multiple resonance compensation for betatron coupling and its equivalence with matrix method

CERN Document Server

De Ninno, G

1999-01-01

Analyses of betatron coupling can be broadly divided into two categories: the matrix approach that decouples the single-turn matrix to reveal the normal modes and the hamiltonian approach that evaluates the coupling in terms of the action of resonances in perturbation theory. The latter is often regarded as being less exact but good for physical insight. The common opinion is that the correction of the two closest sum and difference resonances to the working point is sufficient to reduce the off-axis terms in the 4X4 single-turn matrix, but this is only partially true. The reason for this is explained, and a method is developed that sums to infinity all coupling resonances and, in this way, obtains results equivalent to the matrix approach. The two approaches is discussed with reference to the dynamic aperture. Finally, the extension of the summation method to resonances of all orders is outlined and the relative importance of a single resonance compared to all resonances of a given order is analytically desc...

Diagonalization and Many-Body Localization for a Disordered Quantum Spin Chain

OpenAIRE

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.

Solution of the Schroedinger equation by a spectral method

International Nuclear Information System (INIS)

Feit, M.D.; Fleck, J.A. Jr.; Steiger, A.

1982-01-01

A new computational method for determining the eigenvalues and eigenfunctions of the Schroedinger equation is described. Conventional methods for solving this problem rely on diagonalization of a Hamiltonian matrix or iterative numerical solutions of a time independent wave equation. The new method, in contrast, is based on the spectral properties of solutions to the time-dependent Schroedinger equation. The method requires the computation of a correlation function from a numerical solution psi(r, t). Fourier analysis of this correlation function reveals a set of resonant peaks that correspond to the stationary states of the system. Analysis of the location of these peaks reveals the eigenvalues with high accuracy. Additional Fourier transforms of psi(r, t) with respect to time generate the eigenfunctions. The effectiveness of the method is demonstrated for a one-dimensional asymmetric double well potential and for the two-dimensional Henon--Heiles potential

A Literature Study of Matrix Element Influenced to the Result of Analysis Using Absorption Atomic Spectroscopy Method (AAS)

International Nuclear Information System (INIS)

Tyas-Djuhariningrum

2004-01-01

The gold sample analysis can be deviated more than >10% to those thrue value caused by the matrix element. So that the matrix element character need to be study in order to reduce the deviation. In rock samples, the matrix elements can cause self quenching, self absorption and ionization process, so there is a result analysis error. In the rock geochemical process, the elements of the same group at the periodic system have the tendency to be together because of their same characteristic. In absorption Atomic Spectroscopy analysis, the elements associate can absorb primer energy with similar wave length so that it can cause deviation in the result interpretation. The aim of study is to predict matrix element influences from rock sample with application standard method for reducing deviation. In quantitative way, assessment of primer light intensity that will be absorbed is proportional to the concentration atom in the sample that relationship between photon intensity with concentration in part per million is linier (ppm). These methods for eliminating matrix elements influence consist of three methods : external standard method, internal standard method, and addition standard method. External standard method for all matrix element, internal standard method for elimination matrix element that have similar characteristics, addition standard methods for elimination matrix elements in Au, Pt samples. The third of standard posess here accuracy are about 95-97%. (author)

A method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix

International Nuclear Information System (INIS)

Godfrin, Elena

1990-01-01

This paper presents a method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix using adequate partitions of the complete matrix. This type of matrix is very usual in quantum mechanics and, more specifically, in solid state physics (e.g., interfaces and superlattices), when the tight-binding approximation is used. The efficiency of the method is analyzed comparing the required CPU time and work-area for different usual techniques. (Author)

Effective electrical and thermal conductivity of multifilament twisted superconductors

International Nuclear Information System (INIS)

Chechetkin, V.R.

2013-01-01

The effective electrical and thermal conductivity of composite wire with twisted superconducting filaments embedded into normal metal matrix is calculated using the extension of Bruggeman method. The resistive conductivity of superconducting filaments is described in terms of symmetric tensor, whereas the conductivity of a matrix is assumed to be isotropic and homogeneous. The dependence of the resistive electrical conductivity of superconducting filaments on temperature, magnetic field, and current density is implied to be parametric. The resulting effective conductivity tensor proved to be non-diagonal and symmetric. The non-diagonal transverse–longitudinal components of effective electrical conductivity tensor are responsible for the redistribution of current between filaments. In the limits of high and low electrical conductivity of filaments the transverse effective conductivity tends to that of obtained previously by Carr. The effective thermal conductivity of composite wires is non-diagonal and radius-dependent even for the isotropic and homogeneous thermal conductivities of matrix and filaments.

Reactor calculation in coarse mesh by finite element method applied to matrix response method

International Nuclear Information System (INIS)

Nakata, H.

1982-01-01

The finite element method is applied to the solution of the modified formulation of the matrix-response method aiming to do reactor calculations in coarse mesh. Good results are obtained with a short running time. The method is applicable to problems where the heterogeneity is predominant and to problems of evolution in coarse meshes where the burnup is variable in one same coarse mesh, making the cross section vary spatially with the evolution. (E.G.) [pt

A Comparison between the Decimated Padé Approximant and Decimated Signal Diagonalization Methods for Leak Detection in Pipelines Equipped with Pressure Sensors.

Science.gov (United States)

Lay-Ekuakille, Aimé; Fabbiano, Laura; Vacca, Gaetano; Kitoko, Joël Kidiamboko; Kulapa, Patrice Bibala; Telesca, Vito

2018-06-04

Pipelines conveying fluids are considered strategic infrastructures to be protected and maintained. They generally serve for transportation of important fluids such as drinkable water, waste water, oil, gas, chemicals, etc. Monitoring and continuous testing, especially on-line, are necessary to assess the condition of pipelines. The paper presents findings related to a comparison between two spectral response algorithms based on the decimated signal diagonalization (DSD) and decimated Padé approximant (DPA) techniques that allow to one to process signals delivered by pressure sensors mounted on an experimental pipeline.

A Comparison between the Decimated Padé Approximant and Decimated Signal Diagonalization Methods for Leak Detection in Pipelines Equipped with Pressure Sensors

Directory of Open Access Journals (Sweden)

Aimé Lay-Ekuakille

2018-06-01

Full Text Available Pipelines conveying fluids are considered strategic infrastructures to be protected and maintained. They generally serve for transportation of important fluids such as drinkable water, waste water, oil, gas, chemicals, etc. Monitoring and continuous testing, especially on-line, are necessary to assess the condition of pipelines. The paper presents findings related to a comparison between two spectral response algorithms based on the decimated signal diagonalization (DSD and decimated Padé approximant (DPA techniques that allow to one to process signals delivered by pressure sensors mounted on an experimental pipeline.

Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations

NARCIS (Netherlands)

Jarlebring, E.; Hochstenbach, M.E.

2009-01-01

Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some similarities between the different types of these so-called

Agar/gelatin bilayer gel matrix fabricated by simple thermo-responsive sol-gel transition method.

Science.gov (United States)

Wang, Yifeng; Dong, Meng; Guo, Mengmeng; Wang, Xia; Zhou, Jing; Lei, Jian; Guo, Chuanhang; Qin, Chaoran

2017-08-01

We present a simple and environmentally-friendly method to generate an agar/gelatin bilayer gel matrix for further biomedical applications. In this method, the thermally responsive sol-gel transitions of agar and gelatin combined with the different transition temperatures are exquisitely employed to fabricate the agar/gelatin bilayer gel matrix and achieve separate loading for various materials (e.g., drugs, fluorescent materials, and nanoparticles). Importantly, the resulting bilayer gel matrix provides two different biopolymer environments (a polysaccharide environment vs a protein environment) with a well-defined border, which allows the loaded materials in different layers to retain their original properties (e.g., magnetism and fluorescence) and reduce mutual interference. In addition, the loaded materials in the bilayer gel matrix exhibit an interesting release behavior under the control of thermal stimuli. Consequently, the resulting agar/gelatin bilayer gel matrix is a promising candidate for biomedical applications in drug delivery, controlled release, fluorescence labeling, and bio-imaging. Copyright © 2017 Elsevier B.V. All rights reserved.

A Normalized Transfer Matrix Method for the Free Vibration of Stepped Beams: Comparison with Experimental and FE(3D Methods

Directory of Open Access Journals (Sweden)

Tamer Ahmed El-Sayed

2017-01-01

Full Text Available The exact solution for multistepped Timoshenko beam is derived using a set of fundamental solutions. This set of solutions is derived to normalize the solution at the origin of the coordinates. The start, end, and intermediate boundary conditions involve concentrated masses and linear and rotational elastic supports. The beam start, end, and intermediate equations are assembled using the present normalized transfer matrix (NTM. The advantage of this method is that it is quicker than the standard method because the size of the complete system coefficient matrix is 4 × 4. In addition, during the assembly of this matrix, there are no inverse matrix steps required. The validity of this method is tested by comparing the results of the current method with the literature. Then the validity of the exact stepped analysis is checked using experimental and FE(3D methods. The experimental results for stepped beams with single step and two steps, for sixteen different test samples, are in excellent agreement with those of the three-dimensional finite element FE(3D. The comparison between the NTM method and the finite element method results shows that the modal percentage deviation is increased when a beam step location coincides with a peak point in the mode shape. Meanwhile, the deviation decreases when a beam step location coincides with a straight portion in the mode shape.

An interlaboratory comparison of methods for measuring rock matrix porosity

International Nuclear Information System (INIS)

Rasilainen, K.; Hellmuth, K.H.; Kivekaes, L.; Ruskeeniemi, T.; Melamed, A.; Siitari-Kauppi, M.

1996-09-01

An interlaboratory comparison study was conducted for the available Finnish methods of rock matrix porosity measurements. The aim was first to compare different experimental methods for future applications, and second to obtain quality assured data for the needs of matrix diffusion modelling. Three different versions of water immersion techniques, a tracer elution method, a helium gas through-diffusion method, and a C-14-PMMA method were tested. All methods selected for this study were established experimental tools in the respective laboratories, and they had already been individually tested. Rock samples for the study were obtained from a homogeneous granitic drill core section from the natural analogue site at Palmottu. The drill core section was cut into slabs that were expected to be practically identical. The subsamples were then circulated between the different laboratories using a round robin approach. The circulation was possible because all methods were non-destructive, except the C-14-PMMA method, which was always the last method to be applied. The possible effect of drying temperature on the measured porosity was also preliminarily tested. These measurements were done in the order of increasing drying temperature. Based on the study, it can be concluded that all methods are comparable in their accuracy. The selection of methods for future applications can therefore be based on practical considerations. Drying temperature seemed to have very little effect on the measured porosity, but a more detailed study is needed for definite conclusions. (author) (4 refs.)

On optimal improvements of classical iterative schemes for Z-matrices

Science.gov (United States)

Noutsos, D.; Tzoumas, M.

2006-04-01

Many researchers have considered preconditioners, applied to linear systems, whose matrix coefficient is a Z- or an M-matrix, that make the associated Jacobi and Gauss-Seidel methods converge asymptotically faster than the unpreconditioned ones. Such preconditioners are chosen so that they eliminate the off-diagonal elements of the same column or the elements of the first upper diagonal [Milaszewicz, LAA 93 (1987) 161-170], Gunawardena et al. [LAA 154-156 (1991) 123-143]. In this work we generalize the previous preconditioners to obtain optimal methods. "Good" Jacobi and Gauss-Seidel algorithms are given and preconditioners, that eliminate more than one entry per row, are also proposed and analyzed. Moreover, the behavior of the above preconditioners to the Krylov subspace methods is studied.

Efficient Tridiagonal Preconditioner for the Matrix-Free Truncated Newton Method

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Vlček, Jan

2014-01-01

Roč. 235, 25 May (2014), s. 394-407 ISSN 0096-3003 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : unconstrained optimization * large scale optimization * matrix-free truncated Newton method * preconditioned conjugate gradient method * preconditioners obtained by the directional differentiation * numerical algorithms Subject RIV: BA - General Mathematics Impact factor: 1.551, year: 2014

Method of computer algebraic calculation of the matrix elements in the second quantization language

International Nuclear Information System (INIS)

Gotoh, Masashi; Mori, Kazuhide; Itoh, Reikichi

1995-01-01

An automated method by the algebraic programming language REDUCE3 for specifying the matrix elements expressed in second quantization language is presented and then applied to the case of the matrix elements in the TDHF theory. This program works in a very straightforward way by commuting the electron creation and annihilation operator (a † and a) until these operators have completely vanished from the expression of the matrix element under the appropriate elimination conditions. An improved method using singlet generators of unitary transformations in the place of the electron creation and annihilation operators is also presented. This improvement reduces the time and memory required for the calculation. These methods will make programming in the field of quantum chemistry much easier. 11 refs., 1 tab

A massively parallel discrete ordinates response matrix method for neutron transport

International Nuclear Information System (INIS)

Hanebutte, U.R.; Lewis, E.E.

1992-01-01

In this paper a discrete ordinates response matrix method is formulated with anisotropic scattering for the solution of neutron transport problems on massively parallel computers. The response matrix formulation eliminates iteration on the scattering source. The nodal matrices that result from the diamond-differenced equations are utilized in a factored form that minimizes memory requirements and significantly reduces the number of arithmetic operations required per node. The red-black solution algorithm utilizes massive parallelism by assigning each spatial node to one or more processors. The algorithm is accelerated by a synthetic method in which the low-order diffusion equations are also solved by massively parallel red-black iterations. The method is implemented on a 16K Connection Machine-2, and S 8 and S 16 solutions are obtained for fixed-source benchmark problems in x-y geometry

Single-particle density matrix and superfluidity in the two-dimensional Bose Coulomb fluid

International Nuclear Information System (INIS)

Minguzzi, A.; Tosi, M.P.; Davoudi, B.

2002-01-01

A study by Magro and Ceperley [Phys. Rev. Lett. 73, 826 (1994)] has shown that the ground state of the two-dimensional fluid of charged bosons with logarithmic interactions is not Bose condensed, but exhibits algebraic off-diagonal order in the single-particle density matrix ρ(r). We use a hydrodynamic Hamiltonian expressed in terms of density and phase operators, in combination with an f-sum rule on the superfluid fraction, to reproduce these results and to extend the evaluation of the density matrix to finite temperature T. This approach allows us to treat the liquid as a superfluid in the absence of a condensate. The algebraic decay of the one-body density matrix is due to correlations between phase fluctuations, and we find that the exponent in the power law is determined by the superfluid density n s (T). We also find that the plasmon gap in the single-particle energy spectrum at long wavelengths decreases with increasing T and closes at the critical temperature for the onset of superfluidity

On the use of transition matrix methods with extended ensembles.

Science.gov (United States)

Escobedo, Fernando A; Abreu, Charlles R A

2006-03-14

Different extended ensemble schemes for non-Boltzmann sampling (NBS) of a selected reaction coordinate lambda were formulated so that they employ (i) "variable" sampling window schemes (that include the "successive umbrella sampling" method) to comprehensibly explore the lambda domain and (ii) transition matrix methods to iteratively obtain the underlying free-energy eta landscape (or "importance" weights) associated with lambda. The connection between "acceptance ratio" and transition matrix methods was first established to form the basis of the approach for estimating eta(lambda). The validity and performance of the different NBS schemes were then assessed using as lambda coordinate the configurational energy of the Lennard-Jones fluid. For the cases studied, it was found that the convergence rate in the estimation of eta is little affected by the use of data from high-order transitions, while it is noticeably improved by the use of a broader window of sampling in the variable window methods. Finally, it is shown how an "elastic" window of sampling can be used to effectively enact (nonuniform) preferential sampling over the lambda domain, and how to stitch the weights from separate one-dimensional NBS runs to produce a eta surface over a two-dimensional domain.

Nested Bethe Ansatz for Spin Ladder Model with Open Boundary Conditions

International Nuclear Information System (INIS)

Wu Junfang; Zhang Chunmin; Yue Ruihong; Li Runling

2005-01-01

The nested Bethe ansatz (BA) method is applied to find the eigenvalues and the eigenvectors of the transfer matrix for spin-ladder model with open boundary conditions. Based on the reflection equation, we find the general diagonal solution, which determines the general boundary interaction in the Hamiltonian. We introduce the spin-ladder model with open boundary conditions. By finding the solution K ± of the reflection equation which determines the nontrivial boundary terms in the Hamiltonian, we diagonalize the transfer matrix of the spin-ladder model with open boundary conditions in the framework of nested BA.

Spin-echo based diagonal peak suppression in solid-state MAS NMR homonuclear chemical shift correlation spectra

Science.gov (United States)

Wang, Kaiyu; Zhang, Zhiyong; Ding, Xiaoyan; Tian, Fang; Huang, Yuqing; Chen, Zhong; Fu, Riqiang

2018-02-01

The feasibility of using the spin-echo based diagonal peak suppression method in solid-state MAS NMR homonuclear chemical shift correlation experiments is demonstrated. A complete phase cycling is designed in such a way that in the indirect dimension only the spin diffused signals are evolved, while all signals not involved in polarization transfer are refocused for cancellation. A data processing procedure is further introduced to reconstruct this acquired spectrum into a conventional two-dimensional homonuclear chemical shift correlation spectrum. A uniformly 13C, 15N labeled Fmoc-valine sample and the transmembrane domain of a human protein, LR11 (sorLA), in native Escherichia coli membranes have been used to illustrate the capability of the proposed method in comparison with standard 13C-13C chemical shift correlation experiments.

IMPACT OF MATRIX INVERSION ON THE COMPLEXITY OF THE FINITE ELEMENT METHOD

Directory of Open Access Journals (Sweden)

M. Sybis

2016-04-01

Full Text Available Purpose. The development of a wide construction market and a desire to design innovative architectural building constructions has resulted in the need to create complex numerical models of objects having increasingly higher computational complexity. The purpose of this work is to show that choosing a proper method for solving the set of equations can improve the calculation time (reduce the complexity by a few levels of magnitude. Methodology. The article presents an analysis of the impact of matrix inversion algorithm on the deflection calculation in the beam, using the finite element method (FEM. Based on the literature analysis, common methods of calculating set of equations were determined. From the found solutions the Gaussian elimination, LU and Cholesky decomposition methods have been implemented to determine the effect of the matrix inversion algorithm used for solving the equations set on the number of computational operations performed. In addition, each of the implemented method has been further optimized thereby reducing the number of necessary arithmetic operations. Findings. These optimizations have been performed on the use of certain properties of the matrix, such as symmetry or significant number of zero elements in the matrix. The results of the analysis are presented for the division of the beam to 5, 50, 100 and 200 nodes, for which the deflection has been calculated. Originality. The main achievement of this work is that it shows the impact of the used methodology on the complexity of solving the problem (or equivalently, time needed to obtain results. Practical value. The difference between the best (the less complex and the worst (the most complex is in the row of few orders of magnitude. This result shows that choosing wrong methodology may enlarge time needed to perform calculation significantly.

The "Geomorphologic Diagonal" of Central Europe - towards a new morphotectonic interpretation of macroforms in average mountains

Science.gov (United States)

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

Explicit dynamics for numerical simulation of crack propagation by the extended finite element method; Dynamique explicite pour la simulation numerique de propagation de fissure par la methode des elements finis etendus

Energy Technology Data Exchange (ETDEWEB)

Menouillard, T

2007-09-15

Computerized simulation is nowadays an integrating part of design and validation processes of mechanical structures. Simulation tools are more and more performing allowing a very acute description of the phenomena. Moreover, these tools are not limited to linear mechanics but are developed to describe more difficult behaviours as for instance structures damage which interests the safety domain. A dynamic or static load can thus lead to a damage, a crack and then a rupture of the structure. The fast dynamics allows to simulate 'fast' phenomena such as explosions, shocks and impacts on structure. The application domain is various. It concerns for instance the study of the lifetime and the accidents scenario of the nuclear reactor vessel. It is then very interesting, for fast dynamics codes, to be able to anticipate in a robust and stable way such phenomena: the assessment of damage in the structure and the simulation of crack propagation form an essential stake. The extended finite element method has the advantage to break away from mesh generation and from fields projection during the crack propagation. Effectively, crack is described kinematically by an appropriate strategy of enrichment of supplementary freedom degrees. Difficulties connecting the spatial discretization of this method with the temporal discretization of an explicit calculation scheme has then been revealed; these difficulties are the diagonal writing of the mass matrix and the associated stability time step. Here are presented two methods of mass matrix diagonalization based on the kinetic energy conservation, and studies of critical time steps for various enriched finite elements. The interest revealed here is that the time step is not more penalizing than those of the standard finite elements problem. Comparisons with numerical simulations on another code allow to validate the theoretical works. A crack propagation test in mixed mode has been exploited in order to verify the simulation

A comparison of companion matrix methods to find roots of a trigonometric polynomial

Science.gov (United States)

Boyd, John P.

2013-08-01

A trigonometric polynomial is a truncated Fourier series of the form fN(t)≡∑j=0Naj cos(jt)+∑j=1N bj sin(jt). It has been previously shown by the author that zeros of such a polynomial can be computed as the eigenvalues of a companion matrix with elements which are complex valued combinations of the Fourier coefficients, the "CCM" method. However, previous work provided no examples, so one goal of this new work is to experimentally test the CCM method. A second goal is introduce a new alternative, the elimination/Chebyshev algorithm, and experimentally compare it with the CCM scheme. The elimination/Chebyshev matrix (ECM) algorithm yields a companion matrix with real-valued elements, albeit at the price of usefulness only for real roots. The new elimination scheme first converts the trigonometric rootfinding problem to a pair of polynomial equations in the variables (c,s) where c≡cos(t) and s≡sin(t). The elimination method next reduces the system to a single univariate polynomial P(c). We show that this same polynomial is the resultant of the system and is also a generator of the Groebner basis with lexicographic ordering for the system. Both methods give very high numerical accuracy for real-valued roots, typically at least 11 decimal places in Matlab/IEEE 754 16 digit floating point arithmetic. The CCM algorithm is typically one or two decimal places more accurate, though these differences disappear if the roots are "Newton-polished" by a single Newton's iteration. The complex-valued matrix is accurate for complex-valued roots, too, though accuracy decreases with the magnitude of the imaginary part of the root. The cost of both methods scales as O(N3) floating point operations. In spite of intimate connections of the elimination/Chebyshev scheme to two well-established technologies for solving systems of equations, resultants and Groebner bases, and the advantages of using only real-valued arithmetic to obtain a companion matrix with real-valued elements

Studies in the method of correlated basis functions. Pt. 3

International Nuclear Information System (INIS)

Krotscheck, E.; Clark, J.W.

1980-01-01

A variational theory of pairing phenomena is presented for systems like neutron matter and liquid 3 He. The strong short-range correlations among the particles in these systems are incorporated into the trial states describing normal and pair-condensed phases, via a correlation operator F. The resulting theory has the same basic structure as that ordinarily applied for weak two-body interactions; in place of the pairing matrix elements of the bare interaction one finds certain effective pairing matrix elements Psub(kl), and modified single particle energies epsilon (k) appear. Detailed prescriptions are given for the construction of the Psub(kl) and epsilon (k) in terms of off-diagonal and diagonal matrix elements of the Hamiltonian and unit operators in a correlated basis of normal states. An exact criterion for instability of the assumed normal phase with respect to pair condensation is derived for general F. This criterion is investigated numerically for the special case if Jastrow correlations, the required normal-state quantities being evaluated by integral equation techniques which extend the Fermi hypernetted-chain scheme. In neutron matter, an instability with respect to 1 S 0 pairing is found in the low-density region, in concert with the predictions of Yang and Clark. In liquid 3 He, there is some indication of a 3 P 0 pairing instability in the vicinity of the experimental equilibrium density. (orig.)

A Control Method of Current Type Matrix Converter for Plasma Control Coil Power Supply

International Nuclear Information System (INIS)

Shimada, K.; Matsukawa, M.; Kurihara, K.; Jun-ichi Itoh

2006-01-01

In exploration to a tokamak fusion reactor, the control of plasma instabilities of high β plasma such as neoclassical tearing mode (NTM), resistive wall mode (RWM) etc., is the key issue for steady-state sustainment. One of the proposed methods to avoid suppressing RWM is that AC current having a phase to work for reduction the RWM growth is generated in a coil (sector coil) equipped spirally on the plasma vacuum vessel. To stabilize RWM, precise and fast real-time feedback control of magnetic field with proper amplitude and frequency is necessary. This implies that an appropriate power supply dedicated for such an application is expected to be developed. A matrix converter as one of power supply candidates for this purpose could provide a solution The matrix converter, categorized in an AC/AC direct converter composed of nine bi-directional current switches, has a great feature that a large energy storage element is unnecessary in comparison with a standard existing AC/AC indirect converter, which is composed of an AC/DC converter and a DC/AC inverter. It is also advantageous in cost and size of its applications. Fortunately, a voltage type matrix converter has come to be available at the market recently, while a current type matrix converter, which is advantageous for fast control of the large-inductance coil current, has been unavailable. On the background above mentioned, we proposed a new current type matrix converter and its control method applicable to a power supply with fast response for suppressing plasma instabilities. Since this converter is required with high accuracy control, the gate control method is adopted to three-phase switching method using middle phase to reduce voltage and current waveforms distortion. The control system is composed of VME-bus board with DSP (Digital Signal Processor) and FPGA (Field Programmable Gate Array) for high speed calculation and control. This paper describes the control method of a current type matrix converter

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

Matrix Methods for Solving Hartree-Fock Equations in Atomic Structure Calculations and Line Broadening

Directory of Open Access Journals (Sweden)

Thomas Gomez

2018-04-01

Full Text Available Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods. Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numerical complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. This technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.

Strategy BMT Al-Ittihad Using Matrix IE, Matrix SWOT 8K, Matrix SPACE and Matrix TWOS

Directory of Open Access Journals (Sweden)

Nofrizal Nofrizal

2018-03-01

Full Text Available This research aims to formulate and select BMT Al-Ittihad Rumbai strategy to face the changing of business environment both from internal environment such as organization resources, finance, member and external business such as competitor, economy, politics and others. This research method used Analysis of EFAS, IFAS, IE Matrix, SWOT-8K Matrix, SPACE Matrix and TWOS Matrix. our hope from this research it can assist BMT Al-Ittihad in formulating and selecting strategies for the sustainability of BMT Al-Ittihad in the future. The sample in this research is using purposive sampling technique that is the manager and leader of BMT Al-IttihadRumbaiPekanbaru. The result of this research shows that the position of BMT Al-Ittihad using IE Matrix, SWOT-8K Matrix and SPACE Matrix is in growth position, stabilization and aggressive. The choice of strategy after using TWOS Matrix is market penetration, market development, vertical integration, horizontal integration, and stabilization (careful.

Explicit dynamics for numerical simulation of crack propagation by the extended finite element method

International Nuclear Information System (INIS)

Menouillard, T.

2007-09-01

Computerized simulation is nowadays an integrating part of design and validation processes of mechanical structures. Simulation tools are more and more performing allowing a very acute description of the phenomena. Moreover, these tools are not limited to linear mechanics but are developed to describe more difficult behaviours as for instance structures damage which interests the safety domain. A dynamic or static load can thus lead to a damage, a crack and then a rupture of the structure. The fast dynamics allows to simulate 'fast' phenomena such as explosions, shocks and impacts on structure. The application domain is various. It concerns for instance the study of the lifetime and the accidents scenario of the nuclear reactor vessel. It is then very interesting, for fast dynamics codes, to be able to anticipate in a robust and stable way such phenomena: the assessment of damage in the structure and the simulation of crack propagation form an essential stake. The extended finite element method has the advantage to break away from mesh generation and from fields projection during the crack propagation. Effectively, crack is described kinematically by an appropriate strategy of enrichment of supplementary freedom degrees. Difficulties connecting the spatial discretization of this method with the temporal discretization of an explicit calculation scheme has then been revealed; these difficulties are the diagonal writing of the mass matrix and the associated stability time step. Here are presented two methods of mass matrix diagonalization based on the kinetic energy conservation, and studies of critical time steps for various enriched finite elements. The interest revealed here is that the time step is not more penalizing than those of the standard finite elements problem. Comparisons with numerical simulations on another code allow to validate the theoretical works. A crack propagation test in mixed mode has been exploited in order to verify the simulation

The current matrix elements from HAL QCD method

Science.gov (United States)

Watanabe, Kai; Ishii, Noriyoshi

2018-03-01

HAL QCD method is a method to construct a potential (HAL QCD potential) that reproduces the NN scattering phase shift faithful to the QCD. The HAL QCD potential is obtained from QCD by eliminating the degrees of freedom of quarks and gluons and leaving only two particular hadrons. Therefor, in the effective quantum mechanics of two nucleons defined by HAL QCD potential, the conserved current consists not only of the nucleon current but also an extra current originating from the potential (two-body current). Though the form of the two-body current is closely related to the potential, it is not straight forward to extract the former from the latter. In this work, we derive the the current matrix element formula in the quantum mechanics defined by the HAL QCD potential. As a first step, we focus on the non-relativistic case. To give an explicit example, we consider a second quantized non-relativistic two-channel coupling model which we refer to as the original model. From the original model, the HAL QCD potential for the open channel is constructed by eliminating the closed channel in the elastic two-particle scattering region. The current matrix element formula is derived by demanding the effective quantum mechanics defined by the HAL QCD potential to respond to the external field in the same way as the original two-channel coupling model.

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)

On the performance of diagonal lattice space-time codes for the quasi-static MIMO channel

KAUST Repository

Abediseid, Walid

2013-06-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 to date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria. In this paper, we analyze in detail the performance of diagonal lattice space-time codes under lattice decoding. We present both upper and lower bounds on the average error probability. We derive a new closed form expression of the lower bound using the so-called sphere-packing 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 simply derived using the union-bound and demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. © 2013 IEEE.

Analytical representation of the solution of the space kinetic diffusion equation in a one-dimensional and homogeneous domain

Energy Technology Data Exchange (ETDEWEB)

Tumelero, Fernanda; Bodmann, Bardo E. J.; Vilhena, Marco T. [Universidade Federal do Rio Grande do Sul (PROMEC/UFRGS), Porto Alegre, RS (Brazil). Programa de Pos Graduacao em Engenharia Mecanica; Lapa, Celso M.F., E-mail: fernanda.tumelero@yahoo.com.br, E-mail: bardo.bodmann@ufrgs.br, E-mail: mtmbvilhena@gmail.com, E-mail: lapa@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil)

2017-07-01

In this work we solve the space kinetic diffusion equation in a one-dimensional geometry considering a homogeneous domain, for two energy groups and six groups of delayed neutron precursors. The proposed methodology makes use of a Taylor expansion in the space variable of the scalar neutron flux (fast and thermal) and the concentration of delayed neutron precursors, allocating the time dependence to the coefficients. Upon truncating the Taylor series at quadratic order, one obtains a set of recursive systems of ordinary differential equations, where a modified decomposition method is applied. The coefficient matrix is split into two, one constant diagonal matrix and the second one with the remaining time dependent and off-diagonal terms. Moreover, the equation system is reorganized such that the terms containing the latter matrix are treated as source terms. Note, that the homogeneous equation system has a well known solution, since the matrix is diagonal and constant. This solution plays the role of the recursion initialization of the decomposition method. The recursion scheme is set up in a fashion where the solutions of the previous recursion steps determine the source terms of the subsequent steps. A second feature of the method is the choice of the initial and boundary conditions, which are satisfied by the recursion initialization, while from the rst recursion step onward the initial and boundary conditions are homogeneous. The recursion depth is then governed by a prescribed accuracy for the solution. (author)

A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

Full Text Available A matrix-free method for constrained equations is proposed, which is a combination of the well-known PRP (Polak-Ribière-Polyak conjugate gradient method and the famous hyperplane projection method. The new method is not only derivative-free, but also completely matrix-free, and consequently, it can be applied to solve large-scale constrained equations. We obtain global convergence of the new method without any differentiability requirement on the constrained equations. Compared with the existing gradient methods for solving such problem, the new method possesses linear convergence rate under standard conditions, and a relax factor γ is attached in the update step to accelerate convergence. Preliminary numerical results show that it is promising in practice.

A 2D/1D coupling neutron transport method based on the matrix MOC and NEM methods

International Nuclear Information System (INIS)

Zhang, H.; Zheng, Y.; Wu, H.; Cao, L.

2013-01-01

A new 2D/1D coupling method based on the matrix MOC method (MMOC) and nodal expansion method (NEM) is proposed for solving the three-dimensional heterogeneous neutron transport problem. The MMOC method, used for radial two-dimensional calculation, constructs a response matrix between source and flux with only one sweep and then solves the linear system by using the restarted GMRES algorithm instead of the traditional trajectory sweeping process during within-group iteration for angular flux update. Long characteristics are generated by using the customization of commercial software AutoCAD. A one-dimensional diffusion calculation is carried out in the axial direction by employing the NEM method. The 2D and ID solutions are coupled through the transverse leakage items. The 3D CMFD method is used to ensure the global neutron balance and adjust the different convergence properties of the radial and axial solvers. A computational code is developed based on these theories. Two benchmarks are calculated to verify the coupling method and the code. It is observed that the corresponding numerical results agree well with references, which indicates that the new method is capable of solving the 3D heterogeneous neutron transport problem directly. (authors)

A 2D/1D coupling neutron transport method based on the matrix MOC and NEM methods

Energy Technology Data Exchange (ETDEWEB)

Zhang, H.; Zheng, Y.; Wu, H.; Cao, L. [School of Nuclear Science and Technology, Xi' an Jiaotong University, No. 28, Xianning West Road, Xi' an, Shaanxi 710049 (China)

2013-07-01

A new 2D/1D coupling method based on the matrix MOC method (MMOC) and nodal expansion method (NEM) is proposed for solving the three-dimensional heterogeneous neutron transport problem. The MMOC method, used for radial two-dimensional calculation, constructs a response matrix between source and flux with only one sweep and then solves the linear system by using the restarted GMRES algorithm instead of the traditional trajectory sweeping process during within-group iteration for angular flux update. Long characteristics are generated by using the customization of commercial software AutoCAD. A one-dimensional diffusion calculation is carried out in the axial direction by employing the NEM method. The 2D and ID solutions are coupled through the transverse leakage items. The 3D CMFD method is used to ensure the global neutron balance and adjust the different convergence properties of the radial and axial solvers. A computational code is developed based on these theories. Two benchmarks are calculated to verify the coupling method and the code. It is observed that the corresponding numerical results agree well with references, which indicates that the new method is capable of solving the 3D heterogeneous neutron transport problem directly. (authors)

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

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

Jordan blocks and Gamow-Jordan eigenfunctions associated to a double pole of the S-matrix

International Nuclear Information System (INIS)

Hernandez, E.; Mondragon, A.; Jauregui, A.

2002-01-01

An accidental degeneracy of resonances gives rise to a double pole in the scattering matrix, a double zero in the Jost function and a Jordan chain of length two of generalized Gamow-Jordan eigenfunctions of the radial Schrodinger equation. The generalized Gamow-Jordan eigenfunctions are basis elements of an expansion in bound and resonant energy eigenfunctions plus a continuum of scattering wave functions ol complex wave number. In this bi orthonormal basis, any operator f (H r (l) which is a regular function of the Hamiltonian is represented by a complex matrix which is diagonal except for a Jordan block of rank two. The occurrence of a double pole in the Green's function, as well as the non-exponential time evolution of the Gamow-Jordan generalized eigenfunctions are associated to the Jordan block in the complex energy representation. (Author)

Iterative methods for symmetric ill-conditioned Toeplitz matrices

Energy Technology Data Exchange (ETDEWEB)

Huckle, T. [Institut fuer Informatik, Muenchen (Germany)

1996-12-31

We consider ill-conditioned symmetric positive definite, Toeplitz systems T{sub n}x = b. If we want to solve such a system iteratively with the conjugate gradient method, we can use band-Toeplitz-preconditioners or Sine-Transform-peconditioners M = S{sub n}{Lambda}S{sub n}, S{sub n} the Sine-Transform-matrix and {Lambda} a diagonal matrix. A Toeplitz matrix T{sub n} = (t{sub i-j)}{sub i}{sup n},{sub j=1} is often related to an underlying function f defined by the coefficients t{sub j}, j = -{infinity},..,-1,0, 1,.., {infinity}. There are four cases, for which we want to determine a preconditioner M: - T{sub n} is related to an underlying function which is given explicitly; - T{sub n} is related to an underlying function that is given by its Fourier coefficients; - T{sub n} is related to an underlying function that is unknown; - T{sub n} is not related to an underlying function. Especially for the first three cases we show how positive definite and effective preconditioners based on the Sine-Transform can be defined for general nonnegative underlying function f. To define M, we evaluate or estimate the values of f at certain positions, and build a Sine-transform matrix with these values as eigenvalues. Then, the spectrum of the preconditioned system is bounded from above and away from zero.

Approach method of the solutions of algebraic models of the N body problem

International Nuclear Information System (INIS)

Dufour, M.

1986-09-01

We have studied a class of algebraic eigenvalue problems that generate tridiagonal matrices. The Lipkin Hamiltonian was chosen as representative. Three methods have been implemented, whose extension to more general many body problems seems possible i) Degenerate Linked Cluster Theory (LCT), which disregards special symmetries of the interaction and defines a hierarchy of approximation based on model spaces at fixed number of particle-hole excitation of the unperturbed Hamiltonian. The method works for small perturbations but does not yield a complete description. ii) A new linearization method that replaces the matrix to be diagonalized by local (tangent) approximations by harmonic matrices. This method generalizes LCT and is a posteriori reminiscent of semi-classical ones. However of is simpler, more precise and yields a complete description of spectra. iii) A global way to characterize spectra based on Gershgorine-Hadamard disks [fr

Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.

Science.gov (United States)

Congedo, Marco; Afsari, Bijan; Barachant, Alexandre; Moakher, Maher

2014-01-01

We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD) matrices and their approximate joint diagonalization (AJD). Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed with the Fisher information metric. The resulting mean has several important invariance properties and has proven very useful in diverse engineering applications such as biomedical and image data processing. While for two SPD matrices the mean has an algebraic closed form solution, for a set of more than two SPD matrices it can only be estimated by iterative algorithms. However, none of the existing iterative algorithms feature at the same time fast convergence, low computational complexity per iteration and guarantee of convergence. For this reason, recently other definitions of geometric mean based on symmetric divergence measures, such as the Bhattacharyya divergence, have been considered. The resulting means, although possibly useful in practice, do not satisfy all desirable invariance properties. In this paper we consider geometric means of covariance matrices estimated on high-dimensional time-series, assuming that the data is generated according to an instantaneous mixing model, which is very common in signal processing. We show that in these circumstances we can approximate the Fisher information geometric mean by employing an efficient AJD algorithm. Our approximation is in general much closer to the Fisher information geometric mean as compared to its competitors and verifies many invariance properties. Furthermore, convergence is guaranteed, the computational complexity is low and the convergence rate is quadratic. The accuracy of this new geometric mean approximation is demonstrated by means of simulations.

Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.

Directory of Open Access Journals (Sweden)

Marco Congedo

Full Text Available We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD matrices and their approximate joint diagonalization (AJD. Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed with the Fisher information metric. The resulting mean has several important invariance properties and has proven very useful in diverse engineering applications such as biomedical and image data processing. While for two SPD matrices the mean has an algebraic closed form solution, for a set of more than two SPD matrices it can only be estimated by iterative algorithms. However, none of the existing iterative algorithms feature at the same time fast convergence, low computational complexity per iteration and guarantee of convergence. For this reason, recently other definitions of geometric mean based on symmetric divergence measures, such as the Bhattacharyya divergence, have been considered. The resulting means, although possibly useful in practice, do not satisfy all desirable invariance properties. In this paper we consider geometric means of covariance matrices estimated on high-dimensional time-series, assuming that the data is generated according to an instantaneous mixing model, which is very common in signal processing. We show that in these circumstances we can approximate the Fisher information geometric mean by employing an efficient AJD algorithm. Our approximation is in general much closer to the Fisher information geometric mean as compared to its competitors and verifies many invariance properties. Furthermore, convergence is guaranteed, the computational complexity is low and the convergence rate is quadratic. The accuracy of this new geometric mean approximation is demonstrated by means of simulations.

Quantitative evaluation of the matrix effect in bioanalytical methods based on LC-MS: A comparison of two approaches.

Science.gov (United States)

Rudzki, Piotr J; Gniazdowska, Elżbieta; Buś-Kwaśnik, Katarzyna

2018-06-05

Liquid chromatography coupled to mass spectrometry (LC-MS) is a powerful tool for studying pharmacokinetics and toxicokinetics. Reliable bioanalysis requires the characterization of the matrix effect, i.e. influence of the endogenous or exogenous compounds on the analyte signal intensity. We have compared two methods for the quantitation of matrix effect. The CVs(%) of internal standard normalized matrix factors recommended by the European Medicines Agency were evaluated against internal standard normalized relative matrix effects derived from Matuszewski et al. (2003). Both methods use post-extraction spiked samples, but matrix factors require also neat solutions. We have tested both approaches using analytes of diverse chemical structures. The study did not reveal relevant differences in the results obtained with both calculation methods. After normalization with the internal standard, the CV(%) of the matrix factor was on average 0.5% higher than the corresponding relative matrix effect. The method adopted by the European Medicines Agency seems to be slightly more conservative in the analyzed datasets. Nine analytes of different structures enabled a general overview of the problem, still, further studies are encouraged to confirm our observations. Copyright © 2018 Elsevier B.V. All rights reserved.

Analytical representation for solution of the neutron point kinetics equation with time-dependent reactivity and free of the stiffness character

International Nuclear Information System (INIS)

Silva, Milena Wollmann da

2013-01-01

In this work, we report a genuine analytical representation for the solution of the neutron point kinetics equation free of the stiffness character, assuming that the reactivity is a continuous and sectionally continuous function of time. To this end, we initially cast the point kinetics equation in a first order linear differential equation. Next, we split the corresponding matrix as a sum of a diagonal matrix with a matrix, whose components contain the off-diagonal elements. Next, expanding the neutron density and the delayed neutron precursors concentrations in a truncated series, and replacing these expansions in the matrix equation, we come out with an equation, which allows to construct a recursive system, a first order matrix differential equation with source. The fundamental characteristic of this system relies on the fact that the corresponding matrix is diagonal, meanwhile the source term is written in terms of the matrix with the off-diagonal components. Further, the first equation of the recursive system has no source and satisfies the initial conditions. On the other hand, the remaining equations satisfy the null initial condition. Due to the diagonal feature of the matrix, we attain analytical solutions for these recursive equations. We also mention that we evaluate the results for any time value, without the analytical continuity because the purposed solution is free on the stiffness character. Finally, we present numerical simulations and comparisons against literature results, considering specific the applications for the following reactivity functions: constant, step, ramp, and sine. (author)

Analytical representation for solution of the neutron point kinetics equation with time-dependent reactivity and free of the stiffness character; Representacao analitica da solucao da equacao de cinetica pontual para a reatividade variavel no tempo livre de rigidez

Energy Technology Data Exchange (ETDEWEB)

Silva, Milena Wollmann da

2013-08-01

In this work, we report a genuine analytical representation for the solution of the neutron point kinetics equation free of the stiffness character, assuming that the reactivity is a continuous and sectionally continuous function of time. To this end, we initially cast the point kinetics equation in a first order linear differential equation. Next, we split the corresponding matrix as a sum of a diagonal matrix with a matrix, whose components contain the off-diagonal elements. Next, expanding the neutron density and the delayed neutron precursors concentrations in a truncated series, and replacing these expansions in the matrix equation, we come out with an equation, which allows to construct a recursive system, a first order matrix differential equation with source. The fundamental characteristic of this system relies on the fact that the corresponding matrix is diagonal, meanwhile the source term is written in terms of the matrix with the off-diagonal components. Further, the first equation of the recursive system has no source and satisfies the initial conditions. On the other hand, the remaining equations satisfy the null initial condition. Due to the diagonal feature of the matrix, we attain analytical solutions for these recursive equations. We also mention that we evaluate the results for any time value, without the analytical continuity because the purposed solution is free on the stiffness character. Finally, we present numerical simulations and comparisons against literature results, considering specific the applications for the following reactivity functions: constant, step, ramp, and sine. (author)

Development of Implicit Methods in CFD NASA Ames Research Center 1970's - 1980's

Science.gov (United States)

Pulliam, Thomas H.

2010-01-01

The focus here is on the early development (mid 1970's-1980's) at NASA Ames Research Center of implicit methods in Computational Fluid Dynamics (CFD). A class of implicit finite difference schemes of the Beam and Warming approximate factorization type will be addressed. The emphasis will be on the Euler equations. A review of material pertinent to the solution of the Euler equations within the framework of implicit methods will be presented. The eigensystem of the equations will be used extensively in developing a framework for various methods applied to the Euler equations. The development and analysis of various aspects of this class of schemes will be given along with the motivations behind many of the choices. Various acceleration and efficiency modifications such as matrix reduction, diagonalization and flux split schemes will be presented.

Evaluation of the streaming-matrix method for discrete-ordinates duct-streaming calculations

International Nuclear Information System (INIS)

Clark, B.A.; Urban, W.T.; Dudziak, D.J.

1983-01-01

A new deterministic streaming technique called the Streaming Matrix Hybrid Method (SMHM) is applied to two realistic duct-shielding problems. The results are compared to standard discrete-ordinates and Monte Carlo calculations. The SMHM shows promise as an alternative deterministic streaming method to standard discrete-ordinates

A comparative study of methods for describing non-adiabatic coupling: diabatic representation of the 1Sigma +/1Pi HOH and HHO conical intersections

Science.gov (United States)

Dobbyn, Abigail J.; Knowles, Peter J.

A number of established techniques for obtaining diabatic electronic states in small molecules are critically compared for the example of the X and B states in the water molecule, which contribute to the two lowest-energy conical intersections. Integration of the coupling matrix elements and analysis of configuration mixing coefficients both produce reliable diabatic states globally. Methods relying on diagonalization of dipole moment and angular momentum operators are shown to fail in large regions of coordinate space. However, the use of transition angular momentum matrix elements involving the A state, which is degenerate with B at the conical intersections, is successful globally, provided that an appropriate choice of coordinates is made. Long range damping of non-adiabatic coupling to give correct asymptotic mixing angles also is investigated.

A Lexicographic Method for Matrix Games with Payoffs of Triangular Intuitionistic Fuzzy Numbers

Directory of Open Access Journals (Sweden)

Jiang-Xia Nan

2010-09-01

Full Text Available The intuitionistic fuzzy set (IF-set has not been applied to matrix game problems yet since it was introduced by K.T.Atanassov. The aim of this paper is to develop a methodology for solving matrix games with payoffs of triangular intuitionistic fuzzy numbers (TIFNs. Firstly the concept of TIFNs and their arithmetic operations and cut sets are introduced as well as the ranking order relations. Secondly the concept of solutions for matrix games with payoffs of TIFNs is defined. A lexicographic methodology is developed to determine the solutions of matrix games with payoffs of TIFNs for both Players through solving a pair of bi-objective linear programming models derived from two new auxiliary intuitionistic fuzzy programming models. The proposed method is illustrated with a numerical example.

Energy relaxation and transfer in excitonic trimer

International Nuclear Information System (INIS)

Herman, Pavel; Barvik, Ivan; Urbanec, Martin

2004-01-01

Two models describing exciton relaxation and transfer (the Redfield model in the secular approximation and Capek's model) are compared for a simple example - a symmetric trimer coupled to a phonon bath. Energy transfer within the trimer occurs via resonance interactions and coupling between the trimer and the bath occurs via modulation of the monomer energies by phonons. Two initial conditions are adopted: (1) one of higher eigenstates of the trimer is initially occupied and (2) one local site of the trimer is initially occupied. The diagonal exciton density matrix elements in the representation of eigenstates are found to be the same for both models, but this is not so for the off-diagonal density matrix elements. Only if the off-diagonal density matrix elements vanish initially (initial condition (1)), they then vanish at arbitrary times in both models. If the initial excitation is local, the off-diagonal matrix elements essentially differ

Threshold partitioning of sparse matrices and applications to Markov chains

Energy Technology Data Exchange (ETDEWEB)

Choi, Hwajeong; Szyld, D.B. [Temple Univ., Philadelphia, PA (United States)

1996-12-31

It is well known that the order of the variables and equations of a large, sparse linear system influences the performance of classical iterative methods. In particular if, after a symmetric permutation, the blocks in the diagonal have more nonzeros, classical block methods have a faster asymptotic rate of convergence. In this paper, different ordering and partitioning algorithms for sparse matrices are presented. They are modifications of PABLO. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The matrix resulting after the symmetric permutation has dense blocks along the diagonal, and small entries in the off-diagonal blocks. Parameters can be easily adjusted to obtain, for example, denser blocks, or blocks with elements of larger magnitude. In particular, when the matrices represent Markov chains, the permuted matrices are well suited for block iterative methods that find the corresponding probability distribution. Applications to three types of methods are explored: (1) Classical block methods, such as Block Gauss Seidel. (2) Preconditioned GMRES, where a block diagonal preconditioner is used. (3) Iterative aggregation method (also called aggregation/disaggregation) where the partition obtained from the ordering algorithm with certain parameters is used as an aggregation scheme. In all three cases, experiments are presented which illustrate the performance of the methods with the new orderings. The complexity of the new algorithms is linear in the number of nonzeros and the order of the matrix, and thus adding little computational effort to the overall solution.

The Split Coefficient Matrix method for hyperbolic systems of gasdynamic equations

Science.gov (United States)

Chakravarthy, S. R.; Anderson, D. A.; Salas, M. D.

1980-01-01

The Split Coefficient Matrix (SCM) finite difference method for solving hyperbolic systems of equations is presented. This new method is based on the mathematical theory of characteristics. The development of the method from characteristic theory is presented. Boundary point calculation procedures consistent with the SCM method used at interior points are explained. The split coefficient matrices that define the method for steady supersonic and unsteady inviscid flows are given for several examples. The SCM method is used to compute several flow fields to demonstrate its accuracy and versatility. The similarities and differences between the SCM method and the lambda-scheme are discussed.

Invariant Imbedding T-Matrix Method for Axial Symmetric Hydrometeors with Extreme Aspect Ratios

Science.gov (United States)

Pelissier, C.; Clune, T.; Kuo, K. S.; Munchak, S. J.; Adams, I. S.

2017-12-01

The single-scattering properties (SSPs) of hydrometeors are the fundamental quantities for physics-based precipitation retrievals. Thus, efficient computation of their electromagnetic scattering is of great value. Whereas the semi-analytical T-Matrix methods are likely the most efficient for nonspherical hydrometeors with axial symmetry, they are not suitable for arbitrarily shaped hydrometeors absent of any significant symmetry, for which volume integral methods such as those based on Discrete Dipole Approximation (DDA) are required. Currently the two leading T-matrix methods are the Extended Boundary Condition Method (EBCM) and the Invariant Imbedding T-matrix Method incorporating Lorentz-Mie Separation of Variables (IITM+SOV). EBCM is known to outperform IITM+SOV for hydrometeors with modest aspect ratios. However, in cases when aspect ratios become extreme, such as needle-like particles with large height to diameter values, EBCM fails to converge. Such hydrometeors with extreme aspect ratios are known to be present in solid precipitation and their SSPs are required to model the radiative responses accurately. In these cases, IITM+SOV is shown to converge. An efficient, parallelized C++ implementation for both EBCM and IITM+SOV has been developed to conduct a performance comparison between EBCM, IITM+SOV, and DDSCAT (a popular implementation of DDA). We present the comparison results and discuss details. Our intent is to release the combined ECBM & IITM+SOV software to the community under an open source license.

NewIn-situ synthesis method of magnesium matrix composites reinforced with TiC particulates

Directory of Open Access Journals (Sweden)

Zhang Xiuqing

2006-12-01

Full Text Available Magnesium matrix composites reinforced with TiC particulates was prepared using a new in-situ synthesis method of remelting and dilution technique. And measurements were performed on the composites. The results of x ray diffraction (XRD analysis confirmed that TiC particulates were synthesized during the sintering process, and they retained in magnesium matrix composites after the remelting and dilution processing. From the microstructure characterization and electron probe microanalysis (EPMA, we could see that fine TiC particulates distributed uniformly in the matrix material.

Character expansion methods for matrix models of dually weighted graphs

International Nuclear Information System (INIS)

Kazakov, V.A.; Staudacher, M.; Wynter, T.

1996-01-01

We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally due to Itzykson and Di Francesco, and then demonstrate how to take the large N limit of this expansion. The relationship to the usual matrix model resolvent is elucidated. Our methods give as a by-product an extremely simple derivation of the Migdal integral equation describing the large N limit of the Itzykson-Zuber formula. We illustrate and check our methods by analysing a number of models solvable by traditional means. We then proceed to solve a new model: a sum over planar graphs possessing even coordination numbers on both the original and the dual lattice. We conclude by formulating equations for the case of arbitrary sets of even, self-dual coupling constants. This opens the way for studying the deep problem of phase transitions from random to flat lattices. (orig.). With 4 figs

The Density Matrix for Single-mode Light after k-Photon Absorption

Science.gov (United States)

Voigt, H.; Bandilla, A.

In order to continue and generalize the studies of the density matrix of a light field undergoing k-photon absorption, in this paper we put the emphasis on the off-diagonal elements. The solution obtained earlier for the diagonal elements describing the photon statistics can be found as a special case but will not be discussed again. The general solution calculated by recursion shows an asymptotic behaviour if the initial photon number is sufficiently high. Only the initial phase information survives. Illustrating the solution we start with coherent light and a generalized coherent state.Translated AbstractDie Dichtematrix eines Lichtstrahls nach k-Photonen-Absorption aus einer ModeWir führen die Betrachtungen über das Verhalten der Dichtematrix eines Lichtfeldes nach k-Photonen-Absorption aus einer Mode verallgemeinernd weiter und konzentrieren uns auf die Nichtdiagonalelemente. Die im folgenden angegebene allgemeine Lösung, die durch Rekursion gefunden wurde, enthält die schon früher erhaltene, jedoch hier nicht weiter diskutierte Lösung für die Diagonalelemente als Spezialfall. Sie zeigt ferner, daß es einen asymptotischen Zustand gibt, der eine von der Ausgangsintensität unabhängige Information über die Ausgangsphase enthält. Zur Diskussion der Lösung werden verschiedene Anfangsbedingungen betrachtet, so z. B. kohärentes Licht und kohärentes Licht, das ein Medium mit nichtlinearem Brechungsindex durchlaufen hat (Kerr-Effekt).

Periodic Anderson model with correlated conduction electrons: Variational and exact diagonalization study

Science.gov (United States)

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.

Linear programming models and methods of matrix games with payoffs of triangular fuzzy numbers

CERN Document Server

Li, Deng-Feng

2016-01-01

This book addresses two-person zero-sum finite games in which the payoffs in any situation are expressed with fuzzy numbers. The purpose of this book is to develop a suite of effective and efficient linear programming models and methods for solving matrix games with payoffs in fuzzy numbers. Divided into six chapters, it discusses the concepts of solutions of matrix games with payoffs of intervals, along with their linear programming models and methods. Furthermore, it is directly relevant to the research field of matrix games under uncertain economic management. The book offers a valuable resource for readers involved in theoretical research and practical applications from a range of different fields including game theory, operational research, management science, fuzzy mathematical programming, fuzzy mathematics, industrial engineering, business and social economics. .

Teaching the "Diagonalization Concept" in Linear Algebra with Technology: A Case Study at Galatasaray University

Science.gov (United States)

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…

Algebraic method for analysis of nonlinear systems with a normal matrix

International Nuclear Information System (INIS)

Konyaev, Yu.A.; Salimova, A.F.

2014-01-01

A promising method has been proposed for analyzing a class of quasilinear nonautonomous systems of differential equations whose matrix can be represented as a sum of nonlinear normal matrices, which makes it possible to analyze stability without using the Lyapunov functions [ru

Non-supersymmetric matrix strings from generalized Yang-Mills theory on arbitrary Riemann surfaces

International Nuclear Information System (INIS)

Billo, M.; D'Adda, A.; Provero, P.

2000-01-01

We quantize pure 2d Yang-Mills theory on an arbitrary Riemann surface in the gauge where the field strength is diagonal. Twisted sectors originate, as in Matrix string theory, from permutations of the eigenvalues around homotopically non-trivial loops. These sectors, that must be discarded in the usual quantization due to divergences occurring when two eigenvalues coincide, can be consistently kept if one modifies the action by introducing a coupling of the field strength to the space-time curvature. This leads to a generalized Yang-Mills theory whose action reduces to the usual one in the limit of zero curvature. After integrating over the non-diagonal components of the gauge fields, the theory becomes a free string theory (sum over unbranched coverings) with a U(1) gauge theory on the world-sheet. This is shown to be equivalent to a lattice theory with a gauge group which is the semi-direct product of S N and U(1) N . By using well known results on the statistics of coverings, the partition function on arbitrary Riemann surfaces and the kernel functions on surfaces with boundaries are calculated. Extensions to include branch points and non-abelian groups on the world-sheet are briefly commented upon

Improved determination of hadron matrix elements using the variational method

International Nuclear Information System (INIS)

Dragos, J.; Kamleh, W.; Leinweber, D.B.; Zanotti, J.M.; Rakow, P.E.L.; Young, R.D.; Adelaide Univ.

2015-11-01

The extraction of hadron form factors in lattice QCD using the standard two- and three-point correlator functions has its limitations. One of the most commonly studied sources of systematic error is excited state contamination, which occurs when correlators are contaminated with results from higher energy excitations. We apply the variational method to calculate the axial vector current g A and compare the results to the more commonly used summation and two-exponential fit methods. The results demonstrate that the variational approach offers a more efficient and robust method for the determination of nucleon matrix elements.

Efficient conjugate gradient algorithms for computation of the manipulator forward dynamics

Science.gov (United States)

Fijany, Amir; Scheid, Robert E.

1989-01-01

The applicability of conjugate gradient algorithms for computation of the manipulator forward dynamics is investigated. The redundancies in the previously proposed conjugate gradient algorithm are analyzed. A new version is developed which, by avoiding these redundancies, achieves a significantly greater efficiency. A preconditioned conjugate gradient algorithm is also presented. A diagonal matrix whose elements are the diagonal elements of the inertia matrix is proposed as the preconditioner. In order to increase the computational efficiency, an algorithm is developed which exploits the synergism between the computation of the diagonal elements of the inertia matrix and that required by the conjugate gradient algorithm.

Legendre Wavelet Operational Matrix Method for Solution of Riccati Differential Equation

Directory of Open Access Journals (Sweden)

S. Balaji

2014-01-01

Full Text Available A Legendre wavelet operational matrix method (LWM is presented for the solution of nonlinear fractional-order Riccati differential equations, having variety of applications in quantum chemistry and quantum mechanics. The fractional-order Riccati differential equations converted into a system of algebraic equations using Legendre wavelet operational matrix. Solutions given by the proposed scheme are more accurate and reliable and they are compared with recently developed numerical, analytical, and stochastic approaches. Comparison shows that the proposed LWM approach has a greater performance and less computational effort for getting accurate solutions. Further existence and uniqueness of the proposed problem are given and moreover the condition of convergence is verified.

Noniterative Multireference Coupled Cluster Methods on Heterogeneous CPU-GPU Systems

Energy Technology Data Exchange (ETDEWEB)

Bhaskaran-Nair, Kiran; Ma, Wenjing; Krishnamoorthy, Sriram; Villa, Oreste; van Dam, Hubertus JJ; Apra, Edoardo; Kowalski, Karol

2013-04-09

A novel parallel algorithm for non-iterative multireference coupled cluster (MRCC) theories, which merges recently introduced reference-level parallelism (RLP) [K. Bhaskaran-Nair, J.Brabec, E. Aprà, H.J.J. van Dam, J. Pittner, K. Kowalski, J. Chem. Phys. 137, 094112 (2012)] with the possibility of accelerating numerical calculations using graphics processing unit (GPU) is presented. We discuss the performance of this algorithm on the example of the MRCCSD(T) method (iterative singles and doubles and perturbative triples), where the corrections due to triples are added to the diagonal elements of the MRCCSD (iterative singles and doubles) effective Hamiltonian matrix. The performance of the combined RLP/GPU algorithm is illustrated on the example of the Brillouin-Wigner (BW) and Mukherjee (Mk) state-specific MRCCSD(T) formulations.

Matrix-variational method: an efficient approach to bound state eigenproblems

International Nuclear Information System (INIS)

Gerck, E.; d'Oliveira, A.B.

1978-11-01

A new matrix-variational method for solving the radial Schroedinger equation is described. It consists in obtaining an adjustable matrix formulation for the boundary value differential equation, using a set of three functions that obey the boundary conditions. These functions are linearly combined at every three adjacents points to fit the true unknown eigenfunction by a variational technique. With the use of a new class of central differences, the exponential differences, tridiagonal or bidiagonal matrices are obtained. In the bidiagonal case, closed form expressions for the eigenvalues are given for the Coulomb, harmonic, linear, square-root and logarithmic potentials. The values obtained are within 0.1% of the true numerical value. The eigenfunction can be calculated using the eigenvectors to reconstruct the linear combination of the set functions [pt

DGTD analysis of EM interactions on microwave systems loaded with circuit interfaced thin wires

KAUST Repository

Li, Ping; Shi, Yifei; Bagci, Hakan

2016-01-01

method realizes “information exchange” between neighboring spatial discretization elements using numerical flux. Therefore all spatial operations are localized within a given element leading to a block-diagonal mass matrix which is inverted very

Response matrix method and its application to SCWR single channel stability analysis

International Nuclear Information System (INIS)

Zhao, Jiyun; Tseng, K.J.; Tso, C.P.

2011-01-01

To simulate the reactor system dynamic features during density wave oscillations (DWO), both the non-linear method and the linear method can be used. Although some transient information is lost through model linearization, the high computational efficiency and relatively accurate results make the linear analysis methodology attractive, especially for prediction of the onset of instability. In the linear stability analysis, the system models are simplified through linearization of the complex non-linear differential equations, and then, the linear differential equations are generally solved in the frequency domain through Laplace transformation. In this paper, a system response matrix method was introduced by directly solving the differential equations in the time domain. By using a system response matrix method, the complicated transfer function derivation, which must be done in the frequency domain method, can be avoided. Using the response matrix method, a model was developed and applied to the single channel or parallel channel type instability analyses of the typical proposed SCWR design. The sensitivity of the decay ratio (DR) to the axial mesh size was analyzed and it was found that the DR is not sensitive to mesh size once sufficient number of axial nodes is applied. To demonstrate the effects of the inlet orificing to the stability feature for the supercritical condition, the sensitivity of the stability to inlet orifice coefficient was conducted for hot channel. It is clearly shown that a higher inlet orifice coefficient will make the system more stable. The susceptibility of stability to operating parameters such as mass flow rate, power and system pressure was also performed. And the measure to improve the SCWR stability sensitivity to operating parameters was investigated. It was found that the SCWR stability sensitivity feature can be improved by carefully managing the inlet orifices and choosing proper operating parameters. (author)

Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion

Directory of Open Access Journals (Sweden)

Donghao Wang

2016-09-01

Full Text Available To obtain efficient data gathering methods for wireless sensor networks (WSNs, a novel graph based transform regularized (GBTR matrix completion algorithm is proposed. The graph based transform sparsity of the sensed data is explored, which is also considered as a penalty term in the matrix completion problem. The proposed GBTR-ADMM algorithm utilizes the alternating direction method of multipliers (ADMM in an iterative procedure to solve the constrained optimization problem. Since the performance of the ADMM method is sensitive to the number of constraints, the GBTR-A2DM2 algorithm obtained to accelerate the convergence of GBTR-ADMM. GBTR-A2DM2 benefits from merging two constraint conditions into one as well as using a restart rule. The theoretical analysis shows the proposed algorithms obtain satisfactory time complexity. Extensive simulation results verify that our proposed algorithms outperform the state of the art algorithms for data collection problems in WSNs in respect to recovery accuracy, convergence rate, and energy consumption.

ECAP – New consolidation method for production of aluminium matrix composites with ceramic reinforcement