Reducing the parallel solution time of sparse circuit matrices using reordered Gaussian elimination and relaxation
- 6 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Circuit simulation on the connection machinePublished by Association for Computing Machinery (ACM) ,1987
- Efficient parallel processing technique for inverting matrices with random sparsityIEE Proceedings E Computers and Digital Techniques, 1986
- Relaxation Techniques for the Simulation of VLSI CircuitsPublished by Springer Nature ,1986
- Vectorized LU Decomposition Algorithms for Large-Scale Circuit SimulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- A Computation Model of Parallel Solution of Linear EquationsIEEE Transactions on Computers, 1980
- Optimal parallel triangulation of a sparse matrixIEEE Transactions on Circuits and Systems, 1979
- Algorithms for ASTAP--A network-analysis programIEEE Transactions on Circuit Theory, 1973
- Chaotic relaxationLinear Algebra and its Applications, 1969
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957