A Functional Equation Of J.A. Baker Involving Integral Means

The functional equation $$f(x)={1\over 2}\int^{x+1}_{x-1}f(t)\ dt\ \ \ {\rm for}\ \ \ x\ \in\ {\rm R}$$ has the linear functions ?(x) = a + bx (a, b ∈ ?) as trivial solutions. It is shown that there are two kinds of nontrivial solutions, (i) ?(x) = eλ_i ^x (i = 1, 2, …), where the λ_i∈ ? are the fixed points of the map z ? sinh z, and (ii) C^∞-solutions ? for which the values in the interval [?1,1] can be prescribed arbitrarily, but with the provision that ?^(j)(? 1) = ?^(j)(0) = ?^(j)(1) = 0 for all j = 0, 1, 2 …     

The zero dispersion limit of the korteweg-de vries equation for initial potentials with non-trivial reflection coefficient

The inverse scattering method is used to determine the distribution limit as ? → 0 of the solution u(x, t, ?) of the initial value problem. U_t ? 6uu_x + ?²u_xxx = 0, u(x, 0) = v(x), where v(x) is a positive bump which decays sufficiently fast as x x→±α. The case v(x) ? 0 has been solved by Peter D. Lax and C. David Levermore [8], [9], [10]. The computation of the distribution limit of u(x, t, ?) as ? → 0 is reduced to a quadratic maximization problem, which is then solved.     

Optimization under nonnegativity constraints

Summary The problem [maximizef(x), subject tox0] is considered. McCormick has proposed a theoretically convergent feasible direction method that takes advantage of the special structure of this problem. However, the one-dimensional subproblem of the method requires an exact solution, which cannot be obtained by a finite procedure. Goldstein has used in unconstrained optimization a one-dimensional subproblem for which any point within certain real line intervals is an acceptable solution. A similar subproblem is applied to McCormick's method and convergence to aK-T point is proven. A finite search procedure for the subproblem and a finite stopping rule for the algorithm are given.This paper is an outgrowth of a Ph.D. dissertation [3], submitted to Yale University in 1973. I am thankful to my advisors, Professors R. Mifflin (chairman), H. M. Wagner, and M. Shubik, for their guidance and assistance     

Asymptotical Formulas For Solutions Of Linear Differential Systems Of The First Order

In this paper a system of differential equations y′ ? A(·,λ)y = 0 is considered on the finite interval [a,b] where λ ∈ C, A(·, λ):= λ A₁+ A ₀ +λ _?1A_?1(·,λ) and A ₁,A ₀, A _{? 1} are n × n matrix-functions. The main assumptions: A ₁ is absolutely continuous on the interval [a, b], A ₀ and A _{- 1}(·,λ) are summable on the same interval when ¦λ¦ is sufficiently large; the roots φ₁(x),…,φ_n (x) of the characteristic equation det (φ E — A ₁) = 0 are different for all x ∈ [a,b] and do not vanish; there exists some unlimited set Ω ? C on which the inequalities Re(λφ₁(x)) ≤ … ≤ Re (λφ_n(x)) are fulfilled for all x ∈ [a,b] and for some numeration of the functions φ_j(x). The asymptotic formula of the exponential type for a fundamental matrix of solutions of the system is obtained for sufficiently large ¦λ¦. The remainder term of this formula has a new type dependence on properties of the coefficients A ₁ (x), A _o (x) and A _{- 1} (x).     

非线性常微分方程初值问题的间断有限元

该文用m次间断有限元求解非线性常微分方程初值问题u'=f(x,u),u(0)=u₀,用单元正交投影及正交性质证明了当m≥1时,m次间断有限元在节点x_j的左极限U(x_j-0)有超收敛估计(u-U(x_j-0)=O(h^2m+1),在每个单元内的m+1阶特征点x_ji上有高一阶的超收敛性(u-U)(x_ji)=O(h^m+2).     

Univariate multiquadric approximation: Quasi-interpolation to scattered data

