Extremals in some classes of Carnot groups

Let G be a Carnot group and D={e 1,e 2 } be a bracket generating left invariant distribution on G.In this paper,we obtain two main results.We first prove that there only exist normal minimizers in G if the type of D is (2,1,...,1) or (2,1,...,1,2).This immediately leads to the fact that there are only normal minimizers in the Goursat manifolds.As one corollary,we also obtain that there are only normal minimizers when dim G 5.We construct a class of Carnot groups such as that of type (2,1,...,1,2,n 0,...,n a) with n 0 1,n i 0,i=1,...,a,in which there exist strictly abnormal extremals.This implies that,for any given manifold of dimension n 6,we can find a class of n-dimensional Carnot groups having strictly abnormal minimizers.We conclude that the dimension n=5 is the border line for the existence and nonexistence of strictly abnormal extremals.Our main technique is based on the equations for the normal and abnormal extremals.     

CONVERGENCE ANALYSIS ON ITERATIVE METHODS FOR SEMIDEFINITE SYSTEMS

The convergence analysis on the general iterative methods for the symmetric and positive semidefinite problems is presented in this paper. First, formulated are refined necessary and sumcient conditions for the energy norm convergence for iterative methods. Some illustrative examples for the conditions are also provided. The sharp convergence rate identity for the Gauss-Seidel method for the semidefinite system is obtained relying only on the pure matrix manipulations which guides us to obtain the convergence rate identity for the general successive subspace correction methods. The convergence rate identity for the successive subspace correction methods is obtained under the new conditions that the local correction schemes possess the local energy norm convergence. A convergence rate estimate is then derived in terms of the exact subspace solvers and the parameters that appear in the conditions. The uniform convergence of multigrid method for a model problem is proved by the convergence rate identity. The work can be regradled as unified and simplified analysis on the convergence of iteration methods for semidefinite problems [8, 9].     

Convergence of cascade algorithm for individual initial function and arbitrary refinement masks

The cascade algorithm plays an important role in computer graphics and wavelet analysis. For any initial function φn, a cascade sequence (φn)n∞=1 constructed by the iteration φn=Cnφn-1=1,2.. where Cαis defined by g∈Lp(R) In this paper, we characterize the convergence of a cascade sequence in terms of a sequence of functions and in terms of joint spectral radius. As a consequence, it is proved that any convergent cascade sequence has a convergence rate of geometry, i.e., ||φ 1-φn||Lp(R)=O((？)n)for some (？)∈(0.1i). The condition of sum rules for the mask is not required. Finally, an example is presented to illustrate our theory.     

Convergence rate of multiple fractional Stratonovich type integral for Hurst parameter less than 1/2

In this paper, we have investigated the problem of the convergence rate of the multiple integralwhere f ∈ Cn+1([0, T ]n) is a given function, π is a partition of the interval [0, T ] and {BtHi ,π} is a family of interpolation approximation of fractional Brownian motion BtH with Hurst parameter H < 1/2. The limit process is the multiple Stratonovich integral of the function f . In view of known results, the convergence rate is different for different multiplicity n. Under some mild conditions, we obtain that the uniform convergence rate is 2H in the mean square sense, where is the norm of the partition generating the approximations.     

Spectral gap and convergence rate for discrete-time Markov chains

Let P be a transition matrix which is symmetric with respect to a measure π.The spectral gap of P in L2(π)-space,denoted by gap(P),is defined as the distance between 1 and the rest of the spectrum of P.In this paper,we study the relationship between gap(P) and the convergence rate of Pn.When P is transient,the convergence rate of P n is equal to 1 gap(P).When P is ergodic,we give the explicit upper and lower bounds for the convergence rate of Pn in terms of gap(P).These results are extended to L∞(π)-space.     

Convergence and Optimality of Adaptive Regularization for Ill-posed Deconvolution Problems in Infinite Spaces

