In most existing software packages for the finite element method it is not possible to supply the weak formulation of the problem of interest in a compact form, which was in the early days of programming due to the low abstrac-tion capabilities of available programming languages. With the advent of pure object-oriented programming, abstrac-tion was long said to be achievable only in trade-off with run time efficiency. In this work we show that it is possible to obtain both a high level of abstraction and good run time efficiency by the use of template metaprogramming in C++. We focus on a mathematical expressions engine, by which element matrices are computed during compile time and by which the weak formulation can be specified in a single...
We investigate the computational power of C++ compilers. In particular, it is known that any partial...
The template system of C++ is expressive enough to allow the programmer to write programs which are ...
In this paper we investigate the relationship between template metaprogramming and implicit complexi...
In finite element methods, numerical simulation of the problem requires the generation of a linear s...
Abstract: Many mathematical physics problems possess considerable computational complexity...
This paper describes the Boost C++ template metaprogramming library (MPL), an extensible compile-tim...
Abstract. Template metaprogramming (TMP) is an emerging new di-rection in C++ programming for execut...
New technologies in computer science applied to numerical computations open the door to alternative ...
Large scale scientific computing raises questions on different levels ranging from the fomulation of...
Ever-increasing size and complexity of software applications and libraries in scien-ti c computing i...
Presents the development of object-oriented finite element classes based on the concept of parameter...
International audienceWhen developing software in Operational Research (OR), one usually aims at get...
A normal Finite Element code typically takes about 30-40 % of the total time to cal-culate and assem...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
We investigate the computational power of C++ compilers. In particular, it is known that any partial...
The template system of C++ is expressive enough to allow the programmer to write programs which are ...
In this paper we investigate the relationship between template metaprogramming and implicit complexi...
In finite element methods, numerical simulation of the problem requires the generation of a linear s...
Abstract: Many mathematical physics problems possess considerable computational complexity...
This paper describes the Boost C++ template metaprogramming library (MPL), an extensible compile-tim...
Abstract. Template metaprogramming (TMP) is an emerging new di-rection in C++ programming for execut...
New technologies in computer science applied to numerical computations open the door to alternative ...
Large scale scientific computing raises questions on different levels ranging from the fomulation of...
Ever-increasing size and complexity of software applications and libraries in scien-ti c computing i...
Presents the development of object-oriented finite element classes based on the concept of parameter...
International audienceWhen developing software in Operational Research (OR), one usually aims at get...
A normal Finite Element code typically takes about 30-40 % of the total time to cal-culate and assem...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
We investigate the computational power of C++ compilers. In particular, it is known that any partial...
The template system of C++ is expressive enough to allow the programmer to write programs which are ...
In this paper we investigate the relationship between template metaprogramming and implicit complexi...