The univariate multiquadric function with centerx _j ∈R has the form {? _j (x)=[(x?x _j )²+c ²]^1/2, x∈R} wherec is a positive constant. We consider three approximations, namely, ? _A f, ?_? f, and ? _C f, to a function {f(x),x ₀≤x≤x _N } from the space that is spanned by the multiquadrics {? _j :j=0, 1, ...,N} and by linear polynomials, the centers {x _j :j=0, 1,...,N} being given distinct points of the interval [x ₀,x _N ]. The coefficients of ? _A f and ?_? f depend just on the function values {f(x _j ):j=0, 1,...,N}. while ? _A f, ? _C f also depends on the extreme derivativesf′(x ₀) andf′(x _N ). These approximations are defined by quasi-interpolation formulas that are shown to give good accuracy even if the distribution of the centers in [x ₀,x _N ] is very irregular. Whenf is smooth andc=O(h), whereh is the maximum distance between adjacent centers, we find that the error of each quasi-interpolant isO(h ²|logh|) away from the ends of the rangex ₀≤x≤x _N. Near the ends of the range, however, the accuracy of ? _A f and ?_? f is onlyO(h), because the polynomial terms of these approximations are zero and a constant, respectively. Thus, some of the known accuracy properties of quasiinterpolation when there is an infinite regular grid of centers {x _j =jh:j ∈F} given by Buhmann (1988), are preserved in the case of a finite rangex ₀≤x≤x _N , and there is no need for the centers {x _j :j=0, 1, ...,N} to be equally spaced.     

