Suchergebnisse - block sparse Cholesky factorization algorithms

Andere Suchmöglichkeiten:

  1. 1

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

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer Nature B.V 01.02.1997
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  2. 2

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

    ISSN: 0167-8191, 1872-7336, 1872-7336
    Veröffentlicht: Elsevier B.V 01.11.2019
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  3. 3

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

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  4. 4

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

    ISSN: 0361-7688, 1608-3261
    Veröffentlicht: Moscow Pleiades Publishing 01.04.2022
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  5. 5

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 22.01.2016
    Veröffentlicht in 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 …”
    Volltext
    Paper
  6. 6

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.03.2023
    Veröffentlicht in 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 …”
    Volltext
    Paper
  7. 7

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

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: 01.01.2014
    Veröffentlicht in SIAM journal on scientific computing (01.01.2014)
    “… Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems …”
    Volltext
    Journal Article
  8. 8

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

    ISSN: 0895-4798, 1095-7162
    Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
    Veröffentlicht in SIAM journal on matrix analysis and applications (01.01.2010)
    “… Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R …”
    Volltext
    Journal Article
  9. 9

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

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.09.1993
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  10. 10

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

    ISSN: 1055-6788, 1029-4937
    Veröffentlicht: Abingdon Taylor & Francis 04.03.2023
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  11. 11

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

    ISSN: 2831-3631
    Veröffentlicht: 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 …”
    Volltext
    Tagungsbericht
  12. 12

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

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer US 01.12.2023
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  13. 13

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

    ISSN: 0167-739X, 1872-7115
    Veröffentlicht: Elsevier B.V 01.04.2004
    Veröffentlicht in Future generation computer systems (01.04.2004)
    “… We describe the design, implementation, and performance of a new parallel sparse Cholesky factorization code …”
    Volltext
    Journal Article
  14. 14

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 19.09.2024
    Veröffentlicht in arXiv.org (19.09.2024)
    “… We present a new variant of serial right-looking supernodal sparse Cholesky factorization (RL …”
    Volltext
    Paper
  15. 15

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

    ISSN: 0029-5981, 1097-0207
    Veröffentlicht: 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 …”
    Volltext
    Journal Article
  16. 16

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

    ISSN: 0003-1305, 1537-2731
    Veröffentlicht: England Taylor & Francis 2021
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  17. 17

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

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.11.1994
    Veröffentlicht in 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 …”
    Volltext
    Journal Article
  18. 18

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

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 18.02.2022
    Veröffentlicht in 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 …”
    Volltext
    Paper
  19. 19

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

    ISSN: 0167-8191, 1872-7336
    Veröffentlicht: Elsevier B.V 2003
    Veröffentlicht in Parallel computing (2003)
    “… Block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular subblocks …”
    Volltext
    Journal Article
  20. 20

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

    ISSN: 1673-5447
    Veröffentlicht: China Institute of Communications 01.03.2020
    Veröffentlicht in 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 …”
    Volltext
    Journal Article