A. Schmidt, und K. Siebert. Preprint Series of the Department of Mathematics / Albert Ludwigs University of Freiburg (1998)
Zusammenfassung
Introduction and design principles The core part of every finite element
program is the problem--dependent assembly and solution of the discretized
problem. This holds for programs which solve the discrete problem
on a fixed mesh as well as for adaptive methods which automatically
adjust the underlying mesh to the actual problem and solution. In
an adaptive iteration, the solution of a discrete system is necessary
after each mesh change. A general finite element toolbox must provide
flexibility in problems and finite element spaces while on the other
hand this core part can be performed efficiently. Data structures
are needed which allow an easy and efficient implementation of the
problem--dependent parts and also allow to use adaptive methods,
mesh modification algorithms, and solvers for linear and nonlinear
discrete problems by calling library routines. Starting point for
our considerations is the abstract concept of a finite element space
defined (similar to the definition
%0 Book
%1 schmidt1998concepts
%A Schmidt, Alfred
%A Siebert, Kunibert G.
%B Preprint Series of the Department of Mathematics / Albert Ludwigs University of Freiburg
%D 1998
%K fis ians liste
%N 98-17
%T Concepts of the finite element toolbox ALBERT
%X Introduction and design principles The core part of every finite element
program is the problem--dependent assembly and solution of the discretized
problem. This holds for programs which solve the discrete problem
on a fixed mesh as well as for adaptive methods which automatically
adjust the underlying mesh to the actual problem and solution. In
an adaptive iteration, the solution of a discrete system is necessary
after each mesh change. A general finite element toolbox must provide
flexibility in problems and finite element spaces while on the other
hand this core part can be performed efficiently. Data structures
are needed which allow an easy and efficient implementation of the
problem--dependent parts and also allow to use adaptive methods,
mesh modification algorithms, and solvers for linear and nonlinear
discrete problems by calling library routines. Starting point for
our considerations is the abstract concept of a finite element space
defined (similar to the definition
@book{schmidt1998concepts,
abstract = {Introduction and design principles The core part of every finite element
program is the problem--dependent assembly and solution of the discretized
problem. This holds for programs which solve the discrete problem
on a fixed mesh as well as for adaptive methods which automatically
adjust the underlying mesh to the actual problem and solution. In
an adaptive iteration, the solution of a discrete system is necessary
after each mesh change. A general finite element toolbox must provide
flexibility in problems and finite element spaces while on the other
hand this core part can be performed efficiently. Data structures
are needed which allow an easy and efficient implementation of the
problem--dependent parts and also allow to use adaptive methods,
mesh modification algorithms, and solvers for linear and nonlinear
discrete problems by calling library routines. Starting point for
our considerations is the abstract concept of a finite element space
defined (similar to the definition},
added-at = {2019-06-17T14:25:24.000+0200},
author = {Schmidt, Alfred and Siebert, Kunibert G.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/24541482245265938e8a32b4650f25389/britsteiner},
interhash = {903ca9de15d45f6726c3a36a5f6d30cb},
intrahash = {4541482245265938e8a32b4650f25389},
keywords = {fis ians liste},
language = {eng},
number = {98-17},
pagetotal = {12},
series = {Preprint Series of the Department of Mathematics / Albert Ludwigs University of Freiburg},
timestamp = {2019-06-17T12:34:15.000+0200},
title = {Concepts of the finite element toolbox ALBERT},
year = 1998
}
