Inner functions in the unit ball of Cn

Let B be the open unit ball of $\text{C}$ⁿ, n > 1. Let I (for “inner”) be the set of all u ? H °(B) that have $\text{¦u¦ = 1}$ a.e. on the boundary S of B. Aleksandrov proved recently that there exist nonconstant u ? I. This paper strengthens his basic theorem and provides further information about I and the algebra Q generated by I. Let XY be the finite linear span of products xy, x ? X, y ? Y, and let $\text{¦X¦}$ be the norm closure, in L^∞ = L^∞(S), of X. Some results: set I is dense in the unit ball of H^∞(B) in the compact-open topology. On $\text{S,}\text{Q}\text{?}\text{Q}$ is weak¹-dense in $\text{L}{}^{\mathrm{\infty }}\text{, ¦}\text{Q}\text{?}\text{Q¦}$ does not contain $\text{H}{}^{\mathrm{\infty }}\text{, C(S) ?¦}\text{Q}\text{?}\text{H}{}^{\mathrm{\infty }}\text{¦ ≠ ¦}\text{H}\text{?}{}^{\mathrm{\infty }}\text{H}{}^{\mathrm{\infty }}\text{¦ ≠ L}{}^{\mathrm{\infty }}$. (When $\text{n = 1, ¦Q¦ = H}{}^{\mathrm{\infty }}\text{and}\text{¦}\text{Q}\text{?}\text{Q¦ = L}{}^{\mathrm{\infty }}$.) Every unimodular $\text{?}\text{?}\text{L}{}^{\mathrm{\infty }}$ is a pointwise limit a.e. of products $\text{u}\text{v}\text{?}\text{, u}\text{?}\text{I, ν}\text{?}\text{I}$. The zeros of every $\text{? ? 0}$ in the ball algebra (but not of every H^∞-function) can be matched by those of some u ? I, as can any finite number of derivatives at 0 if $\text{∥?∥}{}_{\mathrm{\infty }}\text{< 1}$. However, $\text{?}\text{u}$ cannot be bounded in B if u ? I is non-constant.     

Convergence of the Kato approximants for evolution equations involving functional perturbations

The existence of a unique strong solution of the nonlinear abstract functional differential equation $\text{u′(t) + A(t)u(t) = F(t,u}{}_{\mathrm{t}}\text{), u}{}_0\text{= φεC}{}^1\text{(¦?r,0¦,X),tε¦0, T¦}$, (E) is established. X is a Banach space with uniformly convex dual space and, for $\text{t? ¦0, T¦, A(t)}$ is m-accretive and satisfies a time dependence condition suitable for applications to partial differential equations. The function F satisfies a Lipschitz condition. The novelty of the paper is that the solution u(t) of (E) is shown to be the uniform limit (as n → ∞) of the sequence u_n(t), where the functions u_n(t) are continuously differentiate solutions of approximating equations involving the Yosida approximants. Thus, a straightforward approximation scheme is now available for such equations, in parallel with the approach involving the use of nonlinear evolution operator theory.     

Run for your life. A note on the asymptotic speed of propagation of an epidemic

We study the large-time behaviour of the solution of a nonlinear integral equation of mixed Volterra-Fredholm type describing the spatio-temporal development of an epidemic. For this model it is known that there exists a minimal wave speed c₀ (i.e., travelling wave solutions with speed c exist if $\text{¦c¦ > c}{}_0$ and do not exist if $\text{¦c¦ < c}{}_0$). In this paper we show that c₀ is the asymptotic speed of propagation (i.e., for any c₁, c₂with 0 < c₁ < c₀ < c₂ the solution tends to zero uniformly in the region $\text{¦x¦ ? c}{}_2\text{t}$, whereas it is bounded away from zero uniformly in the region $\text{¦x¦ ? c}{}_1\text{t}$ for t sufficiently large).     

The convex weighting of a graph and an alternative definition of a matroid

In 1976, R.N. Burns and C.E. Haff gave an algorithm for finding the kth-best spanning tree of an edge-weighted graph as well as the kth-best base of an element-weighted matroid. In this paper, after introducing the concept of a convex weight function defined on the vertex set of a connected graph, the following result is proved: Let H = (S, $\text{I}$) be an independence system, where $\text{I}$ is the set of independent subsets of H, such that all the maximal independent subsets of H are of the same cardinality. Then a necessary and sufficient condition for H to be a matroid is that, for any weight function W defined on S, the algorithm of Burns and Haff gives a labelling of the family of maximal sets in $\text{I}$ as B₁, B₂, …, B_n such that W(B₁) ? W(B₂) ? ··· ? W(B_n).     

