Finite Elements
Home > Computing and Information Technology > Information technology: general topics > Finite Elements: Theory and Algorithms(Cambridge IISc Series)
Finite Elements: Theory and Algorithms(Cambridge IISc Series)

Finite Elements: Theory and Algorithms(Cambridge IISc Series)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Written in easy to understand language, this self-explanatory guide introduces the fundamentals of finite element methods and its application to differential equations. Beginning with a brief introduction to Sobolev spaces and elliptic scalar problems, the text progresses through an explanation of finite element spaces and estimates for the interpolation error. The concepts of finite element methods for parabolic scalar parabolic problems, object-oriented finite element algorithms, efficient implementation techniques, and high dimensional parabolic problems are presented in different chapters. Recent advances in finite element methods, including non-conforming finite elements for boundary value problems of higher order and approaches for solving differential equations in high dimensional domains are explained for the benefit of the reader. Numerous solved examples and mathematical theorems are interspersed throughout the text for enhanced learning.

Table of Contents:
Preface; 1. Sobolev spaces; 1.1. Banach and Hilbert spaces; 1.2. Weak derivatives; 1.3. Sobolev spaces; 2. Elliptic scalar problems; 2.1. A general elliptic problem of second order; 2.2. Weak solution; 2.3. Standard Galerkin method; 2.4. Abstract error estimate; 3. Finite element spaces; 3.1. Simplices and barycentric coordinates; 3.2. Simplicial finite elements and local spaces; 3.3. Construction of finite elements spaces; 3.4. The concept of mapped finite elements: affine mappings; 3.5. Finite elements on rectangular and brick meshes; 3.6. Mapped finite elements: general bijective mappings; 3.7. Mapped Qk finite elements; 3.8. Isoparametric finite elements; 3.9. Further examples of finite elements in C0 and C1; 4. Interpolation and discretization error; 4.1. Transformation formulas; 4.2. Affine equivalent finite elements; 4.3. Canonical interpolation; 4.4. Local and global interpolation error; 4.5. Improved L2 error estimates by duality; 4.6. Interpolation of less smooth functions; 5. Biharmonic equation; 5.1. Deflection of a thin clamped plate; 5.2. Weak formulation of the biharmonic equation; 5.3. Conforming finite element methods; 5.4. Nonconforming finite element methods; 6. Parabolic problems; 6.1. Conservation of energy; 6.2. A general parabolic problem of initial boundary value problems; 6.3. Weak formulation of initial boundary value problems; 6.4. Semidiscretization by finite elements; 6.5. Time discretization; 6.6. Finite elements for high-dimensional parabolic problems; 7. Systems in solid mechanics; 7.1. Linear elasticity; 7.2. Mindlin–Reissner plate; 8. Systems in fluid mechanics; 8.1. Conservation of mass and momentum; 8.2. Weak formulation of the Stokes problem; 8.3. Conforming discretizations of the Stokes problem; 8.4. Nonconforming discretizations of the Stokes problem; 8.5. The nonconforming Crouzeix–Raviart element; 8.6. Further inf–sup stable finite element pairs; 8.7. Equal order stabilized finite elements; 8.8. Navier–Stokes problem with mixed boundary conditions; 8.9. Time discretization and linearization of the Navier–Stokes problem; 9. Implementation of the finite element method; 9.1. Mesh handling and data structure; 9.2. Numerical integration; 9.3. Sparse matrix storage; 9.4. Assembling of system matrices and load vectors; 9.5. Inclusion of boundary conditions; 9.6. Solution of the algebraic systems; 9.7. Object-oriented C++ programming; Bibliography; Index.

About the Author :
Sashikumaar Ganesan obtained his Ph.D. from Otto-von-Guericke-Universität Magdeburg, Germany 2006. He was Postdoctoral Fellow at Otto-von-Guericke-Universität Magdeburg, Germany (2006–08) and Research Associate (2008–09) at the Imperial College of Science, Technology and Medicine, London. He joined the Indian Institute of Science (IISc), Bangalore as Assistant Professor in 2011. He is currently heading a research group on Numerical Mathematics and Scientific Computing at Supercomputer Education and Research Centre, IISc, Bangalore. His areas of interest include numerical analysis, finite elements in fluid dynamics and high performance computing. Lutz Tobiska is Professor at the Institute for Analysis and Computational Mathematics, Otto-von-Guericke-Universität Magdeburg, Germany. He received his Ph.D. from the Technische Hochschule Magdeburg in 1977. He has published many articles in international journals. His areas of interest include finite elements in fluid dynamics, parallel algorithms, multigrid methods and adaptive methods for convection diffusion equations.

Review :
'The book is written in a very traditional and straightforward style of theory and proof. The organization of the material makes it accessible for the reader to gain a foundational understanding of the topics … This book provides a readable, concise introduction to finite elements. Summing Up: Recommended.' S. L. Sullivan, CHOICE


Best Sellers


Product Details
  • ISBN-13: 9781108235013
  • Publisher: Cambridge University Press (Virtual Publishing)
  • Publisher Imprint: Cambridge University Press (Virtual Publishing)
  • Language: English
  • Sub Title: Theory and Algorithms
  • ISBN-10: 1108235018
  • Publisher Date: 14 Dec 2017
  • Binding: Digital download and online
  • Series Title: Cambridge IISc Series


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Finite Elements: Theory and Algorithms(Cambridge IISc Series)
Cambridge University Press (Virtual Publishing) -
Finite Elements: Theory and Algorithms(Cambridge IISc Series)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Finite Elements: Theory and Algorithms(Cambridge IISc Series)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!