Výsledky vyhľadávania - block sparse Cholesky factorization algorithms

  1. 1

    Two-dimensional block partitionings for the parallel sparse Cholesky factorization Autor Dumitrescu, B., Doreille, M., Roch, J.-L., Trystram, D.

    ISSN: 1017-1398, 1572-9265
    Vydavateľské údaje: New York Springer Nature B.V 01.02.1997
    Vydané v Numerical algorithms (01.02.1997)
    “…This paper presents a discussion on 2D block mappings for the sparse Cholesky factorization on parallel MIMD architectures with distributed memory…”
    Získať plný text
    Journal Article
  2. 2

    Parallelization and scalability analysis of inverse factorization using the chunks and tasks programming model Autor Artemov, Anton G., Rudberg, Elias, Rubensson, Emanuel H.

    ISSN: 0167-8191, 1872-7336, 1872-7336
    Vydavateľské údaje: Elsevier B.V 01.11.2019
    Vydané v Parallel computing (01.11.2019)
    “…•Localized inverse factorization requires significantly less communication. We present three methods for distributed memory parallel inverse factorization of block-sparse Hermitian positive definite matrices…”
    Získať plný text
    Journal Article
  3. 3

    Design of a Multicore Sparse Cholesky Factorization Using DAGs Autor Hogg, J. D., Reid, J. K., Scott, J. A.

    ISSN: 1064-8275, 1095-7197
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
    Vydané v SIAM journal on scientific computing (01.01.2010)
    “…, whose dependencies may be represented by a directed acyclic graph (DAG). Our sparse algorithm is built on the assembly tree and subdivides the work at each node into tasks on blocks of the Cholesky factor…”
    Získať plný text
    Journal Article
  4. 4

    Supercomputer Environment for Recursive Matrix Algorithms Autor Malaschonok, G. I., Sidko, A. A.

    ISSN: 0361-7688, 1608-3261
    Vydavateľské údaje: Moscow Pleiades Publishing 01.04.2022
    Vydané v Programming and computer software (01.04.2022)
    “… As an example of a block recursive algorithm, the Cholesky factorization of a symmetric positive definite matrix in the form of a block dichotomous algorithm is described…”
    Získať plný text
    Journal Article
  5. 5

    Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout Autor Kim, Kyungjoo, Rajamanickam, Sivasankaran, Stelle, George, H Carter Edwards, Olivier, Stephen L

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 22.01.2016
    Vydané v arXiv.org (22.01.2016)
    “…We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix…”
    Získať plný text
    Paper
  6. 6

    Supercomputer Environment for Recursive Matrix Algorithms Autor Malaschonok, Gennadi, Sidko, Alla

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 20.03.2023
    Vydané v arXiv.org (20.03.2023)
    “… As an example of a block recursive algorithm, the Cholesky factorization of a symmetric positive definite matrix in the form of a block dichotomous algorithm is described…”
    Získať plný text
    Paper
  7. 7

    On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems Autor Scott, Jennifer, Tůma, Miroslav

    ISSN: 1064-8275, 1095-7197
    Vydavateľské údaje: 01.01.2014
    Vydané v SIAM journal on scientific computing (01.01.2014)
    “…Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems…”
    Získať plný text
    Journal Article
  8. 8

    Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices Autor Xia, Jianlin, Gu, Ming

    ISSN: 0895-4798, 1095-7162
    Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
    “…Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R…”
    Získať plný text
    Journal Article
  9. 9

    Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers Autor Ng, Esmond G, Peyton, Barry W

    ISSN: 1064-8275, 1095-7197
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.09.1993
    Vydané v SIAM journal on scientific computing (01.09.1993)
    “…As with many other linear algebra algorithms, devising a portable implementation of sparse Cholesky factorization that performs well on the broad range of computer architectures currently available…”
    Získať plný text
    Journal Article
  10. 10

    HyKKT: a hybrid direct-iterative method for solving KKT linear systems Autor Regev, Shaked, Chiang, Nai-Yuan, Darve, Eric, Petra, Cosmin G., Saunders, Michael A., Świrydowicz, Kasia, Peleš, Slaven

    ISSN: 1055-6788, 1029-4937
    Vydavateľské údaje: Abingdon Taylor & Francis 04.03.2023
    Vydané v Optimization methods & software (04.03.2023)
    “…). The current gold standard for sparse indefinite systems is the LBLT factorization where is a lower triangular matrix and is or block diagonal…”
    Získať plný text
    Journal Article
  11. 11

    A Selective Nesting Approach for the Sparse Multi-threaded Cholesky Factorization Autor Le Fevre, Valentin, Usui, Tetsuzo, Casas, Marc

    ISSN: 2831-3631
    Vydavateľské údaje: IEEE 01.11.2022
    “… This paper presents selective nesting, a method to determine the optimal task granularity for the parallel Cholesky factorization based on the structure of sparse matrices…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

    A mixed precision LOBPCG algorithm Autor Kressner, Daniel, Ma, Yuxin, Shao, Meiyue

    ISSN: 1017-1398, 1572-9265
    Vydavateľské údaje: New York Springer US 01.12.2023
    Vydané v Numerical algorithms (01.12.2023)
    “… A . In this work, we propose a mixed precision variant of LOBPCG that uses a (sparse) Cholesky factorization of A computed in lower precision as the preconditioner…”
    Získať plný text
    Journal Article
  13. 13

    Parallel and fully recursive multifrontal sparse Cholesky Autor Irony, Dror, Shklarski, Gil, Toledo, Sivan

    ISSN: 0167-739X, 1872-7115
    Vydavateľské údaje: Elsevier B.V 01.04.2004
    Vydané v Future generation computer systems (01.04.2004)
    “…We describe the design, implementation, and performance of a new parallel sparse Cholesky factorization code…”
    Získať plný text
    Journal Article
  14. 14

    Some new techniques to use in serial sparse Cholesky factorization algorithms Autor Karsavuran, M Ozan, Ng, Esmond G, Peyton, Barry W, Peyton, Jonathan L

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.09.2024
    Vydané v arXiv.org (19.09.2024)
    “…We present a new variant of serial right-looking supernodal sparse Cholesky factorization (RL…”
    Získať plný text
    Paper
  15. 15

    Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems Autor Klockiewicz, Bazyli, Cambier, Léopold, Humble, Ryan, Tchelepi, Hamdi, Darve, Eric

    ISSN: 0029-5981, 1097-0207
    Vydavateľské údaje: Hoboken, USA John Wiley & Sons, Inc 30.11.2022
    “…We describe a second‐order accurate approach to sparsifying the off‐diagonal matrix blocks in the hierarchical approximate factorization methods for solving sparse linear systems…”
    Získať plný text
    Journal Article
  16. 16

    Sampling Strategies for Fast Updating of Gaussian Markov Random Fields Autor Brown, D. Andrew, McMahan, Christopher S., Watson Self, Stella

    ISSN: 0003-1305, 1537-2731
    Vydavateľské údaje: England Taylor & Francis 2021
    Vydané v The American statistician (2021)
    “… convenience afforded by the sparse precision matrices needed for random variable generation. Typically in Bayesian computation, GMRFs are updated jointly in a block Gibbs…”
    Získať plný text
    Journal Article
  17. 17

    An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization Autor Rothberg, Edward, Gupta, Anoop

    ISSN: 1064-8275, 1095-7197
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.11.1994
    Vydané v SIAM journal on scientific computing (01.11.1994)
    “…This paper explores the use of a subblock decomposition strategy for parallel sparse Cholesky factorization in which the sparse matrix is decomposed into rectangular blocks…”
    Získať plný text
    Journal Article
  18. 18

    Optimization of the Sparse Multi-Threaded Cholesky Factorization for A64FX Autor Valentin Le Fèvre, Usui, Tetsuzo, Casas, Marc

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 18.02.2022
    Vydané v arXiv.org (18.02.2022)
    “… This paper presents selective nesting, a method to determine the optimal task granularity for the parallel Cholesky factorization based on the structure of sparse matrices…”
    Získať plný text
    Paper
  19. 19

    Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization Autor Lee, Heejo, Kim, Jong, Hong, Sung Je, Lee, Sunggu

    ISSN: 0167-8191, 1872-7336
    Vydavateľské údaje: Elsevier B.V 2003
    Vydané v Parallel computing (2003)
    “…Block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular subblocks…”
    Získať plný text
    Journal Article
  20. 20

    Blind channel identification for cyclic-prefixed MIMO-OFDM systems with virtual carriers Autor Yu, Jung-Lang, Zhang, Biling, Yuan, Yipu, Hsu, Wei-Ting

    ISSN: 1673-5447
    Vydavateľské údaje: China Institute of Communications 01.03.2020
    Vydané v China communications (01.03.2020)
    “… The RIS scheme will convert the white noise into non-white noise. With the Cholesky factorization, a noise whitening technique is developed…”
    Získať plný text
    Journal Article