Routing multiterminal nets on a hexagonal grid

Channel routing is a vital task in the layout design of VLSI circuits. Multiterminal channel routing is different from two-terminal one. While the later is quite understood, the former still poses the difficulty. In this paper, we investigate the multiterminal channel routing problem in a hexagonal model, whose grid is composed of horizontal tracks, right tracks (with slope +60°), and left tracks (with slope −60°). We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. Furthermore, we can wire the layout produced by the router using four layers and there are no overlaps among different layers. This improves the previous known results [15, 19].     

TWO-LEVEL METHOD FOR UNSTEADY NAVIER-STOKES EQUATIONS IN STREAM FUNCTION FORM

Two-level finite element approximation to stream function form of unsteady Navier-Stokes equations is studied. This algorithm involves solving one nonlinear system on a coarse grid and one linear problem on a fine grid. Moreover,the scaling between these two grid sizes is super-linear. Approximation,stability and convergence aspects of a fully discrete scheme are analyzed. At last a numrical example is given whose results show that the algorithm proposed in this paper is effcient.     

A two‐grid stabilized mixed finite element method for Darcy‐Forchheimer model

A two‐grid stabilized mixed finite element method based on pressure projection stabilization is proposed for the two‐dimensional Darcy‐Forchheimer model. We use the derivative of a smooth function, , to approximate the derivative of in constructing the two‐grid algorithm. The two‐grid method consists of solving a small nonlinear system on the coarse mesh and then solving a linear system on the fine mesh. There are a substantial reduction in computational cost. We prove the existence and uniqueness of solution of the discrete schemes on the coarse grid and the fine grid and obtain error estimates for the two‐grid algorithm. Finally, some numerical experiments are carried out to verify the accuracy and efficiency of the method.     

A new algorithm that generates the image of the attractor of a generalized iterated function system

Numerical Algorithms - We provide a new algorithm (called the grid algorithm) designed to generate the image of the attractor of a generalized iterated function system on a finite dimensional space...     

A Multigrid Algorithm for Hybrid Joint PDF Simulations in Complex Geometries

In hybrid joint probability density function (joint PDF) algorithms for turbulent reactive flows the equations for the mean flow discretized with a classical grid based method (e.g. finite volume methods (FVM)) are solved together with a Monte Carlo (particle) method for the joint velocity composition PDF. When applied for complex geometries, the solution strategy for such methods which aims at obtaining a converged solution of the coupled problem on a sufficiently fine grid becomes very important. This paper describes one important aspect of this solution strategy, i.e. multigrid computing, which is well known to be very efficient for computing numerical solutions on fine grids. Two sets of grid based variables are involved: cell-centered variables from the FVM and node-centered variables, which denote the moments of the PDF extracted from the particle fields. Starting from a given multiblock grid environment first a new (refined or coarsened) grid is defined retaining the grid quality. The projection and prolongation operators are defined for the two sets of variables. In this new grid environment the particles are redistributed. The effectiveness of the multigrid algorithm is demonstrated. Compared to solely solving on the finest grid, convergence can be reached about one order of magnitude faster when using the multigrid algorithm in three stages. Computation time used for projection or prolongation is negligible. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Two grid discretizations with backtracking of the stream function form of the Navier-Stokes equations

We analyze a two grid finite element method with backtracking for the stream function formulation of the stationary Navier—Stokes equations. This two grid method involves solving one small, nonlinear coarse mesh system, one linearized system on the fine mesh and one linear correction problem on the coarse mesh. The algorithm and error analysis are presented.     

A cascadic multigrid algorithm for semilinear elliptic problems

Summary. We propose a cascadic multigrid algorithm for a semilinear elliptic problem. The nonlinear equations arising from linear finite element discretizations are solved by Newton's method. Given an approximate solution on the coarsest grid on each finer grid we perform exactly one Newton step taking the approximate solution from the previous grid as initial guess. The Newton systems are solved iteratively by an appropriate smoothing method. We prove that the algorithm yields an approximate solution within the discretization error on the finest grid provided that the start approximation is sufficiently accurate and that the initial grid size is sufficiently small. Moreover, we show that the method has multigrid complexity. Received February 12, 1998 / Revised version received July 22, 1999 / Published online June 8, 2000     

Algorithm for reduced grid generation on a sphere for a global finite-difference atmospheric model

A reduced latitude-longitude grid is a modified version of a uniform spherical grid in which the number of longitudinal grid points is not fixed but depends on latitude. A method for constructing a reduced grid for a global finite-difference semi-Lagrangian atmospheric model is discussed. The key idea behind the algorithm is to generate a one-dimensional latitude grid and then to find a reduced grid that not only has a prescribed resolution structure and an admissible cell shape distortion but also minimizes a certain functional. The functional is specified as the rms interpolation error of an analytically defined function. In this way, the interpolation error, which is a major one in finite-difference semi-Lagrangian models, is taken into account. The potential of the proposed approach is demonstrated as applied to the advection equation on a sphere, which is numerically solved with various velocity fields on constructed reduced grids.     

