We present an algorithm for 2D and 3D capacitance analysis on multidielectric integrated circuits of arbitrary geometry. Our algorithm is stochastic in nature and as such fully parallellizable. It is intended to extract capacitance entries directly from a pixelized representation of the integrated circuit (IC), which can be produced from a SEM (scanning electron microscopy) image. Preprocessing...

This work is focused on the application of functional-type a posteriori error estimates and corresponding indicators to a class of time-dependent problems. We consider the algorithmic part of their derivation and implementation and also discuss the numerical properties of these bounds that comply with obtained numerical results. This paper examines two different methods of approximate solution ...

We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the well-known marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below an isosurface, in our approach an arbitrary number of vertex classes can be specified. Consequent...

Abstract In this paper, we propose a certified reduced basis (RB) method for quasilinear parabolic problems with strongly monotone spatial differential operator. We provide residual-based posteriori error estimate space-time formulation and the corresponding efficiently computable bound certification of method. introduce Petrov-Galerkin finite element discretization continuous problem use it as...

The numerical behavior of two implicit time-marching methods is investigated in solving two-dimensional unsteady compressible flows. The two methods are the second-order multistep backward differencing formula and the fourth-order multistage explicit first stage, single-diagonal coefficient, diagonally implicit Runge-Kutta scheme. A Newton-Krylov method is used to solve the nonlinear problem ar...

The Marching Cubes algorithm is a popular high-resolution isosurface extraction method used in volume data visualization. However, it is relatively computationally intensive making real-time operation on normal workstations a diicult goal when applied to large datasets. One solution is to transform the serial algorithm into a vector-parallel algorithm designed to exploit the potential computing...

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a “budget” remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causal...

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a “budget” remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causal...

In this paper we describe an experimental method and an analytical model for characterizing the surface energy inside a microchannel of micrometer size by measuring the marching velocity or position of a capillary meniscus. This method is based on the fact that the force summation of the meniscus surface tension and the filling reservoir gravitation might produce a pressure to pull liquid into ...

We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method is built on the novel observation that certain ridge curves of a function defined on a front propagated using the Fast Marching algorithm lie on the surface. Our method extracts and cuts these ridges to form the surface boundary. Our surfa...