J. R. Phillips. Error and complexity analysis for a collocation-grid-projection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proceedings of the 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in extraction speed and model size, making it possible to generate guaranteed passive low order models for efficient inclusion in a circuit simulator such as SPICE or SPECTRE. Combining our formulation with acceleration techniques such as the Fast Multipole Method [10, 11] or the Precorrected FFT [12], allows the accurate analysis of larger, more complex three dimensional geometries than previously possible. In Section 2 we discuss the integral formulation and discretization from which we derive the circuit equations that describe the interconnect effects. In Section 3 we describe a nodal ....

J. R. Phillips. Error and complexity analysis for a collocation-gridprojection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proc. 1995.

....in extraction speed and model size, making it possible to generate guaranteed passive low order models for efficient inclusion in a circuit simulator such as SPICE or SPECTRE. Combining our formulation with acceleration techniques such as the Fast Multipole Method [10, 11] or the Precorrected FFT [12], allows the accurate analysis of larger, more complex three dimensional geometries than previously possible. In Section 2 we discuss the integral formulation and discretization from which we derive the circuit equations that describe the interconnect effects. In Section 3 we describe a nodal ....

J. R. Phillips. Error and complexity analysis for a collocation-gridprojection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proc. 1995 Copper Mountain Conf. on Multigrid Methods, April 1995.

.... for computing the coefficients of the dual grid expansions is based on forcing the grid expansion to reproduce the exact potential on a set of collocation points (for an alternative see [6] These collocation points are usually chosen to be the quadrature points on a sphere containing the cube [9]. In order to test the new method, a point charge, and later a dipole, were systematically placed inside a cube at various positions, and the maximum error in long range potential due to the point charge or dipole is found at the second nearest neighbor cube, presumely the place with the largest ....

J. R. Phillips, "Error and complexity analysis for a collocation-grid-projection plus precorrectedFFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels," in Proceedings of the 1995 Copper Mountain Conference on Multigrid Methods, April 1995.

....in extraction speed and model size, making it possible to generate guaranteed passive low order models for efficient inclusion in a circuit simulator such as SPICE or SPECTRE. Combining our formulation with acceleration techniques such as the Fast Multipole Method [10, 11] or the Precorrected FFT [12], allows the accurate analysis of larger, more complex three dimensional geometries than previously possible. In Section 2 we discuss the integral formulation and discretization from which we derive the circuit equations that describe the interconnect effects. In Section 3 we describe a nodal ....

J. R. Phillips. Error and complexity analysis for a collocation-gridprojection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proc. 1995 Copper Mountain Conf. on Multigrid Methods, April 1995.

....on a modified nodal analysis formulation, it is possible to generate guaranteed passive low order models for efficient inclusion in a circuit simulator such as SPICE. Additionally, the algorithm is ripe for acceleration techniques such as the Fast Multipole Method [1, 3] or the Precorrected FFT [4] approach allowing the analysis of larger, more complex three dimensional geometries. In Section 2 we discuss the integral formulation and discretization from which we derive the large dense linear system describing the interconnect. In Section 3 we describe applying recent model order reduction ....

J. R. Phillips. Error and complexity analysis for a collocation-grid-projection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proceedings of the 1995 Copper Mountain Conference on Multigrid Methods, April 1995.

....in extraction speed and model size, making it possible to generate guaranteed passive low order models for efficient inclusion in a circuit simulator such as Spice or Spectre. Combining our formulation with acceleration techniques such as the Fast Multipole Method [10,11] or the Precorrected FFT [12], allows the accurate analysis of larger, more complex three dimensional geometries than previously possible. In Section 2 we discuss the integral formulation and discretization from which we derive the circuit equations that describe the interconnect effects. In Section 3 we describe a nodal ....

J. R. Phillips, "Error and complexity analysis for a collocation-gridprojection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels", In Proc. of the 1995 Copper Mountain Conf. on Multigrid Methods, April 1995.

.... [29] It can be shown that the error in potential due to the grid charge approximation of a charge distribution contained within a sphere of radius , at a distance from the center of the distribution, is of order if the test points are chosen to be the nodes of a quadrature rule accurate to order [30]. C. Computing Grid Potentials Once the charge has been projected to a grid, the operation , computing the potentials at the grid points due to the grid charges, is a 3 D convolution. We denote this as (10) where and are triplets specifying the grid points and is the inverse distance between ....

....cell (thus a cell is a near neighbor of itself) We have included only near neighbor interactions in the computational experiments of Sections V and VI. The worst case accuracy of the grid representation is a function of the ratio of the cell radius to the radius of the direct interaction region [30]. Thus, once the direct interaction region has been specified to be near neighbor cells, the selection of the cell size, and hence the grid spacing is purely a matter of computational efficiency. The cost of direct interactions will decrease monotonically as the cells are made smaller, but the ....

[Article contains additional citation context not shown here]

J. R. Phillips, "Error and complexity analysis for a collocation-gridprojection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels," in Proc. 1995.

No context found.

J. R. Phillips. Error and complexity analysis for a collocation-grid-projection plus precorrected-FFT algorithm for solving potential integral equations with Laplace or Helmholtz kernels. In Proceedings of the 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC