Hermite–Hadamard Type Inequalities for Functions Whose Derivatives are Operator Convex

In this paper, we shall offer two inequalities for differentiable mappings which the induced maps by them on the set of Hermitian operators are operator convex. we establish some estimates of the right hand side of a Hermite–Hadamard type inequality in which such functions are involved.     

Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations

Some techniques suitable for the control of the solution error in the preconditioned conjugate gradient method are considered and compared. The estimation can be performed both in the course of the iterations and after their termination.The importance of such techniques follows from the non‐existence of some reasonable a priori error estimate for very ill‐conditioned linear systems when sufficient information about the right‐hand side vector is lacking. Hence, some a posteriori estimates are required, which make it possible to verify the quality of the solution obtained for a prescribed right‐hand side. The performance of the considered error control procedures is demonstrated using real‐world large‐scale linear systems arising in computational mechanics. Copyright © 2001 John Wiley & Sons, Ltd.     

Partial Regularity for Singular Solutions to the Monge‐Ampère Equation

We prove that solutions to the Monge‐Ampère inequality in ?ⁿ are strictly convex away from a singular set of Hausdorff (n‐1)‐dimensional measure zero. Furthermore, we show this is optimal by constructing solutions to det D²u = 1 with singular set of Hausdorff dimension as close as we like to n‐1. As a consequence we obtain W^2,1 regularity for the Monge‐Ampère equation with bounded right‐hand side and unique continuation for the Monge‐Ampère equation with sufficiently regular right‐hand side. © 2015 Wiley Periodicals, Inc.     

Global stability and the Hopf bifurcation for some class of delay differential equation

In this paper, we present an analysis for the class of delay differential equations with one discrete delay and the right‐hand side depending only on the past. We extend the results from paper by U. Fory? (Appl. Math. Lett. 2004; 17 (5):581–584), where the right‐hand side is a unimodal function. In the performed analysis, we state more general conditions for global stability of the positive steady state and propose some conditions for the stable Hopf bifurcation occurring when this steady state looses stability. We illustrate the analysis by biological examples coming from the population dynamics. Copyright © 2007 John Wiley & Sons, Ltd.     

Space filling with metric measure spaces

We show a sharp relationship between the existence of space filling mappings with an upper gradient in a Lorentz space and the Poincaré inequality in a general metric setting. As key examples, we consider these phenomena in Cantor diamond spaces and the Heisenberg groups.     

Isoperimetric inequality from the poisson equation via curvature

In this paper, we establish an isoperimetric inequality in a metric measure space via the Poisson equation. Let (X,d,μ) be a complete, pathwise connected metric space with locally Ahlfors Q‐regular measure, where Q > 1, that supports a local L²‐Poincaré inequality. We show that, for the Poisson equation Δu = g, if the local L^∞‐norm of the gradient Du can be bounded by the Lorentz norm L^Q,1 of g, then we obtain an isoperimetric inequality and a Sobolev inequality in (X,d,μ) with optimal exponents. By assuming a suitable curvature lower bound, we establish such optimal bounds on $\||Du|\|_{L^\infty_{\rm loc}}$ . © 2011 Wiley Periodicals, Inc.     

Harnack inequality and gradient estimate for G-SDEs with degenerate noise

In this paper, the Harnack inequality for G-SDEs with degenerate noise is derived by the method of coupling by change of the measure. Moreover, for any bounded and continuous function f, the gradient estimate ■ is obtained for the associated nonlinear semigroup ■. As an application of the Harnack inequality, we prove the existence of the weak solution to degenerate G-SDEs under some integrable condition. Finally, an example is presented. All of the above results extend the existing ones in the l...     

Fractional knapsack problems

The fractional knapsack problem to obtain an integer solution that maximizes a linear fractional objective function under the constraint of one linear inequality is considered. A modification of the Dinkelbach's algorithm [3] is proposed to exploit the fact that good feasible solutions are easily obtained for both the fractional knapsack problem and the ordinary knapsack problem. An upper bound of the number of iterations is derived. In particular it is clarified how optimal solutions depend on the right hand side of the constraint; a fractional knapsack problem reduces to an ordinary knapsack problem if the right hand side exceeds a certain bound.     

Pointwise Estimates for Laplace Equation. Applications to the Free Boundary of the Obstacle Problem with Dini Coefficients

In this paper we are interested in pointwise regularity of solutions to elliptic equations. In a first result, we prove that if the modulus of mean oscillation of Δu at the origin is Dini (in L ^p average), then the origin is a Lebesgue point of continuity (still in L ^p average) for the second derivatives D ² u. We extend this pointwise regularity result to the obstacle problem for the Laplace equation with Dini right hand side at the origin. Under these assumptions, we prove that the solution to the obstacle problem has a Taylor expansion up to the order 2 (in the L ^p average). Moreover we get a quantitative estimate of the error in this Taylor expansion for regular points of the free boundary. In the case where the right hand side is moreover double Dini at the origin, we also get a quantitative estimate of the error for singular points of the free boundary. Our method of proof is based on some decay estimates obtained by contradiction, using blow-up arguments and Liouville Theorems. In the case of singular points, our method uses moreover a refined monotonicity formula.      

Positive curvature property for some hypoelliptic heat kernels

