Asymptotics of the solution to the conductivity equation in the presence of adjacent circular inclusions with finite conductivities

We consider the conductivity problem in the presence of adjacent circular inclusions with constant conductivities. When two inclusions get closer and their conductivities degenerate to zero or infinity, the gradient of the solution can be arbitrary large. In this paper we derive an asymptotic formula of the solution, which characterizes the gradient blow-up of the solution in terms of conductivities of inclusions as well as the distance between inclusions. The asymptotic formula is expressed in bipolar coordinates in terms of the Lerch transcendent function, and it is valid for inclusions with arbitrary constant conductivities. We illustrate our results with numerical calculations.     

Radially Symmetric Solutions of the <Emphasis Type="Italic">p</Emphasis>-Laplace Equation with Gradient Terms

We consider the Dirichlet problem for the p-Laplace equation with nonlinear gradient terms. In particular, these gradient terms cannot satisfy the Bernstein—Nagumo conditions. We obtain some sufficient conditions that guarantee the existence of a global bounded radially symmetric solution without any restrictions on the growth of the gradient term. Also we present some conditions on the function simulating the mass forces, which allow us to obtain a bounded radially symmetric solution under presence of an arbitrary nonlinear source.     

Boundedness of the solutions to non-linear systems with Morrey data

We consider non-linear elliptic systems satisfying componentwise coercivity condition. The non-linear terms have controlled growths with respect to the solution and its gradient, while the behaviour in x is governed by functions in Morrey spaces. We firstly prove essential boundedness of the weak solution and then we obtain Morrey regularity of its gradient.     

Controllability for a parabolic equation with a nonlinear term involving the state and the gradient

In this article, we consider the controllability of a quasi-linear heat equation involving gradient terms with Dirichlet boundary conditions in a bounded domain of R^N. The results are established by using the variational methods, the related duality theory and Kakutani Fixed-point Theorem.     

On the asymptotic exactness of error estimators for linear triangular finite elements

Summary This paper deals with a-posteriori error estimates for piecewise linear finite element approximations of elliptic problems. We analyze two estimators based on recovery operators for the gradient of the approximate solution. By using superconvergence results we prove their asymptotic exactness under regularity assumptions on the mesh and the solution.One of the estimators can be easily computed in terms of the jumps of the gradient of the finite element approximation. This estimator is equivalent to the error in the energy norm under rather general conditions. However, we show that for the asymptotic exactness, the regularity assumption on the mesh is not merely technical. While doing this, we analyze the relation between superconvergence and asymptotic exactness for some particular examples.     

Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities

We derive necessary and sufficient conditions for optimality of a problem with a pseudoconvex objective function, provided that a finite number of solutions are known. In particular, we see that the gradient of the objective function at every minimizer is a product of some positive function and the gradient of the objective function at another fixed minimizer. We apply this condition to provide several complete characterizations of the solution sets of set-constrained and inequality-constrained nonlinear programming problems with pseudoconvex and second-order pseudoconvex objective functions in terms of a known solution. Additionally, we characterize the solution sets of the Stampacchia and Minty variational inequalities with a pseudomonotone-star map, provided that some solution is known.     

Estimates of the <Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript> norm of the error in the conjugate gradient algorithm

In this paper we derive a formula relating the norm of the l₂ error to the A-norm of the error in the conjugate gradient algorithm. Approximating the different terms in this formula, we obtain an estimate of the l₂ norm during the conjugate gradient iterations. Numerical experiments are given for several matrices. AMS subject classification 65F10, 65G20     

A blowup criterion for the compressible nematic liquid crystal flows in dimension two

In this paper, we establish a blowup criterion for the two-dimensional compressible nematic liquid crystal flows. The criterion is given in terms of the density and the gradient of direction field, where the later satisfies the Serrin-type blowup criterion. For this result, we do not need the initial density to be positive.     

Infinite Dimensional Systems of Particles with Interactions Given by Dunkl Operators

Potential Analysis - Firstly we consider a finite dimensional Markov semigroup generated by Dunkl Laplacian with drift terms. For this semigroup we prove gradient bounds involving a symmetrised...     

An ODE approach for fractional Dirichlet problems with gradient nonlinearity

Mathematische Zeitschrift - In the present work we study existence of solutions of fractional Dirichlet problems in the presence of coercive gradient terms with growth comparable and slightly...     

