KnowraSparse matrixLinked fromLinked fromThe 18 pages that link to Sparse matrix, each with the reason it gives.All 18Broader topic 1Related 16Compared with 1Adjacency matrixRelated: Large sparse graphs have adjacency matrices that benefit from storage formats for few nonzeros.Gaussian eliminationRelated: Sparse elimination methods exploit zeros to reduce storage and computation.Incidence matrixRelated: Each ordinary graph edge touches only a small number of vertices, so its incidence matrix is often sparse.Finite difference methodRelated: Local stencils make the algebraic systems from finite difference discretizations sparse.System of linear equationsRelated: Many applied systems are sparse, enabling storage and algorithms that exploit their structure.Connected componentRelated: Graph components reveal independent blocks after a matrix is viewed through its nonzero pattern.LU decompositionRelated: Sparse LU methods seek to limit fill-in while preserving efficient factor solves.Direct methodRelated: Sparse direct solvers exploit this structure, though elimination can create additional nonzero entries.Cosine similarityRelated: Text vectors are often sparse, allowing efficient cosine calculations that skip zero entries.Permutation matrixRelated: A permutation matrix is an extremely sparse matrix, with only one nonzero per row and column.Conjugate gradient methodRelated: Sparse storage makes each iteration practical for systems with millions of unknowns.Laplace expansionRelated: Expanding along a sparse row or column eliminates zero terms.Gauss–Seidel methodRelated: Sparse systems let implementations perform Gauss–Seidel sweeps without processing every matrix entry.Triangular matrixRelated: Triangular systems can also be sparse, allowing storage and computation to exploit both structures.Crank–Nicolson methodRelated: Spatial discretization usually makes each implicit step a sparse linear-system solve.Successive over-relaxationRelated: SOR can update sparse systems without storing or processing most zero entries.
KnowraSparse matrixLinked fromLinked fromThe 18 pages that link to Sparse matrix, each with the reason it gives.All 18Broader topic 1Related 16Compared with 1Adjacency matrixRelated: Large sparse graphs have adjacency matrices that benefit from storage formats for few nonzeros.Gaussian eliminationRelated: Sparse elimination methods exploit zeros to reduce storage and computation.Incidence matrixRelated: Each ordinary graph edge touches only a small number of vertices, so its incidence matrix is often sparse.Finite difference methodRelated: Local stencils make the algebraic systems from finite difference discretizations sparse.System of linear equationsRelated: Many applied systems are sparse, enabling storage and algorithms that exploit their structure.Connected componentRelated: Graph components reveal independent blocks after a matrix is viewed through its nonzero pattern.LU decompositionRelated: Sparse LU methods seek to limit fill-in while preserving efficient factor solves.Direct methodRelated: Sparse direct solvers exploit this structure, though elimination can create additional nonzero entries.Cosine similarityRelated: Text vectors are often sparse, allowing efficient cosine calculations that skip zero entries.Permutation matrixRelated: A permutation matrix is an extremely sparse matrix, with only one nonzero per row and column.Conjugate gradient methodRelated: Sparse storage makes each iteration practical for systems with millions of unknowns.Laplace expansionRelated: Expanding along a sparse row or column eliminates zero terms.Gauss–Seidel methodRelated: Sparse systems let implementations perform Gauss–Seidel sweeps without processing every matrix entry.Triangular matrixRelated: Triangular systems can also be sparse, allowing storage and computation to exploit both structures.Crank–Nicolson methodRelated: Spatial discretization usually makes each implicit step a sparse linear-system solve.Successive over-relaxationRelated: SOR can update sparse systems without storing or processing most zero entries.