This new edition includes three new chapters, 7 through 9, that have very broad, practical applications in engineering and science. In addition, the author's latest research results incorporated into the new textbook demonstrates better performance than the popular METIS software for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The new Chapter 8, and its pre-requisite, Chapter 7, present a state-of-the-art algorithm for computing the shortest paths for real-life (large-scale) transportation networks with minimum computational time. This approach has not yet appeared in any existing textbooks and it could open the doors for other transportation engineering applications. Chapter 9 vastly expands the scope of the previous edition by including sensitivity (gradient) computation and MATLAB's built-in function "fmincon" for obtaining the optimum (or best) solution for general engineering problems.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Dr. Duc Thai Nguyen is a Structural Engineering Professor in the Department of Civil and Environmental Engineering, Old Dominion University, Norfolk, VA
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur DISJVDAN6X
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This new edition includes three new chapters, 7 through 9, that have very broad, practical applications in engineering and science. In addition, the author's latest research results incorporated into the new textbook demonstrates better performance than the popular METIS software for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The new Chapter 8, and its pre-requisite, Chapter 7, present a state-of-the-art algorithm for computing the shortest paths for real-life (large-scale) transportation networks with minimum computational time. This approach has not yet appeared in any existing textbooks and it could open the doors for other transportation engineering applications. Chapter 9 vastly expands the scope of the previous edition by including sensitivity (gradient) computation and MATLAB's built-in function 'fmincon' for obtaining the optimum (or best) solution for general engineering problems. 828 pp. Englisch. N° de réf. du vendeur 9783031487903
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26404384647
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 409850968
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18404384653
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This new edition includes three new chapters, 7 through 9, that have very broad, practical applications in engineering and science. In addition, the author's latest research results (in Domain Partitioning algorithms) incorporated into the new textbook (Chapter 7) demonstrates better performance than the popular METIS software for partitioning graphs, partitioning finite element meshes, and producing less non-zero fill-in terms for sparse factorization. The new Chapter 8, and its pre-requisite, Chapter 7, present a state-of-the-art algorithm for computing the shortest paths for real-life (large-scale) transportation networks with minimum computational time. This approach has not yet appeared in any existing textbooks and it could open the doors for other transportation engineering applications. Chapter 9 vastly expands the scope of the previous edition by including sensitivity (gradient) computation and MATLAB's built-in function 'fmincon' for obtaining the optimum (or best) solution for general engineering problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 828 pp. Englisch. N° de réf. du vendeur 9783031487903
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Finite Element Methods | Parallel-Sparse Statics and Eigen-Solutions | Duc Thai Nguyen | Taschenbuch | xix | Englisch | 2025 | Springer | EAN 9783031487903 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 133224848
Quantité disponible : 5 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This new edition includes three new chapters, 7 through 9, that have very broad, practical applications in engineering and science. In addition, the author's latest research results incorporated into the new textbook demonstrates better performance than the popular METIS software for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The new Chapter 8, and its pre-requisite, Chapter 7, present a state-of-the-art algorithm for computing the shortest paths for real-life (large-scale) transportation networks with minimum computational time. This approach has not yet appeared in any existing textbooks and it could open the doors for other transportation engineering applications. Chapter 9 vastly expands the scope of the previous edition by including sensitivity (gradient) computation and MATLAB's built-in function 'fmincon' for obtaining the optimum (or best) solution for general engineering problems. N° de réf. du vendeur 9783031487903
Quantité disponible : 1 disponible(s)