Construction of triangular DP surface and its application

In this paper, a new type of bivariate basis on a triangle is presented, which is constructed by extending the univariate NTP basis proposed by Delgado and Peña. Some algebraic properties and its recursive formulae are given. Then a new type of surfaces that is called triangular DP surface is defined, and its recursive evaluation algorithm is obtained. Also, in the case of low degree, its subdivision algorithm and degree elevation algorithm are derived. It is shown that this type of surfaces is obviously more advantageous than triangular Bézier surface, and hence extremely useful for geometric design, especially for the situation in which the surface needs to be evaluated quickly.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

On coordinate transformation and grid stretching for sparse grid pricing of basket options

We evaluate two coordinate transformation techniques in combination with grid stretching for pricing basket options in a sparse grid setting. The sparse grid technique is a basic technique for solving a high-dimensional partial differential equation. By creating a small hypercube sub-grid in the ‘composite’ sparse grid we can also determine hedge parameters accurately. We evaluate these techniques for multi-asset examples with up to five underlying assets in the basket.     

Sparse grids and hybrid methods for the chemical master equation

The direct numerical solution of the chemical master equation (CME) is usually impossible due to the high dimension of the computational domain. The standard method for solution of the equation is to generate realizations of the chemical system by the stochastic simulation algorithm (SSA) by Gillespie and then taking averages over the trajectories. Two alternatives are described here using sparse grids and a hybrid method. Sparse grids, implemented as a combination of aggregated grids are used to address the curse of dimensionality of the CME. The aggregated components are selected using an adaptive procedure. In the hybrid method, some of the chemical species are represented macroscopically while the remaining species are simulated with SSA. The convergence of variants of the method is investigated for a growing number of trajectories. Two signaling cascades in molecular biology are simulated with the methods and compared to SSA results. AMS subject classification (2000)  65C20, 60J25, 92C45     

Evaluation of adaptive mesh refinement and coarsening for the computation of compressible flows on unstructured meshes

The compressible gas flows of interest to aerospace applications often involve situations where shock and expansion waves are present. Decreasing the characteristic dimension of the computational cells in the vicinity of shock waves improves the quality of the computed flows. This reduction in size may be accomplished by the use of mesh adaption procedures. In this paper an analysis is presented of an adaptive mesh scheme developed for an unstructured mesh finite volume upwind computer code. This scheme is tailored to refine or coarsen the computational mesh where gradients of the flow properties are respectively high or low. The refinement and coarsening procedures are applied to the classical gas dynamic problems of the stabilization of shock waves by solid bodies. In particular, situations where oblique shock waves interact with an expansion fan and where bow shocks arise around solid bodies are considered. The effectiveness of the scheme in reducing the computational time, while increasing the solution accuracy, is assessed. It is shown that the refinement procedure alone leads to a number of computational cells which is 20% larger than when alternate passes of refinement and coarsening are used. Accordingly, a reduction of computational time of the same order of magnitude is obtained. Copyright © 2005 John Wiley & Sons, Ltd.     

A multiblock/multilevel mesh refinement procedure for CFD computations

A multiblock/multilevel algorithm with local refinement for general two‐ and three‐dimensional fluid flow is presented. The patched‐based local refinement procedure is presented in detail and algorithmic implementations are also presented. The multiblock implementation is essentially block‐unstructured, i.e. each block having its own local curvilinear co‐ordinate system. Refined grid patches can be put anywhere in the computational domain and can extend across block boundaries. To simplify the implementation, while still maintaining sufficient generality, the refinement is restricted to a refinement of the grid successively halving the grid size within a selected patch. The multiblock approach is implemented within the framework of the well‐known SIMPLE solution strategy. Computational experiments showing the effect of using the multilevel solution procedure are presented for a sample elliptic problem and a few benchmark problems of computational fluid dynamics (CFD). Copyright © 2001 John Wiley & Sons, Ltd.     

Software package for 3D viscous gas flow simulation on multiprocessor computer systems

A parallel software package designed for the numerical simulation of three-dimensional viscous gas flows is presented. The numerical algorithm is based on kinetically consistent difference schemes used on locally refined grids. The software package has been tested in various super-and subsonic flow problems. It provides an opportunity for the direct simulation of turbulent flows. The efficiency of parallelization is analyzed depending on the problem size and the number of processors.     

A numerical technique for laminar swirling flow at the interface between porous and homogenous fluid domains

There have been a few recent numerical implementations of the stress‐jump condition at the interface of conjugate flows, which couple the governing equations for flows in the porous and homogenous fluid domains. These previous demonstration cases were for two‐dimensional, planar flows with simple geometries, for example, flow over a porous layer or flow through a porous plug. The present study implements the interfacial stress‐jump condition for a non‐planar flow with three velocity components, which is more realistic in terms of practical flow applications. The steady, laminar, Newtonian flow in a stirred micro‐bioreactor with a porous scaffold inside was investigated. It is shown how to implement the interfacial jump condition on the radial, axial, and swirling velocity components. To avoid a full three‐dimensional simulation, the flow is assumed to be independent of the azimuthal direction, which makes it an axisymmetric flow with a swirling velocity. The present interface treatment is suitable for non‐flat surfaces, which is achieved by applying the finite volume method based on body‐fitted and multi‐block grids. The numerical simulations show that a vortex breakdown bubble, attached to the free surface, occurs above a certain Reynolds number. The presence of the porous scaffold delays the onset of vortex breakdown and confines it to a region above the scaffold. Copyright © 2008 John Wiley & Sons, Ltd.     

GLOBAL SUPERCONVERGENCES OF THE DOMAIN DECOMPOSITION METHODS WITH NONMATCHING GRIDS

1. IlltroductionA nonconforming domain decomposition method with Lagrangian multipliers was proposedin [13]. The basic idea of this method is to deal with the nonconforming of nonmatching gridsby illtroducing the Lagrangian multipliers on interfaces of subdomains and its advalltages arethat it allows not only the incompatibility of the internal variables on the interface betweensubdomains, but also the discolltinuity of the boundary variables on the common venices ofsubdomains. Thus one can c…     

Metal grid technologies for flexible transparent conductors in large-area optoelectronics

Mechanically flexible optoelectronic devices such as flexible displays, touch-screens, wearable electronics and solar cells are attracting significant commercial interest. In these devices, a transparent conductor is an essential element that delivers or collects the electrical current to the active material while it allows light to enter or exit from the device. The transparent conductor is composed of a transparent conductive film and a metallic grid providing electrical conduction over the large area. In this article, we review the established processes used by the industry as well as emerging solution-based methods for processing metal grids. Furthermore, we review the issues and potentials of these emerging processes facing for large-area deployment. In the final section, we evaluate three applications of flexible transparent conductors in: perovskite-based solar cells, organic light emitting diodes and electrochromic windows.