The Mossolov problem by the augmented Lagrangian method
using namespace std;
int main(
int argc,
char**argv) {
string approx = (argc > 2) ? argv[2] : "P1";
pb.
Bi = (argc > 3) ? atof(argv[3]) : 0.2;
pb.
n = (argc > 4) ? atof(argv[4]) : 1;
size_t n_adapt = (argc > 5) ? atoi(argv[5]) : 0;
pb.
max_iter = (argc > 6) ? atoi(argv[6]) : 10000;
pb.err = (argc > 7) ? atof(argv[7]) : 1e-4;
pb.hmin = 1e-4;
pb.hmax = 1e-1;
pb.ratio = 3;
pb.additional = "-AbsError";
for (size_t i = 0; true; i++) {
pb.
reset (omega, approx);
if (i == n_adapt) break;
space T0h (sigma_h.get_geo(),
"P"+
itos(sigma_h.get_space().degree())+
"d");
omega.save();
}
}