Sparse matrix: Numerical Analysis, Matrix, Network Theory, Partial Differential Equation, Data Structure, Diagonal Matrix, Tridiagonal Matrix, Band Matrix, Cuthill–McKee Algorithm - Couverture souple
Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Sparse matrix: Numerical Analysis, Matrix, Network...
Image fournie par le vendeur
Sparse matrix
impression à la demandeVendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9786130347482
Acheter neuf
EUR 34
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Sparse matrix : Numerical Analysis, Matrix, Network Theory, Partial Differential Equation, Data Structure, Diagonal Matrix, Tridiagonal Matrix, Band Matrix, Cuthill-McKee Algorithm
impression à la demandeVendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9786130347482
Acheter neuf
EUR 35,89
Expédition à EUR 60,69
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Sparse matrix | Numerical Analysis, Matrix, Network Theory, Partial Differential Equation, Data Structure, Diagonal Matrix, Tridiagonal Matrix, Band Matrix, Cuthill-McKee Algorithm
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 113214379
Acheter neuf
EUR 109,85
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Sparse matrix
impression à la demandeVendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9786130347482
Acheter neuf
EUR 136
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)