A degree condition for the circumference of a graph

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let m be any positive integer. Suppose G is a 2-connected graph with vertices x₁,…,x_n and edge set E that satisfies the property that, for any two integers j and k with j < k, x_jx_k ? E, d(x_i) ? j and d(x_k) ? K - 1, we have (1) d(x_i) + d(x_k ? m if j + k ? n and (2) if j + k < n, either m ? n or d(x_j) + d(x_k) ? min(K + 1,m). Then c(G) ? min(m, n). This result unifies previous results of J.C. Bermond and M. Las Vergnas, respectively.     

A method to accelerate the rate of convergence of a class of optimization algorithms

Supposez ∈ E ⁿ is a solution to the optimization problem minimizeF(x) s.t.x ∈ E ⁿ and an algorithm is available which iteratively constructs a sequence of search directions {s _j } and points {x _j } with the property thatx _j →z. A method is presented to accelerate the rate of convergence of {x _j } toz provided that n consecutive search directions are linearly independent. The accelerating method uses n iterations of the underlying optimization algorithm. This is followed by a special step and then another n iterations of the underlying algorithm followed by a second special step. This pattern is then repeated. It is shown that a superlinear rate of convergence applies to the points determined by the special step. The special step which uses only first derivative information consists of the computation of a search direction and a step size. After a certain number of iterations a step size of one will always be used. The acceleration method is applied to the projection method of conjugate directions and the resulting algorithm is shown to have an (n + 1)-step cubic rate of convergence. The acceleration method is based on the work of Best and Ritter [2].     

Δ-Monotone arrangements of real numbers

Given a set of M × N real numbers, can these always be labeled as x_i,j; i = 1,…, M; j = 1,…, N; such that x_i+1,j+1 ? x_i+1,j ? x_i,j+1 + x_ij ≥ 0, for every (i, j) where 1 ≤ i ≤ M ? 1, 1 ≤ j ≤ N ? 1? For M = N = 3, or smaller values of M, N it is shown that there is a “uniform” rule. However, for max(M, N) > 3 and min(M, N) ≥ 3, it is proved that no uniform rule can be given. For M = 3, N = 4 a way of labeling is demonstrated. For general M, N the problem is still open although, for a special case where all the numbers are 0's and 1's, a solution is given.     

On additive maps of prime rings satisfying the engel condition

Let A be a prime ring with nonzero right ideal R and f : R → A an additive map. Next, let k,n₁, n₂,…,n_k be natural numbers. Suppose that […[[(x), xn¹], xn²],…, xn^k]=0 for all x ∈ R. Then it is proved in Theorem 1.1 that [f(x),x]=0 provided that either char(A)=0 or char (A)> n₁+n₂+ …+n_k Theorem 1.1 is a simultaneous generalization of a number of results proved earlier.     

Note on the local growth of iterated polynomials

The local behavior of the iterates of a real polynomial is investigated. The fundamental result may be stated as follows: THEOREM. Let x_i, for i=1, 2, ..., n+2, be defined recursively by x_i+1=f(x_i), where x₁ is an arbitrary real number and f is a polynomial of degree n. Let x_i+1?x_i≧1 for i=1, ..., n + 1. Then for all i, 1 ≦i≦n, and all k, 1≦k≦n+1?i, $$ - \frac{{2^{k - 1} }}{{k!}}< f\left[ {x_1 ,... + x_{i + k} } \right]< \frac{{x_{i + k + 1} - x_{i + k} + 2^{k - 1} }}{{k!}},$$ where f[x_i, ..., x_i+k] denotes the Newton difference quotient. As a consequence of this theorem, the authors obtain information on the local behavior of the solutions of certain nonlinear difference equations. There are several cases, of which the following is typical: THEOREM. Let {x_i}, i = 1, 2, 3, ..., be the solution of the nonlinear first order difference equation x_i+1=f(x_i) where x₁ is an arbitrarily assigned real number and f is the polynomial \(f(x) = \sum\limits_{j = 0}^n {a_j x^j } ,n \geqq 2\) . Let δ be positive with δ^n?1=|2^n?1/n!a_n|. Then, if n is even and a_n<0, there do not exist n + 1 consecutive increments Δx_i=x_i+1?x_i in the solution {x_i} with Δx_i≧δ. The special case in which the iterated polynomial has integer coefficients leads to a “nice” upper bound on a generalization of the van der Waerden numbers. Ap _k -sequence of length n is defined to be a strictly increasing sequence of positive integers {x ₁, ...,x _n } for which there exists a polynomial of degree at mostk with integer coefficients and satisfyingf(x _j )=x _j+1 forj=1, 2, ...,n?1. Definep _k (n) to be the least positive integer such that if {1, 2, ...,p _k (n)} is partitioned into two sets, then one of the two sets must contain ap _k -sequence of lengthn. THEOREM. p_n?2(n)≦(n!)^(n?2)!/2.     

Feedback Control Design for Systems with <Emphasis Type="Italic">x</Emphasis>-Discontinuous Right-Hand Side

The problem of the admissible feedback synthesis for nonlinear systems with discontinuous right-hand side is considered. Sufficient conditions for solvability of this problem are proved. The neighborhood of the origin is broken in a finite number of domains G ₁,G ₂,…,G _k . In each G _j a control system \(\dot{x}=f_{j}(x,u)\) is given. The problem of the admissible feedback synthesis is completely studied for control systems of the form \(\dot{x}=a_{j}(x)+\gamma_{j}(x,u) b_{j}(x)\), where \(u\in \Omega_{j} \subset \Bbb{R}\) for x∈G _j . The controllability function method is used to construct the feedback control.     

Vector packing in finite dimensional vector spaces

Let m be an integer ? 2. The effect of crowding m unit vectors x₁,…,x_m into the real Euclidean space R_n of n dimensions is investigated. In particular, several upper bounds for the quantity min_i≠j∥x_i ? x_j∥ are obtained. These are simpler than any previously known and, at least in some cases, almost as sharp. The results have application to the so-called maximum-dispersal (or “misanthrope”) problem, an open problem recently popularized by Klee.     

LEGENDRE TRANSFORMATIONS AND CARTAN FORMS IN THE CALCULUS OF VARIATIONS OF MULTIPLE INTEGRALS

ABSTRACT

(PART II): In terms of a given Hamiltonian function the 1-form w = dH + ?_j|dπ^j is defined, where {?_j:j = 1,…, n} denotes an invariant basis of the planes of the distribution D_n. The latter is said to be canonical if w = 0 (which is analogous to the definition of Hamiltonian vector fields in symplectic geometry). This condition is equivalent to two sets of canonical equations that are expressed explicitly in term of the derivatives of H with respect to its positional arguments. The distribution D_n is said to be pseudo-Lagrangian if dπ^j(?_j,V_h) = 0; if D_n, is both canonical and pseudo-Lagrangian it is integrable and such that H = const. on each leaf of the resulting foliation. The Cartan form associated with this construction [9] is defined a II = π² ? ? πⁿ. If π is closed, the distribution D_N is integrable, and the exterior system {π^j} admits the representation ψ^j = dS^j in terms of a set of 0-forms S^j on M. If, in addition, the distribution D_N is canonical, these functions satisfy a single first order Hamilton-Jacobi equation, and conversely. Finally, a complete figure is constructed on the basis of the assumptions that (i) the Cartan form be closed, and (ii) that the distribution D_n, be both canonical and integrable. The last of these requirements implies the existence of N functions ψ^A that depend on x^h and N parameters w^B, whose derivatives are given by ?ψ^A (x^h, w^B)/?x^j = B^A _j (x^h, ψ^B (x^h,w^B)). The complete figure then consists of two complementary foliations: the leaves of the first are described by the functions ψ^A and satisfy the standard Euler-Lagrange equations, while the second, that is, the transversal foliation, is represented by the aforementioned solution of the Hamilton-Jacobi equation. The entire configuration then gives rise in a natural manner to a generalized Hilbert independent integral and consequently also to a generalized Weierstrass excess function.     

LEGENDRE TRANSFORMATIONS AND CARTAN FORMS IN THE CALCULUS OF VARIATIONS OF MULTIPLE INTEGRALS

ABSTRACT

(PART I): A field-theoretic treatment of variational problems in n independent variables {x^j} and N dependent variables {ψ^A)} is presented that differs substantially from the standard field theories, such as those of Carathéodory [4] and Weyl [10], inasmuch as it is not stipulated ab initio that the Lagrangian be everywhere positive. This is accomplished by the systematic use of a canonical formalism. Since the latter must necessarily be prescribed by appropriate Legendre transformations, the construction of such transformations is the central theme of Part I.—The underlying manifold is M = M_n x M_N, where M_n, M_N are manifolds with local coordinates {x^j}, {ψ^A}, respectively. The basic ingredient of the theory consists of a pair of complementary distributions D_n, D_N on M that are defined respectively by the characteristic subspaces in the tangent spaces of M of two sets of smooth 1-forms {π^A:A = 1,…, N}, {π^j = 1,…, n} on M. For a given local coordinate system on M the planes of 4, have unique (adapted) basis elements B_j = (?/?_x ^j) + B^A _j (?/?ψ^A), whose coefficients B^A _j will assume the role of derivatives such as ?ψ^A/?x^j in the final analysis of Part II. The first step toward a Legendre transformation is a stipulation that prescribes B^A _j as a function of the components {π^j _h,π^j _A} of {π^j}—these components being ultimately the canonical Variables—in such a manner that B^A _j is unaffected by the action of any unimodular transformation applied to the exterior system {π^j}. A function H of the canonical variables is said to be an acceptable Hamiltonian if it satisfies a similar invariance requirement, together with a determinantal condition that involves its Hessian with respect to π^j _A. The second part of the Legendre transformation consists of the identification in terms of H and the canonical variables of a function L that depends solely on B^A _j and the coordinates on M. This identification imposes a condition on the Hessian of L with respect to B^A _j. Conversely, any function L that satisfies these requirements is an acceptable Lagrangian, whose Hamiltonian is uniquely determined by the general construction.     

