We consider the mixed q-Gaussian algebras introduced by Speicher which are generated by the variables Xi = li + l ∗ i , i = 1, . . . , N, where l ∗ i lj − qij lj l ∗ i = δi,j and −1 < qij = qji < 1. Using the free monotone transport theorem of Guionnet and Shlyakhtenko, we show that the mixed q-Gaussian von Neumann algebras are isomorphic to the free group von Neumann algebra L(FN ), provided that maxi,j |qij | is small enough. Similar results hold in the reduced C ∗ -algebra setting. The proof relies on some estimates which are generalizations of Dabrowski’s results for the special case qij ≡ q.

The purpose of this paper is to establish a new method for proving the convergence of the particle method applied to the Camassa-Holm (CH) equation. The CH equation is a strongly nonlinear, bi-Hamiltonian, completely integrable model in the context of shallow water waves. The equation admits solutions that are nonlinear superpositions of traveling waves that have a discontinuity in the first derivative at their peaks and therefore are called peakons. This behavior admits several diverse scientific applications, but introduce difficult numerical challenges. To accurately capture these solutions, one may apply the particle method to the CH equation. Using the concept of space-time bounded variation, we show that the particle solution converges to a global weak solution of the CH equation for positive Radon measure initial data. Read More: http://www.worldscientific.com/doi/abs/10.1142/9789814417099_0033

In this paper, a new type of staggered discontinuous Galerkin methods for the three dimensional Maxwells equations is developed and analyzed. The spatial discretization is based on staggered Cartesian grids so that many good properties are obtained. First of all, our method has the advantages that the numerical solution preserves the electromagnetic energy and automatically fulfills a discrete version of the Gauss law. Moreover, the mass matrices are diagonal, thus time marching is explicit and is very efficient. Our method is high order accurate and the optimal order of convergence is rigorously proved. It is also very easy to implement due to its Cartesian structure and can be regarded as a generalization of the classical Yees scheme as well as the quadrilateral edge finite elements. Furthermore, a superconvergence result, that is the convergence rate is one order higher at interpolation nodes, is proved

In this paper, we present an efficient QR algorithm for solving the linear response eigenvalue problem H x= x, where H is -symmetric with respect to 0= diag (I n, I n). Based on newly introduced -orthogonal transformations, the QR algorithm preserves the -symmetric structure of H throughout the whole process, and thus guarantees the computed eigenvalues to appear pairwise (, ) as they should. With the help of a newly established implicit -orthogonality theorem, we incorporate the implicit multi-shift technique to accelerate the convergence of the QR algorithm. Numerical experiments are given to show the effectiveness of the algorithm.

In this paper, we prove a general existence theorem for properly embedded minimal surfaces with free boundary in any compact Riemannian 3‐manifold M with boundary ∂M. These minimal surfaces are either disjoint from ∂M or meet ∂M orthogonally. The main feature of our result is that there is no assumptions on the curvature of M or convexity of ∂M. We prove the boundary regularity of the minimal surfaces at their free boundaries. Furthermore, we define a topological invariant, the filling genus, for compact 3‐manifolds with boundary and show that we can bound the genus of the minimal surface constructed above in terms of the filling genus of the ambient manifold M. Our proof employs a variant of the min‐max construction used by Colding and De Lellis on closed embedded minimal surfaces, which were first developed by Almgren and Pitts.