Infinite matrices and sequence spaces

CERN Document Server

Cooke, Richard G

2014-01-01

This clear and correct summation of basic results from a specialized field focuses on the behavior of infinite matrices in general, rather than on properties of special matrices. Three introductory chapters guide students to the manipulation of infinite matrices, covering definitions and preliminary ideas, reciprocals of infinite matrices, and linear equations involving infinite matrices.From the fourth chapter onward, the author treats the application of infinite matrices to the summability of divergent sequences and series from various points of view. Topics include consistency, mutual consi

Newton's method for solving a quadratic matrix equation with special coefficient matrices

International Nuclear Information System (INIS)

Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min

2014-01-01

We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)

Hierarchical matrices algorithms and analysis

CERN Document Server

Hackbusch, Wolfgang

2015-01-01

This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...

Introduction to matrices and vectors

CERN Document Server

Schwartz, Jacob T

2001-01-01

In this concise undergraduate text, the first three chapters present the basics of matrices - in later chapters the author shows how to use vectors and matrices to solve systems of linear equations. 1961 edition.

On the extreme value statistics of normal random matrices and 2D Coulomb gases: Universality and finite N corrections

Science.gov (United States)

Ebrahimi, R.; Zohren, S.

2018-03-01

In this paper we extend the orthogonal polynomials approach for extreme value calculations of Hermitian random matrices, developed by Nadal and Majumdar (J. Stat. Mech. P04001 arXiv:1102.0738), to normal random matrices and 2D Coulomb gases in general. Firstly, we show that this approach provides an alternative derivation of results in the literature. More precisely, we show convergence of the rescaled eigenvalue with largest modulus of a normal Gaussian ensemble to a Gumbel distribution, as well as universality for an arbitrary radially symmetric potential. Secondly, it is shown that this approach can be generalised to obtain convergence of the eigenvalue with smallest modulus and its universality for ring distributions. Most interestingly, the here presented techniques are used to compute all slowly varying finite N correction of the above distributions, which is important for practical applications, given the slow convergence. Another interesting aspect of this work is the fact that we can use standard techniques from Hermitian random matrices to obtain the extreme value statistics of non-Hermitian random matrices resembling the large N expansion used in context of the double scaling limit of Hermitian matrix models in string theory.

New Trace Bounds for the Product of Two Matrices and Their Applications in the Algebraic Riccati Equation

Directory of Open Access Journals (Sweden)

Liu Jianzhou

2009-01-01

Full Text Available By using singular value decomposition and majorization inequalities, we propose new inequalities for the trace of the product of two arbitrary real square matrices. These bounds improve and extend the recent results. Further, we give their application in the algebraic Riccati equation. Finally, numerical examples have illustrated that our results are effective and superior.

Flux Jacobian Matrices For Equilibrium Real Gases

Science.gov (United States)

Vinokur, Marcel

1990-01-01

Improved formulation includes generalized Roe average and extension to three dimensions. Flux Jacobian matrices derived for use in numerical solutions of conservation-law differential equations of inviscid flows of ideal gases extended to real gases. Real-gas formulation of these matrices retains simplifying assumptions of thermodynamic and chemical equilibrium, but adds effects of vibrational excitation, dissociation, and ionization of gas molecules via general equation of state.

Fungible Correlation Matrices: A Method for Generating Nonsingular, Singular, and Improper Correlation Matrices for Monte Carlo Research.

Science.gov (United States)

Waller, Niels G

2016-01-01

For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.

Quasi-linear landau kinetic equations for magnetized plasmas: compact propagator formalism, rotation matrices and interaction

International Nuclear Information System (INIS)

Misguich, J.H.

2004-04-01

As a first step toward a nonlinear renormalized description of turbulence phenomena in magnetized plasmas, the lowest order quasi-linear description is presented here from a unified point of view for collisionless as well as for collisional plasmas in a constant magnetic field. The quasi-linear approximation is applied to a general kinetic equation obtained previously from the Klimontovich exact equation, by means of a generalised Dupree-Weinstock method. The so-obtained quasi-linear description of electromagnetic turbulence in a magnetoplasma is applied to three separate physical cases: -) weak electrostatic turbulence, -) purely magnetic field fluctuations (the classical quasi-linear results are obtained for cosmic ray diffusion in the 'slab model' of magnetostatic turbulence in the solar wind), and -) collisional kinetic equations of magnetized plasmas. This mathematical technique has allowed us to derive basic kinetic equations for turbulent plasmas and collisional plasmas, respectively in the quasi-linear and Landau approximation. In presence of a magnetic field we have shown that the systematic use of rotation matrices describing the helical particle motion allows for a much more compact derivation than usually performed. Moreover, from the formal analogy between turbulent and collisional plasmas, the results derived here in detail for the turbulent plasmas, can be immediately translated to obtain explicit results for the Landau kinetic equation

Quasi-linear landau kinetic equations for magnetized plasmas: compact propagator formalism, rotation matrices and interaction

Energy Technology Data Exchange (ETDEWEB)

Misguich, J.H

2004-04-01

As a first step toward a nonlinear renormalized description of turbulence phenomena in magnetized plasmas, the lowest order quasi-linear description is presented here from a unified point of view for collisionless as well as for collisional plasmas in a constant magnetic field. The quasi-linear approximation is applied to a general kinetic equation obtained previously from the Klimontovich exact equation, by means of a generalised Dupree-Weinstock method. The so-obtained quasi-linear description of electromagnetic turbulence in a magnetoplasma is applied to three separate physical cases: -) weak electrostatic turbulence, -) purely magnetic field fluctuations (the classical quasi-linear results are obtained for cosmic ray diffusion in the 'slab model' of magnetostatic turbulence in the solar wind), and -) collisional kinetic equations of magnetized plasmas. This mathematical technique has allowed us to derive basic kinetic equations for turbulent plasmas and collisional plasmas, respectively in the quasi-linear and Landau approximation. In presence of a magnetic field we have shown that the systematic use of rotation matrices describing the helical particle motion allows for a much more compact derivation than usually performed. Moreover, from the formal analogy between turbulent and collisional plasmas, the results derived here in detail for the turbulent plasmas, can be immediately translated to obtain explicit results for the Landau kinetic equation.

Advanced incomplete factorization algorithms for Stiltijes matrices

Energy Technology Data Exchange (ETDEWEB)

Il`in, V.P. [Siberian Division RAS, Novosibirsk (Russian Federation)

1996-12-31

The modern numerical methods for solving the linear algebraic systems Au = f with high order sparse matrices A, which arise in grid approximations of multidimensional boundary value problems, are based mainly on accelerated iterative processes with easily invertible preconditioning matrices presented in the form of approximate (incomplete) factorization of the original matrix A. We consider some recent algorithmic approaches, theoretical foundations, experimental data and open questions for incomplete factorization of Stiltijes matrices which are {open_quotes}the best{close_quotes} ones in the sense that they have the most advanced results. Special attention is given to solving the elliptic differential equations with strongly variable coefficients, singular perturbated diffusion-convection and parabolic equations.

Numerical solutions of stochastic Lotka-Volterra equations via operational matrices

Directory of Open Access Journals (Sweden)

F. Hosseini Shekarabi

2016-03-01

Full Text Available In this paper, an efficient and convenient method for numerical solutions of stochastic Lotka-Volterra dynamical system is proposed. Here, we consider block pulse functions and their operational matrices of integration. Illustrative example is included to demonstrate the procedure and accuracy of the operational matrices based on block pulse functions.

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

Planck constant as spectral parameter in integrable systems and KZB equations

Science.gov (United States)

Levin, A.; Olshanetsky, M.; Zotov, A.

2014-10-01

We construct special rational gl N Knizhnik-Zamolodchikov-Bernard (KZB) equations with Ñ punctures by deformation of the corresponding quantum gl N rational R-matrix. They have two parameters. The limit of the first one brings the model to the ordinary rational KZ equation. Another one is τ. At the level of classical mechanics the deformation parameter τ allows to extend the previously obtained modified Gaudin models to the modified Schlesinger systems. Next, we notice that the identities underlying generic (elliptic) KZB equations follow from some additional relations for the properly normalized R-matrices. The relations are noncommutative analogues of identities for (scalar) elliptic functions. The simplest one is the unitarity condition. The quadratic (in R matrices) relations are generated by noncommutative Fay identities. In particular, one can derive the quantum Yang-Baxter equations from the Fay identities. The cubic relations provide identities for the KZB equations as well as quadratic relations for the classical r-matrices which can be treated as halves of the classical Yang-Baxter equation. At last we discuss the R-matrix valued linear problems which provide gl Ñ CM models and Painlevé equations via the above mentioned identities. The role of the spectral parameter plays the Planck constant of the quantum R-matrix. When the quantum gl N R-matrix is scalar ( N = 1) the linear problem reproduces the Krichever's ansatz for the Lax matrices with spectral parameter for the gl Ñ CM models. The linear problems for the quantum CM models generalize the KZ equations in the same way as the Lax pairs with spectral parameter generalize those without it.

Operational matrices with respect to Hermite polynomials and their applications in solving linear dierential equations with variable coecients

Directory of Open Access Journals (Sweden)

A. Aminataei

2014-05-01

Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method

On the wall-normal velocity of the compressible boundary-layer equations

Science.gov (United States)

Pruett, C. David

1991-01-01

Numerical methods for the compressible boundary-layer equations are facilitated by transformation from the physical (x,y) plane to a computational (xi,eta) plane in which the evolution of the flow is 'slow' in the time-like xi direction. The commonly used Levy-Lees transformation results in a computationally well-behaved problem for a wide class of non-similar boundary-layer flows, but it complicates interpretation of the solution in physical space. Specifically, the transformation is inherently nonlinear, and the physical wall-normal velocity is transformed out of the problem and is not readily recovered. In light of recent research which shows mean-flow non-parallelism to significantly influence the stability of high-speed compressible flows, the contribution of the wall-normal velocity in the analysis of stability should not be routinely neglected. Conventional methods extract the wall-normal velocity in physical space from the continuity equation, using finite-difference techniques and interpolation procedures. The present spectrally-accurate method extracts the wall-normal velocity directly from the transformation itself, without interpolation, leaving the continuity equation free as a check on the quality of the solution. The present method for recovering wall-normal velocity, when used in conjunction with a highly-accurate spectral collocation method for solving the compressible boundary-layer equations, results in a discrete solution which is extraordinarily smooth and accurate, and which satisfies the continuity equation nearly to machine precision. These qualities make the method well suited to the computation of the non-parallel mean flows needed by spatial direct numerical simulations (DNS) and parabolized stability equation (PSE) approaches to the analysis of stability.

Matrices in Engineering Problems

CERN Document Server

Tobias, Marvin

2011-01-01

This book is intended as an undergraduate text introducing matrix methods as they relate to engineering problems. It begins with the fundamentals of mathematics of matrices and determinants. Matrix inversion is discussed, with an introduction of the well known reduction methods. Equation sets are viewed as vector transformations, and the conditions of their solvability are explored. Orthogonal matrices are introduced with examples showing application to many problems requiring three dimensional thinking. The angular velocity matrix is shown to emerge from the differentiation of the 3-D orthogo

Normal and adjoint integral and integrodifferential neutron transport equations. Pt. 2

International Nuclear Information System (INIS)

Velarde, G.

1976-01-01

Using the simplifying hypotheses of the integrodifferential Boltzmann equations of neutron transport, given in JEN 334 report, several integral equations, and theirs adjoint ones, are obtained. Relations between the different normal and adjoint eigenfunctions are established and, in particular, proceeding from the integrodifferential Boltzmann equation it's found out the relation between the solutions of the adjoint equation of its integral one, and the solutions of the integral equation of its adjoint one (author)

On a computer implementation of the block Gauss–Seidel method for normal systems of equations

Directory of Open Access Journals (Sweden)

Alexander I. Zhdanov

2016-12-01

Full Text Available This article focuses on the modification of the block option Gauss-Seidel method for normal systems of equations, which is a sufficiently effective method of solving generally overdetermined, systems of linear algebraic equations of high dimensionality. The main disadvantage of methods based on normal equations systems is the fact that the condition number of the normal system is equal to the square of the condition number of the original problem. This fact has a negative impact on the rate of convergence of iterative methods based on normal equations systems. To increase the speed of convergence of iterative methods based on normal equations systems, for solving ill-conditioned problems currently different preconditioners options are used that reduce the condition number of the original system of equations. However, universal preconditioner for all applications does not exist. One of the effective approaches that improve the speed of convergence of the iterative Gauss–Seidel method for normal systems of equations, is to use its version of the block. The disadvantage of the block Gauss–Seidel method for production systems is the fact that it is necessary to calculate the pseudoinverse matrix for each iteration. We know that finding the pseudoinverse is a difficult computational procedure. In this paper, we propose a procedure to replace the matrix pseudo-solutions to the problem of normal systems of equations by Cholesky. Normal equations arising at each iteration of Gauss–Seidel method, have a relatively low dimension compared to the original system. The results of numerical experimentation demonstrating the effectiveness of the proposed approach are given.

The Modern Origin of Matrices and Their Applications

Science.gov (United States)

Debnath, L.

2014-01-01

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…

Characteristics of phosphorus adsorption by sediment mineral matrices with different particle sizes

Directory of Open Access Journals (Sweden)

Yang Xiao

2013-07-01

Full Text Available The particle size of sediment is one of the main factors that influence the phosphorus physical adsorption on sediment. In order to eliminate the effect of other components of sediment on the phosphorus physical adsorption the sediment mineral matrices were obtained by removing inorganic matter metal oxides, and organic matter from natural sediments, which were collected from the Nantong reach of the Yangtze River. The results show that an exponential relationship exists between the median particle size (D50 and specific surface area (Sg of the sediment mineral matrices, and the fine sediment mineral matrix sample has a larger specific surface area and pore volume than the coarse sediment particles. The kinetic equations were used to describe the phosphorus adsorption process of the sediment mineral matrices, including the Elovich equation, quasi-first-order adsorption kinetic equation, and quasi-second-order adsorption kinetic equation. The results show that the quasi-second-order adsorption kinetic equation has the best fitting effect. Using the mass conservation and Langmuir adsorption kinetic equations, a formula was deduced to calculate the equilibrium adsorption capacity of the sediment mineral matrices. The results of this study show that the phosphorus adsorption capacity decreases with the increase of D50, indicating that the specific surface area and pore volume are the main factors in determining the phosphorus adsorption capacity of the sediment mineral matrices. This study will help understand the important role of sediment in the transformation of phosphorus in aquatic environments.

On matrix fractional differential equations

Directory of Open Access Journals (Sweden)

Adem Kılıçman

2017-01-01

Full Text Available The aim of this article is to study the matrix fractional differential equations and to find the exact solution for system of matrix fractional differential equations in terms of Riemann–Liouville using Laplace transform method and convolution product to the Riemann–Liouville fractional of matrices. Also, we show the theorem of non-homogeneous matrix fractional partial differential equation with some illustrative examples to demonstrate the effectiveness of the new methodology. The main objective of this article is to discuss the Laplace transform method based on operational matrices of fractional derivatives for solving several kinds of linear fractional differential equations. Moreover, we present the operational matrices of fractional derivatives with Laplace transform in many applications of various engineering systems as control system. We present the analytical technique for solving fractional-order, multi-term fractional differential equation. In other words, we propose an efficient algorithm for solving fractional matrix equation.

Frequency filtering decompositions for unsymmetric matrices and matrices with strongly varying coefficients

Energy Technology Data Exchange (ETDEWEB)

Wagner, C.

1996-12-31

In 1992, Wittum introduced the frequency filtering decompositions (FFD), which yield a fast method for the iterative solution of large systems of linear equations. Based on this method, the tangential frequency filtering decompositions (TFFD) have been developed. The TFFD allow the robust and efficient treatment of matrices with strongly varying coefficients. The existence and the convergence of the TFFD can be shown for symmetric and positive definite matrices. For a large class of matrices, it is possible to prove that the convergence rate of the TFFD and of the FFD is independent of the number of unknowns. For both methods, schemes for the construction of frequency filtering decompositions for unsymmetric matrices have been developed. Since, in contrast to Wittums`s FFD, the TFFD needs only one test vector, an adaptive test vector can be used. The TFFD with respect to the adaptive test vector can be combined with other iterative methods, e.g. multi-grid methods, in order to improve the robustness of these methods. The frequency filtering decompositions have been successfully applied to the problem of the decontamination of a heterogeneous porous medium by flushing.

Normal Forms for Retarded Functional Differential Equations and Applications to Bogdanov-Takens Singularity

Science.gov (United States)

Faria, T.; Magalhaes, L. T.

The paper addresses, for retarded functional differential equations (FDEs), the computation of normal forms associated with the flow on a finite-dimensional invariant manifold tangent to invariant spaces for the infinitesimal generator of the linearized equation at a singularity. A phase space appropriate to the computation of these normal forms is introduced, and adequate nonresonance conditions for the computation of the normal forms are derived. As an application, the general situation of Bogdanov-Takens singularity and its versal unfolding for scalar retarded FDEs with nondegeneracy at second order is considered, both in the general case and in the case of differential-delay equations of the form ẋ( t) = ƒ( x( t), x( t-1)).

Intrinsic character of Stokes matrices

Science.gov (United States)

Gagnon, Jean-François; Rousseau, Christiane

2017-02-01

Two germs of linear analytic differential systems x k + 1Y‧ = A (x) Y with a non-resonant irregular singularity are analytically equivalent if and only if they have the same eigenvalues and equivalent collections of Stokes matrices. The Stokes matrices are the transition matrices between sectors on which the system is analytically equivalent to its formal normal form. Each sector contains exactly one separating ray for each pair of eigenvalues. A rotation in S allows supposing that R+ lies in the intersection of two sectors. Reordering of the coordinates of Y allows ordering the real parts of the eigenvalues, thus yielding triangular Stokes matrices. However, the choice of the rotation in x is not canonical. In this paper we establish how the collection of Stokes matrices depends on this rotation, and hence on a chosen order of the projection of the eigenvalues on a line through the origin.

Hypercyclic Abelian Semigroups of Matrices on Cn

International Nuclear Information System (INIS)

Ayadi, Adlene; Marzougui, Habib

2010-07-01

We give a complete characterization of existence of dense orbit for any abelian semigroup of matrices on C n . For finitely generated semigroups, this characterization is explicit and is used to determine the minimal number of matrices in normal form over C which forms a hypercyclic abelian semigroup on C n . In particular, we show that no abelian semigroup generated by n matrices on C n can be hypercyclic. (author)

Alternatives to the Dirac equation

International Nuclear Information System (INIS)

Girvin, S.M.; Brownstein, K.R.

1975-01-01

Recent work by Biedenharn, Han, and van Dam (BHvD) has questioned the uniqueness of the Dirac equation. BHvD have obtained a two-component equation as an alternate to the Dirac equation. Although they later show their alternative to be unitarily equivalent to the Dirac equation, certain physical differences were claimed. BHvD attribute the existence of this alternate equation to the fact that their factorizing matrices were position-dependent. To investigate this, we factor the Klein-Gordon equation in spherical coordinates allowing the factorizing matrices to depend arbitrarily upon theta and phi. It is shown that despite this additional freedom, and without involving any relativistic covariance, the conventional four-component Dirac equation is the only possibility

Spectra of sparse random matrices

International Nuclear Information System (INIS)

Kuehn, Reimer

2008-01-01

We compute the spectral density for ensembles of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of that suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaussians. It gives rise to a pair of integral equations which can be solved by a stochastic population-dynamics algorithm. Remarkably our representation allows us to identify pure-point contributions to the spectral density related to the existence of normalizable eigenstates. Our approach is not restricted to matrices defined on graphs with Poissonian degree distribution. Matrices defined on regular random graphs or on scale-free graphs, are easily handled. We also look at matrices with row constraints such as discrete graph Laplacians. Our approach naturally allows us to unfold the total density of states into contributions coming from vertices of different local coordinations and an example of such an unfolding is presented. Our results are well corroborated by numerical diagonalization studies of large finite random matrices

Two-mode Gaussian density matrices and squeezing of photons

International Nuclear Information System (INIS)

Tucci, R.R.

1992-01-01

In this paper, the authors generalize to 2-mode states the 1-mode state results obtained in a previous paper. The authors study 2-mode Gaussian density matrices. The authors find a linear transformation which maps the two annihilation operators, one for each mode, into two new annihilation operators that are uncorrelated and unsqueezed. This allows the authors to express the density matrix as a product of two 1-mode density matrices. The authors find general conditions under which 2-mode Gaussian density matrices become pure states. Possible pure states include the 2-mode squeezed pure states commonly mentioned in the literature, plus other pure states never mentioned before. The authors discuss the entropy and thermodynamic laws (Second Law, Fundamental Equation, and Gibbs-Duhem Equation) for the 2-mode states being considered

Nevanlinna theory, normal families, and algebraic differential equations

CERN Document Server

Steinmetz, Norbert

2017-01-01

This book offers a modern introduction to Nevanlinna theory and its intricate relation to the theory of normal families, algebraic functions, asymptotic series, and algebraic differential equations. Following a comprehensive treatment of Nevanlinna’s theory of value distribution, the author presents advances made since Hayman’s work on the value distribution of differential polynomials and illustrates how value- and pair-sharing problems are linked to algebraic curves and Briot–Bouquet differential equations. In addition to discussing classical applications of Nevanlinna theory, the book outlines state-of-the-art research, such as the effect of the Yosida and Zalcman–Pang method of re-scaling to algebraic differential equations, and presents the Painlevé–Yosida theorem, which relates Painlevé transcendents and solutions to selected 2D Hamiltonian systems to certain Yosida classes of meromorphic functions. Aimed at graduate students interested in recent developments in the field and researchers wor...

On a computer implementation of the block Gauss–Seidel method for normal systems of equations

OpenAIRE

Alexander I. Zhdanov; Ekaterina Yu. Bogdanova

2016-01-01

This article focuses on the modification of the block option Gauss-Seidel method for normal systems of equations, which is a sufficiently effective method of solving generally overdetermined, systems of linear algebraic equations of high dimensionality. The main disadvantage of methods based on normal equations systems is the fact that the condition number of the normal system is equal to the square of the condition number of the original problem. This fact has a negative impact on the rate o...

Consolidity analysis for fully fuzzy functions, matrices, probability and statistics

Directory of Open Access Journals (Sweden)

Walaa Ibrahim Gabr

2015-03-01

Full Text Available The paper presents a comprehensive review of the know-how for developing the systems consolidity theory for modeling, analysis, optimization and design in fully fuzzy environment. The solving of systems consolidity theory included its development for handling new functions of different dimensionalities, fuzzy analytic geometry, fuzzy vector analysis, functions of fuzzy complex variables, ordinary differentiation of fuzzy functions and partial fraction of fuzzy polynomials. On the other hand, the handling of fuzzy matrices covered determinants of fuzzy matrices, the eigenvalues of fuzzy matrices, and solving least-squares fuzzy linear equations. The approach demonstrated to be also applicable in a systematic way in handling new fuzzy probabilistic and statistical problems. This included extending the conventional probabilistic and statistical analysis for handling fuzzy random data. Application also covered the consolidity of fuzzy optimization problems. Various numerical examples solved have demonstrated that the new consolidity concept is highly effective in solving in a compact form the propagation of fuzziness in linear, nonlinear, multivariable and dynamic problems with different types of complexities. Finally, it is demonstrated that the implementation of the suggested fuzzy mathematics can be easily embedded within normal mathematics through building special fuzzy functions library inside the computational Matlab Toolbox or using other similar software languages.

Evolutionary Games with Randomly Changing Payoff Matrices

Science.gov (United States)

Yakushkina, Tatiana; Saakian, David B.; Bratus, Alexander; Hu, Chin-Kun

2015-06-01

Evolutionary games are used in various fields stretching from economics to biology. In most of these games a constant payoff matrix is assumed, although some works also consider dynamic payoff matrices. In this article we assume a possibility of switching the system between two regimes with different sets of payoff matrices. Potentially such a model can qualitatively describe the development of bacterial or cancer cells with a mutator gene present. A finite population evolutionary game is studied. The model describes the simplest version of annealed disorder in the payoff matrix and is exactly solvable at the large population limit. We analyze the dynamics of the model, and derive the equations for both the maximum and the variance of the distribution using the Hamilton-Jacobi equation formalism.

Classical r-matrices for the generalised Chern–Simons formulation of 3d gravity

Science.gov (United States)

Osei, Prince K.; Schroers, Bernd J.

2018-04-01

We study the conditions for classical r-matrices to be compatible with the generalised Chern–Simons action for 3d gravity. Compatibility means solving the classical Yang–Baxter equations with a prescribed symmetric part for each of the real Lie algebras and bilinear pairings arising in the generalised Chern–Simons action. We give a new construction of r-matrices via a generalised complexification and derive a non-linear set of matrix equations determining the most general compatible r-matrix. We exhibit new families of solutions and show that they contain some known r-matrices for special parameter values.

Manin matrices and Talalaev's formula

International Nuclear Information System (INIS)

Chervov, A; Falqui, G

2008-01-01

In this paper we study properties of Lax and transfer matrices associated with quantum integrable systems. Our point of view stems from the fact that their elements satisfy special commutation properties, considered by Yu I Manin some 20 years ago at the beginning of quantum group theory. These are the commutation properties of matrix elements of linear homomorphisms between polynomial rings; more explicitly these read: (1) elements of the same column commute; (2) commutators of the cross terms are equal: [M ij , M kl ] [M kj , M il ] (e.g. [M 11 , M 22 ] = [M 21 , M 12 ]). The main aim of this paper is twofold: on the one hand we observe and prove that such matrices (which we call Manin matrices in short) behave almost as well as matrices with commutative elements. Namely, the theorems of linear algebra (e.g., a natural definition of the determinant, the Cayley-Hamilton theorem, the Newton identities and so on and so forth) have a straightforward counterpart in the case of Manin matrices. On the other hand, we remark that such matrices are somewhat ubiquitous in the theory of quantum integrability. For instance, Manin matrices (and their q-analogs) include matrices satisfying the Yang-Baxter relation 'RTT=TTR' and the so-called Cartier-Foata matrices. Also, they enter Talalaev's remarkable formulae: det(∂ z -L gaudin (z)), det(1-e -∂z T Yangian (z)) for the 'quantum spectral curve', and appear in the separation of variables problem and Capelli identities. We show that theorems of linear algebra, after being established for such matrices, have various applications to quantum integrable systems and Lie algebras, e.g. in the construction of new generators in Z(U crit (gl-hat n )) (and, in general, in the construction of quantum conservation laws), in the Knizhnik-Zamolodchikov equation, and in the problem of Wick ordering. We propose, in the appendix, a construction of quantum separated variables for the XXX-Heisenberg system

Normal solutions of the Boltzmann equation with small Knudsen number

International Nuclear Information System (INIS)

Ding, E.J.; Huang, Z.Q.

1986-01-01

A singular perturbation method is used to find the normal solutions of the Boltzmann equation with small Knudsen number. It is proved that the secular terms may be removed by improving the Hilbert expansion and the Enskog expansion

On Investigating GMRES Convergence using Unitary Matrices

Czech Academy of Sciences Publication Activity Database

Duintjer Tebbens, Jurjen; Meurant, G.; Sadok, H.; Strakoš, Z.

2014-01-01

Roč. 450, 1 June (2014), s. 83-107 ISSN 0024-3795 Grant - others:GA AV ČR(CZ) M100301201; GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : GMRES convergence * unitary matrices * unitary spectra * normal matrices * Krylov residual subspace * Schur parameters Subject RIV: BA - General Mathematics Impact factor: 0.939, year: 2014

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

Science.gov (United States)

Saxena, N. K.

1974-01-01

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Invertibility and Explicit Inverses of Circulant-Type Matrices with k-Fibonacci and k-Lucas Numbers

Directory of Open Access Journals (Sweden)

Zhaolin Jiang

2014-01-01

Full Text Available Circulant matrices have important applications in solving ordinary differential equations. In this paper, we consider circulant-type matrices with the k-Fibonacci and k-Lucas numbers. We discuss the invertibility of these circulant matrices and present the explicit determinant and inverse matrix by constructing the transformation matrices, which generalizes the results in Shen et al. (2011.

Normalized modes at selected points without normalization

Science.gov (United States)

Kausel, Eduardo

2018-04-01

As every textbook on linear algebra demonstrates, the eigenvectors for the general eigenvalue problem | K - λM | = 0 involving two real, symmetric, positive definite matrices K , M satisfy some well-defined orthogonality conditions. Equally well-known is the fact that those eigenvectors can be normalized so that their modal mass μ =ϕT Mϕ is unity: it suffices to divide each unscaled mode by the square root of the modal mass. Thus, the normalization is the result of an explicit calculation applied to the modes after they were obtained by some means. However, we show herein that the normalized modes are not merely convenient forms of scaling, but that they are actually intrinsic properties of the pair of matrices K , M, that is, the matrices already "know" about normalization even before the modes have been obtained. This means that we can obtain individual components of the normalized modes directly from the eigenvalue problem, and without needing to obtain either all of the modes or for that matter, any one complete mode. These results are achieved by means of the residue theorem of operational calculus, a finding that is rather remarkable inasmuch as the residues themselves do not make use of any orthogonality conditions or normalization in the first place. It appears that this obscure property connecting the general eigenvalue problem of modal analysis with the residue theorem of operational calculus may have been overlooked up until now, but which has in turn interesting theoretical implications.Á

Topological expansion of the chain of matrices

International Nuclear Information System (INIS)

Eynard, B.; Ferrer, A. Prats

2009-01-01

We solve the loop equations to all orders in 1/N 2 , for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for the 1 and 2-matrix model, given by the symplectic invariants of [19]. As a consequence, we find the double scaling limit explicitly, and we discuss modular properties, large N asymptotics. We also briefly discuss the limit of an infinite chain of matrices (matrix quantum mechanics).

Inverse m-matrices and ultrametric matrices

CERN Document Server

Dellacherie, Claude; San Martin, Jaime

2014-01-01

The study of M-matrices, their inverses and discrete potential theory is now a well-established part of linear algebra and the theory of Markov chains. The main focus of this monograph is the so-called inverse M-matrix problem, which asks for a characterization of nonnegative matrices whose inverses are M-matrices. We present an answer in terms of discrete potential theory based on the Choquet-Deny Theorem. A distinguished subclass of inverse M-matrices is ultrametric matrices, which are important in applications such as taxonomy. Ultrametricity is revealed to be a relevant concept in linear algebra and discrete potential theory because of its relation with trees in graph theory and mean expected value matrices in probability theory. Remarkable properties of Hadamard functions and products for the class of inverse M-matrices are developed and probabilistic insights are provided throughout the monograph.

Procrustes Problems for General, Triangular, and Symmetric Toeplitz Matrices

Directory of Open Access Journals (Sweden)

Juan Yang

2013-01-01

Full Text Available The Toeplitz Procrustes problems are the least squares problems for the matrix equation AX=B over some Toeplitz matrix sets. In this paper the necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions of the Toeplitz Procrustes problems when the unknown matrices are constrained to the general, the triangular, and the symmetric Toeplitz matrices, respectively. The algorithms are designed and the numerical examples show that these algorithms are feasible.

Moment matrices, border bases and radical computation

NARCIS (Netherlands)

B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)

2013-01-01

htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and

Moment matrices, border bases and radical computation

NARCIS (Netherlands)

B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)

2011-01-01

htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and

Finiteness properties of congruence classes of infinite matrices

NARCIS (Netherlands)

Eggermont, R.H.

2014-01-01

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

The soliton solution of BBGKY quantum kinetic equations chain for different type particles system

International Nuclear Information System (INIS)

Rasulova, M.Yu.; Avazov, U.; Hassan, T.

2006-12-01

In the present paper on the basis of BBGKY chain of quantum kinetic equations the chain of equations for correlation matrices is derived, describing the evolution of a system of different types particles, which interact by pair potential. The series, which is the solution of this chain of equations for correlation matrices, is suggested. Using this series the solution of the last chain of equations is reduced to a solution of a set of homogeneous and nonhomogeneous von-Neumann's kinetic equations (analogue of Vlasov equations for quantum case). The first and second equations of this set of equations coincide with the first and second kinetic equations of the set, which is used in plasma physics. For an potential in the form of Dirac delta function, the solution of von-Neumann equation is defined through soliton solution of nonlinear Schrodinger equations. Based on von-Neumann equation one can define all terms of series, which is a solution of a chain of equations for correlation matrices. On the basis of these correlation matrices for a system of different types of particles we can define exact solution of BBGKY chain of quantum kinetic equations

Estimating structural equation models with non-normal variables by using transformations

NARCIS (Netherlands)

Montfort, van K.; Mooijaart, A.; Meijerink, F.

2009-01-01

We discuss structural equation models for non-normal variables. In this situation the maximum likelihood and the generalized least-squares estimates of the model parameters can give incorrect estimates of the standard errors and the associated goodness-of-fit chi-squared statistics. If the sample

Moment matrices, border bases and radical computation

NARCIS (Netherlands)

Lasserre, J.B.; Laurent, M.; Mourrain, B.; Rostalski, P.; Trébuchet, P.

2013-01-01

In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming its complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-definite

Nodal head method with matric operation in analysis of mine ventilation networks. Matrics kaiho wo mochiita setten ho ni yoru tsuki mo kaiseki

Energy Technology Data Exchange (ETDEWEB)

Sasaki, K.; Miyakoshi, H. (Akita Univ., Akita (Japan). Mining College); Kinoshita, H.; Onozuka, T. (Hanaoka Mining Co. Ltd., Akita (Japan))

1990-09-25

In this report, the method of analyzing mine ventilation networks is explained in which the direct matric operation method is applied to the solution of the linear equation system introduced from the fundamental equation of the nodal head method. In other words, the fundamental equation was expressed by genelarized equation composition by using connecting functions between nodes and the algorism of a computer program was clarified. And the calculation method necessary for other ventilation netwrks analysis was shown in a concrete form. For solving the linear equation system, the matric operation method based on the modified Choleski's method was used in order to speed up the calculation and stabilize the convergence process of the solution. As examples, calculation was made on the ventilation networks of total numbers of the nodes of 8, 14, 51 and 141. From these ventilation network analyses, using a linear equation system concerning the nodal pressure correction, it was found that in the system with convergence acceleration coefficient of 1.4, the number of sequential repeating frequency of approximation Mc which was required for convergence was in the order of Mc {approx equal} 13 (cycle) for the condition that the fan pressure was constant and the convergence condition was {vert bar} AQi {vert bar}{sub max} {lt} 0.1m {sup 3}/min. 14 refs., 12 figs., 3 tabs.

Solving Nonlinear Coupled Differential Equations

Science.gov (United States)

Mitchell, L.; David, J.

1986-01-01

Harmonic balance method developed to obtain approximate steady-state solutions for nonlinear coupled ordinary differential equations. Method usable with transfer matrices commonly used to analyze shaft systems. Solution to nonlinear equation, with periodic forcing function represented as sum of series similar to Fourier series but with form of terms suggested by equation itself.

Accelerating Matrix-Vector Multiplication on Hierarchical Matrices Using Graphical Processing Units

KAUST Repository

Boukaram, W.

2015-03-25

Large dense matrices arise from the discretization of many physical phenomena in computational sciences. In statistics very large dense covariance matrices are used for describing random fields and processes. One can, for instance, describe distribution of dust particles in the atmosphere, concentration of mineral resources in the earth\\'s crust or uncertain permeability coefficient in reservoir modeling. When the problem size grows, storing and computing with the full dense matrix becomes prohibitively expensive both in terms of computational complexity and physical memory requirements. Fortunately, these matrices can often be approximated by a class of data sparse matrices called hierarchical matrices (H-matrices) where various sub-blocks of the matrix are approximated by low rank matrices. These matrices can be stored in memory that grows linearly with the problem size. In addition, arithmetic operations on these H-matrices, such as matrix-vector multiplication, can be completed in almost linear time. Originally the H-matrix technique was developed for the approximation of stiffness matrices coming from partial differential and integral equations. Parallelizing these arithmetic operations on the GPU has been the focus of this work and we will present work done on the matrix vector operation on the GPU using the KSPARSE library.

Analysis of a renormalization group method and normal form theory for perturbed ordinary differential equations

Science.gov (United States)

DeVille, R. E. Lee; Harkin, Anthony; Holzer, Matt; Josić, Krešimir; Kaper, Tasso J.

2008-06-01

For singular perturbation problems, the renormalization group (RG) method of Chen, Goldenfeld, and Oono [Phys. Rev. E. 49 (1994) 4502-4511] has been shown to be an effective general approach for deriving reduced or amplitude equations that govern the long time dynamics of the system. It has been applied to a variety of problems traditionally analyzed using disparate methods, including the method of multiple scales, boundary layer theory, the WKBJ method, the Poincaré-Lindstedt method, the method of averaging, and others. In this article, we show how the RG method may be used to generate normal forms for large classes of ordinary differential equations. First, we apply the RG method to systems with autonomous perturbations, and we show that the reduced or amplitude equations generated by the RG method are equivalent to the classical Poincaré-Birkhoff normal forms for these systems up to and including terms of O(ɛ2), where ɛ is the perturbation parameter. This analysis establishes our approach and generalizes to higher order. Second, we apply the RG method to systems with nonautonomous perturbations, and we show that the reduced or amplitude equations so generated constitute time-asymptotic normal forms, which are based on KBM averages. Moreover, for both classes of problems, we show that the main coordinate changes are equivalent, up to translations between the spaces in which they are defined. In this manner, our results show that the RG method offers a new approach for deriving normal forms for nonautonomous systems, and it offers advantages since one can typically more readily identify resonant terms from naive perturbation expansions than from the nonautonomous vector fields themselves. Finally, we establish how well the solution to the RG equations approximates the solution of the original equations on time scales of O(1/ɛ).

Multiple Regression Analysis of Unconfined Compression Strength of Mine Tailings Matrices

Directory of Open Access Journals (Sweden)

Mahmood Ali A.

2017-01-01

Full Text Available As part of a novel approach of sustainable development of mine tailings, experimental and numerical analysis is carried out on newly formulated tailings matrices. Several physical characteristic tests are carried out including the unconfined compression strength test to ascertain the integrity of these matrices when subjected to loading. The current paper attempts a multiple regression analysis of the unconfined compressive strength test results of these matrices to investigate the most pertinent factors affecting their strength. Results of this analysis showed that the suggested equation is reasonably applicable to the range of binder combinations used.

Relativistic covariant wave equations and acausality in external fields

International Nuclear Information System (INIS)

Pijlgroms, R.B.J.

1980-01-01

The author considers linear, finite dimensional, first order relativistic wave equations: (βsup(μ)ideltasub(μ)-β)PSI(x) = 0 with βsup(μ) and β constant matrices. Firstly , the question of the relativistic covariance conditions on these equations is considered. Then the theory of these equations with β non-singular is summarized. Theories with βsup(μ), β square matrices and β singular are also discussed. Non-square systems of covariant relativistic wave equations for arbitrary spin > 1 are then considered. Finally, the interaction with external fields and the acausality problem are discussed. (G.T.H.)

Augmentation of DAA Staggered – Solution Equations in Underwater Shock Problems for Singular Structural Mass Matrices

Directory of Open Access Journals (Sweden)

John A. DeRuntz Jr.

2005-01-01

Full Text Available The numerical solution of underwater shock fluid – structure interaction problems using boundary element/finite element techniques became tractable through the development of the family of Doubly Asymptotic Approximations (DAA. Practical implementation of the method has relied on the so-called augmentation of the DAA equations. The fluid and structural systems are respectively coupled by the structural acceleration vector in the surface normal direction on the right hand side of the DAA equations, and the total pressure applied to the structural equations on its right hand side. By formally solving for the acceleration vector from the structural system and substituting it into its place in the DAA equations, the augmentation introduces a term involving the inverse of the structural mass matrix. However there exist at least two important classes of problems in which the structural mass matrix is singular. This paper develops a method to carry out the augmentation for such problems using a generalized inverse technique.

Determination of coefficient matrices for ARMA model

International Nuclear Information System (INIS)

Tran Dinh Tri.

1990-10-01

A new recursive algorithm for determining coefficient matrices of ARMA model from measured data is presented. The Yule-Walker equations for the case of ARMA model are derived from the ARMA innovation equation. The recursive algorithm is based on choosing appropriate form of the operator functions and suitable representation of the (n+1)-th order operator functions according to ones with the lower order. Two cases, when the order of the AR part is equal to one of the MA part, and the optimal case, were considered. (author) 5 refs

Drift-Diffusion Equation

Directory of Open Access Journals (Sweden)

K. Banoo

1998-01-01

equation in the discrete momentum space. This is shown to be similar to the conventional drift-diffusion equation except that it is a more rigorous solution to the Boltzmann equation because the current and carrier densities are resolved into M×1 vectors, where M is the number of modes in the discrete momentum space. The mobility and diffusion coefficient become M×M matrices which connect the M momentum space modes. This approach is demonstrated by simulating electron transport in bulk silicon.

Matrices and linear algebra

CERN Document Server

Schneider, Hans

1989-01-01

Linear algebra is one of the central disciplines in mathematics. A student of pure mathematics must know linear algebra if he is to continue with modern algebra or functional analysis. Much of the mathematics now taught to engineers and physicists requires it.This well-known and highly regarded text makes the subject accessible to undergraduates with little mathematical experience. Written mainly for students in physics, engineering, economics, and other fields outside mathematics, the book gives the theory of matrices and applications to systems of linear equations, as well as many related t

Lyapunov Functions and Solutions of the Lyapunov Matrix Equation for Marginally Stable Systems

DEFF Research Database (Denmark)

Kliem, Wolfhard; Pommer, Christian

2000-01-01

We consider linear systems of differential equations $I \\ddot{x}+B \\dot{x}+C{x}={0}$ where $I$ is the identity matrix and $B$ and $C$ are general complex $n$ x $n$ matrices. Our main interest is to determine conditions for complete marginalstability of these systems. To this end we find solutions...... of the Lyapunov matrix equation and characterize the set of matrices $(B, C)$ which guarantees marginal stability. The theory is applied to gyroscopic systems, to indefinite damped systems, and to circulatory systems, showing how to choose certain parameter matrices to get sufficient conditions for marginal...... stability.Comparison is made with some known results for equations with real system matrices.Moreover more general cases are investigated and several examples are given....

Hypersymmetric functions and Pochhammers of 2×2 nonautonomous matrices

Directory of Open Access Journals (Sweden)

A. F. Antippa

2004-01-01

Full Text Available We introduce the hypersymmetric functions of 2×2 nonautonomous matrices and show that they are related, by simple expressions, to the Pochhammers (factorial polynomials of these matrices. The hypersymmetric functions are generalizations of the associated elementary symmetric functions, and for a specific class of 2×2 matrices, having a high degree of symmetry, they reduce to these latter functions. This class of matrices includes rotations, Lorentz boosts, and discrete time generators for the harmonic oscillators. The hypersymmetric functions are defined over four sets of independent indeterminates using a triplet of interrelated binary partitions. We work out the algebra of this triplet of partitions and then make use of the results in order to simplify the expressions for the hypersymmetric functions for a special class of matrices. In addition to their obvious applications in matrix theory, in coupled difference equations, and in the theory of symmetric functions, the results obtained here also have useful applications in problems involving successive rotations, successive Lorentz transformations, discrete harmonic oscillators, and linear two-state systems.

A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications

Directory of Open Access Journals (Sweden)

Mahmood Ali A.

2016-01-01

Full Text Available As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices in terms of environmental sustainability are much higher when compared to normal sand matrices.

Basic quantum mechanics for three Dirac equations in a curved spacetime

International Nuclear Information System (INIS)

Arminjon, Mayeul

2010-01-01

We study the basic quantum mechanics for a fully general set of Dirac matrices in a curved spacetime by extending Pauli's method. We further extend this study to three versions of the Dirac equation: the standard (Dirac-Fock-Weyl or DFW) equation, and two alternative versions, both of which are based on the recently proposed linear tensor representations of the Dirac field (TRD). We begin with the current conservation: we show that the latter applies to any solution of the Dirac equation, if the field of Dirac matrices γμ satisfies a specific PDE. This equation is always satisfied for DFW with its restricted choice for the γμ matrices. It similarly restricts the choice of the γμ matrices for TRD. However, this restriction can be achieved. The frame dependence of a general Hamiltonian operator is studied. We show that in any given reference frame with minor restrictions on the spacetime metric, the axioms of quantum mechanics impose a unique form for the Hilbert space scalar product. Finally, the condition for the general Dirac Hamiltonian operator to be Hermitian is derived in a general curved spacetime. For DFW, the validity of this hermeticity condition depends on the choice of the γμ matrices. (author)

Solution of Large Systems of Linear Equations with Quadratic or Non-Quadratic Matrices and Deconvoiution of Spectra

Energy Technology Data Exchange (ETDEWEB)

Nygaard, K

1967-12-15

The numerical deconvolution of spectra is equivalent to the solution of a (large) system of linear equations with a matrix which is not necessarily a square matrix. The demand that the square sum of the residual errors shall be minimum is not in general sufficient to ensure a unique or 'sound' solution. Therefore other demands which may include the demand for minimum square errors are introduced which lead to 'sound' and 'non-oscillatory' solutions irrespective of the shape of the original matrix and of the determinant of the matrix of the normal equations.

Explicit Determinants of the RFPrLrR Circulant and RLPrFrL Circulant Matrices Involving Some Famous Numbers

Directory of Open Access Journals (Sweden)

Tingting Xu

2014-01-01

Full Text Available Circulant matrices may play a crucial role in solving various differential equations. In this paper, the techniques used herein are based on the inverse factorization of polynomial. We give the explicit determinants of the RFPrLrR circulant matrices and RLPrFrL circulant matrices involving Fibonacci, Lucas, Pell, and Pell-Lucas number, respectively.

Approximate Solution of LR Fuzzy Sylvester Matrix Equations

Directory of Open Access Journals (Sweden)

Xiaobin Guo

2013-01-01

Full Text Available The fuzzy Sylvester matrix equation AX~+X~B=C~ in which A,B are m×m and n×n crisp matrices, respectively, and C~ is an m×n LR fuzzy numbers matrix is investigated. Based on the Kronecker product of matrices, we convert the fuzzy Sylvester matrix equation into an LR fuzzy linear system. Then we extend the fuzzy linear system into two systems of linear equations according to the arithmetic operations of LR fuzzy numbers. The fuzzy approximate solution of the original fuzzy matrix equation is obtained by solving the crisp linear systems. The existence condition of the LR fuzzy solution is also discussed. Some examples are given to illustrate the proposed method.

About the solvability of matrix polynomial equations

OpenAIRE

Netzer, Tim; Thom, Andreas

2016-01-01

We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd degree with non-degenerate leading form can be solved in self-adjoint matrices. We also study equations of even degree and equations in many variables.

Loop equations in the theory of gravitation

International Nuclear Information System (INIS)

Makeenko, Yu.M.; Voronov, N.A.

1981-01-01

Loop-space variables (matrices of parallel transport) for the theory of gravitation are described. Loop equations, which are equivalent to the Einstein equations, are derived in the classical case. Loop equations are derived for gravity with cosmological constant as well. An analogy with the loop-space approach in Yang-Mills theory is discussed [ru

On matrix fractional differential equations

OpenAIRE

Adem Kılıçman; Wasan Ajeel Ahmood

2017-01-01

The aim of this article is to study the matrix fractional differential equations and to find the exact solution for system of matrix fractional differential equations in terms of Riemann–Liouville using Laplace transform method and convolution product to the Riemann–Liouville fractional of matrices. Also, we show the theorem of non-homogeneous matrix fractional partial differential equation with some illustrative examples to demonstrate the effectiveness of the new methodology. The main objec...

Investigating Equations Used to Design a Very Small Normal-Mode Helical Antenna in Free Space

Directory of Open Access Journals (Sweden)

Dang Tien Dung

2018-01-01

Full Text Available A normal-mode helical antenna (NMHA has been applied in some small devices such as tire pressure monitoring systems (TPMS and radio frequency identification (RFID tags. Previously, electrical characteristics of NMHA were obtained through electromagnetic simulations. In practical design of NMHA, equational expressions for the main electrical characteristics are more convenient. Electrical performances of NMHA can be expressed by a combination of a short dipole and small loops. Applicability of equations for a short dipole and a small loop to very small normal-mode helical antennas such as antennas around 1/100 wavelengths was not clear. In this paper, accuracies of equations for input resistances, antenna efficiency, and axial ratios are verified by comparisons with electromagnetic simulation results by FEKO software at 402 MHz. In addition, the structure of the antenna equal to 0.021 λ is fabricated, and measurements are performed to confirm the design accuracy.

Statistical mechanics of normal grain growth in one dimension: A partial integro-differential equation model

International Nuclear Information System (INIS)

Ng, Felix S.L.

2016-01-01

We develop a statistical-mechanical model of one-dimensional normal grain growth that does not require any drift-velocity parameterization for grain size, such as used in the continuity equation of traditional mean-field theories. The model tracks the population by considering grain sizes in neighbour pairs; the probability of a pair having neighbours of certain sizes is determined by the size-frequency distribution of all pairs. Accordingly, the evolution obeys a partial integro-differential equation (PIDE) over ‘grain size versus neighbour grain size’ space, so that the grain-size distribution is a projection of the PIDE's solution. This model, which is applicable before as well as after statistically self-similar grain growth has been reached, shows that the traditional continuity equation is invalid outside this state. During statistically self-similar growth, the PIDE correctly predicts the coarsening rate, invariant grain-size distribution and spatial grain size correlations observed in direct simulations. The PIDE is then reducible to the standard continuity equation, and we derive an explicit expression for the drift velocity. It should be possible to formulate similar parameterization-free models of normal grain growth in two and three dimensions.

The Invertibility, Explicit Determinants, and Inverses of Circulant and Left Circulant and g-Circulant Matrices Involving Any Continuous Fibonacci and Lucas Numbers

Directory of Open Access Journals (Sweden)

Zhaolin Jiang

2014-01-01

Full Text Available Circulant matrices play an important role in solving delay differential equations. In this paper, circulant type matrices including the circulant and left circulant and g-circulant matrices with any continuous Fibonacci and Lucas numbers are considered. Firstly, the invertibility of the circulant matrix is discussed and the explicit determinant and the inverse matrices by constructing the transformation matrices are presented. Furthermore, the invertibility of the left circulant and g-circulant matrices is also studied. We obtain the explicit determinants and the inverse matrices of the left circulant and g-circulant matrices by utilizing the relationship between left circulant, g-circulant matrices and circulant matrix, respectively.

Hermite interpolant multiscaling functions for numerical solution of the convection diffusion equations

Directory of Open Access Journals (Sweden)

Elmira Ashpazzadeh

2018-04-01

Full Text Available A numerical technique based on the Hermite interpolant multiscaling functions is presented for the solution of Convection-diusion equations. The operational matrices of derivative, integration and product are presented for multiscaling functions and are utilized to reduce the solution of linear Convection-diusion equation to the solution of algebraic equations. Because of sparsity of these matrices, this method is computationally very attractive and reduces the CPU time and computer memory. Illustrative examples are included to demonstrate the validity and applicability of the new technique.

Averaging operations on matrices

Indian Academy of Sciences (India)

2014-07-03

Jul 3, 2014 ... Role of Positive Definite Matrices. • Diffusion Tensor Imaging: 3 × 3 pd matrices model water flow at each voxel of brain scan. • Elasticity: 6 × 6 pd matrices model stress tensors. • Machine Learning: n × n pd matrices occur as kernel matrices. Tanvi Jain. Averaging operations on matrices ...

Augmentation of DAA Staggered – Solution Equations in Underwater Shock Problems for Singular Structural Mass Matrices

OpenAIRE

DeRuntz Jr., John A.

2005-01-01

The numerical solution of underwater shock fluid – structure interaction problems using boundary element/finite element techniques became tractable through the development of the family of Doubly Asymptotic Approximations (DAA). Practical implementation of the method has relied on the so-called augmentation of the DAA equations. The fluid and structural systems are respectively coupled by the structural acceleration vector in the surface normal direction on the right hand side of the DAA equa...

Discrete integration of continuous Kalman filtering equations for time invariant second-order structural systems

Science.gov (United States)

Park, K. C.; Belvin, W. Keith

1990-01-01

A general form for the first-order representation of the continuous second-order linear structural-dynamics equations is introduced to derive a corresponding form of first-order continuous Kalman filtering equations. Time integration of the resulting equations is carried out via a set of linear multistep integration formulas. It is shown that a judicious combined selection of computational paths and the undetermined matrices introduced in the general form of the first-order linear structural systems leads to a class of second-order discrete Kalman filtering equations involving only symmetric sparse N x N solution matrices.

A canonical form of the equation of motion of linear dynamical systems

Science.gov (United States)

Kawano, Daniel T.; Salsa, Rubens Goncalves; Ma, Fai; Morzfeld, Matthias

2018-03-01

The equation of motion of a discrete linear system has the form of a second-order ordinary differential equation with three real and square coefficient matrices. It is shown that, for almost all linear systems, such an equation can always be converted by an invertible transformation into a canonical form specified by two diagonal coefficient matrices associated with the generalized acceleration and displacement. This canonical form of the equation of motion is unique up to an equivalence class for non-defective systems. As an important by-product, a damped linear system that possesses three symmetric and positive definite coefficients can always be recast as an undamped and decoupled system.

VanderLaan Circulant Type Matrices

Directory of Open Access Journals (Sweden)

Hongyan Pan

2015-01-01

Full Text Available Circulant matrices have become a satisfactory tools in control methods for modern complex systems. In the paper, VanderLaan circulant type matrices are presented, which include VanderLaan circulant, left circulant, and g-circulant matrices. The nonsingularity of these special matrices is discussed by the surprising properties of VanderLaan numbers. The exact determinants of VanderLaan circulant type matrices are given by structuring transformation matrices, determinants of well-known tridiagonal matrices, and tridiagonal-like matrices. The explicit inverse matrices of these special matrices are obtained by structuring transformation matrices, inverses of known tridiagonal matrices, and quasi-tridiagonal matrices. Three kinds of norms and lower bound for the spread of VanderLaan circulant and left circulant matrix are given separately. And we gain the spectral norm of VanderLaan g-circulant matrix.

Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices

KAUST Repository

Lan, Shiwei

2017-11-08

Modeling covariance (and correlation) matrices is a challenging problem due to the large dimensionality and positive-definiteness constraint. In this paper, we propose a novel Bayesian framework based on decomposing the covariance matrix into variance and correlation matrices. The highlight is that the correlations are represented as products of vectors on unit spheres. We propose a variety of distributions on spheres (e.g. the squared-Dirichlet distribution) to induce flexible prior distributions for covariance matrices that go beyond the commonly used inverse-Wishart prior. To handle the intractability of the resulting posterior, we introduce the adaptive $\\\\Delta$-Spherical Hamiltonian Monte Carlo. We also extend our structured framework to dynamic cases and introduce unit-vector Gaussian process priors for modeling the evolution of correlation among multiple time series. Using an example of Normal-Inverse-Wishart problem, a simulated periodic process, and an analysis of local field potential data (collected from the hippocampus of rats performing a complex sequence memory task), we demonstrated the validity and effectiveness of our proposed framework for (dynamic) modeling covariance and correlation matrices.

Some remarks on unilateral matrix equations

International Nuclear Information System (INIS)

Cerchiai, Bianca L.; Zumino, Bruno

2001-01-01

We briefly review the results of our paper LBNL-46775: We study certain solutions of left-unilateral matrix equations. These are algebraic equations where the coefficients and the unknown are square matrices of the same order, or, more abstractly, elements of an associative, but possibly noncommutative algebra, and all coefficients are on the left. Recently such equations have appeared in a discussion of generalized Born-Infeld theories. In particular, two equations, their perturbative solutions and the relation between them are studied, applying a unified approach based on the generalized Bezout theorem for matrix polynomials

A simple algebraic cancer equation: calculating how cancers may arise with normal mutation rates

Directory of Open Access Journals (Sweden)

Shibata Darryl

2010-01-01

Full Text Available Abstract Background The purpose of this article is to present a relatively easy to understand cancer model where transformation occurs when the first cell, among many at risk within a colon, accumulates a set of driver mutations. The analysis of this model yields a simple algebraic equation, which takes as inputs the number of stem cells, mutation and division rates, and the number of driver mutations, and makes predictions about cancer epidemiology. Methods The equation [p = 1 - (1 - (1 - (1 - udkNm ] calculates the probability of cancer (p and contains five parameters: the number of divisions (d, the number of stem cells (N × m, the number of critical rate-limiting pathway driver mutations (k, and the mutation rate (u. In this model progression to cancer "starts" at conception and mutations accumulate with cell division. Transformation occurs when a critical number of rate-limiting pathway mutations first accumulates within a single stem cell. Results When applied to several colorectal cancer data sets, parameter values consistent with crypt stem cell biology and normal mutation rates were able to match the increase in cancer with aging, and the mutation frequencies found in cancer genomes. The equation can help explain how cancer risks may vary with age, height, germline mutations, and aspirin use. APC mutations may shorten pathways to cancer by effectively increasing the numbers of stem cells at risk. Conclusions The equation illustrates that age-related increases in cancer frequencies may result from relatively normal division and mutation rates. Although this equation does not encompass all of the known complexity of cancer, it may be useful, especially in a teaching setting, to help illustrate relationships between small and large cancer features.

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

Science.gov (United States)

Freund, Roland

1989-01-01

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Construction of alternative Hamiltonian structures for field equations

Energy Technology Data Exchange (ETDEWEB)

Herrera, Mauricio [Departamento de Fisica, Facultad de Ciencias Fisicas y Matematicas, Universidad de Chile, Santiago (Chile); Hojman, Sergio A. [Departamento de Fisica, Facultad de Ciencias, Universidad de Chile, Santiago (Chile); Facultad de Educacion, Universidad Nacional Andres Bello, Santiago (Chile); Centro de Recursos Educativos Avanzados, CREA, Santiago (Chile)

2001-08-10

We use symmetry vectors of nonlinear field equations to build alternative Hamiltonian structures. We construct such structures even for equations which are usually believed to be non-Hamiltonian such as heat, Burger and potential Burger equations. We improve on a previous version of the approach using recursion operators to increase the rank of the Poisson bracket matrices. Cole-Hopf and Miura-type transformations allow the mapping of these structures from one equation to another. (author)

Multiple normalized solutions for a planar gauged nonlinear Schrödinger equation

Science.gov (United States)

Luo, Xiao

2018-06-01

We study the existence, multiplicity, quantitative property and asymptotic behavior of normalized solutions for a gauged nonlinear Schrödinger equation arising from the Chern-Simons theory Δ u + ω u +|x|^2u+ λ ( {{h^2}(| x | )}/{{{| x | ^2}}} + \\int \\limits _{| x | }^{ + ∞} {{h(s)}/s} {u^2}(s)ds) u = {| u | ^{p - 2}}u,\\quad x\\in R^2, where ω \\in R, λ >0, p>4 and h(s) = 1/2\\int \\limits _0^s {r{u^2}(r)dr} . Combining constraint minimization method and minimax principle, we prove that the problem possesses at least two normalized solutions: One is a ground state and the other is an excited state. Furthermore, the asymptotic behavior and quantitative property of the ground state are analyzed.

Non-dense domain operator matrices and Cauchy problems

International Nuclear Information System (INIS)

Lalaoui Rhali, S.

2002-12-01

In this work, we study Cauchy problems with non-dense domain operator matrices. By assuming that the entries of an unbounded operator matrix are Hille-Yosida operators, we give a necessary and sufficient condition ensuring that the part of this operator matrix generates a semigroup in the closure of its domain. This allows us to prove the well-posedness of the corresponding Cauchy problem. Our results are applied to delay and neutral differential equations. (author)

A basis independent formulation of the connection between quark mass matrices, CP violation and experiment

International Nuclear Information System (INIS)

Jarlskog, C.; Stockholm Univ.; Bergen Univ.

1985-01-01

In the standard electroweak model, with three families, a one-to-one correspondence between certain determinants involving quark mass matrices (m and m' for charge 2/3 and -1/3 quarks respectively) and the presence/absence of CP violation is given. In an arbitrary basis for mass matrices, the quantity Im det[mm + , m'm' + ] appropriately normalized is introduced as a measure of CP violation. By this measure, CP is not maximally violated in any transition in Nature. Finally, constraints on quark mass matrices are derived from experiment. Any model of mass matrices, with the ambition to explain Nature, must satisfy these conditions. (orig.)

Loop equations and bootstrap methods in the lattice

Directory of Open Access Journals (Sweden)

Peter D. Anderson

2017-08-01

Full Text Available Pure gauge theories can be formulated in terms of Wilson Loops by means of the loop equation. In the large-N limit this equation closes in the expectation value of single loops. In particular, using the lattice as a regulator, it becomes a well defined equation for a discrete set of loops. In this paper we study different numerical approaches to solving this equation. Previous ideas gave good results in the strong coupling region. Here we propose an alternative method based on the observation that certain matrices ρˆ of Wilson loop expectation values are positive definite. They also have unit trace (ρˆ⪰0,Trρˆ=1, in fact they can be defined as reduced density matrices in the space of open loops after tracing over color indices and can be used to define an entropy associated with the loss of information due to such trace SWL=−Tr[ρˆln⁡ρˆ]. The condition that such matrices are positive definite allows us to study the weak coupling region which is relevant for the continuum limit. In the exactly solvable case of two dimensions this approach gives very good results by considering just a few loops. In four dimensions it gives good results in the weak coupling region and therefore is complementary to the strong coupling expansion. We compare the results with standard Monte Carlo simulations.

Finding column depedencies in sparse matrices over $ F_ 2 $ by block Wiedemann

NARCIS (Netherlands)

O. Penninga

1998-01-01

textabstractLarge systems of linear equations over $mathbb{F_2$ with sparse coefficient matrices have to be solved as a part of integer factorization with sieve-based methods such as in the Number Field Sieve algorithm. In this report, we first discuss the Wiedemann algorithm to solve these systems

New symmetries for the Dirac equation

International Nuclear Information System (INIS)

Linhares, C.A.; Mignaco, J.A.

1990-01-01

The Dirac equation in four dimension is studied describing fermions, both as 4 x 4 matrices and differential forms. It is discussed in both formalisms its properties under transformations of the group SU(4). (A.C.A.S.) [pt

Complex Wedge-Shaped Matrices: A Generalization of Jacobi Matrices

Czech Academy of Sciences Publication Activity Database

Hnětynková, Iveta; Plešinger, M.

2015-01-01

Roč. 487, 15 December (2015), s. 203-219 ISSN 0024-3795 R&D Projects: GA ČR GA13-06684S Keywords : eigenvalues * eigenvector * wedge-shaped matrices * generalized Jacobi matrices * band (or block) Krylov subspace methods Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015

Modeling Noisy Data with Differential Equations Using Observed and Expected Matrices

Science.gov (United States)

Deboeck, Pascal R.; Boker, Steven M.

2010-01-01

Complex intraindividual variability observed in psychology may be well described using differential equations. It is difficult, however, to apply differential equation models in psychological contexts, as time series are frequently short, poorly sampled, and have large proportions of measurement and dynamic error. Furthermore, current methods for…

Massively parallel red-black algorithms for x-y-z response matrix equations

International Nuclear Information System (INIS)

Hanebutte, U.R.; Laurin-Kovitz, K.; Lewis, E.E.

1992-01-01

Recently, both discrete ordinates and spherical harmonic (S n and P n ) methods have been cast in the form of response matrices. In x-y geometry, massively parallel algorithms have been developed to solve the resulting response matrix equations on the Connection Machine family of parallel computers, the CM-2, CM-200, and CM-5. These algorithms utilize two-cycle iteration on a red-black checkerboard. In this work we examine the use of massively parallel red-black algorithms to solve response matric equations in three dimensions. This longer term objective is to utilize massively parallel algorithms to solve S n and/or P n response matrix problems. In this exploratory examination, however, we consider the simple 6 x 6 response matrices that are derivable from fine-mesh diffusion approximations in three dimensions

The Dirac equation and the normalization of its solutions in a closed Friedmann- Robertson-Walker universe

Energy Technology Data Exchange (ETDEWEB)

Finster, Felix [NWF I-Mathematik, Universitaet Regensburg, D-93040 Regensburg (Germany); Reintjes, Moritz, E-mail: Felix.Finster@mathematik.uni-regensburg.d, E-mail: moritz@math.ucdavis.ed [Mathematics Department, University of California, Davis, CA 95616 (United States)

2009-05-21

We set up the Dirac equation in a Friedmann-Robertson-Walker geometry and separate the spatial and time variables. In the case of a closed universe, the spatial dependence is solved explicitly, giving rise to a discrete set of solutions. We compute the probability integral and analyze a spacetime normalization integral. This analysis allows us to introduce the fermionic projector in a closed Friedmann-Robertson-Walker geometry and to specify its global normalization as well as its local form.

The Dirac equation and the normalization of its solutions in a closed Friedmann- Robertson-Walker universe

International Nuclear Information System (INIS)

Finster, Felix; Reintjes, Moritz

2009-01-01

We set up the Dirac equation in a Friedmann-Robertson-Walker geometry and separate the spatial and time variables. In the case of a closed universe, the spatial dependence is solved explicitly, giving rise to a discrete set of solutions. We compute the probability integral and analyze a spacetime normalization integral. This analysis allows us to introduce the fermionic projector in a closed Friedmann-Robertson-Walker geometry and to specify its global normalization as well as its local form.

2D gravity and random matrices

International Nuclear Information System (INIS)

Zinn-Justin, J.

1990-01-01

Recent progress in 2D gravity coupled to d ≤ 1 matter, based on a representation of discrete gravity in terms of random matrices, is reported. The matrix problem can be solved in many cases by the introduction of suitable orthogonal polynomials. Alternatively in the continuum limit the orthogonal polynomial method can be shown to be equivalent to the construction of representation of the canonical commutation relations in terms of differential operators. In the case of pure gravity or discrete Ising-like matter the sum over topologies is reduced to the solution of non-linear differential equations. The d = 1 problem can be solved by semiclassical methods

Analiticity in fourth-order wave equations

International Nuclear Information System (INIS)

Bollini, C.G.; Giambiagi, J.J.

1987-01-01

In this paper it is presented, through a familiar example (δ-function potential in one dimension), the analytic properties of Jost functions associated with fourth-order equations. It is shown how to construct the Jost functions and the two discontinuity matrices associated with the line of singularities. The latter divide the complex k-plane in eight regions of analiticity. One of these matrices is related to the asymptotic behaviour of the scattering state. The other is not. Both are necessary to solve the inverse problem. Besides the usual poles related to bound states there are also other poles associated with total reflexion

Analiticity in fourth order wave equations

International Nuclear Information System (INIS)

Bollini, C.G.

1987-01-01

Through a familiar example (δ-function potential in one dimension) the analytic properties of Jost functions associated with fourth order equations are presented. It is shown how to construct the Jost functions and the two discontinuities matrices associated to the line of singularities. The latter divide the complex k-plane in eight regions of analiticity. One of these matrices is related to the asymptotic behaviour of scattering state. The other is not. Both being necessary to solve the inverse problem. Besides the usual poles related to bound states there are also other poles associated with total reflexion. (Author) [pt

On reflectionless equi-transmitting matrices

Directory of Open Access Journals (Sweden)

Pavel Kurasov

2014-01-01

Full Text Available Reflectionless equi-transmitting unitary matrices are studied in connection to matching conditions in quantum graphs. All possible such matrices of size 6 are described explicitly. It is shown that such matrices form 30 six-parameter families intersected along 12 five-parameter families closely connected to conference matrices.

Preparation and characterization of chitosan-heparin composite matrices for blood contacting tissue engineering

International Nuclear Information System (INIS)

He Qing; Gong Kai; Gong Yandao; Zhang Xiufang; Ao Qiang; Zhang Lihai; Hu Min

2010-01-01

Chitosan has been widely used for biomaterial scaffolds in tissue engineering because of its good mechanical properties and cytocompatibility. However, the poor blood compatibility of chitosan has greatly limited its biomedical utilization, especially for blood contacting tissue engineering. In this study, we exploited a polymer blending procedure to heparinize the chitosan material under simple and mild conditions to improve its antithrombogenic property. By an optimized procedure, a macroscopically homogeneous chitosan-heparin (Chi-Hep) blended suspension was obtained, with which Chi-Hep composite films and porous scaffolds were fabricated. X-ray photoelectron spectroscopy and sulfur elemental analysis confirmed the successful immobilization of heparin in the composite matrices (i.e. films and porous scaffolds). Toluidine blue staining indicated that heparin was distributed homogeneously in the composite matrices. Only a small amount of heparin was released from the matrices during incubation in normal saline for 10 days. The composite matrices showed improved blood compatibility, as well as good mechanical properties and endothelial cell compatibility. These results suggest that the Chi-Hep composite matrices are promising candidates for blood contacting tissue engineering.

The zero curvature form of integrable hierarchies in the Z x Z-matrices

NARCIS (Netherlands)

Helminck, G.F.; Opimakh, A.V.

2012-01-01

In this paper it is shown how one can associate to a finite number of commuting directions in the Lie algebra of upper triangular Z X Z-matrices an integrable hierarchy consisting of a set of evolution equations for perturbations of the basic directions inside the mentioned Lie algebra. They amount

External validation of equations to estimate resting energy expenditure in 14952 adults with overweight and obesity and 1948 adults with normal weight from Italy.

Science.gov (United States)

Bedogni, Giorgio; Bertoli, Simona; Leone, Alessandro; De Amicis, Ramona; Lucchetti, Elisa; Agosti, Fiorenza; Marazzi, Nicoletta; Battezzati, Alberto; Sartorio, Alessandro

2017-11-24

We cross-validated 28 equations to estimate resting energy expenditure (REE) in a very large sample of adults with overweight or obesity. 14952 Caucasian men and women with overweight or obesity and 1498 with normal weight were studied. REE was measured using indirect calorimetry and estimated using two meta-regression equations and 26 other equations. The correct classification fraction (CCF) was defined as the fraction of subjects whose estimated REE was within 10% of measured REE. The highest CCF was 79%, 80%, 72%, 64%, and 63% in subjects with normal weight, overweight, class 1 obesity, class 2 obesity, and class 3 obesity, respectively. The Henry weight and height and Mifflin equations performed equally well with CCFs of 77% vs. 77% for subjects with normal weight, 80% vs. 80% for those with overweight, 72% vs. 72% for those with class 1 obesity, 64% vs. 63% for those with class 2 obesity, and 61% vs. 60% for those with class 3 obesity. The Sabounchi meta-regression equations offered an improvement over the above equations only for class 3 obesity (63%). The accuracy of REE equations decreases with increasing values of body mass index. The Henry weight & height and Mifflin equations are similarly accurate and the Sabounchi equations offer an improvement only in subjects with class 3 obesity. Copyright © 2017 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism. All rights reserved.

Estimation of Fuzzy Measures Using Covariance Matrices in Gaussian Mixtures

Directory of Open Access Journals (Sweden)

Nishchal K. Verma

2012-01-01

Full Text Available This paper presents a novel computational approach for estimating fuzzy measures directly from Gaussian mixtures model (GMM. The mixture components of GMM provide the membership functions for the input-output fuzzy sets. By treating consequent part as a function of fuzzy measures, we derived its coefficients from the covariance matrices found directly from GMM and the defuzzified output constructed from both the premise and consequent parts of the nonadditive fuzzy rules that takes the form of Choquet integral. The computational burden involved with the solution of λ-measure is minimized using Q-measure. The fuzzy model whose fuzzy measures were computed using covariance matrices found in GMM has been successfully applied on two benchmark problems and one real-time electric load data of Indian utility. The performance of the resulting model for many experimental studies including the above-mentioned application is found to be better and comparable to recent available fuzzy models. The main contribution of this paper is the estimation of fuzzy measures efficiently and directly from covariance matrices found in GMM, avoiding the computational burden greatly while learning them iteratively and solving polynomial equations of order of the number of input-output variables.

How (not) to teach Lorentz covariance of the Dirac equation

International Nuclear Information System (INIS)

Nikolić, Hrvoje

2014-01-01

In the textbook proofs of the Lorentz covariance of the Dirac equation, one treats the wave function as a spinor and gamma matrices as scalars, leading to a quite complicated formalism with several pedagogic drawbacks. As an alternative, I propose to teach the Dirac equation and its Lorentz covariance by using a much simpler, but physically equivalent formalism, in which these drawbacks do not appear. In this alternative formalism, the wave function transforms as a scalar and gamma matrices as components of a vector, such that the standard physically relevant bilinear combinations do not change their transformation properties. The alternative formalism allows also a natural construction of some additional non-standard bilinear combinations with well-defined transformation properties. (paper)

Random-Effects Models for Meta-Analytic Structural Equation Modeling: Review, Issues, and Illustrations

Science.gov (United States)

Cheung, Mike W.-L.; Cheung, Shu Fai

2016-01-01

Meta-analytic structural equation modeling (MASEM) combines the techniques of meta-analysis and structural equation modeling for the purpose of synthesizing correlation or covariance matrices and fitting structural equation models on the pooled correlation or covariance matrix. Both fixed-effects and random-effects models can be defined in MASEM.…

Computing the real-time Green's Functions of large Hamiltonian matrices

OpenAIRE

Iitaka, Toshiaki

1998-01-01

A numerical method is developed for calculating the real time Green's functions of very large sparse Hamiltonian matrices, which exploits the numerical solution of the inhomogeneous time-dependent Schroedinger equation. The method has a clear-cut structure reflecting the most naive definition of the Green's functions, and is very suitable to parallel and vector supercomputers. The effectiveness of the method is illustrated by applying it to simple lattice models. An application of this method...

Dirac matrices for Chern-Simons gravity

Energy Technology Data Exchange (ETDEWEB)

Izaurieta, Fernando; Ramirez, Ricardo; Rodriguez, Eduardo [Departamento de Matematica y Fisica Aplicadas, Universidad Catolica de la Santisima Concepcion, Alonso de Ribera 2850, 4090541 Concepcion (Chile)

2012-10-06

A genuine gauge theory for the Poincare, de Sitter or anti-de Sitter algebras can be constructed in (2n- 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices {Gamma}{sub ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices {Gamma}{sub ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient {alpha}{sub s}. We then give a general algorithm that computes the {alpha}-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B{sup ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, 'minimal' algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.

The Dirac equation and the normalization of its solutions in a closed Friedmann- Robertson-Walker universe

Science.gov (United States)

Finster, Felix; Reintjes, Moritz

2009-05-01

We set up the Dirac equation in a Friedmann-Robertson-Walker geometry and separate the spatial and time variables. In the case of a closed universe, the spatial dependence is solved explicitly, giving rise to a discrete set of solutions. We compute the probability integral and analyze a spacetime normalization integral. This analysis allows us to introduce the fermionic projector in a closed Friedmann-Robertson-Walker geometry and to specify its global normalization as well as its local form. First author supported in part by the Deutsche Forschungsgemeinschaft.

Modified Chebyshev Collocation Method for Solving Differential Equations

Directory of Open Access Journals (Sweden)

M Ziaul Arif

2015-05-01

Full Text Available This paper presents derivation of alternative numerical scheme for solving differential equations, which is modified Chebyshev (Vieta-Lucas Polynomial collocation differentiation matrices. The Scheme of modified Chebyshev (Vieta-Lucas Polynomial collocation method is applied to both Ordinary Differential Equations (ODEs and Partial Differential Equations (PDEs cases. Finally, the performance of the proposed method is compared with finite difference method and the exact solution of the example. It is shown that modified Chebyshev collocation method more effective and accurate than FDM for some example given.

Covariant differential calculus on quantum Minkowski space and the q-analogue of Dirac equation

International Nuclear Information System (INIS)

Song Xingchang; Academia Sinica, Beijing

1992-01-01

The covariant differential calculus on the quantum Minkowski space is presented with the help of the generalized Wess-Zumino method and the quantum Pauli matrices and quantum Dirac matrices are constructed parallel to those in the classical case. Combining these two aspects a q-analogue of Dirac equation follows directly. (orig.)

Flavored quantum Boltzmann equations

International Nuclear Information System (INIS)

Cirigliano, Vincenzo; Lee, Christopher; Ramsey-Musolf, Michael J.; Tulin, Sean

2010-01-01

We derive from first principles, using nonequilibrium field theory, the quantum Boltzmann equations that describe the dynamics of flavor oscillations, collisions, and a time-dependent mass matrix in the early universe. Working to leading nontrivial order in ratios of relevant time scales, we study in detail a toy model for weak-scale baryogenesis: two scalar species that mix through a slowly varying time-dependent and CP-violating mass matrix, and interact with a thermal bath. This model clearly illustrates how the CP asymmetry arises through coherent flavor oscillations in a nontrivial background. We solve the Boltzmann equations numerically for the density matrices, investigating the impact of collisions in various regimes.

Systematics of quark mass matrices in the standard electroweak model

International Nuclear Information System (INIS)

Frampton, P.H.; Jarlskog, C.; Stockholm Univ.

1985-01-01

It is shown that the quark mass matrices in the standard electroweak model satisfy the empirical relation M = M' + O(lambda 2 ), where M(M') refers to the mass matrix of the charge 2/3 (-1/3) quarks normalized to the largest eigenvalue, msub(t) (msub(b)), and lambda = Vsub(us) approx.= 0.22. (orig.)

Discrete ordinate solution of the radiative transfer equation in the 'polarization normal wave representation'

Science.gov (United States)

Kylling, A.

1991-01-01

The transfer equations for normal waves in finite, inhomogeneous and plane-parallel magnetoactive media are solved using the discrete ordinate method. The physical process of absorption, emission, and multiple scattering are accounted for, and the medium may be forced both at the top and bottom boundary by anisotropic radiation as well as by internal anisotropic sources. The computational procedure is numerically stable for arbitrarily large optical depths, and the computer time is independent of optical thickness.

Double stochastic matrices in quantum mechanics

International Nuclear Information System (INIS)

Louck, J.D.

1997-01-01

The general set of doubly stochastic matrices of order n corresponding to ordinary nonrelativistic quantum mechanical transition probability matrices is given. Lande's discussion of the nonquantal origin of such matrices is noted. Several concrete examples are presented for elementary and composite angular momentum systems with the focus on the unitary symmetry associated with such systems in the spirit of the recent work of Bohr and Ulfbeck. Birkhoff's theorem on doubly stochastic matrices of order n is reformulated in a geometrical language suitable for application to the subset of quantum mechanical doubly stochastic matrices. Specifically, it is shown that the set of points on the unit sphere in cartesian n'-space is subjective with the set of doubly stochastic matrices of order n. The question is raised, but not answered, as to what is the subset of points of this unit sphere that correspond to the quantum mechanical transition probability matrices, and what is the symmetry group of this subset of matrices

Neutrino mass matrices with vanishing determinant

International Nuclear Information System (INIS)

Chauhan, Bhag C.; Pulido, Joao; Picariello, Marco

2006-01-01

We investigate the prospects for neutrinoless double beta decay, texture zeros. and equalities between neutrino mass matrix elements in scenarios with vanishing determinant mass matrices for vanishing and finite θ 13 mixing angles in normal and inverse mass hierarchies. For normal hierarchy and both zero and finite θ 13 it is found that neutrinoless double beta decay cannot be observed by any of the present or next generation experiments, while for inverse hierarchy it is, on the contrary, accessible to experiments. Regarding texture zeros and equalities between mass matrix elements, we find that in both normal and inverse hierarchies with θ 13 =0 no texture zeros nor any such equalities can exist apart from the obvious ones. For θ 13 ≠0 some texture zeros become possible. In normal hierarchy two texture zeros occur if 8.1x10 -2 ≤sinθ 13 ≤9.1x10 -2 while in inverse hierarchy three are possible, one with sinθ 13 ≥7x10 -3 and two others with sinθ 13 ≥0.18. All equalities between mass matrix elements are impossible with θ 13 ≠0

Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices

Science.gov (United States)

Monajemi, Hatef; Jafarpour, Sina; Gavish, Matan; Donoho, David L.; Ambikasaran, Sivaram; Bacallado, Sergio; Bharadia, Dinesh; Chen, Yuxin; Choi, Young; Chowdhury, Mainak; Chowdhury, Soham; Damle, Anil; Fithian, Will; Goetz, Georges; Grosenick, Logan; Gross, Sam; Hills, Gage; Hornstein, Michael; Lakkam, Milinda; Lee, Jason; Li, Jian; Liu, Linxi; Sing-Long, Carlos; Marx, Mike; Mittal, Akshay; Monajemi, Hatef; No, Albert; Omrani, Reza; Pekelis, Leonid; Qin, Junjie; Raines, Kevin; Ryu, Ernest; Saxe, Andrew; Shi, Dai; Siilats, Keith; Strauss, David; Tang, Gary; Wang, Chaojun; Zhou, Zoey; Zhu, Zhen

2013-01-01

In compressed sensing, one takes samples of an N-dimensional vector using an matrix A, obtaining undersampled measurements . For random matrices with independent standard Gaussian entries, it is known that, when is k-sparse, there is a precisely determined phase transition: for a certain region in the (,)-phase diagram, convex optimization typically finds the sparsest solution, whereas outside that region, it typically fails. It has been shown empirically that the same property—with the same phase transition location—holds for a wide range of non-Gaussian random matrix ensembles. We report extensive experiments showing that the Gaussian phase transition also describes numerous deterministic matrices, including Spikes and Sines, Spikes and Noiselets, Paley Frames, Delsarte-Goethals Frames, Chirp Sensing Matrices, and Grassmannian Frames. Namely, for each of these deterministic matrices in turn, for a typical k-sparse object, we observe that convex optimization is successful over a region of the phase diagram that coincides with the region known for Gaussian random matrices. Our experiments considered coefficients constrained to for four different sets , and the results establish our finding for each of the four associated phase transitions. PMID:23277588

Matrices and linear transformations

CERN Document Server

Cullen, Charles G

1990-01-01

""Comprehensive . . . an excellent introduction to the subject."" - Electronic Engineer's Design Magazine.This introductory textbook, aimed at sophomore- and junior-level undergraduates in mathematics, engineering, and the physical sciences, offers a smooth, in-depth treatment of linear algebra and matrix theory. The major objects of study are matrices over an arbitrary field. Contents include Matrices and Linear Systems; Vector Spaces; Determinants; Linear Transformations; Similarity: Part I and Part II; Polynomials and Polynomial Matrices; Matrix Analysis; and Numerical Methods. The first

Lambda-matrices and vibrating systems

CERN Document Server

Lancaster, Peter; Stark, M; Kahane, J P

1966-01-01

Lambda-Matrices and Vibrating Systems presents aspects and solutions to problems concerned with linear vibrating systems with a finite degrees of freedom and the theory of matrices. The book discusses some parts of the theory of matrices that will account for the solutions of the problems. The text starts with an outline of matrix theory, and some theorems are proved. The Jordan canonical form is also applied to understand the structure of square matrices. Classical theorems are discussed further by applying the Jordan canonical form, the Rayleigh quotient, and simple matrix pencils with late

A program for calculating load coefficient matrices utilizing the force summation method, L218 (LOADS). Volume 1: Engineering and usage

Science.gov (United States)

Miller, R. D.; Anderson, L. R.

1979-01-01

The LOADS program L218, a digital computer program that calculates dynamic load coefficient matrices utilizing the force summation method, is described. The load equations are derived for a flight vehicle in straight and level flight and excited by gusts and/or control motions. In addition, sensor equations are calculated for use with an active control system. The load coefficient matrices are calculated for the following types of loads: translational and rotational accelerations, velocities, and displacements; panel aerodynamic forces; net panel forces; shears and moments. Program usage and a brief description of the analysis used are presented. A description of the design and structure of the program to aid those who will maintain and/or modify the program in the future is included.

Twisted traces of quantum intertwiners and quantum dynamical R-matrices corresponding to generalized Belavin-Drinfeld triples

International Nuclear Information System (INIS)

Etingof, P.; Massachusetts Inst. of Tech., Cambridge, MA; Schiffmann, O.

2001-01-01

We consider weighted traces of products of intertwining operators for quantum groups U q (g), suitably twisted by a ''generalized Belavin-Drinfeld triple''. We derive two commuting sets of difference equations - the (twisted) Macdonald-Ruijsenaars system and the (twisted) quantum Knizhnik-Zamolodchikov-Bernard (qKZB) system. These systems involve the nonstandard quantum R-matrices defined in a previous joint work with T. Schedler (2000). When the generalized Belavin-Drinfeld triple comes from an automorphism of the Lie algebra g, we also derive two additional sets of difference equations, the dual Macdonald-Ruijsenaars system and the dual qKZB equations. (orig.)

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Science.gov (United States)

Freund, Roland

1988-01-01

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Harmonic R-matrices for scattering amplitudes and spectral regularization

Energy Technology Data Exchange (ETDEWEB)

Ferro, Livia; Plefka, Jan [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Lukowski, Tomasz [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Univ. Berlin (Germany). IRIS Adlershof; Meneghelli, Carlo [Hamburg Univ. (Germany). Fachbereich 11 - Mathematik; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Staudacher, Matthias [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Max-Planck-Institut fuer Gravitationsphysik (Albert-Einstein-Institut), Potsdam (Germany)

2012-12-15

Planar N=4 super Yang-Mills appears to be integrable. While this allows to find this theory's exact spectrum, integrability has hitherto been of no direct use for scattering amplitudes. To remedy this, we deform all scattering amplitudes by a spectral parameter. The deformed tree-level four-point function turns out to be essentially the one-loop R-matrix of the integrable N=4 spin chain satisfying the Yang-Baxter equation. Deformed on-shell three-point functions yield novel three-leg R-matrices satisfying bootstrap equations. Finally, we supply initial evidence that the spectral parameter might find its use as a novel symmetry-respecting regulator replacing dimensional regularization. Its physical meaning is a local deformation of particle helicity, a fact which might be useful for a much larger class of non-integrable four-dimensional field theories.

Comparison of SUVs normalized by lean body mass determined by CT with those normalized by lean body mass estimated by predictive equations in normal tissues

Energy Technology Data Exchange (ETDEWEB)

Kim, Woo Hyoung; Kim, Chang Guhn; Kim, Dae Weung [Wonkwang Univ. School of Medicine, Iksan (Korea, Republic of)

2012-09-15

Standardized uptake values (SUVs)normalized by lean body mass (LBM)determined by CT were compared with those normalized by LBM estimated using predictive equations (PEs)in normal liver, spleen, and aorta using {sup 18}F FDG PET/CT. Fluorine 18 fluorodeoxyglucose (F FDG)positron emission tomography/computed tomography (PET/CT)was conducted on 453 patients. LBM determined by CT was defined in 3 ways (LBM{sup CT1}-3). Five PEs were used for comparison (LBM{sup PE1}-5). Tissue SUV normalized by LBM (SUL) was calculated using LBM from each method (SUL{sup CT1}-3, SUL{sup PE1}-5). Agreement between methods was assessed by Bland Altman analysis. Percentage difference and percentage error were also calculated. For all liver SUL{sup CTS} vs. liver SUL{sup PES} except liver SUL{sup PE3}, the range of biases, SDs of percentage difference and percentage errors were -0.17-0.24 SUL, 6.15-10.17%, and 25.07-38.91%, respectively. For liver SUL{sup CTs} vs. liver SUL{sup PE3}, the corresponding figures were 0.47-0.69 SUL, 10.90-11.25%, and 50.85-51.55%, respectively, showing the largest percentage errors and positive biases. Irrespective of magnitudes of the biases, large percentage errors of 25.07-51.55% were observed between liver SUL{sup CT1}-3 and liver SUL{sup PE1}-5. The results of spleen and aorta SUL{sup CTs} and SUL{sup PEs} comparison were almost identical to those for liver. The present study demonstrated substantial errors in individual SUL{sup PEs} compared with SUL{sup CTs} as a reference value. Normalization of SUV by LBM determined by CT rather than PEs may be a useful approach to reduce errors in individual SUL{sup PEs}.

Comparison of SUVs normalized by lean body mass determined by CT with those normalized by lean body mass estimated by predictive equations in normal tissues

International Nuclear Information System (INIS)

Kim, Woo Hyoung; Kim, Chang Guhn; Kim, Dae Weung

2012-01-01

Standardized uptake values (SUVs)normalized by lean body mass (LBM)determined by CT were compared with those normalized by LBM estimated using predictive equations (PEs)in normal liver, spleen, and aorta using 18 F FDG PET/CT. Fluorine 18 fluorodeoxyglucose (F FDG)positron emission tomography/computed tomography (PET/CT)was conducted on 453 patients. LBM determined by CT was defined in 3 ways (LBM CT1 -3). Five PEs were used for comparison (LBM PE1 -5). Tissue SUV normalized by LBM (SUL) was calculated using LBM from each method (SUL CT1 -3, SUL PE1 -5). Agreement between methods was assessed by Bland Altman analysis. Percentage difference and percentage error were also calculated. For all liver SUL CTS vs. liver SUL PES except liver SUL PE3 , the range of biases, SDs of percentage difference and percentage errors were -0.17-0.24 SUL, 6.15-10.17%, and 25.07-38.91%, respectively. For liver SUL CTs vs. liver SUL PE3 , the corresponding figures were 0.47-0.69 SUL, 10.90-11.25%, and 50.85-51.55%, respectively, showing the largest percentage errors and positive biases. Irrespective of magnitudes of the biases, large percentage errors of 25.07-51.55% were observed between liver SUL CT1 -3 and liver SUL PE1 -5. The results of spleen and aorta SUL CTs and SUL PEs comparison were almost identical to those for liver. The present study demonstrated substantial errors in individual SUL PEs compared with SUL CTs as a reference value. Normalization of SUV by LBM determined by CT rather than PEs may be a useful approach to reduce errors in individual SUL PEs

MERSENNE AND HADAMARD MATRICES CALCULATION BY SCARPIS METHOD

Directory of Open Access Journals (Sweden)

N. A. Balonin

2014-05-01

Full Text Available Purpose. The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximum determinant matrices or not optimal by determinant matrices with orthogonal columns (weighing matrices, Mersenne and Euler matrices, ets.; calculation methods for the quasi-orthogonal local maximum determinant Mersenne matrices are not studied enough sufficiently. The goal of this paper is to develop the theory of Mersenne and Hadamard matrices on the base of generalized Scarpis method research. Methods. Extreme solutions are found in general by minimization of maximum for absolute values of the elements of studied matrices followed by their subsequent classification according to the quantity of levels and their values depending on orders. Less universal but more effective methods are based on structural invariants of quasi-orthogonal matrices (Silvester, Paley, Scarpis methods, ets.. Results. Generalizations of Hadamard and Belevitch matrices as a family of quasi-orthogonal matrices of odd orders are observed; they include, in particular, two-level Mersenne matrices. Definitions of section and layer on the set of generalized matrices are proposed. Calculation algorithms for matrices of adjacent layers and sections by matrices of lower orders are described. Approximation examples of the Belevitch matrix structures up to 22-nd critical order by Mersenne matrix of the third order are given. New formulation of the modified Scarpis method to approximate Hadamard matrices of high orders by lower order Mersenne matrices is proposed. Williamson method is described by example of one modular level matrices approximation by matrices with a small number of levels. Practical relevance. The efficiency of developing direction for the band-pass filters creation is justified. Algorithms for Mersenne matrices design by Scarpis method are used in developing software of the research program complex. Mersenne filters are based on the suboptimal by

Iterative solution of large sparse systems of equations

CERN Document Server

Hackbusch, Wolfgang

2016-01-01

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

Location Prediction Based on Transition Probability Matrices Constructing from Sequential Rules for Spatial-Temporal K-Anonymity Dataset

Science.gov (United States)

Liu, Zhao; Zhu, Yunhong; Wu, Chenxue

2016-01-01

Spatial-temporal k-anonymity has become a mainstream approach among techniques for protection of users’ privacy in location-based services (LBS) applications, and has been applied to several variants such as LBS snapshot queries and continuous queries. Analyzing large-scale spatial-temporal anonymity sets may benefit several LBS applications. In this paper, we propose two location prediction methods based on transition probability matrices constructing from sequential rules for spatial-temporal k-anonymity dataset. First, we define single-step sequential rules mined from sequential spatial-temporal k-anonymity datasets generated from continuous LBS queries for multiple users. We then construct transition probability matrices from mined single-step sequential rules, and normalize the transition probabilities in the transition matrices. Next, we regard a mobility model for an LBS requester as a stationary stochastic process and compute the n-step transition probability matrices by raising the normalized transition probability matrices to the power n. Furthermore, we propose two location prediction methods: rough prediction and accurate prediction. The former achieves the probabilities of arriving at target locations along simple paths those include only current locations, target locations and transition steps. By iteratively combining the probabilities for simple paths with n steps and the probabilities for detailed paths with n-1 steps, the latter method calculates transition probabilities for detailed paths with n steps from current locations to target locations. Finally, we conduct extensive experiments, and correctness and flexibility of our proposed algorithm have been verified. PMID:27508502

An Integrable Discrete Generalized Nonlinear Schrödinger Equation and Its Reductions

International Nuclear Information System (INIS)

Li Hong-Min; Li Yu-Qi; Chen Yong

2014-01-01

An integrable discrete system obtained by the algebraization of the difference operator is studied. The system is named discrete generalized nonlinear Schrödinger (GNLS) equation, which can be reduced to classical discrete nonlinear Schrödinger (NLS) equation. Furthermore, all of the linear reductions for the discrete GNLS equation are given through the theory of circulant matrices and the discrete NLS equation is obtained by one of the reductions. At the same time, the recursion operator and symmetries of continuous GNLS equation are successfully recovered by its corresponding discrete ones. (general)

Linear matrix differential equations of higher-order and applications

Directory of Open Access Journals (Sweden)

Mustapha Rachidi

2008-07-01

Full Text Available In this article, we study linear differential equations of higher-order whose coefficients are square matrices. The combinatorial method for computing the matrix powers and exponential is adopted. New formulas representing auxiliary results are obtained. This allows us to prove properties of a large class of linear matrix differential equations of higher-order, in particular results of Apostol and Kolodner are recovered. Also illustrative examples and applications are presented.

Trigonometric solutions of triangle equations. Simple Lie superalgebras

International Nuclear Information System (INIS)

Bazhanov, V.V.; Shadrikov, A.G.

1988-01-01

Trigonometric solutions of the graded triangle equation are constructed for the fundamental representations of all simple (nonexceptional) Lie superalgebras with nondegenerate metric. In Sec. 1, we introduce the concept of Z 2 graded spaces and give the basic definitions. In Sec. 2, we determine fundamental representations of the Lie superalgebras sl(mn) and osp(2rs) and give explicit realizations of the Coxeter automorphisms. In secs. 3 and 4, we give the trigonometric solutions of the graded triangle equation (quantum R matrices)

Special matrices of mathematical physics stochastic, circulant and Bell matrices

CERN Document Server

Aldrovandi, R

2001-01-01

This book expounds three special kinds of matrices that are of physical interest, centering on physical examples. Stochastic matrices describe dynamical systems of many different types, involving (or not) phenomena like transience, dissipation, ergodicity, nonequilibrium, and hypersensitivity to initial conditions. The main characteristic is growth by agglomeration, as in glass formation. Circulants are the building blocks of elementary Fourier analysis and provide a natural gateway to quantum mechanics and noncommutative geometry. Bell polynomials offer closed expressions for many formulas co

Quantum Gelfand-Levitan equations for nonlinear Schroedinger model of spin-1/2 particles

International Nuclear Information System (INIS)

Pu, F.; Zhao, B.

1984-01-01

The quantum Gelfand-Levitan equations for the nonlinear Schroedinger model of spin-(1/2) particles are obtained. Two Izergin-Korepin relations are used in the derivation. A new type commutation relation of L operators is introduced to get the commutation relations which are needed for the study of S matrices and Green's functions. As examples, the four-point Green's functions and the two-body S matrices are given

Integrable boundary conditions and modified Lax equations

International Nuclear Information System (INIS)

Avan, Jean; Doikou, Anastasia

2008-01-01

We consider integrable boundary conditions for both discrete and continuum classical integrable models. Local integrals of motion generated by the corresponding 'transfer' matrices give rise to time evolution equations for the initial Lax operator. We systematically identify the modified Lax pairs for both discrete and continuum boundary integrable models, depending on the classical r-matrix and the boundary matrix

Bethe ansatz equations for open spin chains from giant gravitons

International Nuclear Information System (INIS)

Nepomechie, Rafael I.

2009-01-01

We investigate the open spin chain describing the scalar sector of the Y = 0 giant graviton brane at weak coupling. We provide a direct proof of integrability in the SU(2) and SU(3) sectors by constructing the transfer matrices. We determine the eigenvalues of these transfer matrices in terms of roots of the corresponding Bethe ansatz equations (BAEs). Based on these results, we propose BAEs for the full SO(6) sector. We find that, in the weak-coupling limit, the recently-proposed all-loop BAEs essentially agree with those proposed in the present work.

The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices

Science.gov (United States)

Dehghan, Mehdi; Hajarian, Masoud

2012-08-01

A matrix P is called a symmetric orthogonal if P = P T = P -1. A matrix X is said to be a generalised bisymmetric with respect to P if X = X T = PXP. It is obvious that any symmetric matrix is also a generalised bisymmetric matrix with respect to I (identity matrix). By extending the idea of the Jacobi and the Gauss-Seidel iterations, this article proposes two new iterative methods, respectively, for computing the generalised bisymmetric (containing symmetric solution as a special case) and skew-symmetric solutions of the generalised Sylvester matrix equation ? (including Sylvester and Lyapunov matrix equations as special cases) which is encountered in many systems and control applications. When the generalised Sylvester matrix equation has a unique generalised bisymmetric (skew-symmetric) solution, the first (second) iterative method converges to the generalised bisymmetric (skew-symmetric) solution of this matrix equation for any initial generalised bisymmetric (skew-symmetric) matrix. Finally, some numerical results are given to illustrate the effect of the theoretical results.

Auxiliary matrices for the six-vertex model at q sup N = 1 and a geometric interpretation of its symmetries

CERN Document Server

Korff, C

2003-01-01

The construction of auxiliary matrices for the six-vertex model at a root of unity is investigated from a quantum group theoretic point of view. Employing the concept of intertwiners associated with the quantum loop algebra U sub q (s-tilde l-tilde sub 2) at q sup N = 1, a three-parameter family of auxiliary matrices is constructed. The elements of this family satisfy a functional relation with the transfer matrix allowing one to solve the eigenvalue problem of the model and to derive the Bethe ansatz equations. This functional relation is obtained from the decomposition of a tensor product of evaluation representations and involves auxiliary matrices with different parameters. Because of this dependence on additional parameters, the auxiliary matrices break in general the finite symmetries of the six-vertex model, such as spin-reversal or spin-conservation. More importantly, they also lift the extra degeneracies of the transfer matrix due to the loop symmetry present at rational coupling values. The extra pa...

Numerical Solution of the Fractional Partial Differential Equations by the Two-Dimensional Fractional-Order Legendre Functions

Directory of Open Access Journals (Sweden)

Fukang Yin

2013-01-01

Full Text Available A numerical method is presented to obtain the approximate solutions of the fractional partial differential equations (FPDEs. The basic idea of this method is to achieve the approximate solutions in a generalized expansion form of two-dimensional fractional-order Legendre functions (2D-FLFs. The operational matrices of integration and derivative for 2D-FLFs are first derived. Then, by these matrices, a system of algebraic equations is obtained from FPDEs. Hence, by solving this system, the unknown 2D-FLFs coefficients can be computed. Three examples are discussed to demonstrate the validity and applicability of the proposed method.

Electronic Spectroscopy of B Atoms and B2 Molecules Isolated in Para-H2, Normal-D2, Ne, Ar, Kr, and Xe Matrices

National Research Council Canada - National Science Library

Tam, Simon

2000-01-01

...), Ne, Ar, Kr, and Xe matrices, and of B2 molecules in Ne, Ar, Kr, and Xe matrices. The 2s(sup 2)3s((sup 2)S) left arrow 2s(sup 2)2p((sup 2)P) B atom Rydberg absorption suffers large gas-to-matrix blue shifts, increasing...

Cross-Validation of a Recently Published Equation Predicting Energy Expenditure to Run or Walk a Mile in Normal-Weight and Overweight Adults

Science.gov (United States)

Morris, Cody E.; Owens, Scott G.; Waddell, Dwight E.; Bass, Martha A.; Bentley, John P.; Loftin, Mark

2014-01-01

An equation published by Loftin, Waddell, Robinson, and Owens (2010) was cross-validated using ten normal-weight walkers, ten overweight walkers, and ten distance runners. Energy expenditure was measured at preferred walking (normal-weight walker and overweight walkers) or running pace (distance runners) for 5 min and corrected to a mile. Energy…

Isomorphic Operators and Functional Equations for the Skew-Circulant Algebra

Directory of Open Access Journals (Sweden)

Zhaolin Jiang

2014-01-01

Full Text Available The skew-circulant matrix has been used in solving ordinary differential equations. We prove that the set of skew-circulants with complex entries has an idempotent basis. On that basis, a skew-cyclic group of automorphisms and functional equations on the skew-circulant algebra is introduced. And different operators on linear vector space that are isomorphic to the algebra of n×n complex skew-circulant matrices are displayed in this paper.

Products of random matrices from fixed trace and induced Ginibre ensembles

Science.gov (United States)

Akemann, Gernot; Cikovic, Milan

2018-05-01

We investigate the microcanonical version of the complex induced Ginibre ensemble, by introducing a fixed trace constraint for its second moment. Like for the canonical Ginibre ensemble, its complex eigenvalues can be interpreted as a two-dimensional Coulomb gas, which are now subject to a constraint and a modified, collective confining potential. Despite the lack of determinantal structure in this fixed trace ensemble, we compute all its density correlation functions at finite matrix size and compare to a fixed trace ensemble of normal matrices, representing a different Coulomb gas. Our main tool of investigation is the Laplace transform, that maps back the fixed trace to the induced Ginibre ensemble. Products of random matrices have been used to study the Lyapunov and stability exponents for chaotic dynamical systems, where the latter are based on the complex eigenvalues of the product matrix. Because little is known about the universality of the eigenvalue distribution of such product matrices, we then study the product of m induced Ginibre matrices with a fixed trace constraint—which are clearly non-Gaussian—and M  ‑  m such Ginibre matrices without constraint. Using an m-fold inverse Laplace transform, we obtain a concise result for the spectral density of such a mixed product matrix at finite matrix size, for arbitrary fixed m and M. Very recently local and global universality was proven by the authors and their coworker for a more general, single elliptic fixed trace ensemble in the bulk of the spectrum. Here, we argue that the spectral density of mixed products is in the same universality class as the product of M independent induced Ginibre ensembles.

Dynamical R Matrices of Elliptic Quantum Groups and Connection Matrices for the q-KZ Equations

Directory of Open Access Journals (Sweden)

Hitoshi Konno

2006-12-01

Full Text Available For any affine Lie algebra ${mathfrak g}$, we show that any finite dimensional representation of the universal dynamical $R$ matrix ${cal R}(lambda$ of the elliptic quantum group ${cal B}_{q,lambda}({mathfrak g}$ coincides with a corresponding connection matrix for the solutions of the $q$-KZ equation associated with $U_q({mathfrak g}$. This provides a general connection between ${cal B}_{q,lambda}({mathfrak g}$ and the elliptic face (IRF or SOS models. In particular, we construct vector representations of ${cal R}(lambda$ for ${mathfrak g}=A_n^{(1}$, $B_n^{(1}$, $C_n^{(1}$, $D_n^{(1}$, and show that they coincide with the face weights derived by Jimbo, Miwa and Okado. We hence confirm the conjecture by Frenkel and Reshetikhin.

Fast heap transform-based QR-decomposition of real and complex matrices: algorithms and codes

Science.gov (United States)

Grigoryan, Artyom M.

2015-03-01

In this paper, we describe a new look on the application of Givens rotations to the QR-decomposition problem, which is similar to the method of Householder transformations. We apply the concept of the discrete heap transform, or signal-induced unitary transforms which had been introduced by Grigoryan (2006) and used in signal and image processing. Both cases of real and complex nonsingular matrices are considered and examples of performing QR-decomposition of square matrices are given. The proposed method of QR-decomposition for the complex matrix is novel and differs from the known method of complex Givens rotation and is based on analytical equations for the heap transforms. Many examples illustrated the proposed heap transform method of QR-decomposition are given, algorithms are described in detail, and MATLAB-based codes are included.

How to derive biological information from the value of the normalization constant in allometric equations.

Science.gov (United States)

Kaitaniemi, Pekka

2008-04-09

Allometric equations are widely used in many branches of biological science. The potential information content of the normalization constant b in allometric equations of the form Y = bX(a) has, however, remained largely neglected. To demonstrate the potential for utilizing this information, I generated a large number of artificial datasets that resembled those that are frequently encountered in biological studies, i.e., relatively small samples including measurement error or uncontrolled variation. The value of X was allowed to vary randomly within the limits describing different data ranges, and a was set to a fixed theoretical value. The constant b was set to a range of values describing the effect of a continuous environmental variable. In addition, a normally distributed random error was added to the values of both X and Y. Two different approaches were then used to model the data. The traditional approach estimated both a and b using a regression model, whereas an alternative approach set the exponent a at its theoretical value and only estimated the value of b. Both approaches produced virtually the same model fit with less than 0.3% difference in the coefficient of determination. Only the alternative approach was able to precisely reproduce the effect of the environmental variable, which was largely lost among noise variation when using the traditional approach. The results show how the value of b can be used as a source of valuable biological information if an appropriate regression model is selected.

A generalized estimating equations approach to quantitative trait locus detection of non-normal traits

Directory of Open Access Journals (Sweden)

Thomson Peter C

2003-05-01

Full Text Available Abstract To date, most statistical developments in QTL detection methodology have been directed at continuous traits with an underlying normal distribution. This paper presents a method for QTL analysis of non-normal traits using a generalized linear mixed model approach. Development of this method has been motivated by a backcross experiment involving two inbred lines of mice that was conducted in order to locate a QTL for litter size. A Poisson regression form is used to model litter size, with allowances made for under- as well as over-dispersion, as suggested by the experimental data. In addition to fixed parity effects, random animal effects have also been included in the model. However, the method is not fully parametric as the model is specified only in terms of means, variances and covariances, and not as a full probability model. Consequently, a generalized estimating equations (GEE approach is used to fit the model. For statistical inferences, permutation tests and bootstrap procedures are used. This method is illustrated with simulated as well as experimental mouse data. Overall, the method is found to be quite reliable, and with modification, can be used for QTL detection for a range of other non-normally distributed traits.

Pathological rate matrices: from primates to pathogens

Directory of Open Access Journals (Sweden)

Knight Rob

2008-12-01

Full Text Available Abstract Background Continuous-time Markov models allow flexible, parametrically succinct descriptions of sequence divergence. Non-reversible forms of these models are more biologically realistic but are challenging to develop. The instantaneous rate matrices defined for these models are typically transformed into substitution probability matrices using a matrix exponentiation algorithm that employs eigendecomposition, but this algorithm has characteristic vulnerabilities that lead to significant errors when a rate matrix possesses certain 'pathological' properties. Here we tested whether pathological rate matrices exist in nature, and consider the suitability of different algorithms to their computation. Results We used concatenated protein coding gene alignments from microbial genomes, primate genomes and independent intron alignments from primate genomes. The Taylor series expansion and eigendecomposition matrix exponentiation algorithms were compared to the less widely employed, but more robust, Padé with scaling and squaring algorithm for nucleotide, dinucleotide, codon and trinucleotide rate matrices. Pathological dinucleotide and trinucleotide matrices were evident in the microbial data set, affecting the eigendecomposition and Taylor algorithms respectively. Even using a conservative estimate of matrix error (occurrence of an invalid probability, both Taylor and eigendecomposition algorithms exhibited substantial error rates: ~100% of all exonic trinucleotide matrices were pathological to the Taylor algorithm while ~10% of codon positions 1 and 2 dinucleotide matrices and intronic trinucleotide matrices, and ~30% of codon matrices were pathological to eigendecomposition. The majority of Taylor algorithm errors derived from occurrence of multiple unobserved states. A small number of negative probabilities were detected from the Pad�� algorithm on trinucleotide matrices that were attributable to machine precision. Although the Pad

Error analysis of Newmark's method for the second order equation with inhomogeneous term

International Nuclear Information System (INIS)

Chiba, F.; Kako, T.

2000-01-01

For the second order time evolution equation with a general dissipation term, we introduce a recurrence relation of Newmark's method. Deriving an energy inequality from this relation, we consider the stability and the convergence criteria of Newmark's method. We treat a dissipation term under the assumption that the coefficient-damping matrix is constant in time and non-negative. We can relax however the assumptions for the dissipation and the rigidity matrices to be arbitrary symmetric matrices. (author)

DIRAC MATRICES IN CHIRAL REPRESENTATION AND THE CONNECTION WITH THE ELECTRIC FIELD PARALLEL TO THE MAGNETIC FIELD MATRICES DE DIRAC EN REPRESENTACIÓN QUIRAL Y LA CONEXIÓN CON EL CAMPO ELÉCTRICO PARALELO AL CAMPO MAGNÉTICO

Directory of Open Access Journals (Sweden)

Héctor Torres-Silva

2008-11-01

Full Text Available In this paper we offer an expression of the general Foldy-Wouthuysen transformation in the chiral representation of Dirac matrices interacting with fermion field. Our hypothesis is that through the multiplication of the Pauli matrix and Maxwell's chiral equations in the case of ,one obtains the Dirac's chiral equation. This is the proof of the theorem that the wave mechanics of quantum particles represent a specialized electrodynamic.En este trabajo se presenta una expresión de la transformación general de Foldy-Wouthuysen a la representación quiral de las matrices de Dirac interactuando con un campo de fermión. La hipótesis es que a través de la multiplicación de la matriz de Pauli por las ecuaciones quirales de Maxwell en el caso de , se obtiene la ecuación quiral de Dirac. Esta es la prueba del teorema de que la mecánica de ondas de partícula cuántica representa una electrodinámica especializada.

A covariance correction that accounts for correlation estimation to improve finite-sample inference with generalized estimating equations: A study on its applicability with structured correlation matrices.

Science.gov (United States)

Westgate, Philip M

2016-01-01

When generalized estimating equations (GEE) incorporate an unstructured working correlation matrix, the variances of regression parameter estimates can inflate due to the estimation of the correlation parameters. In previous work, an approximation for this inflation that results in a corrected version of the sandwich formula for the covariance matrix of regression parameter estimates was derived. Use of this correction for correlation structure selection also reduces the over-selection of the unstructured working correlation matrix. In this manuscript, we conduct a simulation study to demonstrate that an increase in variances of regression parameter estimates can occur when GEE incorporates structured working correlation matrices as well. Correspondingly, we show the ability of the corrected version of the sandwich formula to improve the validity of inference and correlation structure selection. We also study the relative influences of two popular corrections to a different source of bias in the empirical sandwich covariance estimator.

Calibration of Ge gamma-ray spectrometers for complex sample geometries and matrices

Energy Technology Data Exchange (ETDEWEB)

Semkow, T.M., E-mail: thomas.semkow@health.ny.gov [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Department of Environmental Health Sciences, School of Public Health, University at Albany, State University of New York, Rensselaer, NY 12144 (United States); Bradt, C.J.; Beach, S.E.; Haines, D.K.; Khan, A.J.; Bari, A.; Torres, M.A.; Marrantino, J.C.; Syed, U.-F. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Kitto, M.E. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Department of Environmental Health Sciences, School of Public Health, University at Albany, State University of New York, Rensselaer, NY 12144 (United States); Hoffman, T.J. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Curtis, P. [Kiltel Systems, Inc., Clyde Hill, WA 98004 (United States)

2015-11-01

A comprehensive study of the efficiency calibration and calibration verification of Ge gamma-ray spectrometers was performed using semi-empirical, computational Monte-Carlo (MC), and transfer methods. The aim of this study was to evaluate the accuracy of the quantification of gamma-emitting radionuclides in complex matrices normally encountered in environmental and food samples. A wide range of gamma energies from 59.5 to 1836.0 keV and geometries from a 10-mL jar to 1.4-L Marinelli beaker were studied on four Ge spectrometers with the relative efficiencies between 102% and 140%. Density and coincidence summing corrections were applied. Innovative techniques were developed for the preparation of artificial complex matrices from materials such as acidified water, polystyrene, ethanol, sugar, and sand, resulting in the densities ranging from 0.3655 to 2.164 g cm{sup −3}. They were spiked with gamma activity traceable to international standards and used for calibration verifications. A quantitative method of tuning MC calculations to experiment was developed based on a multidimensional chi-square paraboloid. - Highlights: • Preparation and spiking of traceable complex matrices in extended geometries. • Calibration of Ge gamma spectrometers for complex matrices. • Verification of gamma calibrations. • Comparison of semi-empirical, computational Monte Carlo, and transfer methods of Ge calibration. • Tuning of Monte Carlo calculations using a multidimensional paraboloid.

Calibration of Ge gamma-ray spectrometers for complex sample geometries and matrices

International Nuclear Information System (INIS)

Semkow, T.M.; Bradt, C.J.; Beach, S.E.; Haines, D.K.; Khan, A.J.; Bari, A.; Torres, M.A.; Marrantino, J.C.; Syed, U.-F.; Kitto, M.E.; Hoffman, T.J.; Curtis, P.

2015-01-01

A comprehensive study of the efficiency calibration and calibration verification of Ge gamma-ray spectrometers was performed using semi-empirical, computational Monte-Carlo (MC), and transfer methods. The aim of this study was to evaluate the accuracy of the quantification of gamma-emitting radionuclides in complex matrices normally encountered in environmental and food samples. A wide range of gamma energies from 59.5 to 1836.0 keV and geometries from a 10-mL jar to 1.4-L Marinelli beaker were studied on four Ge spectrometers with the relative efficiencies between 102% and 140%. Density and coincidence summing corrections were applied. Innovative techniques were developed for the preparation of artificial complex matrices from materials such as acidified water, polystyrene, ethanol, sugar, and sand, resulting in the densities ranging from 0.3655 to 2.164 g cm −3 . They were spiked with gamma activity traceable to international standards and used for calibration verifications. A quantitative method of tuning MC calculations to experiment was developed based on a multidimensional chi-square paraboloid. - Highlights: • Preparation and spiking of traceable complex matrices in extended geometries. • Calibration of Ge gamma spectrometers for complex matrices. • Verification of gamma calibrations. • Comparison of semi-empirical, computational Monte Carlo, and transfer methods of Ge calibration. • Tuning of Monte Carlo calculations using a multidimensional paraboloid

Method for the determination of the equation of state of advanced fuels based on the properties of normal fluids

International Nuclear Information System (INIS)

Hecht, M.J.; Catton, I.; Kastenberg, W.E.

1976-12-01

An equation of state based on the properties of normal fluids, the law of rectilinear averages, and the second law of thermodynamics can be derived for advanced LMFBR fuels on the basis of the vapor pressure, enthalpy of vaporization, change in heat capacity upon vaporization, and liquid density at the melting point. The method consists of estimating an equation of state by means of the law of rectilinear averages and the second law of thermodynamics, integrating by means of the second law until an instability is reached, and then extrapolating by means of a self-consistent estimation of the enthalpy of vaporization

The coordinate system transformation of a serial kinematic structures and use in the derivation of systems motion equations

Directory of Open Access Journals (Sweden)

Zátopek Jiří

2016-01-01

Full Text Available This text discusses the use of transformation matrices to determine the motion equations of the complex mechanical structure. Use of the transformation matrix does not apply only to motion equations but has the general use in relative positions determine of objects in the 3D space. Analysed model is divided into seven physical objects, the transformation matrix and the corresponding inertia/pseudo-inertia matrix is included in each of them. This matrices are strictly necessary to the system dynamic description using the matrix form of Lagrange Equations of the Second Type. Another possibility to use the transformation matrix is shown in the camera system measurement. Model was designed in 3D CAD system SolidWorks, MATLAB was used for the mathematical calculations.

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…

The analytic structure of trigonometric S-matrices

International Nuclear Information System (INIS)

Hollowood, T.J.

1994-01-01

S-matrices associated to the vector representations of the quantum groups for the classical Lie algebras are constructed. For the a m-1 and c m algebras the complete S-matrix is found by an application of the bootstrap equations. It is shown that the simplest form for the S-matrix which generalizes that of the Gross-Neveu model is not consistent for the non-simply-laced algebras due to the existence of unexplained singularities on the physical strip. However, a form which generalizes the S-matrix of the principal chiral model is shown to be consistent via an argument which uses a novel application of the Coleman-Thun mechanism. The analysis also gives a correct description of the analytic structure of the S-matrix of the principle chiral model for c m . (orig.)

Determination of Matric Suction and Saturation Degree for Unsaturated Soils, Comparative Study - Numerical Method versus Analytical Method

Science.gov (United States)

Chiorean, Vasile-Florin

2017-10-01

Matric suction is a soil parameter which influences the behaviour of unsaturated soils in both terms of shear strength and permeability. It is a necessary aspect to know the variation of matric suction in unsaturated soil zone for solving geotechnical issues like unsaturated soil slopes stability or bearing capacity for unsaturated foundation ground. Mathematical expression of the dependency between soil moisture content and it’s matric suction (soil water characteristic curve) has a powerful character of nonlinearity. This paper presents two methods to determine the variation of matric suction along the depth included between groundwater level and soil level. First method is an analytical approach to emphasize one direction steady state unsaturated infiltration phenomenon that occurs between the groundwater level and the soil level. There were simulated three different situations in terms of border conditions: precipitations (inflow conditions on ground surface), evaporation (outflow conditions on ground surface), and perfect equilibrium (no flow on ground surface). Numerical method is finite element method used for steady state, two-dimensional, unsaturated infiltration calculus. Regarding boundary conditions there were simulated identical situations as in analytical approach. For both methods, was adopted the equation proposed by van Genuchten-Mualen (1980) for mathematical expression of soil water characteristic curve. Also for the unsaturated soil permeability prediction model was adopted the equation proposed by van Genuchten-Mualen. The fitting parameters of these models were adopted according to RETC 6.02 software in function of soil type. The analyses were performed in both methods for three major soil types: clay, silt and sand. For each soil type were concluded analyses for three situations in terms of border conditions applied on soil surface: inflow, outflow, and no flow. The obtained results are presented in order to highlight the differences

The time-dependent Hartree-Fock equations with Coulomb two-body interaction

International Nuclear Information System (INIS)

Chadam, J.M.; Glassey, R.T.

1975-06-01

The existence and uniqueness of global solutions to the Cauchy problem is proved in the space of ''smooth'' density matrices for the time-dependent Hartree-Fock equations describing the motion of finite Fermi systems interacting via a Coulomb two-body potential [fr

Solution methods for large systems of linear equations in BACCHUS

International Nuclear Information System (INIS)

Homann, C.; Dorr, B.

1993-05-01

The computer programme BACCHUS is used to describe steady state and transient thermal-hydraulic behaviour of a coolant in a fuel element with intact geometry in a fast breeder reactor. In such computer programmes generally large systems of linear equations with sparse matrices of coefficients, resulting from discretization of coolant conservation equations, must be solved thousands of times giving rise to large demands of main storage and CPU time. Direct and iterative solution methods of the systems of linear equations, available in BACCHUS, are described, giving theoretical details and experience with their use in the programme. Besides use of a method of lines, a Runge-Kutta-method, for solution of the partial differential equation is outlined. (orig.) [de

Determination of calibration equations by means of the generalized least squares method

International Nuclear Information System (INIS)

Zijp, W.L.

1984-12-01

For the determination of two-dimensional calibration curves (e.g. in tank calibration procedures) or of three dimensional calibration equations (e.g. for the calibration of NDA equipment for enrichment measurements) one performs measurements under well chosen conditions, where all observables of interest (inclusive the values of the standard material) are subject to measurement uncertainties. Moreover correlations in several measurements may occur. This document describes the mathematical-statistical approach to determine the values of the model parameters and their covariance matrix, which fit best to the mathematical model for the calibration equation. The formulae are based on the method of generalized least squares where the term generalized implies that non-linear equations in the unknown parameters and also covariance matrices of the measurement data of the calibration can be taken into account. In the general case an iteration procedure is required. No iteration is required when the model is linear in the parameters and the covariance matrices for the measurements of co-ordinates of the calibration points are proportional to each other

Chemiluminescence in cryogenic matrices

Science.gov (United States)

Lotnik, S. V.; Kazakov, Valeri P.

1989-04-01

The literature data on chemiluminescence (CL) in cryogenic matrices have been classified and correlated for the first time. The role of studies on phosphorescence and CL at low temperatures in the development of cryochemistry is shown. The features of low-temperature CL in matrices of nitrogen and inert gases (fine structure of spectra, matrix effects) and the data on the mobility and reactivity of atoms and radicals at very low temperatures are examined. The trends in the development of studies on CL in cryogenic matrices, such as the search for systems involving polyatomic molecules and extending the forms of CL reactions, are followed. The reactions of active nitrogen with hydrocarbons that are accompanied by light emission and CL in the oxidation of carbenes at T >= 77 K are examined. The bibliography includes 112 references.

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

Skew-adjacency matrices of graphs

NARCIS (Netherlands)

Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

2012-01-01

The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

The invariant theory of matrices

CERN Document Server

Concini, Corrado De

2017-01-01

This book gives a unified, complete, and self-contained exposition of the main algebraic theorems of invariant theory for matrices in a characteristic free approach. More precisely, it contains the description of polynomial functions in several variables on the set of m\\times m matrices with coefficients in an infinite field or even the ring of integers, invariant under simultaneous conjugation. Following Hermann Weyl's classical approach, the ring of invariants is described by formulating and proving the first fundamental theorem that describes a set of generators in the ring of invariants, and the second fundamental theorem that describes relations between these generators. The authors study both the case of matrices over a field of characteristic 0 and the case of matrices over a field of positive characteristic. While the case of characteristic 0 can be treated following a classical approach, the case of positive characteristic (developed by Donkin and Zubkov) is much harder. A presentation of this case...

Exact Inverse Matrices of Fermat and Mersenne Circulant Matrix

Directory of Open Access Journals (Sweden)

Yanpeng Zheng

2015-01-01

Full Text Available The well known circulant matrices are applied to solve networked systems. In this paper, circulant and left circulant matrices with the Fermat and Mersenne numbers are considered. The nonsingularity of these special matrices is discussed. Meanwhile, the exact determinants and inverse matrices of these special matrices are presented.

Enhancing Understanding of Transformation Matrices

Science.gov (United States)

Dick, Jonathan; Childrey, Maria

2012-01-01

With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…

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.

Preconditioned Krylov and Gauss-Seidel solutions of response matrix equations

International Nuclear Information System (INIS)

Lewis, E.E.; Smith, M.A.; Yang, W.S.; Wollaber, A.

2011-01-01

The use of preconditioned Krylov methods is examined as an alternative to the partitioned matrix acceleration applied to red-black Gauss Seidel (RBGS) iteration that is presently used in the variational nodal code, VARIANT. We employ the GMRES algorithm to treat non-symmetric response matrix equations. A pre conditioner is formulated for the within-group diffusion equation which is equivalent to partitioned matrix acceleration of RBGS iterations. We employ the pre conditioner, which closely parallels two-level p multigrid, to improve RBGS and GMRES algorithms. Of the accelerated algorithms, GMRES converges with less computational effort than RBGS and therefore is chosen for further development. The p multigrid pre conditioner requires response matrices with two or more degrees of freedom (DOF) per interface that are polynomials, which are both orthogonal and hierarchical. It is therefore not directly applicable to very fine mesh calculations that are both slow to converge and that are often modeled with response matrices with only one DOF per interface. Orthogonal matrix aggregation (OMA) is introduced to circumvent this difficulty by combining N×N fine mesh response matrices with one DOF per interface into a coarse mesh response matrix with N orthogonal DOF per interface. Numerical results show that OMA used alone or in combination with p multigrid preconditioning substantially accelerates GMRES solutions. (author)

Preconditioned Krylov and Gauss-Seidel solutions of response matrix equations

Energy Technology Data Exchange (ETDEWEB)

Lewis, E.E., E-mail: e-lewis@northwestern.edu [Department of Mechanical Engineering, Northwestern University, Evanston, IL (United States); Smith, M.A.; Yang, W.S.; Wollaber, A., E-mail: masmith@anl.gov, E-mail: wsyang@anl.gov, E-mail: wollaber@lanl.gov [Nuclear Engineering Division, Argonne National Laboratory, Argonne, IL (United States)

2011-07-01

The use of preconditioned Krylov methods is examined as an alternative to the partitioned matrix acceleration applied to red-black Gauss Seidel (RBGS) iteration that is presently used in the variational nodal code, VARIANT. We employ the GMRES algorithm to treat non-symmetric response matrix equations. A pre conditioner is formulated for the within-group diffusion equation which is equivalent to partitioned matrix acceleration of RBGS iterations. We employ the pre conditioner, which closely parallels two-level p multigrid, to improve RBGS and GMRES algorithms. Of the accelerated algorithms, GMRES converges with less computational effort than RBGS and therefore is chosen for further development. The p multigrid pre conditioner requires response matrices with two or more degrees of freedom (DOF) per interface that are polynomials, which are both orthogonal and hierarchical. It is therefore not directly applicable to very fine mesh calculations that are both slow to converge and that are often modeled with response matrices with only one DOF per interface. Orthogonal matrix aggregation (OMA) is introduced to circumvent this difficulty by combining N×N fine mesh response matrices with one DOF per interface into a coarse mesh response matrix with N orthogonal DOF per interface. Numerical results show that OMA used alone or in combination with p multigrid preconditioning substantially accelerates GMRES solutions. (author)

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

Science.gov (United States)

Gunzburger, M. D.; Nicolaides, R. A.

1986-01-01

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

Group inverses of M-matrices and their applications

CERN Document Server

Kirkland, Stephen J

2013-01-01

Group inverses for singular M-matrices are useful tools not only in matrix analysis, but also in the analysis of stochastic processes, graph theory, electrical networks, and demographic models. Group Inverses of M-Matrices and Their Applications highlights the importance and utility of the group inverses of M-matrices in several application areas. After introducing sample problems associated with Leslie matrices and stochastic matrices, the authors develop the basic algebraic and spectral properties of the group inverse of a general matrix. They then derive formulas for derivatives of matrix f

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.

Solitary-wave families of the Ostrovsky equation: An approach via reversible systems theory and normal forms

International Nuclear Information System (INIS)

Roy Choudhury, S.

2007-01-01

The Ostrovsky equation is an important canonical model for the unidirectional propagation of weakly nonlinear long surface and internal waves in a rotating, inviscid and incompressible fluid. Limited functional analytic results exist for the occurrence of one family of solitary-wave solutions of this equation, as well as their approach to the well-known solitons of the famous Korteweg-de Vries equation in the limit as the rotation becomes vanishingly small. Since solitary-wave solutions often play a central role in the long-time evolution of an initial disturbance, we consider such solutions here (via the normal form approach) within the framework of reversible systems theory. Besides confirming the existence of the known family of solitary waves and its reduction to the KdV limit, we find a second family of multihumped (or N-pulse) solutions, as well as a continuum of delocalized solitary waves (or homoclinics to small-amplitude periodic orbits). On isolated curves in the relevant parameter region, the delocalized waves reduce to genuine embedded solitons. The second and third families of solutions occur in regions of parameter space distinct from the known solitary-wave solutions and are thus entirely new. Directions for future work are also mentioned

Fast multipole preconditioners for sparse matrices arising from elliptic equations

KAUST Repository

Ibeid, Huda

2017-11-09

Among optimal hierarchical algorithms for the computational solution of elliptic problems, the fast multipole method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Here, we do not discuss the well developed applications of FMM to implement matrix-vector multiplications within Krylov solvers of boundary element methods. Instead, we propose using FMM for the volume-to-volume contribution of inhomogeneous Poisson-like problems, where the boundary integral is a small part of the overall computation. Our method may be used to precondition sparse matrices arising from finite difference/element discretizations, and can handle a broader range of scientific applications. It is capable of algebraic convergence rates down to the truncation error of the discretized PDE comparable to those of multigrid methods, and it offers potentially superior multicore and distributed memory scalability properties on commodity architecture supercomputers. Compared with other methods exploiting the low-rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. We describe our tests in reproducible detail with freely available codes and outline directions for further extensibility.

Fast multipole preconditioners for sparse matrices arising from elliptic equations

KAUST Repository

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

2017-01-01

Among optimal hierarchical algorithms for the computational solution of elliptic problems, the fast multipole method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Here, we do not discuss the well developed applications of FMM to implement matrix-vector multiplications within Krylov solvers of boundary element methods. Instead, we propose using FMM for the volume-to-volume contribution of inhomogeneous Poisson-like problems, where the boundary integral is a small part of the overall computation. Our method may be used to precondition sparse matrices arising from finite difference/element discretizations, and can handle a broader range of scientific applications. It is capable of algebraic convergence rates down to the truncation error of the discretized PDE comparable to those of multigrid methods, and it offers potentially superior multicore and distributed memory scalability properties on commodity architecture supercomputers. Compared with other methods exploiting the low-rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. We describe our tests in reproducible detail with freely available codes and outline directions for further extensibility.

Inference for High-dimensional Differential Correlation Matrices.

Science.gov (United States)

Cai, T Tony; Zhang, Anru

2016-01-01

Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices. An adaptive thresholding procedure is introduced and theoretical guarantees are given. Minimax rate of convergence is established and the proposed estimator is shown to be adaptively rate-optimal over collections of paired correlation matrices with approximately sparse differences. Simulation results show that the procedure significantly outperforms two other natural methods that are based on separate estimation of the individual correlation matrices. The procedure is also illustrated through an analysis of a breast cancer dataset, which provides evidence at the gene co-expression level that several genes, of which a subset has been previously verified, are associated with the breast cancer. Hypothesis testing on the differential correlation matrices is also considered. A test, which is particularly well suited for testing against sparse alternatives, is introduced. In addition, other related problems, including estimation of a single sparse correlation matrix, estimation of the differential covariance matrices, and estimation of the differential cross-correlation matrices, are also discussed.

On mixed derivatives type high dimensional multi-term fractional partial differential equations approximate solutions

Science.gov (United States)

Talib, Imran; Belgacem, Fethi Bin Muhammad; Asif, Naseer Ahmad; Khalil, Hammad

2017-01-01

In this research article, we derive and analyze an efficient spectral method based on the operational matrices of three dimensional orthogonal Jacobi polynomials to solve numerically the mixed partial derivatives type multi-terms high dimensions generalized class of fractional order partial differential equations. We transform the considered fractional order problem to an easily solvable algebraic equations with the aid of the operational matrices. Being easily solvable, the associated algebraic system leads to finding the solution of the problem. Some test problems are considered to confirm the accuracy and validity of the proposed numerical method. The convergence of the method is ensured by comparing our Matlab software simulations based obtained results with the exact solutions in the literature, yielding negligible errors. Moreover, comparative results discussed in the literature are extended and improved in this study.

Phenomenological mass matrices with a democratic warp

International Nuclear Information System (INIS)

Kleppe, A.

2018-01-01

Taking into account all available data on the mass sector, we obtain unitary rotation matrices that diagonalize the quark matrices by using a specific parametrization of the Cabibbo-Kobayashi-Maskawa mixing matrix. In this way, we find mass matrices for the up- and down-quark sectors of a specific, symmetric form, with traces of a democratic texture.

Auxiliary matrices for the six-vertex model at qN = 1 and a geometric interpretation of its symmetries

International Nuclear Information System (INIS)

Korff, Christian

2003-01-01

The construction of auxiliary matrices for the six-vertex model at a root of unity is investigated from a quantum group theoretic point of view. Employing the concept of intertwiners associated with the quantum loop algebra U q (s-tilde l-tilde 2 ) at q N = 1, a three-parameter family of auxiliary matrices is constructed. The elements of this family satisfy a functional relation with the transfer matrix allowing one to solve the eigenvalue problem of the model and to derive the Bethe ansatz equations. This functional relation is obtained from the decomposition of a tensor product of evaluation representations and involves auxiliary matrices with different parameters. Because of this dependence on additional parameters, the auxiliary matrices break in general the finite symmetries of the six-vertex model, such as spin-reversal or spin-conservation. More importantly, they also lift the extra degeneracies of the transfer matrix due to the loop symmetry present at rational coupling values. The extra parameters in the auxiliary matrices are shown to be directly related to the elements in the enlarged centre Z of the algebra U q (s-tilde l-tilde 2 ) at q N = 1. This connection provides a geometric interpretation of the enhanced symmetry of the six-vertex model at rational coupling. The parameters labelling the auxiliary matrices can be interpreted as coordinates on a hypersurface Spec Z subset of C 4 which remains invariant under the action of an infinite-dimensional group G of analytic transformations, called the quantum coadjoint action

ROBUST KALMAN FILTERING FOR SYSTEMS UNDER NORM BOUNDED UNCERTAINTIES IN ALL SYSTEM MATRICES AND ERROR COVARIANCE CONSTRAINTS

Institute of Scientific and Technical Information of China (English)

XIA Yuanqing; HAN Jingqing

2005-01-01

This paper concerns robust Kalman filtering for systems under norm bounded uncertainties in all the system matrices and error covariance constraints. Sufficient conditions are given for the existence of such filters in terms of Riccati equations. The solutions to the conditions can be used to design the filters. Finally, an illustrative example is given to demonstrate the effectiveness of the proposed design procedure.

Phase integral approximation for coupled ordinary differential equations of the Schroedinger type

International Nuclear Information System (INIS)

Skorupski, Andrzej A.

2008-01-01

Four generalizations of the phase integral approximation (PIA) to sets of ordinary differential equations of Schroedinger type [u j '' (x)+Σ k=1 N R jk (x)u k (x)=0, j=1,2,...,N] are described. The recurrence relations for higher order corrections are given in a form valid to arbitrary order and for the matrix R(x)[≡(R jk (x))] either Hermitian or non-Hermitian. For Hermitian and negative definite R(x) matrices, a Wronskian conserving PIA theory is formulated, which generalizes Fulling's current conserving theory pertinent to positive definite R(x) matrices. The idea of a modification of the PIA, which is well known for one equation [u '' (x)+R(x)u(x)=0], is generalized to sets. A simplification of Wronskian or current conserving theories is proposed which in each order eliminates one integration from the formulas for higher order corrections. If the PIA is generated by a nondegenerate eigenvalue of the R(x) matrix, the eliminated integration is the only one present. In that case, the simplified theory becomes fully algorithmic and is generalized to non-Hermitian R(x) matrices. The general theory is illustrated by a few examples automatically generated by using the author's program in MATHEMATICA published in e-print arXiv:0710.5406 [math-ph

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)

Evaluation of hydrophobic materials as matrices for controlled-release drug delivery.

Science.gov (United States)

Quadir, Mohiuddin Abdul; Rahman, M Sharifur; Karim, M Ziaul; Akter, Sanjida; Awkat, M Talat Bin; Reza, Md Selim

2003-07-01

The present study was undertaken to evaluate the effect of different insoluble and erodable wax-lipid based materials and their content level on the release profile of drug from matrix systems. Matrix tablets of theophylline were prepared using carnauba wax, bees wax, stearic acid, cetyl alcohol, cetostearyl alcohol and glyceryl monostearate as rate-retarding agents by direct compression process. The release of theophylline from these hydrophobic matrices was studied over 8-hours in buffer media of pH 6.8. Statistically significant difference was found among the drug release profile from different matrices. The release kinetics was found to be governed by the type and content of hydrophobic materials in the matrix. At lower level of wax matrices (25%), a potential burst release was observed with all the materials being studied. Bees wax could not exert any sustaining action while an extensive burst release was found with carnauba wax at this hydrophobic load. Increasing the concentration of fat-wax materials significantly decreased the burst effect of drug from the matrix. At higher hydrophobic level (50% of the matrix), the rate and extent of drug release was significantly reduced due to increased tortuosity and reduced porosity of the matrix. Cetostearyl alcohol imparted the strongest retardation of drug release irrespective of fat-wax level. Numerical fits indicate that the Higuchi square root of time model was the most appropriate one for describing the release profile of theophylline from hydrophobic matrices. The release mechanism was also explored and explained with biexponential equation. Application of this model indicates that Fickian or case I kinetics is the predominant mechanism of drug release from these wax-lipid matrices. The mean dissolution time (MDT) was calculated for all the formulations and the highest MDT value was obtained with cetostearyl matrix. The greater sustaining activity of cetostearyl alcohol can be attributed to some level of

The construction of factorized S-matrices

International Nuclear Information System (INIS)

Chudnovsky, D.V.

1981-01-01

We study the relationships between factorized S-matrices given as representations of the Zamolodchikov algebra and exactly solvable models constructed using the Baxter method. Several new examples of symmetric and non-symmetric factorized S-matrices are proposed. (orig.)

Comparison of different methods for the solution of sets of linear equations

International Nuclear Information System (INIS)

Bilfinger, T.; Schmidt, F.

1978-06-01

The application of the conjugate-gradient methods as novel general iterative methods for the solution of sets of linear equations with symmetrical systems matrices led to this paper, where a comparison of these methods with the conventional differently accelerated Gauss-Seidel iteration was carried out. In additon, the direct Cholesky method was also included in the comparison. The studies referred mainly to memory requirement, computing time, speed of convergence, and accuracy of different conditions of the systems matrices, by which also the sensibility of the methods with respect to the influence of truncation errors may be recognized. (orig.) 891 RW [de

Supermultiplets and relativistic problems: II. The Bhabha equation of arbitrary spin and its properties

CERN Document Server

Moshinsky, M; Nikitin, A G; Smirnov, Yu F

1998-01-01

In 1945 Bhabha was probably the first to discuss the problem of a free relativistic particle with arbitrary spin in terms of a single linear equation in the four-momentum vector p subnu, but substituting the gamma supnu matrices of Dirac by other ones. He determined the latter by requiring that their appropriate Lorentz transformations lead to their formulation in terms of the generators of the O(5) group. His program was later extensively amplified by Krajcik, Nieto and others. We returned to this problem because we had an ab-initio procedure for deriving a Lorentz-invariant equation of arbitrary spin and furthermore could express the matrices appearing in them in terms of ordinary and what we called sign spins. Our procedure was similar to that of the ordinary and isotopic spin in nuclear physics that give rise to supermultiplets, hence the appearance of this word in the title. In the ordinary and sign spin formulation it is easy to transform our equation into one linear in both the p subnu and some of the ...

An experimental study on Sodalite and SAP matrices for immobilization of spent chloride salt waste

Science.gov (United States)

Giacobbo, Francesca; Da Ros, Mirko; Macerata, Elena; Mariani, Mario; Giola, Marco; De Angelis, Giorgio; Capone, Mauro; Fedeli, Carlo

2018-02-01

In the frame of Generation IV reactors a renewed interest in pyro-processing of spent nuclear fuel is underway. Molten chloride salt waste arising from the recovering of uranium and plutonium through pyro-processing is one of the problematic wastes for direct application of vitrification or ceramization. In this work, Sodalite and SAP have been evaluated and compared as potential matrices for confinement of spent chloride salt waste coming from pyro-processing. To this aim Sodalite and SAP were synthesized both in pure form and mixed with different glass matrices, i.e. commercially available glass frit and borosilicate glass. The confining matrices were loaded with mixed chloride salts to study their retention capacities with respect to the elements of interest. The matrices were characterized and leached for contact times up to 150 days at room temperature and at 90 °C. SEM analyses were also performed in order to compare the matrix surface before and after leaching. Leaching results are discussed and compared in terms of normalized releases with similar results reported in literature. According to this comparative study the SAP matrix with glass frit binder resulted in the best matrix among the ones studied, with respect to retention capacities for both matrix and spent fuel elements.

Analytical solutions for Dirac and Klein-Gordon equations using Backlund transformations

Energy Technology Data Exchange (ETDEWEB)

Zabadal, Jorge R.; Borges, Volnei, E-mail: jorge.zabadal@ufrgs.br, E-mail: borges@ufrgs.br [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Dept. de Engenharia Mecanica; Ribeiro, Vinicius G., E-mail: vinicius_ribeiro@uniritter.edu.br [Centro Universitario Ritter dos Reis (UNIRITTER), Porto Alegre, RS (Brazil); Santos, Marcio, E-mail: marciophd@gmail.com [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Centro de Estudos Interdisciplinares

2015-07-01

This work presents a new analytical method for solving Klein-Gordon type equations via Backlund transformations. The method consists in mapping the Klein-Gordon model into a first order system of partial differential equations, which contains a generalized velocity field instead of the Dirac matrices. This system is a tensor model for quantum field theory whose space solution is wider than the Dirac model in the original form. Thus, after finding analytical expressions for the wave functions, the Maxwell field can be readily obtained from the Dirac equations, furnishing a self-consistent field solution for the Maxwell-Dirac system. Analytical and numerical results are reported. (author)

Razumikhin-Type Stability Criteria for Differential Equations with Delayed Impulses.

Science.gov (United States)

Wang, Qing; Zhu, Quanxin

2013-01-01

This paper studies stability problems of general impulsive differential equations where time delays occur in both differential and difference equations. Based on the method of Lyapunov functions, Razumikhin technique and mathematical induction, several stability criteria are obtained for differential equations with delayed impulses. Our results show that some systems with delayed impulses may be exponentially stabilized by impulses even if the system matrices are unstable. Some less restrictive sufficient conditions are also given to keep the good stability property of systems subject to certain type of impulsive perturbations. Examples with numerical simulations are discussed to illustrate the theorems. Our results may be applied to complex problems where impulses depend on both current and past states.

Razumikhin-type stability criteria for differential equations with delayed impulses

Directory of Open Access Journals (Sweden)

Qing Wang

2013-01-01

Full Text Available This paper studies stability problems of general impulsive differential equations where time delays occur in both differential and difference equations. Based on the method of Lyapunov functions, Razumikhin technique and mathematical induction, several stability criteria are obtained for differential equations with delayed impulses. Our results show that some systems with delayed impulses may be exponentially stabilized by impulses even if the system matrices are unstable. Some less restrictive sufficient conditions are also given to keep the good stability property of systems subject to certain type of impulsive perturbations. Examples with numerical simulations are discussed to illustrate the theorems. Our results may be applied to complex problems where impulses depend on both current and past states.

Generalized Perron--Frobenius Theorem for Nonsquare Matrices

OpenAIRE

Avin, Chen; Borokhovich, Michael; Haddad, Yoram; Kantor, Erez; Lotker, Zvi; Parter, Merav; Peleg, David

2013-01-01

The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. The importance of this theorem stems from the fact that eigenvalue problems on such matrices arise in many fields of science and engineering, including dynamical systems theory, economics, statistics and optimization. However, many real-life scenarios give rise to nonsquare matrices. A natural question is whether the...

Relativistic many-body theory of atomic transitions. The relativistic equation-of-motion approach

International Nuclear Information System (INIS)

Huang, K.

1982-01-01

An equation-of-motion approach is used to develop the relativistic many-body theory of atomic transitions. The relativistic equations of motion for transition matrices are formulated with the use of techniques of quantum-field theory. To reduce the equations of motion to a tractable form which is appropriate for numerical calculations, a graphical method to resolve the complication arising from the antisymmetrization and angular-momentum coupling is employed. The relativistic equation-of-motion method allows an ab initio treatment of correlation and relativistic effects in both closed- and open-shell many-body systems. A special case of the present formulation reduces to the relativistic random-phase approximation

Relativistic many-body theory of atomic transitions: the relativistic equation-of-motion approach

International Nuclear Information System (INIS)

Huang, K.N.

1981-01-01

An equation-of-motion approach is used to develop the relativistic many-body theory of atomic transitions. The relativistic equations of motion for transition matrices are formulated using techniques of quantum field theory. To reduce the equation of motion to a tractable form which is appropriate for numerical calculations, a graphical method is employed to resolve the complication arising from the antisymmetrization and angular momentum coupling. The relativistic equation-of-motion method allows an ab initio treatment of correlation and relativistic effects in both closed- and open-shell many-body systems. A special case of the present formulation reduces to the relativistic random-phase approximation

Cortical Thinning in Network-Associated Regions in Cognitively Normal and Below-Normal Range Schizophrenia

Directory of Open Access Journals (Sweden)

R. Walter Heinrichs

2017-01-01

Full Text Available This study assessed whether cortical thickness across the brain and regionally in terms of the default mode, salience, and central executive networks differentiates schizophrenia patients and healthy controls with normal range or below-normal range cognitive performance. Cognitive normality was defined using the MATRICS Consensus Cognitive Battery (MCCB composite score (T=50 ± 10 and structural magnetic resonance imaging was used to generate cortical thickness data. Whole brain analysis revealed that cognitively normal range controls (n=39 had greater cortical thickness than both cognitively normal (n=17 and below-normal range (n=49 patients. Cognitively normal controls also demonstrated greater thickness than patients in regions associated with the default mode and salience, but not central executive networks. No differences on any thickness measure were found between cognitively normal range and below-normal range controls (n=24 or between cognitively normal and below-normal range patients. In addition, structural covariance between network regions was high and similar across subgroups. Positive and negative symptom severity did not correlate with thickness values. Cortical thinning across the brain and regionally in relation to the default and salience networks may index shared aspects of the psychotic psychopathology that defines schizophrenia with no relation to cognitive impairment.

Formal matrices

CERN Document Server

Krylov, Piotr

2017-01-01

This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a sol...

ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES.

Science.gov (United States)

Fan, Jianqing; Rigollet, Philippe; Wang, Weichen

High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓ r norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we show that simple plug-in procedures based on thresholded estimators of correlation matrices are sparsity-adaptive and minimax optimal over a large class of correlation matrices. Akin to previous results on functional estimation, the minimax rates exhibit an elbow phenomenon. Our results are further illustrated in simulated data as well as an empirical study of data arising in financial econometrics.

Structural Equation Modeling with Lisrel: An Initial Vision

OpenAIRE

Naresh K Malhotra; Evandro Luiz Lopes; Ricardo Teixeira Veiga

2014-01-01

LISREL is considered one of the most robust software packages for Structural Equation Modeling with covariance matrices, while it is also considered complex and difficult to use. In this special issue of the Brazilian Journal of Marketing, we aim to present the main functions of LISREL, its features and, through a didactic example, reduce the perceived difficulty of using it. We also provide helpful guidelines to properly using this technique.

Construction of adjoint operators for coupled equations depending on different variables

International Nuclear Information System (INIS)

Hoogenboom, J.E.

1986-01-01

A procedure is described for the construction of the adjoint operator matrix in case of coupled equations defining quantities that depend on different sets of variables. This case is not properly treated in the literature. From this procedure a simple rule can be deduced for the construction of such adjoint operator matrices

THE ALGORITHM AND PROGRAM OF M-MATRICES SEARCH AND STUDY

Directory of Open Access Journals (Sweden)

Y. N. Balonin

2013-05-01

Full Text Available The algorithm and software for search and study of orthogonal bases matrices – minimax matrices (M-matrix are considered. The algorithm scheme is shown, comments on calculation blocks are given, and interface of the MMatrix software system developed with participation of the authors is explained. The results of the universal algorithm work are presented as Hadamard matrices, Belevitch matrices (C-matrices, conference matrices and matrices of even and odd orders complementary and closely related to those ones by their properties, in particular, the matrix of the 22-th order for which there is no C-matrix. Examples of portraits for alternative matrices of the 255-th and the 257-th orders are given corresponding to the sequences of Mersenne and Fermat numbers. A new way to get Hadamard matrices is explained, different from the previously known procedures based on iterative processes and calculations of Lagrange symbols, with theoretical and practical meaning.

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)

Quantum Hilbert matrices and orthogonal polynomials

DEFF Research Database (Denmark)

Andersen, Jørgen Ellegaard; Berg, Christian

2009-01-01

Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|<1 , and for the special value they are closely related to Hankel matrice...

Discrete canonical transforms that are Hadamard matrices

International Nuclear Information System (INIS)

Healy, John J; Wolf, Kurt Bernardo

2011-01-01

The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.

On the Worst-Case Convergence of MR and CG for Symmetric Positive Definite Tridiagonal Toeplitz Matrices

Czech Academy of Sciences Publication Activity Database

Liesen, J.; Tichý, Petr

2005-01-01

Roč. 20, - (2005), s. 180-197 ISSN 1068-9613 R&D Projects: GA AV ČR(CZ) KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : Krylov subspace methods * conjugate gradient method * minimal residual method * convergence analysis * tridiagonal Toeplitz matrices * Poisson equation Subject RIV: BA - General Mathematics Impact factor: 0.608, year: 2005 http://etna.mcs.kent.edu/volumes/2001-2010/vol20/abstract.php?vol=20&pages=180-197

Abel-grassmann's groupoids of modulo matrices

International Nuclear Information System (INIS)

Javaid, Q.; Awan, M.D.; Naqvi, S.H.A.

2016-01-01

The binary operation of usual addition is associative in all matrices over R. However, a binary operation of addition in matrices over Z/sub n/ of a nonassociative structures of AG-groupoids and AG-groups are defined and investigated here. It is shown that both these structures exist for every integer n >≥ 3. Various properties of these structures are explored like: (i) Every AG-groupoid of matrices over Z/sub n/ is transitively commutative AG-groupoid and is a cancellative AG-groupoid if n is prime. (ii) Every AG-groupoid of matrices over Z/sub n/ of Type-II is a T/sup 3/-AG-groupoid. (iii) An AG-groupoid of matrices over Z/sub n/ ; G /sub nAG/(t,u), is an AG-band, if t+u=1(mod n). (author)

Vertical discretizations for compressible Euler equation atmospheric models giving optimal representation of normal modes

International Nuclear Information System (INIS)

Thuburn, J.; Woollings, T.J.

2005-01-01

Accurate representation of different kinds of wave motion is essential for numerical models of the atmosphere, but is sensitive to details of the discretization. In this paper, numerical dispersion relations are computed for different vertical discretizations of the compressible Euler equations and compared with the analytical dispersion relation. A height coordinate, an isentropic coordinate, and a terrain-following mass-based coordinate are considered, and, for each of these, different choices of prognostic variables and grid staggerings are considered. The discretizations are categorized according to whether their dispersion relations are optimal, are near optimal, have a single zero-frequency computational mode, or are problematic in other ways. Some general understanding of the factors that affect the numerical dispersion properties is obtained: heuristic arguments concerning the normal mode structures, and the amount of averaging and coarse differencing in the finite difference scheme, are shown to be useful guides to which configurations will be optimal; the number of degrees of freedom in the discretization is shown to be an accurate guide to the existence of computational modes; there is only minor sensitivity to whether the equations for thermodynamic variables are discretized in advective form or flux form; and an accurate representation of acoustic modes is found to be a prerequisite for accurate representation of inertia-gravity modes, which, in turn, is found to be a prerequisite for accurate representation of Rossby modes

Interpreting the Coulomb-field approximation for generalized-Born electrostatics using boundary-integral equation theory.

Science.gov (United States)

Bardhan, Jaydeep P

2008-10-14

The importance of molecular electrostatic interactions in aqueous solution has motivated extensive research into physical models and numerical methods for their estimation. The computational costs associated with simulations that include many explicit water molecules have driven the development of implicit-solvent models, with generalized-Born (GB) models among the most popular of these. In this paper, we analyze a boundary-integral equation interpretation for the Coulomb-field approximation (CFA), which plays a central role in most GB models. This interpretation offers new insights into the nature of the CFA, which traditionally has been assessed using only a single point charge in the solute. The boundary-integral interpretation of the CFA allows the use of multiple point charges, or even continuous charge distributions, leading naturally to methods that eliminate the interpolation inaccuracies associated with the Still equation. This approach, which we call boundary-integral-based electrostatic estimation by the CFA (BIBEE/CFA), is most accurate when the molecular charge distribution generates a smooth normal displacement field at the solute-solvent boundary, and CFA-based GB methods perform similarly. Conversely, both methods are least accurate for charge distributions that give rise to rapidly varying or highly localized normal displacement fields. Supporting this analysis are comparisons of the reaction-potential matrices calculated using GB methods and boundary-element-method (BEM) simulations. An approximation similar to BIBEE/CFA exhibits complementary behavior, with superior accuracy for charge distributions that generate rapidly varying normal fields and poorer accuracy for distributions that produce smooth fields. This approximation, BIBEE by preconditioning (BIBEE/P), essentially generates initial guesses for preconditioned Krylov-subspace iterative BEMs. Thus, iterative refinement of the BIBEE/P results recovers the BEM solution; excellent agreement

Free probability and random matrices

CERN Document Server

Mingo, James A

2017-01-01

This volume opens the world of free probability to a wide variety of readers. From its roots in the theory of operator algebras, free probability has intertwined with non-crossing partitions, random matrices, applications in wireless communications, representation theory of large groups, quantum groups, the invariant subspace problem, large deviations, subfactors, and beyond. This book puts a special emphasis on the relation of free probability to random matrices, but also touches upon the operator algebraic, combinatorial, and analytic aspects of the theory. The book serves as a combination textbook/research monograph, with self-contained chapters, exercises scattered throughout the text, and coverage of important ongoing progress of the theory. It will appeal to graduate students and all mathematicians interested in random matrices and free probability from the point of view of operator algebras, combinatorics, analytic functions, or applications in engineering and statistical physics.

Decorin-transforming growth factor- interaction regulates matrix organization and mechanical characteristics of three-dimensional collagen matrices.

Science.gov (United States)

Ferdous, Zannatul; Wei, Victoria Mariko; Iozzo, Renato; Höök, Magnus; Grande-Allen, Kathryn Jane

2007-12-07

The small leucine-rich proteoglycan decorin has been demonstrated to be a key regulator of collagen fibrillogenesis; decorin deficiencies lead to irregularly shaped collagen fibrils and weakened material behavior in postnatal murine connective tissues. In an in vitro investigation of the contributions of decorin to tissue organization and material behavior, model tissues were engineered by seeding embryonic fibroblasts, harvested from 12.5-13.5 days gestational aged decorin null (Dcn(-/-)) or wild-type mice, within type I collagen gels. The resulting three-dimensional collagen matrices were cultured for 4 weeks under static tension. The collagen matrices seeded with Dcn(-/-) cells exhibited greater contraction, cell density, ultimate tensile strength, and elastic modulus than those seeded with wild-type cells. Ultrastructurally, the matrices seeded with Dcn(-/-) cells contained a greater density of collagen. The decorin-null tissues contained more biglycan than control tissues, suggesting that this related proteoglycan compensated for the absence of decorin. The effect of transforming growth factor-beta (TGF-beta), which is normally sequestered by decorin, was also investigated in this study. The addition of TGF-beta1 to the matrices seeded with wild-type cells improved their contraction and mechanical strength, whereas blocking TGF-beta1 in the Dcn(-/-) cell-seeded matrices significantly reduced the collagen gel contraction. These results indicate that the inhibitory interaction between decorin and TGF-beta1 significantly influenced the matrix organization and material behavior of these in vitro model tissues.

Quantum matrices in two dimensions

International Nuclear Information System (INIS)

Ewen, H.; Ogievetsky, O.; Wess, J.

1991-01-01

Quantum matrices in two-dimensions, admitting left and right quantum spaces, are classified: they fall into two families, the 2-parametric family GL p,q (2) and a 1-parametric family GL α J (2). Phenomena previously found for GL p,q (2) hold in this general situation: (a) powers of quantum matrices are again quantum and (b) entries of the logarithm of a two-dimensional quantum matrix form a Lie algebra. (orig.)

An Algorithm for Higher Order Hopf Normal Forms

Directory of Open Access Journals (Sweden)

A.Y.T. Leung

1995-01-01

Full Text Available Normal form theory is important for studying the qualitative behavior of nonlinear oscillators. In some cases, higher order normal forms are required to understand the dynamic behavior near an equilibrium or a periodic orbit. However, the computation of high-order normal forms is usually quite complicated. This article provides an explicit formula for the normalization of nonlinear differential equations. The higher order normal form is given explicitly. Illustrative examples include a cubic system, a quadratic system and a Duffing–Van der Pol system. We use exact arithmetic and find that the undamped Duffing equation can be represented by an exact polynomial differential amplitude equation in a finite number of terms.

Wave functions and low-order density matrices for a class of two-electron 'artificial atoms' embracing Hookean and Moshinsky models

International Nuclear Information System (INIS)

Holas, A.; Howard, I.A.; March, N.H.

2003-01-01

A class of model two-electron 'artificial atoms' is proposed which embraces both Hookean and Moshinsky models. Particle densities and spinless first-order density matrices are obtained for this class of models. These quantities and the interacting system kinetic energy can be calculated using the ground-state solution of an explicit single-particle radial Schroedinger equation

Structural Equation Modeling with Lisrel: An Initial Vision

Directory of Open Access Journals (Sweden)

Naresh K Malhotra

2014-05-01

Full Text Available LISREL is considered one of the most robust software packages for Structural Equation Modeling with covariance matrices, while it is also considered complex and difficult to use. In this special issue of the Brazilian Journal of Marketing, we aim to present the main functions of LISREL, its features and, through a didactic example, reduce the perceived difficulty of using it. We also provide helpful guidelines to properly using this technique.

Synchronous correlation matrices and Connes’ embedding conjecture

Energy Technology Data Exchange (ETDEWEB)

Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu [Department of Mathematics, Texas A& M University, College Station, Texas 77843-3368 (United States); Paulsen, Vern, E-mail: vern@math.uh.edu [Department of Mathematics, University of Houston, Houston, Texas 77204 (United States)

2016-01-15

In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove that if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.

Comparative analysis of different weight matrices in subspace system identification for structural health monitoring

Science.gov (United States)

Shokravi, H.; Bakhary, NH

2017-11-01

Subspace System Identification (SSI) is considered as one of the most reliable tools for identification of system parameters. Performance of a SSI scheme is considerably affected by the structure of the associated identification algorithm. Weight matrix is a variable in SSI that is used to reduce the dimensionality of the state-space equation. Generally one of the weight matrices of Principle Component (PC), Unweighted Principle Component (UPC) and Canonical Variate Analysis (CVA) are used in the structure of a SSI algorithm. An increasing number of studies in the field of structural health monitoring are using SSI for damage identification. However, studies that evaluate the performance of the weight matrices particularly in association with accuracy, noise resistance, and time complexity properties are very limited. In this study, the accuracy, noise-robustness, and time-efficiency of the weight matrices are compared using different qualitative and quantitative metrics. Three evaluation metrics of pole analysis, fit values and elapsed time are used in the assessment process. A numerical model of a mass-spring-dashpot and operational data is used in this research paper. It is observed that the principal components obtained using PC algorithms are more robust against noise uncertainty and give more stable results for the pole distribution. Furthermore, higher estimation accuracy is achieved using UPC algorithm. CVA had the worst performance for pole analysis and time efficiency analysis. The superior performance of the UPC algorithm in the elapsed time is attributed to using unit weight matrices. The obtained results demonstrated that the process of reducing dimensionality in CVA and PC has not enhanced the time efficiency but yield an improved modal identification in PC.

Realm of Matrices

Indian Academy of Sciences (India)

IAS Admin

harmonic analysis and complex analysis, in ... gebra describes not only the study of linear transforma- tions and .... special case of the Jordan canonical form of matrices. ..... Richard Bronson, Schaum's Outline Series Theory And Problems Of.

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\

A Divide-and-Conquer Approach for Solving Fuzzy Max-Archimedean t-Norm Relational Equations

Directory of Open Access Journals (Sweden)

Jun-Lin Lin

2014-01-01

Full Text Available A system of fuzzy relational equations with the max-Archimedean t-norm composition was considered. The relevant literature indicated that this problem can be reduced to the problem of finding all the irredundant coverings of a binary matrix. A divide-and-conquer approach is proposed to solve this problem and, subsequently, to solve the original problem. This approach was used to analyze the binary matrix and then decompose the matrix into several submatrices such that the irredundant coverings of the original matrix could be constructed using the irredundant coverings of each of these submatrices. This step was performed recursively for each of these submatrices to obtain the irredundant coverings. Finally, once all the irredundant coverings of the original matrix were found, they were easily converted into the minimal solutions of the fuzzy relational equations. Experiments on binary matrices, with the number of irredundant coverings ranging from 24 to 9680, were also performed. The results indicated that, for test matrices that could initially be partitioned into more than one submatrix, this approach reduced the execution time by more than three orders of magnitude. For the other test matrices, this approach was still useful because certain submatrices could be partitioned into more than one submatrix.

Chequered surfaces and complex matrices

International Nuclear Information System (INIS)

Morris, T.R.; Southampton Univ.

1991-01-01

We investigate a large-N matrix model involving general complex matrices. It can be reinterpreted as a model of two hermitian matrices with specific couplings, and as a model of positive definite hermitian matrices. Large-N perturbation theory generates dynamical triangulations in which the triangles can be chequered (i.e. coloured so that neighbours are opposite colours). On a sphere there is a simple relation between such triangulations and those generated by the single hermitian matrix model. For the torus (and a quartic potential) we solve the counting problem for the number of triangulations that cannot be quechered. The critical physics of chequered triangulations is the same as that of the hermitian matrix model. We show this explicitly by solving non-perturbatively pure two-dimensional ''chequered'' gravity. The interpretative framework given here applies to a number of other generalisations of the hermitian matrix model. (orig.)

Bandwidth Optimization of Normal Equation Matrix in Bundle Block Adjustment in Multi-baseline Rotational Photography

Directory of Open Access Journals (Sweden)

WANG Xiang

2016-02-01

Full Text Available A new bandwidth optimization method of normal equation matrix in bundle block adjustment in multi-baseline rotational close range photography by image index re-sorting is proposed. The equivalent exposure station of each image is calculated by its object space coverage and the relationship with other adjacent images. Then, according to the coordinate relations between equivalent exposure stations, new logical indices of all images are computed, based on which, the optimized bandwidth value can be obtained. Experimental results show that the bandwidth determined by our proposed method is significantly better than its original value, thus the operational efficiency, as well as the memory consumption of multi-baseline rotational close range photography in real-data applications, is optimized to a certain extent.

Synergistic activity of tenofovir and nevirapine combinations released from polycaprolactone matrices for potential enhanced prevention of HIV infection through the vaginal route.

Science.gov (United States)

Dang, Nhung T T; Sivakumaran, Haran; Harrich, David; Shaw, Paul N; Davis-Poynter, Nicholas; Coombes, Allan G A

2014-10-01

Polycaprolactone (PCL) matrices were simultaneously loaded with the antiviral agents, tenofovir (TFV) and nevirapine (NVP), in combination to provide synergistic activity in the prevention of HIV transmission through the vaginal route. TFV and NVP were incorporated in PCL matrices at theoretical loadings of 10%TFV-10% NVP, 5%TFV-5%NVP and 5%TFV-10%NVP, measured with respect to the PCL content of the matrices. Actual TFV loadings ranged from 2.1% to 4.2% equating to loading efficiencies of about 41-42%. The actual loadings of NVP were around half those of TFV (1.2-1.9%), resulting in loading efficiencies ranging from 17.2% to 23.5%. Approximately 80% of the initial content of TFV was released from the PCL matrices into simulated vaginal fluid (SVF) over a period of 30 days, which was almost double the cumulative release of NVP (40-45%). The release kinetics of both antivirals over 30 days were found to be described most satisfactorily by the Higuchi model. In vitro assay of release media containing combinations of TFV and NVP released from PCL matrices confirmed a potential synergistic/additive effect of the released antivirals on HIV-1 infection of HeLa cells. These findings indicate that PCL matrices loaded with combinations of TFV and NVP provide an effective strategy for the sustained vaginal delivery of antivirals with synergistic/additive activity. Copyright © 2014 Elsevier B.V. All rights reserved.

Intrinsic Density Matrices of the Nuclear Shell Model

International Nuclear Information System (INIS)

Deveikis, A.; Kamuntavichius, G.

1996-01-01

A new method for calculation of shell model intrinsic density matrices, defined as two-particle density matrices integrated over the centre-of-mass position vector of two last particles and complemented with isospin variables, has been developed. The intrinsic density matrices obtained are completely antisymmetric, translation-invariant, and do not employ a group-theoretical classification of antisymmetric states. They are used for exact realistic density matrix expansion within the framework of the reduced Hamiltonian method. The procedures based on precise arithmetic for calculation of the intrinsic density matrices that involve no numerical diagonalization or orthogonalization have been developed and implemented in the computer code. (author). 11 refs., 2 tabs

The sl (2 n|2 n) (1) super-Toda lattices and the heavenly equations as continuum limit

International Nuclear Information System (INIS)

Kuznetsova, Zhanna; Popowicz, Ziemowit; Toppan, Francesco.

2005-04-01

The n → ∞ continuum limit of super-Toda models associated with the affine sl (2 n|2 n) (1) (super)algebra series produces (2 + 1)-dimensional integrable equations in the S 1 versus R 2 spacetimes. The equations of motion of the (super)Toda hierarchies depend not only on the chosen (super)algebras but also on the specific presentation of their Cartan matrices. Four distinct series of integrable hierarchies in relation with symmetric-versus-antisymmetric, null-versus-non null presentations of the corresponding Cartan matrices are investigated. In the continuum limit we derive four classes of integrable equations of heavenly type, generalizing the results previously obtained in the literature. The systems are manifestly N = 1 supersymmetric and, for specific choices of the Cartan matrix preserving the complex structure, admit a hidden N = 2 supersymmetry. The coset reduction of the (super)-heavenly equation to the I versus R (2) (S 1 /Z 2 ) versus R 2 spacetime (with I a line segment) is illustrated. Finally, integrable N = 2,4 super symmetrically extended models in (1 + 1) dimensions are constructed through dimensional reduction of the previous systems. (author)

Quantum Entanglement and Reduced Density Matrices

Science.gov (United States)

Purwanto, Agus; Sukamto, Heru; Yuwana, Lila

2018-05-01

We investigate entanglement and separability criteria of multipartite (n-partite) state by examining ranks of its reduced density matrices. Firstly, we construct the general formula to determine the criterion. A rank of origin density matrix always equals one, meanwhile ranks of reduced matrices have various ranks. Next, separability and entanglement criterion of multipartite is determined by calculating ranks of reduced density matrices. In this article we diversify multipartite state criteria into completely entangled state, completely separable state, and compound state, i.e. sub-entangled state and sub-entangledseparable state. Furthermore, we also shorten the calculation proposed by the previous research to determine separability of multipartite state and expand the methods to be able to differ multipartite state based on criteria above.

Computer program /P1-GAS/ calculates the P-0 and P-1 transfer matrices for neutron moderation in a monatomic gas

Science.gov (United States)

Collier, G.; Gibson, G.

1968-01-01

FORTRAN 4 program /P1-GAS/ calculates the P-O and P-1 transfer matrices for neutron moderation in a monatomic gas. The equations used are based on the conditions that there is isotropic scattering in the center-of-mass coordinate system, the scattering cross section is constant, and the target nuclear velocities satisfy a Maxwellian distribution.

A Direct Derivation of the Equations of Motion for 3D-Flexible Mechanical Systems

DEFF Research Database (Denmark)

Pedersen, Niels Leergaard; Pedersen, Mads Leergaard

1998-01-01

equations for flexible mechanical systems are derived using the principle of virtual work, which introduces inertia in a straightforward manner, because this principle treats inertia as a force. The flexible formulation is exemplified by the use of circular beam elements and some basic matrices are derived...

Malware analysis using visualized image matrices.

Science.gov (United States)

Han, KyoungSoo; Kang, BooJoong; Im, Eul Gyu

2014-01-01

This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API) calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.

Malware Analysis Using Visualized Image Matrices

Directory of Open Access Journals (Sweden)

KyoungSoo Han

2014-01-01

Full Text Available This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.

Nonlinear dynamics exploration through normal forms

CERN Document Server

Kahn, Peter B

2014-01-01

Geared toward advanced undergraduates and graduate students, this exposition covers the method of normal forms and its application to ordinary differential equations through perturbation analysis. In addition to its emphasis on the freedom inherent in the normal form expansion, the text features numerous examples of equations, the kind of which are encountered in many areas of science and engineering. The treatment begins with an introduction to the basic concepts underlying the normal forms. Coverage then shifts to an investigation of systems with one degree of freedom that model oscillations

Production and characterization of cornstarch/cellulose acetate/silver sulfadiazine extrudate matrices

Energy Technology Data Exchange (ETDEWEB)

Zepon, Karine Modolon [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Petronilho, Fabricia [FICEXP, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Soldi, Valdir [POLIMAT, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Salmoria, Gean Vitor [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Kanis, Luiz Alberto, E-mail: luiz.kanis@unisul.br [TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil)

2014-11-01

The production and evaluation of cornstarch/cellulose acetate/silver sulfadiazine extrudate matrices are reported herein. The matrices were melt extruded under nine different conditions, altering the temperature and the screw speed values. The surface morphology of the matrices was examined by scanning electron microscopy. The micrographs revealed the presence of non-melted silver sulfadiazine microparticles in the matrices extruded at lower temperature and screw speed values. The thermal properties were evaluated and the results for both the biopolymer and the drug indicated no thermal degradation during the melt extrusion process. The differential scanning analysis of the extrudate matrices showed a shift to lower temperatures for the silver sulfadiazine melting point compared with the non-extruded drug. The starch/cellulose acetate matrices containing silver sulfadiazine demonstrated significant inhibition of the growth of Pseudomonas aeruginosa and Staphylococcus aureus. In vivo inflammatory response tests showed that the extrudate matrices, with or without silver sulfadiazine, did not trigger chronic inflammatory processes. - Highlights: • Melt extruded bio-based matrices containing silver sulfadiazine was produced. • The silver sulfadiazine is stable during melt-extrusion. • The extrudate matrices shown bacterial growth inhibition. • The matrices obtained have potential to development wound healing membranes.

Polynomial sequences generated by infinite Hessenberg matrices

Directory of Open Access Journals (Sweden)

Verde-Star Luis

2017-01-01

Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.

S-matrices and integrability

International Nuclear Information System (INIS)

Bombardelli, Diego

2016-01-01

In these notes we review the S-matrix theory in (1+1)-dimensional integrable models, focusing mainly on the relativistic case. Once the main definitions and physical properties are introduced, we discuss the factorization of scattering processes due to integrability. We then focus on the analytic properties of the two-particle scattering amplitude and illustrate the derivation of the S-matrices for all the possible bound states using the so-called bootstrap principle. General algebraic structures underlying the S-matrix theory and its relation with the form factors axioms are briefly mentioned. Finally, we discuss the S-matrices of sine-Gordon and SU (2), SU (3) chiral Gross–Neveu models. (topical review)

Matrices Aléatoires Tri-diagonales et Par Blocs.

OpenAIRE

MEKKI, Slimane

2014-01-01

Dans ce mémoire l'étude porte sur la densité de matrice aléatoire, les densités des valeurs propres d'une matrice pour les trois ensembles G.O.E, G.U.E, G.S.E. Après nous avons explicité les formules des densités de valeurs propres des matrices tri-diagonales dans les cas HERMITE et LAGUERRE Des simulations sur les constantes de normalisations pour les densités des matrices aléatoires ou des valeurs propres sont présentées.

Hierarchical quark mass matrices

International Nuclear Information System (INIS)

Rasin, A.

1998-02-01

I define a set of conditions that the most general hierarchical Yukawa mass matrices have to satisfy so that the leading rotations in the diagonalization matrix are a pair of (2,3) and (1,2) rotations. In addition to Fritzsch structures, examples of such hierarchical structures include also matrices with (1,3) elements of the same order or even much larger than the (1,2) elements. Such matrices can be obtained in the framework of a flavor theory. To leading order, the values of the angle in the (2,3) plane (s 23 ) and the angle in the (1,2) plane (s 12 ) do not depend on the order in which they are taken when diagonalizing. We find that any of the Cabbibo-Kobayashi-Maskawa matrix parametrizations that consist of at least one (1,2) and one (2,3) rotation may be suitable. In the particular case when the s 13 diagonalization angles are sufficiently small compared to the product s 12 s 23 , two special CKM parametrizations emerge: the R 12 R 23 R 12 parametrization follows with s 23 taken before the s 12 rotation, and vice versa for the R 23 R 12 R 23 parametrization. (author)

Laminin active peptide/agarose matrices as multifunctional biomaterials for tissue engineering.

Science.gov (United States)

Yamada, Yuji; Hozumi, Kentaro; Aso, Akihiro; Hotta, Atsushi; Toma, Kazunori; Katagiri, Fumihiko; Kikkawa, Yamato; Nomizu, Motoyoshi

2012-06-01

Cell adhesive peptides derived from extracellular matrix components are potential candidates to afford bio-adhesiveness to cell culture scaffolds for tissue engineering. Previously, we covalently conjugated bioactive laminin peptides to polysaccharides, such as chitosan and alginate, and demonstrated their advantages as biomaterials. Here, we prepared functional polysaccharide matrices by mixing laminin active peptides and agarose gel. Several laminin peptide/agarose matrices showed cell attachment activity. In particular, peptide AG73 (RKRLQVQLSIRT)/agarose matrices promoted strong cell attachment and the cell behavior depended on the stiffness of agarose matrices. Fibroblasts formed spheroid structures on the soft AG73/agarose matrices while the cells formed a monolayer with elongated morphologies on the stiff matrices. On the stiff AG73/agarose matrices, neuronal cells extended neuritic processes and endothelial cells formed capillary-like networks. In addition, salivary gland cells formed acini-like structures on the soft matrices. These results suggest that the peptide/agarose matrices are useful for both two- and three-dimensional cell culture systems as a multifunctional biomaterial for tissue engineering. Copyright © 2012 Elsevier Ltd. All rights reserved.

From a world-sheet supersymmetry to the Dirac equation

International Nuclear Information System (INIS)

Mankoc Borstnik, N.

1991-10-01

Starting from a classical action for a point particle with a local world-sheet supersymmetry, the Dirac equation follows with operators α-vector, β-vector γ-vector being defined in the Grassmann space as differential operators and having all the properties of the corresponding Dirac matrices except that α-vector and β-vector are anti-Hermitian rather than Hermitian. Such a particle interacts with an external field as expected. (author). 7 refs

Fractional Diffusion Equations and Anomalous Diffusion

Science.gov (United States)

Evangelista, Luiz Roberto; Kaminski Lenzi, Ervin

2018-01-01

Preface; 1. Mathematical preliminaries; 2. A survey of the fractional calculus; 3. From normal to anomalous diffusion; 4. Fractional diffusion equations: elementary applications; 5. Fractional diffusion equations: surface effects; 6. Fractional nonlinear diffusion equation; 7. Anomalous diffusion: anisotropic case; 8. Fractional Schrödinger equations; 9. Anomalous diffusion and impedance spectroscopy; 10. The Poisson–Nernst–Planck anomalous (PNPA) models; References; Index.

The Antitriangular Factorization of Saddle Point Matrices

KAUST Repository

Pestana, J.

2014-01-01

Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle point matrices and demonstrate how it represents the common nullspace method. We show that rank-1 updates to the saddle point matrix can be easily incorporated into the factorization and give bounds on the eigenvalues of matrices important in saddle point theory. We show the relation of this factorization to constraint preconditioning and how it transforms but preserves the structure of block diagonal and block triangular preconditioners. © 2014 Society for Industrial and Applied Mathematics.

Graphs and matrices

CERN Document Server

Bapat, Ravindra B

2014-01-01

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

Bayesian Nonparametric Clustering for Positive Definite Matrices.

Science.gov (United States)

Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos

2016-05-01

Symmetric Positive Definite (SPD) matrices emerge as data descriptors in several applications of computer vision such as object tracking, texture recognition, and diffusion tensor imaging. Clustering these data matrices forms an integral part of these applications, for which soft-clustering algorithms (K-Means, expectation maximization, etc.) are generally used. As is well-known, these algorithms need the number of clusters to be specified, which is difficult when the dataset scales. To address this issue, we resort to the classical nonparametric Bayesian framework by modeling the data as a mixture model using the Dirichlet process (DP) prior. Since these matrices do not conform to the Euclidean geometry, rather belongs to a curved Riemannian manifold,existing DP models cannot be directly applied. Thus, in this paper, we propose a novel DP mixture model framework for SPD matrices. Using the log-determinant divergence as the underlying dissimilarity measure to compare these matrices, and further using the connection between this measure and the Wishart distribution, we derive a novel DPM model based on the Wishart-Inverse-Wishart conjugate pair. We apply this model to several applications in computer vision. Our experiments demonstrate that our model is scalable to the dataset size and at the same time achieves superior accuracy compared to several state-of-the-art parametric and nonparametric clustering algorithms.

Solution of the classical Yang–Baxter equation with an exotic symmetry, and integrability of a multi-species boson tunnelling model

Energy Technology Data Exchange (ETDEWEB)

Links, Jon, E-mail: jrl@maths.uq.edu.au

2017-03-15

Solutions of the classical Yang–Baxter equation provide a systematic method to construct integrable quantum systems in an algebraic manner. A Lie algebra can be associated with any solution of the classical Yang–Baxter equation, from which commuting transfer matrices may be constructed. This procedure is reviewed, specifically for solutions without skew-symmetry. A particular solution with an exotic symmetry is identified, which is not obtained as a limiting expansion of the usual Yang–Baxter equation. This solution facilitates the construction of commuting transfer matrices which will be used to establish the integrability of a multi-species boson tunnelling model. The model generalises the well-known two-site Bose–Hubbard model, to which it reduces in the one-species limit. Due to the lack of an apparent reference state, application of the algebraic Bethe Ansatz to solve the model is prohibitive. Instead, the Bethe Ansatz solution is obtained by the use of operator identities and tensor product decompositions.

Resolution of Laplace equation in a region containing plane and cylindrical charged plates

International Nuclear Information System (INIS)

Jesus Paes, A.C. de.

1986-05-01

A computational program to solve the Laplace equation, in two dimensions, was developed. Cylindrical coordinates were used and the electric potential was calculated in a region bounded by an eccentric circunference that is grounded and in this region there were electrodes at known potential. The iterative method of Gauss-Seidel was used to solve the equation and the matrix of the coefficients, a sparse matrix, was stored in a compacted form in three line matrices. The distribution of this electric field were obtained from the potential and a subroutine to draw was developed. (author) [pt

Online monitoring of dispersion functions and transfer matrices at the SLC

International Nuclear Information System (INIS)

Emma, P.; Fieguth, T.H.; Lohse, T.; Burchat, P.R.; Panvini, R.S.

1989-03-01

The symmetries of the chromatic correction sections in the SLC Final Focus System allow a high-resolution determination of the pulse-to-pulse energy fluctuations by exploiting the information from beam position monitors (BPMs) in regions of large dispersion. By correlating this signal with other BPMs, one can infer the dispersion function as well as spatial components of transfer matrices anywhere in the arcs and the Final Focus System without interrupting normal machine operation. We present results from data recorded during either periods of stable operation or periods when the linac energy was intentionally varied. 6 refs., 7 figs

On Skew Circulant Type Matrices Involving Any Continuous Fibonacci Numbers

Directory of Open Access Journals (Sweden)

Zhaolin Jiang

2014-01-01

inverse matrices of them by constructing the transformation matrices. Furthermore, the maximum column sum matrix norm, the spectral norm, the Euclidean (or Frobenius norm, and the maximum row sum matrix norm and bounds for the spread of these matrices are given, respectively.

Immanant Conversion on Symmetric Matrices

Directory of Open Access Journals (Sweden)

Purificação Coelho M.

2014-01-01

Full Text Available Letr Σn(C denote the space of all n χ n symmetric matrices over the complex field C. The main objective of this paper is to prove that the maps Φ : Σn(C -> Σn (C satisfying for any fixed irre- ducible characters X, X' -SC the condition dx(A +aB = dχ·(Φ(Α + αΦ(Β for all matrices A,В ε Σ„(С and all scalars a ε C are automatically linear and bijective. As a corollary of the above result we characterize all such maps Φ acting on ΣИ(С.

The 'golden' matrices and a new kind of cryptography

International Nuclear Information System (INIS)

Stakhov, A.P.

2007-01-01

We consider a new class of square matrices called the 'golden' matrices. They are a generalization of the classical Fibonacci Q-matrix for continuous domain. The 'golden' matrices can be used for creation of a new kind of cryptography called the 'golden' cryptography. The method is very fast and simple for technical realization and can be used for cryptographic protection of digital signals (telecommunication and measurement systems)

On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices

KAUST Repository

Pestana, Jennifer

2014-01-01

Block lower triangular matrices and block upper triangular matrices are popular preconditioners for 2×2 block matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned matrices are related. © 2014 Society for Industrial and Applied Mathematics.

Universal properties of two-port scattering, impedance, and admittance matrices of wave-chaotic systems

International Nuclear Information System (INIS)

Hemmady, Sameer; Zheng, Xing; Hart, James; Antonsen, Thomas M. Jr.; Ott, Edward; Anlage, Steven M.

2006-01-01

Statistical fluctuations in the eigenvalues of the scattering, impedance, and admittance matrices of two-port wave-chaotic systems are studied experimentally using a chaotic microwave cavity. These fluctuations are universal in that their properties are dependent only upon the degree of loss in the cavity. We remove the direct processes introduced by the nonideally coupled driving ports through a matrix normalization process that involves the radiation-impedance matrix of the two driving ports. We find good agreement between the experimentally obtained marginal probability density functions (PDFs) of the eigenvalues of the normalized impedance, admittance, and scattering matrix and those from random matrix theory (RMT). We also experimentally study the evolution of the joint PDF of the eigenphases of the normalized scattering matrix as a function of loss. Experimental agreement with the theory by Brouwer and Beenakker for the joint PDF of the magnitude of the eigenvalues of the normalized scattering matrix is also shown

"G.P.S Matrices" programme: A method to improve the mastery level of social science students in matrices operations

Science.gov (United States)

Lee, Ken Voon

2013-04-01

The purpose of this action research was to increase the mastery level of Form Five Social Science students in Tawau II National Secondary School in the operations of addition, subtraction and multiplication of matrices in Mathematics. A total of 30 students were involved. Preliminary findings through the analysis of pre-test results and questionnaire had identified the main problem faced in which the students felt confused with the application of principles of the operations of matrices when performing these operations. Therefore, an action research was conducted using an intervention programme called "G.P.S Matrices" to overcome the problem. This programme was divided into three phases. 'Gift of Matrices' phase aimed at forming matrix teaching aids. The second and third phases were 'Positioning the Elements of Matrices' and 'Strenghtening the Concept of Matrices'. These two phases were aimed at increasing the level of understanding and memory of the students towards the principles of matrix operations. Besides, this third phase was also aimed at creating an interesting learning environment. A comparison between the results of pre-test and post-test had shown a remarkable improvement in students' performances after implementing the programme. In addition, the analysis of interview findings also indicated a positive feedback on the changes in students' attitude, particularly in the aspect of students' understanding level. Moreover, the level of students' memory also increased following the use of the concrete matrix teaching aids created in phase one. Besides, teachers felt encouraging when conducive learning environment was created through students' presentation activity held in third phase. Furthermore, students were voluntarily involved in these student-centred activities. In conclusion, this research findings showed an increase in the mastery level of students in these three matrix operations and thus the objective of the research had been achieved.

Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations

Directory of Open Access Journals (Sweden)

Farahnaz Soleimani

2015-11-01

Full Text Available An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on the possibility to accelerate the iterations in the initial phase of the convergence. Although the effectiveness of our approach is confirmed on the basis of the theoretical point of view, some numerical comparisons in balancing chemical equations, as well as on randomly-generated matrices are furnished.

CONVERGENCE OF POWERS OF CONTROLLABLE INTUITIONISTIC FUZZY MATRICES

OpenAIRE

Riyaz Ahmad Padder; P. Murugadas

2016-01-01

Convergences of powers of controllable intuitionistic fuzzy matrices have been stud¬ied. It is shown that they oscillate with period equal to 2, in general. Some equalities and sequences of inequalities about powers of controllable intuitionistic fuzzy matrices have been obtained.

Loop diagrams without γ matrices

International Nuclear Information System (INIS)

McKeon, D.G.C.; Rebhan, A.

1993-01-01

By using a quantum-mechanical path integral to compute matrix elements of the form left-angle x|exp(-iHt)|y right-angle, radiative corrections in quantum-field theory can be evaluated without encountering loop-momentum integrals. In this paper we demonstrate how Dirac γ matrices that occur in the proper-time ''Hamiltonian'' H lead to the introduction of a quantum-mechanical path integral corresponding to a superparticle analogous to one proposed recently by Fradkin and Gitman. Direct evaluation of this path integral circumvents many of the usual algebraic manipulations of γ matrices in the computation of quantum-field-theoretical Green's functions involving fermions

Classification en référence à une matrice stochastique

OpenAIRE

Verdun , Stéphane; Cariou , Véronique; Qannari , El Mostafa

2009-01-01

International audience; Etant donné un tableau de données X portant sur un ensemble de n objets, et une matrice stochastique S qui peut être assimilée à une matrice de transition d'une chaîne de Markov, nous proposons une méthode de partitionnement consistant à appliquer la matrice S sur X de manière itérative jusqu'à convergence. Les classes formant la partition sont déterminées à partir des états stationnaires de la matrice stochastique. Cette matrice stochastique peut être issue d'une matr...

Capture Matrices Handbook

Science.gov (United States)

2014-04-01

materials, the affinity ligand would need identification , as well as chemistries that graft the affinity ligand onto the surface of magnetic...ACTIVE CAPTURE MATRICES FOR THE DETECTION/ IDENTIFICATION OF PHARMACEUTICALS...6 As shown in Figure 2.3-1a, the spectra exhibit similar baselines and the spectral peaks lineup . Under these circumstances, the spectral

Binary Positive Semidefinite Matrices and Associated Integer Polytopes

DEFF Research Database (Denmark)

Letchford, Adam N.; Sørensen, Michael Malmros

2012-01-01

We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...

Excited TBA equations I: Massive tricritical Ising model

International Nuclear Information System (INIS)

Pearce, Paul A.; Chim, Leung; Ahn, Changrim

2001-01-01

We consider the massive tricritical Ising model M(4,5) perturbed by the thermal operator phi (cursive,open) Greek 1,3 in a cylindrical geometry and apply integrable boundary conditions, labelled by the Kac labels (r,s), that are natural off-critical perturbations of known conformal boundary conditions. We derive massive thermodynamic Bethe ansatz (TBA) equations for all excitations by solving, in the continuum scaling limit, the TBA functional equation satisfied by the double-row transfer matrices of the A 4 lattice model of Andrews, Baxter and Forrester (ABF) in Regime III. The complete classification of excitations, in terms of (m,n) systems, is precisely the same as at the conformal tricritical point. Our methods also apply on a torus but we first consider (r,s) boundaries on the cylinder because the classification of states is simply related to fermionic representations of single Virasoro characters χ r,s (q). We study the TBA equations analytically and numerically to determine the conformal UV and free particle IR spectra and the connecting massive flows. The TBA equations in Regime IV and massless RG flows are studied in Part II

Hi-Corrector: a fast, scalable and memory-efficient package for normalizing large-scale Hi-C data.

Science.gov (United States)

Li, Wenyuan; Gong, Ke; Li, Qingjiao; Alber, Frank; Zhou, Xianghong Jasmine

2015-03-15

Genome-wide proximity ligation assays, e.g. Hi-C and its variant TCC, have recently become important tools to study spatial genome organization. Removing biases from chromatin contact matrices generated by such techniques is a critical preprocessing step of subsequent analyses. The continuing decline of sequencing costs has led to an ever-improving resolution of the Hi-C data, resulting in very large matrices of chromatin contacts. Such large-size matrices, however, pose a great challenge on the memory usage and speed of its normalization. Therefore, there is an urgent need for fast and memory-efficient methods for normalization of Hi-C data. We developed Hi-Corrector, an easy-to-use, open source implementation of the Hi-C data normalization algorithm. Its salient features are (i) scalability-the software is capable of normalizing Hi-C data of any size in reasonable times; (ii) memory efficiency-the sequential version can run on any single computer with very limited memory, no matter how little; (iii) fast speed-the parallel version can run very fast on multiple computing nodes with limited local memory. The sequential version is implemented in ANSI C and can be easily compiled on any system; the parallel version is implemented in ANSI C with the MPI library (a standardized and portable parallel environment designed for solving large-scale scientific problems). The package is freely available at http://zhoulab.usc.edu/Hi-Corrector/. © The Author 2014. Published by Oxford University Press.

Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank

OpenAIRE

Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo

2017-01-01

Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...

Data depth and rank-based tests for covariance and spectral density matrices

KAUST Repository

Chau, Joris

2017-06-26

In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.

Data depth and rank-based tests for covariance and spectral density matrices

KAUST Repository

Chau, Joris; Ombao, Hernando; Sachs, Rainer von

2017-01-01

In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.

A homotopy method for solving Riccati equations on a shared memory parallel computer

International Nuclear Information System (INIS)

Zigic, D.; Watson, L.T.; Collins, E.G. Jr.; Davis, L.D.

1993-01-01

Although there are numerous algorithms for solving Riccati equations, there still remains a need for algorithms which can operate efficiently on large problems and on parallel machines. This paper gives a new homotopy-based algorithm for solving Riccati equations on a shared memory parallel computer. The central part of the algorithm is the computation of the kernel of the Jacobian matrix, which is essential for the corrector iterations along the homotopy zero curve. Using a Schur decomposition the tensor product structure of various matrices can be efficiently exploited. The algorithm allows for efficient parallelization on shared memory machines

Almost commuting self-adjoint matrices: The real and self-dual cases

Science.gov (United States)

Loring, Terry A.; Sørensen, Adam P. W.

2016-08-01

We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

Forecasting Covariance Matrices: A Mixed Frequency Approach

DEFF Research Database (Denmark)

Halbleib, Roxana; Voev, Valeri

This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows for flexi......This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows...... for flexible dependence patterns for volatilities and correlations, and can be applied to covariance matrices of large dimensions. The separate modeling of volatility and correlation forecasts considerably reduces the estimation and measurement error implied by the joint estimation and modeling of covariance...

Propositional matrices as alternative representation of truth values ...

African Journals Online (AJOL)

The paper considered the subject of representation of truth values in symbolic logic. An alternative representation was given based on the rows and columns properties of matrices, with the operations involving the logical connectives subjected to the laws of algebra of propositions. Matrices of various propositions detailing ...

MAIA, Eigenvalues for MHD Equation of Tokamak Plasma Stability Problems

International Nuclear Information System (INIS)

Tanaka, Y.; Azumi, M.; Kurita, G.; Tsunematsu, T.; Takeda, T.

1986-01-01

1 - Description of program or function: This program solves an eigenvalue problem zBx=Ax where A and B are real block tri-diagonal matrices. This eigenvalue problem is derived from a reduced set of linear resistive MHD equations which is often employed to study tokamak plasma stability problem. 2 - Method of solution: Both the determinant and inverse iteration methods are employed. 3 - Restrictions on the complexity of the problem: The eigenvalue z must be real

Wishart and anti-Wishart random matrices

International Nuclear Information System (INIS)

Janik, Romuald A; Nowak, Maciej A

2003-01-01

We provide a compact exact representation for the distribution of the matrix elements of the Wishart-type random matrices A † A, for any finite number of rows and columns of A, without any large N approximations. In particular, we treat the case when the Wishart-type random matrix contains redundant, non-random information, which is a new result. This representation is of interest for a procedure for reconstructing the redundant information hidden in Wishart matrices, with potential applications to numerous models based on biological, social and artificial intelligence networks

Information geometry of density matrices and state estimation

International Nuclear Information System (INIS)

Brody, Dorje C

2011-01-01

Given a pure state vector |x) and a density matrix ρ-hat, the function p(x|ρ-hat)= defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher-Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived. (fast track communication)

EGSIEM combination service: combination of GRACE monthly K-band solutions on normal equation level

Science.gov (United States)

Meyer, Ulrich; Jean, Yoomin; Arnold, Daniel; Jäggi, Adrian

2017-04-01

The European Gravity Service for Improved Emergency Management (EGSIEM) project offers a scientific combination service, combining for the first time monthly GRACE gravity fields of different analysis centers (ACs) on normal equation (NEQ) level and thus taking all correlations between the gravity field coefficients and pre-eliminated orbit and instrument parameters correctly into account. Optimal weights for the individual NEQs are commonly derived by variance component estimation (VCE), as is the case for the products of the International VLBI Service (IVS) or the DTRF2008 reference frame realisation that are also derived by combination on NEQ-level. But variance factors are based on post-fit residuals and strongly depend on observation sampling and noise modeling, which both are very diverse in case of the individual EGSIEM ACs. These variance factors do not necessarily represent the true error levels of the estimated gravity field parameters that are still governed by analysis noise. We present a combination approach where weights are derived on solution level, thereby taking the analysis noise into account.

Supercritical fluid extraction behaviour of polymer matrices

International Nuclear Information System (INIS)

Sujatha, K.; Kumar, R.; Sivaraman, N.; Srinivasan, T.G.; Vasudeva Rao, P.R.

2007-01-01

Organic compounds present in polymeric matrices such as neoprene, surgical gloves and PVC were co-extracted during the removal of uranium using supercritical fluid extraction (SFE) technique. Hence SFE studies of these matrices were carried out to establish the extracted species using HPLC, IR and mass spectrometry techniques. The initial study indicated that uranium present in the extract could be purified from the co-extracted organic species. (author)

The solution space of the unitary matrix model string equation and the Sato Grassmannian

International Nuclear Information System (INIS)

Anagnostopoulos, K.N.; Bowick, M.J.; Schwarz, A.

1992-01-01

The space of all solutions to the string equation of the symmetric unitary one-matrix model is determined. It is shown that the string equations is equivalent to simple conditions on points V 1 and V 2 in the big cell Gr (0) of the Sato Grassmannian Gr. This is a consequence of a well-defined continuum limit in which the string equation has the simple form [P, 2 - ]=1, with P and 2 - 2x2 matrices of differential operators. These conditions on V 1 and V 2 yield a simple system of first order differential equations whose analysis determines the space of all solutions to the string equation. This geometric formulation leads directly to the Virasoro constraints L n (n≥0), where L n annihilate the two modified-KdV τ-functions whose product gives the partition function of the Unitary Matrix Model. (orig.)

TOEPLITZ, Solution of Linear Equation System with Toeplitz or Circulant Matrix

International Nuclear Information System (INIS)

Garbow, B.

1984-01-01

Description of program or function: TOEPLITZ is a collection of FORTRAN subroutines for solving linear systems Ax=b, where A is a Toeplitz matrix, a Circulant matrix, or has one or several block structures based on Toeplitz or Circulant matrices. Such systems arise in problems of electrodynamics, acoustics, mathematical statistics, algebra, in the numerical solution of integral equations with a difference kernel, and in the theory of stationary time series and signals

Fabrication of Aligned Carbon Nanotube/Polycaprolactone/Gelatin Nanofibrous Matrices for Schwann Cell Immobilization

Directory of Open Access Journals (Sweden)

Shiao-Wen Tsai

2014-01-01

Full Text Available In this study, we utilized a mandrel rotating collector consisting of two parallel, electrically conductive pieces of tape to fabricate aligned electrospun polycaprolactone/gelatin (PG and carbon nanotube/polycaprolactone/gelatin (PGC nanofibrous matrices. Furthermore, we examined the biological performance of the PGC nanofibrous and film matrices using an in vitro culture of RT4-D6P2T rat Schwann cells. Using cell adhesion tests, we found that carbon nanotube inhibited Schwann cell attachment on PGC nanofibrous and film matrices. However, the proliferation rates of Schwann cells were higher when they were immobilized on PGC nanofibrous matrices compared to PGC film matrices. Using western blot analysis, we found that NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PG nanofibrous matrices. However, the carbon nanotube inhibited NRG1 and P0 protein expression in cells immobilized on PGC film matrices. Moreover, the NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PGC film matrices. We found that the matrix topography and composition influenced Schwann cell behavior.

Numerical solution of the 1D kinetics equations using a cubic reduced nodal scheme

International Nuclear Information System (INIS)

Gomez T, A.M.; Valle G, E. del; Delfin L, A.; Alonso V, G.

2003-01-01

In this work a finite differences technique centered in mesh based on a cubic reduced nodal scheme type finite element to solve the equations of the kinetics 1 D that include the equations corresponding to the concentrations of precursors of delayed neutrons is described. The technique of finite elements used is that of Galerkin where so much the neutron flux as the concentrations of precursors its are spatially approached by means of a three grade polynomial. The matrices of rigidity and of mass that arise during this discretization process are numerically evaluated using the open quadrature non standard of Newton-Cotes and that of Radau respectively. The purpose of the application of these quadratures is the one of to eliminate in the global matrices the couplings among the values of the flow in points of the discretization with the consequent advantages as for the reduction of the order of the matrix associated to the discreet problem that is to solve. As for the time dependent part the classical integration scheme known as Θ scheme is applied. After carrying out the one reordering of unknown and equations it arrives to a reduced system that it can be solved but quickly. With the McKin compute program developed its were solved three benchmark problems and those results are shown for the relative powers. (Author)

Effective Schroedinger equations on submanifolds

Energy Technology Data Exchange (ETDEWEB)

Wachsmuth, Jakob

2010-02-11

In this thesis the time dependent Schroedinger equation is considered on a Riemannian manifold A with a potential that localizes a certain class of states close to a fixed submanifold C, the constraint manifold. When the potential is scaled in the directions normal to C by a small parameter epsilon, the solutions concentrate in an epsilon-neighborhood of the submanifold. An effective Schroedinger equation on the submanifold C is derived and it is shown that its solutions, suitably lifted to A, approximate the solutions of the original equation on A up to errors of order {epsilon}{sup 3} vertical stroke t vertical stroke at time t. Furthermore, it is proved that, under reasonable conditions, the eigenvalues of the corresponding Hamiltonians below a certain energy coincide upto errors of order {epsilon}{sup 3}. These results holds in the situation where tangential and normal energies are of the same order, and where exchange between normal and tangential energies occurs. In earlier results tangential energies were assumed to be small compared to normal energies, and rather restrictive assumptions were needed, to ensure that the separation of energies is maintained during the time evolution. The most important consequence of this thesis is that now constraining potentials that change their shape along the submanifold can be treated, which is the typical situation in applications like molecular dynamics and quantum waveguides.

Nano-Fiber Reinforced Enhancements in Composite Polymer Matrices

Science.gov (United States)

Chamis, Christos C.

2009-01-01

Nano-fibers are used to reinforce polymer matrices to enhance the matrix dependent properties that are subsequently used in conventional structural composites. A quasi isotropic configuration is used in arranging like nano-fibers through the thickness to ascertain equiaxial enhanced matrix behavior. The nano-fiber volume ratios are used to obtain the enhanced matrix strength properties for 0.01,0.03, and 0.05 nano-fiber volume rates. These enhanced nano-fiber matrices are used with conventional fiber volume ratios of 0.3 and 0.5 to obtain the composite properties. Results show that nano-fiber enhanced matrices of higher than 0.3 nano-fiber volume ratio are degrading the composite properties.

Groups, matrices, and vector spaces a group theoretic approach to linear algebra

CERN Document Server

Carrell, James B

2017-01-01

This unique text provides a geometric approach to group theory and linear algebra, bringing to light the interesting ways in which these subjects interact. Requiring few prerequisites beyond understanding the notion of a proof, the text aims to give students a strong foundation in both geometry and algebra. Starting with preliminaries (relations, elementary combinatorics, and induction), the book then proceeds to the core topics: the elements of the theory of groups and fields (Lagrange's Theorem, cosets, the complex numbers and the prime fields), matrix theory and matrix groups, determinants, vector spaces, linear mappings, eigentheory and diagonalization, Jordan decomposition and normal form, normal matrices, and quadratic forms. The final two chapters consist of a more intensive look at group theory, emphasizing orbit stabilizer methods, and an introduction to linear algebraic groups, which enriches the notion of a matrix group. Applications involving symm etry groups, determinants, linear coding theory ...

3j Symbols: To Normalize or Not to Normalize?

Science.gov (United States)

van Veenendaal, Michel

2011-01-01

The systematic use of alternative normalization constants for 3j symbols can lead to a more natural expression of quantities, such as vector products and spherical tensor operators. The redefined coupling constants directly equate tensor products to the inner and outer products without any additional square roots. The approach is extended to…

Factorizations of rational matrix functions with application to discrete isomonodromic transformations and difference Painleve equations

International Nuclear Information System (INIS)

Dzhamay, Anton

2009-01-01

We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this space is given by a mix of residue eigenvectors of the matrix and its inverse. Our approach is motivated by the theory of discrete isomonodromic transformations and their relationship with difference Painleve equations. In particular, in these coordinates, basic isomonodromic transformations take the form of the discrete Euler-Lagrange equations. Secondly we show that dPV equations, previously obtained in this context by D Arinkin and A Borodin, can be understood as simple relationships between the residues of such matrices and their inverses.

Meet and Join Matrices in the Poset of Exponential Divisors

Indian Academy of Sciences (India)

... exponential divisor ( G C E D ) and the least common exponential multiple ( L C E M ) do not always exist. In this paper we embed this poset in a lattice. As an application we study the G C E D and L C E M matrices, analogues of G C D and L C M matrices, which are both special cases of meet and join matrices on lattices.

A Two-Stage Approach to Synthesizing Covariance Matrices in Meta-Analytic Structural Equation Modeling

Science.gov (United States)

Cheung, Mike W. L.; Chan, Wai

2009-01-01

Structural equation modeling (SEM) is widely used as a statistical framework to test complex models in behavioral and social sciences. When the number of publications increases, there is a need to systematically synthesize them. Methodology of synthesizing findings in the context of SEM is known as meta-analytic SEM (MASEM). Although correlation…

A note on unique solvability of the absolute value equation

Directory of Open Access Journals (Sweden)

Taher Lotfi

2014-05-01

Full Text Available It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A+|B|]$‎, ‎we can create a new unique solvability condition for the absolute value equation $Ax+B|x|=b$‎, ‎since regularity of interval matrices implies unique solvability of their corresponding absolute value equation‎. ‎This condition is formulated in terms of positive definiteness of a certain point matrix‎. ‎Special case $B=-I$ is verified too as an application.

Normal scheme for solving the transport equation independently of spatial discretization

International Nuclear Information System (INIS)

Zamonsky, O.M.

1993-01-01

To solve the discrete ordinates neutron transport equation, a general order nodal scheme is used, where nodes are allowed to have different orders of approximation and the whole system reaches a final order distribution. Independence in the election of system discretization and order of approximation is obtained without loss of accuracy. The final equations and the iterative method to reach a converged order solution were implemented in a two-dimensional computer code to solve monoenergetic, isotropic scattering, external source problems. Two benchmark problems were solved using different automatic selection order methods. Results show accurate solutions without spatial discretization, regardless of the initial selection of distribution order. (author)

Quantitative Analysis of Mixtures of Monoprotic Acids Applying Modified Model-Based Rank Annihilation Factor Analysis on Variation Matrices of Spectrophotometric Acid-Base Titrations

Directory of Open Access Journals (Sweden)

Ebrahim Ghorbani-Kalhor

2015-04-01

Full Text Available In the current work, a new version of rank annihilation factor analysis was developedto circumvent the rank deficiency problem in multivariate data measurements.Simultaneous determination of dissociation constant and concentration of monoprotic acids was performed by applying model-based rank annihilation factor analysis on variation matrices of spectrophotometric acid-base titrations data. Variation matrices can be obtained by subtracting first row of data matrix from all rows of the main data matrix. This method uses variation matrices instead of multivariate spectrophotometric acid-base titrations matrices to circumvent the rank deficiency problem in the rank quantitation step. The applicability of this approach was evaluated by simulated data at first stage, then the binary mixtures of ascorbic and sorbic acids as model compounds were investigated by the proposed method. At the end, the proposed method was successfully applied for resolving the ascorbic and sorbic acid in an orange juice real sample. Therefore, unique results were achieved by applying rank annihilation factor analysis on variation matrix and using hard soft model combination advantage without any problem and difficulty in rank determination. Normal 0 false false false EN-US X-NONE AR-SA /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:10.0pt; mso-para-margin-left:0cm; line-height:115%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:Arial; mso-bidi-theme-font:minor-bidi; mso-bidi-language:AR-SA;}    

Encapsulation of biological species in sol-gel matrices

International Nuclear Information System (INIS)

Finnie, K.S.; Bartlett, J.R.; Woolfrey, J.L.

2000-01-01

Two examples are given of the gelation of silica sols containing bio catalysts, resulting in their encapsulation in porous matrices. Urease was encapsulated in gels made from a mixture of TMOS and alkyltrimethoxysilane. Enzyme activities, monitored by measuring the rate of production of ammoniacal nitrogen as urea was decomposed, ranged up to 60% of that of the unencapsulated species. Anaerobic sulphate-reducing bacteria were encapsulated in a gel produced from colloidal silica, thus avoiding contact with alcohol. The detection of H 2 S produced in the doped gel indicated that the bacteria were able to continue normal metabolic function within the gel matrix. A gel initially doped with ∼ 5 x 10 5 cells cm -3 , exhibited an optimum sulphate reduction rate of 11 ug h -1 cm -3 ; this reduction rate was quickly re-established after storage of the gel for 14 weeks. Copyright (2000) The Australian Ceramic Society

Maxwell's equations, quantum physics and the quantum graviton

International Nuclear Information System (INIS)

Gersten, Alexander; Moalem, Amnon

2011-01-01

Quantum wave equations for massless particles and arbitrary spin are derived by factorizing the d'Alembertian operator. The procedure is extensively applied to the spin one photon equation which is related to Maxwell's equations via the proportionality of the photon wavefunction Ψ to the sum E + iB of the electric and magnetic fields. Thus Maxwell's equations can be considered as the first quantized one-photon equation. The photon wave equation is written in two forms, one with additional explicit subsidiary conditions and second with the subsidiary conditions implicitly included in the main equation. The second equation was obtained by factorizing the d'Alembertian with 4×4 matrix representation of 'relativistic quaternions'. Furthermore, scalar Lagrangian formalism, consistent with quantization requirements is developed using derived conserved current of probability and normalization condition for the wavefunction. Lessons learned from the derivation of the photon equation are used in the derivation of the spin two quantum equation, which we call the quantum graviton. Quantum wave equation with implicit subsidiary conditions, which factorizes the d'Alembertian with 8×8 matrix representation of relativistic quaternions, is derived. Scalar Lagrangian is formulated and conserved probability current and wavefunction normalization are found, both consistent with the definitions of quantum operators and their expectation values. We are showing that the derived equations are the first quantized equations of the photon and the graviton.

Joint Estimation of Multiple Precision Matrices with Common Structures.

Science.gov (United States)

Lee, Wonyul; Liu, Yufeng

Estimation of inverse covariance matrices, known as precision matrices, is important in various areas of statistical analysis. In this article, we consider estimation of multiple precision matrices sharing some common structures. In this setting, estimating each precision matrix separately can be suboptimal as it ignores potential common structures. This article proposes a new approach to parameterize each precision matrix as a sum of common and unique components and estimate multiple precision matrices in a constrained l 1 minimization framework. We establish both estimation and selection consistency of the proposed estimator in the high dimensional setting. The proposed estimator achieves a faster convergence rate for the common structure in certain cases. Our numerical examples demonstrate that our new estimator can perform better than several existing methods in terms of the entropy loss and Frobenius loss. An application to a glioblastoma cancer data set reveals some interesting gene networks across multiple cancer subtypes.

Efficient Statistical Extraction of the Per-Unit-Length Capacitance and Inductance Matrices of Cables with Random Parameters

Directory of Open Access Journals (Sweden)

P. Manfredi

2015-05-01

Full Text Available Cable bundles often exhibit random parameter variations due to uncertain or uncontrollable physical properties and wire positioning. Efficient tools, based on the so-called polynomial chaos, exist to rapidly assess the impact of such variations on the per-unit-length capacitance and inductance matrices, and on the pertinent cable response. Nevertheless, the state-of-the-art method for the statistical extraction of the per-unit-length capacitance and inductance matrices of cables suffers from several inefficiencies that hinder its applicability to large problems, in terms of number of random parameters and/or conductors. This paper presents an improved methodology that overcomes the aforementioned limitations by exploiting a recently-published, alternative approach to generate the pertinent polynomial chaos system of equations. A sparse and decoupled system is obtained that provides remarkable benefits in terms of speed, memory consumption and problem size that can be dealt with. The technique is thoroughly validated through the statistical analysis of two canonical structures, i.e. a ribbon cable and a shielded cable with random geometry and position.

Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices

Science.gov (United States)

Böttcher, A.; Bogoya, J. M.; Grudsky, S. M.; Maximenko, E. A.

2017-11-01

Analysis of the asymptotic behaviour of the spectral characteristics of Toeplitz matrices as the dimension of the matrix tends to infinity has a history of over 100 years. For instance, quite a number of versions of Szegő's theorem on the asymptotic behaviour of eigenvalues and of the so-called strong Szegő theorem on the asymptotic behaviour of the determinants of Toeplitz matrices are known. Starting in the 1950s, the asymptotics of the maximum and minimum eigenvalues were actively investigated. However, investigation of the individual asymptotics of all the eigenvalues and eigenvectors of Toeplitz matrices started only quite recently: the first papers on this subject were published in 2009-2010. A survey of this new field is presented here. Bibliography: 55 titles.

Representations of Lie algebras and partial differential equations

CERN Document Server

Xu, Xiaoping

2017-01-01

This book provides explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic codes, combinatorics and algebraic varieties, summarizing the author’s works and his joint works with his former students.  Further, it presents various oscillator generalizations of the classical representation theorem on harmonic polynomials, and highlights new functors from the representation category of a simple Lie algebra to that of another simple Lie algebra. Partial differential equations play a key role in solving certain representation problems. The weight matrices of the minimal and adjoint representations over the simple Lie algebras of types E and F are proved to generate ternary orthogonal linear codes with large minimal distances. New multi-variable hypergeometric functions related to the root systems of simple Lie algebras are introduced in connection with quantum many-body systems in one dimension. In addition, the book identifies certai...

The error and covariance structures of the mean approach model of pooled cross-section and time series data

International Nuclear Information System (INIS)

Nuamah, N.N.N.N.

1991-01-01

This paper postulates the assumptions underlying the Mean Approach model and recasts the re-expressions of the normal equations of this model in partitioned matrices of covariances. These covariance structures have been analysed. (author). 16 refs

On the norms of r-circulant matrices with generalized Fibonacci numbers

Directory of Open Access Journals (Sweden)

Amara Chandoul

2017-01-01

Full Text Available In this paper, we obtain a generalization of [6, 8]. Firstly, we consider the so-called r-circulant matrices with generalized Fibonacci numbers and then found lower and upper bounds for the Euclidean and spectral norms of these matrices. Afterwards, we present some bounds for the spectral norms of Hadamard and Kronecker product of these matrices.

Global stability analysis of epidemiological models based on Volterra–Lyapunov stable matrices

International Nuclear Information System (INIS)

Liao Shu; Wang Jin

2012-01-01

Highlights: ► Global dynamics of high dimensional dynamical systems. ► A systematic approach for global stability analysis. ► Epidemiological models of environment-dependent diseases. - Abstract: In this paper, we study the global dynamics of a class of mathematical epidemiological models formulated by systems of differential equations. These models involve both human population and environmental component(s) and constitute high-dimensional nonlinear autonomous systems, for which the global asymptotic stability of the endemic equilibria has been a major challenge in analyzing the dynamics. By incorporating the theory of Volterra–Lyapunov stable matrices into the classical method of Lyapunov functions, we present an approach for global stability analysis and obtain new results on some three- and four-dimensional model systems. In addition, we conduct numerical simulation to verify the analytical results.

Advection-diffusion model for normal grain growth and the stagnation of normal grain growth in thin films

International Nuclear Information System (INIS)

Lou, C.

2002-01-01

An advection-diffusion model has been set up to describe normal grain growth. In this model grains are divided into different groups according to their topological classes (number of sides of a grain). Topological transformations are modelled by advective and diffusive flows governed by advective and diffusive coefficients respectively, which are assumed to be proportional to topological classes. The ordinary differential equations governing self-similar time-independent grain size distribution can be derived analytically from continuity equations. It is proved that the time-independent distributions obtained by solving the ordinary differential equations have the same form as the time-dependent distributions obtained by solving the continuity equations. The advection-diffusion model is extended to describe the stagnation of normal grain growth in thin films. Grain boundary grooving prevents grain boundaries from moving, and the correlation between neighbouring grains accelerates the stagnation of normal grain growth. After introducing grain boundary grooving and the correlation between neighbouring grains into the model, the grain size distribution is close to a lognormal distribution, which is usually found in experiments. A vertex computer simulation of normal grain growth has also been carried out to make a cross comparison with the advection-diffusion model. The result from the simulation did not verify the assumption that the advective and diffusive coefficients are proportional to topological classes. Instead, we have observed that topological transformations usually occur on certain topological classes. This suggests that the advection-diffusion model can be improved by making a more realistic assumption on topological transformations. (author)

An algorithmic characterization of P-matricity

OpenAIRE

Ben Gharbia , Ibtihel; Gilbert , Jean Charles

2013-01-01

International audience; It is shown that a matrix M is a P-matrix if and only if, whatever is the vector q, the Newton-min algorithm does not cycle between two points when it is used to solve the linear complementarity problem 0 ≤ x ⊥ (Mx+q) ≥ 0.; Nous montrons dans cet article qu'une matrice M est une P-matrice si, et seulement si, quel que soit le vecteur q, l'algorithme de Newton-min ne fait pas de cycle de deux points lorsqu'il est utilisé pour résoudre le problème de compl\\émentarité lin...

Seismic structural response analysis using consistent mass matrices having dynamic coupling

International Nuclear Information System (INIS)

Shaw, D.E.

1977-01-01

The basis for the theoretical development of this paper is the linear matrix equations of motion for an unconstrained structure subject to support excitation. The equations are formulated in terms of absolute displacement, velocity and acceleration vectors. By means of a transformation of the absolute response vectors into displacements, velocities and accelerations relative to the support motions, the homogeneous equations become non-homogeneous and the non-homogeneous boundary conditions become homogeneous with relative displacements, velocities and accelerations being zero at support points. The forcing function or inertial loading vector is shown to consist of two parts. The first part is comprised of the mass matrix times the suppport acceleration function times a vector of structural displacements resulting from a unit vector of support displacements in the direction of excitation. This inertial loading corresponds to the classical seismic loading vector and is indeed the only loading vector for lumped-mass systems. The second part of he inertial loading vectors consists of the mass matrix times the support acceleration function times a vector of structural accelerations resulting from unit support accelerations in the direction of excitation. This term is not present in classical seismic analysis formulations and results from the presence of off-diagonal terms in the mass matrices which give rise to dynamic coupling through the mass matrix. Thus, for lumped-mass models, the classical formulation of the inertial loading vector is correct. However, if dynamic coupling terms are included through off-diagonal terms in the mass matrix, an additional inertia loading vector must be considered

Partitioning sparse rectangular matrices for parallel processing

Energy Technology Data Exchange (ETDEWEB)

Kolda, T.G.

1998-05-01

The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.

Normal freezing of ideal ternary systems of the pseudobinary type

Science.gov (United States)

Li, C. H.

1972-01-01

Perfect liquid mixing but no solid diffusion is assumed in normal freezing. In addition, the molar compositions of the freezing solid and remaining liquid, respectively, follow the solidus and liquidus curves of the constitutional diagram. For the linear case, in which both the liquidus and solidus are perfectly straight lines, the normal freezing equation giving the fraction solidified at each melt temperature and the solute concentration profile in the frozen solid was determined as early as 1902, and has since been repeatedly published. Corresponding equations for quadratic, cubic or higher-degree liquidus and solidus lines have also been obtained. The equation of normal freezing for ideal ternary liquid solutions solidified into ideal solid solutions of the pseudobinary type is given. Sample computations with the use of this new equation were made and are given for the Ga-Al-As system.

Evaluating functions of positive-definite matrices using colored-noise thermostats

Science.gov (United States)

Nava, Marco; Ceriotti, Michele; Dryzun, Chaim; Parrinello, Michele

2014-02-01

Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scales with the cube of the size of the matrix. We present here a method that can be used to evaluate the elements of a function of a positive-definite matrix with a scaling that is linear for sparse matrices and quadratic in the general case. This methodology is based on the properties of the dynamics of a multidimensional harmonic potential coupled with colored-noise, generalized Langevin equation thermostats. This "f-thermostat" approach allows us to calculate directly elements of functions of a positive-definite matrix by carefully tailoring the properties of the stochastic dynamics. We demonstrate the scaling and the accuracy of this approach for both dense and sparse problems and compare the results with other established methodologies.

Two updating methods for dissipative models with non symmetric matrices

International Nuclear Information System (INIS)

Billet, L.; Moine, P.; Aubry, D.

1997-01-01

In this paper the feasibility of the extension of two updating methods to rotating machinery models is considered, the particularity of rotating machinery models is to use non-symmetric stiffness and damping matrices. It is shown that the two methods described here, the inverse Eigen-sensitivity method and the error in constitutive relation method can be adapted to such models given some modification.As far as inverse sensitivity method is concerned, an error function based on the difference between right hand calculated and measured Eigen mode shapes and calculated and measured Eigen values is used. Concerning the error in constitutive relation method, the equation which defines the error has to be modified due to the non definite positiveness of the stiffness matrix. The advantage of this modification is that, in some cases, it is possible to focus the updating process on some specific model parameters. Both methods were validated on a simple test model consisting in a two-bearing and disc rotor system. (author)

NIMROD: a program for inference via a normal approximation of the posterior in models with random effects based on ordinary differential equations.

Science.gov (United States)

Prague, Mélanie; Commenges, Daniel; Guedj, Jérémie; Drylewicz, Julia; Thiébaut, Rodolphe

2013-08-01

Models based on ordinary differential equations (ODE) are widespread tools for describing dynamical systems. In biomedical sciences, data from each subject can be sparse making difficult to precisely estimate individual parameters by standard non-linear regression but information can often be gained from between-subjects variability. This makes natural the use of mixed-effects models to estimate population parameters. Although the maximum likelihood approach is a valuable option, identifiability issues favour Bayesian approaches which can incorporate prior knowledge in a flexible way. However, the combination of difficulties coming from the ODE system and from the presence of random effects raises a major numerical challenge. Computations can be simplified by making a normal approximation of the posterior to find the maximum of the posterior distribution (MAP). Here we present the NIMROD program (normal approximation inference in models with random effects based on ordinary differential equations) devoted to the MAP estimation in ODE models. We describe the specific implemented features such as convergence criteria and an approximation of the leave-one-out cross-validation to assess the model quality of fit. In pharmacokinetics models, first, we evaluate the properties of this algorithm and compare it with FOCE and MCMC algorithms in simulations. Then, we illustrate NIMROD use on Amprenavir pharmacokinetics data from the PUZZLE clinical trial in HIV infected patients. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS

Directory of Open Access Journals (Sweden)

A. V. Sokolov

2016-01-01

Full Text Available The rapid development of methods of error-correcting coding, cryptography, and signal synthesis theory based on the principles of many-valued logic determines the need for a more detailed study of the forms of representation of functions of many-valued logic. In particular the algebraic normal form of Boolean functions, also known as Zhegalkin polynomial, that well describe many of the cryptographic properties of Boolean functions is widely used. In this article, we formalized the notion of algebraic normal form for many-valued logic functions. We developed a fast method of synthesis of algebraic normal form of 3-functions and 5-functions that work similarly to the Reed-Muller transform for Boolean functions: on the basis of recurrently synthesized transform matrices. We propose the hypothesis, which determines the rules of the synthesis of these matrices for the transformation from the truth table to the coefficients of the algebraic normal form and the inverse transform for any given number of variables of 3-functions or 5-functions. The article also introduces the definition of algebraic degree of nonlinearity of the functions of many-valued logic and the S-box, based on the principles of many-valued logic. Thus, the methods of synthesis of algebraic normal form of 3-functions applied to the known construction of recurrent synthesis of S-boxes of length N = 3k, whereby their algebraic degrees of nonlinearity are computed. The results could be the basis for further theoretical research and practical applications such as: the development of new cryptographic primitives, error-correcting codes, algorithms of data compression, signal structures, and algorithms of block and stream encryption, all based on the perspective principles of many-valued logic. In addition, the fast method of synthesis of algebraic normal form of many-valued logic functions is the basis for their software and hardware implementation.

A stockability equation for forest land in Siskiyou County, California.

Science.gov (United States)

Neil. McKay

1985-01-01

An equation is presented that estimates the relative stocking capacity of forest land in Siskiyou County, California, from the amount of precipitation and the presence of significant indicator plants. The equation is a toot for identifying sites incapable of supporting normal stocking. Estimated relative stocking capacity may be used to discount normal yields to levels...

Competence of matric physical science teachers in some basic problem-solving strategies

Directory of Open Access Journals (Sweden)

Mailoo Selvaratnam

2011-01-01

Full Text Available The National Curriculum Statement for matric physical science places strong emphasis on the development of critical thinking and reasoning abilities of pupils. The successful implementation of this curriculum therefore requires teachers who are competent in the cognitive (intellectual skills and strategies needed for learning science effectively. Testing of teachers’ competence in this aspect is therefore important. I therefore analysed teachers’ answers to questions that were carefully designed to test competence in some basic intellectual strategies that are important for problem solving in physical science courses. A total of 73 matric physical science teachers, from about 50 Dinaledi schools in the North West and KwaZulu-Natal provinces in South Africa, were tested in five intellectual strategies: clear representation of problems, identifying and focusing on the goal, identification and use of relevant principles, use of equations for deductions and proceeding step-by-step with the solution. The teachers’ competence was poor in all the intellectual strategies tested. About 60% (the average performance in all 13 questions used for testing of teachers tested were unable to solve the questions correctly. An important objective of the curriculum is the development of critical thinking, scientific reasoning and strategies of pupils. This study shows that the achievement of this objective will be seriously handicapped because of the lack of competence of many teachers in intellectual strategies. There is therefore a need to train teachers in order to increase their competence in this aspect.

Newton`s iteration for inversion of Cauchy-like and other structured matrices

Energy Technology Data Exchange (ETDEWEB)

Pan, V.Y. [Lehman College, Bronx, NY (United States); Zheng, Ailong; Huang, Xiaohan; Dias, O. [CUNY, New York, NY (United States)

1996-12-31

We specify some initial assumptions that guarantee rapid refinement of a rough initial approximation to the inverse of a Cauchy-like matrix, by mean of our new modification of Newton`s iteration, where the input, output, and all the auxiliary matrices are represented with their short generators defined by the associated scaling operators. The computations are performed fast since they are confined to operations with short generators of the given and computed matrices. Because of the known correlations among various structured matrices, the algorithm is immediately extended to rapid refinement of rough initial approximations to the inverses of Vandermonde-like, Chebyshev-Vandermonde-like and Toeplitz-like matrices, where again, the computations are confined to operations with short generators of the involved matrices.

Stokes phenomena and monodromy deformation problem for nonlinear Schrodinger equation

International Nuclear Information System (INIS)

Chowdury, A.R.; Naskar, M.

1986-01-01

Following Flaschka and Newell, the inverse problem for Painleve IV is formulated with the help of similarity variables. The Painleve IV arises as the eliminant of the two second-order ordinary differential equations originating from the nonlinear Schrodinger equation. Asymptotic expansions are obtained near the singularities at zero and infinity of the complex eigenvalue plane. The corresponding analysis then displays the Stokes phenomena. The monodromy matrices connecting the solution Y /sub j/ in the sector S /sub j/ to that in S /sub j+1/ are fixed in structure by the imposition of certain conditions. It is then shown that a deformation keeping the monodromy data fixed leads to the nonlinear Schrodinger equation. While Flaschka and Newell did not make any absolute determination of the Stokes parameters, the present approach yields the values of the Stokes parameters in an explicit way, which in turn can determine the matrix connecting the solutions near zero and infinity. Finally, it is shown that the integral equation originating from the analyticity and asymptotic nature of the problem leads to the similarity solution previously determined by Boiti and Pampinelli

Agricultural matrices affect ground ant assemblage composition inside forest fragments.

Directory of Open Access Journals (Sweden)

Diego Santana Assis

Full Text Available The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates; sugarcane (3; and pasture (3. At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart. Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was 'generalist' both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an 'ocean of crops'.

Agricultural matrices affect ground ant assemblage composition inside forest fragments.

Science.gov (United States)

Assis, Diego Santana; Dos Santos, Iracenir Andrade; Ramos, Flavio Nunes; Barrios-Rojas, Katty Elena; Majer, Jonathan David; Vilela, Evaldo Ferreira

2018-01-01

The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices) on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates); sugarcane (3); and pasture (3). At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart). Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was 'generalist' both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an 'ocean of crops'.

From explicit to implicit normal mode initialization of a limited-area model

Energy Technology Data Exchange (ETDEWEB)

Bijlsma, S.J.

2013-02-15

In this note the implicit normal mode initialization of a limited-area model is discussed from a different point of view. To that end it is shown that the equations describing the explicit normal mode initialization applied to the shallow water equations in differentiated form on the sphere can readily be derived in normal mode space if the model equations are separable, but only in the case of stationary Rossby modes can be transformed into the implicit equations in physical space. This is a consequence of the simple relations between the components of the different modes in that case. In addition a simple eigenvalue problem is given for the frequencies of the gravity waves. (orig.)

MALDI matrices for low molecular weight compounds: an endless story?

Science.gov (United States)

Calvano, Cosima Damiana; Monopoli, Antonio; Cataldi, Tommaso R I; Palmisano, Francesco

2018-04-23

Since its introduction in the 1980s, matrix-assisted laser desorption/ionization mass spectrometry (MALDI MS) has gained a prominent role in the analysis of high molecular weight biomolecules such as proteins, peptides, oligonucleotides, and polysaccharides. Its application to low molecular weight compounds has remained for long time challenging due to the spectral interferences produced by conventional organic matrices in the low m/z window. To overcome this problem, specific sample preparation such as analyte/matrix derivatization, addition of dopants, or sophisticated deposition technique especially useful for imaging experiments, have been proposed. Alternative approaches based on second generation (rationally designed) organic matrices, ionic liquids, and inorganic matrices, including metallic nanoparticles, have been the object of intense and continuous research efforts. Definite evidences are now provided that MALDI MS represents a powerful and invaluable analytical tool also for small molecules, including their quantification, thus opening new, exciting applications in metabolomics and imaging mass spectrometry. This review is intended to offer a concise critical overview of the most recent achievements about MALDI matrices capable of specifically address the challenging issue of small molecules analysis. Graphical abstract An ideal Book of matrices for MALDI MS of small molecules.

The recurrence sequences via Sylvester matrices

Science.gov (United States)

Karaduman, Erdal; Deveci, Ömür

2017-07-01

In this work, we define the Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by using the Slyvester matrices which are obtained from the characteristic polynomials of the Pell and Jacobsthal sequences and then, we study the sequences defined modulo m. Also, we obtain the cyclic groups and the semigroups from the generating matrices of these sequences when read modulo m and then, we derive the relationships among the orders of the cyclic groups and the periods of the sequences. Furthermore, we redefine Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by means of the elements of the groups and then, we examine them in the finite groups.

Quantitative mass spectrometry of unconventional human biological matrices

Science.gov (United States)

Dutkiewicz, Ewelina P.; Urban, Pawel L.

2016-10-01

The development of sensitive and versatile mass spectrometric methodology has fuelled interest in the analysis of metabolites and drugs in unconventional biological specimens. Here, we discuss the analysis of eight human matrices-hair, nail, breath, saliva, tears, meibum, nasal mucus and skin excretions (including sweat)-by mass spectrometry (MS). The use of such specimens brings a number of advantages, the most important being non-invasive sampling, the limited risk of adulteration and the ability to obtain information that complements blood and urine tests. The most often studied matrices are hair, breath and saliva. This review primarily focuses on endogenous (e.g. potential biomarkers, hormones) and exogenous (e.g. drugs, environmental contaminants) small molecules. The majority of analytical methods used chromatographic separation prior to MS; however, such a hyphenated methodology greatly limits analytical throughput. On the other hand, the mass spectrometric methods that exclude chromatographic separation are fast but suffer from matrix interferences. To enable development of quantitative assays for unconventional matrices, it is desirable to standardize the protocols for the analysis of each specimen and create appropriate certified reference materials. Overcoming these challenges will make analysis of unconventional human biological matrices more common in a clinical setting. This article is part of the themed issue 'Quantitative mass spectrometry'.

Impact of the Choice of Normalization Method on Molecular Cancer Class Discovery Using Nonnegative Matrix Factorization.

Science.gov (United States)

Yang, Haixuan; Seoighe, Cathal

2016-01-01

Nonnegative Matrix Factorization (NMF) has proved to be an effective method for unsupervised clustering analysis of gene expression data. By the nonnegativity constraint, NMF provides a decomposition of the data matrix into two matrices that have been used for clustering analysis. However, the decomposition is not unique. This allows different clustering results to be obtained, resulting in different interpretations of the decomposition. To alleviate this problem, some existing methods directly enforce uniqueness to some extent by adding regularization terms in the NMF objective function. Alternatively, various normalization methods have been applied to the factor matrices; however, the effects of the choice of normalization have not been carefully investigated. Here we investigate the performance of NMF for the task of cancer class discovery, under a wide range of normalization choices. After extensive evaluations, we observe that the maximum norm showed the best performance, although the maximum norm has not previously been used for NMF. Matlab codes are freely available from: http://maths.nuigalway.ie/~haixuanyang/pNMF/pNMF.htm.

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

An introduction to the theory of canonical matrices

CERN Document Server

Turnbull, H W

2004-01-01

Thorough and self-contained, this penetrating study of the theory of canonical matrices presents a detailed consideration of all the theory's principal features. Topics include elementary transformations and bilinear and quadratic forms; canonical reduction of equivalent matrices; subgroups of the group of equivalent transformations; and rational and classical canonical forms. The final chapters explore several methods of canonical reduction, including those of unitary and orthogonal transformations. 1952 edition. Index. Appendix. Historical notes. Bibliographies. 275 problems.

Complementary Set Matrices Satisfying a Column Correlation Constraint

OpenAIRE

Wu, Di; Spasojevic, Predrag

2006-01-01

Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate...

Normal and adjoint integral and integrodifferential neutron transport equations. Pt. 1

International Nuclear Information System (INIS)

Velarde, G.

1976-01-01

Using some simplifying hypotheses, different expressions of the Boltzmann integrodifferential equation are obtained. Posteriorly, they are applied to some particular cases: slowing down, thermalization, multigroups, critical reactors and virtual critical reactors with k, α and lambda. (author)

Assembly Discontinuity Factors for the Neutron Diffusion Equation discretized with the Finite Volume Method. Application to BWR

International Nuclear Information System (INIS)

Bernal, A.; Roman, J.E.; Miró, R.; Verdú, G.

2016-01-01

Highlights: • A method is proposed to solve the eigenvalue problem of the Neutron Diffusion Equation in BWR. • The Neutron Diffusion Equation is discretized with the Finite Volume Method. • The currents are calculated by using a polynomial expansion of the neutron flux. • The current continuity and boundary conditions are defined implicitly to reduce the size of the matrices. • Different structured and unstructured meshes were used to discretize the BWR. - Abstract: The neutron flux spatial distribution in Boiling Water Reactors (BWRs) can be calculated by means of the Neutron Diffusion Equation (NDE), which is a space- and time-dependent differential equation. In steady state conditions, the time derivative terms are zero and this equation is rewritten as an eigenvalue problem. In addition, the spatial partial derivatives terms are transformed into algebraic terms by discretizing the geometry and using numerical methods. As regards the geometrical discretization, BWRs are complex systems containing different components of different geometries and materials, but they are usually modelled as parallelepiped nodes each one containing only one homogenized material to simplify the solution of the NDE. There are several techniques to correct the homogenization in the node, but the most commonly used in BWRs is that based on Assembly Discontinuity Factors (ADFs). As regards numerical methods, the Finite Volume Method (FVM) is feasible and suitable to be applied to the NDE. In this paper, a FVM based on a polynomial expansion method has been used to obtain the matrices of the eigenvalue problem, assuring the accomplishment of the ADFs for a BWR. This eigenvalue problem has been solved by means of the SLEPc library.

Self-orthogonal codes from some bush-type Hadamard matrices ...

African Journals Online (AJOL)

By means of a construction method outlined by Harada and Tonchev, we determine some non-binary self-orthogonal codes obtained from the row span of orbit matrices of Bush-type Hadamard matrices that admit a xed-point-free and xed-block-free automorphism of prime order. We show that the code [20; 15; 4]5 obtained ...

Finite element method for solving Kohn-Sham equations based on self-adaptive tetrahedral mesh

International Nuclear Information System (INIS)

Zhang Dier; Shen Lihua; Zhou Aihui; Gong Xingao

2008-01-01

A finite element (FE) method with self-adaptive mesh-refinement technique is developed for solving the density functional Kohn-Sham equations. The FE method adopts local piecewise polynomials basis functions, which produces sparsely structured matrices of Hamiltonian. The method is well suitable for parallel implementation without using Fourier transform. In addition, the self-adaptive mesh-refinement technique can control the computational accuracy and efficiency with optimal mesh density in different regions

Quantum-statistical kinetic equations

International Nuclear Information System (INIS)

Loss, D.; Schoeller, H.

1989-01-01

Considering a homogeneous normal quantum fluid consisting of identical interacting fermions or bosons, the authors derive an exact quantum-statistical generalized kinetic equation with a collision operator given as explicit cluster series where exchange effects are included through renormalized Liouville operators. This new result is obtained by applying a recently developed superoperator formalism (Liouville operators, cluster expansions, symmetrized projectors, P q -rule, etc.) to nonequilibrium systems described by a density operator ρ(t) which obeys the von Neumann equation. By means of this formalism a factorization theorem is proven (being essential for obtaining closed equations), and partial resummations (leading to renormalized quantities) are performed. As an illustrative application, the quantum-statistical versions (including exchange effects due to Fermi-Dirac or Bose-Einstein statistics) of the homogeneous Boltzmann (binary collisions) and Choh-Uhlenbeck (triple collisions) equations are derived

Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices

Energy Technology Data Exchange (ETDEWEB)

Geraldo, L.P.; Smith, D.L.

1988-01-01

Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered.

Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices

International Nuclear Information System (INIS)

Geraldo, L.P.; Smith, D.L.

1988-01-01

Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered

Asymmetric correlation matrices: an analysis of financial data

Science.gov (United States)

Livan, G.; Rebecchi, L.

2012-06-01

We analyse the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non-symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random matrix theory results on the average eigenvalue density of this type of matrix to distinguish between noise and non-trivial correlation structures, and we focus on financial data as a case study. Namely, we employ daily prices of stocks belonging to the American and British stock exchanges, and look for the emergence of correlations between two such markets in the eigenvalue spectrum of their non-symmetric correlation matrix. We find several non trivial results when considering time-lagged correlations over short lags, and we corroborate our findings by additionally studying the asymmetric correlation matrix of the principal components of our datasets.

No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices

KAUST Repository

Kammoun, Abla; Alouini, Mohamed-Slim

2016-01-01

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.

No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices

KAUST Repository

Kammoun, Abla

2016-05-04

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.

Zero singularities of codimension two and three in delay differential equations

International Nuclear Information System (INIS)

Campbell, Sue Ann; Yuan Yuan

2008-01-01

We give conditions under which a general class of delay differential equations has a point of Bogdanov–Takens or a triple zero bifurcation. We show how a centre manifold projection of the delay equations reduces the dynamics to two- or three-dimensional systems of ordinary differential equations. We put these equations in normal form and determine how the coefficients of the normal forms depend on the original parameters in the model. Finally we apply our results to two neural models and compare the predictions of the theory with numerical bifurcation analysis of the full equations. One model involves a transcritical bifurcation, hence we derive and analyse the appropriate unfoldings for this case

Identification of multivariate models for noise analysis of nuclear plant

International Nuclear Information System (INIS)

Zwingelstein, G.C.; Upadhyaya, B.R.

1979-01-01

During the normal operation of a pressurized water reactor, neutron noise analysis with multivariate autoregressive procedures in a valuable diagnostic tool to extract dynamic characteristics for incipient failure detection. The first part of the paper will describe in details the equations for estimating the multivariate autoregressive model matrices and the structure of various matrices. The matrices are estimated by solving a set of matrix operations, called Yule-Walker equations. The selection of optimal model order will also be discussed. Once the optimal parameter set is obtained, simple and fast calculations are used to determine the auto power spectral density, cross spectra, coherence function, phase. In addition the spectra may be decomposed into components being contributed from different noise sources. An application using neutron flux data collected on a nuclear plant will illustrate the efficiency of the method

The Dirac equation

International Nuclear Information System (INIS)

Thaller, B.

1992-01-01

This monograph treats most of the usual material to be found in texts on the Dirac equation such as the basic formalism of quantum mechanics, representations of Dirac matrices, covariant realization of the Dirac equation, interpretation of negative energies, Foldy-Wouthuysen transformation, Klein's paradox, spherically symmetric interactions and a treatment of the relativistic hydrogen atom, etc., and also provides excellent additional treatments of a variety of other relevant topics. The monograph contains an extensive treatment of the Lorentz and Poincare groups and their representations. The author discusses in depth Lie algebaic and projective representations, covering groups, and Mackey's theory and Wigner's realization of induced representations. A careful classification of external fields with respect to their behavior under Poincare transformations is supplemented by a basic account of self-adjointness and spectral properties of Dirac operators. A state-of-the-art treatment of relativistic scattering theory based on a time-dependent approach originally due to Enss is presented. An excellent introduction to quantum electrodynamics in external fields is provided. Various appendices containing further details, notes on each chapter commenting on the history involved and referring to original research papers and further developments in the literature, and a bibliography covering all relevant monographs and over 500 articles on the subject, complete this text. This book should satisfy the needs of a wide audience, ranging from graduate students in theoretical physics and mathematics to researchers interested in mathematical physics

Adhesion and metabolic activity of human corneal cells on PCL based nanofiber matrices

Energy Technology Data Exchange (ETDEWEB)

Stafiej, Piotr; Küng, Florian [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany); Institute of Polymer Materials, Universität Erlangen-Nürnberg, Martensstraße 7, 91054 Erlangen (Germany); Thieme, Daniel; Czugala, Marta; Kruse, Friedrich E. [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany); Schubert, Dirk W. [Institute of Polymer Materials, Universität Erlangen-Nürnberg, Martensstraße 7, 91054 Erlangen (Germany); Fuchsluger, Thomas A., E-mail: thomas.fuchsluger@uk-erlangen.de [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany)

2017-02-01

In this work, polycaprolactone (PCL) was used as a basic polymer for electrospinning of random and aligned nanofiber matrices. Our aim was to develop a biocompatible substrate for ophthalmological application to improve wound closure in defects of the cornea as replacement for human amniotic membrane. We investigated whether blending the hydrophobic PCL with poly (glycerol sebacate) (PGS) or chitosan (CHI) improves the biocompatibility of the matrices for cell expansion. Human corneal epithelial cells (HCEp) and human corneal keratocytes (HCK) were used for in vitro biocompatibility studies. After optimization of the electrospinning parameters for all blends, scanning electron microscopy (SEM), attenuated total reflectance Fourier transform infrared spectroscopy (ATR-FTIR), and water contact angle were used to characterize the different matrices. Fluorescence staining of the F-actin cytoskeleton of the cells was performed to analyze the adherence of the cells to the different matrices. Metabolic activity of the cells was measured by cell counting kit-8 (CCK-8) for 20 days to compare the biocompatibility of the materials. Our results show the feasibility of producing uniform nanofiber matrices with and without orientation for the used blends. All materials support adherence and proliferation of human corneal cell lines with oriented growth on aligned matrices. Although hydrophobicity of the materials was lowered by blending PCL, no increase in biocompatibility or proliferation, as was expected, could be measured. All tested matrices supported the expansion of human corneal cells, confirming their potential as substrates for biomedical applications. - Highlights: • PCL was blended with chitosan and poly(glycerol sebacate) for electrospinning. • Biocompatibility was proven with two human corneal cell lines. • Both cell lines adhered and proliferated on random and aligned nanofiber matrices. • Cytoskeletal orientation is shown on aligned nanofiber matrices. �

First results in the application of silicon photomultiplier matrices to small animal PET

Energy Technology Data Exchange (ETDEWEB)

Llosa, G. [University of Pisa, Department of Physics, Pisa (Italy)], E-mail: gabriela.llosa@pi.infn.it; Belcari, N.; Bisogni, M.G. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy); Collazuol, G. [University of Pisa, Department of Physics, Pisa (Italy); Scuola Normale Superiore, Pisa (Italy); Marcatili, S. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy); Boscardin, M.; Melchiorri, M.; Tarolli, A.; Piemonte, C.; Zorzi, N. [FBK irst, Trento (Italy); Barrillon, P.; Bondil-Blin, S.; Chaumat, V.; La Taille, C. de; Dinu, N.; Puill, V.; Vagnucci, J-F. [Laboratoire de l' Accelerateur Lineaire, IN2P3-CNRS, Orsay (France); Del Guerra, A. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy)

2009-10-21

A very high resolution small animal PET scanner that employs matrices of silicon photomultipliers as photodetectors is under development at the University of Pisa and INFN Pisa. The first SiPM matrices composed of 16 (4x4)1mmx1mm pixel elements on a common substrate have been produced at FBK-irst, and are being evaluated for this application. The MAROC2 ASIC developed at LAL-Orsay has been employed for the readout of the SiPM matrices. The devices have been tested with pixelated and continuous LYSO crystals. The results show the good performance of the matrices and lead to the fabrication of matrices with 64 SiPM elements.

First results in the application of silicon photomultiplier matrices to small animal PET

International Nuclear Information System (INIS)

Llosa, G.; Belcari, N.; Bisogni, M.G.; Collazuol, G.; Marcatili, S.; Boscardin, M.; Melchiorri, M.; Tarolli, A.; Piemonte, C.; Zorzi, N.; Barrillon, P.; Bondil-Blin, S.; Chaumat, V.; La Taille, C. de; Dinu, N.; Puill, V.; Vagnucci, J-F.; Del Guerra, A.

2009-01-01

A very high resolution small animal PET scanner that employs matrices of silicon photomultipliers as photodetectors is under development at the University of Pisa and INFN Pisa. The first SiPM matrices composed of 16 (4x4)1mmx1mm pixel elements on a common substrate have been produced at FBK-irst, and are being evaluated for this application. The MAROC2 ASIC developed at LAL-Orsay has been employed for the readout of the SiPM matrices. The devices have been tested with pixelated and continuous LYSO crystals. The results show the good performance of the matrices and lead to the fabrication of matrices with 64 SiPM elements.

More about unphysical zeroes in quark mass matrices

Energy Technology Data Exchange (ETDEWEB)

Emmanuel-Costa, David, E-mail: david.costa@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); González Felipe, Ricardo, E-mail: ricardo.felipe@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); ISEL - Instituto Superior de Engenharia de Lisboa, Instituto Politécnico de Lisboa, Rua Conselheiro Emídio Navarro, 1959-007 Lisboa (Portugal)

2017-01-10

We look for all weak bases that lead to texture zeroes in the quark mass matrices and contain a minimal number of parameters in the framework of the standard model. Since there are ten physical observables, namely, six nonvanishing quark masses, three mixing angles and one CP phase, the maximum number of texture zeroes in both quark sectors is altogether nine. The nine zero entries can only be distributed between the up- and down-quark sectors in matrix pairs with six and three texture zeroes or five and four texture zeroes. In the weak basis where a quark mass matrix is nonsingular and has six zeroes in one sector, we find that there are 54 matrices with three zeroes in the other sector, obtainable through right-handed weak basis transformations. It is also found that all pairs composed of a nonsingular matrix with five zeroes and a nonsingular and nondecoupled matrix with four zeroes simply correspond to a weak basis choice. Without any further assumptions, none of these pairs of up- and down-quark mass matrices has physical content. It is shown that all non-weak-basis pairs of quark mass matrices that contain nine zeroes are not compatible with current experimental data. The particular case of the so-called nearest-neighbour-interaction pattern is also discussed.

Application of H-matrices method to the calculation of the stress field in a viscoelastic medium

Science.gov (United States)

Ohtani, M.; Hirahara, K.

2017-12-01

In SW Japan, the Philippine Sea plate subducts from the south and the large earthquakes around M (Magnitude) 8 repeatedly occur at the plate boundary along the Nankai Trough, called as Nankai/Tonankai earthquakes. Near the rupture area of these earthquakes, the active volcanoes lines in the Kyushu region SW Japan, such as Sakurajima volcano. There are also distributed in the Tokai-Kanto region SE Japan, such as Mt. Fuji. The eruption of Mt. Fuji in 1707, called as Hoei eruption, have occurred 49 days after the one of the series of Nankai/Tonankai earthquakes, 1707 Hoei earthquake (M8.4). It suggests that the stress field due to the earthquake sometimes helps the volcanoes to erupt. When we consider the stress change due to the earthquake, the effect of viscoelastic deformation of the crust will be important. FEM is always used for modeling such inelastic effect. However, it requires the high computational cost of O(N3), where N is the number of discretized cells of the inelastic medium. Recently, a new method based on BIEM is proposed by Barbot and Fialko (2010). In their method, calculation of the stress field due to the inelastic strain is replaced to solve the inhomogeneous Navier's equation with equivalent body forces of the inelastic strain. Then, using the stress-strain greenfunction in an elastic medium, we can take into account the inelastic effect. In this study, we employ their method to evaluate the stress change at the active volcanoes around the Nankai/Tonankai earthquakes. Their method requires the computational cost and memory storage of O(N2). We try to reduce the computational amount and the memory by applying the fast computation method of H-matrices method. With H-matrices method, a dense matrix is divided into hierarchical structure of submatrices, and each submatrix is approximated to be low rank. When we divide the viscoelastic medium into N = 8,640 or 69,120 uniform cuboid cells and apply the H-matrices method, the required storage memory for

Basal Cell Carcinoma With Matrical Differentiation: Clinicopathologic, Immunohistochemical, and Molecular Biological Study of 22 Cases.

Science.gov (United States)

Kyrpychova, Liubov; Carr, Richard A; Martinek, Petr; Vanecek, Tomas; Perret, Raul; Chottová-Dvořáková, Magdalena; Zamecnik, Michal; Hadravsky, Ladislav; Michal, Michal; Kazakov, Dmitry V

2017-06-01

Basal cell carcinoma (BCC) with matrical differentiation is a fairly rare neoplasm, with about 30 cases documented mainly as isolated case reports. We studied a series of this neoplasm, including cases with an atypical matrical component, a hitherto unreported feature. Lesions coded as BCC with matrical differentiation were reviewed; 22 cases were included. Immunohistochemical studies were performed using antibodies against BerEp4, β-catenin, and epithelial membrane antigen (EMA). Molecular genetic studies using Ion AmpliSeq Cancer Hotspot Panel v2 by massively parallel sequencing on Ion Torrent PGM were performed in 2 cases with an atypical matrical component (1 was previously subjected to microdissection to sample the matrical and BCC areas separately). There were 13 male and 9 female patients, ranging in age from 41 to 89 years. Microscopically, all lesions manifested at least 2 components, a BCC area (follicular germinative differentiation) and areas with matrical differentiation. A BCC component dominated in 14 cases, whereas a matrical component dominated in 4 cases. Matrical differentiation was recognized as matrical/supramatrical cells (n=21), shadow cells (n=21), bright red trichohyaline granules (n=18), and blue-gray corneocytes (n=18). In 2 cases, matrical areas manifested cytologic atypia, and a third case exhibited an infiltrative growth pattern, with the tumor metastasizing to a lymph node. BerEP4 labeled the follicular germinative cells, whereas it was markedly reduced or negative in matrical areas. The reverse pattern was seen with β-catenin. EMA was negative in BCC areas but stained a proportion of matrical/supramatrical cells. Genetic studies revealed mutations of the following genes: CTNNB1, KIT, CDKN2A, TP53, SMAD4, ERBB4, and PTCH1, with some differences between the matrical and BCC components. It is concluded that matrical differentiation in BCC in most cases occurs as multiple foci. Rare neoplasms manifest atypia in the matrical areas

Local bifurcations in differential equations with state-dependent delay.

Science.gov (United States)

Sieber, Jan

2017-11-01

A common task when analysing dynamical systems is the determination of normal forms near local bifurcations of equilibria. As most of these normal forms have been classified and analysed, finding which particular class of normal form one encounters in a numerical bifurcation study guides follow-up computations. This paper builds on normal form algorithms for equilibria of delay differential equations with constant delay that were developed and implemented in DDE-Biftool recently. We show how one can extend these methods to delay-differential equations with state-dependent delay (sd-DDEs). Since higher degrees of regularity of local center manifolds are still open for sd-DDEs, we give an independent (still only partial) argument which phenomena from the truncated normal must persist in the full sd-DDE. In particular, we show that all invariant manifolds with a sufficient degree of normal hyperbolicity predicted by the normal form exist also in the full sd-DDE.

Local bifurcations in differential equations with state-dependent delay

Science.gov (United States)

Sieber, Jan

2017-11-01

A common task when analysing dynamical systems is the determination of normal forms near local bifurcations of equilibria. As most of these normal forms have been classified and analysed, finding which particular class of normal form one encounters in a numerical bifurcation study guides follow-up computations. This paper builds on normal form algorithms for equilibria of delay differential equations with constant delay that were developed and implemented in DDE-Biftool recently. We show how one can extend these methods to delay-differential equations with state-dependent delay (sd-DDEs). Since higher degrees of regularity of local center manifolds are still open for sd-DDEs, we give an independent (still only partial) argument which phenomena from the truncated normal must persist in the full sd-DDE. In particular, we show that all invariant manifolds with a sufficient degree of normal hyperbolicity predicted by the normal form exist also in the full sd-DDE.

Dirac Matrices and Feynman’s Rest of the Universe

Directory of Open Access Journals (Sweden)

Young S. Kim

2012-10-01

Full Text Available There are two sets of four-by-four matrices introduced by Dirac. The first set consists of fifteen Majorana matrices derivable from his four γ matrices. These fifteen matrices can also serve as the generators of the group SL(4, r. The second set consists of ten generators of the Sp(4 group which Dirac derived from two coupled harmonic oscillators. It is shown possible to extend the symmetry of Sp(4 to that of SL(4, r if the area of the phase space of one of the oscillators is allowed to become smaller without a lower limit. While there are no restrictions on the size of phase space in classical mechanics, Feynman’s rest of the universe makes this Sp(4-to-SL(4, r transition possible. The ten generators are for the world where quantum mechanics is valid. The remaining five generators belong to the rest of the universe. It is noted that the groups SL(4, r and Sp(4 are locally isomorphic to the Lorentz groups O(3, 3 and O(3, 2 respectively. This allows us to interpret Feynman’s rest of the universe in terms of space-time symmetry.

Dynamical correlations for circular ensembles of random matrices

International Nuclear Information System (INIS)

Nagao, Taro; Forrester, Peter

2003-01-01

Circular Brownian motion models of random matrices were introduced by Dyson and describe the parametric eigenparameter correlations of unitary random matrices. For symmetric unitary, self-dual quaternion unitary and an analogue of antisymmetric Hermitian matrix initial conditions, Brownian dynamics toward the unitary symmetry is analyzed. The dynamical correlation functions of arbitrary number of Brownian particles at arbitrary number of times are shown to be written in the forms of quaternion determinants, similarly as in the case of Hermitian random matrix models

Quantum Algorithms for Weighing Matrices and Quadratic Residues

OpenAIRE

van Dam, Wim

2000-01-01

In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the ar...

Extrusion induced low-order starch matrices: Enzymic hydrolysis and structure.

Science.gov (United States)

Zhang, Bin; Dhital, Sushil; Flanagan, Bernadine M; Luckman, Paul; Halley, Peter J; Gidley, Michael J

2015-12-10

Waxy, normal and highwaymen maize starches were extruded with water as sole plasticizer to achieve low-order starch matrices. Of the three starches, we found that only high-amylose extrudate showed lower digestion rate/extent than starches cooked in excess water. The ordered structure of high-amylose starches in cooked and extruded forms was similar, as judged by NMR, XRD and DSC techniques, but enzyme resistance was much greater for extruded forms. Size exclusion chromatography suggested that longer chains were involved in enzyme resistance. We propose that the local molecular density of packing of amylose chains can control the digestion kinetics rather than just crystallinity, with the principle being that density sufficient to either prevent/limit binding and/or slow down catalysis can be achieved by dense amorphous packing. Copyright © 2015 Elsevier Ltd. All rights reserved.

Minimal residual method stronger than polynomial preconditioning

Energy Technology Data Exchange (ETDEWEB)

Faber, V.; Joubert, W.; Knill, E. [Los Alamos National Lab., NM (United States)] [and others

1994-12-31

Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.

Empowering first year (post-matric) students in basic research skills ...

African Journals Online (AJOL)

Post-matric students from under-resourced (historically disadvantaged) black high schools generally encounter difficulties in their academic work at university. The study reported here was intended to empower first year (post-matric) students from these schools with basic research skills in a bid to counteract the effects of ...

Applicability of non-invasively collected matrices for human biomonitoring

Directory of Open Access Journals (Sweden)

Nickmilder Marc

2009-03-01

Full Text Available Abstract With its inclusion under Action 3 in the Environment and Health Action Plan 2004–2010 of the European Commission, human biomonitoring is currently receiving an increasing amount of attention from the scientific community as a tool to better quantify human exposure to, and health effects of, environmental stressors. Despite the policy support, however, there are still several issues that restrict the routine application of human biomonitoring data in environmental health impact assessment. One of the main issues is the obvious need to routinely collect human samples for large-scale surveys. Particularly the collection of invasive samples from susceptible populations may suffer from ethical and practical limitations. Children, pregnant women, elderly, or chronically-ill people are among those that would benefit the most from non-invasive, repeated or routine sampling. Therefore, the use of non-invasively collected matrices for human biomonitoring should be promoted as an ethically appropriate, cost-efficient and toxicologically relevant alternative for many biomarkers that are currently determined in invasively collected matrices. This review illustrates that several non-invasively collected matrices are widely used that can be an valuable addition to, or alternative for, invasively collected matrices such as peripheral blood sampling. Moreover, a well-informed choice of matrix can provide an added value for human biomonitoring, as different non-invasively collected matrices can offer opportunities to study additional aspects of exposure to and effects from environmental contaminants, such as repeated sampling, historical overview of exposure, mother-child transfer of substances, or monitoring of substances with short biological half-lives.

Polymer Percolation Threshold in Multi-Component HPMC Matrices Tablets

Directory of Open Access Journals (Sweden)

Maryam Maghsoodi

2011-06-01

Full Text Available Introduction: The percolation theory studies the critical points or percolation thresholds of the system, where onecomponent of the system undergoes a geometrical phase transition, starting to connect the whole system. The application of this theory to study the release rate of hydrophilic matrices allows toexplain the changes in release kinetics of swellable matrix type system and results in a clear improvement of the design of controlled release dosage forms. Methods: In this study, the percolation theory has been applied to multi-component hydroxypropylmethylcellulose (HPMC hydrophilic matrices. Matrix tablets have been prepared using phenobarbital as drug,magnesium stearate as a lubricant employing different amount of lactose and HPMC K4M as a fillerandmatrix forming material, respectively. Ethylcelullose (EC as a polymeric excipient was also examined. Dissolution studies were carried out using the paddle method. In order to estimate the percolation threshold, the behaviour of the kinetic parameters with respect to the volumetric fraction of HPMC at time zero, was studied. Results: In both HPMC/lactose and HPMC/EC/lactose matrices, from the point of view of the percolation theory, the optimum concentration for HPMC, to obtain a hydrophilic matrix system for the controlled release of phenobarbital is higher than 18.1% (v/v HPMC. Above 18.1% (v/v HPMC, an infinite cluster of HPMC would be formed maintaining integrity of the system and controlling the drug release from the matrices. According to results, EC had no significant influence on the HPMC percolation threshold. Conclusion: This may be related to broad functionality of the swelling hydrophilic matrices.

Fuchsia : A tool for reducing differential equations for Feynman master integrals to epsilon form

Science.gov (United States)

Gituliar, Oleksandr; Magerya, Vitaly

2017-10-01

We present Fuchsia - an implementation of the Lee algorithm, which for a given system of ordinary differential equations with rational coefficients ∂x J(x , ɛ) = A(x , ɛ) J(x , ɛ) finds a basis transformation T(x , ɛ) , i.e., J(x , ɛ) = T(x , ɛ) J‧(x , ɛ) , such that the system turns into the epsilon form : ∂xJ‧(x , ɛ) = ɛ S(x) J‧(x , ɛ) , where S(x) is a Fuchsian matrix. A system of this form can be trivially solved in terms of polylogarithms as a Laurent series in the dimensional regulator ɛ. That makes the construction of the transformation T(x , ɛ) crucial for obtaining solutions of the initial system. In principle, Fuchsia can deal with any regular systems, however its primary task is to reduce differential equations for Feynman master integrals. It ensures that solutions contain only regular singularities due to the properties of Feynman integrals. Program Files doi:http://dx.doi.org/10.17632/zj6zn9vfkh.1 Licensing provisions: MIT Programming language:Python 2.7 Nature of problem: Feynman master integrals may be calculated from solutions of a linear system of differential equations with rational coefficients. Such a system can be easily solved as an ɛ-series when its epsilon form is known. Hence, a tool which is able to find the epsilon form transformations can be used to evaluate Feynman master integrals. Solution method: The solution method is based on the Lee algorithm (Lee, 2015) which consists of three main steps: fuchsification, normalization, and factorization. During the fuchsification step a given system of differential equations is transformed into the Fuchsian form with the help of the Moser method (Moser, 1959). Next, during the normalization step the system is transformed to the form where eigenvalues of all residues are proportional to the dimensional regulator ɛ. Finally, the system is factorized to the epsilon form by finding an unknown transformation which satisfies a system of linear equations. Additional comments

Minimal parameter solution of the orthogonal matrix differential equation

Science.gov (United States)

Bar-Itzhack, Itzhack Y.; Markley, F. Landis

1990-01-01

As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed emplying the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.

Efficient linear algebra routines for symmetric matrices stored in packed form.

Science.gov (United States)

Ahlrichs, Reinhart; Tsereteli, Kakha

2002-01-30

Quantum chemistry methods require various linear algebra routines for symmetric matrices, for example, diagonalization or Cholesky decomposition for positive matrices. We present a small set of these basic routines that are efficient and minimize memory requirements.

Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices

OpenAIRE

Monajemi, Hatef; Jafarpour, Sina; Gavish, Matan; Donoho, David L.; Ambikasaran, Sivaram; Bacallado, Sergio; Bharadia, Dinesh; Chen, Yuxin; Choi, Young; Chowdhury, Mainak; Chowdhury, Soham; Damle, Anil; Fithian, Will; Goetz, Georges; Grosenick, Logan

2012-01-01

In compressed sensing, one takes samples of an N-dimensional vector using an matrix A, obtaining undersampled measurements . For random matrices with independent standard Gaussian entries, it is known that, when is k-sparse, there is a precisely determined phase transition: for a certain region in the (,)-phase diagram, convex optimization typically finds the sparsest solution, whereas outside that region, it typically fails. It has been shown empirically that the same property—with the ...

Comparison of equations for dosing of medications in renal impairment.

Science.gov (United States)

Khanal, Aarati; Peterson, Gregory M; Jose, Matthew D; Castelino, Ronald L

2017-06-01

The aim of this study is to determine the concordance among the Cockcroft-Gault, the Modification of Diet in Renal Disease and the Chronic Kidney Disease Epidemiology Collaboration (CKD-EPI) equations in hypothetical dosing of renally cleared medications. A total of 2163 patients prescribed at least one of the 31 renally cleared drugs under review were included in the study. Kidney function was estimated using the three equations. We compared actual prescribed dosages of the same drug with recommended dosages based on the kidney function as calculated by each of the equations and applying dosing recommendations in the Australian Medicines Handbook. There was a significant difference in the kidney function values estimated from the three equations (P < 0.001). Despite the good overall agreement in renal drug dosing, we found selected but potentially important discrepancies among the doses rendered from the equations. The CKD-EPI equation non-normalized for body surface area had a greater rate of concordance with the Cockcroft-Gault equation than the Modification of Diet in Renal Disease equation for renal drug dosing. There is need for a long-term multi-centre study in a diverse population to define the clinical effects of the discrepancies among the equations for drug dosing. Given the greater concordance of the non-normalized CKD-EPI equation with the Cockcroft-Gault equation for dosing, the recommendation by Kidney Health Australia and the United States National Kidney Disease Education Program that 'dosing based on either eCrCl or an eGFR with body surface area normalization removed are acceptable' seems suitable and practicable for the purpose of dosing of non-critical drugs in the primary care setting. © 2016 Asian Pacific Society of Nephrology.

"Real-Time Optical Laboratory Linear Algebra Solution Of Partial Differential Equations"

Science.gov (United States)

Casasent, David; Jackson, James

1986-03-01

A Space Integrating (SI) Optical Linear Algebra Processor (OLAP) employing space and frequency-multiplexing, new partitioning and data flow, and achieving high accuracy performance with a non base-2 number system is described. Laboratory data on the performance of this system and the solution of parabolic Partial Differential Equations (PDEs) is provided. A multi-processor OLAP system is also described for the first time. It use in the solution of multiple banded matrices that frequently arise is then discussed. The utility and flexibility of this processor compared to digital systolic architectures should be apparent.

Positive projections of symmetric matrices and Jordan algebras

DEFF Research Database (Denmark)

Fuglede, Bent; Jensen, Søren Tolver

2013-01-01

An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model.......An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model....

Statistical potential-based amino acid similarity matrices for aligning distantly related protein sequences.

Science.gov (United States)

Tan, Yen Hock; Huang, He; Kihara, Daisuke

2006-08-15

Aligning distantly related protein sequences is a long-standing problem in bioinformatics, and a key for successful protein structure prediction. Its importance is increasing recently in the context of structural genomics projects because more and more experimentally solved structures are available as templates for protein structure modeling. Toward this end, recent structure prediction methods employ profile-profile alignments, and various ways of aligning two profiles have been developed. More fundamentally, a better amino acid similarity matrix can improve a profile itself; thereby resulting in more accurate profile-profile alignments. Here we have developed novel amino acid similarity matrices from knowledge-based amino acid contact potentials. Contact potentials are used because the contact propensity to the other amino acids would be one of the most conserved features of each position of a protein structure. The derived amino acid similarity matrices are tested on benchmark alignments at three different levels, namely, the family, the superfamily, and the fold level. Compared to BLOSUM45 and the other existing matrices, the contact potential-based matrices perform comparably in the family level alignments, but clearly outperform in the fold level alignments. The contact potential-based matrices perform even better when suboptimal alignments are considered. Comparing the matrices themselves with each other revealed that the contact potential-based matrices are very different from BLOSUM45 and the other matrices, indicating that they are located in a different basin in the amino acid similarity matrix space.

The optimal version of Hua's fundamental theorem of geometry of rectangular matrices

CERN Document Server

Semrl, Peter

2014-01-01

Hua's fundamental theorem of geometry of matrices describes the general form of bijective maps on the space of all m\\times n matrices over a division ring \\mathbb{D} which preserve adjacency in both directions. Motivated by several applications the author studies a long standing open problem of possible improvements. There are three natural questions. Can we replace the assumption of preserving adjacency in both directions by the weaker assumption of preserving adjacency in one direction only and still get the same conclusion? Can we relax the bijectivity assumption? Can we obtain an analogous result for maps acting between the spaces of rectangular matrices of different sizes? A division ring is said to be EAS if it is not isomorphic to any proper subring. For matrices over EAS division rings the author solves all three problems simultaneously, thus obtaining the optimal version of Hua's theorem. In the case of general division rings he gets such an optimal result only for square matrices and gives examples ...

Spherical harmonics and energy polynomial solution of the Boltzmann equation for neutrons, 1

International Nuclear Information System (INIS)

Toledo, P.S. de

1974-01-01

The approximate solution of the source-free energy-dependent Boltzmann transport equation for neutrons in plane geometry and isotropic scattering case was given by Leonard and Ferziger using a truncated development in a series of energy-polynomials for the energy dependent neutron flux and solving exactly for the angular dependence. The presence in the general solution of eigenfunctions belonging to a continuous spectrum gives rise to difficult analytical problems in the application of their method even to simple problems. To avoid such difficulties, the angular dependence is treated by a spherical harmonics method and a general solution of the energy-dependent transport equation in plane geometry and isotropic scattering is obtained, in spite of the appearance of matrices as argument of the angular polynomials [pt

Efficient Galerkin solution of stochastic fractional differential equations using second kind Chebyshev wavelets

Directory of Open Access Journals (Sweden)

Fakhrodin Mohammadi

2017-10-01

Full Text Available ‎Stochastic fractional differential equations (SFDEs have been used for modeling many physical problems in the fields of turbulance‎, ‎heterogeneous‎, ‎flows and matrials‎, ‎viscoelasticity and electromagnetic theory‎. ‎In this paper‎, ‎an‎ efficient wavelet Galerkin method based on the second kind Chebyshev wavelets are proposed for approximate solution of SFDEs‎. ‎In ‎this ‎app‎roach‎‎, ‎o‎perational matrices of the second kind Chebyshev wavelets ‎are used ‎for reducing SFDEs to a linear system of algebraic equations that can be solved easily‎. ‎C‎onvergence and error analysis of the proposed method is ‎considered‎.‎ ‎Some numerical examples are performed to confirm the applicability and efficiency of the proposed method‎.

The performance of the Congruence Among Distance Matrices (CADM) test in phylogenetic analysis

Science.gov (United States)

2011-01-01

Background CADM is a statistical test used to estimate the level of Congruence Among Distance Matrices. It has been shown in previous studies to have a correct rate of type I error and good power when applied to dissimilarity matrices and to ultrametric distance matrices. Contrary to most other tests of incongruence used in phylogenetic analysis, the null hypothesis of the CADM test assumes complete incongruence of the phylogenetic trees instead of congruence. In this study, we performed computer simulations to assess the type I error rate and power of the test. It was applied to additive distance matrices representing phylogenies and to genetic distance matrices obtained from nucleotide sequences of different lengths that were simulated on randomly generated trees of varying sizes, and under different evolutionary conditions. Results Our results showed that the test has an accurate type I error rate and good power. As expected, power increased with the number of objects (i.e., taxa), the number of partially or completely congruent matrices and the level of congruence among distance matrices. Conclusions Based on our results, we suggest that CADM is an excellent candidate to test for congruence and, when present, to estimate its level in phylogenomic studies where numerous genes are analysed simultaneously. PMID:21388552

The performance of the Congruence Among Distance Matrices (CADM test in phylogenetic analysis

Directory of Open Access Journals (Sweden)

Lapointe François-Joseph

2011-03-01

Full Text Available Abstract Background CADM is a statistical test used to estimate the level of Congruence Among Distance Matrices. It has been shown in previous studies to have a correct rate of type I error and good power when applied to dissimilarity matrices and to ultrametric distance matrices. Contrary to most other tests of incongruence used in phylogenetic analysis, the null hypothesis of the CADM test assumes complete incongruence of the phylogenetic trees instead of congruence. In this study, we performed computer simulations to assess the type I error rate and power of the test. It was applied to additive distance matrices representing phylogenies and to genetic distance matrices obtained from nucleotide sequences of different lengths that were simulated on randomly generated trees of varying sizes, and under different evolutionary conditions. Results Our results showed that the test has an accurate type I error rate and good power. As expected, power increased with the number of objects (i.e., taxa, the number of partially or completely congruent matrices and the level of congruence among distance matrices. Conclusions Based on our results, we suggest that CADM is an excellent candidate to test for congruence and, when present, to estimate its level in phylogenomic studies where numerous genes are analysed simultaneously.

On families of anticommuting matrices

Czech Academy of Sciences Publication Activity Database

Hrubeš, Pavel

2016-01-01

Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum-of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296

On families of anticommuting matrices

Czech Academy of Sciences Publication Activity Database

Hrubeš, Pavel

2016-01-01

Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum -of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296

Schur Complement Inequalities for Covariance Matrices and Monogamy of Quantum Correlations.

Science.gov (United States)

Lami, Ludovico; Hirche, Christoph; Adesso, Gerardo; Winter, Andreas

2016-11-25

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

Application of Parallel Hierarchical Matrices in Spatial Statistics and Parameter Identification

KAUST Repository

Litvinenko, Alexander

2018-04-20

Parallel H-matrices in spatial statistics 1. Motivation: improve statistical model 2. Tools: Hierarchical matrices [Hackbusch 1999] 3. Matern covariance function and joint Gaussian likelihood 4. Identification of unknown parameters via maximizing Gaussian log-likelihood 5. Implementation with HLIBPro

Numerical solution of quadratic matrix equations for free vibration analysis of structures

Science.gov (United States)

Gupta, K. K.

1975-01-01

This paper is concerned with the efficient and accurate solution of the eigenvalue problem represented by quadratic matrix equations. Such matrix forms are obtained in connection with the free vibration analysis of structures, discretized by finite 'dynamic' elements, resulting in frequency-dependent stiffness and inertia matrices. The paper presents a new numerical solution procedure of the quadratic matrix equations, based on a combined Sturm sequence and inverse iteration technique enabling economical and accurate determination of a few required eigenvalues and associated vectors. An alternative procedure based on a simultaneous iteration procedure is also described when only the first few modes are the usual requirement. The employment of finite dynamic elements in conjunction with the presently developed eigenvalue routines results in a most significant economy in the dynamic analysis of structures.

Communication: satisfying fermionic statistics in the modeling of open time-dependent quantum systems with one-electron reduced density matrices.

Science.gov (United States)

Head-Marsden, Kade; Mazziotti, David A

2015-02-07

For an open, time-dependent quantum system, Lindblad derived the most general modification of the quantum Liouville equation in the Markovian approximation that models environmental effects while preserving the non-negativity of the system's density matrix. While Lindblad's modification is correct for N-electron density matrices, solution of the Liouville equation with a Lindblad operator causes the one-electron reduced density matrix (1-RDM) to violate the Pauli exclusion principle. Consequently, after a short time, the 1-RDM is not representable by an ensemble N-electron density matrix (not ensemble N-representable). In this communication, we derive the necessary and sufficient constraints on the Lindbladian matrix within the Lindblad operator to ensure that the 1-RDM remains N-representable for all time. The theory is illustrated by considering the relaxation of an excitation in several molecules F2, N2, CO, and BeH2 subject to environmental noise.

On Generating Discrete Integrable Systems via Lie Algebras and Commutator Equations

International Nuclear Information System (INIS)

Zhang Yu-Feng; Tam, Honwah

2016-01-01

In the paper, we introduce the Lie algebras and the commutator equations to rewrite the Tu-d scheme for generating discrete integrable systems regularly. By the approach the various loop algebras of the Lie algebra A_1 are defined so that the well-known Toda hierarchy and a novel discrete integrable system are obtained, respectively. A reduction of the later hierarchy is just right the famous Ablowitz–Ladik hierarchy. Finally, via two different enlarging Lie algebras of the Lie algebra A_1, we derive two resulting differential-difference integrable couplings of the Toda hierarchy, of course, they are all various discrete expanding integrable models of the Toda hierarchy. When the introduced spectral matrices are higher degrees, the way presented in the paper is more convenient to generate discrete integrable equations than the Tu-d scheme by using the software Maple. (paper)

Higher dimensional unitary braid matrices: Construction, associated structures and entanglements

International Nuclear Information System (INIS)

Abdesselam, B.; Chakrabarti, A.; Dobrev, V.K.; Mihov, S.G.

2007-03-01

We construct (2n) 2 x (2n) 2 unitary braid matrices R-circumflex for n ≥ 2 generalizing the class known for n = 1. A set of (2n) x (2n) matrices (I, J,K,L) are defined. R-circumflex is expressed in terms of their tensor products (such as K x J), leading to a canonical formulation for all n. Complex projectors P ± provide a basis for our real, unitary R-circumflex. Baxterization is obtained. Diagonalizations and block- diagonalizations are presented. The loss of braid property when R-circumflex (n > 1) is block-diagonalized in terms of R-circumflex (n = 1) is pointed out and explained. For odd dimension (2n + 1) 2 x (2n + 1) 2 , a previously constructed braid matrix is complexified to obtain unitarity. R-circumflexLL- and R-circumflexTT- algebras, chain Hamiltonians, potentials for factorizable S-matrices, complex non-commutative spaces are all studied briefly in the context of our unitary braid matrices. Turaev construction of link invariants is formulated for our case. We conclude with comments concerning entanglements. (author)

Normal-zone detectors for the MFTF-B coils. Revision 1

International Nuclear Information System (INIS)

Owen, E.W.; Shimer, D.W.

1983-01-01

In order to protect a set of inductively coupled superconducting magnets, it is necessary to locate and measure normal zone voltages that are small compared with the mutual and self-induced voltages. The method described in this report uses two sets of voltage measurements to locate and measure one or more normal zones in any number of coupled coils. One set of voltages is the outputs of bridges that balance out the self-induced voltages. The other set of voltages can be the voltages across the coils, although alternatives are possible. The two sets of equations form a single combined set of equations. Each normal zone location or combination of normal zones has a set of these combined equations associated with it. It is demonstrated that the normal zone can be located and the correct set chosen, allowing determination of the size of the normal zone. Only a few operations take place in a working detector: multiplication of a constant, addition, and simple decision-making. In many cases the detector for each coil, although weakly linked to the other detectors, can be considered to be independent. An example of the detector design is given for four coils with realistic parameters. The effect on accuracy of changes in the system parameters is discussed

A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications

OpenAIRE

Mahmood Ali A.; Elektorowicz Maria

2016-01-01

As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices i...

Numerical solution of Euler's equation by perturbed functionals

Science.gov (United States)

Dey, S. K.

1985-01-01

A perturbed functional iteration has been developed to solve nonlinear systems. It adds at each iteration level, unique perturbation parameters to nonlinear Gauss-Seidel iterates which enhances its convergence properties. As convergence is approached these parameters are damped out. Local linearization along the diagonal has been used to compute these parameters. The method requires no computation of Jacobian or factorization of matrices. Analysis of convergence depends on properties of certain contraction-type mappings, known as D-mappings. In this article, application of this method to solve an implicit finite difference approximation of Euler's equation is studied. Some representative results for the well known shock tube problem and compressible flows in a nozzle are given.

Asymptotic Distribution of Eigenvalues of Weakly Dilute Wishart Matrices

Energy Technology Data Exchange (ETDEWEB)

Khorunzhy, A. [Institute for Low Temperature Physics (Ukraine)], E-mail: khorunjy@ilt.kharkov.ua; Rodgers, G. J. [Brunel University, Uxbridge, Department of Mathematics and Statistics (United Kingdom)], E-mail: g.j.rodgers@brunel.ac.uk

2000-03-15

We study the eigenvalue distribution of large random matrices that are randomly diluted. We consider two random matrix ensembles that in the pure (nondilute) case have a limiting eigenvalue distribution with a singular component at the origin. These include the Wishart random matrix ensemble and Gaussian random matrices with correlated entries. Our results show that the singularity in the eigenvalue distribution is rather unstable under dilution and that even weak dilution destroys it.

Teaching Fourier optics through ray matrices

International Nuclear Information System (INIS)

Moreno, I; Sanchez-Lopez, M M; Ferreira, C; Davis, J A; Mateos, F

2005-01-01

In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics provided by the wave theory, but it is a complementary tool useful to simplify many aspects of Fourier optics and to relate them to geometrical optics

Normal zone detectors for a large number of inductively coupled coils

International Nuclear Information System (INIS)

Owen, E.W.; Shimer, D.W.

1983-01-01

In order to protect a set of inductively coupled superconducting magnets, it is necessary to locate and measure normal zone voltages that are small compared with the mutual and self-induced voltages. The method described in this paper uses two sets of voltage measurements to locate and measure one or more normal zones in any number of coupled coils. One set of voltages is the outputs of bridges that balance out the self-induced voltages. The other set of voltages can be the voltages across the coils, although alternatives are possible. The two sets of equations form a single combined set of equations. Each normal zone location or combination of normal zones has a set of these combined equations associated with it. It is demonstrated that the normal zone can be located and the correct set chosen, allowing determination of the size of the normal zone. Only a few operations take place in a working detector: multiplication of a constant, addition, and simple decision-making. In many cases the detector for each coil, although weakly linked to the other detectors, can be considered to be independent

A Discrete-Time Recurrent Neural Network for Solving Rank-Deficient Matrix Equations With an Application to Output Regulation of Linear Systems.

Science.gov (United States)

Liu, Tao; Huang, Jie

2017-04-17

This paper presents a discrete-time recurrent neural network approach to solving systems of linear equations with two features. First, the system of linear equations may not have a unique solution. Second, the system matrix is not known precisely, but a sequence of matrices that converges to the unknown system matrix exponentially is known. The problem is motivated from solving the output regulation problem for linear systems. Thus, an application of our main result leads to an online solution to the output regulation problem for linear systems.

Scalar potentials and the Dirac equation

International Nuclear Information System (INIS)

Bergerhoff, B.; Soff, G.

1994-01-01

The Dirac equation is solved for various types of scalar potentials. Energy eigenvalues and normalized bound-state wave functions are calculated analytically for a scalar 1/r-potential as well as for a mixed scalar and Coulomb 1/r-potential. Also continuum wave functions for positive and negative energies are derived. Similarly, we investigate the solutions of the Dirac equation for a scalar square-well potential. Relativistic wave functions for scalar Yukawa and exponential potentials are determined numerically. Finally, we also discuss solutions of the Dirac equation for scalar linear and quadratic potentials which are frequently used to simulate quark confinement. (orig.)

Fabrication of chemically cross-linked porous gelatin matrices.

Science.gov (United States)

Bozzini, Sabrina; Petrini, Paola; Altomare, Lina; Tanzi, Maria Cristina

2009-01-01

The aim of this study was to chemically cross-link gelatin, by reacting its free amino groups with an aliphatic diisocyanate. To produce hydrogels with controllable properties, the number of reacting amino groups was carefully determined. Porosity was introduced into the gelatin-based hydrogels through the lyophilization process. Porous and non-porous matrices were characterized with respect to their chemical structure, morphology, water uptake and mechanical properties. The physical, chemical and mechanical properties of the porous matrices are related to the extent of their cross-linking, showing that they can be controlled by varying the reaction parameters. Water uptake values (24 hours) vary between 160% and 200% as the degree of cross-linking increases. The flexibility of the samples also decreases by changing the extent of cross-linking. Young's modulus shows values between 0.188 KPa, for the highest degree, and 0.142 KPa for the lowest degree. The matrices are potential candidates for use as tissue-engineering scaffolds by modulating their physical chemical properties according to the specific application.

Large-deviation theory for diluted Wishart random matrices

Science.gov (United States)

Castillo, Isaac Pérez; Metz, Fernando L.

2018-03-01

Wishart random matrices with a sparse or diluted structure are ubiquitous in the processing of large datasets, with applications in physics, biology, and economy. In this work, we develop a theory for the eigenvalue fluctuations of diluted Wishart random matrices based on the replica approach of disordered systems. We derive an analytical expression for the cumulant generating function of the number of eigenvalues IN(x ) smaller than x ∈R+ , from which all cumulants of IN(x ) and the rate function Ψx(k ) controlling its large-deviation probability Prob[IN(x ) =k N ] ≍e-N Ψx(k ) follow. Explicit results for the mean value and the variance of IN(x ) , its rate function, and its third cumulant are discussed and thoroughly compared to numerical diagonalization, showing very good agreement. The present work establishes the theoretical framework put forward in a recent letter [Phys. Rev. Lett. 117, 104101 (2016), 10.1103/PhysRevLett.117.104101] as an exact and compelling approach to deal with eigenvalue fluctuations of sparse random matrices.

Dirac equation on a curved surface

Energy Technology Data Exchange (ETDEWEB)

Brandt, F.T., E-mail: fbrandt@usp.br; Sánchez-Monroy, J.A., E-mail: antosan@usp.br

2016-09-07

The dynamics of Dirac particles confined to a curved surface is examined employing the thin-layer method. We perform a perturbative expansion to first-order and split the Dirac field into normal and tangential components to the surface. In contrast to the known behavior of second order equations like Schrödinger, Maxwell and Klein–Gordon, we find that there is no geometric potential for the Dirac equation on a surface. This implies that the non-relativistic limit does not commute with the thin-layer method. Although this problem can be overcome when second-order terms are retained in the perturbative expansion, this would preclude the decoupling of the normal and tangential degrees of freedom. Therefore, we propose to introduce a first-order term which rescues the non-relativistic limit and also clarifies the effect of the intrinsic and extrinsic curvatures on the dynamics of the Dirac particles. - Highlights: • The thin-layer method is employed to derive the Dirac equation on a curved surface. • A geometric potential is absent at least to first-order in the perturbative expansion. • The effects of the extrinsic curvature are included to rescue the non-relativistic limit. • The resulting Dirac equation is consistent with the Heisenberg uncertainty principle.

Theoretical and experimental researches of methanol clusters in low - temperature matrices

International Nuclear Information System (INIS)

Chernolevs'ka, Je.A.; Doroshenko, Yi.Yu.; Pogorelov, V.Je.; Vas'kyivs'kij, Je.V.; Shablyinskas, V.; Balyavyichus, V.; Yasajev, O.

2015-01-01

Molecular vibrational spectra of methanol in argon and nitrogen matrices have been studied. Since methanol belongs to a class of substances with hydrogen bonds, there is a possibility of forming molecular associations and clusters with various numbers of molecules. IR spectra of methanol in Ar and N 2 matrices experimentally obtained in the temperature range from 10 to 50 K are compared with the results of computer simulation using the ab initio Car-Parrinello molecular dynamics (CPMD) method. The results obtained for small clusters in model calculations demonstrate a good correlation with experimental data for various matrices at the corresponding temperatures

Quarter-Sweep Iteration Concept on Conjugate Gradient Normal Residual Method via Second Order Quadrature - Finite Difference Schemes for Solving Fredholm Integro-Differential Equations

International Nuclear Information System (INIS)

Aruchunan, E.

2015-01-01

In this paper, we have examined the effectiveness of the quarter-sweep iteration concept on conjugate gradient normal residual (CGNR) iterative method by using composite Simpson's (CS) and finite difference (FD) discretization schemes in solving Fredholm integro-differential equations. For comparison purposes, Gauss- Seidel (GS) and the standard or full- and half-sweep CGNR methods namely FSCGNR and HSCGNR are also presented. To validate the efficacy of the proposed method, several analyses were carried out such as computational complexity and percentage reduction on the proposed and existing methods. (author)

Gauge fixing and classical dynamical r-matrices in (2+1)-gravity

International Nuclear Information System (INIS)

Schoenfeld, Torsten

2012-01-01

We apply the Dirac gauge fixing procedure to the combinatorial description of the moduli space of flat ISO(2,1)-connections. This is motivated by two goals: one originates from physics while the other is of a mathematical nature. The first goal is to investigate the application of gauge fixing in Lorentzian (2+1)-gravity with vanishing cosmological constant, whose phase space is closely related to the moduli space of flat ISO(2,1)-connections. To this end, we first show that specifying gauge fixing conditions amounts to introducing an observer into the theory. Then we determine explicit expressions for the Dirac brackets of specific sets of gauge fixing conditions and give a physical interpretation of the results in terms of the geometry of spacetimes and their effective symmetries. To investigate the mathematical structures underlying the Dirac gauge fixing procedure we then consider general gauge fixing conditions. We first show that the resulting Dirac brackets are in one-to-one correspondence with solutions of the classical dynamical Yang-Baxter equation. We then analyze the relation between the Dirac brackets associated with two different sets of gauge fixing conditions. We find that this relation is given by the action of certain dynamical Poincare transformations which generalize the gauge transformations of classical dynamical r-matrices. Using these transformations, we give a classification of all resulting Dirac brackets and the associated solutions of the classical dynamical Yang-Baxter equation.

Gauge fixing and classical dynamical r-matrices in (2+1)-gravity

Energy Technology Data Exchange (ETDEWEB)

Schoenfeld, Torsten

2012-11-20

We apply the Dirac gauge fixing procedure to the combinatorial description of the moduli space of flat ISO(2,1)-connections. This is motivated by two goals: one originates from physics while the other is of a mathematical nature. The first goal is to investigate the application of gauge fixing in Lorentzian (2+1)-gravity with vanishing cosmological constant, whose phase space is closely related to the moduli space of flat ISO(2,1)-connections. To this end, we first show that specifying gauge fixing conditions amounts to introducing an observer into the theory. Then we determine explicit expressions for the Dirac brackets of specific sets of gauge fixing conditions and give a physical interpretation of the results in terms of the geometry of spacetimes and their effective symmetries. To investigate the mathematical structures underlying the Dirac gauge fixing procedure we then consider general gauge fixing conditions. We first show that the resulting Dirac brackets are in one-to-one correspondence with solutions of the classical dynamical Yang-Baxter equation. We then analyze the relation between the Dirac brackets associated with two different sets of gauge fixing conditions. We find that this relation is given by the action of certain dynamical Poincare transformations which generalize the gauge transformations of classical dynamical r-matrices. Using these transformations, we give a classification of all resulting Dirac brackets and the associated solutions of the classical dynamical Yang-Baxter equation.

A Workshop on Algebraic Design Theory and Hadamard Matrices

CERN Document Server

2015-01-01

This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important ap...

Inconsistent Distances in Substitution Matrices can be Avoided by Properly Handling Hydrophobic Residues

Directory of Open Access Journals (Sweden)

J. Baussand

2008-01-01

Full Text Available The adequacy of substitution matrices to model evolutionary relationships between amino acid sequences can be numerically evaluated by checking the mathematical property of triangle inequality for all triplets of residues. By converting substitution scores into distances, one can verify that a direct path between two amino acids is shorter than a path passing through a third amino acid in the amino acid space modeled by the matrix. If the triangle inequality is not verified, the intuition is that the evolutionary signal is not well modeled by the matrix, that the space is locally inconsistent and that the matrix construction was probably based on insufficient biological data. Previous analysis on several substitution matrices revealed that the number of triplets violating the triangle inequality increases with sequence divergence. Here, we compare matrices which are dedicated to the alignment of highly divergent proteins. The triangle inequality is tested on several classical substitution matrices as well as in a pair of “complementary” substitution matrices recording the evolutionary pressures inside and outside hydrophobic blocks in protein sequences. The analysis proves the crucial role of hydrophobic residues in substitution matrices dedicated to the alignment of distantly related proteins.

A Technique for Controlling Matric Suction on Filter Papers . GroWth ...

African Journals Online (AJOL)

'Abstract. Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers ...

Derivation of equations for scalar and fermion fields using properties of dispersion-codispersion operators

International Nuclear Information System (INIS)

Raoelina Andriambololona; Ranaivoson, R.T.R; Hanitriarivo, R.; Harison, V.

2014-01-01

We establish equations for scalar and fermion fields using results obtained from a study on a phase space representation of quantum theory that we have performed in a previous work. Our approaches are similar to the historical ones to obtain Klein-Gordon and Dirac equations but the main difference is that ours are based on the use of properties of operators called dispersion-codispersion operators. We begin with a brief recall about the dispersion-codispersion operators. Then, introducing a mass operator with its canonical conjugate coordinate and applying rules of quantization, based on the use of dispersion - codispersion operators , we deduce a second order differential operator relation from the relativistic expression relying energy, momentum and mass. Using Dirac matrices, we derive from this second order differential operator relation a first order one. The application of the second order differential operator relation on a scalar function gives the equation for the scalar field and the use of the first order differential operator relation leads to the equation for fermion field.

ON MATRICES ARISING IN RETARDED DELAY DIFFERENTIAL SYSTEMS

Directory of Open Access Journals (Sweden)

S DJEZZAR

2002-12-01

Full Text Available Dans cet article, on considère une classe de système différentiels retardés et à laquelle on associe une matrice système sur R[s,z], l'anneau des polynômes à deux indéterminés s et z. Ensuite, en utilisant la notion de la matrice forme de Smith sur R[s,z], on étend un résultat de caractérisation obtenu précédemment [5] sur les formes canoniques, à un cas plus général.

On the Wigner law in dilute random matrices

Science.gov (United States)

Khorunzhy, A.; Rodgers, G. J.

1998-12-01

We consider ensembles of N × N symmetric matrices whose entries are weakly dependent random variables. We show that random dilution can change the limiting eigenvalue distribution of such matrices. We prove that under general and natural conditions the normalised eigenvalue counting function coincides with the semicircle (Wigner) distribution in the limit N → ∞. This can be explained by the observation that dilution (or more generally, random modulation) eliminates the weak dependence (or correlations) between random matrix entries. It also supports our earlier conjecture that the Wigner distribution is stable to random dilution and modulation.

Lectures on matrices

CERN Document Server

M Wedderburn, J H

1934-01-01

It is the organization and presentation of the material, however, which make the peculiar appeal of the book. This is no mere compendium of results-the subject has been completely reworked and the proofs recast with the skill and elegance which come only from years of devotion. -Bulletin of the American Mathematical Society The very clear and simple presentation gives the reader easy access to the more difficult parts of the theory. -Jahrbuch über die Fortschritte der Mathematik In 1937, the theory of matrices was seventy-five years old. However, many results had only recently evolved from sp

Theoretical origin of quark mass matrices

International Nuclear Information System (INIS)

Mohapatra, R.N.

1987-01-01

This paper presents the theoretical origin of specific quark mass matrices in the grand unified theories. The author discusses the first natural derivation of the Stech-type mass matrix in unified gauge theories. A solution to the strong CP-problem is provided

Modeling Transmission and Reflection Mueller Matrices of Dielectric Half-Wave Plates

Science.gov (United States)

Salatino, Maria; de Bernardis, Paolo; Masi, Silvia

2017-02-01

We present a simple analytical model describing multiple reflections in dielectric and optically active waveplates, for both normal and slant incidence, including absorption. We compute from first principles the transmission and reflection Mueller matrices of the waveplate. The model is used to simulate the performance of a Stokes polarimeter for mm-waves, in the framework of current attempts to precisely measure the linear polarization of the Cosmic Microwave Background (CMB). We study the spectral response of these optical devices, taking into account band and angle averaging effects and confirm the presence of a much richer spectral dependence than in an ideal phase retarder. We also present the matrix elements for the reflection matrix, which is useful to estimate systematic effects in some polarimeter configurations. The formulas we have derived can be used to quickly simulate the performance of future CMB polarimeters.

Symmetries of th-Order Approximate Stochastic Ordinary Differential Equations

OpenAIRE

Fredericks, E.; Mahomed, F. M.

2012-01-01

Symmetries of $n$ th-order approximate stochastic ordinary differential equations (SODEs) are studied. The determining equations of these SODEs are derived in an Itô calculus context. These determining equations are not stochastic in nature. SODEs are normally used to model nature (e.g., earthquakes) or for testing the safety and reliability of models in construction engineering when looking at the impact of random perturbations.

A Fast Newton-Shamanskii Iteration for a Matrix Equation Arising from M/G/1-Type Markov Chains

Directory of Open Access Journals (Sweden)

Pei-Chang Guo

2017-01-01

Full Text Available For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chains, the minimal nonnegative solution G or R can be found by Newton-like methods. We prove monotone convergence results for the Newton-Shamanskii iteration for this class of equations. Starting with zero initial guess or some other suitable initial guess, the Newton-Shamanskii iteration provides a monotonically increasing sequence of nonnegative matrices converging to the minimal nonnegative solution. A Schur decomposition method is used to accelerate the Newton-Shamanskii iteration. Numerical examples illustrate the effectiveness of the Newton-Shamanskii iteration.

Regenerated cellulose micro-nano fiber matrices for transdermal drug release

International Nuclear Information System (INIS)

Liu, Yue; Nguyen, Andrew; Allen, Alicia; Zoldan, Janet; Huang, Yuxiang; Chen, Jonathan Y.

2017-01-01

In this work, biobased fibrous membranes with micro- and nano-fibers are fabricated for use as drug delivery carries because of their biocompatibility, eco-friendly approach, and potential for scale-up. The cellulose micro-/nano-fiber (CMF) matrices were prepared by electrospinning of pulp in an ionic liquid, 1-butyl-3-methylimidazolium chloride. A model drug, ibuprofen (IBU), was loaded on the CMF matrices by a simple immersing method. The amount of IBU loading was about 6% based on the weight of cellulose membrane. The IBU-loaded CMF matrices were characterized by Fourier-transform infrared spectroscopy, thermal gravimetric analysis, and scanning electron microscopy. The test of ibuprofen release was carried out in an acetate buffer solution of pH 5.5 and examined by UV–Vis spectroscopy. Release profiles from the CMF matrices indicated that the drug release rate could be determined by a Fickian diffusion mechanism. - Highlights: • Cellulose micro-nano fiber matrix was prepared by dry-wet electrospinning. • Ibuprofen was loaded on the matrix by a simple immersing method. • The drug loaded matrix showed a biphasic release profile. • The drug release was determined by a Fickian diffusion mechanism.

Regenerated cellulose micro-nano fiber matrices for transdermal drug release

Energy Technology Data Exchange (ETDEWEB)

Liu, Yue [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States); Department of Chemistry, School of Science, Tianjin University, Tianjin (China); Nguyen, Andrew; Allen, Alicia; Zoldan, Janet [Department of Biomedical Engineering, The University of Texas at Austin, Austin, TX (United States); Huang, Yuxiang [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States); Chen, Jonathan Y., E-mail: jychen2@austin.utexas.edu [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States)

2017-05-01

In this work, biobased fibrous membranes with micro- and nano-fibers are fabricated for use as drug delivery carries because of their biocompatibility, eco-friendly approach, and potential for scale-up. The cellulose micro-/nano-fiber (CMF) matrices were prepared by electrospinning of pulp in an ionic liquid, 1-butyl-3-methylimidazolium chloride. A model drug, ibuprofen (IBU), was loaded on the CMF matrices by a simple immersing method. The amount of IBU loading was about 6% based on the weight of cellulose membrane. The IBU-loaded CMF matrices were characterized by Fourier-transform infrared spectroscopy, thermal gravimetric analysis, and scanning electron microscopy. The test of ibuprofen release was carried out in an acetate buffer solution of pH 5.5 and examined by UV–Vis spectroscopy. Release profiles from the CMF matrices indicated that the drug release rate could be determined by a Fickian diffusion mechanism. - Highlights: • Cellulose micro-nano fiber matrix was prepared by dry-wet electrospinning. • Ibuprofen was loaded on the matrix by a simple immersing method. • The drug loaded matrix showed a biphasic release profile. • The drug release was determined by a Fickian diffusion mechanism.

A Technique for Controlling Matric Suction on Filter Papers Used in ...

African Journals Online (AJOL)

Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers wetted to ...

Some physical applications of fractional Schroedinger equation

International Nuclear Information System (INIS)

Guo Xiaoyi; Xu Mingyu

2006-01-01

The fractional Schroedinger equation is solved for a free particle and for an infinite square potential well. The fundamental solution of the Cauchy problem for a free particle, the energy levels and the normalized wave functions of a particle in a potential well are obtained. In the barrier penetration problem, the reflection coefficient and transmission coefficient of a particle from a rectangular potential wall is determined. In the quantum scattering problem, according to the fractional Schroedinger equation, the Green's function of the Lippmann-Schwinger integral equation is given

Open vessel microwave digestion of food matrices (T6)

International Nuclear Information System (INIS)

Rhodes, L.; LeBlanc, G.

2002-01-01

Full text: Advancements in the field of open vessel microwave digestion continue to provide solutions for industries requiring acid digestion of large sample sizes. Those interesting in digesting food matrices are particularly interested in working with large amounts of sample and then diluting small final volumes. This paper will show the advantages of instantaneous regent addition and post-digestion evaporation when performing an open vessel digestion and evaporation methods for various food matrices will be presented along with analyte recovery data. (author)

Gravitational field equations on and off a 3-brane world

International Nuclear Information System (INIS)

Aliev, A N; Guemruekcueoglu, A E

2004-01-01

The effective gravitational field equations on and off a 3-brane world possessing a Z 2 mirror symmetry and embedded in a five-dimensional bulk spacetime with cosmological constant were derived by Shiromizu, Maeda and Sasaki (SMS) in the framework of the Gauss-Codazzi projective approach with the subsequent specialization to the Gaussian normal coordinates in the neighbourhood of the brane. However, the Gaussian normal coordinates imply a very special slicing of spacetime and clearly, the consistent analysis of the brane dynamics would benefit from complete freedom in the slicing of spacetime, pushing the layer surfaces in the fifth dimension at any rates of evolution and in arbitrary positions. We rederive the SMS effective gravitational field equations on a 3-brane and generalize the off-brane equations to the case where there is an arbitrary energy-momentum tensor in the bulk. We use a more general setting to allow for acceleration of the normals to the brane surface through the lapse function and the shift vector in the spirit of Arnowitt, Deser and Misner. We show that the gravitational influence of the bulk spacetime on the brane may be described by a traceless second-rank tensor W ij , constructed from the 'electric' part of the bulk Riemann tensor. We also present the evolution equations for the tensor W ij , as well as for the corresponding 'magnetic' part of the bulk curvature. These equations involve terms determined by both the nonvanishing acceleration of normals in the nongeodesic slicing of spacetime and the presence of other fields in the bulk

Exact solution of the Schroedinger equation with the spin-boson Hamiltonian

International Nuclear Information System (INIS)

Gardas, Bartlomiej

2011-01-01

We address the problem of obtaining the exact reduced dynamics of the spin-half (qubit) immersed within the bosonic bath (environment). An exact solution of the Schroedinger equation with the paradigmatic spin-boson Hamiltonian is obtained. We believe that this result is a major step ahead and may ultimately contribute to the complete resolution of the problem in question. We also construct the constant of motion for the spin-boson system. In contrast to the standard techniques available within the framework of the open quantum systems theory, our analysis is based on the theory of block operator matrices.

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.

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

Square matrices of order 2 theory, applications, and problems

CERN Document Server

Pop, Vasile

2017-01-01

This unique and innovative book presents an exciting and complete detail of all the important topics related to the theory of square matrices of order 2. The readers exploring every detailed aspect of matrix theory are gently led toward understanding advanced topics. They will follow every notion of matrix theory with ease, accumulating a thorough understanding of algebraic and geometric aspects of matrices of order 2. The prime jewel of this book is its offering of an unusual collection of problems, theoretically motivated, most of which are new, original, and seeing the light of publication for the first time in the literature. Nearly all of the exercises are presented with detailed solutions and vary in difficulty from easy to more advanced. Many problems are particularly challenging. These, and not only these, invite the reader to unleash their creativity and research capabilities and to discover their own methods of attacking a problem. Matrices have a vast practical importance to mathematics, science, a...

Linear algebra and matrices topics for a second course

CERN Document Server

Shapiro, Helene

2015-01-01

Linear algebra and matrix theory are fundamental tools for almost every area of mathematics, both pure and applied. This book combines coverage of core topics with an introduction to some areas in which linear algebra plays a key role, for example, block designs, directed graphs, error correcting codes, and linear dynamical systems. Notable features include a discussion of the Weyr characteristic and Weyr canonical forms, and their relationship to the better-known Jordan canonical form; the use of block cyclic matrices and directed graphs to prove Frobenius's theorem on the structure of the eigenvalues of a nonnegative, irreducible matrix; and the inclusion of such combinatorial topics as BIBDs, Hadamard matrices, and strongly regular graphs. Also included are McCoy's theorem about matrices with property P, the Bruck-Ryser-Chowla theorem on the existence of block designs, and an introduction to Markov chains. This book is intended for those who are familiar with the linear algebra covered in a typical first c...

Selection of appropriate conditioning matrices for the safe disposal of radioactive waste

International Nuclear Information System (INIS)

Vance, E.R.

2002-01-01

The selection of appropriate solid conditioning matrices or wasteforms for the safe disposal of radioactive waste is dictated by many factors. The overriding issue is that the matrix incorporating the radionuclides, together with a set of engineered barriers in a near-surface or deep geological repository, should prevent significant groundwater transport of radionuclides to the biosphere. For high-level waste (HLW) from nuclear fuel reprocessing, the favored matrices are glasses, ceramics and glass-ceramics. Borosilicate glasses are presently being used in some countries, but there are strong scientific arguments why ceramics based on assemblages of natural minerals are advantageous for HLW. Much research has been carried out in the last 40 years around the world, and different matrices are more suitable than others for a given waste composition. However a major stumbling block for HLW immobilisation is the mall number of approved geological repositories for such matrices. The most appropriate matrices for Intermediate and low-level wastes are contentious and the selection criteria are not very well defined. The candidate matrices for these latter wastes are cements, bitumen, geopolymers, glasses, glass-ceramics and ceramics. After discussing the pros and cons of various candidate matrices for given kinds of radioactive wastes, the SYNROC research program at ANSTO will be briefly surveyed. Some of the potential applications of this work using a variety of SYNROC derivatives will be given. Finally the basic research program at ANSTO on radioactive waste immobilisation will be summarised. This comprises mainly work on solid state chemistry to understand ionic valences and co-ordinations for the chemical design of wasteforms, aqueous durability to study the pH and temperature dependence of solid-water reactions, radiation damage effects on structure and solid-water reactions. (Author)

Numerical study of nonlinear singular fractional differential equations arising in biology by operational matrix of shifted Legendre polynomials

Directory of Open Access Journals (Sweden)

D. Jabari Sabeg

2016-10-01

Full Text Available In this paper, we present a new computational method for solving nonlinear singular boundary value problems of fractional order arising in biology. To this end, we apply the operational matrices of derivatives of shifted Legendre polynomials to reduce such problems to a system of nonlinear algebraic equations. To demonstrate the validity and applicability of the presented method, we present some numerical examples.

Preparation and characterization of porous crosslinked collagenous matrices containing bioavailable chondroitin sulphate

NARCIS (Netherlands)

Pieper, J.S.; Oosterhof, A.; Dijkstra, Pieter J.; Veerkamp, J.H.; van Kuppevelt, T.H.

1999-01-01

Porous collagen matrices with defined physical, chemical and biological characteristics are interesting materials for tissue engineering. Attachment of glycosaminoglycans (GAGs) may add to these characteristics and valorize collagen. In this study, porous type I collagen matrices were crosslinked

Efficiency of fly ash belite cement and zeolite matrices for immobilizing cesium

International Nuclear Information System (INIS)

Goni, S.; Guerrero, A.; Lorenzo, M.P.

2006-01-01

The efficiency of innovative matrices for immobilizing cesium is presented in this work. The matrix formulation included the use of fly ash belite cement (FABC-2-W) and gismondine-type Na-P1 zeolite, both of which are synthesized from fly ash of coal combustion. The efficiency for immobilizing cesium is evaluated from the leaching test ANSI/ANS 16.1-1986 at the temperature of 40 deg. C, from which the apparent diffusion coefficient of cesium is obtained. Matrices with 100% of FABC-2-W are used as a reference. The integrity of matrices is evaluated by porosity and pore-size distribution from mercury intrusion porosimetry, X-ray diffraction and nitrogen adsorption analyses. Both matrices can be classified as good solidify systems for cesium, specially the FABC-2-W/zeolite matrix in which the replacement of 50% of belite cement by the gismondine-type Na-P1 zeolite caused a decrease of two orders of magnitude of cesium mean Effective Diffusion Coefficient (D e ) (2.8e-09 cm 2 /s versus 2.2e-07 cm 2 /s, for FABC-2-W/zeolite and FABC-2-W matrices, respectively)

Normal zone detectors for a large number of inductively coupled coils

International Nuclear Information System (INIS)

Owen, E.W.; Shimer, D.W.

1983-01-01

In order to protect a set of inductively coupled superconducting magnets, it is necessary to locate and measure normal zone voltages that are small compared with the mutual and self-induced voltages. The method described in this report uses two sets of voltage measurements to locate and measure one or more normal zones in any number of coupled coils. One set of voltages is the outputs of bridges that balance out the self-induced voltages The other set of voltages can be the voltages across the coils, although alternatives are possible. The two sets of equations form a single combined set of equations. Each normal zone location or combination of normal zones has a set of these combined equations associated with it. It is demonstrated that the normal zone can be located and the correct set chosen, allowing determination of the size of the normal zone. Only a few operations take plae in a working detector: multiplication of a constant, addition, and simple decision-making. In many cases the detector for each coil, although weakly linked to the other detectors, can be considered to be independent. An example of the detector design is given for four coils with realistic parameters. The effect on accuracy of changes in the system parameters is discussed

Normal zone soliton in large composite superconductors

International Nuclear Information System (INIS)

Kupferman, R.; Mints, R.G.; Ben-Jacob, E.

1992-01-01

The study of normal zone of finite size (normal domains) in superconductors, has been continuously a subject of interest in the field of applied superconductivity. It was shown that in homogeneous superconductors normal domains are always unstable, so that if a normal domain nucleates, it will either expand or shrink. While testing the stability of large cryostable composite superconductors, a new phenomena was found, the existence of stable propagating normal solitons. The formation of these propagating domains was shown to be a result of the high Joule power generated in the superconductor during the relatively long process of current redistribution between the superconductor and the stabilizer. Theoretical studies were performed in investigate the propagation of normal domains in large composite super conductors in the cryostable regime. Huang and Eyssa performed numerical calculations simulating the diffusion of heat and current redistribution in the conductor, and showed the existence of stable propagating normal domains. They compared the velocity of normal domain propagation with the experimental data, obtaining a reasonable agreement. Dresner presented an analytical method to solve this problem if the time dependence of the Joule power is given. He performed explicit calculations of normal domain velocity assuming that the Joule power decays exponentially during the process of current redistribution. In this paper, the authors propose a system of two one-dimensional diffusion equations describing the dynamics of the temperature and the current density distributions along the conductor. Numerical simulations of the equations reconfirm the existence of propagating domains in the cryostable regime, while an analytical investigation supplies an explicit formula for the velocity of the normal domain

A GPU-accelerated semi-implicit fractional-step method for numerical solutions of incompressible Navier-Stokes equations

Science.gov (United States)

Ha, Sanghyun; Park, Junshin; You, Donghyun

2018-01-01

Utility of the computational power of Graphics Processing Units (GPUs) is elaborated for solutions of incompressible Navier-Stokes equations which are integrated using a semi-implicit fractional-step method. The Alternating Direction Implicit (ADI) and the Fourier-transform-based direct solution methods used in the semi-implicit fractional-step method take advantage of multiple tridiagonal matrices whose inversion is known as the major bottleneck for acceleration on a typical multi-core machine. A novel implementation of the semi-implicit fractional-step method designed for GPU acceleration of the incompressible Navier-Stokes equations is presented. Aspects of the programing model of Compute Unified Device Architecture (CUDA), which are critical to the bandwidth-bound nature of the present method are discussed in detail. A data layout for efficient use of CUDA libraries is proposed for acceleration of tridiagonal matrix inversion and fast Fourier transform. OpenMP is employed for concurrent collection of turbulence statistics on a CPU while the Navier-Stokes equations are computed on a GPU. Performance of the present method using CUDA is assessed by comparing the speed of solving three tridiagonal matrices using ADI with the speed of solving one heptadiagonal matrix using a conjugate gradient method. An overall speedup of 20 times is achieved using a Tesla K40 GPU in comparison with a single-core Xeon E5-2660 v3 CPU in simulations of turbulent boundary-layer flow over a flat plate conducted on over 134 million grids. Enhanced performance of 48 times speedup is reached for the same problem using a Tesla P100 GPU.

Evaluation of the technical feasibility of new conditioning matrices for long-lived radionuclides

International Nuclear Information System (INIS)

Deschanels, X.

2004-01-01

Several matrices have been selected for the conditioning of long-lived radioactive wastes: a compound made of a iodo-apatite core coated with a densified matrice of vanadium-phosphorus-lead apatite for iodine; the hollandite ceramic for cesium; the britholite, zirconolite, thorium phosphate diphosphate, and the monazite-brabantite solid solution for minor actinides; and a Nb-based metal alloy and phosphate or titanate-type ceramics for technetium. This report presents the results of the researches carried out between 2002-2004 during the technical feasibility step. The main points described are: - the behaviour of matrices under irradiation. These studies were performed thanks to an approach combining the characterization of natural analogues, the doping of matrices with short-lived radionuclides and the use of external irradiations; - the behaviour of these matrices with respect to water alteration; - the sensibility of these structures with respect to the incorporation of chemical impurities; - a package-process approach including the optimization of the process and preliminary studies about the package concept retained. These studies show that important work remains to be done to develop conditioning matrices suitable for iodine and technetium, while for cesium and minor actinides, the first steps of the technical feasibility are made. However, it remains impossible today to determine the structure having the best global behaviour. (J.S.)

Matrices and society matrix algebra and its applications in the social sciences

CERN Document Server

Bradley, Ian

2014-01-01

Matrices offer some of the most powerful techniques in modem mathematics. In the social sciences they provide fresh insights into an astonishing variety of topics. Dominance matrices can show how power struggles in offices or committees develop; Markov chains predict how fast news or gossip will spread in a village; permutation matrices illuminate kinship structures in tribal societies. All these invaluable techniques and many more are explained clearly and simply in this wide-ranging book. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to

Theory of quark mixing matrix and invariant functions of mass matrices

International Nuclear Information System (INIS)

Jarlskog, C.

1987-10-01

The outline of this talk is as follows: The origin of the quark mixing matrix. Super elementary theory of flavour projection operators. Equivalences and invariances. The commutator formalism and CP violation. CP conditions for any number of families. The 'angle' between the quark mass matrices. Application to Fritzsch and Stech matrices. References. (author)

Geometry and arithmetic of factorized S-matrices

International Nuclear Information System (INIS)

Freund, P.G.O.

1995-01-01

In realistic four-dimensional quantum field theories integrability is elusive. Relativity, when combined with quantum theory does not permit an infinity of local conservation laws except for free fields, for which the S-matrix is trivial S = 1. In two space-time dimensions, where forward and backward scattering are the only possibilities, nontrivial S-matrices are possible even in integrable theories. Such S-matrices are known to factorize [1]. This means that there is no particle production, so that the 4-point amplitudes determine all higher n-point amplitudes. In our recent work [2, 3, 4, 5, 6] we found that in such integrable two-dimensional theories, even the input 4-point amplitudes are determined by a simple principle. Roughly speaking these amplitudes describe the S-wave scattering which one associates with free motion on certain quantum-symmetric spaces. The trivial S-matrix of free field theory describes the absence of scattering which one associates with free motion on a euclidean space, itself a symmetric space. As is well known [7, 8, 9], for curved symmetric spaces the S-matrices for S-wave scattering are no longer trivial, but rather they are determined by the Harish-Chandra c-functions of these spaces [10]. The quantum deformation of this situation is what appears when one considers excitation scattering in two-dimensional integrable models. (orig.)

Random Matrices for Information Processing – A Democratic Vision

DEFF Research Database (Denmark)

Cakmak, Burak

The thesis studies three important applications of random matrices to information processing. Our main contribution is that we consider probabilistic systems involving more general random matrix ensembles than the classical ensembles with iid entries, i.e. models that account for statistical...... dependence between the entries. Specifically, the involved matrices are invariant or fulfill a certain asymptotic freeness condition as their dimensions grow to infinity. Informally speaking, all latent variables contribute to the system model in a democratic fashion – there are no preferred latent variables...

Kelvin Equation for a Non-Ideal Multicomponent Mixture

DEFF Research Database (Denmark)

Shapiro, Alexander; Stenby, Erling Halfdan

1997-01-01

The Kelvin equation is generalized by application to a case of a multicomponent non-ideal mixture. Such a generalization is necessary in order to describe the two-phase equilibrium in a capillary medium with respect to both normal and retrograde condensation. The equation obtained is applied...... to the equilibrium state of a hydrocarbon mixture ina gas-condensate reservoir....

New Numerical Solution of von Karman Equation of Lengthwise Rolling

Directory of Open Access Journals (Sweden)

Rudolf Pernis

2015-01-01

Full Text Available The calculation of average material contact pressure to rolls base on mathematical theory of rolling process given by Karman equation was solved by many authors. The solutions reported by authors are used simplifications for solution of Karman equation. The simplifications are based on two cases for approximation of the circular arch: (a by polygonal curve and (b by parabola. The contribution of the present paper for solution of two-dimensional differential equation of rolling is based on description of the circular arch by equation of a circle. The new term relative stress as nondimensional variable was defined. The result from derived mathematical models can be calculated following variables: normal contact stress distribution, front and back tensions, angle of neutral point, coefficient of the arm of rolling force, rolling force, and rolling torque during rolling process. Laboratory cold rolled experiment of CuZn30 brass material was performed. Work hardening during brass processing was calculated. Comparison of theoretical values of normal contact stress with values of normal contact stress obtained from cold rolling experiment was performed. The calculations were not concluded with roll flattening.

A new normalization method based on electrical field lines for electrical capacitance tomography

International Nuclear Information System (INIS)

Zhang, L F; Wang, H X

2009-01-01

Electrical capacitance tomography (ECT) is considered to be one of the most promising process tomography techniques. The image reconstruction for ECT is an inverse problem to find the spatially distributed permittivities in a pipe. Usually, the capacitance measurements obtained from the ECT system are normalized at the high and low permittivity for image reconstruction. The parallel normalization model is commonly used during the normalization process, which assumes the distribution of materials in parallel. Thus, the normalized capacitance is a linear function of measured capacitance. A recently used model is a series normalization model which results in the normalized capacitance as a nonlinear function of measured capacitance. The newest presented model is based on electrical field centre lines (EFCL), and is a mixture of two normalization models. The multi-threshold method of this model is presented in this paper. The sensitivity matrices based on different normalization models were obtained, and image reconstruction was carried out accordingly. Simulation results indicate that reconstructed images with higher quality can be obtained based on the presented model

Hydrogen-atom tunneling through a very high barrier; spontaneous thiol → thione conversion in thiourea isolated in low-temperature Ar, Ne, H2 and D2 matrices.

Science.gov (United States)

Rostkowska, Hanna; Lapinski, Leszek; Nowak, Maciej J

2018-05-23

Spontaneous thiol → thione hydrogen-atom transfer has been investigated for molecules of thiourea trapped in Ar, Ne, normal-H2 (n-H2) and normal-D2 (n-D2) low-temperature matrices. The most stable thione isomer was the only form of the compound present in the matrices after their deposition. According to MP2/6-311++G(2d,p) calculations, the thiol tautomer should be higher in energy by 62.5 kJ mol-1. This less stable thiol form of the compound was photochemically generated in a thione → thiol process, occurring upon UV irradiation of the matrix. Subsequently, a very slow spontaneous conversion of the thiol tautomer into the thione form was observed for the molecules isolated in Ar, Ne, n-H2 and n-D2 matrices kept at 3.5 K and in the dark. Since the thiol → thione transformation in thiourea is a process involving the dissociation of a chemical bond, the barrier for this hydrogen-atom transfer is very high (104-181 kJ mol-1). Crossing such a high potential-energy barrier at a temperature as low as 3.5 K, is possible only by hydrogen-atom tunneling. The experimentally measured time constants of this tunneling process: 52 h (Ar), 76 h (Ne), 94 h (n-H2) and 94 h (n-D2), do not differ much from one another. Hence, the dependence of the tunneling rate on the matrix environment is not drastic. The progress of the thiol → thione conversion was also monitored for Ar matrices at different temperature: 3.5 K, 9 K and 15 K. For this temperature range, the experiments revealed no detectable temperature dependence of the rate of the tunneling process.

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.

Studies of Catalytic Properties of Inorganic Rock Matrices in Redox Reactions

Directory of Open Access Journals (Sweden)

Nikolay M. Dobrynkin

2017-09-01

Full Text Available Intrinsic catalytic properties of mineral matrices of various kinds (basalts, clays, sandstones were studied, which are of interest for in-situ heavy oil upgrading (i.e., underground to create advanced technologies for enhanced oil recovery. The elemental, surface and phase composition and matrix particle morphology, surface and acidic properties were studied using elemental analysis, X-ray diffraction, adsorption and desorption of nitrogen and ammonia. The data on the catalytic activity of inorganic matrices in ammonium nitrate decomposition (reaction with a large gassing, oxidation of hydrocarbons and carbon monoxide, and hydrocracking of asphaltenes into maltenes (the conversion of heavy hydrocarbons into more valuable light hydrocarbons were discussed. In order to check their applicability for the asphaltenes hydrocracking catalytic systems development, basalt and clay matrices were used as supports for iron/basalt, nickel/basalt and iron/clay catalysts. The catalytic activity of the matrices in the reactions of the decomposition of ammonium nitrate, oxidation of hydrocarbons and carbon monoxide, and hydrocracking of asphaltens was observed for the first time.

Indentation stiffness does not discriminate between normal and degraded articular cartilage.

Science.gov (United States)

Brown, Cameron P; Crawford, Ross W; Oloyede, Adekunle

2007-08-01

Relative indentation characteristics are commonly used for distinguishing between normal healthy and degraded cartilage. The application of this parameter in surgical decision making and an appreciation of articular cartilage biomechanics has prompted us to hypothesise that it is difficult to define a reference stiffness to characterise normal articular cartilage. This hypothesis is tested for validity by carrying out biomechanical indentation of articular cartilage samples that are characterised as visually normal and degraded relative to proteoglycan depletion and collagen disruption. Compressive loading was applied at known strain rates to visually normal, artificially degraded and naturally osteoarthritic articular cartilage and observing the trends of their stress-strain and stiffness characteristics. While our results demonstrated a 25% depreciation in the stiffness of individual samples after proteoglycan depletion, they also showed that when compared to the stiffness of normal samples only 17% lie outside the range of the stress-strain behaviour of normal samples. We conclude that the extent of the variability in the properties of normal samples, and the degree of overlap (81%) of the biomechanical properties of normal and degraded matrices demonstrate that indentation data cannot form an accurate basis for distinguishing normal from abnormal articular cartilage samples with consequences for the application of this mechanical process in the clinical environment.

SUPERCRITICAL FLUID TREATMENT OF THREE-DIMENSIONAL HYDROGEL MATRICES, COMPOSED OF CHITOSAN DERIVATIVES

Directory of Open Access Journals (Sweden)

P. S. Timashev

2016-01-01

Full Text Available Aim. Controlled treatment of the physico-chemical and mechanical properties of a three-dimensional crosslinked matrix based on reactive chitosan. Materials and methods. The three-dimensional matrices were obtained using photosensitive composition based on allyl chitosan (5 wt%, poly(ethylene glycol diacrylate (8 wt% and the photoinitiator Irgacure 2959 (1 wt% by laser stereolithography setting. The kinetic swelling curves were constructed for structures in the base and salt forms of chitosan using gravimetric method and the contact angles were measured using droplet spreading. The supercritical fl uid setting (40 °C, 12 MPa was used to process matrices during 1.5 hours. Using nanohardness Piuma Nanoindenter we calculated values of Young’s modulus. The study of cytotoxicity was performed by direct contact with the culture of the NIH 3T3 mouse fi broblast cell line. Results. Architectonics of matrices fully repeats the program model. Matrices are uniform throughout and retain their shape after being transferred to the base form. Matrices compressed by 5% after treatment in supercritical carbon dioxide (scCO2 . The elastic modulus of matrices after scCO2 treatment is 4 times higher than the original matrix. The kinetic swelling curves have similar form. In this case the maximum degree of swelling for matrices in base form is 2–2.5 times greater than that of matrices in salt form. There was a surface hydrophobization after the material was transferred to the base form: the contact angle is 94°, and for the salt form it is 66°. The basic form absorbs liquid approximately 1.6 times faster. The fi lm thickness was increased in the area of contact with the liquid droplets after absorption by 133 and 87% for the base and the salt forms, respectively. Treatment of samples in scCO2 reduces their cytotoxicity from 2 degree of reaction (initial samples down to 1 degree of reaction. Conclusion. The use of supercritical carbon dioxide for scaffolds

The reflection of hierarchical cluster analysis of co-occurrence matrices in SPSS

NARCIS (Netherlands)

Zhou, Q.; Leng, F.; Leydesdorff, L.

2015-01-01

Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare

Topological resilience in non-normal networked systems

Science.gov (United States)

Asllani, Malbor; Carletti, Timoteo

2018-04-01

The network of interactions in complex systems strongly influences their resilience and the system capability to resist external perturbations or structural damages and to promptly recover thereafter. The phenomenon manifests itself in different domains, e.g., parasitic species invasion in ecosystems or cascade failures in human-made networks. Understanding the topological features of the networks that affect the resilience phenomenon remains a challenging goal for the design of robust complex systems. We hereby introduce the concept of non-normal networks, namely networks whose adjacency matrices are non-normal, propose a generating model, and show that such a feature can drastically change the global dynamics through an amplification of the system response to exogenous disturbances and eventually impact the system resilience. This early stage transient period can induce the formation of inhomogeneous patterns, even in systems involving a single diffusing agent, providing thus a new kind of dynamical instability complementary to the Turing one. We provide, first, an illustrative application of this result to ecology by proposing a mechanism to mute the Allee effect and, second, we propose a model of virus spreading in a population of commuters moving using a non-normal transport network, the London Tube.

Study on vulnerability matrices of masonry buildings of mainland China

Science.gov (United States)

Sun, Baitao; Zhang, Guixin

2018-04-01

The degree and distribution of damage to buildings subjected to earthquakes is a concern of the Chinese Government and the public. Seismic damage data indicates that seismic capacities of different types of building structures in various regions throughout mainland China are different. Furthermore, the seismic capacities of the same type of structure in different regions may vary. The contributions of this research are summarized as follows: 1) Vulnerability matrices and earthquake damage matrices of masonry structures in mainland China were chosen as research samples. The aim was to analyze the differences in seismic capacities of sample matrices and to present general rules for categorizing seismic resistance. 2) Curves relating the percentage of damaged masonry structures with different seismic resistances subjected to seismic demand in different regions of seismic intensity (VI to X) have been developed. 3) A method has been proposed to build vulnerability matrices of masonry structures. The damage ratio for masonry structures under high-intensity events such as the Ms 6.1 Panzhihua earthquake in Sichuan province on 30 August 2008, was calculated to verify the applicability of this method. This research offers a significant theoretical basis for predicting seismic damage and direct loss assessment of groups of buildings, as well as for earthquake disaster insurance.

LIBS analysis of artificial calcified tissues matrices.

Science.gov (United States)

Kasem, M A; Gonzalez, J J; Russo, R E; Harith, M A

2013-04-15

In most laser-based analytical methods, the reproducibility of quantitative measurements strongly depends on maintaining uniform and stable experimental conditions. For LIBS analysis this means that for accurate estimation of elemental concentration, using the calibration curves obtained from reference samples, the plasma parameters have to be kept as constant as possible. In addition, calcified tissues such as bone are normally less "tough" in their texture than many samples, especially metals. Thus, the ablation process could change the sample morphological features rapidly, and result in poor reproducibility statistics. In the present work, three artificial reference sample sets have been fabricated. These samples represent three different calcium based matrices, CaCO3 matrix, bone ash matrix and Ca hydroxyapatite matrix. A comparative study of UV (266 nm) and IR (1064 nm) LIBS for these three sets of samples has been performed under similar experimental conditions for the two systems (laser energy, spot size, repetition rate, irradiance, etc.) to examine the wavelength effect. The analytical results demonstrated that UV-LIBS has improved reproducibility, precision, stable plasma conditions, better linear fitting, and the reduction of matrix effects. Bone ash could be used as a suitable standard reference material for calcified tissue calibration using LIBS with a 266 nm excitation wavelength. Copyright © 2013 Elsevier B.V. All rights reserved.

The Antitriangular Factorization of Saddle Point Matrices

KAUST Repository

Pestana, J.; Wathen, A. J.

2014-01-01

Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle

Carcinogenesis: alterations in reciprocal interactions of normal functional structure of biologic systems.

Science.gov (United States)

Davydyan, Garri

2015-12-01

The evolution of biologic systems (BS) includes functional mechanisms that in some conditions may lead to the development of cancer. Using mathematical group theory and matrix analysis, previously, it was shown that normally functioning BS are steady functional structures regulated by three basis regulatory components: reciprocal links (RL), negative feedback (NFB) and positive feedback (PFB). Together, they form an integrative unit maintaining system's autonomy and functional stability. It is proposed that phylogenetic development of different species is implemented by the splitting of "rudimentary" characters into two relatively independent functional parts that become encoded in chromosomes. The functional correlate of splitting mechanisms is RL. Inversion of phylogenetic mechanisms during ontogenetic development leads cell differentiation until cells reach mature states. Deterioration of reciprocal structure in the genome during ontogenesis gives rise of pathological conditions characterized by unsteadiness of the system. Uncontrollable cell proliferation and invasive cell growth are the leading features of the functional outcomes of malfunctioning systems. The regulatory element responsible for these changes is RL. In matrix language, pathological regulation is represented by matrices having positive values of diagonal elements ( TrA  > 0) and also positive values of matrix determinant ( detA  > 0). Regulatory structures of that kind can be obtained if the negative entry of the matrix corresponding to RL is replaced with the positive one. To describe not only normal but also pathological states of BS, a unit matrix should be added to the basis matrices representing RL, NFB and PFB. A mathematical structure corresponding to the set of these four basis functional patterns (matrices) is a split quaternion (coquaternion). The structure and specific role of basis elements comprising four-dimensional linear space of split quaternions help to understand what

Diagonalization of quark mass matrices and the Cabibbo-Kobayashi-Maskawa matrix

International Nuclear Information System (INIS)

Rasin, A.

1997-08-01

I discuss some general aspect of diagonalizing the quark mass matrices and list all possible parametrizations of the Cabibbo-Kobayashi-Maskawa matrix (CKM) in terms of three rotation angles and a phase. I systematically study the relation between the rotations needed to diagonalize the Yukawa matrices and various parametrizations of the CKM. (author). 17 refs, 1 tab

Concrete minimal 3 × 3 Hermitian matrices and some general cases

Directory of Open Access Journals (Sweden)

Klobouk Abel H.

2017-12-01

Full Text Available Given a Hermitian matrix M ∈ M3(ℂ we describe explicitly the real diagonal matrices DM such that ║M + DM║ ≤ ║M + D║ for all real diagonal matrices D ∈ M3(ℂ, where ║ · ║ denotes the operator norm. Moreover, we generalize our techniques to some n × n cases.

Contact Geometry of Hyperbolic Equations of Generic Type

Directory of Open Access Journals (Sweden)

Dennis The

2008-08-01

Full Text Available We study the contact geometry of scalar second order hyperbolic equations in the plane of generic type. Following a derivation of parametrized contact-invariants to distinguish Monge-Ampère (class 6-6, Goursat (class 6-7 and generic (class 7-7 hyperbolic equations, we use Cartan's equivalence method to study the generic case. An intriguing feature of this class of equations is that every generic hyperbolic equation admits at most a nine-dimensional contact symmetry algebra. The nine-dimensional bound is sharp: normal forms for the contact-equivalence classes of these maximally symmetric generic hyperbolic equations are derived and explicit symmetry algebras are presented. Moreover, these maximally symmetric equations are Darboux integrable. An enumeration of several submaximally symmetric (eight and seven-dimensional generic hyperbolic structures is also given.

Semiparametric estimation of covariance matrices for longitudinal data.

Science.gov (United States)

Fan, Jianqing; Wu, Yichao

2008-12-01

Estimation of longitudinal data covariance structure poses significant challenges because the data are usually collected at irregular time points. A viable semiparametric model for covariance matrices was proposed in Fan, Huang and Li (2007) that allows one to estimate the variance function nonparametrically and to estimate the correlation function parametrically via aggregating information from irregular and sparse data points within each subject. However, the asymptotic properties of their quasi-maximum likelihood estimator (QMLE) of parameters in the covariance model are largely unknown. In the current work, we address this problem in the context of more general models for the conditional mean function including parametric, nonparametric, or semi-parametric. We also consider the possibility of rough mean regression function and introduce the difference-based method to reduce biases in the context of varying-coefficient partially linear mean regression models. This provides a more robust estimator of the covariance function under a wider range of situations. Under some technical conditions, consistency and asymptotic normality are obtained for the QMLE of the parameters in the correlation function. Simulation studies and a real data example are used to illustrate the proposed approach.

Calculation of controllability and observability matrices for special case of continuous-time multi-order fractional systems.

Science.gov (United States)

Hassanzadeh, Iman; Tabatabaei, Mohammad

2017-03-28

In this paper, controllability and observability matrices for pseudo upper or lower triangular multi-order fractional systems are derived. It is demonstrated that these systems are controllable and observable if and only if their controllability and observability matrices are full rank. In other words, the rank of these matrices should be equal to the inner dimension of their corresponding state space realizations. To reduce the computational complexities, these matrices are converted to simplified matrices with smaller dimensions. Numerical examples are provided to show the usefulness of the mentioned matrices for controllability and observability analysis of this case of multi-order fractional systems. These examples clarify that the duality concept is not necessarily true for these special systems. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Systematic tools for chemical equation balancing

International Nuclear Information System (INIS)

Filby, E.E.; Idaho National Engineering Lab., Idaho Falls, ID; Idaho Univ., Idaho Falls, ID

1989-01-01

One of the most important skills that chemists and chemical engineers must develop is the ability to balance chemical equations. The normal first method taught is ''balancing by inspection'', which is sometimes explained as simply ''mental algebra.'' Every textbook surveyed for this paper presents equation balancing first as a matter of trial and error; this includes four very recently published books. Very little further guidance is provided until oxidation-reduction reactions must be balanced. The most commonly taught approaches for balancing, redox equations have been the oxidation state change and ion-electron methods. Unfortunately, redox reactions are usually treated as a new topic, and what the student has teamed about ''ordinary'' equations is of little or no help. All too often, these contradictions simply confuse and frustrate students, and equation balancing is relegated to the status of a black art. This is ironic because such,confusion and frustration is not necessary: Chemical equations can, in fact, be balanced by explicitly definable mathematical methods. The purpose of this paper is to outline the algebraic methods involved

Time-dependent quantum many-body systems. Linear response, electronic transport, and reduced density matrices

International Nuclear Information System (INIS)

Appel, H.

2007-05-01

In part I of this work we present a double-pole approximation (DPA) to the response equations of time-dependent density functional theory (TDDFT). The double-pole approximation provides an exact description of systems with two strongly coupled excitations which are isolated from the rest of the spectrum. In contrast to the traditional single-pole approximation of TDDFT the DPA also yields corrections to the Kohn-Sham oscillator strengths. We also demonstrate how to invert the double-pole solution which allows us to predict matrix elements of the exchange-correlation kernel f xc from experimental input. We attempt some first steps towards a time-dependent generalization of reduced density matrix functional theory (RDMFT). In part II we derive equations of motion for natural orbitals and occupation numbers. Using the equation of motion for the occupation numbers we show that an adiabatic extension of presently known ground-state functionals of static RDMFT always leads to occupation numbers which are constant in time. From the stationary conditions of the equations of motion for the N-body correlations (correlated parts of the N-body matrices) we derive a new class of ground-state functionals which can be used in static RDMFT. Applications are presented for a one-dimensional model system where the time-dependent many-body Schroedinger equation can be propagated numerically. We use optimal control theory to find optimized laser pulses for transitions in a model for atomic Helium. From the numerically exact correlated wavefunction we extract the exact time evolution of natural orbitals and occupation numbers for (i) laser-driven Helium and (ii) electron-ion scattering. Part III of this work considers time-dependent quantum transport within TDDFT. We present an algorithm for the calculation of extended eigenstates of single-particle Hamiltonians which is especially tailored to a finite-difference discretization of the Schroedinger equation. We consider the propagation

Time-dependent quantum many-body systems. Linear response, electronic transport, and reduced density matrices

Energy Technology Data Exchange (ETDEWEB)

Appel, H.

2007-05-15

In part I of this work we present a double-pole approximation (DPA) to the response equations of time-dependent density functional theory (TDDFT). The double-pole approximation provides an exact description of systems with two strongly coupled excitations which are isolated from the rest of the spectrum. In contrast to the traditional single-pole approximation of TDDFT the DPA also yields corrections to the Kohn-Sham oscillator strengths. We also demonstrate how to invert the double-pole solution which allows us to predict matrix elements of the exchange-correlation kernel f{sub xc} from experimental input. We attempt some first steps towards a time-dependent generalization of reduced density matrix functional theory (RDMFT). In part II we derive equations of motion for natural orbitals and occupation numbers. Using the equation of motion for the occupation numbers we show that an adiabatic extension of presently known ground-state functionals of static RDMFT always leads to occupation numbers which are constant in time. From the stationary conditions of the equations of motion for the N-body correlations (correlated parts of the N-body matrices) we derive a new class of ground-state functionals which can be used in static RDMFT. Applications are presented for a one-dimensional model system where the time-dependent many-body Schroedinger equation can be propagated numerically. We use optimal control theory to find optimized laser pulses for transitions in a model for atomic Helium. From the numerically exact correlated wavefunction we extract the exact time evolution of natural orbitals and occupation numbers for (i) laser-driven Helium and (ii) electron-ion scattering. Part III of this work considers time-dependent quantum transport within TDDFT. We present an algorithm for the calculation of extended eigenstates of single-particle Hamiltonians which is especially tailored to a finite-difference discretization of the Schroedinger equation. We consider the

Simulation of NMR signals through the Bloch equations; Simulação de sinais de RMN através das equações de Bloch

Energy Technology Data Exchange (ETDEWEB)

Moraes, Tiago Bueno, E-mail: tiagobuemoraes@gmail.com [Universidade de Sao Paulo (USP), Sao Carlos, SP (Brazil). Inst. de Física; Colnago, Luiz Alberto, E-mail: tiagobuemoraes@gmail.com [Embrapa Instrumentação, São Carlos, SP (Brazil)

2014-07-01

The aim of this paper was to present a simple and fast way of simulating Nuclear Magnetic Resonance signals using the Bloch equations. These phenomenological equations describe the classical behavior of macroscopic magnetization and are easily simulated using rotation matrices. Many NMR pulse sequences can be simulated with this formalism, allowing a quantitative description of the influence of many experimental parameters. Finally, the paper presents simulations of conventional sequences such as Single Pulse, Inversion Recovery, Spin Echo and CPMG. (author)

Kinematic equations for resolved-rate control of an industrial robot arm

Science.gov (United States)

Barker, L. K.

1983-01-01

An operator can use kinematic, resolved-rate equations to dynamically control a robot arm by watching its response to commanded inputs. Known resolved-rate equations for the control of a particular six-degree-of-freedom industrial robot arm and proceeds to simplify the equations for faster computations are derived. Methods for controlling the robot arm in regions which normally cause mathematical singularities in the resolved-rate equations are discussed.

The Development of Novel Nanodiamond Based MALDI Matrices for the Analysis of Small Organic Pharmaceuticals

Science.gov (United States)

Chitanda, Jackson M.; Zhang, Haixia; Pahl, Erica; Purves, Randy W.; El-Aneed, Anas

2016-10-01

The utility of novel functionalized nanodiamonds (NDs) as matrices for matrix-assisted laser desorption ionization-mass spectrometry (MALDI-MS) is described herein. MALDI-MS analysis of small organic compounds (<1000 Da) is typically complex because of interferences from numerous cluster ions formed when using conventional matrices. To expand the use of MALDI for the analysis of small molecules, novel matrices were designed by covalently linking conventional matrices (or a lysine moiety) to detonated NDs. Four new functionalized NDs were evaluated for their ionization capabilities using five pharmaceuticals with varying molecular structures. Two ND matrices were able to ionize all tested pharmaceuticals in the negative ion mode, producing the deprotonated ions [M - H]-. Ion intensity for target analytes was generally strong with enhanced signal-to-noise ratios compared with conventional matrices. The negative ion mode is of great importance for biological samples as interference from endogenous compounds is inherently minimized in the negative ion mode. Since the molecular structures of the tested pharmaceuticals did not suggest that negative ion mode would be preferable, this result magnifies the importance of these findings. On the other hand, conventional matrices primarily facilitated the ionization as expected in the positive ion mode, producing either the protonated molecules [M + H]+ or cationic adducts (typically producing complex spectra with numerous adduct peaks). The data presented in this study suggests that these matrices may offer advantages for the analysis of low molecular weight pharmaceuticals/metabolites.

Stabilization of chromium-bearing electroplating sludge with MSWI fly ash-based Friedel matrices.

Science.gov (United States)

Qian, Guangren; Yang, Xiaoyan; Dong, Shixiang; Zhou, Jizhi; Sun, Ying; Xu, Yunfeng; Liu, Qiang

2009-06-15

This work investigated the feasibility and effectiveness of MSWI fly ash-based Friedel matrices on stabilizing/solidifying industrial chromium-bearing electroplating sludge using MSWI fly ash as the main raw material with a small addition of active aluminum. The compressive strength, leaching behavior and chemical speciation of heavy metals and hydration phases of matrices were characterized by TCLP, XRD, FTIR and other experimental methods. The results revealed that MSWI fly ash-based Friedel matrices could effectively stabilize chromium-bearing electroplating sludge, the formed ettringite and Friedel phases played a significant role in the fixation of heavy metals in electroplating sludge. The co-disposal of chromium-bearing electroplating sludge and MSWI fly ash-based Friedel matrices with a small addition of active aluminum is promising to be an effective way of stabilizing chromium-bearing electroplating sludge.

Steady, Oscillatory and Unsteady, Subsonic and Supersonic Aerodynamics (SOUSSA) for complex aircraft configurations

Science.gov (United States)

Morino, L.; Tseng, K.

1978-01-01

The Green's function method and the computer program SOUSSA (Steady Oscillatory and Unsteady Subsonic and Supersonic Aerodynamics) are reviewed. The Green's function method is applied to the fully unsteady potential equation yielding an integro-differential-delay equation. This equation is approximated by a set of differential-delay equations in time using the finite element method. The Laplace transform is used to yield a matrix relating the velocity potential to the normal wash. The matrix of the generalized aerodynamic forces is obtained by premultiplying and postmultiplying the matrices relating generalized forces to the potential and the normal wash by the generalized coordinates. The program SOUSSA is compared with existing numerical results. Results indicate that the program is not only general, flexible, and easy to use, but also accurate and fast.

Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics, production version (SOUSSA-P 1.1). Volume 1: Theoretical manual. [Green function

Science.gov (United States)

Morino, L.

1980-01-01

Recent developments of the Green's function method and the computer program SOUSSA (Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics) are reviewed and summarized. Applying the Green's function method to the fully unsteady (transient) potential equation yields an integro-differential-delay equation. With spatial discretization by the finite-element method, this equation is approximated by a set of differential-delay equations in time. Time solution by Laplace transform yields a matrix relating the velocity potential to the normal wash. Premultiplying and postmultiplying by the matrices relating generalized forces to the potential and the normal wash to the generalized coordinates one obtains the matrix of the generalized aerodynamic forces. The frequency and mode-shape dependence of this matrix makes the program SOUSSA useful for multiple frequency and repeated mode-shape evaluations.

СREATION OF CORRELATION FUNCTIONS OF LINEAR CONTINUOUS SYSTEMS BASED ON THEIR FUNDAMENTAL MATRICES

Directory of Open Access Journals (Sweden)

N. A. Vunder

2015-11-01

Full Text Available The paper presents a method of creating correlation matrices and functions of the state vectors and outputs of the linear continuous systems functioning under the conditions of stochastic stationary, in a broad sense, effects. Fundamental matrices form the basis of the method. We have shown that for the linear continuous systems with single dimensional input and single dimensional output the correlation output function of such system can be found as the free movement of this system generated by its initial state. This state is constructed from the variance matrix of the state vector and the transposed output matrix. We have elucidated that when a continuous system belongs to a class of multi-dimensional input – multi-dimensional output systems, the following options are available for solving the problem of creation of the correlation function of a linear system. The first option is to partition the system into separate channels. Then the approach developed for systems with onedimensional input and one-dimensional output is applied to each of the separate channels. The second option is used to preserve the vector nature of the stochastic external influence. It consists in partition of output vector to scalar components by separating output matrix into separate rows with subsequent formation of the correlation function according to the scheme for single dimensional input and single dimensional output type systems. The third option is based on the scalarization of matrix correlation output function by applying the singular value decomposition to it. That gives the possibility to form scalar majorant and minorant of correlation output functions. We have established that a key component of a computational procedure of creating the correlation function of continuous linear system is a variance matrix of the system state vector. In the case of functioning under an exogenous stochastic effect like "white noise" the variance matrix is calculated by

Parallelized implicit propagators for the finite-difference Schrödinger equation

Science.gov (United States)

Parker, Jonathan; Taylor, K. T.

1995-08-01

We describe the application of block Gauss-Seidel and block Jacobi iterative methods to the design of implicit propagators for finite-difference models of the time-dependent Schrödinger equation. The block-wise iterative methods discussed here are mixed direct-iterative methods for solving simultaneous equations, in the sense that direct methods (e.g. LU decomposition) are used to invert certain block sub-matrices, and iterative methods are used to complete the solution. We describe parallel variants of the basic algorithm that are well suited to the medium- to coarse-grained parallelism of work-station clusters, and MIMD supercomputers, and we show that under a wide range of conditions, fine-grained parallelism of the computation can be achieved. Numerical tests are conducted on a typical one-electron atom Hamiltonian. The methods converge robustly to machine precision (15 significant figures), in some cases in as few as 6 or 7 iterations. The rate of convergence is nearly independent of the finite-difference grid-point separations.

Exact exchange-correlation potential and approximate exchange potential in terms of density matrices

International Nuclear Information System (INIS)

Holas, A.; March, N.H.

1995-01-01

An exact expression in terms of density matrices (DM) is derived for δF[n]/δn(r), the functional derivative of the Hohenberg-Kohn functional. The derivation starts from the differential form of the virial theorem, obtained here for an electron system with arbitrary interactions, and leads to an expression taking the form of an integral over a path that can be chosen arbitrarily. After applying this approach to the equivalent system of noninteracting electrons (Slater-Kohn-Sham scheme) and combining the corresponding result with the previous one, an exact expression for the exchange-correlation potential v xc (r) is obtained which is analogous in character to that for δF[n]/δn(r), but involving, besides the interacting-system DMs, also the noninteracitng DMs. Equating the former DMs to the latter ones, we reduce the result for the exact v xc (r) to that for an approximate exchange-only potential v x (r). This leads naturally to the Harbola-Sahni exchange-only potential

Novel absorptivity centering method utilizing normalized and factorized spectra for analysis of mixtures with overlapping spectra in different matrices using built-in spectrophotometer software.

Science.gov (United States)

Lotfy, Hayam Mahmoud; Omran, Yasmin Rostom

2018-07-05

A novel, simple, rapid, accurate, and economical spectrophotometric method, namely absorptivity centering (a-Centering) has been developed and validated for the simultaneous determination of mixtures with partially and completely overlapping spectra in different matrices using either normalized or factorized spectrum using built-in spectrophotometer software without a need of special purchased program. Mixture I (Mix I) composed of Simvastatin (SM) and Ezetimibe (EZ) is the one with partial overlapping spectra formulated as tablets, while mixture II (Mix II) formed by Chloramphenicol (CPL) and Prednisolone acetate (PA) is that with complete overlapping spectra formulated as eye drops. These procedures do not require any separation steps. Resolution of spectrally overlapping binary mixtures has been achieved getting recovered zero-order (D 0 ) spectrum of each drug, then absorbance was recorded at their maxima 238, 233.5, 273 and 242.5 nm for SM, EZ, CPL and PA, respectively. Calibration graphs were established with good correlation coefficients. The method shows significant advantages as simplicity, minimal data manipulation besides maximum reproducibility and robustness. Moreover, it was validated according to ICH guidelines. Selectivity was tested using laboratory-prepared mixtures. Accuracy, precision and repeatability were found to be within the acceptable limits. The proposed method is good enough to be applied to an assay of drugs in their combined formulations without any interference from excipients. The obtained results were statistically compared with those of the reported and official methods by applying t-test and F-test at 95% confidence level concluding that there is no significant difference with regard to accuracy and precision. Generally, this method could be used successfully for the routine quality control testing. Copyright © 2018 Elsevier B.V. All rights reserved.

Properties of Zero-Free Transfer Function Matrices

Science.gov (United States)

D. O. Anderson, Brian; Deistler, Manfred

Transfer functions of linear, time-invariant finite-dimensional systems with more outputs than inputs, as arise in factor analysis (for example in econometrics), have, for state-variable descriptions with generic entries in the relevant matrices, no finite zeros. This paper gives a number of characterizations of such systems (and indeed square discrete-time systems with no zeros), using state-variable, impulse response, and matrix-fraction descriptions. Key properties include the ability to recover the input values at any time from a bounded interval of output values, without any knowledge of an initial state, and an ability to verify the no-zero property in terms of a property of the impulse response coefficient matrices. Results are particularized to cases where the transfer function matrix in question may or may not have a zero at infinity or a zero at zero.

State equation approximation of transfer matrices and its application to the phase domain calculation of electromagnetic transients

International Nuclear Information System (INIS)

Soysal, A.O.; Semlyen, A.

1994-01-01

A general methodology is presented for the state equation approximation of a multiple input-output linear system from transfer matrix data. A complex transformation matrix, obtained by eigen analysis at a fixed frequency, is used for diagonalization of the transfer matrix over the whole frequency range. A scalar estimation procedure is applied for identification of the modal transfer functions. The state equations in the original coordinates are obtained by inverse transformation. An iterative Gauss-Newton refinement process is used to reduce the overall error of the approximation. The developed methodology is applied to the phase domain modeling of untransposed transmission lines. The approach makes it possible to perform EMTP calculations directly in the phase domain. This results in conceptual simplification and savings in computation time since modal transformations are not needed in the sequences of the transient analysis. The presented procedure is compared with the conventional modal approach in terms of accuracy and computation time

On the use of the GRACE normal equation of inter-satellite tracking data for estimation of soil moisture and groundwater in Australia

Directory of Open Access Journals (Sweden)

N. Tangdamrongsub

2018-03-01

Full Text Available An accurate estimation of soil moisture and groundwater is essential for monitoring the availability of water supply in domestic and agricultural sectors. In order to improve the water storage estimates, previous studies assimilated terrestrial water storage variation (ΔTWS derived from the Gravity Recovery and Climate Experiment (GRACE into land surface models (LSMs. However, the GRACE-derived ΔTWS was generally computed from the high-level products (e.g. time-variable gravity fields, i.e. level 2, and land grid from the level 3 product. The gridded data products are subjected to several drawbacks such as signal attenuation and/or distortion caused by a posteriori filters and a lack of error covariance information. The post-processing of GRACE data might lead to the undesired alteration of the signal and its statistical property. This study uses the GRACE least-squares normal equation data to exploit the GRACE information rigorously and negate these limitations. Our approach combines GRACE's least-squares normal equation (obtained from ITSG-Grace2016 product with the results from the Community Atmosphere Biosphere Land Exchange (CABLE model to improve soil moisture and groundwater estimates. This study demonstrates, for the first time, an importance of using the GRACE raw data. The GRACE-combined (GC approach is developed for optimal least-squares combination and the approach is applied to estimate the soil moisture and groundwater over 10 Australian river basins. The results are validated against the satellite soil moisture observation and the in situ groundwater data. Comparing to CABLE, we demonstrate the GC approach delivers evident improvement of water storage estimates, consistently from all basins, yielding better agreement on seasonal and inter-annual timescales. Significant improvement is found in groundwater storage while marginal improvement is observed in surface soil moisture estimates.

On the use of the GRACE normal equation of inter-satellite tracking data for estimation of soil moisture and groundwater in Australia

Science.gov (United States)

Tangdamrongsub, Natthachet; Han, Shin-Chan; Decker, Mark; Yeo, In-Young; Kim, Hyungjun

2018-03-01

An accurate estimation of soil moisture and groundwater is essential for monitoring the availability of water supply in domestic and agricultural sectors. In order to improve the water storage estimates, previous studies assimilated terrestrial water storage variation (ΔTWS) derived from the Gravity Recovery and Climate Experiment (GRACE) into land surface models (LSMs). However, the GRACE-derived ΔTWS was generally computed from the high-level products (e.g. time-variable gravity fields, i.e. level 2, and land grid from the level 3 product). The gridded data products are subjected to several drawbacks such as signal attenuation and/or distortion caused by a posteriori filters and a lack of error covariance information. The post-processing of GRACE data might lead to the undesired alteration of the signal and its statistical property. This study uses the GRACE least-squares normal equation data to exploit the GRACE information rigorously and negate these limitations. Our approach combines GRACE's least-squares normal equation (obtained from ITSG-Grace2016 product) with the results from the Community Atmosphere Biosphere Land Exchange (CABLE) model to improve soil moisture and groundwater estimates. This study demonstrates, for the first time, an importance of using the GRACE raw data. The GRACE-combined (GC) approach is developed for optimal least-squares combination and the approach is applied to estimate the soil moisture and groundwater over 10 Australian river basins. The results are validated against the satellite soil moisture observation and the in situ groundwater data. Comparing to CABLE, we demonstrate the GC approach delivers evident improvement of water storage estimates, consistently from all basins, yielding better agreement on seasonal and inter-annual timescales. Significant improvement is found in groundwater storage while marginal improvement is observed in surface soil moisture estimates.

Sports drug testing using complementary matrices: Advantages and limitations.

Science.gov (United States)

Thevis, Mario; Geyer, Hans; Tretzel, Laura; Schänzer, Wilhelm

2016-10-25

Today, routine doping controls largely rely on testing whole blood, serum, and urine samples. These matrices allow comprehensively covering inorganic as well as low and high molecular mass organic analytes relevant to doping controls and are collecting and transferring from sampling sites to accredited anti-doping laboratories under standardized conditions. Various aspects including time and cost-effectiveness as well as intrusiveness and invasiveness of the sampling procedure but also analyte stability and breadth of the contained information have been motivation to consider and assess values potentially provided and added to modern sports drug testing programs by alternative matrices. Such alternatives could be dried blood spots (DBS), dried plasma spots (DPS), oral fluid (OF), exhaled breath (EB), and hair. In this review, recent developments and test methods concerning these alternative matrices and expected or proven contributions as well as limitations of these specimens in the context of the international anti-doping fight are presented and discussed, guided by current regulations for prohibited substances and methods of doping as established by the World Anti-Doping Agency (WADA). Focusing on literature published between 2011 and 2015, examples for doping control analytical assays concerning non-approved substances, anabolic agents, peptide hormones/growth factors/related substances and mimetics, β 2 -agonists, hormone and metabolic modulators, diuretics and masking agents, stimulants, narcotics, cannabinoids, glucocorticoids, and beta-blockers were selected to outline the advantages and limitations of the aforementioned alternative matrices as compared to conventional doping control samples (i.e. urine and blood/serum). Copyright © 2016 Elsevier B.V. All rights reserved.

Poisson-Nernst-Planck Equations for Simulating Biomolecular Diffusion-Reaction Processes I: Finite Element Solutions.

Science.gov (United States)

Lu, Benzhuo; Holst, Michael J; McCammon, J Andrew; Zhou, Y C

2010-09-20

In this paper we developed accurate finite element methods for solving 3-D Poisson-Nernst-Planck (PNP) equations with singular permanent charges for electrodiffusion in solvated biomolecular systems. The electrostatic Poisson equation was defined in the biomolecules and in the solvent, while the Nernst-Planck equation was defined only in the solvent. We applied a stable regularization scheme to remove the singular component of the electrostatic potential induced by the permanent charges inside biomolecules, and formulated regular, well-posed PNP equations. An inexact-Newton method was used to solve the coupled nonlinear elliptic equations for the steady problems; while an Adams-Bashforth-Crank-Nicolson method was devised for time integration for the unsteady electrodiffusion. We numerically investigated the conditioning of the stiffness matrices for the finite element approximations of the two formulations of the Nernst-Planck equation, and theoretically proved that the transformed formulation is always associated with an ill-conditioned stiffness matrix. We also studied the electroneutrality of the solution and its relation with the boundary conditions on the molecular surface, and concluded that a large net charge concentration is always present near the molecular surface due to the presence of multiple species of charged particles in the solution. The numerical methods are shown to be accurate and stable by various test problems, and are applicable to real large-scale biophysical electrodiffusion problems.

The underexposed role of food matrices in probiotic products: reviewing the relationship between carrier matrices and product parameters

NARCIS (Netherlands)

Flach, J.; van der Waal, M.B.; van den Nieuwboer, M.; Claassen, H.J.H.M.; Larsen, O.F.A.

2017-01-01

 Full Article  Figures & data References  Supplemental  Citations Metrics  Reprints & Permissions  PDF ABSTRACT Probiotic microorganisms are increasingly incorporated into food matrices in order to confer proposed health benefits on the consumer. It is important that the health benefits,

Normal zone detectors for a large number of inductively coupled coils. Revision 1

International Nuclear Information System (INIS)

Owen, E.W.; Shimer, D.W.

1983-01-01

In order to protect a set of inductively coupled superconducting magnets, it is necessary to locate and measure normal zone voltages that are small compared with the mutual and self-induced voltages. The method described in this paper uses two sets of voltage measurements to locate and measure one or more normal zones in any number of coupled coils. One set of voltages is the outputs of bridges that balance out the self-induced voltages. The other set of voltages can be the voltages across the coils, although alternatives are possible. The two sets of equations form a single combined set of equations. Each normal zone location or combination of normal zones has a set of these combined equations associated with it. It is demonstrated that the normal zone can be located and the correct set chosen, allowing determination of the size of the normal zone. Only a few operations take place in a working detector: multiplication of a constant, addition, and simple decision-making. In many cases the detector for each coil, although weakly linked to the other detectors, can be considered to be independent. The effect on accuracy of changes in the system parameters is discussed

ZZ RRDF-98, Cross-sections and covariance matrices for 22 neutron induced dosimetry reactions

International Nuclear Information System (INIS)

Zolotarev, K.I.; Ignatyuk, A.V.; Mahokhin, V.N.; Pashchenko, A.B.

2005-01-01

1 - Description of program or function: Format: ENDF-6 format; Number of groups: Continuous energy; Dosimetry reactions: 6-C-12(n,2n), 8-O-16(n,2n), 9-F-19(n,2n), 12-Mg-24(n,p), 22-Ti-46(n,2n), 22-Ti-46(n,p), 22-Ti-47(n,x), 22-Ti-48(n,p), 22-Ti-48(n,x), 22-Ti-49(n,x), 23-V-51(n,alpha), 26-Fe-54(n,2n), 26-Fe-54(n,alpha), 26-Fe-56(n,p), 27-Co-59(n,alpha), 29-Cu-63(n,alpha), 33-As-75(n,2n), 41-Nb-93(n,2n), 41-Nb-93(n,n'), 45-Rh-103(n,n'), 49-In-115(n,n'), 59-Pr-141(n,2n); Origin: Russian Federation; Weighting spectrum: None. RRDF-98 contains original evaluations of cross section data performed at the Institute of Physics and Power Engineering, Obninsk, for 22 neutron induced dosimetry reactions. The dataset also contains the corresponding covariance matrices. 2 - Methods: The evaluation of excitation functions was performed on the basis of statistical analysis of corrected experimental data in the framework of generalized least squares method and taking into account the results of optical-statistical STAPRE and GNASH calculations. The experimental cross section data including the most recent results were critically reviewed and processed in this study. If necessary, the data were normalized in order to make adjustments in relevant cross sections and decay schemes. The covariance matrices were prepared and the evaluated cross section data are presented in ENDF-6 format (Files 3, 33). For estimation of correlations between experimental data the total uncertainties of measured cross sections have been separated into statistical and systematic parts and correlation coefficients between components of systematic parts were assigned according to information given in the original publications and EXFOR library. Then the correlation matrix of cross sections measured within one experiment was calculated and approximated by matrix with a constant (average) correlation coefficient. The overall correlation matrix was composed of such sub-matrices in the assumption that the cross

Solution of quadratic matrix equations for free vibration analysis of structures.

Science.gov (United States)

Gupta, K. K.

1973-01-01

An efficient digital computer procedure and the related numerical algorithm are presented herein for the solution of quadratic matrix equations associated with free vibration analysis of structures. Such a procedure enables accurate and economical analysis of natural frequencies and associated modes of discretized structures. The numerically stable algorithm is based on the Sturm sequence method, which fully exploits the banded form of associated stiffness and mass matrices. The related computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be substantially more accurate and economical than other existing procedures of such analysis. Numerical examples are presented for two structures - a cantilever beam and a semicircular arch.

Matter rogue waves for the three-component Gross-Pitaevskii equations in the spinor Bose-Einstein condensates.

Science.gov (United States)

Sun, Wen-Rong; Wang, Lei

2018-01-01

To show the existence and properties of matter rogue waves in an F =1 spinor Bose-Einstein condensate (BEC), we work on the three-component Gross-Pitaevskii (GP) equations. Via the Darboux-dressing transformation, we obtain a family of rational solutions describing the extreme events, i.e. rogue waves. This family of solutions includes bright-dark-bright and bright-bright-bright rogue waves. The algebraic construction depends on Lax matrices and their Jordan form. The conditions for the existence of rogue wave solutions in an F =1 spinor BEC are discussed. For the three-component GP equations, if there is modulation instability, it is of baseband type only, confirming our analytic conditions. The energy transfers between the waves are discussed.

Inversion of General Cyclic Heptadiagonal Matrices

Directory of Open Access Journals (Sweden)

A. A. Karawia

2013-01-01

Full Text Available We describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The computational cost of it is operations. The algorithm is implementable to the Computer Algebra System (CAS such as MAPLE, MATLAB, and MATHEMATICA. Two examples are presented for the sake of illustration.

Cylindrical shell under impact load including transverse shear and normal stress

International Nuclear Information System (INIS)

Shakeri, M.; Eslami, M.R.; Ghassaa, M.; Ohadi, A.R.

1993-01-01

The general governing equations of shell of revolution under shock loads are reduced to equations describing the elastic behavior of cylindrical shell under axisymmetric impact load. The effect of lateral normal stress, transverse shear, and rotary inertia are included, and the equations are solved by Galerkin finite element method. The results are compared with the previous works of authors. (author)

Critical statistics for non-Hermitian matrices

International Nuclear Information System (INIS)

Garcia-Garcia, A.M.; Verbaarschot, J.J.M.; Nishigaki, S.M.

2002-01-01

We introduce a generalized ensemble of non-Hermitian matrices interpolating between the Gaussian Unitary Ensemble, the Ginibre ensemble, and the Poisson ensemble. The joint eigenvalue distribution of this model is obtained by means of an extension of the Itzykson-Zuber formula to general complex matrices. Its correlation functions are studied both in the case of weak non-Hermiticity and in the case of strong non-Hermiticity. In the weak non-Hermiticity limit we show that the spectral correlations in the bulk of the spectrum display critical statistics: the asymptotic linear behavior of the number variance is already approached for energy differences of the order of the eigenvalue spacing. To lowest order, its slope does not depend on the degree of non-Hermiticity. Close the edge, the spectral correlations are similar to the Hermitian case. In the strong non-Hermiticity limit the crossover behavior from the Ginibre ensemble to the Poisson ensemble first appears close to the surface of the spectrum. Our model may be relevant for the description of the spectral correlations of an open disordered system close to an Anderson transition

Prediction Equations for Spirometry for Children from Northern India.

Science.gov (United States)

Chhabra, Sunil K; Kumar, Rajeev; Mittal, Vikas

2016-09-08

To develop prediction equations for spirometry for children from northern India using current international guidelines for standardization. Re-analysis of cross-sectional data from a single school. 670 normal children (age 6-17 y; 365 boys) of northern Indian parentage. After screening for normal health, we carried out spirometry with recommended quality assurance according to current guidelines. We developed linear and nonlinear prediction equations using multiple regression analysis. We selected the final models on the basis of the highest coefficient of multiple determination (R2) and statistical validity. Spirometry parameters: FVC, FEV1, PEFR, FEF50, FEF75 and FEF25-75. The equations for the main parameters were as follows: Boys, Ln FVC = -1.687+0.016*height +0.022*age; Ln FEV1 = -1.748+0.015*height+0.031*age. Girls, Ln FVC = -9.989 +(2.018*Ln(height)) + (0.324*Ln(age)); Ln FEV1 = -10.055 +(1.990*Ln(height))+(0.358*Ln(age)). Nonlinear regression yielded substantially greater R2 values compared to linear models except for FEF50 for girls. Height and age were found to be the significant explanatory variables for all parameters on multiple regression with weight making no significant contribution. We developed prediction equations for spirometry for children from northern India. Nonlinear equations were superior to linear equations.

Quantification of iodine in porous hydroxyapatite matrices for application as radioactive sources in brachytherapy

OpenAIRE

Lacerda, Kássio André; Lameiras, Fernando Soares; Silva, Viviane Viana

2007-01-01

In this study, non-radioactive iodine was incorporated in two types of biodegradable hydroxyapatite-based porous matrices (HA and HACL) through impregnation process from sodium iodine aqueous solutions with varying concentrations (0.5 and 1.0 mol/L) . The results revealed that both systems presented a high capacity of incorporating iodine into their matrices. The quantity of incorporated iodine was measured through Neutron Activation Analysis (NAA). The porous ceramic matrices based on hydrox...

A method based on the Jacobi tau approximation for solving multi-term time-space fractional partial differential equations

Science.gov (United States)

Bhrawy, A. H.; Zaky, M. A.

2015-01-01

In this paper, we propose and analyze an efficient operational formulation of spectral tau method for multi-term time-space fractional differential equation with Dirichlet boundary conditions. The shifted Jacobi operational matrices of Riemann-Liouville fractional integral, left-sided and right-sided Caputo fractional derivatives are presented. By using these operational matrices, we propose a shifted Jacobi tau method for both temporal and spatial discretizations, which allows us to present an efficient spectral method for solving such problem. Furthermore, the error is estimated and the proposed method has reasonable convergence rates in spatial and temporal discretizations. In addition, some known spectral tau approximations can be derived as special cases from our algorithm if we suitably choose the corresponding special cases of Jacobi parameters θ and ϑ. Finally, in order to demonstrate its accuracy, we compare our method with those reported in the literature.

Classification of mass matrices and the calculability of the Cabibbo angle

International Nuclear Information System (INIS)

Rizzo, T.G.

1981-01-01

We have analyzed all possible 2 x 2 mass matrices with two nonzero elements in an attempt to find which matrices yield a reasonable value of the Cabibbo angle upon diagonalization. We do not concern ourselves with the origin of these mass matrices (spontaneous symmetry breaking, bare-mass term, etc.). We find that, in the limit m/sub u//m/sub c/→0, only four possible relationships exist between sin 2 theta/sub C/ and the quark mass ratio m/sub d//m/sub s/, only one of which is reasonable for the usual value of m/sub d//m/sub s/ (approx.1/20). This limits the possible forms of the quark mass matrix to be two in number, both of which have been discussed previously in the literature

Physical properties of the Schur complement of local covariance matrices