22,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![Sparse Grid]( "Sparse Grid")
Sparse Grid22,99 €![Sparse Ruler]( "Sparse Ruler")
Sparse Ruler25,99 €![Sparse Language]( "Sparse Language")
Sparse Language22,99 €![GMRES Solver with ILU(k) for Large-Scale Sparse Linear Systems on GPUs]( "GMRES Solver with ILU(k) for Large-Scale Sparse Linear Systems on GPUs")
GMRES Solver with ILU(k) for Large-Scale Sparse Linear Systems on GPUs30,99 €![Sparse Signal Recovery in a Transform Domain]( "Sparse Signal Recovery in a Transform Domain")
Sparse Signal Recovery in a Transform Domain32,99 €![Sparse Grids for the Electronic Schrödinger Equation]( "Sparse Grids for the Electronic Schrödinger Equation")
Sparse Grids for the Electronic Schrödinger Equation51,99 €![Sparse Matrix Techniques]( "Sparse Matrix Techniques")
Sparse Matrix Techniques39,99 €
High Quality Content by WIKIPEDIA articles! In the subfield of numerical analysis a sparse matrix is a matrix populated primarily with zeros (Stoer & Bulirsch 2002, p. 619). The term itself was coined by Harry M. Markowitz. Conceptually, sparsity corresponds to systems which are loosely coupled. Consider a line of balls connected by springs from one to the next; this is a sparse system. By contrast, if the same line of balls had springs connecting every ball to every other ball, the system would be represented by a dense matrix. The concept of sparsity is useful in combinatorics and application areas such as network theory, of a low density of significant data or connections.