82 resultados para Matrices genéricas
Resumo:
We evaluated the hydrodynamic performance of kangaroo aortic valve matrices (KMs) (19, 21, and 23 mm), as potential scaffolds in tissue valve engineering using a pulsatile left heart model at low and high cardiac outputs (COs) and heart rates (HRs) of 60 and 90 beats/min. Data were measured in two samples of each type, pooled in two CO levels (2.1 +/- 0.7 and 4.2 +/- 0.6 L/min; mean +/- standard errors on the mean), and analyzed using analysis of variance with CO level, HR, and valve type as fixed factors and compared to similar porcine matrices (PMs). Transvalvular pressure gradient (Delta P) was a function of HR (P < 0.001) and CO (P < 0.001) but not of valve type (P = 0.39). Delta P was consistently lower in KMs but not significantly different from PMs. The effective orifice area and performance index of kangaroo matrices was statistically larger for all sizes at both COs and HRs.
Resumo:
We consider the problems of computing the power and exponential moments EXs and EetX of square Gaussian random matrices X=A+BWC for positive integer s and real t, where W is a standard normal random vector and A, B, C are appropriately dimensioned constant matrices. We solve the problems by a matrix product scalarization technique and interpret the solutions in system-theoretic terms. The results of the paper are applicable to Bayesian prediction in multivariate autoregressive time series and mean-reverting diffusion processes.
Resumo:
Software simulation models are computer programs that need to be verified and debugged like any other software. In previous work, a method for error isolation in simulation models has been proposed. The method relies on a set of feature matrices that can be used to determine which part of the model implementation is responsible for deviations in the output of the model. Currrently these feature matrices have to be generated by hand from the model implementation, which is a tedious and error-prone task. In this paper, a method based on mutation analysis, as well as prototype tool support for the verification of the manually generated feature matrices is presented. The application of the method and tool to a model for wastewater treatment shows that the feature matrices can be verified effectively using a minimal number of mutants.
Resumo:
The A(n-1)((1)) trigonometric vertex model with generic non-diagonal boundaries is studied. The double-row transfer matrix of the model is diagonalized by algebraic Bethe ansatz method in terms of the intertwiner and the corresponding face-vertex relation. The eigenvalues and the corresponding Bethe ansatz equations are obtained.
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.
Resumo:
This is the second in a series of articles whose ultimate goal is the evaluation of the matrix elements (MEs) of the U(2n) generators in a multishell spin-orbit basis. This extends the existing unitary group approach to spin-dependent configuration interaction (CI) and many-body perturbation theory calculations on molecules to systems where there is a natural partitioning of the electronic orbital space. As a necessary preliminary to obtaining the U(2n) generator MEs in a multishell spin-orbit basis, we must obtain a complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The zero-shift coefficients were obtained in the first article of the series. in this article, we evaluate the nonzero shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. We then demonstrate that the one-shell versions of these coefficients may be obtained by taking the Gelfand-Tsetlin limit of the two-shell formulas. These coefficients,together with the zero-shift types, then enable us to write down formulas for the U(2n) generator matrix elements in a two-shell spin-orbit basis. Ultimately, the results of the series may be used to determine the many-electron density matrices for a partitioned system. (C) 1998 John Wiley & Sons, Inc.
Resumo:
Using Reshetikhin's construction for multiparametric quantum algebras we obtain the associated multiparametric quantum spin chains. We show that under certain restrictions these models can be mapped to quantum spin chains with twisted boundary conditions, We illustrate how this general formalism applier; to construct multiparametric versions of the supersymmetric t-J and Li models.
Resumo:
A class of integrable boundary terms for the eight-state supersymmetric U model are presented by solving the graded reflection equations. The boundary model is solved by using the coordinate Bethe ansatz method and the Bethe ansatz equations are obtained. (C) 1998 Elsevier Science B.V.
Resumo:
A general graded reflection equation algebra is proposed and the corresponding boundary quantum inverse scattering method is formulated. The formalism is applicable to all boundary lattice systems where an invertible R-matrix exists. As an application, the integrable open-boundary conditions for the q-deformed supersymmetric U model of strongly correlated electrons are investigated. The diagonal boundary K-matrices are found and a class of integrable boundary terms are determined. The boundary system is solved by means of the coordinate space Bethe ansatz technique and the Bethe ansatz equations are derived. As a sideline, it is shown that all R-matrices associated with a quantum affine superalgebra enjoy the crossing-unitarity property. (C) 1998 Elsevier Science B.V.
Resumo:
The integrable open-boundary conditions for the model of three coupled one-dimensional XY spin chains are considered in the framework of the quantum inverse scattering method. The diagonal boundary K-matrices are found and a class of integrable boundary terms is determined. The boundary model Hamiltonian is solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are derived. (C) 1998 Elsevier Science B.V.
Resumo:
We clarify the extra signs appearing in the graded quantum Yang-Baxter reflection equations, when they are written in a matrix form. We find the boundary K-matrix for the Perk-Schultz six-vertex model, thus give a general solution to the graded reflection equation associated with it.
Resumo:
New classes of integrable boundary conditions for the q-deformed (or two-parameter) supersymmetric U model are presented. The boundary systems are solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are derived. (C) 1998 Elsevier Science B.V.
Resumo:
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.