Harmonic analysis on hyperboloids

The regular representation of O(n, N) acting on $\text{L}{}^2\text{(}\text{O(n, N)}\text{O(n, N ? 1)}\text{)}$ is decomposed into a direct integral of irreducible representations. The homogeneous space $\text{O(n, N)}\text{O(n, N ? 1)}$ is realized as the Hyperboloid $\text{H = {(x, t) ? R}{}^{\mathrm{n\; +\; N}}\text{: ¦ t ¦}{}^2\text{? ¦ x ¦}{}^2\text{= 1}}$. The problem is essentially equivalent to finding the spectral resolution of a certain self-adjoint invariant differential operator □_h on H, which is the tangential part of the operator □ = Δ_x ? Δ_t on R^{n + N}. The spectrum of □_h contains a discrete part (except when N = 1) with eigenfunctions generated by restricting to H solutions of □u = 0 which vanish in the region $\text{¦ t ¦ < ¦ x ¦}$, and a continuous part $\text{H}$_?. As a representation of O(n, N), $\text{H}$_? ⊕ $\text{H}$_? is unitarily equivalent to the regular representation on L² of the cone $\text{{(x, t) : ¦ x ¦}{}^2\text{= ¦ t ¦}{}^2\text{}}$, and the intertwining operator is obtained by solving the equation □u = 0 with given boundary values on the cone. Explicit formulas are given for the spectral decomposition. The special case n = N = 2 gives the Plancherel formula for SL(2, R).     

Some existence and nonexistence theorems for solutions of degenerate parabolic equations

The initial and boundary value problem for the degenerate parabolic equation v_t = Δ(?(v)) + F(v) in the cylinder $\text{Ω × ¦0, ∞), Ω ? R}{}^{\mathrm{n}}$ bounded, for a certain class of point functions ? satisfying ?′(v) ? 0 (e.g., $\text{?(v) = ¦v¦}{}^{\mathrm{m}}\text{sign}\text{v}$) is considered. In the case that F(v) sign $\text{v ? C(1 + ¦?(v)¦}{}^{\mathrm{\alpha }}\text{), α < 1}$, the equation has a global time solution. The same is true for α = 1 provided the measure of Ω is sufficiently small. In the case that $\text{F(v)}\text{?(v)}$ is nondecreasing a condition is given on the initial state v(x, 0) which implies that the solution must blow up in finite time. The existence of such initial states is discussed.     

A generalization of the fast LUP matrix decomposition algorithm and applications

We show that any m × n matrix A, over any field, can be written as a product, LSP, of three matrices, where L is a lower triangular matrix with l's on the main diagonal, S is an m × n matrix which reduces to an upper triangular matrix with nonzero diagonal elements when the zero rows are deleted, and P is an n × n permutation matrix. Moreover, L, S, and P can be found in O(m^α?1n) time, where the complexity of matrix multiplication is O(m^α). We use the LSP decomposition to construct fast algorithms for some important matrix problems. In particular, we develop O(m^α?1n) algorithms for the following problems, where A is any m × n matrix: (1) Determine if the system of equations $\text{A}\text{x}\text{=}\text{b}$ (where $\text{b}$ is a column vector) has a solution, and if so, find one such solution. (2) Find a generalized inverse, $\text{A}{}^1$, of A (i.e., $\text{AA}{}^1\text{A = A}$). (3) Find simultaneously a maximal independent set of rows and a maximal independent set of columns of A.     

Optimal approximation of convex curves by functions which are piecewise linear

In this paper an efficient method is presented for solving the problem of approximation of convex curves by functions that are piecewise linear, in such a manner that the maximum absolute value of the approximation error is minimized. The method requires the curves to be convex on the approximation interval only. The boundary values of the approximation function can be either free or specified. The method is based on the property of the optimal solution to be such that each linear segment approximates the curve on its interval optimally while the optimal error is uniformly distributed among the linear segments of the approximation function. Using this method the optimal solution can be determined analytically to the full extent in certain cases, as it was done for functions x² and $\text{x}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$. In general, the optimal solution has to be computed numerically following the procedure suggested in the paper. Using this procedure, optimal solutions were computed for functions sin x, tg x, and arc tg x. Optimal solutions to these functions were used in practical applications.     

Problèmes de Neumann non linéaires sur les variétés riemanniennes

