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.     

Spectral boundary controllability of networks of strings

In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.     

Dynamic study of gated saturable absorbers

The capability of gated saturable absorbers for single-pulse selection is studied theoretically using the classical space-time-dependent rate-equation model. The dynamics of operation is followed experimentally by the well-known pump—probe technique. Comparing the theoretical and experimental results, it is found that gated saturable absorbers can efficiently be used for pulse forming and pulse selection of pulses longer than picosecond.     

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