In this note, we look at some hypoelliptic operators arising from nilpotent rank 2 Lie algebras. In particular, we concentrate on the diffusion generated by three Brownian motions and their three Lévy areas, which is the simplest extension of the Laplacian on the Heisenberg group H. In order to study contraction properties of the heat kernel, we show that, as in the case of the Heisenberg group, the restriction of the sub-Laplace operator acting on radial functions (which are defined in some precise way in the core of the paper) satisfies a non-negative Ricci curvature condition (more precisely a CD(0,∞) inequality), whereas the operator itself does not satisfy any CD(r,∞) inequality. From this we may deduce some useful, sharp gradient bounds for the associated heat kernel.     

Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides

We consider symmetric positive definite systems of linear equations with multiple right‐hand sides. The seed conjugate gradient (CG) method solves one right‐hand side with the CG method and simultaneously projects over the Krylov subspace thus developed for the other right‐hand sides. Then the next system is solved and used to seed the remaining ones. Rounding error in the CG method limits how much the seeding can improve convergence. We propose three changes to the seed CG method: only the first right‐hand side is used for seeding, this system is solved past convergence, and the roundoff error is controlled with some reorthogonalization. We will show that results are actually better with only one seeding, even in the case of related right‐hand sides. Controlling rounding error gives the potential for rapid convergence for the second and subsequent right‐hand sides. Polynomial preconditioning can help reduce storage needed for reorthogonalization. The new seed methods are applied to examples including matrices from quantum chromodynamics. Copyright © 2013 John Wiley & Sons, Ltd.     

Computing the conditioning of the components of a linear least‐squares solution

In this paper, we address the accuracy of the results for the overdetermined full rank linear least‐squares problem. We recall theoretical results obtained in (SIAM J. Matrix Anal. Appl. 2007; 29 (2):413–433) on conditioning of the least‐squares solution and the components of the solution when the matrix perturbations are measured in Frobenius or spectral norms. Then we define computable estimates for these condition numbers and we interpret them in terms of statistical quantities when the regression matrix and the right‐hand side are perturbed. In particular, we show that in the classical linear statistical model, the ratio of the variance of one component of the solution by the variance of the right‐hand side is exactly the condition number of this solution component when only perturbations on the right‐hand side are considered. We explain how to compute the variance–covariance matrix and the least‐squares conditioning using the libraries LAPACK (LAPACK Users' Guide (3rd edn). SIAM: Philadelphia, 1999) and ScaLAPACK (ScaLAPACK Users' Guide. SIAM: Philadelphia, 1997) and we give the corresponding computational cost. Finally we present a small historical numerical example that was used by Laplace (Théorie Analytique des Probabilités. Mme Ve Courcier, 1820; 497–530) for computing the mass of Jupiter and a physical application if the area of space geodesy. Copyright © 2008 John Wiley & Sons, Ltd.     

Non-existence for fractionally damped fractional differential problems

In this paper, we are concerned with a fractional differential inequality containing a lower order fractional derivative and a polynomial source term in the right hand side. A non-existence of non-trivial global solutions result is proved in an appropriate space by means of the test-function method. The range of blow up is found to depend only on the lower order derivative. This is in line with the well-known fact for an internally weakly damped wave equation that solutions will converge to solutions of the parabolic part.     

Convolution Inequalities in Lorentz Spaces

In this paper we study boundedness of the convolution operator in different Lorentz spaces. We obtain the limit case of the Young-O’Neil inequality in the classical Lorentz spaces. We also investigate the convolution operator in the weighted Lorentz spaces.     

一个与投影体相关的锥体积不等式

本文研究了一个与投影体相关的锥体积不等式.利用凸函数的梯度性质,获得了n维欧氏空间中关于任意原点对称凸体的一个锥体积不等式,推进了Schneider投影问题的解决.     

时滞微分方程的稳定性

该文利用时滞Gronwall Bellman不等式得到了一些判定时滞微分方程稳定性的充分条件, 特别地,为方便应用,对线性时滞微分方程给出了一些仅与方程右端项有关的简明判据.     

Estimates for a solution to one differential inequality

In a domain D = Ω × (?T,T) we consider a differential inequality whose left-hand side contains a linear second-order hyperbolic operator with coefficients depending only on x ∈ ? ⁿ, n ≥ 2, and the right-hand side contains the modulus of the gradient of the sought function. We supplement the inequality with the Cauchy data on the lateral part of the boundary of D and consider the problem of estimating a solution to the differential inequality satisfying the Cauchy data. We establish the estimate under some assumptions that involves the upper bound of the sectional curvatures of the Riemannian space associated with the differential operator, the Riemannian diameter of Ω, and the length of the interval (?T,T). The result is generalized to the case of compact domains bounded from above and below by characteristic surfaces.     

The expected number of extreme points of a random linear program

There has been increasing attention recently on average case algorithmic performance measures since worst case measures can be qualitatively quite different. An important characteristic of a linear program, relating to Simplex Method performance, is the number of vertices of the feasible region. We show 2 ⁿ to be an upper bound on the mean number of extreme points of a randomly generated feasible region with arbitrary probability distributions on the constraint matrix and right hand side vector. The only assumption made is that inequality directions are chosen independently in accordance with a series of independent fair coin tosses.We would like to thank the Institute of Pure and Applied Mathematics in Rio de Janeiro for supporting the authors' collaboration that led to this paper.