A descent hybrid conjugate gradient method based on the memoryless BFGS update

In this work, we present a new hybrid conjugate gradient method based on the approach of the convex hybridization of the conjugate gradient update parameters of DY and HS+, adapting a quasi-Newton philosophy. The computation of the hybrization parameter is obtained by minimizing the distance between the hybrid conjugate gradient direction and the self-scaling memoryless BFGS direction. Furthermore, a significant property of our proposed method is that it ensures sufficient descent independent of the accuracy of the line search. The global convergence of the proposed method is established provided that the line search satisfies the Wolfe conditions. Our numerical experiments on a set of unconstrained optimization test problems from the CUTEr collection indicate that our proposed method is preferable and in general superior to classic conjugate gradient methods in terms of efficiency and robustness.     

Existence and Multiplicity for Elliptic Problems with Quadratic Growth in the Gradient

We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove that the solutions are in general not unique. The case where the zero order term has the opposite sign was already intensively studied and the uniqueness is the rule.     

Riesz potential estimates for a general class of quasilinear equations

We consider solutions to nonlinear elliptic equations with measure data and general growth and ellipticity conditions of degenerate type, as considered in Lieberman (Commun Partial Differ Equ 16:311–361, 1991); we prove pointwise gradient bounds for solutions in terms of linear Riesz potentials. As a direct consequence, we get optimal conditions for the continuity of the gradient.     

A blow-up criterion for classical solutions to the compressible Navier-Stokes equations

In this paper, we obtain a blow-up criterion for classical solutions to the 3-D compressible Navier-Stokes equations just in terms of the gradient of the velocity, analogous to the Beal-Kato-Majda criterion for the ideal incompressible flow. In addition, the initial vacuum is allowed in our case.     

Step-by-step solving schemes based on scalar auxiliary variable and invariant energy quadratization approaches for gradient flows

Numerical Algorithms - In this paper, we propose several novel numerical techniques to deal with nonlinear terms in gradient flows. These step-by-step solving schemes, termed 3S-SAV and 3S-IEQ...     

Morse-type inequalities for dynamical systems and the Witten Laplacian

We provide an analytic proof of Morse-type inequalities for vector fields determining a Morse decomposition with normally hyperbolic dynamics. In the demonstration we reduce the problem to the gradient case using a Morse-Bott Lyapunov function and then apply Schrödinger operator techniques. This yields an explicit construction of the cohomology complex of the manifold in terms of the invariant sets of the Morse decomposition associated with the vector field.     

An optimal control problem in image processing

As a starting point, we present a control problem in mammographic image processing which leads to non-standard penalty terms and involves a degenerate parabolic PDE which has to be controlled in the coefficients. We then discuss the classical conditional gradient method from constrained optimization and propose a generalization for non-convex functionals which covers the conditional gradient method as well as the recently proposed iterative shrinkage method of Daubechies, Defrise and De Mol for the solution of linear inverse problems with sparsity promoting penalty terms. We prove that this new algorithm converges. This also gives a deeper understanding of the iterative shrinkage method. Further, we show an application to the above-mentioned control problem in image processing. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Efficient modified techniques of invariant energy quadratization approach for gradient flows

Two novel and efficient modified techniques based on recently developed stabilized invariant energy quadratization (IEQ) approach to deal with nonlinear terms in gradient flows are proposed in this paper. We proved the unconditional energy stability for a class of gradient flows and their semi-discrete schemes carefully and rigorously. One of the contributions for this approach is that we succeeded in finding suitable positive preserving functions in square root and do not need to add a positive constant which cannot be fixed before computing. Secondly, all nonlinear terms can be treated semi-explicitly, and one only needs to solve three decoupled linear equations with constant coefficients at each time step. Finally, several numerical simulations are demonstrated to verify the accuracy and efficiency of our proposed schemes.     

A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization

In this paper, we propose a three-term conjugate gradient method via the symmetric rank-one update. The basic idea is to exploit the good properties of the SR1 update in providing quality Hessian approximations to construct a conjugate gradient line search direction without the storage of matrices and possess the sufficient descent property. Numerical experiments on a set of standard unconstrained optimization problems showed that the proposed method is superior to many well-known conjugate gradient methods in terms of efficiency and robustness.