Synthesis of 2D Germanane (GeH): a New,Fast, and Facile Approach

Germanane (GeH), a germanium analogue of graphane, has recently attracted considerable interest because its remarkable combination of properties makes it an extremely suitable candidate to be used as 2D material for field effect devices, photovoltaics, and photocatalysis. Up to now, the synthesis of GeH has been conducted by substituting Ca by H in a β‐CaGe₂ layered Zintl phase through topochemical deintercalation in aqueous HCl. This reaction is generally slow and takes place over 6 to 14 days. The new and facile protocol presented here allows to synthesize GeH at room temperature in a significantly shorter time (a few minutes), which renders this method highly attractive for technological applications. The GeH produced with this method is highly pure and has a band gap (E_g) close to 1.4 eV, a lower value than that reported for germanane synthesized using HCl, which is promising for incorporation of GeH in solar cells.     

Minimal varieties of residuated lattices

In this paper we investigate the atomic level in the lattice of subvarieties of residuated lattices. In particular, we give infinitely many commutative atoms and construct continuum many non-commutative, representable atoms that satisfy the idempotent law; this answers Problem 8.6 of [12]. Moreover, we show that there are only two commutative idempotent atoms and only two cancellative atoms. Finally, we study the connections with the subvariety lattice of residuated bounded-lattices. We modify the construction mentioned above to obtain a continuum of idempotent, representable minimal varieties of residuated bounded-lattices and illustrate how the existing construction provides continuum many covers of the variety generated by the three-element non-integral residuated bounded-lattice.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived August 1, 2003; accepted in final form April 27, 2004.     

On p-logistic equations of equidiffusive type

We consider a p-logistic equation with equidiffusive reaction. We study the existence, nonexistence and uniqueness of positive solutions as the parameter \(\lambda >0\) varies. In the case of a unique positive solution \(u_{\lambda }\), we investigate the monotonicity and continuity properties of the map \(\lambda \rightarrow u_{\lambda }\).     

Nonvanishing at spatial extremity solutions of the defocusing nonlinear Schrödinger equation

We show local existence of certain type of solutions for the Cauchy problem of the defocusing nonlinear Schrödinger equation with pure power nonlinearity, in various cases of open sets, unbounded or bounded. These solutions do not vanish at the boundary or at infinity. We also show, in certain cases, that these solutions are unique and global.     

ON BLOCK MATRICES ASSOCIATED WITH DISCRETE TRIGONOMETRIC TRANSFORMS AND THEIR USE IN THE THEORY OF WAVE PROPAGATION

Block matrices associated with discrete Trigonometric transforms （DTT＇s） arise in the mathematical modelling of several applications of wave propagation theory including discretizations of scatterers and radiators with the Method of Moments, the Boundary Element Method, and the Method of Auxiliary Sources. The DTT＇s are represented by the Fourier, Hartley, Cosine, and Sine matrices, which are unitary and offer simultaneous diagonalizations of specific matrix algebras. The main tool for the investigation of the aforementioned wave applications is the efficient inversion of such types of block matrices. To this direction, in this paper we develop an efficient algorithm for the inversion of matrices with U-diagonalizable blocks （U a fixed unitary matrix） by utilizing the U- diagonalization of each block and subsequently a similarity transformation procedure. We determine the developed method＇s computational complexity and point out its high efficiency compared to standard inversion techniques. An implementation of the algorithm in Matlab is given. Several numerical results are presented demonstrating the CPU-time efficiency and accuracy for ill-conditioned matrices of the method. The investigated matrices stem from real-world wave propagation applications.     

Convergence theory of extrapolated iterative methods for a certain class of non-symmetric linear systems

Summary A variety of iterative methods considered in [3] are applied to linear algebraic systems of the formAu=b, where the matrixA is consistently ordered [12] and the iteration matrix of the Jacobi method is skew-symmetric. The related theory of convergence is developed and the optimum values of the involved parameters for each considered scheme are determined. It reveals that under the aforementioned assumptions the Extrapolated Successive Underrelaxation method attains a rate of convergence which is clearly superior over the Successive Underrelaxation method [5] when the Jacobi iteration matrix is non-singular.     

A synthesis of assignment and heuristic solutions for vehicle routing with time windows

This paper proposes a three-stage method for the vehicle-routing problem with time window constraints (VRPTW). Using the Hungarian method the optimal customer matching for an assignment approximation of the VRPTW, which is a travel time-based relaxation that partially respects the time windows, is obtained. The assignment matching is transformed into feasible routes of the VRPTW via a simple decoupling heuristic. The best of these routes, in terms of travelling and vehicle waiting times, form part of the final solution, which is completed by the routes provided by heuristic methods applied to the remainder of the customers. The proposed approach is tested on a set of standard literature problems, and improves the results of the heuristic methods with respect to total travel time. Furthermore, it provides useful insights into the effect of employing optimal travel time solutions resulting from the assignment relaxation to derive partial route sets of the VRPTW.     

Two nontrivial solutions for quasilinear periodic equations

In this paper we study a nonlinear periodic problem driven by the ordinary scalar p-Laplacian and with a Carathéodory nonlinearity. We establish the existence of at least two nontrivial solutions. Our approach is variational based on the smooth critical point theory and using the ``Second Deformation Theorem".

     

An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver

Solving mixed-integer nonlinear programming (MINLP) problems to optimality is a NP-hard problem, for which many deterministic global optimization algorithms and solvers have been recently developed. MINLPs can be relaxed in various ways, including via mixed-integer linear programming (MIP), nonlinear programming, and linear programming. There is a tradeoff between the quality of the bounds and CPU time requirements of these relaxations. Unfortunately, these tradeoffs are problem-dependent and cannot be predicted beforehand. This paper proposes a new dynamic strategy for activating and deactivating MIP relaxations in various stages of a branch-and-bound algorithm. The primary contribution of the proposed strategy is that it does not use meta-parameters, thus avoiding parameter tuning. Additionally, this paper proposes a strategy that capitalizes on the availability of parallel MIP solver technology to exploit multicore computing hardware while solving MINLPs. Computational tests for various benchmark libraries reveal that our MIP activation strategy works efficiently in single-core and multicore environments.