We present an error estimation driven three-dimensional unstructured mesh optimization technique based on a posteriori error estimation techniques. We briefly summarize error estimation techniques as well as mesh quality estimations and apply them to problems of semiconductor device and process simulation. We then optimize the tessellation of the simulation domain with different strategies. In ...

In this paper, we analyze some domain decomposition methods for inde nite elliptic problems on unstructured meshes. Our theory requires no assumption on the shape of subdomains. They can have arbitrary shape. Unlike the usual domain decomposition, the coarse and ne triangulations need not be nested and quasi-uniform. Furthermore, the nodes of substructures are not necessary to be the coarse gri...

The success of parallel computing in solving real-life computationally-intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important applications are both unstructured and dynamic in nature, making their efficient parallel implementation a daunting task. This paper presents the parallelization of a dynamic unstructured mesh adapta...

In this paper, we discuss the vertex space domain decomposition method (VSDDM) for solving the algebraic system of equations which arise from the discretization of symmetric and positive de nite elliptic boundary value problems via nite element methods on general unstructured meshes. Our theory does not require that the subdomains are shape regular and coarse grid is nested to the ne grid. Furt...

Many complex and unstructured decisions are hindered by a lack of clear understanding of various underlying assumptions and perspectives involved in the decision process. At present, little attention is paid to the elicitation of underlying assumptions and perspectives in dealing with complex issues in traditional decision support systems (DSS). We argue that the Socratic dialectic inquiry is a...

Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query rout...

The possibility of predicting the full three-dimensional unsteady separated flow around complex ship and helicopter geometries is explored using unstructured grids with a parallel flow solver. The flow solver used is a modified version of the Parallel Unstructured Maritime Aerodynamics (PUMA) software, which was written by Dr. Christopher Bruner as part of his doctoral thesis at the Virginia Po...

Highly resolved solutions of partial differential equations are important in many areas of science and technology nowadays. Only adaptive mesh refinement methods reduce the necessary work sufficiently allowing the calculation of realistic problems. Blockstructured SAMR methods are well-suited for the time-explicit computation of large-scale dynamical problems, but still require parallelization ...

In the recent years we have seen that Grover search algorithm [1] by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparison to classical systems. In this work we explore the idea of extending the Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with ...

We study the Structured Total Least Squares (STLS) problem of system of linear equations Ax = b, where A has a block circulant structure with N blocks. We show that by applying the Discrete Fourier Transform (DFT), the STLS problem decomposes into N unstructured Total Least Squares (TLS) problems. The N solutions of these problems are then assembled to generate the optimal global solution of th...