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.

Thermal characterization of polyester-melamine coating matrices prepared under nonisothermal conditions

Thermal analysis methods (differential scanning calorimetry, thermogravimetric analysis, and dynamic mechanical thermal analysis) were used to characterize the nature of polyester-melamine coating matrices prepared under nonisothermal, high-temperature, rapid-cure conditions. The results were interpreted in terms of the formation of two interpenetrating networks with different glass-transition temperatures (a cocondensed polyester-melamine network and a self-condensed melamine-melamine network), a phenomenon not generally seen in chemically similar, isothermally cured matrices. The self-condensed network manifested at high melamine levels, but the relative concentrations of the two networks were critically dependent on the cure conditions. The optimal cure (defined in terms of the attainment of a peak metal temperature) was achieved at different oven temperatures and different oven dwell times, and so the actual energy absorbed varied over a wide range. Careful control of the energy absorption, by the selection of appropriate cure conditions, controlled the relative concentrations of the two networks and, therefore, the flexibility and hardness of the resultant coatings. (C) 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Cbem 41: 1603-1621, 2003.

Comparison of three commercial sparse-matrix crystallization screens

Sparse-matrix sampling using commercially available crystallization screen kits has become the most popular way of determining the preliminary crystallization conditions for macromolecules. In this study, the efficiency of three commercial screening kits, Crystal Screen and Crystal Screen 2 (Hampton Research), Wizard Screens I and II (Emerald BioStructures) and Personal Structure Screens 1 and 2 (Molecular Dimensions), has been compared using a set of 19 diverse proteins. 18 proteins yielded crystals using at least one crystallization screen. Surprisingly, Crystal Screens and Personal Structure Screens showed dramatically different results, although most of the crystallization formulations are identical as listed by the manufacturers. Higher molecular weight polyethylene glycols and mixed precipitants were found to be the most effective precipitants in this study.

Wurst: a protein threading server with a structural scoring function, sequence profiles and optimized substitution matrices

Wurst is a protein threading program with an emphasis on high quality sequence to structure alignments (http://www.zbh.uni-hamburg.de/wurst). Submitted sequences are aligned to each of about 3000 templates with a conventional dynamic programming algorithm, but using a score function with sophisticated structure and sequence terms. The structure terms are a log-odds probability of sequence to structure fragment compatibility, obtained from a Bayesian classification procedure. A simplex optimization was used to optimize the sequence-based terms for the goal of alignment and model quality and to balance the sequence and structural contributions against each other. Both sequence and structural terms operate with sequence profiles.

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.

Enhanced detection-guided NLMS estimation of sparse FIR-modeled signal channels

In various signal-channel-estimation problems, the channel being estimated may be well approximated by a discrete finite impulse response (FIR) model with sparsely separated active or nonzero taps. A common approach to estimating such channels involves a discrete normalized least-mean-square (NLMS) adaptive FIR filter, every tap of which is adapted at each sample interval. Such an approach suffers from slow convergence rates and poor tracking when the required FIR filter is "long." Recently, NLMS-based algorithms have been proposed that employ least-squares-based structural detection techniques to exploit possible sparse channel structure and subsequently provide improved estimation performance. However, these algorithms perform poorly when there is a large dynamic range amongst the active taps. In this paper, we propose two modifications to the previous algorithms, which essentially remove this limitation. The modifications also significantly improve the applicability of the detection technique to structurally time varying channels. Importantly, for sparse channels, the computational cost of the newly proposed detection-guided NLMS estimator is only marginally greater than that of the standard NLMS estimator. Simulations demonstrate the favourable performance of the newly proposed algorithm. © 2006 IEEE.

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.

Constructing internationally comparable real income aggregates by combining sparse benchmark data with annual national accounts data: A state-space approach

The importance of availability of comparable real income aggregates and their components to applied economic research is highlighted by the popularity of the Penn World Tables. Any methodology designed to achieve such a task requires the combination of data from several sources. The first is purchasing power parities (PPP) data available from the International Comparisons Project roughly every five years since the 1970s. The second is national level data on a range of variables that explain the behaviour of the ratio of PPP to market exchange rates. The final source of data is the national accounts publications of different countries which include estimates of gross domestic product and various price deflators. In this paper we present a method to construct a consistent panel of comparable real incomes by specifying the problem in state-space form. We present our completed work as well as briefly indicate our work in progress.

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.