Nonlinear Neumann problems on riemannian manifolds. Let ($\text{M}\text{, g}$) be a C^∞ compact riemannian manifold of dimension n ? 2 whose boundary B is an (n ? 1)-dimensional submanifold and let $\text{M =}\text{M}\text{?B}$ be the interior of $\text{M}$. Study of Neumann problems of the form: $\text{Δφ +?(φ, x) = 0}\text{in}\text{M, (}\text{dφ}\text{dn}\text{) + g(φ, y) = 0}\text{on}\text{B}$, where, for every $\text{(t, x, y) ? R × M × B, ¦?(t, x)¦}\text{and}\text{¦g(t, y)¦}$ are bounded by $\text{C(1 + ¦t¦}{}^{\mathrm{a}}\text{)}\text{or}\text{C}\text{exp}\text{(¦t¦}{}^{\mathrm{a}}\text{)}$. Application to the determination of a conformal metric for which the scalar curvature of M and the mean curvature of B take prescribed values.     

A class of solutions to the gossip problem,part I

We characterize optimal solutions to the gossip problem in which no one hears his own information. That is, we consider graphs on n vertices where the edges are given a linear ordering such that an increasing path exists from each vertex to every other, but there is no increasing path from a vertex to itself. Such graphs exist if and only if n is even, in which case the fewest number of edges is 2n - 4, as in the original gossip problem (in which the “$\text{N}$o $\text{O}$ne $\text{H}$ears his $\text{O}$wn information” condition did not appear). We characterize optimal solutions of this sort, called NOHO-graphs, by a correspondence with quadruples consisting of two permutations and two binary sequences. The correspondence uses a canonical numbering of the vertices of the graph; it arises from the edge ordering. (Exception: there are two optimal solution graphs which do not meet this characterization.) Also in Part I, we show constructively that NOHO-graphs are Hamiltonian, bipartite, and planar. In Part II, we study other properties of the associated quadruples, which includes enumerating them. In Part III, we enumerate the non-isomorphic NOHO-graphs.     

Unique continuation for Schrodinger operators with unbounded potentials

We consider unique continuation theorems for solution of inequalities $\text{¦Δu(x)¦ ? W(x) ¦u(x)¦}$ with W allowed to be unbounded. We obtain two kinds of results. One allows W ? L^p_loc($\text{R}$ⁿ) with $\text{p ? n ? 2}\text{for}\text{n > 5, p >}\text{1}\text{3}\text{(2n ? 1)}\text{for}\text{n ? 5}$. The other requires fW² to be ?Δ-form bounded for all f ? C₀^∞.     

On the weak asymptotic almost-periodicity of bounded solutions of u″ ϵ Au + ƒ for monotone A

If u is a bounded solution of $\text{u″ ? Au + ?}$ on $\text{R}$⁺, where A is maximal monotone and ? is S²-almost-periodic on $\text{R}$, then u is weakly asymptotic to an almost-periodic solution of the differential equation on $\text{R}$.     

Maximization,under equality constraints,of a functional of a probability distribution

Let $\text{F}$ be a family of probability distributions. Let O, C₁…C_n be real functions on $\text{F}$. Let z₁…z_n be real numbers. Then we consider the problem of maximization of the object function O(F)(F?$\text{F}$) under the equality constraints C₁(F)=z₁(i=1,…,n) . The theory is developed in order to solve problems of the following kind: Find the maximal variance of a stop-loss reinsured risk under partial information on the risk such as its range and two first moments.     

A penalty/Newton/conjugate gradient method for the solution of obstacle problems

Motivated by the search for non-negative solutions of a system of Eikonal equations with Dirichlet boundary conditions, we discuss in this Note a method for the numerical solution of parabolic variational inequality problems for convex sets such as $\text{K={v∣v∈H}{}_0{}^1\text{(Ω)}$, v?ψ a.e. on $\text{Ω}.}$ The numerical methodology combines penalty and Newton's method, the linearized problems being solved by a conjugate gradient algorithm requiring at each iteration the solution of a linear problem for a discrete analogue of the elliptic operator I?μΔ. Numerical experiments show that the resulting method has good convergence properties, even for small values of the penalty parameter. To cite this article: R. Glowinski et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

The resolvent of a singularly perturbed elliptic operator

