A second order numerical scheme for the solution of the one-dimensional Boussinesq equation

A predictor–corrector (P-C) scheme is applied successfully to a nonlinear method arising from the use of rational approximants to the matrix-exponential term in a three-time level recurrence relation. The resulting nonlinear finite-difference scheme, which is analyzed for local truncation error and stability, is solved using a P-C scheme, in which the predictor and the corrector are explicit schemes of order 2. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behaviour of the P-C/MPC schemes is tested numerically on the Boussinesq equation already known from the bibliography free of boundary conditions. The numerical results are derived for both the bad and the good Boussinesq equation and conclusions from the relevant known results are derived.      

Results of the maximum genus of graphs

In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.     

Lefschetz–Verdier Trace Formula and a Generalization of a Theorem of Fujiwara

The goal of this paper is to generalize a theorem of Fujiwara (Deligne’s conjecture) to the situation appearing in a joint work [KV] with David Kazhdan on the global Langlands correspondence over function fields. Moreover, our proof is more elementary than the original one and stays in the realm of ordinary algebraic geometry, that is, does not use rigid geometry. We also give a proof of the Lefschetz–Verdier trace formula and of the additivity of filtered trace maps, thus making the paper essentially self-contained. The work was supported by the Israel Science Foundation (Grant No. 555/04) Received: May 2005 Accepted: August 2005     

On structure of small contractions of odd dimensional projective varieties

Let X be a smooth projective variety of dimension 2k-1 (k≥3) over the complex number field. Assume that fR: X→Y is a small contraction such that every irreducible component Ei of the exceptional locus of fR is a smooth subvariety of dimension k. It is shown that each Ei is isomorphic to the k-dimensional projective space Pk, the k-dimensional hyperquadric surface Qk in Pk 1, or a linear Pk-1-bundle over a smooth curve.     

An alternative approach for non-linear optimal control problems based on the method of moments

We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.     

An estimate for symmetric square <Emphasis Type="Italic">L</Emphasis>-functions on weight aspect

We establish a mean square estimate on the weight aspect for symmetric square L-functions at every point on the critical line. Received: 15 February 2002     

Die Entwicklung kausaler Hypothesen in der qualitativen Sozialforschung

The disregard of causal inference in the methodological literature about qualitative research is highly problematic, since the category of causality is closely linked to the concept of social action. However, it is also clear that causal analysis is burdened with certain difficulties and methodological challenges in the realm of social research. Some of these problems are discussed in this article using Mackie—s concept of 3 “INUS”-conditions. Thereby it will be shown that strategies of causal analysis based on comparative methods proposed for qualitative research, namely “Analytic Induction” and “Qualitative Comparative Analysis” have great difficulties in dealing adequately with these problems. They can only be solved, if case-comparative methods are combined with explorative research strategies which support the researcher in gaining access to the local knowledge of the research field.     

Lanthanum nitrate decomposition by both temperature programmed heating and citrate gel combustion

Thermal decomposition of lanthanum nitrate to lanthanum oxide was carried out by both temperature programmed heating (TPH) and citrate-gel combustion. The temperature programmed heating was carried out under flow of oxidizing (air), neutral (nitrogen) and reducing (25 vol.% hydrogen+argone mixture) gases, and the processes were controlled by simultaneous thermogravimetry and differential thermal analysis. It was shown that hydrogen atmosphere helps to reduce temperatures of all decomposition steps. The results of TPH were utilized to check the nature of residues in the products of lanthanum nitrate-to-oxide conversion performed via citrate-gel combustion technique.     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.