Finite Element Methods

This new edition includes three new chapters, 7 through 9, that have very broad, practical applications in engineering and science. 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 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. Greatly expands chapters 2 and 6, added appendices and adds three new chapters, 7, 8, and 9; Introduces several additional/important research topics for “broad (engineering & science)” applications; Explains FETI-DP methods, SVD (with examples) and useful tutorial materials for improving MATLAB programming skills. 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.

Pages: 827, Edition: Second Edition 2024, Paperback, Springer