Advertisement

Finite element assembly

  • Anders Logg
  • Kent-Andre Mardal
  • Garth N. Wells
Chapter
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 84)

Abstract

The finite element method may be viewed as a method for forming a discrete linear system 4064 AU = b or nonlinear system b(U) = 0 corresponding to the discretization of the variational form of a 4065 differential equation.A central part of the implementation of finite element methods is therefore the 4066 computation of matrices and vectors from variational forms.In this chapter, we describe the standard 4067 algorithm for computing the discrete operator (tensor) A.

Keywords

Sparse Matrix Assembly Algorithm Global Matrix Multilinear Form Sparse Tensor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anders Logg
    • 1
    • 2
  • Kent-Andre Mardal
    • 1
    • 2
  • Garth N. Wells
    • 3
  1. 1.Center for Biomedical Computing at Simula Research LaboratoryOsloNorway
  2. 2.Department of InformaticsUniversity of OsloOsloNorway
  3. 3.Department of EngineringUniversity of CambridgeCambridgeUK

Personalised recommendations