Expokit: A software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

Transfer matrix eigenvalues of the anisotropic multiparametric U model

A multiparametric extension of the anisotropic U model is discussed which maintains integrability. The R-matrix solving the Yang-Baxter equation is obtained through a twisting construction applied to the underlying U-q(sl (2/1)) superalgebraic structure which introduces the additional free parameters that arise in the model. Three forms of Bethe ansatz solution for the transfer matrix eigenvalues are given which we show to be equivalent.

High-breakdown linear discriminant analysis

The classification rules of linear discriminant analysis are defined by the true mean vectors and the common covariance matrix of the populations from which the data come. Because these true parameters are generally unknown, they are commonly estimated by the sample mean vector and covariance matrix of the data in a training sample randomly drawn from each population. However, these sample statistics are notoriously susceptible to contamination by outliers, a problem compounded by the fact that the outliers may be invisible to conventional diagnostics. High-breakdown estimation is a procedure designed to remove this cause for concern by producing estimates that are immune to serious distortion by a minority of outliers, regardless of their severity. In this article we motivate and develop a high-breakdown criterion for linear discriminant analysis and give an algorithm for its implementation. The procedure is intended to supplement rather than replace the usual sample-moment methodology of discriminant analysis either by providing indications that the dataset is not seriously affected by outliers (supporting the usual analysis) or by identifying apparently aberrant points and giving resistant estimators that are not affected by them.

Stability of linear difference and differential inclusions

Any given n X n matrix A is shown to be a restriction, to the A-invariant subspace, of a nonnegative N x N matrix B of spectral radius p(B) arbitrarily close to p(A). A difference inclusion x(k+1) is an element of Ax(k), where A is a compact set of matrices, is asymptotically stable if and only if A can be extended to a set B of nonnegative matrices B with \ \B \ \ (1) < 1 or \ \B \ \ (infinity) < 1. Similar results are derived for differential inclusions.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Noise-free scattering of the quantized electromagnetic field from a dispersive linear dielectric

We study the scattering of the quantized electromagnetic field from a linear, dispersive dielectric using the scattering formalism for quantum fields. The medium is modeled as a collection of harmonic oscillators with a number of distinct resonance frequencies. This model corresponds to the Sellmeir expansion, which is widely used to describe experimental data for real dispersive media. The integral equation for the interpolating field in terms of the in field is solved and the solution used to find the out field. The relation between the ill and out creation and annihilation operators is found that allows one to calculate the S matrix for this system. In this model, we find that there are absorption bands, but the input-output relations are completely unitary. No additional quantum-noise terms are required.

Linear ketenimines. Variable structures of C,C-dicyanoketenimines and C,C-bis-sulfonylketenimines

C,C-Dicyanoketenimines 10a-c were generated by flash vacuum thermolysis of ketene NS-acetals 9a-c or by thermal or photochemical decomposition of alpha-azido-,beta-cyanocinnamonitrile 11. In the latter reaction, 3,3-dicyano-2-phenyl-1-azirine 12 is also formed. IR spectroscopy of the keteniminines isolated in Ar matrixes or as neat films, NMR spectroscopy of 10c, and theoretical calculations (B3LYP/6-31G*) demonstrate that these ketenimines have variable geometry, being essentially linear along the CCN-R framework in polar media (neat films and solution), but in the gas phase or Ar matrix they are bent, as is usual for ketenimines. Experiments and calculations agree that a single CN substituent as in 13 is not enough to enforce linearity, and sulfonyl groups are less effective that cyano groups in causing linearity. C,C-Bis(methylsulfonyl)ketenimines 4-5 and a C-cyano-C-(methylsulfonyl)ketenimine 15 are not linear. The compound p-O2NC6H4N=C= C(COOMe)2 previously reported in the literature is probably somewhat linearized along the CCNR moiety. A computational survey (B3LYP/6-31G*) of the inversion barrier at nitrogen indicates that electronegative C-substituents dramatically lower the barrier; this is also true of N-acyl substituents. Increasing polarity causes lower barriers. Although N-alkylbis(methylsulfonyl)ketenimines are not calculated to be linear, the barriers are so low that crystal lattice forces can induce planarity in N-methylbis(methylsulfonyl)ketenimine 3.

Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

Orientation of the genetic variance-covariance matrix and the fitness surface for multiple male sexually selected traits

