Global existence and asymptotic behavior of classical solutions of quasilinear hyperbolic systems with linearly degenerate characteristic fields

In this paper, we study the global existence and the asymptotic behavior of classical solution of the Cauchy problem for quasilinear hyperbolic system with constant multiple and linearly degenerate characteristic fields. We prove that the global C¹ solution exists uniquely if the BV norm of the initial data is sufficiently small. Based on the existence result on the global classical solution, we show that, when the time t tends to the infinity, the solution approaches a combination of C¹ traveling wave solutions. Finally, we give an application to the equation for time-like extremal surfaces in the Minkowski space-time R1+n.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.     

An explosion point space without the fixed point property

In 1988 A. Gutek proved that there exist one-point connectifications of hereditarily disconnected spaces that do not have the fixed point property. We improve on this result by constructing a one-point connectification of a totally disconnected space without the fixed point property.     

Finite element error estimates for non-linear elliptic equations of monotone type

Summary In this paper we shall consider the application of the finite element method to a class of second order elliptic boundary value problems of divergence form and with gradient nonlinearity in the principal coefficient, and the derivation of error estimates for the finite element approximations. Such problems arise in many practical situations — for example, in shock-free airfoil design, seepage through coarse grained porous media, and in some glaciological problems. By making use of certain properties of the nonlinear coefficients, we shall demonstrate that the variational formulations associated with these boundary value problems are well-posed. We shall also prove that the abstract operators accompanying such problems satisfy certain continuity and monotonicity inequalities. With the aid of these inequalities and some standard results from approximation theory, we show how one may derive error estimates for the finite element approximations in the energy norm.     

A Positive Doubly Power Bounded Operator with a Nonpositive Inverse Exists on any Infinite-dimensional AL-Space

In this paper we construct a positive doubly power bounded operator with a nonpositive inverse on an AL-space.     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

Markov processes associated with L p -resolvents and applications to stochastic differential equations on Hilbert space

We give general conditions on a generator of a C₀-semigroup (resp. of a C₀-resolvent) on L^p(E,μ), p ≥ 1, where E is an arbitrary (Lusin) topological space and μ a σ-finite measure on its Borel σ-algebra, so that it generates a sufficiently regular Markov process on E. We present a general method how these conditions can be checked in many situations. Applications to solve stochastic differential equations on Hilbert space in the sense of a martingale problem are given. Dedicated to Giuseppe Da Prato on the occasion of his 70th birthday     

�ɲ����˶�����ά��������������һ�������ڵ����Զ������������������

??We study the linear quadratic optimal stochastic control problem which is jointly driven by Brownian motion and L\'{e}vy processes. We prove that the new affine stochastic differential adjoint equation exists an inverse process by applying the profound section theorem. Applying for the Bellman's principle of quasilinearization and a monotone iterative convergence method, we prove the existence and uniqueness of the solution of the backward Riccati differential equation. Finally, we prove that the optimal feedback control exists, and the value function is composed of the initial value of the solution of the related backward Riccati differential equation and the related adjoint equation.