Suchergebnisse - supernodal factorization algorithm

Andere Suchmöglichkeiten:

  1. 1

    A Parallel Direct Finite Element Solver Empowered by Machine Learning for Solving Large-Scale Electromagnetic Problems von Wang, Junjie, Zuo, Sheng, Zhao, Xunwang, Tian, Min, Lin, Zhongchao, Zhang, Yu

    ISSN: 0018-926X, 1558-2221
    Veröffentlicht: New York IEEE 01.04.2025
    Veröffentlicht in IEEE transactions on antennas and propagation (01.04.2025)
    “… Our proposed solver features adaptive fill-reducing ordering and highly assembled lazy offloading (HALO) factorization …”
    Volltext
    Journal Article
  2. 2

    A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors von Ng, Esmond, Peyton, Barry W.

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 01.07.1993
    Veröffentlicht in SIAM journal on scientific computing (01.07.1993)
    “… The new algorithm is a straightforward parallelization of the left-looking supernodal sparse Cholesky factorization algorithm …”
    Volltext
    Journal Article
  3. 3

    On Parallel Sparse LU Factorization: Supernodal Left-Looking Multi-Stage Algorithm von Karasenko, Ivan I., Gumalevskii, Roman V., Rakitskiy, Anton A.

    ISSN: 2325-419X
    Veröffentlicht: IEEE 29.06.2023
    “… Such methods are based on matrix decomposition into the product of triangular factors. Computation of factors (factorization …”
    Volltext
    Tagungsbericht
  4. 4

    Application of supernodal sparse factorization and inversion to the estimation of (co)variance components by residual maximum likelihood von Masuda, Y, Baba, T, Suzuki, M

    ISSN: 0931-2668, 1439-0388, 1439-0388
    Veröffentlicht: Germany Blackwell Wissenschafts-Verlag 01.06.2014
    Veröffentlicht in Journal of animal breeding and genetics (1986) (01.06.2014)
    “… ), which are often required in residual maximum likelihood (REML). Supernodal left‐looking and inverse multifrontal algorithms were employed for sparse factorization and inversion, respectively …”
    Volltext
    Journal Article
  5. 5

    Accelerating sparse Cholesky factorization on GPUs von Rennich, Steven C., Stosic, Darko, Davis, Timothy A.

    ISSN: 0167-8191, 1872-7336
    Veröffentlicht: Elsevier B.V 01.11.2016
    Veröffentlicht in Parallel computing (01.11.2016)
    “… •Sparse direct factorization is a critical component of scientific computing•GPU acceleration of it is difficult due to algorithmic irregularity and PCIe perf …”
    Volltext
    Journal Article
  6. 6

    FSCHOL: An OpenCL-based HPC Framework for Accelerating Sparse Cholesky Factorization on FPGAs von Tavakoli, Erfan Bank, Riera, Michael, Quraishi, Masudul Hassan, Ren, Fengbo

    ISSN: 2643-3001
    Veröffentlicht: IEEE 01.10.2021
    “… The proposed FSCHOL framework consists of an FPGA kernel implementing a throughput-optimized hardware architecture for accelerating the supernodal multifrontal algorithm for sparse Cholesky …”
    Volltext
    Tagungsbericht
  7. 7

    On the Efficiency of Supernodal Factorization in Interior-Point Method Using CPU-GPU Collaboration von Shah, Usman Ali, Yousaf, Suhail, Ahmad, Iftikhar, Ahmad, Muhammad Ovais

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2020
    Veröffentlicht in IEEE access (2020)
    “… Despite its efficiency, PDIPM remains a compute-intensive algorithm. Fortunately, graphics processing units (GPUs …”
    Volltext
    Journal Article
  8. 8

    Supernodal sparse Cholesky factorization on graphics processing units von Zou, Dan, Dou, Yong, Guo, Song, Li, Rongchun, Deng, Lin

    ISSN: 1532-0626, 1532-0634
    Veröffentlicht: Blackwell Publishing Ltd 01.11.2014
    Veröffentlicht in Concurrency and computation (01.11.2014)
    “… SUMMARY Sparse Cholesky factorization is the most computationally intensive component in solving large sparse linear systems and is the core algorithm of numerous scientific computing applications …”
    Volltext
    Journal Article
  9. 9

    A new hybrid GPU-CPU sparse LDLT factorization algorithm with GPU and CPU factorizing concurrently von Liu, Yunmou, Du, Hui, Li, Zhuogen, Chen, Pu

    ISSN: 1877-7503, 1877-7511
    Veröffentlicht: Elsevier B.V 01.07.2024
    Veröffentlicht in Journal of computational science (01.07.2024)
    “… This paper proposes a new task assignment scheme for sparse LDLT factorization on a hybrid GPU-CPU platform, and correspondingly an efficient supernodal algorithm, GPU Node and CPU Pipelining (GNCP …”
    Volltext
    Journal Article
  10. 10

    Supernodal symbolic Cholesky factorization on a local-memory multiprocessor von Ng, Esmond

    ISSN: 0167-8191, 1872-7336
    Veröffentlicht: United States Elsevier 14.08.2003
    Veröffentlicht in Parallel computing (14.08.2003)
    “… By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved …”
    Volltext
    Journal Article
  11. 11

    S4 : A free electromagnetic solver for layered periodic structures von Liu, Victor, Fan, Shanhui

    ISSN: 0010-4655, 1879-2944
    Veröffentlicht: Elsevier B.V 01.10.2012
    Veröffentlicht in Computer physics communications (01.10.2012)
    “… We describe S4, a free implementation of the Fourier modal method (FMM), which has also been commonly referred to as rigorous coupled wave analysis (RCWA), for …”
    Volltext
    Journal Article
  12. 12

    Accelerating Sparse LU Factorization with Density-Aware Adaptive Matrix Multiplication for Circuit Simulation von Wang, Tengcheng, Li, Wenhao, Pei, Haojie, Sun, Yuying, Jin, Zhou, Liu, Weifeng

    Veröffentlicht: IEEE 09.07.2023
    “… Sparse LU factorization is considered to be one of the most time-consuming components in circuit simulation, particularly when dealing with circuits of considerable size in the advanced process era …”
    Volltext
    Tagungsbericht
  13. 13

    A Supernodal Approach to Sparse Partial Pivoting von Demmel, James W., Eisenstat, Stanley C., Gilbert, John R., Li, Xiaoye S., Liu, Joseph W. H.

    ISSN: 0895-4798, 1095-7162
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 1999
    “… We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve unsymmetric linear systems …”
    Volltext
    Journal Article
  14. 14

    IMF: An Incomplete Multifrontal $LU$-Factorization for Element-Structured Sparse Linear Systems von Vannieuwenhoven, Nick, Meerbergen, Karl

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
    Veröffentlicht in SIAM journal on scientific computing (01.01.2013)
    “… We propose an incomplete multifrontal $LU$-factorization (IMF) preconditioner that extends supernodal multifrontal methods to incomplete factorizations …”
    Volltext
    Journal Article
  15. 15

    A Multithreaded Algorithm for Sparse Cholesky Factorization on Hybrid Multicore Architectures von Tang, Meng, Gadou, Mohamed, Ranka, Sanjay

    ISSN: 1877-0509, 1877-0509
    Veröffentlicht: Elsevier B.V 2017
    Veröffentlicht in Procedia computer science (2017)
    “… We present a multithreaded method for supernodal sparse Cholesky factorization on a hybrid multicore platform consisting of a multicore CPU and GPU …”
    Volltext
    Journal Article
  16. 16

    A supernodal block factorized sparse approximate inverse for non-symmetric linear systems von Ferronato, Massimiliano, Pini, Giorgio

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer US 01.05.2018
    Veröffentlicht in Numerical algorithms (01.05.2018)
    “… that the supernodal Block FSAI preconditioner outperforms the native algorithm and exhibits a much more stable behavior with respect to the variation of the user-specified parameters …”
    Volltext
    Journal Article
  17. 17

    Optimized sparse Cholesky factorization on hybrid multicore architectures von Tang, Meng, Gadou, Mohamed, Rennich, Steven, Davis, Timothy A., Ranka, Sanjay

    ISSN: 1877-7503, 1877-7511
    Veröffentlicht: Elsevier B.V 01.05.2018
    Veröffentlicht in Journal of computational science (01.05.2018)
    “… We present techniques for supernodal sparse Cholesky factorization on a hybrid multicore platform consisting of a multicore CPU and GPU …”
    Volltext
    Journal Article
  18. 18

    An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination von Demmel, James W., Gilbert, John R., Li, Xiaoye S.

    ISSN: 0895-4798, 1095-7162
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 1999
    “… Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations, it is difficult to implement efficiently on parallel machines …”
    Volltext
    Journal Article
  19. 19

    Accelerating Sparse Cholesky Factorization on GPUs von Rennich, Steven C., Stosic, Darko, Davis, Timothy A.

    ISSN: 2767-942X
    Veröffentlicht: IEEE 16.11.2014
    “… to fully utilize this resource. In this paper we describe a supernodal Cholesky factorization algorithm which permits improved utilization of the GPU when factoring sparse matrices …”
    Volltext
    Tagungsbericht
  20. 20

    Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors von Eswar, Kalluri, Sadayappan, P., Huang, Chua-Huang, Visvanathan, V.

    ISBN: 0849389836, 9780849389832
    ISSN: 0190-3918
    Veröffentlicht: IEEE 01.08.1993
    “… This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors …”
    Volltext
    Tagungsbericht