The adaptive regularization method is first proposed by Ryzhikov et al. in [6] for the deconvolution in elimination of multiples which appear frequently in geoscience and remote sensing. They have done experiments to show that this method is very effective. This method is better than the Tikhonov regularization in the sense that it is adaptive, i.e., it automatically eliminates the small eigenvalues of the operator when the operator is near singular. In this paper, we give theoretical analysis about the adaptive regularization. We introduce an a priori strategy and an a posteriori strategy for choosing the regularization parameter, and prove regularities of the adaptive regularization for both strategies. For the former, we show that the order of the convergence rate can approach O（｜｜n｜｜^4v/4v＋1） for some 0 〈 v 〈 1, while for the latter, the order of the convergence rate can be at most O（｜｜n｜｜^2v/2v＋1） for some 0 〈 v 〈 1.     

Approximation of Nearest Common Fixed Point of Nonexpansive Mappings in Hilbert Spaces

The purpose of this paper is to study the convergence problem of the iteration scheme xn＋l = λn＋1y ＋ （1 - λn＋1）Tn＋1xn for a family of infinitely many nonexpansive mappings T1, T2,... in a Hilbert space. It is proved that under suitable conditions this iteration scheme converges strongly to the nearest common fixed point of this family of nonexpansive mappings. The results presented in this paper extend and improve some recent results.     

A Note on Restricted Representations of the Witt Superalgebras

Let F be an algebraically closed field of prime characteristic p 〉 3, and W（n） the Witt superalgebra over F, which is the Lie superalgebra of superderivations of the Grassmann algebra in n indeterminates. The dimensions of simple atypical modules in the restricted supermodule category for W（n） are precisely calculated in this paper, and thereby the dimensions of all simple modules can be precisely given. Moreover, the restricted supermodule category for W（n） is proved to have one block.     

Predictor-Corrector Smoothing Methods for Monotone LCP

