A comparison of transformation methods for evaluating two‐dimensional weakly singular integrals

Accurate numerical evaluation of integrals arising in the boundary element method is fundamental to achieving useful results via this solution technique. In this paper, a number of techniques are considered to evaluate the weakly singular integrals which arise in the solution of Laplace's equation in three dimensions and Poisson's equation in two dimensions. Both are two‐dimensional weakly singular integrals and are evaluated using (in a product fashion) methods which have recently been used for evaluating one‐dimensional weakly singular integrals arising in the boundary element method. The methods used are based on various polynomial transformations of conventional Gaussian quadrature points where the transformation polynomial has zero Jacobian at the singular point. Methods which split the region of integration into sub‐regions are considered as well as non‐splitting methods. In particular, the newly introduced and highly accurate generalized composite subtraction of singularity and non‐linear transformation approach (GSSNT) is applied to various two‐dimensional weakly singular integrals. A study of the different methods reveals complex relationships between transformation orders, position of the singular point, integration kernel and basis function. It is concluded that the GSSNT method gives the best overall results for the two‐dimensional weakly singular integrals studied. Copyright © 2002 John Wiley & Sons, Ltd.     

Hopping and optical absorption of electrons in nano-porous crystal 12CaO·7Al2O3

Recently it has been discovered that a nano-porous main group oxide 12CaO·7Al₂O₃ (C12A7) can be converted from a wide-gap insulator to a good transparent conductor. Using ab initio modelling we explain good conductivity of this material by very small barriers for hopping of localised electrons between neighbouring positive cages. We show that optical absorption of C12A7 in infrared region and at energies higher than 2.7 eV is due to inter-cage and intra-cage electron transitions, respectively. The proposed mechanisms can be useful in further search for conducting transparent media.     

Low-truncation-error finite difference equations for photonicssimulation. II. Vertical-cavity surface-emitting lasers

For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing     

Management of multidimensional discrete data

Spatial database management involves two main categories of data: vector and raster data. The former has received a lot of in-depth investigation; the latter still lacks a sound framework. Current DBMSs either regard raster data as pure byte sequences where the DBMS has no knowledge about the underlying semantics, or they do not complement array structures with storage mechanisms suitable for huge arrays, or they are designed as specialized systems with sophisticated imaging functionality, but no general database capabilities (e.g., a query language). Many types of array data will require database support in the future, notably 2-D images, audio data and general signal-time series (1-D), animations (3-D), static or time-variant voxel fields (3-D and 4-D), and the ISO/IEC PIKS (Programmer's Imaging Kernel System) BasicImage type (5-D). In this article, we propose a comprehensive support ofmultidimensional discrete data (MDD) in databases, including operations on arrays of arbitrary size over arbitrary data types. A set of requirements is developed, a small set of language constructs is proposed (based on a formal algebraic semantics), and a novel MDD architecture is outlined to provide the basis for efficient MDD query evaluation.