Math 2.0

Areas Numerical analysis Topic

Sparse matrices and sparse direct methods

Summary

This topic is a part of numerical analysis. It covers the storage of sparse matrices, fill-in, orderings and the graph theory of sparse elimination, and data-sparse matrix formats.

About this page
TagE8A8XDNBKV
URIm2://E8A8XDNBKV
Kindtopic
WritingW0 stub
MSC65F50, 65F05
Part ofNumerical analysis
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.