Suchergebnisse - sparse matrix algorithm for network solution by tearing
-
1
Sparsity considerations in network solution by tearing
ISSN: 0098-4094Veröffentlicht: IEEE 01.05.1980Veröffentlicht in IEEE transactions on circuits and systems (01.05.1980)“… In this paper it is shown that all recently proposed sparse matrix algorithms for network solution by tearing belong to a set of algorithms which is derived by applying block matrix elimination …”
Volltext
Journal Article -
2
Distributed algebraic tearing and interconnecting techniques
ISSN: 1017-1398, 1572-9265Veröffentlicht: New York Springer US 01.11.2019Veröffentlicht in Numerical algorithms (01.11.2019)“… information, namely algebraic tearing and interconnecting methods. Hence, they are applicable to a wide variety of problems as they are based only on the adjacency graph corresponding to the coefficient matrix …”
Volltext
Journal Article -
3
Solution of large-scale networks by tearing
ISSN: 0098-4094Veröffentlicht: IEEE 01.12.1976Veröffentlicht in IEEE transactions on circuits and systems (01.12.1976)“… A solution algorithm based on LU decomposition is presented. If the network may be "torn apart," then the computations at the subnetwork level can be carried out independently …”
Volltext
Journal Article -
4
A multilevel diakoptics algorithm for large scale networks
ISSN: 0253-3839, 2158-7299Veröffentlicht: Taylor & Francis Group 01.09.1988Veröffentlicht in Journal of the Chinese Institute of Engineers (01.09.1988)“… ]. In this paper, tearing is applied to hierarchically described networks and a new algorithm based on Gaussian elimination is presented …”
Volltext
Journal Article -
5
Solution of Large, Sparse Systms in Design and Analysis
Veröffentlicht: 1975Veröffentlicht in 1975 IEEE-MTT-S International Microwave Symposium (1975)“… Presents some basic principles of the solution of large systems of simultaneous linear equations by sparsity methods, particularly Zollenkopf's bifactorisation method, and describes diakoptics …”
Volltext
Tagungsbericht -
6
Sparsity in diakoptic algorithms
ISSN: 0018-9510Veröffentlicht: IEEE 01.09.1977Veröffentlicht in IEEE transactions on power apparatus and systems (01.09.1977)“… Algorithms for network analysis by tearing are studied by determining their orders of computational complexity and comparing it to the computational complexity of the solution of the untorn network …”
Volltext
Journal Article -
7
A latent macromodular approach to large-scale sparse networks
ISSN: 0098-4094Veröffentlicht: IEEE 01.12.1976Veröffentlicht in IEEE transactions on circuits and systems (01.12.1976)“… sparse networks with highly repetitive subnetworks. An efficient algorithm requiring only the updating of a small portion of the Jacobian matrix when individual …”
Volltext
Journal Article -
8
Diakoptic and generalized hybrid analysis
ISSN: 0098-4094Veröffentlicht: IEEE 01.12.1976Veröffentlicht in IEEE transactions on circuits and systems (01.12.1976)“… Two elementary approaches are presented for analyzing large-scale linear resistive networks by first tearing them apart, solving the torn subnetworks separately, and then interconnecting the results …”
Volltext
Journal Article