Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Prediction of chromatographic retention of metal complexes from stability constants measured by ion chromatography

Chromatographia - A theoretical model is used to predict retention times of divalent metal cations in single-column ion chromatography using one or more ligands in the eluent. Stability constants...     

Separation of 23 dansylated amino acids by micellar electrokinetic chromatography at low temperature

Summary The baseline separation of 23 dansylated amino acids (including 3 didansylated species) is reported. Lowering of the analysis temperature and fine control of the surfactant concentration were essential in obtaining this result. Calibration graphs with good linearity were obtained.     

Isometries of the Dirichlet space among the composition operators

We show that every composition operator which is an isometry of the Dirichlet space is induced by a univalent full map of the disk into itself that fixes the origin. This is an analogue of the Hardy space result for inner functions due to Nordgren. The proof relies on the Stone-Weierstrass theorem and the Riesz representation theorem.

     

Sufficiency in Quantum Statistical Inference

This paper attempts to develop a theory of sufficiency in the setting of non-commutative algebras parallel to the ideas in classical mathematical statistics. Sufficiency of a coarse-graining means that all information is extracted about the mutual relation of a given family of states. In the paper sufficient coarse-grainings are characterized in several equivalent ways and the non-commutative analogue of the factorization theorem is obtained. As an application we discuss exponential families. Our factorization theorem also implies two further important results, previously known only in finite Hilbert space dimension, but proved here in generality: the Koashi-Imoto theorem on maps leaving a family of states invariant, and the characterization of the general form of states in the equality case of strong subadditivity. Supported by the EU Research Training Network Quantum Probability with Applications to Physics, Information Theory and Biology and Center of Excellence SAS Physics of Information I/2/2005. Supported by the Hungarian grant OTKA T032662     

On a conjecture of Cox and Katz

This note shows that a certain toric quotient of the quintic Calabi-Yau threefold in provides a counterexample to a recent conjecture of Cox and Katz concerning nef cones of toric hypersurfaces. Received: 8 February 2001; in final form: 17 September 2001 / Published online: 1 February 2002