Adaptive Interpolation Algorithm Based on a kd-Tree for Numerical Integration of Systems of Ordinary Differential Equations with Interval Initial Conditions

We consider issues related to the numerical solution of interval systems of ordinary differential equations. We suggest an algorithm that permits finding interval estimates of solutions with prescribed accuracy in reasonable time. The algorithm constructs an adaptive partition (a dynamic structured grid) based on a kd-tree over the space formed by interval initial conditions for the ordinary differential equations. In the operation of the algorithm, a piecewise polynomial function interpolating the dependence of the solution on the specific values of interval parameters is constructed at each step of solution of the original problem. We prove that the global error estimate linearly depends on the height of the kd-tree. The algorithm is tested on several examples; the test results show its efficiency when solving problems of the class under study.     

Numerical Analysis of a Nonlinear Singularly Perturbed Delay Volterra Integro-Differential Equation on an Adaptive Grid

In this paper, we study a nonlinear first-order singularly perturbed Volterra integro-differential equation with delay. This equation is discretized by the backward Euler for differential part and the composite numerical quadrature formula for integral part for which both an a priori and an a posteriori error analysis in the maximum norm are derived. Based on the a priori error bound and mesh equidistribution principle, we prove that there exists a mesh gives optimal first order convergence which is robust with respect to the perturbation parameter. The a posteriori error bound is used to choose a suitable monitor function and design a corresponding adaptive grid generation algorithm. Furthermore, we extend our presented adaptive grid algorithm to a class of second-order nonlinear singularly perturbed delay differential equations. Numerical results are provided to demonstrate the effectiveness of our presented monitor function. Meanwhile, it is shown that the standard arc-length monitor function is unsuitable for this type of singularly perturbed delay differential equations with a turning point.     

A comparative analysis of adaptive algorithms in the finite element method for solving the boundary value problem for a stationary reaction-diffusion equation

A new adaptive algorithm is proposed for constructing grids in the hp-version of the finite element method with piecewise polynomial basis functions. This algorithm allows us to find a solution (with local singularities) to the boundary value problem for a one-dimensional reaction-diffusion equation and smooth the grid solution via the adaptive elimination and addition of grid nodes. This algorithm is compared to one proposed earlier that adaptively refines the grid and deletes nodes with the help of an estimate for the local effect of trial addition of new basis functions and the removal of old ones. Results are presented from numerical experiments aimed at assessing the performance of the proposed algorithm on a singularly perturbed model problem with a smooth solution.     

Two dimension-curvilinear grid for open channel flow simulation

A mathematical model for two-dimensional flow simulation in an open channel is developed. The model is obtained through the use of a stretched curvilinear grid which defines points where velocity and surface elevation are simulated. Simulation is achieved by numerically integrating the Navier-Stokes mass and momentum equations using centred finite difference approximations of derivatives. The model uses an implicit discretization scheme, the Newton-Raphson iterative technique and a customized Gauss elimination solving algorithm. The computer program developed for this model was tested for uniform, non-uniform and unsteady flow conditions. The results have been found consistent with theoretical solutions and/or field measurements. Limitation and verification of the model is also outlined.     

Two‐Grid method for nonlinear parabolic equations by expanded mixed finite element methods

In this article, we develop a two‐grid algorithm for nonlinear reaction diffusion equation (with nonlinear compressibility coefficient) discretized by expanded mixed finite element method. The key point is to use two‐grid scheme to linearize the nonlinear term in the equations. The main procedure of the algorithm is solving a small‐scaled nonlinear equations on the coarse grid and dealing with a linearized system on the fine space using the Newton iteration with the coarse grid solution. Error estimation to the expanded mixed finite element solution is analyzed in detail. We also show that two‐grid solution achieves the same accuracy as long as the mesh sizes satisfy H = O(h^1/2). Two numerical experiments are given to verify the effectiveness of the algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

An interior point algorithm with inexact step computation in function space for state constrained optimal control

We consider an interior point method in function space for PDE constrained optimal control problems with state constraints. Our emphasis is on the construction and analysis of an algorithm that integrates a Newton path-following method with adaptive grid refinement. This is done in the framework of inexact Newton methods in function space, where the discretization error of each Newton step is controlled by adaptive grid refinement in the innermost loop. This allows to perform most of the required Newton steps on coarse grids, such that the overall computational time is dominated by the last few steps. For this purpose we propose an a-posteriori error estimator for a problem suited norm.     

Grid Drawings of 4-Connected Plane Graphs

A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on plane grid points and all edges are drawn as straight line segments between their endpoints without any edge-intersection. In this paper we give a very simple algorithm to find a grid drawing of any given 4-connected plane graph G with four or more vertices on the outer face. The algorithm takes time O(n) and yields a drawing in a rectangular grid of width \lceil n/2 \rceil - 1 and height \lfloor n/2\rfloor if G has n vertices. The algorithm is best possible in the sense that there are an infinite number of 4-connected plane graphs, any grid drawings of which need rectangular grids of width \lceil n/2 \rceil - 1 and height \lfloor n/2\rfloor . Received October 13, 1999, and in revised form July 18, 2000. Online publication February 26, 2001.     

