Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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
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… Expand
  • figure 1
Highly Cited
2008
Highly Cited
2008
Fast approximate Random Walker segmentation using eigenvector precomputation
  • L. Grady, A. 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2007
Highly Cited
2007
Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
Abstract Interior-point methods are among the most efficient approaches for solving large-scale nonlinear programming problems… Expand
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.2
  • figure 4.3
Highly Cited
2006
Highly Cited
2006
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… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • table 5.1
Highly Cited
2004
Highly Cited
2004
Solving unsymmetric sparse systems of linear equations with PARDISO
Supernode partitioning for unsymmetric matrices together with complete block diagonal supernode pivoting and asynchronous… Expand
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… Expand
  • figure 2.1
  • table 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Highly Cited
1993
Highly Cited
1993
Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem
Hill-climbing, simulated annealing and genetic algorithms are search techniques that can be applied to most combinatorial… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 3
  • figure 3
  • figure 5
  • figure 6
Highly Cited
1987
Highly Cited
1987
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
This paper summarizes progress in the use of direct methods for solving very large sparse symmetric positive definite systems of… Expand
  • table 1
  • table 2
  • table 3
  • figure 2
  • table 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE