Computation of all solutions to a system of polynomial equations

This paper proposes a homotopy continuation method for approximating all solutions to a system of polynomial equations in several complex variables. The method is based on piecewise linear approximation and complementarity theory. It utilizes a skilful artificial map and two copies of the triangulationJ ₃ with continuous refinement of grid size to increase the computational efficiency and to avoid the necessity of determining the grid size a priori. Some computational results are also reported.     

Facial Reduction Algorithms for Conic Optimization Problems

In the conic optimization problems, it is well-known that a positive duality gap may occur, and that solving such a problem is numerically difficult or unstable. For such a case, we propose a facial reduction algorithm to find a primal–dual pair of conic optimization problems having the zero duality gap and the optimal value equal to one of the original primal or dual problems. The conic expansion approach is also known as a method to find such a primal–dual pair, and in this paper we clarify the relationship between our facial reduction algorithm and the conic expansion approach. Our analysis shows that, although they can be regarded as dual to each other, our facial reduction algorithm has ability to produce a finer sequence of faces of the cone including the feasible region. A simple proof of the convergence of our facial reduction algorithm for the conic optimization is presented. We also observe that our facial reduction algorithm has a practical impact by showing numerical experiments for graph partition problems; our facial reduction algorithm in fact enhances the numerical stability in those problems.     

Endomorphisms of expansive systems on compact metric spaces and the pseudo-orbit tracing property

We investigate the interrelationships between the dynamical properties of commuting continuous maps of a compact metric space. Let be a compact metric space.

First we show the following. If is an expansive onto continuous map with the pseudo-orbit tracing property (POTP) and if there is a topologically mixing continuous map with , then is topologically mixing. If and are commuting expansive onto continuous maps with POTP and if is topologically transitive with period , then for some dividing , , where the , , are the basic sets of with such that all have period , and the dynamical systems are a factor of each other, and in particular they are conjugate if is a homeomorphism.

Then we prove an extension of a basic result in symbolic dynamics. Using this and many techniques in symbolic dynamics, we prove the following. If is a topologically transitive, positively expansive onto continuous map having POTP, and is a positively expansive onto continuous map with , then has POTP. If is a topologically transitive, expansive homeomorphism having POTP, and is a positively expansive onto continuous map with , then has POTP and is constant-to-one.

Further we define `essentially LR endomorphisms' for systems of expansive onto continuous maps of compact metric spaces, and prove that if is an expansive homeomorphism with canonical coordinates and is an essentially LR automorphism of , then has canonical coordinates. We add some discussions on basic properties of the essentially LR endomorphisms.

     

Dynamic Enumeration of All Mixed Cells

The polyhedral homotopy method, which has been known as a powerful numerical method for computing all isolated zeros of a polynomial system, requires all mixed cells of the support of the system to construct a family of homotopy functions. The mixed cells are reformulated in terms of a linear inequality system with an additional combinatorial condition. An enumeration tree is constructed among a family of linear inequality systems induced from it such that every mixed cell corresponds to a unique feasible leaf node, and the depth-first search is applied to the enumeration tree for finding all the feasible leaf nodes. How to construct such an enumeration tree is crucial in computational efficiency. This paper proposes a dynamic construction of an enumeration tree, which branches each parent node into its child nodes so that the number of feasible child nodes is expected to be small; hence we can prune many subtrees which do not contain any mixed cell. Numerical results exhibit that the proposed dynamic construction of an enumeration tree works very efficiently for large scale polynomial systems; for example, it generated all mixed cells of the cyclic-15 problem for the first time in less than 16 hours.     

A Kinetically Stabilized [1.1]Paracyclophane: Isolation and X-Ray Structural Analysis

Benzene rings severely bent and closely stacked face-to-face are revealed in the crystal structure of the [1.1]paracyclophane derivative 1 , which could be isolated thanks to the kinetic stabilization provided by the steric shielding of the bridgehead sites by the substituents.     

Adsorption Characteristics in Zeolite Nano-Pore Evaluated by use of Nitrogen Monoxide as a Probe Adsorbate

Adsorption isotherms of nitrogen monoxide (NO) and in situ EPR spectra of adsorbed NO on mordenite zeolites (MOR) of different cation types (HM, NaM and CaM) are measured at different temperatures to elucidate the effect of the strong adsorption promoted by the enhancement of potential field in micropore of MOR (micropore filling) as well as the electrostatic interaction in MOR on NO adsorption. The NO molecules adsorb irreversibly and fill up the micropore of MOR at 201 K, above the critical temperature of NO, regardless of the kind of cation species. The NO adsorption takes place even at 273 K. In the adsorption at 273 K, the strength of electrostatic field formed by cation sites affects the adsorptivity and the order of saturation amount of adsorption (V _s) corresponds to that of the electrostatic field strength. EPR results show that NO molecules strongly interact with cation sites in MOR and disproponation reaction of NO take place on CaM.     

Asymptotic profile of solutions for the damped wave equation with a nonlinear convection term

This paper is concerned with the large time behavior of solutions to the initial value problem for the damped wave equations with nonlinear convection in one‐dimensional whole space. In 2007, Ueda and Kawashima showed that the solution tends to a self similar solution of the Burgers equation. However, they did not mention that their decay estimate is optimal or not. Under this situation, the aim of this paper was to find out the sharp decay estimate by studying the second asymptotic profile of solutions. The explicit representation formula and the decay estimates of the solution for the linearized equation including the lower order term play crucial roles in our analysis.     

Asymptotic Behavior of Solutions to the Drift-Diffusion Equation with Critical Dissipation

In this paper, the initial value problem for the drift-diffusion equation which stands for a model of a semiconductor device is studied. When the dissipative effect on the drift-diffusion equation is given by the half Laplacian, the dissipation balances to the extra force term. This case is called critical. The goal of this paper is to derive decay and asymptotic expansion of the solution to the drift-diffusion equation as time variable tends to infinity.     

An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones

This paper is based on a recent work by Kojima which extended sums of squares relaxations of polynomial optimization problems to polynomial semidefinite programs. Let and be a finite dimensional real vector space and a symmetric cone embedded in ; examples of and include a pair of the N-dimensional Euclidean space and its nonnegative orthant, a pair of the N-dimensional Euclidean space and N-dimensional second-order cones, and a pair of the space of m × m real symmetric (or complex Hermitian) matrices and the cone of their positive semidefinite matrices. Sums of squares relaxations are further extended to a polynomial optimization problem over , i.e., a minimization of a real valued polynomial a(x) in the n-dimensional real variable vector x over a compact feasible region , where b(x) denotes an - valued polynomial in x. It is shown under a certain moderate assumption on the -valued polynomial b(x) that optimal values of a sequence of sums of squares relaxations of the problem, which are converted into a sequence of semidefinite programs when they are numerically solved, converge to the optimal value of the problem. Research supported by Grant-in-Aid for Scientific Research on Priority Areas 16016234.