Stabilizing selection has been predicted to change genetic variances and covariances so that the orientation of the genetic variance-covariance matrix (G) becomes aligned with the orientation of the fitness surface, but it is less clear how directional selection may change G. Here we develop statistical approaches to the comparison of G with vectors of linear and nonlinear selection. We apply these approaches to a set of male sexually selected cuticular hydrocarbons (CHCs) of Drosophila serrata. Even though male CHCs displayed substantial additive genetic variance, more than 99% of the genetic variance was orientated 74.9degrees away from the vector of linear sexual selection, suggesting that open-ended female preferences may greatly reduce genetic variation in male display traits. Although the orientation of G and the fitness surface were found to differ significantly, the similarity present in eigenstructure was a consequence of traits under weak linear selection and strong nonlinear ( convex) selection. Associating the eigenstructure of G with vectors of linear and nonlinear selection may provide a way of determining what long-term changes in G may be generated by the processes of natural and sexual selection.

Peptide quantification by matrix-assisted laser desorption ionisation time-of-flight mass spectrometry: Investigations of the cyclotide kalata B1 in biological fluids

A rapid method has been developed for the quantification of the prototypic cyclotide kalata B I in water and plasma utilizing matrix-assisted laser desorption ionisation time-of-flight (MALDI-TOF) mass spectrometry. The unusual structure of the cyclotides means that they do not ionise as readily as linear peptides and as a result of their low ionisation efficiency, traditional LC/MS analyses were not able to reach the levels of detection required for the quantification of cyclotides in plasma for pharmacokinetic studies. MALDI-TOF-MS analysis showed linearity (R-2 > 0.99) in the concentration range 0.05-10 mu g/mL with a limit of detection of 0.05 mu g/mL (9 fmol) in plasma. This paper highlights the applicability of MALDI-TOF mass spectrometry for the rapid and sensitive quantification of peptides in biological samples without the need for extensive extraction procedures. (c) 2005 Elsevier B.V. All rights reserved.

A simple proof of the strong subadditivity inequality

Arguably the deepest fact known about the von Neumann entropy, the strong subadditivity inequality is a potent hammer in the quantum information theorist's toolkit. This short tutorial describes a simple proof of strong subadditivity due to Petz [Rep. on Math. Phys. 23 (1), 57-65 (1986)]. It assumes only knowledge of elementary linear algebra and quantum mechanics.

Greenberger-Horne-Zeilinger-type and W-type entangled coherent states: Generation and Bell-type inequality tests without photon counting

We study Greenberger-Horne-Zeilinger-type (GHZ-type) and W-type three-mode entangled coherent states. Both types of entangled coherent states violate Mermin's version of the Bell inequality with threshold photon detection (i.e., without photon counting). Such an experiment can be performed using linear optics elements and threshold detectors with significant Bell violations for GHZ-type entangled coherent states. However, to demonstrate Bell-type inequality violations for W-type entangled coherent states, additional nonlinear interactions are needed. We also propose an optical scheme to generate W-type entangled coherent states in free-traveling optical fields. The required resources for the generation are a single-photon source, a coherent state source, beam splitters, phase shifters, photodetectors, and Kerr nonlinearities. Our scheme does not necessarily require strong Kerr nonlinear interactions; i.e., weak nonlinearities can be used for the generation of the W-type entangled coherent states. Furthermore, it is also robust against inefficiencies of the single-photon source and the photon detectors.

Determining the effective dimensionality of the genetic variance-covariance matrix

Determining the dimensionality of G provides an important perspective on the genetic basis of a multivariate suite of traits. Since the introduction of Fisher's geometric model, the number of genetically independent traits underlying a set of functionally related phenotypic traits has been recognized as an important factor influencing the response to selection. Here, we show how the effective dimensionality of G can be established, using a method for the determination of the dimensionality of the effect space from a multivariate general linear model introduced by AMEMIYA (1985). We compare this approach with two other available methods, factor-analytic modeling and bootstrapping, using a half-sib experiment that estimated G for eight cuticular hydrocarbons of Drosophila serrata. In our example, eight pheromone traits were shown to be adequately represented by only two underlying genetic dimensions by Amemiya's approach and factor-analytic modeling of the covariance structure at the sire level. In, contrast, bootstrapping identified four dimensions with significant genetic variance. A simulation study indicated that while the performance of Amemiya's method was more sensitive to power constraints, it performed as well or better than factor-analytic modeling in correctly identifying the original genetic dimensions at moderate to high levels of heritability. The bootstrap approach consistently overestimated the number of dimensions in all cases and performed less well than Amemiya's method at subspace recovery.

On the origin of a trace inequality

Numerous authors are apparently unaware that bounds on the trace of a matrix product presented in 1995 were originally published in 1990.

A scheme for efficient quantum computation wtih linear optics

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.