/usr/include/getfem/getfem_norm.h is in libgetfem++-dev 4.2.1~beta1~svn4635~dfsg-5ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 | /* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
Copyright (C) 2000-2012 Yves Renard
This file is a part of GETFEM++
Getfem++ is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version along with the GCC Runtime Library
Exception either version 3.1 or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License and GCC Runtime Library Exception for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, you may use this file as it is a part of a free
software library without restriction. Specifically, if other files
instantiate templates or use macros or inline functions from this file,
or you compile this file and link it with other files to produce an
executable, this file does not by itself cause the resulting executable
to be covered by the GNU Lesser General Public License. This exception
does not however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
===========================================================================*/
#ifndef GETFEM_NORM_H__
#define GETFEM_NORM_H__
#include "getfem_mesh_fem.h"
#include "getfem_mesh_slicers.h"
#include "bgeot_geotrans_inv.h"
#include "getfem_export.h"
#include "bgeot_rtree.h"
namespace getfem {
enum { L2_NORM=1, H1_SEMI_NORM=2, H1_NORM=3, LINF_NORM=4 };
template<typename VECT1, typename VECT2>
class slicer_compute_norm_diff : public slicer_mesh_with_mesh {
const mesh_fem &mf1, &mf2;
const VECT1& U1;
const VECT2& U2;
papprox_integration pai;
pintegration_method pim;
int what; /* combiantion of L2_NORM, H1_SEMI_NORM .. */
bgeot::pgeotrans_precomp gp;
bgeot::geotrans_inv_convex gti;
scalar_type maxd;
public:
scalar_type l2_norm_sqr, h1_semi_norm_sqr, linf_norm;
slicer_compute_norm_diff(const mesh_fem& mf1_, const VECT1 &U1_,
const mesh_fem& mf2_, const VECT2 &U2_,
pintegration_method pim_, int what_=L2_NORM)
: slicer_mesh_with_mesh(mf2_.linked_mesh()), mf1(mf1_), mf2(mf2_),
U1(U1_), U2(U2_),
pai(get_approx_im_or_fail(pim_)), pim(pim_), what(what_), gp(0) {
l2_norm_sqr = 0.; h1_semi_norm_sqr = 0.; linf_norm = 0.; maxd=0.;
}
scalar_type norm(int w) {
scalar_type s = 0;
if (w & L2_NORM) s += sqrt(l2_norm_sqr);
if (w & H1_SEMI_NORM) s += sqrt(h1_semi_norm_sqr);
if (w & LINF_NORM) s+= linf_norm;
return s;
}
/*virtual*/ void intersection_callback(mesh_slicer &ms, size_type slmcv) {
if (ms.splx_in.card() == 0) return;
const mesh &m1 = mf1.linked_mesh();
const mesh &m2 = mf2.linked_mesh();
bgeot::pgeometric_trans pgt1 = m1.trans_of_convex(ms.cv);
bgeot::pgeometric_trans pgt2 = m2.trans_of_convex(slmcv);
pfem pf1 = mf1.fem_of_element(ms.cv);
pfem pf2 = mf2.fem_of_element(slmcv);
base_matrix G1, G2;
size_type qdim = mf1.get_qdim(), mdim = m1.dim();
base_vector val1(qdim), val2(qdim);
base_matrix gval1(qdim,mdim), gval2(qdim,mdim);
vectors_to_base_matrix(G1,m1.points_of_convex(ms.cv));
vectors_to_base_matrix(G2,m2.points_of_convex(slmcv));
fem_interpolation_context ctx1(pgt1,pf1,base_node(),G1,ms.cv,
size_type(-1));
fem_interpolation_context ctx2(pgt2,pf2,base_node(),G2,slmcv,
size_type(-1));
/* coordinates on the ref convex of each mesh */
std::vector<base_node> nodes1(pai->nb_points_on_convex()),
nodes2(pai->nb_points_on_convex());
gti.init(m2.convex(slmcv).points(), pgt2);
// cout << "hello, doing cv " << ms.cv << " <-> " << slmcv
// << " [" << ms.splx_in.card() << " simplexes]\n";
for (dal::bv_visitor is(ms.splx_in); !is.finished(); ++is) {
const slice_simplex &s = ms.simplexes[is];
if (gp == 0 || s.dim() != pai->dim())
gp = bgeot::geotrans_precomp(bgeot::simplex_geotrans(s.dim(),1),
&pai->integration_points(), pim);
//GMM_ASSERT1(false, "incompatible dimension of the slice");
base_matrix M(s.dim(),s.dim());
for (size_type i=0; i < s.dim(); ++i)
for (size_type j=0; j < s.dim(); ++j)
M(i,j) = ms.nodes[s.inodes[i+1]].pt[j]
- ms.nodes[s.inodes[0]].pt[j];
scalar_type J = gmm::abs(gmm::lu_det(M));
/* build nodes1 and nodes2 */
std::vector<base_node> ptref(s.dim()+1);
for (size_type k=0; k <= s.dim(); ++k)
gti.invert(ms.nodes[s.inodes[k]].pt, ptref[k]);
base_matrix G; vectors_to_base_matrix(G,ptref);
for (size_type k=0; k < nodes1.size(); ++k)
nodes2[k] = gp->transform(k,G);
for (size_type k=0; k <= s.dim(); ++k)
ptref[k] = ms.nodes[s.inodes[k]].pt_ref;
vectors_to_base_matrix(G,ptref);
for (size_type k=0; k < nodes1.size(); ++k)
nodes1[k] = gp->transform(k,G);
// base_vector coeff1(mf1.nb_basic_dof_of_element(ms.cv)),
// coeff2(mf2.nb_basic_dof_of_element(slmcv));
base_vector coeff1, coeff2;
slice_vector_on_basic_dof_of_element(mf1, U1, ms.cv, coeff1);
slice_vector_on_basic_dof_of_element(mf2, U2, slmcv, coeff2);
// gmm::copy(gmm::sub_vector
// (U1,gmm::sub_index(mf1.ind_basic_dof_of_element(ms.cv))),
// coeff1);
// gmm::copy(gmm::sub_vector
// (U2,gmm::sub_index(mf2.ind_basic_dof_of_element(slmcv))),
// coeff2);
for (size_type i=0; i < pai->nb_points_on_convex(); ++i) {
ctx1.set_xref(nodes1[i]); ctx2.set_xref(nodes2[i]);
if (what & (L2_NORM | LINF_NORM)) {
pf1->interpolation(ctx1, coeff1, val1, dim_type(qdim));
pf2->interpolation(ctx2, coeff2, val2, dim_type(qdim));
for (size_type q=0; q < qdim; ++q) {
l2_norm_sqr += gmm::sqr(val1[q]-val2[q])*J*pai->coeff(i);
linf_norm = std::max(linf_norm, gmm::abs(val1[q]-val2[q]));
}
}
if (what & H1_SEMI_NORM) {
pf1->interpolation_grad(ctx1, coeff1, gval1, dim_type(qdim));
pf2->interpolation_grad(ctx2, coeff2, gval2, dim_type(qdim));
for (size_type q=0; q < qdim*mdim; ++q) {
scalar_type v = gmm::sqr(gval1[q]-gval2[q])*J*pai->coeff(i);
if (v > maxd) {
cout << "new maxd: " << v << ", J=" << J << " at "
<< ctx1.xreal() << ", " << ctx2.xreal() << ", v1="
<< gval1[q] << ", v2=" << gval2[q] << "\n"; maxd = v; }
h1_semi_norm_sqr += gmm::sqr(gval1[q]-gval2[q])*J*pai->coeff(i);
}
}
}
}
}
};
/** Compute an L2 or H1 norm between two fonctions on two differents meshes
* by computing the error on the intersections of the elements of the
* two meshes. */
template<typename VECT1, typename VECT2>
void solutions_distance(const mesh_fem& mf1, const VECT1& UU1,
const mesh_fem& mf2, const VECT2& UU2,
pintegration_method im, scalar_type *pl2=0,
scalar_type *psh1=0) {
typedef typename gmm::linalg_traits<VECT1>::value_type T;
std::vector<T> U1(mf1.nb_basic_dof()), U2(mf2.nb_basic_dof());
mf1.extend_vector(UU1, U1);
mf2.extend_vector(UU2, U2);
mesh_slicer slicer(mf1.linked_mesh());
slicer_compute_norm_diff<VECT1,VECT2>
cn(mf1,U1,mf2,U2,im, (pl2 ? L2_NORM : 0) +
(psh1 ? H1_SEMI_NORM : 0));
slicer.push_back_action(cn);
slicer.exec();
if (pl2) *pl2 = cn.norm(L2_NORM);
if (psh1) *psh1 = cn.norm(H1_SEMI_NORM);
}
}
#endif
|