Fig 2 - uploaded by Yoshio Oyanagi
Content may be subject to copyright.
Download
View publication
4. The nonzero elements of the preconditioner matrix.  

4. The nonzero elements of the preconditioner matrix.  

Source publication
Fig. 1.1. Eciency versus the number of elements per processor.  
Fig. 1.2. Eciency versus the number of nodes per processor.
Fig. 2.4. The nonzero elements of the preconditioner matrix.  
Fig. 2.3. The nonzero elements of the Jacobian matrix.
Implementation of sparta, a Highly Parallel Circuit Simulator by the Preconditioned Jacobi Method, on a Distributed Memory Machine
Article
Full-text available
  • Dec 1998
This paper investigates an efficient implementation of circuit simulator sparta based on the preconditioned Jacobi method on a loosely coupled distributed memory machine Fujitsu AP1000. The preconditioned relaxation methods are linear solvers effective in large scale circuit simulations. Because the preconditioned Jacobi method has a high paralleli...
Cite
Download full-text

Similar publications

Figure 1: Solver structure 
Figure 2: 
Figure 3: New Linear Solution Strategy 
Table 3 : Simulation Times in Seconds on Four Cores (F indicates...
+4 Figure 4: IC Connectivity Histogram for ckt7 
A parallel preconditioning strategy for efficient transistor-level circuit simulation
Conference Paper
Full-text available
  • Nov 2009
We describe a parallel computing approach for large-scale SPICE-accurate circuit simulation, which is based on a new strategy for the parallel preconditioned iterative solution of circuit matrices. This strategy consists of several steps, including singleton removal, block triangular form (BTF) reordering, hypergraph partitioning, and a block Jacob...
View

Citations

... To improve those problems of the direct method, some iterative linear solvers [1,2,6] were proposed for large-scale circuit transient analysis. Among them, the waveform relaxation method [1] has attracted researchers' much attention. ...
The ensparsed LU decomposition method for large scale circuit transient analysis
Conference Paper
Full-text available
  • Mar 1998
We propose the Ensparsed LU decomposition (ELU) method as a linear solver for large-scale circuit transient analysis. Ensparsing is an algorithmic technique of ignoring small values in computation. While some researchers have used ensparsing by value in linear solvers for circuit simulation, the ELU method incorporates ensparsing by time as well. A high performance implementation of the ELU method for transient analysis is also investigated. The ELU method is faster than the conventional linear solvers, and the advantages of the ELU method will still increase for larger circuits
View
The Assault on Occupancy in Surabaya: Legible and Illegible Landscapes in a City of Passage
Article
  • Nov 2009
  • DEV CHANGE
This article takes as its starting point the burning down of traditional markets and clearance of squatter communities and street vendors that took place in the major Indonesian port city of Surabaya during 2007–08. It is argued that a legible landscape facilitating intervention, simulation and passage now marks a city where malls and hotels linked into new accelerated networks of unobstructed streets form the dominant presence. Using recent anthropological investigation from a poor neighbourhood and broader economic analysis of urban trends, the article demonstrates that while this landscape both displaces the poor and generates unprecedented revenues for the municipal government, it also contributes to a delegitimization of the city's municipal administration as it struggles to extend a legible gaze over the city's poor neighbourhoods.
View