Convergence theories and a deluxe dual and primal finite element tearing and interconnecting algorithm are developed for a hybrid staggered DG finite element approximation of H(curl) elliptic problems in two dimensions. In addition to the advantages of staggered DG methods, the basis functions of the new hybrid staggered DG method are all locally supported in the triangular elements, and a Lagrange multiplier approach is applied to enforce the global connections of these basis functions. The interface problem on the Lagrange multipliers is further reduced to the resulting problem on the subdomain interfaces, and a dual and primal finite element tearing and interconnecting algorithm with an enriched weight factor is then applied to the resulting problem. Our algorithm is shown to give a condition number bound of <i>C</i>(1+log(<i>H</i><i>h</i>))², independent of the two parameters, where <i>H</i><i>h</i> is the number of

We discuss spectral and resonance properties of a Hamiltonian describing motion of an electron moving on a hybrid surface consisting on a halfline attached by its endpoint to a plane under influence of a constant magnetic field which interacts with its spin through a Rashba-type term.

The distribution of property is established through various mechanisms. In this paper we study the acreage distribution of land plots owned by natural persons in the Zln Region of the Czech Republic. We show that the data are explained in terms of a simple model in which the inheritance and market behavior are combined.

Degree theory has been developed as a tool for checking the solution existence of nonlinear equations. In his classic paper published in 1983, Browder developed a degree theory for mappings of monotone type f+ T, where f is a mapping of class (S)+ from a bounded open set in a reflexive Banach space X into its dual X, and T is a maximal monotone mapping from X into X. This breakthrough paved the way for many applications of degree theoretic techniques to several large classes of nonlinear partial differential equations. In this paper we continue to develop the results of Browder on the degree theory for mappings of monotone type f+ T. By enlarging the class of maximal monotone mappings and pseudo-monotone homotopies we obtain some new results of the degree theory for such mappings.

This paper proposes a two-level continuum transportation system approach to modeling a dynamic taxi traffic assignment (DTTA) problem in a dense network with real-time traffic information provision and three types of vehicles, including private cars, occupied taxis, and vacant taxis. The proposed approach treats the dense network as a continuum in the first level, in which private car and occupied taxi drivers are free to choose their paths in a two-dimensional continuous space. The proposed approach also divides the modeling region into many identical squares to form a cell-based network in the second level, in which the cells are classified into two categories: target cell with an acceptable expected rate of return (EROR) to vacant taxi drivers and non-target cell with an unacceptable EROR. The EROR associated with a cell is the ratio of the cumulative expected profit of a taxi driver who successfully picks up a customer during the customer search that starts from that cell to the sum of expected search time for this customer and expected occupied travel time to serve this customer. Based on the cell-based network, we develop a cell-based intervening opportunity model to capture the fact that vacant taxi drivers can meet a customer on the way to their destination zones and estimate the EROR. Each vacant taxi driver has a mixed strategy to determine his/her customer-search direction according to the EROR: Each vacant taxi driver in a target cell selects its neighbor cells with maximum EROR, and each vacant taxi driver in a non-target cell selects the travel time-based shortest path to his/her target cell. Meanwhile, each private car driver chooses the path that minimizes his/her own generalized travel cost, and each occupied taxi driver chooses the path that minimizes his/her customer's generalized in-vehicle travel cost. In our model, traffic density in the system is governed by the conservation law (CL), and the flow directions of different vehicles are determined by the path-choice strategies of their drivers, which are captured by Hamilton–Jacobi (HJ) equations. Both the proposed CL and HJ equations can be solved by the Lax–Friedrichs scheme, which forms the backbone of the developed solution algorithm. Finally, numerical examples and a case study are used to demonstrate the properties of the model, the performance of the solution algorithm, and the value of using our methodology for estimating network performance.