Výsledky vyhledávání - sparse matrix algorithm for network solution by tearing

  • Zobrazuji výsledky 1 - 8 z 8
Upřesnit hledání
  1. 1

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

    ISSN: 0098-4094
    Vydáno: IEEE 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…”
    Získat plný text
    Journal Article
  2. 2

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

    ISSN: 1017-1398, 1572-9265
    Vydáno: New York Springer US 01.11.2019
    Vydáno v 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…”
    Získat plný text
    Journal Article
  3. 3

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

    ISSN: 0098-4094
    Vydáno: IEEE 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…”
    Získat plný text
    Journal Article
  4. 4

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

    ISSN: 0253-3839, 2158-7299
    Vydáno: Taylor & Francis Group 01.09.1988
    “…]. In this paper, tearing is applied to hierarchically described networks and a new algorithm based on Gaussian elimination is presented…”
    Získat plný text
    Journal Article
  5. 5

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

    Vydáno: 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…”
    Získat plný text
    Konferenční příspěvek
  6. 6

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

    ISSN: 0018-9510
    Vydáno: IEEE 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…”
    Získat plný text
    Journal Article
  7. 7

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

    ISSN: 0098-4094
    Vydáno: IEEE 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…”
    Získat plný text
    Journal Article
  8. 8

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

    ISSN: 0098-4094
    Vydáno: IEEE 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…”
    Získat plný text
    Journal Article