Let A and B be uniformly elliptic operators of orders 2m and 2n, respectively, m > n. We consider the Dirichlet problems for the equations (?^{2(m ? n)}A + B + λ²ⁿI)u_? = f and (B + λ²ⁿI)u = f in a bounded domain Ω in R^k with a smooth boundary ?Ω. The estimate is derived. This result extends the results of [7, 9, 10, 12, 14, 15, 18]by giving estimates up to the boundary, improving the rate of convergence in ?, using lower norms, and considering operators of higher order with variable coefficients. An application to a parabolic boundary value problem is given.     

Universal bounds for global solutions of a forced porous medium equation

We show that in a smooth bounded domain $\text{Ω⊂}\text{R}{}^{\mathrm{n}}$, n⩾2, all global nonnegative solutions of u_t−Δu^m=u^p with zero boundary data are uniformly bounded in $\text{Ω×(τ,∞)}$ by a constant depending on $\text{Ω,p}$ and τ but not on u₀, provided that 1<m<p<[(n+1)/(n−1)]m. Furthermore, we prove an a priori bound in $\text{L}{}^{\mathrm{\infty }}\text{(Ω×(0,∞))}$ depending on $\text{||u}{}_0\text{||}{}_{\mathrm{L\infty (\Omega )}}$ under the optimal condition 1<m<p<[(n+2)/(n−2)]m.     

Approximate solutions of functional differential equations

The author discusses the best approximate solution of the functional differential equation x′(t) = F(t, x(t), x(h(t))), 0 < t < l satisfying the initial condition x(0) = x₀, where x(t) is an n-dimensional real vector. He shows that, under certain conditions, the above initial value problem has a unique solution y(t) and a unique best approximate solution $\text{p}\text{?}{}_{\mathrm{k}}\text{(t)}$ of degree k (cf. [1]) for a given positive integer k. Furthermore, $\text{sup}{}_{\mathrm{0?t?l}}\text{¦}\text{p}\text{?}{}_{\mathrm{k}}\text{(t) ? y(t)¦ → 0}\text{as}\text{k → ∞}$, where ¦ · ¦ is any norm in Rⁿ.     

On a semilinear wave equation: The Cauchy problem and the asymptotic behavior of solutions

The semilinear wave equation

$\text{□u + m}{}^2\text{u + ¦u¦}{}^{\mathrm{p\; ?\; 2}}\text{u(V1 ¦u¦}{}^{\mathrm{p}}\text{) = 0}$

in $\text{Ω= R}{}^3\text{, ?∞ < t < ∞}$, is studied where □ denotes the d'Alembertian operator and 1 means spatial convolution. Under mild assumptions on the real-valued function V and 2 ? p ? 3 the well-posedness of the Cauchy problem is proved. Furthermore, some properties of the solutions of the equation are analyzed such as the asymptotic behavior of local energy as $\text{¦t¦ → + ∞}$ in the case of zero mass. Our results extend that of Perla Menzala and Strauss, where case p = 2 was studied.     

Entropic perturbation method for solving a system of linear inequalities

The problem of finding an $\text{x∈}\text{R}{}^{\mathrm{n}}$ such that Ax⩽b and x⩾0 arises in numerous contexts. We propose a new optimization method for solving this feasibility problem. After converting Ax⩽b into a system of equations by introducing a slack variable for each of the linear inequalities, the method imposes an entropy function over both the original and the slack variables as the objective function. The resulting entropy optimization problem is convex and has an unconstrained convex dual. If the system is consistent and has an interior solution, then a closed-form formula converts the dual optimal solution to the primal optimal solution, which is a feasible solution for the original system of linear inequalities. An algorithm based on the Newton method is proposed for solving the unconstrained dual problem. The proposed algorithm enjoys the global convergence property with a quadratic rate of local convergence. However, if the system is inconsistent, the unconstrained dual is shown to be unbounded. Moreover, the same algorithm can detect possible inconsistency of the system. Our numerical examples reveal the insensitivity of the number of iterations to both the size of the problem and the distance between the initial solution and the feasible region. The performance of the proposed algorithm is compared to that of the surrogate constraint algorithm recently developed by Yang and Murty. Our comparison indicates that the proposed method is particularly suitable when the number of constraints is larger than that of the variables and the initial solution is not close to the feasible region.     

Solution of a system of functional-differential equations arising from an optimization problem

In connection with an optimization problem, all functions ?: Iⁿ → $\text{R}$ with continuous nonzero partial derivatives and satisfying

$\text{??}\text{?x,}{}_{\mathrm{i}}\text{??}\text{?x}{}_{\mathrm{j}}$

for all x_i, x_j ≠ I, i, j = 1,2,…, n (n > 2) are determined (I is an interval of positive real numbers).