Sparse Matrix Assembly

Sparse Matrix Assembly is a computational method in numerical linear algebra that systematically aggregates local stiffness or system matrices into a global matrix with a predominantly zero-valued structure, exploiting sparsity patterns to minimize storage and accelerate solution processes in large-scale finite element or finite difference simulations.

30

Publications

1.7K

Citations

74

Authors

40

Institutions

Publications per year

2017–2026

8

Authors

74

  1. MM
    Michał Mrozowski

    Gdańsk University of Technology, Poland

    2 publications · 85 citations

    2

    h-index

  2. AD
    Adam Dziekonski

    Gdańsk University of Technology, Poland

    2 publications · 85 citations

    2

    h-index

  3. PS
    Piotr Sypek

    Gdańsk University of Technology, Poland

    2 publications · 85 citations

    2

    h-index

  4. GS
    Gilles Scarella

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 54 citations

    2

    h-index

  5. AL
    Adam Lamęcki

    Gdańsk University of Technology, Poland

    2 publications · 85 citations

    2

    h-index

1–5 of 74

Venues

  1. 2

    h-index

  2. Computer Graphics Forum

    2 publications · 68 citations

    2

    h-index

  3. Journal of Computational Physics

    1 publications · 85 citations

    1

    h-index

  4. The Journal of Open Source Software

    JOSS · 1 publications · 93 citations

    1

    h-index

  5. Parallel Computing

    1 publications · 28 citations

    1

    h-index

1–5