In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1],the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1‘ is obtained under the assumption of nonsingularity of generalized Jacobian of Φ(x,y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The efficiency of the two methods is tested by numerical experiments.     

Strong Converse Inequality for Left Gamma Quasi-Interpolants

The rate of convergence for the Gamma operators cannot be faster than O(1/n). In order to obtain much faster convergence, quasi-interpolants in the sense of Sablonniere are considered. For the first time in the theory of quasi-interpolants, the strong converse inequality is solved in sup-norm with the K-functional K_λ~α(f, t~(2r)) (0≤λ≤1, 0<α< 2r).     

Limiting properties of the second order Ginzburg–Landau minimizers

The author studies the weak convergence for the gradient of the minimizers for a second order energy functional when the parameter tends to 0. And this paper is also concerned with the location of the zeros and the blow-up points of the gradient of the minimizers of this functional. Finally, the strong convergence of the gradient of the radial minimizers is obtained.     

Global W2,p Solutions of GBBM Equations on Unbounded Domain

In this paper we study the initial boundary value problem of GBBM equations on unbounded domain u_t - Δu_t = div f(u) u(x,0) = u_0(x) u|_{∂Ω} = 0 and corresponding Cauchy problem. Under the conditions: f( s) ∈ C^sup1 and satisfies (H)\qquad |f'(s)| ≤ C|s|^ϒ, 0 ≤ ϒ ≤ \frac{2}{n-2} if n ≥ 3; 0 ≤ ϒ < ∞ if n = 2 u_0(x) ∈ W^{2,p}(Ω) ∩ W^{2,2}(Ω) ∩ W^{1,p}_0(Ω)(W^{2,p}(R^n) ∩ W^{2,2}(R^n) for Cauchy problem), 2 ≤ p < ∞, we obtain the existence and uniqueness of global solution u(x, t) ∈ W^{1,∞}(0, T; W^{2,p}(Ω) ∩ W^{2,2}(Ω) ∩ W^{1,p}_0(Ω))(W^{1,∞}(0, T; W^{2,p}(R^n) ∩ W^{2,2} (R^n)) for Cauchy problem), so the results of [1] and [2] are generalized and improved in essential.     

Asymptotic analysis for the radial minimizer of a second-order energy functional

The convergence for the radial minimizers of a second-order energy functional, when the parameter tends to 0 is studied. And the location of the zeros of the radial minimizers of this functional is presented. Based on this result, the uniqueness of the radial minimizer is discussed.     

A numerical method for computing singular minimizers

Summary. A numerical method, with truncation methods as a special case, for computing singular minimizers in variational problems is described. It is proved that the method can avoid Lavrentiev phenomenon and detect singular minimizers. The convergence of the method is also established. Numerical results on a 2-D problem are given. Received September 21, 1994     

Uniqueness Theorem of the Regularizable Redial Ginzburg-Landau Type Minimizers

The author proves the uniqueness of the regularizable radial minimizers of a Ginzburg-Landau type functional in the case n - 1 < p < n,and the location of the zeros of the regularizable radial minimizers of this functional is discussed.     

Global W2,p (2<=p

This paper studies the initial-boundary value problem of GBBM equations u_t - Δu_t = div f(u) \qquad\qquad\qquad(a) u(x, 0) = u_0(x)\qquad\qquad\qquad(b) u |∂Ω = 0 \qquad\qquad\qquad(c) in arbitrary dimensions, Ω ⊂ R^n. Suppose that. f(s) ∈ C¹ and |f'(s)| ≤ C (1+|s|^ϒ), 0 ≤ ϒ ≤ \frac{2}{n-2} if n ≥ 3, 0 ≤ ϒ < ∞ if n = 2, u_0 (x) ∈ W^{2⋅p}(Ω) ∩ W^{1⋅p}_0(Ω) (2 ≤ p < ∞), then ∀T > 0 there exists a unique global W^{2⋅p} solution u ∈ W^{1,∞}(0, T; W{2⋅p}(Ω)∩ W^{1⋅p}_0(Ω)), so the known results are generalized and improved essentially.     

严格循环与强不可约分解

Let W be an injective unilateral weighted shift, and let W(n) be the orthogonal direct sum of n copies of W. In this paper, we prove that, if the commutant of W is strictly cyclic, then W(n) has a unique (SI) decomposition with respect to similarity for every natural number n.     

Minimizers of Higher Order Gauge Invariant Functionals

We introduce higher order variants of the Yang–Mills functional that involve \((n-2)\)-th order derivatives of the curvature. We prove coercivity and smoothness of critical points in Uhlenbeck gauge in dimensions \(\mathrm {dim}M\le 2n\). These results are then used to establish the existence of smooth minimizers on a given principal bundle \(P\rightarrow M\) for subcritical dimensions \(\mathrm {dim}M<2n\). In the case of critical dimension \(\mathrm {dim}M=2n\) we construct a minimizer on a bundle which might differ from the prescribed one, but has the same Chern classes \(c_1,\ldots ,c_{n-1}\). A key result is a removable singularity theorem for bundles carrying a \(W^{n-1,2}\)-connection. This generalizes a recent result by Petrache and Rivière.     

Convergence theory for nonconvex stochastic programming with an application to mixed logit

Monte Carlo methods have extensively been used and studied in the area of stochastic programming. Their convergence properties typically consider global minimizers or first-order critical points of the sample average approximation (SAA) problems and minimizers of the true problem, and show that the former converge to the latter for increasing sample size. However, the assumption of global minimization essentially restricts the scope of these results to convex problems. We review and extend these results in two directions: we allow for local SAA minimizers of possibly nonconvex problems and prove, under suitable conditions, almost sure convergence of local second-order solutions of the SAA problem to second-order critical points of the true problem. We also apply this new theory to the estimation of mixed logit models for discrete choice analysis. New useful convergence properties are derived in this context, both for the constrained and unconstrained cases, and associated estimates of the simulation bias and variance are proposed. Research Fellow of the Belgian National Fund for Scientific Research     

W2,ploc(\Omega)\cap C1,α(\bar Ω) Viscosity Solutions of Neumann Problems for Fully Nonlinear Elliptic Equations

In this paper we study fully nonlinear elliptic equations F(D²u, x) = 0 in Ω ⊂ R^n with Neumann boundary conditions \frac{∂u}{∂v} = a(x)u under the rather mild structure conditions and without the concavity condition. We establish the global C^{1,Ω} estimates and the interior W^{2,p} estimates for W^{2,q}(Ω) solutions (q > 2n) by introducing new independent variables, and moreover prove the existence of W^{2,p}_{loc}(Ω)∩ C^{1,α}(\bar \Omega} viscosity solutions by using the accretive operator methods, where p E (0, 2), α ∈ (0, 1}.