Suchergebnisse - sparse matrix algorithm for network solution by tearing

  • Treffer 1 - 8 von 8
Treffer weiter einschränken
  1. 1

    Sparsity considerations in network solution by tearing von Hajj, I.

    ISSN: 0098-4094
    Veröffentlicht: IEEE 01.05.1980
    Verö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. 2

    Distributed algebraic tearing and interconnecting techniques von Tselepidis, N. A., Filelis-Papadopoulos, C. K., Gravvanis, G. A.

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer US 01.11.2019
    Verö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. 3

    Solution of large-scale networks by tearing von Wu, F.

    ISSN: 0098-4094
    Veröffentlicht: IEEE 01.12.1976
    Verö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. 4

    A multilevel diakoptics algorithm for large scale networks von Yu, Fu-Chaw, Wu, Yan-Pei

    ISSN: 0253-3839, 2158-7299
    Veröffentlicht: Taylor & Francis Group 01.09.1988
    Verö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. 5

    Solution of Large, Sparse Systms in Design and Analysis von Wexler, A., Dobrowalski, J. A., Hammad, A. E.

    Veröffentlicht: 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. 6

    Sparsity in diakoptic algorithms von Alvarado, F.L., Reitan, D.K., Bahari-Kashani, M.

    ISSN: 0018-9510
    Veröffentlicht: IEEE 01.09.1977
    Verö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. 7

    A latent macromodular approach to large-scale sparse networks von Rabbat, N., Hsueh Hsieh

    ISSN: 0098-4094
    Veröffentlicht: IEEE 01.12.1976
    Verö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. 8

    Diakoptic and generalized hybrid analysis von Chua, L., Li-Kuan Chen

    ISSN: 0098-4094
    Veröffentlicht: IEEE 01.12.1976
    Verö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