The shortest multipaths problem in a capacitated dense channel

In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the results of Formann et al. [M. Formann, D. Wagner, F. Wagner, Routing through a dense channel with minimum total wire length, Journal of Algorithms 15 (1993) 267–283], by considering arbitrary horizontal and vertical capacities.     

Solution of optimal control problems by a variational method

An algorithm for numerically solving optimal control problems by methods applied to ill-posed problems is discussed. The stable algorithms for solving such problems on compact sets developed by Academician A.N. Tikhonov in the twentieth century can be applied to problems of optimal control. The special feature of optimal control problems is the discontinuity of a control function. This difficulty is overcome by introducing a moving computational grid. The step size of the grid is determined by solving the speed problem.     

Multiresolution algorithms for the numerical solution of hyperbolic conservation laws

Given any scheme in conservation form and an appropriate uniform grid for the numerical solution of the initial value problem for one-dimensional hyperbolic conservation laws we describe a multiresolution algorithm that approximates this numerical solution to a prescribed tolerance in an efficient manner. To do so we consider the grid-averages of the numerical solution for a hierarchy of nested diadic grids in which the given grid is the finest, and introduce an equivalent multiresolution representation. The multiresolution representation of the numerical solution consists of its grid-averages for the coarsest grid and the set of errors in predicting the grid-averages of each level of resolution in this hierarchy from those of the next coarser one. Once the numerical solution is resolved to our satisfaction in a certain locality of some grid, then the prediction errors there are small for this particular grid and all finer ones; this enables us to compress data by setting to zero small components of the representation which fall below a prescribed tolerance. Therefore instead of computing the time-evolution of the numerical solution on the given grid we compute the time-evolution of its compressed multiresolution representation. Algorithmically this amounts to computing the numerical fluxes of the given scheme at the points of the given grid by a hierarchical algorithm which starts with the computation of these numerical fluxes at the points of the coarsest grid and then proceeds through diadic refinements to the given grid. At each step of refinement we add the values of the numerical flux at the center of the coarser cells. The information in the multiresolution representation of the numerical solution is used to determine whether the solution is locally well-resolved. When this is the case we replace the costly exact value of the numerical flux with an accurate enough approximate value which is obtained by an inexpensive interpolation from the coarser grid. The computational efficiency of this multiresolution algorithm is proportional to the rate of data compression (for a prescribed level of tolerance) that can be achieved for the numerical solution of the given scheme.     

Competitive on-line coverage of grid environments by a mobile robot

We describe in this paper two on-line algorithms for covering planar areas by a square-shaped tool attached to a mobile robot. Let D be the tool size. The algorithms, called Spanning Tree Covering (STC) algorithms, incrementally subdivide the planar area into a grid of D-size cells, while following a spanning tree of a grid graph whose nodes are 2D-size cells. The two STC algorithms cover general planar grids. The first, Spiral-STC, employs uniform weights on the grid-graph edges and generates spiral-like covering patterns. The second, Scan-STC, assigns lower weights to edges aligned with a particular direction and generates scan-like covering patterns along this direction. Both algorithms cover any planar grid using a path whose length is at most (n+m)D, where n is the total number of D-size cells and mn is the number of boundary cells, defined as cells that share at least one point with the grid boundary. We also demonstrate that any on-line coverage algorithm generates a covering path whose length is at least (2−)l_opt in worst case, where l_opt is the length of the optimal off-line covering path. Since (n+m)D2l_opt, the bound is tight and the STC algorithms are worst-case optimal. Moreover, in practical environments mn, and the STC algorithms generate close-to-optimal covering paths in such environments.     

Numerical modelling of free-surface shallow flows over irregular topography with complex geometry

A well-balanced Godunov-type finite volume algorithm is developed for modelling free-surface shallow flows over irregular topography with complex geometry. The algorithm is based on a new formulation of the classical shallow water equations in hyperbolic conservation form. Unstructured triangular grids are used to achieve the adaptability of the grid to the geometry of the problem and to facilitate localised refinement. The numerical fluxes are calculated using HLLC approximate Riemann solver, and the MUSCL-Hancock predictor–corrector scheme is adopted to achieve the second-order accuracy both in space and in time where the solutions are continuous, and to achieve high-resolution results where the solutions are discontinuous. The novelties of the algorithm include preserving well-balanced property without any additional correction terms and the wet/dry front treatments. The good performance of the algorithm is demonstrated by comparing numerical and theoretical results of several benchmark problems, including the preservation of still water over a two-dimensional hump, the idealised dam-break flow over a frictionless flat rectangular channel, the circular dam-break, and the shock wave from oblique wall. Besides, two laboratory dam-break cases are used for model validation. Furthermore, a practical application related to dam-break flood wave propagation over highly irregular topography with complex geometry is presented. The results show that the algorithm can correctly account for free-surface shallow flows with respect to its effectiveness and robustness thus has bright application prospects.