Evolving surface finite element method
v0.3.0-14-g3598512
Numerical experiments for my papers
|
Calculate the maximum h of a finite element grid. More...
#include <iostream>
#include <valarray>
#include <vector>
#include <fstream>
#include <sstream>
#include <dassert.h>
Go to the source code of this file.
Classes | |
struct | file |
File as a vector of lines. More... | |
struct | file::bad |
Report an error. More... | |
struct | nodes< T > |
Nodes as a vector of valarrays of size 3. More... | |
struct | nodes< T >::bad |
Report an error. More... | |
struct | fempair |
Nodelist with corresponding elemlist. More... | |
struct | fempair::bad |
Report an error. More... | |
class | evolution |
Typedefs | |
using | nodelist = nodes< double > |
Balazs node list. | |
using | elemlist = nodes< int > |
Balazs element list. | |
Functions | |
template<class F > | |
void | evolve_nodes (fempair &fm, F f) |
vector< pair< int, int > > | all_combinations (const valarray< int > &v) |
double | distance (const valarray< double > &vd1, const valarray< double > &vd2) |
double | max_h (const fempair &fm) |
template<class T > | |
void | print (const valarray< T > &v) |
For testing nodes<T> | |
void | print_what (const exception &e) |
int | main () try |
catch (const exception &e) | |
catch (...) | |
Calculate the maximum h of a finite element grid.
Revised by Christian Power July 2016 Originally written by Christian Power (power22c@gmail.com) July 2016
Definition in file maxH_main.cpp.
vector<pair<int, int> > all_combinations | ( | const valarray< int > & | v | ) |
Definition at line 126 of file maxH_main.cpp.
double distance | ( | const valarray< double > & | vd1, |
const valarray< double > & | vd2 | ||
) |
Definition at line 132 of file maxH_main.cpp.