WorldWideScience

Sample records for normal equation matrices

  1. Random matrices and random difference equations

    International Nuclear Information System (INIS)

    Uppuluri, V.R.R.

    1975-01-01

    Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models

  2. Computing with linear equations and matrices

    International Nuclear Information System (INIS)

    Churchhouse, R.F.

    1983-01-01

    Systems of linear equations and matrices arise in many disciplines. The equations may accurately represent conditions satisfied by a system or, more likely, provide an approximation to a more complex system of non-linear or differential equations. The system may involve a few or many thousand unknowns and each individual equation may involve few or many of them. Over the past 50 years a vast literature on methods for solving systems of linear equations and the associated problems of finding the inverse or eigenvalues of a matrix has been produced. These lectures cover those methods which have been found to be most useful for dealing with such types of problem. References are given where appropriate and attention is drawn to the possibility of improved methods for use on vector and parallel processors. (orig.)

  3. Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices

    Science.gov (United States)

    Glaister, P.

    2008-01-01

    The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.

  4. The algebraic structure of lax equations for infinite matrices

    NARCIS (Netherlands)

    Helminck, G.F.

    2002-01-01

    In this paper we discuss the algebraic structure of the tower of differential difference equations that one can associate with any commutative subalgebra of $M_k(\\mathbb{C})$. These equations can be formulated conveniently in so-called Lax equations for infinite upper- resp. lowertriangular matrices

  5. Chain of matrices, loop equations and topological recursion

    CERN Document Server

    Orantin, Nicolas

    2009-01-01

    Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.

  6. Hierarchical Matrices Method and Its Application in Electromagnetic Integral Equations

    Directory of Open Access Journals (Sweden)

    Han Guo

    2012-01-01

    Full Text Available Hierarchical (H- matrices method is a general mathematical framework providing a highly compact representation and efficient numerical arithmetic. When applied in integral-equation- (IE- based computational electromagnetics, H-matrices can be regarded as a fast algorithm; therefore, both the CPU time and memory requirement are reduced significantly. Its kernel independent feature also makes it suitable for any kind of integral equation. To solve H-matrices system, Krylov iteration methods can be employed with appropriate preconditioners, and direct solvers based on the hierarchical structure of H-matrices are also available along with high efficiency and accuracy, which is a unique advantage compared to other fast algorithms. In this paper, a novel sparse approximate inverse (SAI preconditioner in multilevel fashion is proposed to accelerate the convergence rate of Krylov iterations for solving H-matrices system in electromagnetic applications, and a group of parallel fast direct solvers are developed for dealing with multiple right-hand-side cases. Finally, numerical experiments are given to demonstrate the advantages of the proposed multilevel preconditioner compared to conventional “single level” preconditioners and the practicability of the fast direct solvers for arbitrary complex structures.

  7. Quantized normal matrices: some exact results and collective field formulation

    International Nuclear Information System (INIS)

    Feinberg, Joshua

    2005-01-01

    We formulate and study a class of U(N)-invariant quantum mechanical models of large normal matrices with arbitrary rotation-invariant matrix potentials. We concentrate on the U(N) singlet sector of these models. In the particular case of quadratic matrix potential, the singlet sector can be mapped by a similarity transformation onto the two-dimensional Calogero-Marchioro-Sutherland model at specific couplings. For this quadratic case we were able to solve the N-body Schrodinger equation and obtain infinite sets of singlet eigenstates of the matrix model with given total angular momentum. Our main object in this paper is to study the singlet sector in the collective field formalism, in the large-N limit. We obtain in this framework the ground state eigenvalue distribution and ground state energy for an arbitrary potential, and outline briefly the way to compute bona-fide quantum phase transitions in this class of models. As explicit examples, we analyze the models with quadratic and quartic potentials. In the quartic case, we also touch upon the disk-annulus quantum phase transition. In order to make our presentation self-contained, we also discuss, in a manner which is somewhat complementary to standard expositions, the theory of point canonical transformations in quantum mechanics for systems whose configuration space is endowed with non-Euclidean metric, which is the basis for constructing the collective field theory

  8. Hamiltonian structure of isospectral deformation equation and semi-classical approximation to factorized S-matrices

    International Nuclear Information System (INIS)

    Chudnovsky, D.V.; Chudnovsky, G.V.

    1980-01-01

    We consider semi-classical approximation to factorized S-matrices. We show that this new class of matrices, called s-matrices, defines Hamiltonian structures for isospectral deformation equations. Concrete examples of factorized s-matrices are constructed and they are used to define Hamiltonian structure for general two-dimensional isospectral deformation systems. (orig.)

  9. A Perron-Frobenius Theorem for Positive Quasipolynomial Matrices Associated with Homogeneous Difference Equations

    Directory of Open Access Journals (Sweden)

    Bui The Anh

    2007-01-01

    Full Text Available We extend the classical Perron-Frobenius theorem for positive quasipolynomial matrices associated with homogeneous difference equations. Finally, the result obtained is applied to derive necessary and sufficient conditions for the stability of positive system.

  10. A solver for General Unilateral Polynomial Matrix Equation with Second-Order Matrices Over Prime Finite Fields

    Science.gov (United States)

    Burtyka, Filipp

    2018-03-01

    The paper firstly considers the problem of finding solvents for arbitrary unilateral polynomial matrix equations with second-order matrices over prime finite fields from the practical point of view: we implement the solver for this problem. The solver’s algorithm has two step: the first is finding solvents, having Jordan Normal Form (JNF), the second is finding solvents among the rest matrices. The first step reduces to the finding roots of usual polynomials over finite fields, the second is essentially exhaustive search. The first step’s algorithms essentially use the polynomial matrices theory. We estimate the practical duration of computations using our software implementation (for example that one can’t construct unilateral matrix polynomial over finite field, having any predefined number of solvents) and answer some theoretically-valued questions.

  11. On equations for the total suction and its matric and osmotic components

    International Nuclear Information System (INIS)

    Dao, Vinh N.T.; Morris, Peter H.; Dux, Peter F.

    2008-01-01

    A clear fundamental understanding of suctions is crucial for the study of the behaviour of plastic cement mortar and concrete, including plastic shrinkage cracking. In this paper, the expression relating the change in free energy of the pore water with an isothermal change in pressure is first derived. Based upon definitions of suctions, it is then shown that total, matric, and osmotic suctions can all be expressed in the same thermodynamic form. The widely accepted, but not yet satisfactorily validated, assumption that the total suction comprises matric and osmotic components is then confirmed theoretically. The well-known Kelvin equation for matric suction, and Morse and van't Hoff equations for osmotic suction are subsequently derived from the corresponding thermodynamic equations. The applicability of latter two equations in evaluating the osmotic suctions of cement mortar and concrete is highlighted

  12. Associative Yang-Baxter equation for quantum (semi-)dynamical R-matrices

    International Nuclear Information System (INIS)

    Sechin, Ivan; Zotov, Andrei

    2016-01-01

    In this paper we propose versions of the associative Yang-Baxter equation and higher order R-matrix identities which can be applied to quantum dynamical R-matrices. As is known quantum non-dynamical R-matrices of Baxter-Belavin type satisfy this equation. Together with unitarity condition and skew-symmetry it provides the quantum Yang-Baxter equation and a set of identities useful for different applications in integrable systems. The dynamical R-matrices satisfy the Gervais-Neveu-Felder (or dynamical Yang-Baxter) equation. Relation between the dynamical and non-dynamical cases is described by the IRF (interaction-round-a-face)-Vertex transformation. An alternative approach to quantum (semi-)dynamical R-matrices and related quantum algebras was suggested by Arutyunov, Chekhov, and Frolov (ACF) in their study of the quantum Ruijsenaars-Schneider model. The purpose of this paper is twofold. First, we prove that the ACF elliptic R-matrix satisfies the associative Yang-Baxter equation with shifted spectral parameters. Second, we directly prove a simple relation of the IRF-Vertex type between the Baxter-Belavin and the ACF elliptic R-matrices predicted previously by Avan and Rollet. It provides the higher order R-matrix identities and an explanation of the obtained equations through those for non-dynamical R-matrices. As a by-product we also get an interpretation of the intertwining transformation as matrix extension of scalar theta function likewise R-matrix is interpreted as matrix extension of the Kronecker function. Relations to the Gervais-Neveu-Felder equation and identities for the Felder’s elliptic R-matrix are also discussed.

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

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

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

  16. A theory of solving TAP equations for Ising models with general invariant random matrices

    DEFF Research Database (Denmark)

    Opper, Manfred; Çakmak, Burak; Winther, Ole

    2016-01-01

    We consider the problem of solving TAP mean field equations by iteration for Ising models with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical functional approach that in the thermodynamic limit yields...... the iteration dependent on a Gaussian distributed field only. The TAP magnetizations are stable fixed points if a de Almeida–Thouless stability criterion is fulfilled. We illustrate our method explicitly for coupling matrices drawn from the random orthogonal ensemble....

  17. Ranked solutions of the matric equation A1X1=A2X2

    Directory of Open Access Journals (Sweden)

    A. Duane Porter

    1980-01-01

    Full Text Available Let GF(pz denote the finite field of pz elements. Let A1 be s×m of rank r1 and A2 be s×n of rank r2 with elements from GF(pz. In this paper, formulas are given for finding the number of X1,X2 over GF(pz which satisfy the matric equation A1X1=A2X2, where X1 is m×t of rank k1, and X2 is n×t of rank k2. These results are then used to find the number of solutions X1,…,Xn, Y1,…,Ym, m,n>1, of the matric equation A1X1…Xn=A2Y1…Ym.

  18. The Dirac–Frenkel Principle for Reduced Density Matrices, and the Bogoliubov–de Gennes Equations

    DEFF Research Database (Denmark)

    Benedikter, Niels; Sok, Jérémy; Solovej, Jan Philip

    2018-01-01

    The derivation of effective evolution equations is central to the study of non-stationary quantum many-body systems, and widely used in contexts such as superconductivity, nuclear physics, Bose–Einstein condensation and quantum chemistry. We reformulate the Dirac–Frenkel approximation principle...... in terms of reduced density matrices and apply it to fermionic and bosonic many-body systems. We obtain the Bogoliubov–de Gennes and Hartree–Fock–Bogoliubov equations, respectively. While we do not prove quantitative error estimates, our formulation does show that the approximation is optimal within...... the class of quasifree states. Furthermore, we prove well-posedness of the Bogoliubov–de Gennes equations in energy space and discuss conserved quantities....

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

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

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

  2. Solution of fractional-order differential equations based on the operational matrices of new fractional Bernstein functions

    Directory of Open Access Journals (Sweden)

    M.H.T. Alshbool

    2017-01-01

    Full Text Available An algorithm for approximating solutions to fractional differential equations (FDEs in a modified new Bernstein polynomial basis is introduced. Writing x→xα(0<α<1 in the operational matrices of Bernstein polynomials, the fractional Bernstein polynomials are obtained and then transformed into matrix form. Furthermore, using Caputo fractional derivative, the matrix form of the fractional derivative is constructed for the fractional Bernstein matrices. We convert each term of the problem to the matrix form by means of fractional Bernstein matrices. A basic matrix equation which corresponds to a system of fractional equations is utilized, and a new system of nonlinear algebraic equations is obtained. The method is given with some priori error estimate. By using the residual correction procedure, the absolute error can be estimated. Illustrative examples are included to demonstrate the validity and applicability of the presented technique.

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

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

  5. Iterative Algorithm for Solving a Class of Quaternion Matrix Equation over the Generalized (P,Q-Reflexive Matrices

    Directory of Open Access Journals (Sweden)

    Ning Li

    2013-01-01

    Full Text Available The matrix equation ∑l=1uAlXBl+∑s=1vCsXTDs=F, which includes some frequently investigated matrix equations as its special cases, plays important roles in the system theory. In this paper, we propose an iterative algorithm for solving the quaternion matrix equation ∑l=1uAlXBl+∑s=1vCsXTDs=F over generalized (P,Q-reflexive matrices. The proposed iterative algorithm automatically determines the solvability of the quaternion matrix equation over generalized (P,Q-reflexive matrices. When the matrix equation is consistent over generalized (P,Q-reflexive matrices, the sequence {X(k} generated by the introduced algorithm converges to a generalized (P,Q-reflexive solution of the quaternion matrix equation. And the sequence {X(k} converges to the least Frobenius norm generalized (P,Q-reflexive solution of the quaternion matrix equation when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate generalized (P,Q-reflexive solution for a given generalized (P,Q-reflexive matrix X0 can be derived. The numerical results indicate that the iterative algorithm is quite efficient.

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

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

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

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

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

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

  12. Introduction into Hierarchical Matrices

    KAUST Repository

    Litvinenko, Alexander

    2013-12-05

    Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.

  13. Introduction into Hierarchical Matrices

    KAUST Repository

    Litvinenko, Alexander

    2013-01-01

    Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.

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

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

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

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

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

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

  20. An Extrapolation of a Radical Equation More Accurately Predicts Shelf Life of Frozen Biological Matrices.

    Science.gov (United States)

    De Vore, Karl W; Fatahi, Nadia M; Sass, John E

    2016-08-01

    Arrhenius modeling of analyte recovery at increased temperatures to predict long-term colder storage stability of biological raw materials, reagents, calibrators, and controls is standard practice in the diagnostics industry. Predicting subzero temperature stability using the same practice is frequently criticized but nevertheless heavily relied upon. We compared the ability to predict analyte recovery during frozen storage using 3 separate strategies: traditional accelerated studies with Arrhenius modeling, and extrapolation of recovery at 20% of shelf life using either ordinary least squares or a radical equation y = B1x(0.5) + B0. Computer simulations were performed to establish equivalence of statistical power to discern the expected changes during frozen storage or accelerated stress. This was followed by actual predictive and follow-up confirmatory testing of 12 chemistry and immunoassay analytes. Linear extrapolations tended to be the most conservative in the predicted percent recovery, reducing customer and patient risk. However, the majority of analytes followed a rate of change that slowed over time, which was fit best to a radical equation of the form y = B1x(0.5) + B0. Other evidence strongly suggested that the slowing of the rate was not due to higher-order kinetics, but to changes in the matrix during storage. Predicting shelf life of frozen products through extrapolation of early initial real-time storage analyte recovery should be considered the most accurate method. Although in this study the time required for a prediction was longer than a typical accelerated testing protocol, there are less potential sources of error, reduced costs, and a lower expenditure of resources. © 2016 American Association for Clinical Chemistry.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  19. Application of the τ-function theory of Painleve equations to random matrices: PIV, PII and the GUE

    International Nuclear Information System (INIS)

    Forrester, P.J.; Witte, N.S.

    2000-01-01

    Tracy and Widom have evaluated the cumulative distribution of the largest eigenvalue for the finite and scaled infinite Gaussian unitary ensemble (GUE) in terms of a Painleve IV and Painleve II transcendent respectively. We generalise these results to the evaluation of E N (λ;a) :(Π n l=1 χ (l) (-∞,λ) (λ - λ l ) a ), where χ (l) (-∞) = 1 for λ l E (- ∞,λ] and χ (l) (-∞,λ) = 0 otherwise, and the average is with respect to the joint eigenvalue distribution of the GUE, as well as to the evaluation of F N (λ;a) :(Π N l=1 (λ - λ l ) a ). Of particular interest are E N (λ;2) and F N (λ;2)X and their scaled limits, which give the distribution of the largest eigenvalue and the density respectively. Our results are obtained by applying the Okamoto τ-function theory of Painleve IV and Painleve II equations, for which we give a self contained presentation based on the recent work of Noumi and Yamada. We point out that the same approach can be used to study the quantities E N (λ; a) and F N (λ; a) for the other classical matrix ensembles

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

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

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

  3. A Brief Historical Introduction to Matrices and Their Applications

    Science.gov (United States)

    Debnath, L.

    2014-01-01

    This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  19. First-order systems of linear partial differential equations: normal forms, canonical systems, transform methods

    Directory of Open Access Journals (Sweden)

    Heinz Toparkus

    2014-04-01

    Full Text Available In this paper we consider first-order systems with constant coefficients for two real-valued functions of two real variables. This is both a problem in itself, as well as an alternative view of the classical linear partial differential equations of second order with constant coefficients. The classification of the systems is done using elementary methods of linear algebra. Each type presents its special canonical form in the associated characteristic coordinate system. Then you can formulate initial value problems in appropriate basic areas, and you can try to achieve a solution of these problems by means of transform methods.

  20. The least weighted squares I. The asymptotic linearity of normal equations

    Czech Academy of Sciences Publication Activity Database

    Víšek, Jan Ámos

    2002-01-01

    Roč. 9, č. 15 (2002), s. 31-58 ISSN 1212-074X R&D Projects: GA AV ČR KSK1019101 Grant - others:GA UK(CZ) 255/2002/A EK /FSV Institutional research plan: CEZ:AV0Z1075907 Keywords : the least weighted squares * robust regression * asymptotic normality and representation Subject RIV: BA - General Mathematics

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

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

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

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

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

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

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

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

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

  10. Nonequilibrium, steady-state electron transport with N-representable density matrices from the anti-Hermitian contracted Schrödinger equation

    Science.gov (United States)

    Rothman, Adam E.; Mazziotti, David A.

    2010-03-01

    We study molecular conductivity for a one-electron, bath-molecule-bath model Hamiltonian. The primary quantum-mechanical variable is the one-electron reduced density matrix (1-RDM). By identifying similarities between the steady-state Liouville equation and the anti-Hermitian contracted Schrödinger equation (ACSE) [D. A. Mazziotti, Phys. Rev. A 75, 022505 (2007)], we develop a way of enforcing nonequilibrium, steady-state behavior in a time-independent theory. Our results illustrate the relationship between current and voltage in molecular junctions assuming that the total number of electrons under consideration can be fixed across all driving potentials. The impetus for this work is a recent study by Subotnik et al. that also uses the 1-RDM to study molecular conductivity under different assumptions regarding the total number of electrons [J. E. Subotnik et al., J. Chem. Phys. 130, 144105 (2009)]. Unlike calculations in the previous study, our calculations result in 1-RDMs that are fully N-representable. The present work maintains N-representability through a bath-bath mixing that is related to a time-independent relaxation of the baths in the absence of the molecule, as governed by the ACSE. A lack of N-representability can be important since it corresponds to occupying energy states in the molecule or baths with more than one electron or hole (the absence of an electron) in violation of the Pauli principle. For this reason the present work may serve as an important, albeit preliminary, step in designing a 2-RDM/ACSE method for studying steady-state molecular conductivity with an explicit treatment of electron correlation.

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

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

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

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

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

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

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

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

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

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

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

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

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

  4. Dynamic pathways to mediate reactions buried in thermal fluctuations. I. Time-dependent normal form theory for multidimensional Langevin equation.

    Science.gov (United States)

    Kawai, Shinnosuke; Komatsuzaki, Tamiki

    2009-12-14

    We present a novel theory which enables us to explore the mechanism of reaction selectivity and robust functions in complex systems persisting under thermal fluctuation. The theory constructs a nonlinear coordinate transformation so that the equation of motion for the new reaction coordinate is independent of the other nonreactive coordinates in the presence of thermal fluctuation. In this article we suppose that reacting systems subject to thermal noise are described by a multidimensional Langevin equation without a priori assumption for the form of potential. The reaction coordinate is composed not only of all the coordinates and velocities associated with the system (solute) but also of the random force exerted by the environment (solvent) with friction constants. The sign of the reaction coordinate at any instantaneous moment in the region of a saddle determines the fate of the reaction, i.e., whether the reaction will proceed through to the products or go back to the reactants. By assuming the statistical properties of the random force, one can know a priori a well-defined boundary of the reaction which separates the full position-velocity space in the saddle region into mainly reactive and mainly nonreactive regions even under thermal fluctuation. The analytical expression of the reaction coordinate provides the firm foundation on the mechanism of how and why reaction proceeds in thermal fluctuating environments.

  5. Towards an Explanation of Overeating Patterns Among Normal Weight College Women: Development and Validation of a Structural Equation Model

    OpenAIRE

    Russ, Christine Runyan II

    1998-01-01

    Although research describing relationships between psychosocial factors and various eating patterns is growing, a model which explains the mechanisms through which these factors may operate is lacking. A model to explain overeating patterns among normal weight college females was developed and tested. The model contained the following variables: global adjustment, eating and weight cognitions, emotional eating, and self-efficacy. Three hundred ninety-o...

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

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

  8. The method of normal forms for singularly perturbed systems of Fredholm integro-differential equations with rapidly varying kernels

    Energy Technology Data Exchange (ETDEWEB)

    Bobodzhanov, A A; Safonov, V F [National Research University " Moscow Power Engineering Institute" , Moscow (Russian Federation)

    2013-07-31

    The paper deals with extending the Lomov regularization method to classes of singularly perturbed Fredholm-type integro-differential systems, which have not so far been studied. In these the limiting operator is discretely noninvertible. Such systems are commonly known as problems with unstable spectrum. Separating out the essential singularities in the solutions to these problems presents great difficulties. The principal one is to give an adequate description of the singularities induced by 'instability points' of the spectrum. A methodology for separating singularities by using normal forms is developed. It is applied to the above type of systems and is substantiated in these systems. Bibliography: 10 titles.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  4. Intermittency and random matrices

    Science.gov (United States)

    Sokoloff, Dmitry; Illarionov, E. A.

    2015-08-01

    A spectacular phenomenon of intermittency, i.e. a progressive growth of higher statistical moments of a physical field excited by an instability in a random medium, attracted the attention of Zeldovich in the last years of his life. At that time, the mathematical aspects underlying the physical description of this phenomenon were still under development and relations between various findings in the field remained obscure. Contemporary results from the theory of the product of independent random matrices (the Furstenberg theory) allowed the elaboration of the phenomenon of intermittency in a systematic way. We consider applications of the Furstenberg theory to some problems in cosmology and dynamo theory.

  5. Dimension from covariance matrices.

    Science.gov (United States)

    Carroll, T L; Byers, J M

    2017-02-01

    We describe a method to estimate embedding dimension from a time series. This method includes an estimate of the probability that the dimension estimate is valid. Such validity estimates are not common in algorithms for calculating the properties of dynamical systems. The algorithm described here compares the eigenvalues of covariance matrices created from an embedded signal to the eigenvalues for a covariance matrix of a Gaussian random process with the same dimension and number of points. A statistical test gives the probability that the eigenvalues for the embedded signal did not come from the Gaussian random process.

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

  7. Generalisations of Fisher Matrices

    Directory of Open Access Journals (Sweden)

    Alan Heavens

    2016-06-01

    Full Text Available Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters—both their errors and covariances. In this short review, I outline a number of extensions to the simple Fisher matrix formalism, covering a number of recent developments in the field. These are: (a situations where the data (in the form of ( x , y pairs have errors in both x and y; (b modifications to parameter inference in the presence of systematic errors, or through fixing the values of some model parameters; (c Derivative Approximation for LIkelihoods (DALI - higher-order expansions of the likelihood surface, going beyond the Gaussian shape approximation; (d extensions of the Fisher-like formalism, to treat model selection problems with Bayesian evidence.

  8. Random volumes from matrices

    Energy Technology Data Exchange (ETDEWEB)

    Fukuma, Masafumi; Sugishita, Sotaro; Umeda, Naoya [Department of Physics, Kyoto University,Kitashirakawa Oiwake-cho, Kyoto 606-8502 (Japan)

    2015-07-17

    We propose a class of models which generate three-dimensional random volumes, where each configuration consists of triangles glued together along multiple hinges. The models have matrices as the dynamical variables and are characterized by semisimple associative algebras A. Although most of the diagrams represent configurations which are not manifolds, we show that the set of possible diagrams can be drastically reduced such that only (and all of the) three-dimensional manifolds with tetrahedral decompositions appear, by introducing a color structure and taking an appropriate large N limit. We examine the analytic properties when A is a matrix ring or a group ring, and show that the models with matrix ring have a novel strong-weak duality which interchanges the roles of triangles and hinges. We also give a brief comment on the relationship of our models with the colored tensor models.

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

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

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

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

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

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

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

  16. Evaluation of the CPU time for solving the radiative transfer equation with high-order resolution schemes applying the normalized weighting-factor method

    Science.gov (United States)

    Xamán, J.; Zavala-Guillén, I.; Hernández-López, I.; Uriarte-Flores, J.; Hernández-Pérez, I.; Macías-Melo, E. V.; Aguilar-Castro, K. M.

    2018-03-01

    In this paper, we evaluated the convergence rate (CPU time) of a new mathematical formulation for the numerical solution of the radiative transfer equation (RTE) with several High-Order (HO) and High-Resolution (HR) schemes. In computational fluid dynamics, this procedure is known as the Normalized Weighting-Factor (NWF) method and it is adopted here. The NWF method is used to incorporate the high-order resolution schemes in the discretized RTE. The NWF method is compared, in terms of computer time needed to obtain a converged solution, with the widely used deferred-correction (DC) technique for the calculations of a two-dimensional cavity with emitting-absorbing-scattering gray media using the discrete ordinates method. Six parameters, viz. the grid size, the order of quadrature, the absorption coefficient, the emissivity of the boundary surface, the under-relaxation factor, and the scattering albedo are considered to evaluate ten schemes. The results showed that using the DC method, in general, the scheme that had the lowest CPU time is the SOU. In contrast, with the results of theDC procedure the CPU time for DIAMOND and QUICK schemes using the NWF method is shown to be, between the 3.8 and 23.1% faster and 12.6 and 56.1% faster, respectively. However, the other schemes are more time consuming when theNWFis used instead of the DC method. Additionally, a second test case was presented and the results showed that depending on the problem under consideration, the NWF procedure may be computationally faster or slower that the DC method. As an example, the CPU time for QUICK and SMART schemes are 61.8 and 203.7%, respectively, slower when the NWF formulation is used for the second test case. Finally, future researches to explore the computational cost of the NWF method in more complex problems are required.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  11. Three-dimensional integral equation approach to light scattering, extinction cross sections, local density of states, and quasi-normal modes

    DEFF Research Database (Denmark)

    de Lasson, Jakob Rosenkrantz; Mørk, Jesper; Kristensen, Philip Trøst

    2013-01-01

    We present a numerical formalism for solving the Lippmann–Schwinger equation for the electric field in three dimensions. The formalism may be applied to scatterers of different shapes and embedded in different background media, and we develop it in detail for the specific case of spherical scatte...

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

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

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

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

  16. 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 ΣИ(С.

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

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

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

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

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

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

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

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

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

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

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

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

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

  10. Synthesised standards in natural matrices

    International Nuclear Information System (INIS)

    Olsen, D.G.

    1980-01-01

    The problem of securing the most reliable standards for the accurate analysis of radionuclides is discussed in the paper and in the comment on the paper. It is contended in the paper that the best standards can be created by quantitative addition of accurately known spiking solutions into carefully selected natural matrices. On the other hand it is argued that many natural materials can be successfully standardized for numerous trace constituents. Both points of view are supported with examples. (U.K.)

  11. Sparse Matrices in Frame Theory

    DEFF Research Database (Denmark)

    Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta

    2014-01-01

    Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...

  12. The Inverse of Banded Matrices

    Science.gov (United States)

    2013-01-01

    indexed entries all zeros. In this paper, generalizing a method of Mallik (1999) [5], we give the LU factorization and the inverse of the matrix Br,n (if it...r ≤ i ≤ r, 1 ≤ j ≤ r, with the remaining un-indexed entries all zeros. In this paper generalizing a method of Mallik (1999) [5...matrices and applications to piecewise cubic approximation, J. Comput. Appl. Math. 8 (4) (1982) 285–288. [5] R.K. Mallik , The inverse of a lower

  13. Fusion algebra and fusing matrices

    International Nuclear Information System (INIS)

    Gao Yihong; Li Miao; Yu Ming.

    1989-09-01

    We show that the Wilson line operators in topological field theories form a fusion algebra. In general, the fusion algebra is a relation among the fusing (F) matrices. In the case of the SU(2) WZW model, some special F matrix elements are found in this way, and the remaining F matrix elements are then determined up to a sign. In addition, the S(j) modular transformation of the one point blocks on the torus is worked out. Our results are found to agree with those obtained from the quantum group method. (author). 24 refs

  14. Transfer matrices for multilayer structures

    International Nuclear Information System (INIS)

    Baquero, R.

    1988-08-01

    We consider four of the transfer matrices defined to deal with multilayer structures. We deduce algorithms to calculate them numerically, in a simple and neat way. We illustrate their application to semi-infinite systems using SGFM formulae. These algorithms are of fast convergence and allow a calculation of bulk-, surface- and inner-layers band structure in good agreement with much more sophisticated calculations. Supermatrices, interfaces and multilayer structures can be calculated in this way with a small computational effort. (author). 10 refs

  15. Orthogonal polynomials and random matrices

    CERN Document Server

    Deift, Percy

    2000-01-01

    This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.

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

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

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

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

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

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

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

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

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

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

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

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

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

  9. Interval matrices: Regularity generates singularity

    Czech Academy of Sciences Publication Activity Database

    Rohn, Jiří; Shary, S.P.

    2018-01-01

    Roč. 540, 1 March (2018), s. 149-159 ISSN 0024-3795 Institutional support: RVO:67985807 Keywords : interval matrix * regularity * singularity * P-matrix * absolute value equation * diagonally singilarizable matrix Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016

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

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

  12. Community Detection for Correlation Matrices

    Directory of Open Access Journals (Sweden)

    Mel MacMahon

    2015-04-01

    Full Text Available A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with “hard” cores and “soft” peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect “soft stocks” that alternate between communities; and discuss implications for portfolio optimization and risk management.

  13. Community Detection for Correlation Matrices

    Science.gov (United States)

    MacMahon, Mel; Garlaschelli, Diego

    2015-04-01

    A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with "hard" cores and "soft" peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect "soft stocks" that alternate between communities; and discuss implications for portfolio optimization and risk management.

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

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

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

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

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

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

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

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

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

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

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

  5. Protein matrices for wound dressings =

    Science.gov (United States)

    Vasconcelos, Andreia Joana Costa

    Fibrous proteins such as silk fibroin (SF), keratin (K) and elastin (EL) are able to mimic the extracellular matrix (ECM) that allows their recognition under physiological conditions. The impressive mechanical properties, the environmental stability, in combination with their biocompatibility and control of morphology, provide an important basis to use these proteins in biomedical applications like protein-based wound dressings. Along time the concept of wound dressings has changed from the traditional dressings such as honey or natural fibres, used just to protect the wound from external factors, to the interactive dressings of the present. Wounds can be classified in acute that heal in the expected time frame, and chronic, which fail to heal because the orderly sequence of events is disrupted at one or more stages of the healing process. Moreover, chronic wound exudates contain high levels of tissue destructive proteolytic enzymes such as human neutrophil elastase (HNE) that need to be controlled for a proper healing. The aim of this work is to exploit the self-assemble properties of silk fibroin, keratin and elastin for the development of new protein materials to be used as wound dressings: i) evaluation of the blending effect on the physical and chemical properties of the materials; ii) development of materials with different morphologies; iii) assessment of the cytocompatibility of the protein matrices; iv) ultimately, study the ability of the developed protein matrices as wound dressings through the use of human chronic wound exudate; v) use of innovative short peptide sequences that allow to target the control of high levels of HNE found on chronic wounds. Chapter III reports the preparation of silk fibroin/keratin (SF/K) blend films by solvent casting evaporation. Two solvent systems, aqueous and acidic, were used for the preparation of films from fibroin and keratin extracted from the respective silk and wool fibres. The effect of solvent system used was

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

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

  8. Integral equations

    CERN Document Server

    Moiseiwitsch, B L

    2005-01-01

    Two distinct but related approaches hold the solutions to many mathematical problems--the forms of expression known as differential and integral equations. The method employed by the integral equation approach specifically includes the boundary conditions, which confers a valuable advantage. In addition, the integral equation approach leads naturally to the solution of the problem--under suitable conditions--in the form of an infinite series.Geared toward upper-level undergraduate students, this text focuses chiefly upon linear integral equations. It begins with a straightforward account, acco

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

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

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

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

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

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

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

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

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

  18. Clarifying Normalization

    Science.gov (United States)

    Carpenter, Donald A.

    2008-01-01

    Confusion exists among database textbooks as to the goal of normalization as well as to which normal form a designer should aspire. This article discusses such discrepancies with the intention of simplifying normalization for both teacher and student. This author's industry and classroom experiences indicate such simplification yields quicker…

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

  20. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander; Genton, Marc G.; Sun, Ying

    2015-01-01

    We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

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

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

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

  4. Generation speed in Raven's Progressive Matrices Test

    NARCIS (Netherlands)

    Verguts, T.; Boeck, P. De; Maris, E.G.G.

    1999-01-01

    In this paper, we investigate the role of response fluency on a well-known intelligence test, Raven's (1962) Advanced Progressive Matrices (APM) test. Critical in solving this test is finding rules that govern the items. Response fluency is conceptualized as generation speed or the speed at which a

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

  6. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-11-30

    We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

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

  8. Differential equations

    CERN Document Server

    Tricomi, FG

    2013-01-01

    Based on his extensive experience as an educator, F. G. Tricomi wrote this practical and concise teaching text to offer a clear idea of the problems and methods of the theory of differential equations. The treatment is geared toward advanced undergraduates and graduate students and addresses only questions that can be resolved with rigor and simplicity.Starting with a consideration of the existence and uniqueness theorem, the text advances to the behavior of the characteristics of a first-order equation, boundary problems for second-order linear equations, asymptotic methods, and diff

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

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

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

  12. Differential equations

    CERN Document Server

    Barbu, Viorel

    2016-01-01

    This textbook is a comprehensive treatment of ordinary differential equations, concisely presenting basic and essential results in a rigorous manner. Including various examples from physics, mechanics, natural sciences, engineering and automatic theory, Differential Equations is a bridge between the abstract theory of differential equations and applied systems theory. Particular attention is given to the existence and uniqueness of the Cauchy problem, linear differential systems, stability theory and applications to first-order partial differential equations. Upper undergraduate students and researchers in applied mathematics and systems theory with a background in advanced calculus will find this book particularly useful. Supplementary topics are covered in an appendix enabling the book to be completely self-contained.

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

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

  15. Birkhoff normalization

    NARCIS (Netherlands)

    Broer, H.; Hoveijn, I.; Lunter, G.; Vegter, G.

    2003-01-01

    The Birkhoff normal form procedure is a widely used tool for approximating a Hamiltonian systems by a simpler one. This chapter starts out with an introduction to Hamiltonian mechanics, followed by an explanation of the Birkhoff normal form procedure. Finally we discuss several algorithms for

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

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

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

  19. Introduction to random matrices theory and practice

    CERN Document Server

    Livan, Giacomo; Vivo, Pierpaolo

    2018-01-01

    Modern developments of Random Matrix Theory as well as pedagogical approaches to the standard core of the discipline are surprisingly hard to find in a well-organized, readable and user-friendly fashion. This slim and agile book, written in a pedagogical and hands-on style, without sacrificing formal rigor fills this gap. It brings Ph.D. students in Physics, as well as more senior practitioners, through the standard tools and results on random matrices, with an eye on most recent developments that are not usually covered in introductory texts. The focus is mainly on random matrices with real spectrum. The main guiding threads throughout the book are the Gaussian Ensembles. In particular, Wigner’s semicircle law is derived multiple times to illustrate several techniques  (e.g., Coulomb gas approach, replica theory). Most chapters are accompanied by Matlab codes (stored in an online repository) to guide readers through the numerical check of most analytical results.

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

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

  2. Joint Matrices Decompositions and Blind Source Separation

    Czech Academy of Sciences Publication Activity Database

    Chabriel, G.; Kleinsteuber, M.; Moreau, E.; Shen, H.; Tichavský, Petr; Yeredor, A.

    2014-01-01

    Roč. 31, č. 3 (2014), s. 34-43 ISSN 1053-5888 R&D Projects: GA ČR GA102/09/1278 Institutional support: RVO:67985556 Keywords : joint matrices decomposition * tensor decomposition * blind source separation Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 5.852, year: 2014 http://library.utia.cas.cz/separaty/2014/SI/tichavsky-0427607.pdf

  3. Tensor Permutation Matrices in Finite Dimensions

    OpenAIRE

    Christian, Rakotonirina

    2005-01-01

    We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows us to construct a tensor permutation matrix, which is a generalisation of tensor commutation matrix, has been established. The expression of an element of a tensor commutation matrix has been generalised in the case of any element of a tensor permutation ma...

  4. Fast Approximate Joint Diagonalization Incorporating Weight Matrices

    Czech Academy of Sciences Publication Activity Database

    Tichavský, Petr; Yeredor, A.

    2009-01-01

    Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf

  5. Photoluminescence of nanocrystals embedded in oxide matrices

    International Nuclear Information System (INIS)

    Estrada, C.; Gonzalez, J.A.; Kunold, A.; Reyes-Esqueda, J.A.; Pereyra, P.

    2006-12-01

    We used the theory of finite periodic systems to explain the photoluminescence spectra dependence on the average diameter of nanocrystals embedded in oxide matrices. Because of the broad matrix band gap, the photoluminescence response is basically determined by isolated nanocrystals and sequences of a few of them. With this model we were able to reproduce the shape and displacement of the experimentally observed photoluminescence spectra. (author)

  6. Equiangular tight frames and unistochastic matrices

    Czech Academy of Sciences Publication Activity Database

    Goyeneche, D.; Turek, Ondřej

    2017-01-01

    Roč. 50, č. 24 (2017), č. článku 245304. ISSN 1751-8113 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : equiangular tight frames * unistochastic matrices * SIC POVM Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.857, year: 2016

  7. Simplifications of rational matrices by using UML

    OpenAIRE

    Tasić, Milan B.; Stanimirović, Ivan P.

    2013-01-01

    The simplification process on rational matrices consists of simplifying each entry represented by a rational function. We follow the classic approach of dividing the numerator and denominator polynomials by their common GCD polynomial, and provide the activity diagram in UML for this process. A rational matrix representation as the quotient of a polynomial matrix and a polynomial is also discussed here and illustrated via activity diagrams. Also, a class diagram giving the links between the c...

  8. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-07

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design

  9. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-05

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.

  10. PHAGOCYTOSIS AND REMODELING OF COLLAGEN MATRICES

    OpenAIRE

    Abraham, Leah C.; Dice, J Fred.; Lee, Kyongbum; Kaplan, David L.

    2007-01-01

    The biodegradation of collagen and the deposition of new collagen-based extracellular matrices are of central importance in tissue remodeling and function. Similarly, for collagen-based biomaterials used in tissue engineering, the degradation of collagen scaffolds with accompanying cellular infiltration and generation of new extracellular matrix is critical for integration of in vitro grown tissues in vivo. In earlier studies we observed significant impact of collagen structure on primary lun...

  11. Preconditioners for regularized saddle point matrices

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe

    2011-01-01

    Roč. 19, č. 2 (2011), s. 91-112 ISSN 1570-2820 Institutional research plan: CEZ:AV0Z30860518 Keywords : saddle point matrices * preconditioning * regularization * eigenvalue clustering Subject RIV: BA - General Mathematics Impact factor: 0.533, year: 2011 http://www.degruyter.com/view/j/jnma.2011.19.issue-2/jnum.2011.005/jnum.2011.005. xml

  12. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul

    2015-01-01

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design

  13. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul

    2015-01-01

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.

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

  15. Bernoulli's Equation

    Indian Academy of Sciences (India)

    regarding nature of forces hold equally for liquids, even though the ... particle. Figure A. A fluid particle is a very small imaginary blob of fluid, here shown sche- matically in .... picture gives important information about the flow field. ... Bernoulli's equation is derived assuming ideal flow, .... weight acting in the flow direction S is.

  16. Relativistic equations

    International Nuclear Information System (INIS)

    Gross, F.

    1986-01-01

    Relativistic equations for two and three body scattering are discussed. Particular attention is paid to relativistic three body kinetics because of recent form factor measurements of the Helium 3 - Hydrogen 3 system recently completed at Saclay and Bates and the accompanying speculation that relativistic effects are important for understanding the three nucleon system. 16 refs., 4 figs

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

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

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

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

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

  2. Algebraic Graph Theory Morphisms, Monoids and Matrices

    CERN Document Server

    Knauer, Ulrich

    2011-01-01

    This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient

  3. Coherence and extensions of stochastic matrices

    Directory of Open Access Journals (Sweden)

    Angelo Gilio

    1995-11-01

    Full Text Available In this paper a review of some general results on coherence of conditional probability assessments is given. Then, a necessary and sufficient condition on coherence of two finite families of discrete conditianal probability distributions, represented by two stochastic matrices P and Q, is obtained. Moreover, the possible extensions of the assessment (P,Q to the marginal distributions are examined and explicit formulas for them are given in some special case. Finally, a general algorithm to check coherence of (P,Q and to derive its extensions is proposed.

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

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

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

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

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

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

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

  11. Malware Normalization

    OpenAIRE

    Christodorescu, Mihai; Kinder, Johannes; Jha, Somesh; Katzenbeisser, Stefan; Veith, Helmut

    2005-01-01

    Malware is code designed for a malicious purpose, such as obtaining root privilege on a host. A malware detector identifies malware and thus prevents it from adversely affecting a host. In order to evade detection by malware detectors, malware writers use various obfuscation techniques to transform their malware. There is strong evidence that commercial malware detectors are susceptible to these evasion tactics. In this paper, we describe the design and implementation of a malware normalizer ...

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

  13. Tensor Dictionary Learning for Positive Definite Matrices.

    Science.gov (United States)

    Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos

    2015-11-01

    Sparse models have proven to be extremely successful in image processing and computer vision. However, a majority of the effort has been focused on sparse representation of vectors and low-rank models for general matrices. The success of sparse modeling, along with popularity of region covariances, has inspired the development of sparse coding approaches for these positive definite descriptors. While in earlier work, the dictionary was formed from all, or a random subset of, the training signals, it is clearly advantageous to learn a concise dictionary from the entire training set. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between sparse coding and dictionary update stages, and different atom update methods are described. A discriminative version of the dictionary learning approach is also proposed, which simultaneously learns dictionaries for different classes in classification or clustering. Experimental results demonstrate the advantage of learning dictionaries from data both from reconstruction and classification viewpoints. Finally, a software library is presented comprising C++ binaries for all the positive definite sparse coding and dictionary learning approaches presented here.

  14. Virial expansion for almost diagonal random matrices

    International Nuclear Information System (INIS)

    Yevtushenko, Oleg; Kravtsov, Vladimir E

    2003-01-01

    Energy level statistics of Hermitian random matrices H-circumflex with Gaussian independent random entries H i≥j is studied for a generic ensemble of almost diagonal random matrices with (vertical bar H ii vertical bar 2 ) ∼ 1 and (vertical bar H i≠j vertical bar 2 ) bF(vertical bar i - j vertical bar) parallel 1. We perform a regular expansion of the spectral form-factor K(τ) = 1 + bK 1 (τ) + b 2 K 2 (τ) + c in powers of b parallel 1 with the coefficients K m (τ) that take into account interaction of (m + 1) energy levels. To calculate K m (τ), we develop a diagrammatic technique which is based on the Trotter formula and on the combinatorial problem of graph edges colouring with (m + 1) colours. Expressions for K 1 (τ) and K 2 (τ) in terms of infinite series are found for a generic function F(vertical bar i - j vertical bar ) in the Gaussian orthogonal ensemble (GOE), the Gaussian unitary ensemble (GUE) and in the crossover between them (the almost unitary Gaussian ensemble). The Rosenzweig-Porter and power-law banded matrix ensembles are considered as examples

  15. Generalized Eigenvalues for pairs on heritian matrices

    Science.gov (United States)

    Rublein, George

    1988-01-01

    A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.

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

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

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

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

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

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

  2. Differential Equations Compatible with KZ Equations

    International Nuclear Information System (INIS)

    Felder, G.; Markov, Y.; Tarasov, V.; Varchenko, A.

    2000-01-01

    We define a system of 'dynamical' differential equations compatible with the KZ differential equations. The KZ differential equations are associated to a complex simple Lie algebra g. These are equations on a function of n complex variables z i taking values in the tensor product of n finite dimensional g-modules. The KZ equations depend on the 'dual' variable in the Cartan subalgebra of g. The dynamical differential equations are differential equations with respect to the dual variable. We prove that the standard hypergeometric solutions of the KZ equations also satisfy the dynamical equations. As an application we give a new determinant formula for the coordinates of a basis of hypergeometric solutions

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

  4. Normal accidents

    International Nuclear Information System (INIS)

    Perrow, C.

    1989-01-01

    The author has chosen numerous concrete examples to illustrate the hazardousness inherent in high-risk technologies. Starting with the TMI reactor accident in 1979, he shows that it is not only the nuclear energy sector that bears the risk of 'normal accidents', but also quite a number of other technologies and industrial sectors, or research fields. The author refers to the petrochemical industry, shipping, air traffic, large dams, mining activities, and genetic engineering, showing that due to the complexity of the systems and their manifold, rapidly interacting processes, accidents happen that cannot be thoroughly calculated, and hence are unavoidable. (orig./HP) [de

  5. Noisy covariance matrices and portfolio optimization II

    Science.gov (United States)

    Pafka, Szilárd; Kondor, Imre

    2003-03-01

    Recent studies inspired by results from random matrix theory (Galluccio et al.: Physica A 259 (1998) 449; Laloux et al.: Phys. Rev. Lett. 83 (1999) 1467; Risk 12 (3) (1999) 69; Plerou et al.: Phys. Rev. Lett. 83 (1999) 1471) found that covariance matrices determined from empirical financial time series appear to contain such a high amount of noise that their structure can essentially be regarded as random. This seems, however, to be in contradiction with the fundamental role played by covariance matrices in finance, which constitute the pillars of modern investment theory and have also gained industry-wide applications in risk management. Our paper is an attempt to resolve this embarrassing paradox. The key observation is that the effect of noise strongly depends on the ratio r= n/ T, where n is the size of the portfolio and T the length of the available time series. On the basis of numerical experiments and analytic results for some toy portfolio models we show that for relatively large values of r (e.g. 0.6) noise does, indeed, have the pronounced effect suggested by Galluccio et al. (1998), Laloux et al. (1999) and Plerou et al. (1999) and illustrated later by Laloux et al. (Int. J. Theor. Appl. Finance 3 (2000) 391), Plerou et al. (Phys. Rev. E, e-print cond-mat/0108023) and Rosenow et al. (Europhys. Lett., e-print cond-mat/0111537) in a portfolio optimization context, while for smaller r (around 0.2 or below), the error due to noise drops to acceptable levels. Since the length of available time series is for obvious reasons limited in any practical application, any bound imposed on the noise-induced error translates into a bound on the size of the portfolio. In a related set of experiments we find that the effect of noise depends also on whether the problem arises in asset allocation or in a risk measurement context: if covariance matrices are used simply for measuring the risk of portfolios with a fixed composition rather than as inputs to optimization, the

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

  7. Equiangular tight frames and unistochastic matrices

    International Nuclear Information System (INIS)

    Goyeneche, Dardo; Turek, Ondřej

    2017-01-01

    We demonstrate that a complex equiangular tight frame composed of N vectors in dimension d , denoted ETF ( d , N ), exists if and only if a certain bistochastic matrix, univocally determined by N and d , belongs to a special class of unistochastic matrices. This connection allows us to find new complex ETFs in infinitely many dimensions and to derive a method to introduce non-trivial free parameters in ETFs. We present an explicit six-parametric family of complex ETF(6,16), which defines a family of symmetric POVMs. Minimal and maximal possible average entanglement of the vectors within this qubit–qutrit family are described. Furthermore, we propose an efficient numerical procedure to compute the unitary matrix underlying a unistochastic matrix, which we apply to find all existing classes of complex ETFs containing up to 20 vectors. (paper)

  8. Colonization of bone matrices by cellular components

    Science.gov (United States)

    Shchelkunova, E. I.; Voropaeva, A. A.; Korel, A. V.; Mayer, D. A.; Podorognaya, V. T.; Kirilova, I. A.

    2017-09-01

    Practical surgery, traumatology, orthopedics, and oncology require bioengineered constructs suitable for replacement of large-area bone defects. Only rigid/elastic matrix containing recipient's bone cells capable of mitosis, differentiation, and synthesizing extracellular matrix that supports cell viability can comply with these requirements. Therefore, the development of the techniques to produce structural and functional substitutes, whose three-dimensional structure corresponds to the recipient's damaged tissues, is the main objective of tissue engineering. This is achieved by developing tissue-engineering constructs represented by cells placed on the matrices. Low effectiveness of carrier matrix colonization with cells and their uneven distribution is one of the major problems in cell culture on various matrixes. In vitro studies of the interactions between cells and material, as well as the development of new techniques for scaffold colonization by cellular components are required to solve this problem.

  9. Matrices over runtime systems at exascale

    KAUST Repository

    Agullo, Emmanuel

    2012-11-01

    The goal of Matrices Over Runtime Systems at Exascale (MORSE) project is to design dense and sparse linear algebra methods that achieve the fastest possible time to an accurate solution on large-scale multicore systems with GPU accelerators, using all the processing power that future high end systems can make available. In this poster, we propose a framework for describing linear algebra algorithms at a high level of abstraction and delegating the actual execution to a runtime system in order to design software whose performance is portable accross architectures. We illustrate our methodology on three classes of problems: dense linear algebra, sparse direct methods and fast multipole methods. The resulting codes have been incorporated into Magma, Pastix and ScalFMM solvers, respectively. © 2012 IEEE.

  10. Sparse random matrices: The eigenvalue spectrum revisited

    International Nuclear Information System (INIS)

    Semerjian, Guilhem; Cugliandolo, Leticia F.

    2003-08-01

    We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)

  11. From Pauli Matrices to Quantum Ito Formula

    International Nuclear Information System (INIS)

    Pautrat, Yan

    2005-01-01

    This paper answers important questions raised by the recent description, by Attal, of a robust and explicit method to approximate basic objects of quantum stochastic calculus on bosonic Fock space by analogues on the state space of quantum spin chains. The existence of that method justifies a detailed investigation of discrete-time quantum stochastic calculus. Here we fully define and study that theory and obtain in particular a discrete-time quantum Ito formula, which one can see as summarizing the commutation relations of Pauli matrices.An apparent flaw in that approximation method is the difference in the quantum Ito formulas, discrete and continuous, which suggests that the discrete quantum stochastic calculus differs fundamentally from the continuous one and is therefore not a suitable object to approximate subtle phenomena. We show that flaw is only apparent by proving that the continuous-time quantum Ito formula is actually a consequence of its discrete-time counterpart

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

  13. Viscous hydrophilic injection matrices for serial crystallography

    Directory of Open Access Journals (Sweden)

    Gabriela Kovácsová

    2017-07-01

    Full Text Available Serial (femtosecond crystallography at synchrotron and X-ray free-electron laser (XFEL sources distributes the absorbed radiation dose over all crystals used for data collection and therefore allows measurement of radiation damage prone systems, including the use of microcrystals for room-temperature measurements. Serial crystallography relies on fast and efficient exchange of crystals upon X-ray exposure, which can be achieved using a variety of methods, including various injection techniques. The latter vary significantly in their flow rates – gas dynamic virtual nozzle based injectors provide very thin fast-flowing jets, whereas high-viscosity extrusion injectors produce much thicker streams with flow rates two to three orders of magnitude lower. High-viscosity extrusion results in much lower sample consumption, as its sample delivery speed is commensurate both with typical XFEL repetition rates and with data acquisition rates at synchrotron sources. An obvious viscous injection medium is lipidic cubic phase (LCP as it is used for in meso membrane protein crystallization. However, LCP has limited compatibility with many crystallization conditions. While a few other viscous media have been described in the literature, there is an ongoing need to identify additional injection media for crystal embedding. Critical attributes are reliable injection properties and a broad chemical compatibility to accommodate samples as heterogeneous and sensitive as protein crystals. Here, the use of two novel hydrogels as viscous injection matrices is described, namely sodium carboxymethyl cellulose and the thermo-reversible block polymer Pluronic F-127. Both are compatible with various crystallization conditions and yield acceptable X-ray background. The stability and velocity of the extruded stream were also analysed and the dependence of the stream velocity on the flow rate was measured. In contrast with previously characterized injection media, both new

  14. Reconstructing Normality

    DEFF Research Database (Denmark)

    Gildberg, Frederik Alkier; Bradley, Stephen K.; Fristed, Peter Billeskov

    2012-01-01

    Forensic psychiatry is an area of priority for the Danish Government. As the field expands, this calls for increased knowledge about mental health nursing practice, as this is part of the forensic psychiatry treatment offered. However, only sparse research exists in this area. The aim of this study...... was to investigate the characteristics of forensic mental health nursing staff interaction with forensic mental health inpatients and to explore how staff give meaning to these interactions. The project included 32 forensic mental health staff members, with over 307 hours of participant observations, 48 informal....... The intention is to establish a trusting relationship to form behaviour and perceptual-corrective care, which is characterized by staff's endeavours to change, halt, or support the patient's behaviour or perception in relation to staff's perception of normality. The intention is to support and teach the patient...

  15. Pursuing Normality

    DEFF Research Database (Denmark)

    Madsen, Louise Sofia; Handberg, Charlotte

    2018-01-01

    implying an influence on whether to participate in cancer survivorship care programs. Because of "pursuing normality," 8 of 9 participants opted out of cancer survivorship care programming due to prospects of "being cured" and perceptions of cancer survivorship care as "a continuation of the disease......BACKGROUND: The present study explored the reflections on cancer survivorship care of lymphoma survivors in active treatment. Lymphoma survivors have survivorship care needs, yet their participation in cancer survivorship care programs is still reported as low. OBJECTIVE: The aim of this study...... was to understand the reflections on cancer survivorship care of lymphoma survivors to aid the future planning of cancer survivorship care and overcome barriers to participation. METHODS: Data were generated in a hematological ward during 4 months of ethnographic fieldwork, including participant observation and 46...

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

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

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

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

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

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

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

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

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

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

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

  7. Dynamics with Matrices Possessing Kronecker Product Structure

    KAUST Repository

    Łoś, M.

    2015-06-01

    In this paper we present an application of Alternating Direction Implicit (ADI) algorithm for solution of non-stationary PDE-s using isogeometric finite element method. We show that ADI algorithm has a linear computational cost at every time step. We illustrate this approach by solving two example non-stationary three-dimensional problems using explicit Euler and Newmark time-stepping scheme: heat equation and linear elasticity equations for a cube. The stability of the simulation is controlled by monitoring the energy of the solution.

  8. Dynamics with Matrices Possessing Kronecker Product Structure

    KAUST Repository

    Łoś, M.; Wó zniak, M.; Paszynśki, M.; Dalcin, L.; Calo, Victor M.

    2015-01-01

    In this paper we present an application of Alternating Direction Implicit (ADI) algorithm for solution of non-stationary PDE-s using isogeometric finite element method. We show that ADI algorithm has a linear computational cost at every time step. We illustrate this approach by solving two example non-stationary three-dimensional problems using explicit Euler and Newmark time-stepping scheme: heat equation and linear elasticity equations for a cube. The stability of the simulation is controlled by monitoring the energy of the solution.

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

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

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

  12. Extended rate equations

    International Nuclear Information System (INIS)

    Shore, B.W.

    1981-01-01

    The equations of motion are discussed which describe time dependent population flows in an N-level system, reviewing the relationship between incoherent (rate) equations, coherent (Schrodinger) equations, and more general partially coherent (Bloch) equations. Approximations are discussed which replace the elaborate Bloch equations by simpler rate equations whose coefficients incorporate long-time consequences of coherence

  13. Lambda-matrices and vibrating systems

    CERN Document Server

    Lancaster, Peter

    2002-01-01

    Features aspects and solutions of problems of linear vibrating systems with a finite number of degrees of freedom. Starts with development of necessary tools in matrix theory, followed by numerical procedures for relevant matrix formulations and relevant theory of differential equations. Minimum of mathematical abstraction; assumes a familiarity with matrix theory, elementary calculus. 1966 edition.

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

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

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

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

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

  19. Substituted amylose matrices for oral drug delivery

    International Nuclear Information System (INIS)

    Moghadam, S H; Wang, H W; El-Leithy, E Saddar; Chebli, C; Cartilier, L

    2007-01-01

    High amylose corn starch was used to obtain substituted amylose (SA) polymers by chemically modifying hydroxyl groups by an etherification process using 1,2-epoxypropanol. Tablets for drug-controlled release were prepared by direct compression and their release properties assessed by an in vitro dissolution test (USP XXIII no 2). The polymer swelling was characterized by measuring gravimetrically the water uptake ability of polymer tablets. SA hydrophilic matrix tablets present sequentially a burst effect, typical of hydrophilic matrices, and a near constant release, typical of reservoir systems. After the burst effect, surface pores disappear progressively by molecular association of amylose chains; this allows the creation of a polymer layer acting as a diffusion barrier and explains the peculiar behaviour of SA polymers. Several formulation parameters such as compression force, drug loading, tablet weight and insoluble diluent concentration were investigated. On the other hand, tablet thickness, scanning electron microscope analysis and mercury intrusion porosimetry showed that the high crushing strength values observed for SA tablets were due to an unusual melting process occurring during tabletting although the tablet external layer went only through densification, deformation and partial melting. In contrast, HPMC tablets did not show any traces of a melting process

  20. Calculating scattering matrices by wave function matching

    International Nuclear Information System (INIS)

    Zwierzycki, M.; Khomyakov, P.A.; Starikov, A.A.; Talanana, M.; Xu, P.X.; Karpan, V.M.; Marushchenko, I.; Brocks, G.; Kelly, P.J.; Xia, K.; Turek, I.; Bauer, G.E.W.

    2008-01-01

    The conductance of nanoscale structures can be conveniently related to their scattering properties expressed in terms of transmission and reflection coefficients. Wave function matching (WFM) is a transparent technique for calculating transmission and reflection matrices for any Hamiltonian that can be represented in tight-binding form. A first-principles Kohn-Sham Hamiltonian represented on a localized orbital basis or on a real space grid has such a form. WFM is based upon direct matching of the scattering-region wave function to the Bloch modes of ideal leads used to probe the scattering region. The purpose of this paper is to give a pedagogical introduction to WFM and present some illustrative examples of its use in practice. We briefly discuss WFM for calculating the conductance of atomic wires, using a real space grid implementation. A tight-binding muffin-tin orbital implementation very suitable for studying spin-dependent transport in layered magnetic materials is illustrated by looking at spin-dependent transmission through ideal and disordered interfaces. (copyright 2008 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)

  1. Probing the Topology of Density Matrices

    Directory of Open Access Journals (Sweden)

    Charles-Edouard Bardyn

    2018-02-01

    Full Text Available The mixedness of a quantum state is usually seen as an adversary to topological quantization of observables. For example, exact quantization of the charge transported in a so-called Thouless adiabatic pump is lifted at any finite temperature in symmetry-protected topological insulators. Here, we show that certain directly observable many-body correlators preserve the integrity of topological invariants for mixed Gaussian quantum states in one dimension. Our approach relies on the expectation value of the many-body momentum-translation operator and leads to a physical observable—the “ensemble geometric phase” (EGP—which represents a bona fide geometric phase for mixed quantum states, in the thermodynamic limit. In cyclic protocols, the EGP provides a topologically quantized observable that detects encircled spectral singularities (“purity-gap” closing points of density matrices. While we identify the many-body nature of the EGP as a key ingredient, we propose a conceptually simple, interferometric setup to directly measure the latter in experiments with mesoscopic ensembles of ultracold atoms.

  2. Visualizing complex (hydrological) systems with correlation matrices

    Science.gov (United States)

    Haas, J. C.

    2016-12-01

    When trying to understand or visualize the connections of different aspects of a complex system, this often requires deeper understanding to start with, or - in the case of geo data - complicated GIS software. To our knowledge, correlation matrices have rarely been used in hydrology (e.g. Stoll et al., 2011; van Loon and Laaha, 2015), yet they do provide an interesting option for data visualization and analysis. We present a simple, python based way - using a river catchment as an example - to visualize correlations and similarities in an easy and colorful way. We apply existing and easy to use python packages from various disciplines not necessarily linked to the Earth sciences and can thus quickly show how different aquifers work or react, and identify outliers, enabling this system to also be used for quality control of large datasets. Going beyond earlier work, we add a temporal and spatial element, enabling us to visualize how a system reacts to local phenomena such as for example a river, or changes over time, by visualizing the passing of time in an animated movie. References: van Loon, A.F., Laaha, G.: Hydrological drought severity explained by climate and catchment characteristics, Journal of Hydrology 526, 3-14, 2015, Drought processes, modeling, and mitigation Stoll, S., Hendricks Franssen, H. J., Barthel, R., Kinzelbach, W.: What can we learn from long-term groundwater data to improve climate change impact studies?, Hydrology and Earth System Sciences 15(12), 3861-3875, 2011

  3. Decellularized matrices for cardiovascular tissue engineering.

    Science.gov (United States)

    Moroni, Francesco; Mirabella, Teodelinda

    2014-01-01

    Cardiovascular disease (CVD) is one of the leading causes of death in the Western world. The replacement of damaged vessels and valves has been practiced since the 1950's. Synthetic grafts, usually made of bio-inert materials, are long-lasting and mechanically relevant, but fail when it comes to "biointegration". Decellularized matrices, instead, can be considered biological grafts capable of stimulating in vivo migration and proliferation of endothelial cells (ECs), recruitment and differentiation of mural cells, finally, culminating in the formation of a biointegrated tissue. Decellularization protocols employ osmotic shock, ionic and non-ionic detergents, proteolitic digestions and DNase/RNase treatments; most of them effectively eliminate the cellular component, but show limitations in preserving the native structure of the extracellular matrix (ECM). In this review, we examine the current state of the art relative to decellularization techniques and biological performance of decellularized heart, valves and big vessels. Furthermore, we focus on the relevance of ECM components, native and resulting from decellularization, in mediating in vivo host response and determining repair and regeneration, as opposed to graft corruption.

  4. On some Toeplitz matrices and their inversions

    Directory of Open Access Journals (Sweden)

    S. Dutta

    2014-10-01

    Full Text Available In this article, using the difference operator B(a[m], we introduce a lower triangular Toeplitz matrix T which includes several difference matrices such as Δ(1,Δ(m,B(r,s,B(r,s,t, and B(r̃,s̃,t̃,ũ in different special cases. For any x ∈ w and m∈N0={0,1,2,…}, the difference operator B(a[m] is defined by (B(a[m]xk=ak(0xk+ak-1(1xk-1+ak-2(2xk-2+⋯+ak-m(mxk-m,(k∈N0 where a[m] = {a(0, a(1, …, a(m} and a(i = (ak(i for 0 ⩽ i ⩽ m are convergent sequences of real numbers. We use the convention that any term with negative subscript is equal to zero. The main results of this article relate to the determination and applications of the inverse of the Toeplitz matrix T.

  5. Continuous demagnetization of cerium impurities in superconducting and normal lanthanum--thorium binary alloy matrices

    International Nuclear Information System (INIS)

    Fertig, W.A.

    1976-01-01

    Experimental evidence is presented for the dramatic changes occurring in the low temperature properties of this system as the magnetic character of the Ce solutes changes from Kondo-magnetic in LaCe to nonmagnetic in ThCe. Three types of measurements are reported: (1) the superconducting transition temperature T/sub c/ vs Ce impurity concentration n for matrix compositions of 0 to 100 at. percent Th; (2) T/sub c/ vs magnetic field H for La 0 . 80 Th 0 . 20 Ce; and (3) the incremental electrical resistivity per Ce impurity vs temperature T for all the ternary systems listed above. The lowest temperature was 50 mK, and the annealed bulk samples had essentially 100 percent fcc structure. Three features in the T/sub c/ vs n data occur near the midpoint of the compositional spectrum from LaCe to ThCe: (1) the presence of a conspicuous maximum in the initial depression vertical barΔT/sub c/Δnvertical bar/sub n→0/; (2) the smooth evolution in the curvature of T/sub c/ vs n from negative to positive with increasing Th concentration; and (3) the appearance of re-entrant superconductivity in the La 0 . 90 Th 0 . 10 Ce, La 0 . 80 Th 0 . 20 Ce, and La 0 . 75 Th 0 . 25 Ce systems. As the La:Th host ratio decreases, there is a continuous decrease in the logarithmically temperature-dependent Ce impurity contribution to the total electrical resistivity. The Mueller--Hartmann and Zittartz theory for superconducting Kondo systems can qualitatively account for the behavior of the T/sub c/ vs n data for host compositions with approximately less than 70 at. percent Th. The Kaiser theory for conduction electron scattering by nonmagnetic resonant states yields a reasonable fit to the T/sub c/ vs n data for Th concentrations as low as approximately 60 at. percent

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

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

  8. Application of hierarchical matrices for partial inverse

    KAUST Repository

    Litvinenko, Alexander

    2013-01-01

    Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.

  9. Modular Extracellular Matrices: Solutions for the Puzzle

    Science.gov (United States)

    Serban, Monica A.; Prestwich, Glenn D.

    2008-01-01

    The common technique of growing cells in two-dimensions (2-D) is gradually being replaced by culturing cells on matrices with more appropriate composition and stiffness, or by encapsulation of cells in three-dimensions (3-D). The universal acceptance of the new 3-D paradigm has been constrained by the absence of a commercially available, biocompatible material that offers ease of use, experimental flexibility, and a seamless transition from in vitro to in vivo applications. The challenge – the puzzle that needs a solution – is to replicate the complexity of the native extracellular matrix (ECM) environment with the minimum number of components necessary to allow cells to rebuild and replicate a given tissue. For use in drug discovery, toxicology, cell banking, and ultimately in reparative medicine, the ideal matrix would therefore need to be highly reproducible, manufacturable, approvable, and affordable. Herein we describe the development of a set of modular components that can be assembled into biomimetic materials that meet these requirements. These semi-synthetic ECMs, or sECMs, are based on hyaluronan derivatives that form covalently crosslinked, biodegradable hydrogels suitable for 3-D culture of primary and stem cells in vitro, and for tissue formation in vivo. The sECMs can be engineered to provide appropriate biological cues needed to recapitulate the complexity of a given ECM environment. Specific applications for different sECM compositions include stem cell expansion with control of differentiation, scar-free wound healing, growth factor delivery, cell delivery for osteochondral defect and liver repair, and development of vascularized tumor xenografts for personalized chemotherapy. PMID:18442709

  10. Comparison of eigensolvers for symmetric band matrices.

    Science.gov (United States)

    Moldaschl, Michael; Gansterer, Wilfried N

    2014-09-15

    We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as implemented in Lapack or Plasma on the one hand, and the block divide-and-conquer (BD&C) algorithm as well as the block twisted factorization (BTF) method on the other hand. The BD&C algorithm does not require tridiagonalization of the original band matrix at all, and the current version of the BTF method tridiagonalizes the original band matrix only for computing the eigenvalues. Avoiding the tridiagonalization process sidesteps the cost of backtransformation of the eigenvectors. Beyond that, we discovered another disadvantage of the backtransformation process for band matrices: In several scenarios, a lot of gradual underflow is observed in the (optional) accumulation of the transformation matrix and in the (obligatory) backtransformation step. According to the IEEE 754 standard for floating-point arithmetic, this implies many operations with subnormal (denormalized) numbers, which causes severe slowdowns compared to the other algorithms without backtransformation of the eigenvectors. We illustrate that in these cases the performance of existing methods from Lapack and Plasma reaches a competitive level only if subnormal numbers are disabled (and thus the IEEE standard is violated). Overall, our performance studies illustrate that if the problem size is large enough relative to the bandwidth, BD&C tends to achieve the highest performance of all methods if the spectrum to be computed is clustered. For test problems with well separated eigenvalues, the BTF method tends to become the fastest algorithm with growing problem size.

  11. MATXTST, Basic Operations for Covariance Matrices

    International Nuclear Information System (INIS)

    Geraldo, Luiz P.; Smith, Donald

    1989-01-01

    1 - Description of program or function: MATXTST and MATXTST1 perform the following operations for a covariance matrix: - test for singularity; - test for positive definiteness; - compute the inverse if the matrix is non-singular; - compute the determinant; - determine the number of positive, negative, and zero eigenvalues; - examine all possible 3 X 3 cross correlations within a sub-matrix corresponding to a leading principal minor which is non-positive definite. While the two programs utilize the same input, the calculational procedures employed are somewhat different and their functions are complementary. The available input options include: i) the full covariance matrix, ii) the basic variables plus the relative covariance matrix, or iii) uncertainties in the basic variables plus the correlation matrix. 2 - Method of solution: MATXTST employs LINPACK subroutines SPOFA and SPODI to test for positive definiteness and to perform further optional calculations. Subroutine SPOFA factors a symmetric matrix M using the Cholesky algorithm to determine the elements of a matrix R which satisfies the relation M=R'R, where R' is the transposed matrix of R. Each leading principal minor of M is tested until the first one is found which is not positive definite. MATXTST1 uses LINPACK subroutines SSICO, SSIFA, and SSIDI to estimate whether the matrix is near to singularity or not (SSICO), and to perform the matrix diagonalization process (SSIFA). The algorithm used in SSIFA is generalization of the Method of Lagrange Reduction. SSIDI is used to compute the determinant and inertia of the matrix. 3 - Restrictions on the complexity of the problem: Matrices of sizes up to 50 X 50 elements can be treated by present versions of the programs

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

  13. Self-organization in a simple model of adaptive agents playing 2 x 2 games with arbitrary payoff matrices.

    Science.gov (United States)

    Fort, H; Viola, S

    2004-03-01

    We analyze, both analytically and numerically, the self-organization of a system of "selfish" adaptive agents playing an arbitrary iterated pairwise game (defined by a 2 x 2 payoff matrix). Examples of possible games to play are the prisoner's dilemma (PD) game, the chicken game, the hero game, etc. The agents have no memory, use strategies not based on direct reciprocity nor "tags" and are chosen at random, i.e., geographical vicinity is neglected. They can play two possible strategies: cooperate (C) or defect (D). The players measure their success by comparing their utilities with an estimate for the expected benefits and update their strategy following a simple rule. Two versions of the model are studied: (1) the deterministic version (the agents are either in definite states C or D) and (2) the stochastic version (the agents have a probability c of playing C). Using a general master equation we compute the equilibrium states into which the system self-organizes, characterized by their average probability of cooperation c(eq). Depending on the payoff matrix, we show that c(eq) can take five different values. We also consider the mixing of agents using two different payoff matrices and show that any value of c(eq) can be reached by tuning the proportions of agents using each payoff matrix. In particular, this can be used as a way to simulate the effect of a fraction d of "antisocial" individuals--incapable of realizing any value to cooperation--on the cooperative regime hold by a population of neutral or "normal" agents.

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

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

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

  17. Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices

    KAUST Repository

    Lan, Shiwei; Holbrook, Andrew; Fortin, Norbert J.; Ombao, Hernando; Shahbaba, Babak

    2017-01-01

    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

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

  19. Partial Differential Equations

    CERN Document Server

    1988-01-01

    The volume contains a selection of papers presented at the 7th Symposium on differential geometry and differential equations (DD7) held at the Nankai Institute of Mathematics, Tianjin, China, in 1986. Most of the contributions are original research papers on topics including elliptic equations, hyperbolic equations, evolution equations, non-linear equations from differential geometry and mechanics, micro-local analysis.

  20. Equating error in observed-score equating

    NARCIS (Netherlands)

    van der Linden, Willem J.

    2006-01-01

    Traditionally, error in equating observed scores on two versions of a test is defined as the difference between the transformations that equate the quantiles of their distributions in the sample and population of test takers. But it is argued that if the goal of equating is to adjust the scores of

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

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

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

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

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

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

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

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

  9. Old and New about Positive Definite Matrices

    Czech Academy of Sciences Publication Activity Database

    Fiedler, Miroslav

    2015-01-01

    Roč. 484, 1 November (2015), s. 496-503 ISSN 0024-3795 R&D Projects: GA ČR(CZ) GAP108/11/0853 Institutional support: RVO:67985807 Keywords : positive definite matrix * normalized positive definite matrix * sign pattern Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015

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

  11. Neutrino mass priors for cosmology from random matrices

    Science.gov (United States)

    Long, Andrew J.; Raveri, Marco; Hu, Wayne; Dodelson, Scott

    2018-02-01

    Cosmological measurements of structure are placing increasingly strong constraints on the sum of the neutrino masses, Σ mν, through Bayesian inference. Because these constraints depend on the choice for the prior probability π (Σ mν), we argue that this prior should be motivated by fundamental physical principles rather than the ad hoc choices that are common in the literature. The first step in this direction is to specify the prior directly at the level of the neutrino mass matrix Mν, since this is the parameter appearing in the Lagrangian of the particle physics theory. Thus by specifying a probability distribution over Mν, and by including the known squared mass splittings, we predict a theoretical probability distribution over Σ mν that we interpret as a Bayesian prior probability π (Σ mν). Assuming a basis-invariant probability distribution on Mν, also known as the anarchy hypothesis, we find that π (Σ mν) peaks close to the smallest Σ mν allowed by the measured mass splittings, roughly 0.06 eV (0.1 eV) for normal (inverted) ordering, due to the phenomenon of eigenvalue repulsion in random matrices. We consider three models for neutrino mass generation: Dirac, Majorana, and Majorana via the seesaw mechanism; differences in the predicted priors π (Σ mν) allow for the possibility of having indications about the physical origin of neutrino masses once sufficient experimental sensitivity is achieved. We present fitting functions for π (Σ mν), which provide a simple means for applying these priors to cosmological constraints on the neutrino masses or marginalizing over their impact on other cosmological parameters.

  12. Estimated correlation matrices and portfolio optimization

    Science.gov (United States)

    Pafka, Szilárd; Kondor, Imre

    2004-11-01

    Correlations of returns on various assets play a central role in financial theory and also in many practical applications. From a theoretical point of view, the main interest lies in the proper description of the structure and dynamics of correlations, whereas for the practitioner the emphasis is on the ability of the models to provide adequate inputs for the numerous portfolio and risk management procedures used in the financial industry. The theory of portfolios, initiated by Markowitz, has suffered from the “curse of dimensions” from the very outset. Over the past decades a large number of different techniques have been developed to tackle this problem and reduce the effective dimension of large bank portfolios, but the efficiency and reliability of these procedures are extremely hard to assess or compare. In this paper, we propose a model (simulation)-based approach which can be used for the systematical testing of all these dimensional reduction techniques. To illustrate the usefulness of our framework, we develop several toy models that display some of the main characteristic features of empirical correlations and generate artificial time series from them. Then, we regard these time series as empirical data and reconstruct the corresponding correlation matrices which will inevitably contain a certain amount of noise, due to the finiteness of the time series. Next, we apply several correlation matrix estimators and dimension reduction techniques introduced in the literature and/or applied in practice. As in our artificial world the only source of error is the finite length of the time series and, in addition, the “true” model, hence also the “true” correlation matrix, are precisely known, therefore in sharp contrast with empirical studies, we can precisely compare the performance of the various noise reduction techniques. One of our recurrent observations is that the recently introduced filtering technique based on random matrix theory performs

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

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

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

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

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

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

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

  20. Application of hierarchical matrices for partial inverse

    KAUST Repository

    Litvinenko, Alexander

    2013-11-26

    In this work we combine hierarchical matrix techniques (Hackbusch, 1999) and domain decomposition methods to obtain fast and efficient algorithms for the solution of multiscale problems. This combination results in the hierarchical domain decomposition (HDD) method, which can be applied for solution multi-scale problems. Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.

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

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

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

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

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

  6. Chemical Equation Balancing.

    Science.gov (United States)

    Blakley, G. R.

    1982-01-01

    Reviews mathematical techniques for solving systems of homogeneous linear equations and demonstrates that the algebraic method of balancing chemical equations is a matter of solving a system of homogeneous linear equations. FORTRAN programs using this matrix method to chemical equation balancing are available from the author. (JN)

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

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

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

  10. Handbook of integral equations

    CERN Document Server

    Polyanin, Andrei D

    2008-01-01

    This handbook contains over 2,500 integral equations with solutions as well as analytical and numerical methods for solving linear and nonlinear equations. It explores Volterra, Fredholm, WienerHopf, Hammerstein, Uryson, and other equations that arise in mathematics, physics, engineering, the sciences, and economics. This second edition includes new chapters on mixed multidimensional equations and methods of integral equations for ODEs and PDEs, along with over 400 new equations with exact solutions. With many examples added for illustrative purposes, it presents new material on Volterra, Fredholm, singular, hypersingular, dual, and nonlinear integral equations, integral transforms, and special functions.

  11. Normal Pressure Hydrocephalus (NPH)

    Science.gov (United States)

    ... local chapter Join our online community Normal Pressure Hydrocephalus (NPH) Normal pressure hydrocephalus is a brain disorder ... Symptoms Diagnosis Causes & risks Treatments About Normal Pressure Hydrocephalus Normal pressure hydrocephalus occurs when excess cerebrospinal fluid ...

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

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

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

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

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

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

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

  19. Physical properties of the Schur complement of local covariance matrices

    International Nuclear Information System (INIS)

    Haruna, L F; Oliveira, M C de

    2007-01-01

    General properties of global covariance matrices representing bipartite Gaussian states can be decomposed into properties of local covariance matrices and their Schur complements. We demonstrate that given a bipartite Gaussian state ρ 12 described by a 4 x 4 covariance matrix V, the Schur complement of a local covariance submatrix V 1 of it can be interpreted as a new covariance matrix representing a Gaussian operator of party 1 conditioned to local parity measurements on party 2. The connection with a partial parity measurement over a bipartite quantum state and the determination of the reduced Wigner function is given and an operational process of parity measurement is developed. Generalization of this procedure to an n-partite Gaussian state is given, and it is demonstrated that the n - 1 system state conditioned to a partial parity projection is given by a covariance matrix such that its 2 x 2 block elements are Schur complements of special local matrices

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

  1. A matrix formulation of Frobenius power series solutions using products of 4X4 matrices

    Directory of Open Access Journals (Sweden)

    Jeremy Mandelkern

    2015-08-01

    Full Text Available In Coddington and Levison [7, p. 119, Thm. 4.1] and Balser [4, p. 18-19, Thm. 5], matrix formulations of Frobenius theory, near a regular singular point, are given using 2X2 matrix recurrence relations yielding fundamental matrices consisting of two linearly independent solutions together with their quasi-derivatives. In this article we apply a reformulation of these matrix methods to the Bessel equation of nonintegral order. The reformulated approach of this article differs from [7] and [4] by its implementation of a new ``vectorization'' procedure that yields recurrence relations of an altogether different form: namely, it replaces the implicit 2X2 matrix recurrence relations of both [7] and [4] by explicit 4X4 matrix recurrence relations that are implemented by means only of 4X4 matrix products. This new idea of using a vectorization procedure may further enable the development of symbolic manipulator programs for matrix forms of the Frobenius theory.

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

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

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

  5. An algebraic model for quark mass matrices with heavy top

    International Nuclear Information System (INIS)

    Krolikowski, W.; Warsaw Univ.

    1991-01-01

    In terms of an intergeneration U(3) algebra, a numerical model is constructed for quark mass matrices, predicting the top-quark mass around 170 GeV and the CP-violating phase around 75 deg. The CKM matrix is nonsymmetric in moduli with |V ub | being very small. All moduli are consistent with their experimental limits. The model is motivated by the author's previous work on three replicas of the Dirac particle, presumably resulting into three generations of leptons and quarks. The paper may be also viewed as an introduction to a new method of intrinsic dynamical description of lepton and quark mass matrices. (author)

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

  7. Soft landing of size selected clusters in rare gas matrices

    International Nuclear Information System (INIS)

    Lau, J.T; Wurth, W.; Ehrke, H-U.; Achleitner, A.

    2003-01-01

    Soft landing of mass selected clusters in rare gas matrices is a technique used to preserve mass selection in cluster deposition. To prevent fragmentation upon deposition, the substrate is covered with rare gas matrices to dissipate the cluster kinetic energy upon impact. Theoretical and experimental studies demonstrate the power of this technique. Besides STM, optical absorption, excitation, and fluorescence experiments, x-ray absorption at core levels can be used as a tool to study soft landing conditions, as will be shown here. X-ray absorption spectroscopy is also well suited to follow diffusion and agglomeration of clusters on surfaces via energy shifts in core level absorption

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

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

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

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

  12. Normalization: A Preprocessing Stage

    OpenAIRE

    Patro, S. Gopal Krishna; Sahu, Kishore Kumar

    2015-01-01

    As we know that the normalization is a pre-processing stage of any type problem statement. Especially normalization takes important role in the field of soft computing, cloud computing etc. for manipulation of data like scale down or scale up the range of data before it becomes used for further stage. There are so many normalization techniques are there namely Min-Max normalization, Z-score normalization and Decimal scaling normalization. So by referring these normalization techniques we are ...

  13. Introduction to differential equations

    CERN Document Server

    Taylor, Michael E

    2011-01-01

    The mathematical formulations of problems in physics, economics, biology, and other sciences are usually embodied in differential equations. The analysis of the resulting equations then provides new insight into the original problems. This book describes the tools for performing that analysis. The first chapter treats single differential equations, emphasizing linear and nonlinear first order equations, linear second order equations, and a class of nonlinear second order equations arising from Newton's laws. The first order linear theory starts with a self-contained presentation of the exponen

  14. Nonlinear evolution equations

    CERN Document Server

    Uraltseva, N N

    1995-01-01

    This collection focuses on nonlinear problems in partial differential equations. Most of the papers are based on lectures presented at the seminar on partial differential equations and mathematical physics at St. Petersburg University. Among the topics explored are the existence and properties of solutions of various classes of nonlinear evolution equations, nonlinear imbedding theorems, bifurcations of solutions, and equations of mathematical physics (Navier-Stokes type equations and the nonlinear Schrödinger equation). The book will be useful to researchers and graduate students working in p

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

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

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

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

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

  20. Benney's long wave equations

    International Nuclear Information System (INIS)

    Lebedev, D.R.

    1979-01-01

    Benney's equations of motion of incompressible nonviscous fluid with free surface in the approximation of long waves are analyzed. The connection between the Lie algebra of Hamilton plane vector fields and the Benney's momentum equations is shown

  1. Schur complements of matrices with acyclic bipartite graphs

    DEFF Research Database (Denmark)

    Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.

    2005-01-01

    Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...

  2. Modeling and Forecasting Large Realized Covariance Matrices and Portfolio Choice

    NARCIS (Netherlands)

    Callot, Laurent A.F.; Kock, Anders B.; Medeiros, Marcelo C.

    2017-01-01

    We consider modeling and forecasting large realized covariance matrices by penalized vector autoregressive models. We consider Lasso-type estimators to reduce the dimensionality and provide strong theoretical guarantees on the forecast capability of our procedure. We show that we can forecast

  3. BMP-silk composite matrices heal critically sized femoral defects

    NARCIS (Netherlands)

    Kirker-Head, C.; Karageorgiou, V.; Hofmann, S.; Fajardo, R.; Betz, O.; Merkle, H.P.; Hilbe, M.; Rechenberg, von B.; McCool, J.; Abrahamsen, L.; Nazarian, A.; Cory, E.; Curtis, M.; Kaplan, D.L.; Meinel, L.

    2007-01-01

    Clinical drawbacks of bone grafting prompt the search for alternative bone augmentation technologies such as use of growth and differentiation factors, gene therapy, and cell therapy. Osteopromotive matrices are frequently employed for the local delivery and controlled release of these augmentation

  4. Which matrices are immune against the transportation paradox

    NARCIS (Netherlands)

    Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard

    2003-01-01

    We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for

  5. A definition of column reduced proper rational matrices

    Czech Academy of Sciences Publication Activity Database

    Ruiz-León, J. J.; Castellanos, A.; Ramos-Velasco, Luis Enrique

    2002-01-01

    Roč. 75, č. 3 (2002), s. 195-203 ISSN 0020-7179 R&D Projects: GA AV ČR KSK1019101 Institutional research plan: CEZ:AV0Z1075907 Keywords : linear systems * columm reduced polynomial matrices * decoupling Subject RIV: BC - Control Systems Theory Impact factor: 0.861, year: 2002

  6. Construction of MDS self-dual codes from orthogonal matrices

    OpenAIRE

    Shi, Minjia; Sok, Lin; Solé, Patrick

    2016-01-01

    In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.

  7. Designer matrices for intestinal stem cell and organoid culture

    NARCIS (Netherlands)

    Gjorevski, Nikolce; Sachs, Norman; Manfrin, Andrea; Giger, Sonja; Bragina, Maiia E.; Ordóñez-Morán, Paloma; Clevers, Hans; Lutolf, Matthias P.

    2016-01-01

    Epithelial organoids recapitulate multiple aspects of real organs, making them promising models of organ development, function and disease. However, the full potential of organoids in research and therapy has remained unrealized, owing to the poorly defined animal-derived matrices in which they are

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

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

  10. Eudragit E100 and Polysaccharide Polymer Blends as Matrices for ...

    African Journals Online (AJOL)

    Purpose: To compare the effects of two states of polymer/polymer blending (dry and aqueous/lyophilized) on the physicomechanical properties of tablets, containing blends of locust bean gum (LB) with Eudragit® E100 (E100) and sodium carboxymethylcellulose (SCMC) as matrices. Methods: LB, SCMC and E100 were ...

  11. On the nonnegative inverse eigenvalue problem of traditional matrices

    Directory of Open Access Journals (Sweden)

    Alimohammad Nazari

    2014-07-01

    Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.

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

  13. REFLECTIONS The Matrices of Race, Class and Gender: how they ...

    African Journals Online (AJOL)

    REFLECTIONS The Matrices of Race, Class and Gender: how they. Nova Smith. Full Text: EMAIL FULL TEXT EMAIL FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT · http://dx.doi.org/10.4314/safere.v3i1.23950 · AJOL African Journals Online. HOW TO USE AJOL... for Researchers · for Librarians ...

  14. A Role for M-Matrices in Modelling Population Growth

    Science.gov (United States)

    James, Glyn; Rumchev, Ventsi

    2006-01-01

    Adopting a discrete-time cohort-type model to represent the dynamics of a population, the problem of achieving a desired total size of the population under a balanced growth (contraction) and the problem of maintaining the desired size, once achieved, are studied. Properties of positive-time systems and M-matrices are used to develop the results,…

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

  16. Variation in Raven's Progressive Matrices Scores across Time and Place

    Science.gov (United States)

    Brouwers, Symen A.; Van de Vijver, Fons J. R.; Van Hemert, Dianne A.

    2009-01-01

    The paper describes a cross-cultural and historical meta-analysis of Raven's Progressive Matrices. Data were analyzed of 798 samples from 45 countries (N = 244,316), which were published between 1944 and 2003. Country-level indicators of educational permeation (which involves a broad set of interrelated educational input and output factors that…

  17. Eudragit E100 and Polysaccharide Polymer Blends as Matrices for ...

    African Journals Online (AJOL)

    Methods: LB, SCMC and E100 were blended in their dry (as purchased) state or modified by aqueous blending and subsequent lyophilization, prior to use as matrices in tablets. ... pullulan from Aureobasidium pullulans, 3-(3,4- .... the frozen polymer before sublimation and drying). Subsequently, milling generated a more.

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

  19. Resistant lower rank approximation of matrices by iterative majorization

    NARCIS (Netherlands)

    Verboon, Peter; Heiser, Willem

    2011-01-01

    It is commonly known that many techniques for data analysis based on the least squares criterion are very sensitive to outliers in the data. Gabriel and Odoroff (1984) suggested a resistant approach for lower rank approximation of matrices. In this approach, weights are used to diminish the

  20. Model-independent analysis with BPM correlation matrices

    International Nuclear Information System (INIS)

    Irwin, J.; Wang, C.X.; Yan, Y.T.; Bane, K.; Cai, Y.; Decker, F.; Minty, M.; Stupakov, G.; Zimmermann, F.

    1998-06-01

    The authors discuss techniques for Model-Independent Analysis (MIA) of a beamline using correlation matrices of physical variables and Singular Value Decomposition (SVD) of a beamline BPM matrix. The beamline matrix is formed from BPM readings for a large number of pulses. The method has been applied to the Linear Accelerator of the SLAC Linear Collider (SLC)

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

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

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

  4. Fractional Schroedinger equation

    International Nuclear Information System (INIS)

    Laskin, Nick

    2002-01-01

    Some properties of the fractional Schroedinger equation are studied. We prove the Hermiticity of the fractional Hamilton operator and establish the parity conservation law for fractional quantum mechanics. As physical applications of the fractional Schroedinger equation we find the energy spectra of a hydrogenlike atom (fractional 'Bohr atom') and of a fractional oscillator in the semiclassical approximation. An equation for the fractional probability current density is developed and discussed. We also discuss the relationships between the fractional and standard Schroedinger equations

  5. Ordinary differential equations

    CERN Document Server

    Greenberg, Michael D

    2014-01-01

    Features a balance between theory, proofs, and examples and provides applications across diverse fields of study Ordinary Differential Equations presents a thorough discussion of first-order differential equations and progresses to equations of higher order. The book transitions smoothly from first-order to higher-order equations, allowing readers to develop a complete understanding of the related theory. Featuring diverse and interesting applications from engineering, bioengineering, ecology, and biology, the book anticipates potential difficulties in understanding the various solution steps

  6. Beginning partial differential equations

    CERN Document Server

    O'Neil, Peter V

    2014-01-01

    A broad introduction to PDEs with an emphasis on specialized topics and applications occurring in a variety of fields Featuring a thoroughly revised presentation of topics, Beginning Partial Differential Equations, Third Edition provides a challenging, yet accessible,combination of techniques, applications, and introductory theory on the subjectof partial differential equations. The new edition offers nonstandard coverageon material including Burger's equation, the telegraph equation, damped wavemotion, and the use of characteristics to solve nonhomogeneous problems. The Third Edition is or

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

  8. Averaged RMHD equations

    International Nuclear Information System (INIS)

    Ichiguchi, Katsuji

    1998-01-01

    A new reduced set of resistive MHD equations is derived by averaging the full MHD equations on specified flux coordinates, which is consistent with 3D equilibria. It is confirmed that the total energy is conserved and the linearized equations for ideal modes are self-adjoint. (author)

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

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

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

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

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

  14. Normal modes and continuous spectra

    International Nuclear Information System (INIS)

    Balmforth, N.J.; Morrison, P.J.

    1994-12-01

    The authors consider stability problems arising in fluids, plasmas and stellar systems that contain singularities resulting from wave-mean flow or wave-particle resonances. Such resonances lead to singularities in the differential equations determining the normal modes at the so-called critical points or layers. The locations of the singularities are determined by the eigenvalue of the problem, and as a result, the spectrum of eigenvalues forms a continuum. They outline a method to construct the singular eigenfunctions comprising the continuum for a variety of problems

  15. Singular stochastic differential equations

    CERN Document Server

    Cherny, Alexander S

    2005-01-01

    The authors introduce, in this research monograph on stochastic differential equations, a class of points termed isolated singular points. Stochastic differential equations possessing such points (called singular stochastic differential equations here) arise often in theory and in applications. However, known conditions for the existence and uniqueness of a solution typically fail for such equations. The book concentrates on the study of the existence, the uniqueness, and, what is most important, on the qualitative behaviour of solutions of singular stochastic differential equations. This is done by providing a qualitative classification of isolated singular points, into 48 possible types.

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

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

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

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

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

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

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

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

  4. Tlx acts as a proangiogenic switch by regulating extracellular assembly of fibronectin matrices in retinal astrocytes.

    Science.gov (United States)

    Uemura, Akiyoshi; Kusuhara, Sentaro; Wiegand, Stanley J; Yu, Ruth T; Nishikawa, Shin-ichi

    2006-02-01

    In response to hypoxia, hypoxia-inducible factors act as the primary proangiogenic triggers by regulating transcription levels of target genes, including VEGF. However, little is known about the specific factors that control other components of the angiogenic process, particularly formation of matrix scaffolds that promote adhesion and migration of endothelial cells. We show that in the postnatal mouse retina, the orphan nuclear receptor tailless (Tlx) is strongly expressed in the proangiogenic astrocytes, which secrete VEGF and fibronectin. Tlx expression by retinal astrocytes is controlled by oxygen concentration and rapidly downregulated upon contact with blood vessels. In mice null for Tlx, retinal astrocytes maintain VEGF expression; however, the extracellular assembly of fibronectin matrices by astrocytes is severely impaired, leading to defective scaffold formation and a complete failure of normal retinal vascular development. This work identifies Tlx as an essential component of the molecular network involved in the hypoxia-inducible proangiogenic switch in retinal astrocytes.

  5. On separable Pauli equations

    International Nuclear Information System (INIS)

    Zhalij, Alexander

    2002-01-01

    We classify (1+3)-dimensional Pauli equations for a spin-(1/2) particle interacting with the electro-magnetic field, that are solvable by the method of separation of variables. As a result, we obtain the 11 classes of vector-potentials of the electro-magnetic field A(t,x(vector sign))=(A 0 (t,x(vector sign)), A(vector sign)(t,x(vector sign))) providing separability of the corresponding Pauli equations. It is established, in particular, that the necessary condition for the Pauli equation to be separable into second-order matrix ordinary differential equations is its equivalence to the system of two uncoupled Schroedinger equations. In addition, the magnetic field has to be independent of spatial variables. We prove that coordinate systems and the vector-potentials of the electro-magnetic field providing the separability of the corresponding Pauli equations coincide with those for the Schroedinger equations. Furthermore, an efficient algorithm for constructing all coordinate systems providing the separability of Pauli equation with a fixed vector-potential of the electro-magnetic field is developed. Finally, we describe all vector-potentials A(t,x(vector sign)) that (a) provide the separability of Pauli equation, (b) satisfy vacuum Maxwell equations without currents, and (c) describe non-zero magnetic field

  6. Functional equations with causal operators

    CERN Document Server

    Corduneanu, C

    2003-01-01

    Functional equations encompass most of the equations used in applied science and engineering: ordinary differential equations, integral equations of the Volterra type, equations with delayed argument, and integro-differential equations of the Volterra type. The basic theory of functional equations includes functional differential equations with causal operators. Functional Equations with Causal Operators explains the connection between equations with causal operators and the classical types of functional equations encountered by mathematicians and engineers. It details the fundamentals of linear equations and stability theory and provides several applications and examples.

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

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

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

  10. Stabilization and solidification of Pb in cement matrices

    International Nuclear Information System (INIS)

    Gollmann, Maria A.C.; Silva, Marcia M. da; Santos, Joao H. Z. dos; Masuero, Angela B.

    2010-01-01

    Pb was incorporated to a series of cement matrices, which were submitted to different cure time and pH. Pb content leached to aqueous solution was monitored by atomic absorption spectroscopy. The block resistance was evaluated by unconfined compressive strength at 7 and 28 ages. Data are discussed in terms of metal mobility along the cement block monitored by X-ray fluorescence (XRF) spectrometry. The Pb incorporated matrices have shown that a long cure time is more suitable for avoiding metal leaching. For a longer cure period the action of the metal is higher and there is a decreasing in the compressive strength. The XRF analyses show that there is a lower Ca concentration in the matrix in which Pb was added. (author)

  11. Multigroup P8 - elastic scattering matrices of main reactor elements

    International Nuclear Information System (INIS)

    Garg, S.B.; Shukla, V.K.

    1979-01-01

    To study the effect of anisotropic scattering phenomenon on shielding and neutronics of nuclear reactors multigroup P8-elastic scattering matrices have been generated for H, D, He, 6 Li, 7 Li, 10 B, C, N, O, Na, Cr, Fe, Ni, 233 U, 235 U, 238 U, 239 Pu, 240 Pu, 241 Pu and 242 Pu using their angular distribution, Legendre coefficient and elastic scattering cross-section data from the basic ENDF/B library. Two computer codes HSCAT and TRANS have been developed to complete this task for BESM-6 and CDC-3600 computers. These scattering matrices can be directly used as input to the transport theory codes ANISN and DOT. (auth.)

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

  13. Determination of chromium in biological matrices by neutron activation

    International Nuclear Information System (INIS)

    McClendon, L.T.

    1978-01-01

    Chromium is recognized to be an essential trace element in several biological systems. It exists in many biological materials in a variety of chemical forms and very low concentration levels which cause problems for many analytical techniques. Both instrumental and destructive neutron activation analysis were used to determine the chromium concentration in Orchard Leaves, SRM 1571, Brewers Yeast, SRM 1569, and Bovine Liver, SRM 1577. Some of the problems inherent with determining chromium in certain biological matrices and the data obtained here at the National Bureau of Standards using this technique are discussed. The results obtained from dissolution of brewers yeast in a closed system as described in the DNAA procedure are in good agreement with the INAA results. The same phenomenon existed in the determination of chromium in bovine liver. The radiochemical procedure described for chromium (DNAA) provides the analyst with a simple, rapid and selective technique for chromium determination in a variety of matrices. (T.G.)

  14. NDMA formation kinetics from three pharmaceuticals in four water matrices.

    Science.gov (United States)

    Shen, Ruqiao; Andrews, Susan A

    2011-11-01

    N, N-nitrosodimethylamine (NDMA) is an emerging disinfection by-product (DBP) that has been widely detected in many drinking water systems and commonly associated with the chloramine disinfection process. Some amine-based pharmaceuticals have been demonstrated to form NDMA during chloramination, but studies regarding the reaction kinetics are largely lacking. This study investigates the NDMA formation kinetics from ranitidine, chlorphenamine, and doxylamine under practical chloramine disinfection conditions. The formation profile was monitored in both lab-grade water and real water matrices, and a statistical model is proposed to describe and predict the NDMA formation from selected pharmaceuticals in various water matrices. The results indicate the significant impact of water matrix components and reaction time on the NDMA formation from selected pharmaceuticals, and provide fresh insights on the estimation of ultimate NDMA formation potential from pharmaceutical precursors. Copyright © 2011 Elsevier Ltd. All rights reserved.

  15. Quark mass matrices in left-right symmetric gauge theories

    International Nuclear Information System (INIS)

    Ecker, G.; Grimus, W.; Konetschny, W.

    1981-01-01

    The most general left-right symmetry for SU(2)sub(L) x SU(2)sub(R) x U(1) gauge theories with any number of flavours and with at most two scalar multiplets transforming as anti qq bilinears is analyzed. In order to get additional constraints on the structure of quark mass matrices all possible horizontal groups (continuous or discrete) are investigated. A complete classification of physically inequivalent quark mass matrices is given for four and six flavours. It is argued that the methods and results are also applicable in the case of dynamical symmetry breaking. Parity invariance and horizontal symmetry are shown to imply CP conservation on the Lagrangian level. For all non-trivial three-generation models there is spontaneous CP violation which in most cases turns out to be naturally small. (Auth.)

  16. Generalised Wigner surmise for (2 X 2) random matrices

    International Nuclear Information System (INIS)

    Chau Huu-Tai, P.; Van Isacker, P.; Smirnova, N.A.

    2001-01-01

    We present new analytical results concerning the spectral distributions for (2 x 2) random real symmetric matrices which generalize the Wigner surmise. The study of the statistical properties of spectra of realistic many-body Hamiltonians requires consideration of a random matrix ensemble whose elements are not independent or whose distribution is not invariant under orthogonal transformation of a chosen basis. In this letter we have concentrated on the properties of (2 x 2) real symmetric matrices whose elements are independent Gaussian variables with zero means but do not belong to the GOE. We have derived the distribution of eigenvalues for such a matrix, the nearest-neighbour spacing distribution which generalizes the Wigner surmise and we have calculated some important moments. (authors)

  17. Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets

    KAUST Repository

    Litvinenko, Alexander

    2017-09-03

    We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.

  18. Partial differential equations

    CERN Document Server

    Evans, Lawrence C

    2010-01-01

    This text gives a comprehensive survey of modern techniques in the theoretical study of partial differential equations (PDEs) with particular emphasis on nonlinear equations. The exposition is divided into three parts: representation formulas for solutions; theory for linear partial differential equations; and theory for nonlinear partial differential equations. Included are complete treatments of the method of characteristics; energy methods within Sobolev spaces; regularity for second-order elliptic, parabolic, and hyperbolic equations; maximum principles; the multidimensional calculus of variations; viscosity solutions of Hamilton-Jacobi equations; shock waves and entropy criteria for conservation laws; and, much more.The author summarizes the relevant mathematics required to understand current research in PDEs, especially nonlinear PDEs. While he has reworked and simplified much of the classical theory (particularly the method of characteristics), he primarily emphasizes the modern interplay between funct...

  19. Nonlinear Dirac Equations

    Directory of Open Access Journals (Sweden)

    Wei Khim Ng

    2009-02-01

    Full Text Available We construct nonlinear extensions of Dirac's relativistic electron equation that preserve its other desirable properties such as locality, separability, conservation of probability and Poincaré invariance. We determine the constraints that the nonlinear term must obey and classify the resultant non-polynomial nonlinearities in a double expansion in the degree of nonlinearity and number of derivatives. We give explicit examples of such nonlinear equations, studying their discrete symmetries and other properties. Motivated by some previously suggested applications we then consider nonlinear terms that simultaneously violate Lorentz covariance and again study various explicit examples. We contrast our equations and construction procedure with others in the literature and also show that our equations are not gauge equivalent to the linear Dirac equation. Finally we outline various physical applications for these equations.

  20. Differential equations for dummies

    CERN Document Server

    Holzner, Steven

    2008-01-01

    The fun and easy way to understand and solve complex equations Many of the fundamental laws of physics, chemistry, biology, and economics can be formulated as differential equations. This plain-English guide explores the many applications of this mathematical tool and shows how differential equations can help us understand the world around us. Differential Equations For Dummies is the perfect companion for a college differential equations course and is an ideal supplemental resource for other calculus classes as well as science and engineering courses. It offers step-by-step techniques, practical tips, numerous exercises, and clear, concise examples to help readers improve their differential equation-solving skills and boost their test scores.

  1. Degenerate nonlinear diffusion equations

    CERN Document Server

    Favini, Angelo

    2012-01-01

    The aim of these notes is to include in a uniform presentation style several topics related to the theory of degenerate nonlinear diffusion equations, treated in the mathematical framework of evolution equations with multivalued m-accretive operators in Hilbert spaces. The problems concern nonlinear parabolic equations involving two cases of degeneracy. More precisely, one case is due to the vanishing of the time derivative coefficient and the other is provided by the vanishing of the diffusion coefficient on subsets of positive measure of the domain. From the mathematical point of view the results presented in these notes can be considered as general results in the theory of degenerate nonlinear diffusion equations. However, this work does not seek to present an exhaustive study of degenerate diffusion equations, but rather to emphasize some rigorous and efficient techniques for approaching various problems involving degenerate nonlinear diffusion equations, such as well-posedness, periodic solutions, asympt...

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

  3. Contributions to Large Covariance and Inverse Covariance Matrices Estimation

    OpenAIRE

    Kang, Xiaoning

    2016-01-01

    Estimation of covariance matrix and its inverse is of great importance in multivariate statistics with broad applications such as dimension reduction, portfolio optimization, linear discriminant analysis and gene expression analysis. However, accurate estimation of covariance or inverse covariance matrices is challenging due to the positive definiteness constraint and large number of parameters, especially in the high-dimensional cases. In this thesis, I develop several approaches for estimat...

  4. Limit sets for the discrete spectrum of complex Jacobi matrices

    International Nuclear Information System (INIS)

    Golinskii, L B; Egorova, I E

    2005-01-01

    The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.

  5. Electrospun Phospholipid Fibers as Micro-Encapsulation and Antioxidant Matrices

    DEFF Research Database (Denmark)

    Shekarforoush, Elhamalsadat; Mendes, Ana Carina Loureiro; Baj, Vanessa

    2017-01-01

    Electrospun phospholipid (asolectin) microfibers were investigated as antioxidants and encapsulation matrices for curcumin and vanillin. These phospholipid microfibers exhibited antioxidant properties which increased after the encapsulation of both curcumin and vanillin. The total antioxidant...... capacity (TAC) and the total phenolic content (TPC) of curcumin/phospholipid and vanillin/phospholipid microfibers remained stable over time at different temperatures (refrigerated, ambient) and pressures (vacuum, ambient). ¹H-NMR confirmed the chemical stability of both encapsulated curcumin and vanillin...

  6. Parallel decompositions of Mueller matrices and polarimetric subtraction

    Directory of Open Access Journals (Sweden)

    Gil J.J.

    2010-06-01

    Full Text Available From a general formulation of the physically realizable parallel decompositions of the Mueller matrix M of a given depolarizing system, a procedure for determining the set of pure Mueller matrices susceptible to be subtracted from M is presented. This procedure provides a way to check if a given pure Mueller matrix N can be subtracted from M or not. If this check is positive, the value of the relative cross section of the subtracted component is also determined.

  7. Von Willebrand protein binds to extracellular matrices independently of collagen.

    OpenAIRE

    Wagner, D D; Urban-Pickering, M; Marder, V J

    1984-01-01

    Von Willebrand protein is present in the extracellular matrix of endothelial cells where it codistributes with fibronectin and types IV and V collagen. Bacterial collagenase digestion of endothelial cells removed fibrillar collagen, but the pattern of fibronectin and of von Willebrand protein remained undisturbed. Exogenous von Willebrand protein bound to matrices of different cells, whether rich or poor in collagen. von Willebrand protein also decorated the matrix of cells grown in the prese...

  8. Procedure for the analysis of americium in complex matrices

    International Nuclear Information System (INIS)

    Knab, D.

    1978-02-01

    A radioanalytical procedure for the analysis of americium in complex matrices has been developed. Clean separations of americium can be obtained from up to 100 g of sample ash, regardless of the starting material. The ability to analyze large masses of material provides the increased sensitivity necessary to detect americium in many environmental samples. The procedure adequately decontaminates from rare earth elements and natural radioactive nuclides that interfere with the alpha spectrometric measurements

  9. Computation of the q -th roots of circulant matrices

    Directory of Open Access Journals (Sweden)

    Pakizeh Mohammadi Khanghah

    2014-05-01

    Full Text Available In this paper‎, ‎we investigate the reduced form of circulant matrices‎ ‎and we show that the problem of computing the $q$-th roots of a‎ ‎nonsingular circulant matrix $A$ can be reduced to that of computing‎ ‎the $q$-th roots of two half size matrices $B-C$ and $B+C$. 

  10. Factoring symmetric indefinite matrices on high-performance architectures

    Science.gov (United States)

    Jones, Mark T.; Patrick, Merrell L.

    1990-01-01

    The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.

  11. A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices

    Czech Academy of Sciences Publication Activity Database

    Benzi, M.; Tůma, Miroslav

    2003-01-01

    Roč. 10, - (2003), s. 385-400 ISSN 1070-5325 R&D Projects: GA AV ČR IAA2030801; GA AV ČR IAA1030103 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * positive definite matrices * preconditioned conjugate gradient s * incomplete factorization * A-orthogonalization * SAINV Subject RIV: BA - General Mathematics Impact factor: 1.042, year: 2003

  12. Interactions between Food Additive Silica Nanoparticles and Food Matrices

    Directory of Open Access Journals (Sweden)

    Mi-Ran Go

    2017-06-01

    Full Text Available Nanoparticles (NPs have been widely utilized in the food industry as additives with their beneficial characteristics, such as improving sensory property and processing suitability, enhancing functional and nutritional values, and extending shelf-life of foods. Silica is used as an anti-caking agent to improve flow property of powered ingredients and as a carrier for flavors or active compounds in food. Along with the rapid development of nanotechnology, the sizes of silica fall into nanoscale, thereby raising concerns about the potential toxicity of nano-sized silica materials. There have been a number of studies carried out to investigate possible adverse effects of NPs on the gastrointestinal tract. The interactions between NPs and surrounding food matrices should be also taken into account since the interactions can affect their bioavailability, efficacy, and toxicity. In the present study, we investigated the interactions between food additive silica NPs and food matrices, such as saccharides, proteins, lipids, and minerals. Quantitative analysis was performed to determine food component-NP corona using HPLC, fluorescence quenching, GC-MS, and ICP-AES. The results demonstrate that zeta potential and hydrodynamic radius of silica NPs changed in the presence of all food matrices, but their solubility was not affected. However, quantitative analysis on the interactions revealed that a small portion of food matrices interacted with silica NPs and the interactions were highly dependent on the type of food component. Moreover, minor nutrients could also affect the interactions, as evidenced by higher NP interaction with honey rather than with a simple sugar mixture containing an equivalent amount of fructose, glucose, sucrose, and maltose. These findings provide fundamental information to extend our understanding about the interactions between silica NPs and food components and to predict the interaction effect on the safety aspects of food

  13. Discrete ergodic Jacobi matrices: Spectral properties and Quantum dynamical bounds

    OpenAIRE

    Han, Rui

    2017-01-01

    In this thesis we study discrete quasiperiodic Jacobi operators as well as ergodic operators driven by more general zero topological entropy dynamics. Such operators are deeply connected to physics (quantum Hall effect and graphene) and have enjoyed great attention from mathematics (e.g. several of Simon’s problems). The thesis has two main themes. First, to study spectral properties of quasiperiodic Jacobi matrices, in particular when off-diagonal sampling function has non-zero winding numbe...

  14. Updating Stiffness and Hysteretic Damping Matrices Using Measured Modal Data

    Directory of Open Access Journals (Sweden)

    Jiashang Jiang

    2018-01-01

    Full Text Available A new direct method for the finite element (FE matrix updating problem in a hysteretic (or material damping model based on measured incomplete vibration modal data is presented. With this method, the optimally approximated stiffness and hysteretic damping matrices can be easily constructed. The physical connectivity of the original model is preserved and the measured modal data are embedded in the updated model. The numerical results show that the proposed method works well.

  15. Updating Stiffness and Hysteretic Damping Matrices Using Measured Modal Data

    OpenAIRE

    Jiashang Jiang; Yongxin Yuan

    2018-01-01

    A new direct method for the finite element (FE) matrix updating problem in a hysteretic (or material) damping model based on measured incomplete vibration modal data is presented. With this method, the optimally approximated stiffness and hysteretic damping matrices can be easily constructed. The physical connectivity of the original model is preserved and the measured modal data are embedded in the updated model. The numerical results show that the proposed method works well.

  16. Wound care matrices for chronic leg ulcers: role in therapy

    Directory of Open Access Journals (Sweden)

    Sano H

    2015-07-01

    Full Text Available Hitomi Sano,1 Sachio Kouraba,2 Rei Ogawa11Department of Plastic, Reconstructive, and Aesthetic Surgery, Nippon Medical School, Tokyo, Japan; 2Sapporo Wound Care and Anti-Aging Laboratory, Sapporo, JapanAbstract: Chronic leg ulcers are a significant health care concern. Although deep wounds are usually treated by flap transfers, the operation is invasive and associates with serious complications. Skin grafts may be a less invasive means of covering wounds. However, skin grafts cannot survive on deep defects unless high-quality granulation tissue can first be generated in the defects. Technologies that generate high-quality granulation tissue are needed. One possibility is to use wound care matrices, which are bioengineered skin and soft tissue substitutes. Because they all support the healing process by providing a premade extracellular matrix material, these matrices can be termed “extracellular matrix replacement therapies”. The matrix promotes wound healing by acting as a scaffold for regeneration, attracting host cytokines to the wound, stimulating wound epithelialization and angiogenesis, and providing the wound bed with bioactive components. This therapy has lasting benefits as it not only helps large skin defects to be closed with thin skin grafts or patch grafts but also restores cosmetic appearance and proper function. In particular, since it acts as a layer that slides over the subcutaneous fascia, it provides skin elasticity, tear resistance, and texture. Several therapies and products employing wound care matrices for wound management have been developed recently. Some of these can be applied in combination with negative pressure wound therapy or beneficial materials that promote wound healing and can be incorporated into the matrix. To date, the clinical studies on these approaches suggest that wound care matrices promote spontaneous wound healing or can be used to facilitate skin grafting, thereby avoiding the need to use

  17. Estimating correlation and covariance matrices by weighting of market similarity

    OpenAIRE

    Michael C. M\\"unnix; Rudi Sch\\"afer; Oliver Grothe

    2010-01-01

    We discuss a weighted estimation of correlation and covariance matrices from historical financial data. To this end, we introduce a weighting scheme that accounts for similarity of previous market conditions to the present one. The resulting estimators are less biased and show lower variance than either unweighted or exponentially weighted estimators. The weighting scheme is based on a similarity measure which compares the current correlation structure of the market to the structures at past ...

  18. Solving Ordinary Differential Equations

    Science.gov (United States)

    Krogh, F. T.

    1987-01-01

    Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

  19. Reactimeter dispersion equation

    OpenAIRE

    A.G. Yuferov

    2016-01-01

    The aim of this work is to derive and analyze a reactimeter metrological model in the form of the dispersion equation which connects reactimeter input/output signal dispersions with superimposed random noise at the inlet. It is proposed to standardize the reactimeter equation form, presenting the main reactimeter computing unit by a convolution equation. Hence, the reactimeter metrological characteristics are completely determined by this unit hardware function which represents a transient re...

  20. Differential equations I essentials

    CERN Document Server

    REA, Editors of

    2012-01-01

    REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Differential Equations I covers first- and second-order equations, series solutions, higher-order linear equations, and the Laplace transform.

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

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

  3. A new evolution equation

    International Nuclear Information System (INIS)

    Laenen, E.

    1995-01-01

    We propose a new evolution equation for the gluon density relevant for the region of small x B . It generalizes the GLR equation and allows deeper penetration in dense parton systems than the GLR equation does. This generalization consists of taking shadowing effects more comprehensively into account by including multigluon correlations, and allowing for an arbitrary initial gluon distribution in a hadron. We solve the new equation for fixed α s . We find that the effects of multigluon correlations on the deep-inelastic structure function are small. (orig.)

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

  5. Unified triminimal parametrizations of quark and lepton mixing matrices

    International Nuclear Information System (INIS)

    He Xiaogang; Li Shiwen; Ma Boqiang

    2009-01-01

    We present a detailed study on triminimal parametrizations of quark and lepton mixing matrices with different basis matrices. We start with a general discussion on the triminimal expansion of the mixing matrix and on possible unified quark and lepton parametrization using quark-lepton complementarity. We then consider several interesting basis matrices and compare the triminimal parametrizations with the Wolfenstein-like parametrizations. The usual Wolfenstein parametrization for quark mixing is a triminimal expansion around the unit matrix as the basis. The corresponding quark-lepton complementarity lepton mixing matrix is a triminimal expansion around the bimaximal basis. Current neutrino oscillation data show that the lepton mixing matrix is very well represented by the tribimaximal mixing. It is natural to take it as an expanding basis. The corresponding zeroth order basis for quark mixing in this case makes the triminimal expansion converge much faster than the usual Wolfenstein parametrization. The triminimal expansion based on tribimaximal mixing can be converted to the Wolfenstein-like parametrizations discussed in the literature. We thus have a unified description between different kinds of parametrizations for quark and lepton sectors: the standard parametrizations, the Wolfenstein-like parametrizations, and the triminimal parametrizations.

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

  7. Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets

    KAUST Repository

    Litvinenko, Alexander

    2017-11-01

    The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\\\H$-) matrix format with computational cost $\\\\mathcal{O}(k^2n \\\\log^2 n/p)$ and storage $\\\\mathcal{O}(kn \\\\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.

  8. Study of remobilization polycyclic aromatic hydrocarbons (PAHs) in contaminated matrices

    International Nuclear Information System (INIS)

    Belkessam, L.; Vessigaud, S.; Laboudigue, A.; Vessigaud, S.; Perrin-Ganier, C.; Schiavon, M.; Denys, S.

    2005-01-01

    Polycyclic aromatic hydrocarbons (PAHs) originate from many pyrolysis processes. They are widespread environmental pollutants because some of them present toxic and genotoxic properties. In coal pyrolysis sites such as former manufactured gas plants and coke production plants, coal tar is a major source of PAHs. The management of such sites requires better understanding of the mechanisms that control release of PAHs to the biosphere. Determining total PAH concentrations is not sufficient since it does not inform about the pollutants availability to environmental processes. The fate and transport of PAHs in soil are governed by sorption and microbial processes which are well documented. Globally, enhancing retention of the compounds by a solid matrix reduces the risk of pollutant dispersion, but decreases their accessibility to microbial microflora. Conversely, the remobilization of organics from contaminated solid matrices represents a potential hazard since these pollutants can reach groundwater resources. However the available data are often obtained from laboratory experiments in which many field parameters can not be taken into account (long term, temperature, co-pollution, ageing phenomenon, heterogenous distribution of pollution). The present work focuses on the influence assessment and understanding of some of these parameters on PAHs remobilization from heavily polluted matrices in near-field conditions (industrial contaminated matrices, high contact time, ..). Results concerning effects of temperature and physical state of pollution (dispersed among the soil or condensed in small clusters or in coal tar) are presented. (authors)

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

  10. Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets

    KAUST Repository

    Litvinenko, Alexander; Sun, Ying; Genton, Marc G.; Keyes, David E.

    2017-01-01

    The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.

  11. Raven's matrices and working memory: a dual-task approach.

    Science.gov (United States)

    Rao, K Venkata; Baddeley, Alan

    2013-01-01

    Raven's Matrices Test was developed as a "pure" measure of Spearman's concept of general intelligence, g. Subsequent research has attempted to specify the processes underpinning performance, some relating it to the concept of working memory and proposing a crucial role for the central executive, with the nature of other components currently unclear. Up to this point, virtually all work has been based on correlational analysis of number of correct solutions, sometimes related to possible strategies. We explore the application to this problem of the concurrent task methodology used widely in developing the concept of multicomponent working memory. Participants attempted to solve problems from the matrices under baseline conditions, or accompanied by backward counting or verbal repetition tasks, assumed to disrupt the central executive and phonological loop components of working memory, respectively. As in other uses of this method, number of items correct showed little effect, while solution time measures gave very clear evidence of an important role for the central executive, but no evidence for phonological loop involvement. We conclude that this and related concurrent task techniques hold considerable promise for the analysis of Raven's matrices and potentially for other established psychometric tests.

  12. Large deviations of the maximum eigenvalue in Wishart random matrices

    International Nuclear Information System (INIS)

    Vivo, Pierpaolo; Majumdar, Satya N; Bohigas, Oriol

    2007-01-01

    We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X T X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value (λ) = N/c decreases for large N as ∼exp[-β/2 N 2 Φ - (2√c + 1: c)], where β = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M ≤ 1 and Φ - (x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions

  13. Large deviations of the maximum eigenvalue in Wishart random matrices

    Energy Technology Data Exchange (ETDEWEB)

    Vivo, Pierpaolo [School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH (United Kingdom) ; Majumdar, Satya N [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France); Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France)

    2007-04-20

    We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X{sup T}X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value ({lambda}) = N/c decreases for large N as {approx}exp[-{beta}/2 N{sup 2}{phi}{sub -} (2{radical}c + 1: c)], where {beta} = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M {<=} 1 and {phi}{sub -}(x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions.

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

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

  16. PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS

    Directory of Open Access Journals (Sweden)

    A. Beletsky

    2014-04-01

    Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.

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

  18. Aspheric surface testing by irradiance transport equation

    Science.gov (United States)

    Shomali, Ramin; Darudi, Ahmad; Nasiri, Sadollah; Asgharsharghi Bonab, Armir

    2010-10-01

    In this paper a method for aspheric surface testing is presented. The method is based on solving the Irradiance Transport Equation (ITE).The accuracy of ITE normally depends on the amount of the pick to valley of the phase distribution. This subject is investigated by a simulation procedure.

  19. The subgroups in the special linear group over a skew field that contain the group of diagonal matrices

    International Nuclear Information System (INIS)

    Bui Xuan Hai.

    1990-05-01

    For an arbitrary skew field T we study the lattice of subgroups of the special linear group Γ=SL(n,T) that contain the subgroup Δ-SD(n,T) of diagonal matrices with Dieudonne's determinant equal to 1. We show that the description of these subgroups is standard in the following sense: For any subgroup H,Δ≤H≤Γ there exists a unique unital net such that Γ(σ) ≤H≤N(σ), where Γ(σ) is the net subgroup that corresponds to the net σ and N(σ) is the normalizer of Γ(σ) in Γ. (author). 11 refs

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