Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Wave turbulence and intermittency in directional wave fields

The evolution of surface gravity waves is driven by nonlinear interactions that trigger an energy cascade similarly to the one observed in hydrodynamic turbulence. This process, known as wave turbulence, has been found to display anomalous scaling with deviation from classical turbulent predictions due to the emergence of coherent and intermittent structures on the water surface. In the ocean, waves are spread over a wide range of directions, with a consequent attenuation of the nonlinear properties. A laboratory experiment in a large wave facility is presented to discuss the sensitivity of wave turbulence on the directional properties of model wave spectra. Results show that the occurrence of coherent and intermittent structures become less likely with the broadening of the wave directional spreading. There is no evidence, however, that intermittency completely vanishes.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

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.     

Estimation of multivariate binary density using orthogonal functions

In this paper, the authors studied certain properties of the estimate of Liang and Krishnaiah (1985, J. Multivariate Anal. 16, 162–172) for multivariate binary density. An alternative shrinkage estimate is also obtained. The above results are generalized to general orthonormal systems.     

Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

Bilateral generating functions and operational methods

Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here.