No abstract uploaded!

No abstract uploaded!

In this paper we generalize an interpolation result due to J.-O. Strömberg and A. Torchinsky to the case of one-sided Hardy spaces. This generalization is important in the study of the weak type (1,1) for lateral strongly singular operators. We shall need an atomic decomposition in which for every atom there exists another atom supported contiguously at its right. In order to obtain this decomposition we have developed a rather simple technique to break up an atom into a sum of others atoms.

We discuss smoothing effects of homogeneous dispersive equations with constant coefficients. In the case where the characteristic root is positively homogeneous, time-global smoothing estimates are known. It is also known that a dispersiveness condition is necessary for smoothing effects. We show time-global smoothing estimates where the characteristic root is not necessarily homogeneous. Our results give a sufficient condition so that lower order terms can be absorbed by the principal part, and also indicate that smoothing effects may be caused by lower order terms in the case where the dispersiveness condition fails to hold.

Recent years have witnessed the rapid development of block coordinate update (BCU) methods, which are particularly suitable for problems involving large-sized data and/or variables. In optimization, BCU first appears as the coordinate descent method that works well for smooth problems or those with separable nonsmooth terms and/or separable constraints. As nonseparable constraints exist, BCU can be applied under primal-dual settings. In the literature, it has been shown that for weakly convex problems with nonseparable linear constraints, BCU with fully Gauss--Seidel updating rule may fail to converge and that with fully Jacobian rule can converge sublinearly. However, empirically the method with Jacobian update is usually slower than that with Gauss--Seidel rule. To maintain their advantages, we propose a hybrid Jacobian and Gauss--Seidel BCU method for solving linearly constrained multiblock