An improved upper bound in the maximum dispersal problem

For integral? m?2, let x₁,…, x_m be any unit vectors in R_n, the real Euclidean space of n dimensions. We obtain an upper bound for the quantity min_i≠j|x_i-x_j| which, though not as simple, is uniformly sharper than one recently obtained by the author. The result has application to the so-called maximum-dispersal problem, an open problem recently popularized by Klee.     

Orthogonal polynomials on the negative multinomial distribution

Orthogonal polynomials on the multivariate negative binomial distribution,

$\text{(1 + Θ)}{}^{\mathrm{?\alpha ?x}}\text{(}\text{π}\text{j=0}\text{p}\text{Θ}{}_{\mathrm{j}}{}^{\mathrm{x}}\text{j}\text{x}{}_{\mathrm{j}}\text{!}\text{)}\text{Γ(α + x)}\text{Γ(α)}$

where α > 0, Θ₁ > 0, x = ΣΘ_i, x₀, x₁, …, x_p = 0,1, … are constructed and their properties studied.     

A generalization of the Kruskal-Katona theorem

Let k_n ? k_n?1 ? … ? k₁ be positive integers and let ($\text{i}\text{j}$) denote the coefficient of xⁱ in $\text{Π}\text{r=1}\text{j}\text{(1 + x + x}{}^2\text{+ … + x}{}^{\mathrm{kr}}\text{)}$. For given integers l, m, where 1 ? l ? k_n + k_n?1 + … + k₁ and $\text{1 ? m ? (}\text{n}\text{n}\text{)}$, it is shown that there exist unique integers m(l), m(l ? 1),…, m(t), satisfying certain conditions, for which $\text{m = (}\text{m(l)}\text{l}\text{+ (}\text{m(l?1)}\text{l?1}\text{) + … + (}\text{m(t)}\text{t}\text{)}$. Moreover, any m l-subsets of a multiset with k_i elements of type i, i = 1, 2,…, n, will contain at least $\text{(}\text{m(l)}\text{l?1}\text{) + (}\text{m(l?1)}\text{l?2}\text{) + … + (}\text{m(t)}\text{t?1}$ different (l ? 1)-subsets. This result has been anticipated by Greene and Kleitman, but the formulation there is not completely correct. If k₁ = 1, the numbers ($\text{j}\text{i}$) are binomial coefficients and the result is the Kruskal-Katona theorem.     

Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming

We define order Lipschitz mappings from a Banach space to an order complete vector lattice and present a nonsmooth analysis for such functions. In particular, we establish properties of a generalized directional derivative and gradient and derive results concerning a calculus of generalized gradients (i.e., calculation of the generalized gradient of f when f = f₁ + f₂, f = f · ₂, etc.). We show the relevance of the above analysis to nondifferentiaile programming by deriving optimality conditions for problems of the form min f(x) subject to x [euro] S. For S arbitrary we state the results in terms of cones of displacement of the feasible region at the optimal point; when S ={x ? A|g(x) ? B}, we obtain Kuhn-Tucker type results.