Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 34,00
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 35,89
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.
Da: preigu, Osnabrück, Germania
EUR 109,85
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Sparse matrix | Numerical Analysis, Matrix, Network Theory, Partial Differential Equation, Data Structure, Diagonal Matrix, Tridiagonal Matrix, Band Matrix, Cuthill-McKee Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130347482 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 136,00
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -High Quality Content by WIKIPEDIA articles! In the subfield of numericalanalysis a sparse matrix is a matrix populated primarily with zeros(Stoer & Bulirsch 2002, p. 619). The term itself was coined by HarryM. Markowitz. Conceptually, sparsity corresponds to systems which areloosely coupled. Consider a line of balls connected by springs from oneto the next; this is a sparse system. By contrast, if the same line ofballs had springs connecting every ball to every other ball, the systemwould be represented by a dense matrix. The concept of sparsity isuseful in combinatorics and application areas such as network theory, ofa low density of significant data or connections.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch.