QRT: A Qr-based tridiagonalization algorithm for nonsymmetric matrices

The stable similarity reduction of a nonsymmetric square matrix to tridiagonal form has been a long-standing problem in numerical linear algebra. The biorthogonal Lanczos process is in principle a candidate method for this task, but in practice it is confined to sparse matrices and is restarted periodically because roundoff errors affect its three-term recurrence scheme and degrade the biorthogonality after a few steps. This adds to its vulnerability to serious breakdowns or near-breakdowns, the handling of which involves recovery strategies such as the look-ahead technique, which needs a careful implementation to produce a block-tridiagonal form with unpredictable block sizes. Other candidate methods, geared generally towards full matrices, rely on elementary similarity transformations that are prone to numerical instabilities. Such concomitant difficulties have hampered finding a satisfactory solution to the problem for either sparse or full matrices. This study focuses primarily on full matrices. After outlining earlier tridiagonalization algorithms from within a general framework, we present a new elimination technique combining orthogonal similarity transformations that are stable. We also discuss heuristics to circumvent breakdowns. Applications of this study include eigenvalue calculation and the approximation of matrix functions.

A study of the effects of postcure treatments on polyester-melamine coating matrices

The effect of postcure high energy (gamma), ultraviolet (UV) and thermal treatment on the properties of polyester-melamine clearcoats of a range of compositions has been investigated. Two initial cure conditions were used, of which one was '' optimally '' cured and the other undercured. It was found that postcure treatments, particularly gamma and UV, led to coatings of similar mechanical and thermal properties irrespective of initial cure, although the change in properties on postcure treatment was greater for the under-cured samples. The results were interpreted in terms of the effect of the treatments on the structure of the crosslinked matrices. The study suggests the possibility of the development of a dual-cure process for polyester-melamines, whereby cure optimization and property improvement can be achieved. This could also be used to '' correct '' for small variations in thermal cure levels brought about by adventitious online fluctuations in cure oven conditions.

Hydrodynamic evaluation of kangaroo aortic valve matrices for tissue valve engineering

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.

On Hamilton cycle decomposition of 6-regular circulant graphs

The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n.

A scalarization technique for computing the power and exponential moments of gaussian random matrices

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.

Mutation analysis to verify feature matrices for isolating errors in simulation models

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.

Exact solution of the A(n-1)((1)) trigonometric vertex model with non-diagonal open boundaries

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.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

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.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. II. The two-shell nonzero shift ACCs and U(2n) generator MEs

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.

Integrable multiparametric quantum spin chains

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.

Integrable eight-state supersymmetric U model with boundary terms and its Bethe ansatz solution

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.

Integrable open-boundary conditions for the q-deformed supersymmetric U model of strongly correlated electrons

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.

An open-boundary integrable model of three coupled XY spin chains

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.