BLOWUP OF SOLUTIONS TO THE CAUCHY PROBLEM FOR NONLINEARWAVE EQUATIONS

gi. IntroductionThis paper deals with solutionS of certain nonlinear wave equationS Of the formcorresponding to Antial conditionSwuersis the wave OPerstor.we are interested in showing the ~ up" Of solutions to (1.1)--(1.2). For that, wereIf ac ~ 1)(n ~ 1) > 2, global solutions of ~ equation subject to very general perturbationsof order p exist Provided the initial data are swhciently small (see I6] and references therein).We are also interested in esthaattw the take when "blow up" occurs. …     

On the use of Laplace's equation for global predictions of internuclear separation and dissociation energy

Properties of target species can be estimated by various means including interpolations in periodic charts. Interpolation is equivalent to numerical solution of the Laplace equation. A test of this equivalence, within some confidence level, for any N-atomic molecule surrounded by 4N nearest neighbors: the sum of the second differences of the data in all directions must be zero. Since very few molecules have 4N neighbors with known data, the test becomes: the sum of the averages of the second differences must be zero. The validity of these tests is explored. For radii of main-group atoms, and for internuclear separations of their diatomic combinations, the averages are different from zero and the sums of the averages are zero to within one if second-nearest neighbors are used. Dissociation potentials pass the tests but with larger scatter. Predictions for dissociation potentials, using iterative interpolation within boundaries on which there are known data, are reviewed.     

p-Adic Dynamics and Sullivan's No Wandering Domains Theorem

In this paper we study dynamics on the Fatou set of a rational function . Using a notion of components of the Fatou set defined by Benedetto, we state and prove an analogue of Sullivan's No Wandering Domains Theorem for p-adic rational functions which have no wild recurrent Julia critical points.     

Geometric Dynamics

A kinematic differential system on a Riemann (or semi-Riemann) manifold induces a Lorentz-Udrite world-force law, i.e., any local group with one parameter (any local flow) on a Riemann (or semi-Riemann) manifold induces the dynamics of the given vector field or of an associated particle, which will be called geometric dynamics.The cases of Riemann-Jacobi or Riemann-Jacobi-Lagrange structures are imposed by the behavior of an external tensor field of type (1,1). The case of the Finsler-Jacobi structure appears if the initial metric is chosen such that the energy of the given vector field is constant (Sec. 1). At the end of Sec. 1 are formulated open problems regarding some extensions of geometric dynamics.Adequate structures on the tangent bundle describe the geometric dynamics in the Hamilton language (Sec. 2).Section 3 proves the existence of a Finsler-Jacobi structure induced by an almost contact metric structure.The theory is applied to electromagnetic dynamical systems (the starting point of our theory), offering new principles of unification of the gravitation and the electromagnetism. Also, here, one enounces open problems regarding the geometric dynamics induced by the electric intensity and magnetizing force (Sec. 4).From the geometrical point of view, we create a wider class of Riemann-Jacobi, Riemann-Jacobi-Lagrange, or Finsler-Jacobi manifolds ensuring that all trajectories of a given vector field are geodesics. Having T₁M²ⁿ⁺¹ in mind, the problem of creating a wider class of Riemannian manifolds, in which there exists a vector field such that (1) all trajectories of the vector field are geodesics; (2) the flow defined by is incompressible; (3) the condition which corresponds to the property that is the associate vector field of the contact structure is satisfied;was studied intensively by S. Sasaki. The results were not satisfactory, but Sasaki discovered (, , )-structures [10].AMS Subject Classification (1991): 70H35, 53C22, 58F25, 83C22     

INITIAL-BOUNDARY VALUE PROBLEM FOR THE UNSATURATED LANDAU-LIFSHITZ SYSTEM

