EFFICIENTLY COMPUTING WITH DESIGN STRUCTURE MATRICES

被引：0
|
作者：
Hossain, Shahadat [1 ]
机构：
[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB T1K 3M4, Canada
来源：
MANAGING COMPLEXITY BY MODELLING DEPENDENCIES | 2010年
关键词：
sparse data structure; block triangular form; strongly connected component; depth-first search;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页码：345 / 350
页数：6
相关论文
共 50 条
  • [1] Efficiently computing the Uhlmann fidelity for density matrices
    Baldwin, Andrew J.
    Jones, Jonathan A.
    PHYSICAL REVIEW A, 2023, 107 (01)
  • [2] Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
    Schwartz, Moshe
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 430 (04) : 1364 - 1374
  • [3] Markowitz-type heuristics for computing Jacobian matrices efficiently
    Albrecht, A
    Gottschling, P
    Naumann, U
    COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2003, 2658 : 575 - 584
  • [4] Securely and Efficiently Computing the Hermite Normal Form of Integer Matrices via Cloud Computing
    Zhao, Wei
    Tian, Chengliang
    Tian, Weizhong
    Zhang, Yan
    IEEE ACCESS, 2020, 8 : 137616 - 137630
  • [5] Markowit z-type heuristics for computing jacobian matrices efficiently
    Department of Computer Science, University of Hertfordshire, United Kingdom
    不详
    Lect. Notes Comput. Sci., (575-584):
  • [6] Extending design structure matrices and domain mapping matrices by multiple design structure matrices
    Eichinger, Markus
    Maurer, Maik
    Pulm, Udo
    Lindemann, Udo
    Proceedings of the 8th Biennial Conference on Engineering Systems Design and Analysis, Vol 1, 2006, : 889 - 898
  • [7] ON EFFICIENTLY COMPUTING THE EIGENVALUES OF LIMITED-MEMORY QUASI-NEWTON MATRICES
    Erway, Jennifer B.
    Marcia, Roummel F.
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2015, 36 (03) : 1338 - 1359
  • [8] A RANDOMIZED BLOCKED ALGORITHM FOR EFFICIENTLY COMPUTING RANK-REVEALING FACTORIZATIONS OF MATRICES
    Martinsson, Per-Gunnar
    Voronin, Sergey
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (05): : S485 - S507
  • [9] Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices
    Sul, Seung-Jin
    Brammer, Grant
    Williams, Tiffani L.
    ALGORITHMS IN BIOINFORMATICS, WABI 2008, 2008, 5251 : 123 - 134
  • [10] Efficiently computing and deriving topological relation matrices between complex regions with broad boundaries
    Du, Shihong
    Guo, Luo
    Wang, Qiao
    Qin, Qimin
    ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2008, 63 (06) : 593 - 609
12345