Skip to search formSkip to main contentSkip to account menu

Supernode (circuit)

Known as: Supernode 
In circuit theory, a supernode is a theoretical construct that can be used to solve a circuit. This is done by viewing a voltage source on a wire as… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Millman's theoremNodal analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
We investigate the scalability of the hypergraph-based sparse matrix partitioning methods with respect to the increasing sizes of… 
Highly Cited
2009
Highly Cited
2009
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves
The supernodal method for sparse Cholesky factorization represents the factor L as a set of supernodes, each consisting of a… 
Highly Cited
2008
Highly Cited
2008
Fast approximate Random Walker segmentation using eigenvector precomputation
  • L. GradyA. Sinop
  • IEEE Conference on Computer Vision and Pattern…
  • 2008
  • Corpus ID: 2117965
Interactive segmentation is often performed on images that have been stored on disk (e.g., a medical image server) for some time… 
Highly Cited
2006
Highly Cited
2006
ON FAST FACTORIZATION PIVOTING METHODS FOR SPARSE SYMMETRI C INDEFINITE SYSTEMS
This paper discusses new pivoting factorization methods for solving sparse symmetric indenite sys- tems. As opposed to many… 
Highly Cited
2005
Highly Cited
2005
An Experimental Study of the Skype Peer-to-Peer VoIP System
Despite its popularity, relatively little is known about the traffic characteristics of the Skype VoIP system and how they differ… 
Highly Cited
1999
Highly Cited
1999
A Supernodal Approach to Sparse Partial Pivoting
We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve… 
Highly Cited
1997
Highly Cited
1997
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations… 
Review
1992
Review
1992
The C_NET Programming Environment: An Overview
The paper presents an overview of C_NET, a programming environment that has been specially designed to allow for the development… 
Highly Cited
1989
Highly Cited
1989
The influence of relaxed supernode partitions on the multifrontal method
In this paper we present an algorithm for partitioning the nodes of a graph into supernodes, which improves the performance of… 
Highly Cited
1988
Highly Cited
1988
Supernode partitioning
Supercompilers must reschedule computations defined by nested DO-loops in order to make an efficient use of supercomputer… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)