A solvability result for a nonlinear weakly hyperbolic equation of second order

In this article we study the well-posedness of the initial value problem for quasi-linear weakly hyperbolic equations of second order. We obtain a sufficient condition for the Cauchy problem to be locally solvable in the class of smooth function.     

The derivatives of equilibrium states

We find some estimates for the derivatives of equilibrium states of subshifts of finite type. We prove the differentiability (with respect to the potential) of integrals of certain discontinuous functions for the equilibrium state of a potential.research supported by CNPq, Brazil     

Electrochemical investigations of cationictrans-haloarylisocyanidebis(tertiaryphosphino)platinum (II) complexes

Summary The electrochemical behaviour of a series of cationic platinum(II) isocyanide complexes has been studied in acetonitrile. All the tested compounds are oxidized at a platinum electrode via a two-electron process and reduced at a platinum or mercury electrode via two successive one-electron steps. The anodic step involves the formation of platinum(IV) complexes. The main reduction product formed in correspondence to the first cathodic process is a stable dimer platinum(I) containing bridging isocyanide ligands. Platinum(0) species are formed in the subsequent reduction step.     

Constructing a composite indicator with multiplicative aggregation under the objective of ranking alternatives

Composite indicators (CIs), constructed on the basis of the ‘benefit of the doubt’ criterion, are characterized by endogenously determined vectors of weights. In this paper, a new procedure to construct CIs is proposed in an attempt to overcome the main weakness of this family of procedures: the determination of an individual weighting vector for each alternative, which makes comparisons between alternatives difficult and the existence of multiple ties. A new procedure is proposed which, while maintaining the essence of DEA-inspired procedures determines a common weighting vector to evaluate the complete set of alternatives and includes the discrimination between alternatives as an objective of the procedure.     

Iteration-complexity of first-order penalty methods for convex programming

This paper considers a special but broad class of convex programming problems whose feasible region is a simple compact convex set intersected with the inverse image of a closed convex cone under an affine transformation. It studies the computational complexity of quadratic penalty based methods for solving the above class of problems. An iteration of these methods, which is simply an iteration of Nesterov’s optimal method (or one of its variants) for approximately solving a smooth penalization subproblem, consists of one or two projections onto the simple convex set. Iteration-complexity bounds expressed in terms of the latter type of iterations are derived for two quadratic penalty based variants, namely: one which applies the quadratic penalty method directly to the original problem and another one which applies the latter method to a perturbation of the original problem obtained by adding a small quadratic term to its objective function.     

A filter-and-fan approach to the job shop scheduling problem

The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solutions. This paper proposes a new heuristic algorithm for the JSSP that effectively combines the classical shifting bottleneck procedure (SBP) with a dynamic and adaptive neighborhood search procedure. Our new search method, based on a filter-and-fan (F&F) procedure, uses the SBP as a subroutine to generate a starting solution and to enhance the best schedules produced. The F&F approach is a local search procedure that generates compound moves by a strategically abbreviated form of tree search. Computational results carried out on a standard set of 43 benchmark problems show that our F&F algorithm performs more robustly and effectively than a number of leading metaheuristic algorithms and rivals the best of these algorithms.     

On a theorem by Sohr for the Navier-Stokes equations

In this paper we study some criteria for the full (space-time) regularity of weak solutions to the Navier-Stokes equations. In particular, we generalize some classical and very recent criteria involving the velocity, or its derivatives. More specifically, we show with elementary tools that if a weak solution, or its vorticity, is small in appropriate Marcinkiewicz spaces, then it is regular.     

A resolution theorem for absolutely isolated singularities of holomorphic vector fields

In this paper, the desingularization problem for an absolutely isolated singularity of an-dimensional holomorphic vector field is solved. Also, we exhibit final forms under blowing-up for this type of singularities.     

A mass-matrix formulation of unsteady fluctuation splitting schemes consistent with Roe’s parameter vector

A mass-matrix formulation of the fluctuation splitting schemes for solving compressible, unsteady flows is proposed. This formulation is consistent with the conservative linearisation based on parameter vector and allows to extend to unsteady flows the ‘invariance under similarity transformations’ property that had been shown to hold for the steady version of the schemes. Second-order time accuracy is achieved using a Petrov–Galerkin finite element interpretation of the fluctuation splitting schemes. The approach may however be readily applicable to all other time-accurate fluctuation splitting formulations that have been so far proposed in the literature. Applications of the proposed methodology to two- and three-dimensional, inviscid and viscous compressible flows are reported and discussed in the paper.