I mean in solving Numerical PDE the matrix is usually quiet big but sparse. the normal “/” seems to use LU decomposition which makes a saprse matrix become two dense and will outofmemory qiuckly.

[image] Lyupinpin: It is solving a three dimensional PDE and N is the how much part we divide the PDE in different dimension. When N=30 it warks well, but when N=100 […] when the size of the matrix increase it will Outofmemory You should realize that there is an intrinsic limitation of sparse…

Does julia has a Package designed to / for sparse matrix

General Usage

mauro3 September 3, 2019, 11:30am 4

A minimal example would be kind on your helpers. Have a read through Please read: make it easier to help you, in particular point 4.

3 Likes

Topic		Replies	Views
How to solve this Ax=b faster? Numerics linearalgebra , linearsolve	24	2565	June 7, 2022
From toy to production code with sparse matrix and sparse-direct factorizations Performance sparse , cholmod	17	1164	November 1, 2022
The best linear solver for sparse bandedblockbandedmatricies Performance diffeq , linearalgebra , sparse	30	5572	May 24, 2020
Help with this code (deallocation/pointers on sparse matrices) Performance array , sparse , matrices , sparsearrays	31	695	February 3, 2024
Julia cannot solve Ax=b with LU where A is sparse, General Usage question , linearalgebra , sparse	12	1162	May 5, 2023

Does julia has a Package designed to / for sparse matrix

Related topics