51. IntroductionLet fi C Re (n = 1,2) be a bounded smooth domain. Consider the following nonhomogeneous initial-boundary value problem for the unsaturated Landau-Lifshitz systems offerromagnetic spin chain with Gilbert damping constant afl > 0,where adZ is the exchange constallt, u = (u', u', u'), "o(x) is smooth and satisfies the unsaturated condition, i.e., Ilo(~)I gi constant, and in IVuol' < co, "o(x)IOn = op(x). DenoteW(x) = luo(x)I. We assume 0 < m = mane < M ~ mpxW. Throughout t…     

Production systems with interruptions, arbitrary topology and finite buffers

We consider a production system with finite buffers and arbitrary topology where service time is subject to interruptions in one of three ways, viz. machine breakdown, machine vacations or Npolicy. We develop a unified approximation (analytical) methodology to calculate the throughput of the system using queueing networks together with decomposition, isolation and expansion techniques. The methodology is rigorously tested covering a large experimental region. Orthogonal arrays are used to design the experiments in order to keep the number of experiments manageable. The results obtained using the approximation methodology are compared to the simulation results. The ttests carried out to investigate the differences between the two results show that they are statistically insignificant. Finally, we test the methodology by applying it to several arbitrary topology networks. The results show that the performance of the approximation methodology is consistent, robust and produces excellent results in a variety of experimental conditions.     

D-CONVERGENCE AND STABILITY OF A CLASS OF LINEAR MULTISTEP METHODS FOR NONLINEAR DDES

1. IntroductionConsider the following nonlinear delay problem{:;\f>>:v{t(tf,?,,<,>3,<'~">>,:: 5:,3Ti:,,,,, [l:::;where y: R - C",T > 0 is a delay term, f: [t.,T] x CN x CN - CN and W(t):[to -- T, tol - CN denotes a given initial function. Thoroughout this paper 9 the problem(1.1) is supposed to have a unique solution y(t), which satisfies11 y(')(t) 115 Mi, t e [to ~ T,T]here norm 11. 11 is defined by 11 x II'=< xgx > (Vx E C"), and Mi > 0 are someconstants.Definition 1.1.[1] The clas…     

Tactical Decompositions of Steiner Systems and Orbits of Projective Groups

Block's lemma states that the numbers m of point-classes and n of block-classes in a tactical decomposition of a 2-(v, k, ) design with b blocks satisfy m n m + b – v. We present a strengthening of the upper bound for the case of Steiner systems (2-designs with = 1), together with results concerning the structure of the block-classes in both extreme cases. Applying the results to the Steiner systems of points and lines of projective space PG(N, q), we obtain a complete classification of the groups inducing decompositions satisfying the upper bound; answering the analog of a question raised by Cameron and Liebler (P.J. Cameron and R.A. Liebler, Lin. Alg. Appl. 46 (1982), 91–102) (and still open).     

Accurate Solution to Overdetermined Linear Equations with Errors Using L1 Norm Minimization

It has been known for many years that a robust solution to an overdetermined system of linear equations Ax b is obtained by minimizing the L1 norm of the residual error. A correct solution x to the linear system can often be obtained in this way, in spite of large errors (outliers) in some elements of the (m × n) matrix A and the data vector b. This is in contrast to a least squares solution, where even one large error will typically cause a large error in x. In this paper we give necessary and sufficient conditions that the correct solution is obtained when there are some errors in A and b. Based on the sufficient condition, it is shown that if k rows of [A b] contain large errors, the correct solution is guaranteed if (m – n)/n 2k/, where > 0, is a lower bound of singular values related to A. Since m typically represents the number of measurements, this inequality shows how many data points are needed to guarantee a correct solution in the presence of large errors in some of the data. This inequality is, in fact, an upper bound, and computational results are presented, which show that the correct solution will be obtained, with high probability, for much smaller values of m – n.     

Entire solutions of semilinear elliptic equations in and a conjecture of De Giorgi

In 1978 De Giorgi formulated the following conjecture. Let be a solution of in all of such that and 0$"> in . Is it true that all level sets of are hyperplanes, at least if ? Equivalently, does depend only on one variable? When , this conjecture was proved in 1997 by N. Ghoussoub and C. Gui. In the present paper we prove it for . The question, however, remains open for . The results for and 3 apply also to the equation for a large class of nonlinearities .