PolyFEM
Loading...
Searching...
No Matches
ElasticVarForm.cpp
Go to the documentation of this file.
1#include "ElasticVarForm.hpp"
2
4
6
10
12
16
18
21
23
25
30
31#include <algorithm>
32#include <map>
33#include <ostream>
34
35#include <igl/Timer.h>
36
37#include <spdlog/fmt/fmt.h>
38
39namespace polyfem::varform
40{
42 {
44 space_.reset();
49 rhs_assembler_ = nullptr;
50 mass_.resize(0, 0);
51 pure_mass_.resize(0, 0);
52 avg_mass_ = 0;
53 rhs_.resize(0, 0);
54 primary_assembler_ = nullptr;
55 mass_assembler_ = nullptr;
56 pure_mass_assembler_ = nullptr;
57 t0 = 0;
58 time_steps = 0;
59 dt = 0;
60 }
61
62 void ElasticVarForm::init(const std::string &formulation, const Units &units, const json &args, const std::string &out_path)
63 {
64 VarForm::init(formulation, units, args, out_path);
65 const bool is_time_dependent = args.contains("time") && !args["time"].is_null();
66
68 assert(primary_assembler_->name() == formulation);
69 if (args["solver"]["advanced"]["check_inversion"] == "Conservative")
70 {
71 if (auto elastic_assembler = std::dynamic_pointer_cast<assembler::ElasticityAssembler>(primary_assembler_))
72 elastic_assembler->set_use_robust_jacobian();
73 }
74 mass_assembler_ = std::make_shared<assembler::Mass>();
75 pure_mass_assembler_ = std::make_shared<assembler::HRZMass>();
76
77 if (!args.contains("preset_problem"))
78 {
79 problem = std::make_shared<assembler::GenericTensorProblem>("GenericTensor");
80
81 problem->clear();
82 json tmp;
83 tmp["is_time_dependent"] = is_time_dependent;
84 problem->set_parameters(tmp, root_path);
85
86 // important for the BC
87
88 auto bc = args["boundary_conditions"];
89 bc["root_path"] = root_path;
90 problem->set_parameters(bc, root_path);
91 problem->set_parameters(args["initial_conditions"], root_path);
92 problem->set_parameters(args["output"], root_path);
93 }
94 else
95 {
96 if (args["preset_problem"]["type"] == "Kernel")
97 {
98 problem = std::make_shared<problem::KernelProblem>("Kernel", *primary_assembler_);
99 problem->clear();
100 problem::KernelProblem &kprob = *dynamic_cast<problem::KernelProblem *>(problem.get());
101 }
102 else
103 {
104 problem = problem::ProblemFactory::factory().get_problem(args["preset_problem"]["type"]);
105 problem->clear();
106 }
107 // important for the BC
108 problem->set_parameters(args["preset_problem"], root_path);
109 }
110
111 problem->set_units(*primary_assembler_, units);
112
113 t0 = is_time_dependent ? args["time"]["t0"].get<double>() : 0.0;
114 time_steps = is_time_dependent ? args["time"]["time_steps"].get<int>() : 0;
115 dt = is_time_dependent ? args["time"]["dt"].get<double>() : 0.0;
116 }
117
118 void ElasticVarForm::load_mesh(const mesh::Mesh &mesh, const json &args)
119 {
122 pure_mass_assembler_->set_size(mass_assembler_->size());
123
124 problem->init(mesh);
125
126 if (assembler::MultiModel *mm = dynamic_cast<assembler::MultiModel *>(primary_assembler_.get()))
127 {
128 assert(args["materials"].is_array());
129
130 std::vector<std::string> materials(mesh.n_elements());
131
132 std::map<int, std::string> mats;
133
134 for (const auto &m : args["materials"])
135 mats[m["id"].get<int>()] = m["type"];
136
137 for (int i = 0; i < materials.size(); ++i)
138 materials[i] = mats.at(mesh.get_body_id(i));
139
140 mm->init_multimodels(materials);
141 }
142 }
143
144 void ElasticVarForm::build_basis(mesh::Mesh &mesh, const bool iso_parametric, const json &args)
145 {
146 assert(problem);
147 assert(primary_assembler_);
148 assert(mass_assembler_);
149 assert(pure_mass_assembler_);
150
151 Eigen::VectorXi space_disc_orders;
152 assign_discr_orders(args["space"]["discr_order"], mesh, space_disc_orders);
153
154 if (args["space"]["use_p_ref"])
155 {
157 mesh,
158 args["space"]["advanced"]["B"],
159 args["space"]["advanced"]["h1_formula"],
160 args["space"]["discr_order"],
161 args["space"]["advanced"]["discr_order_max"],
162 stats,
163 space_disc_orders);
164
165 logger().info("min p: {} max p: {}", space_disc_orders.minCoeff(), space_disc_orders.maxCoeff());
166 }
167
169 mesh,
170 iso_parametric,
171 space_disc_orders,
172 args["space"]["basis_type"],
173 args["space"]["poly_basis_type"],
175 mesh.dimension(),
176 args["space"]["advanced"]["quadrature_order"],
177 args["space"]["advanced"]["mass_quadrature_order"],
178 args["space"]["advanced"]["use_corner_quadrature"],
179 args["space"]["advanced"]["n_harmonic_samples"],
180 args["space"]["advanced"]["integral_constraints"],
181 space_,
182 boundary_);
183
184 problem->update_nodes(space_.space_in_node_to_node);
186
188 for (const auto &lb : boundary_.total_local_boundary)
189 boundary_.local_boundary.emplace_back(lb);
190
191 std::vector<basis::ElementBases> empty_pressure_bases;
192 std::vector<int> empty_pressure_boundary_nodes;
193 problem->setup_bc(
194 mesh, space_.n_bases,
195 space_.basis_list(), space_.geometry_basis_list(), empty_pressure_bases,
201 empty_pressure_boundary_nodes,
203
206
207 const auto &current_bases = space_.geometry_basis_list();
208 if (args["space"]["advanced"]["count_flipped_els"])
209 stats.count_flipped_elements(mesh, current_bases);
210
211 const int n_samples = 10;
212 stats.compute_mesh_size(mesh, current_bases, n_samples, args["output"]["advanced"]["curved_mesh_size"]);
213
214 logger().info("flipped elements {}", stats.n_flipped);
215 logger().info("h: {}", stats.mesh_size);
216
217 if (space_.n_bases <= args["solver"]["advanced"]["cache_size"])
218 {
219 igl::Timer timer;
220 timer.start();
221 logger().info("Building cache...");
222 ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases);
223 mass_ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases, true);
224 pure_mass_ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases, true);
225 logger().info(" took {}s", timer.getElapsedTime());
226 }
227 else
228 {
232 }
233 }
234
236 {
237 json rhs_solver_params = args["solver"]["linear"];
238 if (!rhs_solver_params.contains("Pardiso"))
239 rhs_solver_params["Pardiso"] = {};
240 rhs_solver_params["Pardiso"]["mtype"] = -2;
241
242 rhs_assembler_ = std::make_shared<assembler::RhsAssembler>(
243 *primary_assembler_, *mesh_, nullptr,
247 args["space"]["advanced"]["bc_method"],
248 rhs_solver_params);
249 }
250
252 {
253 igl::Timer timer;
254 json p_params = {};
255 p_params["formulation"] = primary_assembler_->name();
256 p_params["root_path"] = root_path;
257 {
258 RowVectorNd min, max, delta;
259 mesh.bounding_box(min, max);
260 delta = (max - min) / 2. + min;
261 if (mesh.is_volume())
262 p_params["bbox_center"] = {delta(0), delta(1), delta(2)};
263 else
264 p_params["bbox_center"] = {delta(0), delta(1)};
265 }
266 problem->set_parameters(p_params, root_path);
267
268 rhs_.resize(0, 0);
269
270 timer.start();
271 logger().info("Assigning rhs...");
272
274 assert(rhs_assembler_ != nullptr);
275 rhs_assembler_->assemble(mass_assembler_->density(), rhs_);
276 rhs_ *= -1;
277
278 timings.assigning_rhs_time = timer.getElapsedTime();
279 logger().info(" took {}s", timings.assigning_rhs_time);
280 }
281
282 void ElasticVarForm::assemble_mass_mat(const mesh::Mesh &mesh, const json &args)
283 {
284 if (!problem->is_time_dependent())
285 {
286 avg_mass_ = 1;
288 if (!primary_assembler_->is_linear())
290 return;
291 }
292
293 mass_.resize(0, 0);
294
295 igl::Timer timer;
296 timer.start();
297 logger().info("Assembling mass mat...");
298
300 if (!primary_assembler_->is_linear())
302
303 assert(mass_.size() > 0);
304
305 avg_mass_ = 0;
306 for (int k = 0; k < mass_.outerSize(); ++k)
307 for (StiffnessMatrix::InnerIterator it(mass_, k); it; ++it)
308 {
309 assert(it.col() == k);
310 avg_mass_ += it.value();
311 }
312
313 avg_mass_ /= mass_.rows();
314 logger().info("average mass {}", avg_mass_);
315
316 if (args["solver"]["advanced"]["lump_mass_matrix"])
318
319 timer.stop();
320 timings.assembling_mass_mat_time = timer.getElapsedTime();
321 logger().info(" took {}s", timings.assembling_mass_mat_time);
322
323 stats.nn_zero = mass_.nonZeros();
324 stats.num_dofs = mass_.rows();
325 stats.mat_size = (long long)mass_.rows() * (long long)mass_.cols();
326 logger().info("sparsity: {}/{}", stats.nn_zero, stats.mat_size);
327 }
328
329 void ElasticVarForm::initial_velocity(Eigen::MatrixXd &velocity) const
330 {
331 assert(rhs_assembler_ != nullptr);
332
333 const bool was_velocity_loaded = read_initial_x_from_file(
334 resolve_input_path(args["input"]["data"]["state"]), "v",
335 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
336 mesh_->dimension(), velocity);
337
338 if (!was_velocity_loaded)
339 rhs_assembler_->initial_velocity(velocity);
340 }
341
342 void ElasticVarForm::initial_acceleration(Eigen::MatrixXd &acceleration) const
343 {
344 assert(rhs_assembler_ != nullptr);
345
346 const bool was_acceleration_loaded = read_initial_x_from_file(
347 resolve_input_path(args["input"]["data"]["state"]), "a",
348 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
349 mesh_->dimension(), acceleration);
350
351 if (!was_acceleration_loaded)
352 rhs_assembler_->initial_acceleration(acceleration);
353 }
354
355 void ElasticVarForm::initial_elastic_solution(Eigen::MatrixXd &solution) const
356 {
357 assert(rhs_assembler_ != nullptr);
358
359 const bool was_solution_loaded = read_initial_x_from_file(
360 resolve_input_path(args["input"]["data"]["state"]), "u",
361 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
362 mesh_->dimension(), solution);
363
364 if (!was_solution_loaded)
365 {
366 if (problem->is_time_dependent())
367 rhs_assembler_->initial_solution(solution);
368 else
369 {
370 solution.resize(rhs_.size(), 1);
371 solution.setZero();
372 }
373 }
374 }
375
377 {
378 const int gdiscr_order = mesh_->orders().size() <= 0 ? 1 : mesh_->orders().maxCoeff();
379 const int discr_order = std::max(space_.disc_orders.maxCoeff(), gdiscr_order);
380 return n_boundary_samples(discr_order, gdiscr_order);
381 }
382
384 {
385 if (!mesh_ || !space_.geometry)
386 return {};
387
388 const auto &nodes = space_.is_iso_parametric() ? space_.mesh_nodes : space_.geometry->mesh_nodes;
389 if (!nodes)
390 return {};
391
392 auto indices = nodes->primitive_to_node();
393 indices.resize(mesh_->n_vertices());
394 return indices;
395 }
396
398 {
399 const auto p2n = elastic_primitive_to_node();
400 const int n_geometry_bases = space_.geometry ? space_.geometry->n_bases : 0;
401 std::vector<int> indices(n_geometry_bases, -1);
402 for (int i = 0; i < int(p2n.size()); ++i)
403 {
404 if (p2n[i] >= 0 && p2n[i] < int(indices.size()))
405 indices[p2n[i]] = i;
406 }
407 return indices;
408 }
409
410 std::vector<io::OutputField> ElasticVarForm::elastic_output_fields(
411 const io::OutputSample &sample,
412 const Eigen::MatrixXd &solution,
413 const io::OutputFieldOptions &options,
414 const mesh::Obstacle *obstacle,
415 const time_integrator::ImplicitTimeIntegrator *time_integrator,
416 const std::vector<std::pair<std::string, std::shared_ptr<solver::Form>>> &named_forms,
417 const solver::Form *elastic_form,
418 const solver::ContactForm *contact_form) const
419 {
420 std::vector<io::OutputField> fields;
421 if (!mesh_ || !problem || solution.size() <= 0)
422 return fields;
423
424 const bool has_element_samples = sample.local_points.rows() > 0 && sample.local_points.rows() == sample.element_ids.size();
425 const int output_rows = sample.points.rows() > 0 ? sample.points.rows() : std::max<int>(sample.local_points.rows(), sample.node_ids.size());
426
427 const int actual_dim = problem->is_scalar() ? 1 : mesh_->dimension();
428 const auto &paraview_options = args["output"]["paraview"]["options"];
429 const bool material_params = paraview_options["material"];
430 const bool body_ids = paraview_options["body_ids"];
431 const bool velocity = paraview_options["velocity"];
432 const bool acceleration = paraview_options["acceleration"];
433 const bool forces = paraview_options["forces"] && !problem->is_scalar();
434 const bool tensor_values = paraview_options["tensor_values"] && !problem->is_scalar();
435 const bool scalar_values = paraview_options["scalar_values"];
436 const bool use_spline = args["space"]["basis_type"] == "Spline";
437 const bool explicit_fields = !options.fields.empty();
438
439 const auto resize_to_output_rows = [&](Eigen::MatrixXd &values) {
440 if (output_rows <= values.rows())
441 return;
442
443 const int previous_rows = values.rows();
444 values.conservativeResize(output_rows, values.cols());
445 values.bottomRows(output_rows - previous_rows).setZero();
446 };
447
448 const auto append_obstacle_values = [&](Eigen::MatrixXd &sampled_values, const Eigen::MatrixXd &dof_values) -> bool {
449 if (!obstacle || obstacle->n_vertices() <= 0)
450 {
451 resize_to_output_rows(sampled_values);
452 return sample.points.rows() == 0 || sample.points.rows() == sampled_values.rows();
453 }
454
455 const bool has_obstacle_rows =
456 sample.points.rows() == sampled_values.rows() + obstacle->n_vertices()
457 && sample.points.cols() == obstacle->v().cols()
458 && sample.points.bottomRows(obstacle->n_vertices()).isApprox(obstacle->v());
459
460 if (!has_obstacle_rows)
461 return sample.points.rows() == 0 || sample.points.rows() == sampled_values.rows();
462
463 sampled_values.conservativeResize(sampled_values.rows() + obstacle->n_vertices(), sampled_values.cols());
464 if (dof_values.rows() >= obstacle->ndof())
465 sampled_values.bottomRows(obstacle->n_vertices()) =
466 utils::unflatten(dof_values.bottomRows(obstacle->ndof()), sampled_values.cols());
467 else
468 sampled_values.bottomRows(obstacle->n_vertices()).setZero();
469 return true;
470 };
471
472 const auto sample_dof_field = [&](const Eigen::MatrixXd &dof_values, const int field_dim, Eigen::MatrixXd &values) -> bool {
473 if (dof_values.size() <= 0 || field_dim <= 0)
474 return false;
475
476 if (has_element_samples)
477 {
478 values.resize(sample.local_points.rows(), field_dim);
479 for (int i = 0; i < sample.local_points.rows(); ++i)
480 {
481 const int element_id = sample.element_ids(i);
482 if (element_id < 0)
483 {
484 values.row(i).setZero();
485 continue;
486 }
487
488 Eigen::MatrixXd local_sol, local_grad;
491 element_id, sample.local_points.row(i), dof_values, local_sol, local_grad);
492
493 for (int d = 0; d < field_dim; ++d)
494 values(i, d) = local_sol(d);
495 }
496
497 return append_obstacle_values(values, dof_values);
498 }
499
500 if (sample.node_ids.size() > 0)
501 {
502 values.resize(sample.node_ids.size(), field_dim);
503 for (int i = 0; i < sample.node_ids.size(); ++i)
504 {
505 const int node_id = sample.node_ids(i);
506 for (int d = 0; d < field_dim; ++d)
507 {
508 const int dof = node_id * field_dim + d;
509 if (dof < 0 || dof >= dof_values.rows())
510 return false;
511 values(i, d) = dof_values(dof);
512 }
513 }
514
515 return sample.points.rows() == 0 || sample.points.rows() == values.rows();
516 }
517
518 return false;
519 };
520
521 const auto append_sampled_dof_field = [&](const std::string &name, const Eigen::MatrixXd &dof_values, const int field_dim) {
522 Eigen::MatrixXd values;
523 if (sample_dof_field(dof_values, field_dim, values))
524 fields.push_back({name, values, io::OutputField::Association::Point});
525 };
526
527 const auto append_scalar_values = [&]() {
528 if (!scalar_values || problem->is_scalar() || !has_element_samples)
529 return;
530
531 const bool wants_scalar = options.fields.empty()
532 || options.export_field("von_mises")
533 || options.export_field("von_mises_avg");
534 if (!wants_scalar)
535 return;
536
537 std::vector<assembler::Assembler::NamedMatrix> point_values;
538 for (int i = 0; i < sample.local_points.rows(); ++i)
539 {
540 const int element_id = sample.element_ids(i);
541 if (element_id < 0)
542 continue;
543
544 std::vector<assembler::Assembler::NamedMatrix> local_values;
545 primary_assembler_->compute_scalar_value(
546 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
547 local_values);
548
549 if (point_values.empty())
550 {
551 point_values.resize(local_values.size());
552 for (int k = 0; k < local_values.size(); ++k)
553 {
554 point_values[k].first = local_values[k].first;
555 point_values[k].second.setZero(output_rows, local_values[k].second.cols());
556 }
557 }
558
559 for (int k = 0; k < local_values.size(); ++k)
560 point_values[k].second.row(i) = local_values[k].second;
561 }
562
563 for (const auto &[name, values] : point_values)
564 {
565 if (options.export_field(name))
566 fields.push_back({name, values, io::OutputField::Association::Point});
567 }
568 };
569
570 const auto append_tensor_values = [&]() {
571 if (!tensor_values || problem->is_scalar() || !has_element_samples)
572 return;
573
574 const bool wants_tensor = options.fields.empty()
575 || options.export_field("cauchy_stess")
576 || options.export_field("pk1_stess")
577 || options.export_field("pk2_stess")
578 || options.export_field("F");
579 if (!wants_tensor)
580 return;
581
582 std::vector<assembler::Assembler::NamedMatrix> point_values;
583 for (int i = 0; i < sample.local_points.rows(); ++i)
584 {
585 const int element_id = sample.element_ids(i);
586 if (element_id < 0)
587 continue;
588
589 std::vector<assembler::Assembler::NamedMatrix> local_values;
590 primary_assembler_->compute_tensor_value(
591 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
592 local_values);
593
594 if (point_values.empty())
595 {
596 point_values.resize(local_values.size());
597 for (int k = 0; k < local_values.size(); ++k)
598 {
599 point_values[k].first = local_values[k].first;
600 point_values[k].second.setZero(output_rows, local_values[k].second.cols());
601 }
602 }
603
604 for (int k = 0; k < local_values.size(); ++k)
605 point_values[k].second.row(i) = local_values[k].second;
606 }
607
608 for (const auto &[name, values] : point_values)
609 {
610 if (!options.export_field(name))
611 continue;
612
613 const int stride = mesh_->dimension();
614 assert(values.cols() % stride == 0);
615 for (int i = 0; i < values.cols(); i += stride)
616 {
617 const int ii = (i / stride) + 1;
618 fields.push_back({fmt::format("{:s}_{:d}", name, ii), values.middleCols(i, stride), io::OutputField::Association::Point});
619 }
620 }
621 };
622
623 const auto append_averaged_values = [&]() {
624 if (use_spline || problem->is_scalar() || !has_element_samples || (!scalar_values && !tensor_values))
625 return;
626
627 const bool wants_avg = options.fields.empty()
628 || options.export_field("von_mises_avg")
629 || options.export_field("cauchy_stess_avg")
630 || options.export_field("pk1_stess_avg")
631 || options.export_field("pk2_stess_avg")
632 || options.export_field("F_avg");
633 if (!wants_avg)
634 return;
635
636 Eigen::MatrixXd areas(space_.n_bases, 1);
637 areas.setZero();
638 std::vector<assembler::Assembler::NamedMatrix> tmp_s, tmp_t;
639 std::vector<Eigen::MatrixXd> avg_scalar, avg_tensor;
640
641 for (int e = 0; e < int(space_.basis_list().size()); ++e)
642 {
643 Eigen::MatrixXd local_pts;
644 if (mesh_->is_simplex(e))
645 {
646 if (mesh_->dimension() == 3)
647 autogen::p_nodes_3d(space_.disc_orders(e), local_pts);
648 else
649 autogen::p_nodes_2d(space_.disc_orders(e), local_pts);
650 }
651 else if (mesh_->is_cube(e))
652 {
653 if (mesh_->dimension() == 3)
654 autogen::q_nodes_3d(space_.disc_orders(e), local_pts);
655 else
656 autogen::q_nodes_2d(space_.disc_orders(e), local_pts);
657 }
658 else if (mesh_->is_prism(e))
659 {
660 autogen::prism_nodes_3d(space_.disc_orders(e), space_.disc_ordersq(e), local_pts);
661 }
662 else
663 {
664 continue;
665 }
666
667 const basis::ElementBases &bs = space_.basis_list()[e];
668 const basis::ElementBases &gbs = space_.geometry_basis_list()[e];
669
670 assembler::ElementAssemblyValues vals;
671 vals.compute(e, mesh_->is_volume(), bs, gbs);
672 const double area = (vals.det.array() * vals.quadrature.weights.array()).sum();
673
674 if (scalar_values)
675 primary_assembler_->compute_scalar_value(assembler::OutputData(sample.time, e, bs, gbs, local_pts, solution), tmp_s);
676 if (tensor_values)
677 primary_assembler_->compute_tensor_value(assembler::OutputData(sample.time, e, bs, gbs, local_pts, solution), tmp_t);
678
679 if (avg_scalar.empty() && !tmp_s.empty())
680 {
681 avg_scalar.resize(tmp_s.size());
682 for (auto &m : avg_scalar)
683 m.setZero(space_.n_bases, 1);
684 }
685 if (avg_tensor.empty() && !tmp_t.empty())
686 {
687 avg_tensor.resize(tmp_t.size());
688 for (auto &m : avg_tensor)
689 m.setZero(space_.n_bases, actual_dim * actual_dim);
690 }
691
692 for (size_t j = 0; j < bs.bases.size(); ++j)
693 {
694 const basis::Basis &b = bs.bases[j];
695 if (b.global().size() > 1)
696 continue;
697
698 const int index = b.global().front().index;
699 areas(index) += area;
700 for (int k = 0; k < tmp_s.size(); ++k)
701 avg_scalar[k](index) += tmp_s[k].second(j) * area;
702 for (int k = 0; k < tmp_t.size(); ++k)
703 avg_tensor[k].row(index) += tmp_t[k].second.row(j) * area;
704 }
705 }
706
707 for (auto &m : avg_scalar)
708 for (int i = 0; i < m.rows(); ++i)
709 if (areas(i) > 0)
710 m(i) /= areas(i);
711 for (auto &m : avg_tensor)
712 for (int i = 0; i < m.rows(); ++i)
713 if (areas(i) > 0)
714 m.row(i) /= areas(i);
715
716 for (int k = 0; k < tmp_s.size(); ++k)
717 {
718 const std::string name = fmt::format("{:s}_avg", tmp_s[k].first);
719 if (!options.export_field(name))
720 continue;
721
722 Eigen::MatrixXd sampled;
723 if (sample_dof_field(avg_scalar[k], 1, sampled))
724 fields.push_back({name, sampled, io::OutputField::Association::Point});
725 }
726
727 for (int k = 0; k < tmp_t.size(); ++k)
728 {
729 const std::string base_name = fmt::format("{:s}_avg", tmp_t[k].first);
730 if (!options.export_field(base_name))
731 continue;
732
733 Eigen::MatrixXd sampled;
734 if (!sample_dof_field(utils::flatten(avg_tensor[k]), actual_dim * actual_dim, sampled))
735 continue;
736
737 const int stride = mesh_->dimension();
738 for (int i = 0; i < sampled.cols(); i += stride)
739 {
740 const int ii = (i / stride) + 1;
741 fields.push_back({fmt::format("{:s}_{:d}", base_name, ii), sampled.middleCols(i, stride), io::OutputField::Association::Point});
742 }
743 }
744 };
745
746 const auto append_material_fields = [&]() {
747 if (!material_params || !has_element_samples)
748 return;
749
750 const auto &params = primary_assembler_->parameters();
751 std::map<std::string, Eigen::MatrixXd> param_values;
752 for (const auto &[p, _] : params)
753 param_values[p].setZero(output_rows, 1);
754 Eigen::MatrixXd rhos = Eigen::MatrixXd::Zero(output_rows, 1);
755
756 const auto &density = mass_assembler_->density();
757 for (int i = 0; i < sample.local_points.rows(); ++i)
758 {
759 const int element_id = sample.element_ids(i);
760 if (element_id < 0)
761 continue;
762
763 for (const auto &[p, func] : params)
764 param_values.at(p)(i) = func(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
765 rhos(i) = density(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
766 }
767
768 for (const auto &[name, values] : param_values)
769 if (options.export_field(name))
770 fields.push_back({name, values, io::OutputField::Association::Point});
771 if (options.export_field("rho"))
772 fields.push_back({"rho", rhos, io::OutputField::Association::Point});
773 };
774
775 const auto append_body_ids = [&]() {
776 if (!body_ids || !options.export_field("body_ids") || !has_element_samples)
777 return;
778
779 Eigen::MatrixXd ids = Eigen::MatrixXd::Zero(output_rows, 1);
780 for (int i = 0; i < sample.element_ids.size(); ++i)
781 {
782 const int element_id = sample.element_ids(i);
783 if (element_id >= 0)
784 ids(i) = mesh_->get_body_id(element_id);
785 }
786 fields.push_back({"body_ids", ids, io::OutputField::Association::Point});
787 };
788
789 const auto compute_traction_forces = [&]() {
790 Eigen::MatrixXd traction_forces;
791 traction_forces.setZero(space_.n_bases * actual_dim, 1);
792
793 Eigen::MatrixXd uv, points, normals;
794 Eigen::VectorXd weights;
795 Eigen::VectorXi global_primitive_ids;
796 assembler::ElementAssemblyValues vals;
797
798 for (const auto &lb : boundary_.total_local_boundary)
799 {
800 const int e = lb.element_id();
801 const bool has_samples = utils::BoundarySampler::boundary_quadrature(
802 lb, elastic_boundary_samples(), *mesh_, false, uv, points, normals, weights, global_primitive_ids);
803 if (!has_samples)
804 continue;
805
806 const basis::ElementBases &bs = space_.basis_list()[e];
807 const basis::ElementBases &gbs = space_.geometry_basis_list()[e];
808 vals.compute(e, mesh_->is_volume(), points, bs, gbs);
809
810 for (int n = 0; n < normals.rows(); ++n)
811 {
812 Eigen::MatrixXd deform_mat = Eigen::MatrixXd::Zero(actual_dim, actual_dim);
813 for (const auto &b : vals.basis_values)
814 {
815 for (const auto &g : b.global)
816 {
817 for (int d = 0; d < actual_dim; ++d)
818 deform_mat.row(d) += solution(g.index * actual_dim + d) * b.grad.row(n);
819 }
820 }
821
822 Eigen::MatrixXd trafo = vals.jac_it[n].inverse() + deform_mat;
823 normals.row(n) = normals.row(n) * trafo.inverse();
824 normals.row(n).normalize();
825 }
826
827 std::vector<assembler::Assembler::NamedMatrix> tensor_flat;
828 primary_assembler_->compute_tensor_value(assembler::OutputData(sample.time, e, bs, gbs, points, solution), tensor_flat);
829
830 for (long n = 0; n < vals.basis_values.size(); ++n)
831 {
832 const assembler::AssemblyValues &v = vals.basis_values[n];
833 const int g_index = v.global[0].index * actual_dim;
834 for (int q = 0; q < points.rows(); ++q)
835 {
836 assert(tensor_flat[0].first == "cauchy_stess");
837 Eigen::MatrixXd stress_tensor = utils::unflatten(tensor_flat[0].second.row(q), actual_dim);
838 traction_forces.block(g_index, 0, actual_dim, 1) += stress_tensor * normals.row(q).transpose() * v.val(q) * weights(q);
839 }
840 }
841 }
842
843 return traction_forces;
844 };
845
846 const auto append_traction_force = [&]() {
847 if (problem->is_scalar() || !explicit_fields || !options.export_field("traction_force"))
848 return;
849
850 if (has_element_samples && sample.normals.rows() == sample.local_points.rows() && sample.primitive_ids.size() == sample.local_points.rows())
851 {
852 const Eigen::MatrixXd displaced_normals = displaced_output_normals(sample, solution);
853 const Eigen::MatrixXd &normals = displaced_normals.rows() == sample.normals.rows() ? displaced_normals : sample.normals;
854 Eigen::MatrixXd values = Eigen::MatrixXd::Zero(output_rows, actual_dim);
855 for (int i = 0; i < sample.local_points.rows(); ++i)
856 {
857 const int element_id = sample.element_ids(i);
858 if (element_id < 0)
859 continue;
860
861 std::vector<assembler::Assembler::NamedMatrix> tensor_flat;
862 primary_assembler_->compute_tensor_value(
863 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
864 tensor_flat);
865
866 assert(tensor_flat[0].first == "cauchy_stess");
867 Eigen::Map<Eigen::MatrixXd> tensor(tensor_flat[0].second.data(), actual_dim, actual_dim);
868 values.row(i) = normals.row(i) * tensor;
869
870 double area = 0;
871 const int primitive_id = sample.primitive_ids(i);
872 if (mesh_->is_volume())
873 {
874 if (mesh_->is_simplex(element_id))
875 area = mesh_->tri_area(primitive_id);
876 else if (mesh_->is_cube(element_id))
877 area = mesh_->quad_area(primitive_id);
878 else if (mesh_->is_prism(element_id))
879 area = mesh_->n_face_vertices(primitive_id) == 4 ? mesh_->quad_area(primitive_id) : mesh_->tri_area(primitive_id);
880 }
881 else
882 {
883 area = mesh_->edge_length(primitive_id);
884 }
885 values.row(i) *= area;
886 }
887 fields.push_back({"traction_force", values, io::OutputField::Association::Point});
888 return;
889 }
890
891 append_sampled_dof_field("traction_force", compute_traction_forces(), actual_dim);
892 };
893
894 append_scalar_values();
895 append_tensor_values();
896 append_averaged_values();
897 append_material_fields();
898 append_body_ids();
899
900 if ((paraview_options["jacobian_validity"] || (explicit_fields && options.export_field("validity")))
901 && has_element_samples
902 && sample.primitive_ids.size() == 0)
903 {
904 const auto invalid_elements = utils::count_invalid(
905 mesh_->dimension(), space_.basis_list(), space_.geometry_basis_list(), solution);
906 Eigen::MatrixXd validity = Eigen::MatrixXd::Zero(output_rows, 1);
907 for (int i = 0; i < sample.element_ids.size(); ++i)
908 {
909 validity(i) = std::find(
910 invalid_elements.begin(), invalid_elements.end(), sample.element_ids(i))
911 != invalid_elements.end();
912 }
913 fields.push_back({"validity", validity, io::OutputField::Association::Point});
914 }
915
916 if (problem->is_time_dependent())
917 {
918 if (velocity && options.export_field("velocity"))
919 append_sampled_dof_field(
920 "velocity",
921 time_integrator ? time_integrator->v_prev() : Eigen::VectorXd::Zero(solution.size()),
922 actual_dim);
923 if (acceleration && options.export_field("acceleration"))
924 append_sampled_dof_field(
925 "acceleration",
926 time_integrator ? time_integrator->a_prev() : Eigen::VectorXd::Zero(solution.size()),
927 actual_dim);
928 }
929
930 if (forces)
931 {
932 const double s = time_integrator ? time_integrator->acceleration_scaling() : 1;
933 for (const auto &[name, form] : named_forms)
934 {
935 const std::string field_name = name + "_forces";
936 if (!options.export_field(field_name))
937 continue;
938
939 Eigen::VectorXd force;
940 if (form && form->enabled())
941 {
942 form->first_derivative(solution, force);
943 force *= -1.0 / s;
944 }
945 else
946 {
947 force.setZero(solution.size());
948 }
949 append_sampled_dof_field(field_name, force, actual_dim);
950 }
951 }
952
953 append_traction_force();
954
955 if (explicit_fields && options.export_field("gradient_of_elastic_potential") && elastic_form)
956 {
957 Eigen::VectorXd potential_grad;
958 elastic_form->first_derivative(solution, potential_grad);
959 append_sampled_dof_field("gradient_of_elastic_potential", potential_grad, actual_dim);
960 }
961
962 if (explicit_fields && options.export_field("gradient_of_contact_potential") && contact_form && contact_form->weight() > 0)
963 {
964 Eigen::VectorXd potential_grad;
965 contact_form->first_derivative(solution, potential_grad);
966 potential_grad *= -contact_form->barrier_stiffness() / contact_form->weight();
967 append_sampled_dof_field("gradient_of_contact_potential", potential_grad, actual_dim);
968 }
969
970 append_primary_output_fields(fields, sample, solution, options, obstacle);
971 return fields;
972 }
973
974 void ElasticVarForm::append_primary_output_fields(
975 std::vector<io::OutputField> &fields,
976 const io::OutputSample &sample,
977 const Eigen::MatrixXd &solution,
978 const io::OutputFieldOptions &options,
979 const mesh::Obstacle *obstacle) const
980 {
981 if (!mesh_ || solution.size() <= 0)
982 return;
983
984 const int dim = mesh_->dimension();
985 const bool has_element_samples =
986 sample.local_points.rows() > 0
987 && sample.local_points.rows() == sample.element_ids.size();
988 const bool export_solution_gradient =
989 !options.fields.empty() && options.export_field("solution_gradient");
990
991 Eigen::MatrixXd values, gradients;
992 if (has_element_samples)
993 {
994 values.resize(sample.local_points.rows(), dim);
995 if (export_solution_gradient)
996 gradients.resize(sample.local_points.rows(), dim * mesh_->dimension());
997 for (int i = 0; i < sample.local_points.rows(); ++i)
998 {
999 const int element_id = sample.element_ids(i);
1000 if (element_id < 0)
1001 {
1002 values.row(i).setZero();
1003 if (gradients.rows() > 0)
1004 gradients.row(i).setZero();
1005 continue;
1006 }
1007
1008 Eigen::MatrixXd local_value, local_gradient;
1010 *mesh_, dim, space_.basis_list(), space_.geometry_basis_list(),
1011 element_id, sample.local_points.row(i), solution,
1012 local_value, local_gradient);
1013 values.row(i) = local_value;
1014 if (gradients.rows() > 0)
1015 gradients.row(i) = local_gradient;
1016 }
1017
1018 if (obstacle && obstacle->n_vertices() > 0
1019 && sample.points.rows() == values.rows() + obstacle->n_vertices()
1020 && sample.points.cols() == obstacle->v().cols()
1021 && sample.points.bottomRows(obstacle->n_vertices()).isApprox(obstacle->v()))
1022 {
1023 values.conservativeResize(values.rows() + obstacle->n_vertices(), Eigen::NoChange);
1024 if (solution.rows() >= obstacle->ndof())
1025 values.bottomRows(obstacle->n_vertices()) =
1026 utils::unflatten(solution.bottomRows(obstacle->ndof()), dim);
1027 else
1028 values.bottomRows(obstacle->n_vertices()).setZero();
1029 if (gradients.rows() > 0)
1030 {
1031 gradients.conservativeResize(values.rows(), Eigen::NoChange);
1032 gradients.bottomRows(obstacle->n_vertices()).setZero();
1033 }
1034 }
1035 }
1036 else if (sample.node_ids.size() > 0)
1037 {
1038 values.resize(sample.node_ids.size(), dim);
1039 for (int i = 0; i < sample.node_ids.size(); ++i)
1040 {
1041 for (int d = 0; d < dim; ++d)
1042 {
1043 const int dof = sample.node_ids(i) * dim + d;
1044 if (dof < 0 || dof >= solution.rows())
1045 return;
1046 values(i, d) = solution(dof);
1047 }
1048 }
1049 }
1050 else
1051 {
1052 return;
1053 }
1054
1055 if (sample.points.rows() > 0 && values.rows() != sample.points.rows())
1056 return;
1057 if (options.export_field("displacement"))
1058 fields.push_back({"displacement", values, io::OutputField::Association::Point});
1059 if (options.export_field("solution"))
1060 fields.push_back({"solution", values, io::OutputField::Association::Point});
1061 if (export_solution_gradient && gradients.rows() == values.rows())
1062 fields.push_back({"solution_gradient", gradients, io::OutputField::Association::Point});
1063
1064 if (options.export_field("displaced_normals"))
1065 {
1066 Eigen::MatrixXd normals = displaced_output_normals(sample, solution);
1067 if (normals.rows() == values.rows())
1068 fields.push_back({"displaced_normals", normals, io::OutputField::Association::Point});
1069 }
1070 }
1071
1072 Eigen::MatrixXd ElasticVarForm::displaced_output_normals(
1073 const io::OutputSample &sample,
1074 const Eigen::MatrixXd &solution) const
1075 {
1076 if (!mesh_
1077 || sample.normals.rows() == 0
1078 || sample.normals.rows() != sample.local_points.rows()
1079 || sample.local_points.rows() != sample.element_ids.size())
1080 return {};
1081
1082 const int dim = mesh_->dimension();
1083 Eigen::MatrixXd displaced_normals = sample.normals;
1084 for (int i = 0; i < sample.local_points.rows(); ++i)
1085 {
1086 const int element_id = sample.element_ids(i);
1087 if (element_id < 0)
1088 continue;
1089
1090 Eigen::MatrixXd local_value, local_gradient;
1092 *mesh_, dim, space_.basis_list(), space_.geometry_basis_list(),
1093 element_id, sample.local_points.row(i), solution,
1094 local_value, local_gradient);
1095
1096 Eigen::MatrixXd deformation = Eigen::MatrixXd::Identity(dim, dim);
1097 for (int d = 0; d < dim; ++d)
1098 deformation.row(d) += local_gradient.block(0, d * dim, 1, dim);
1099 displaced_normals.row(i) = sample.normals.row(i) * deformation.inverse();
1100 displaced_normals.row(i).normalize();
1101 }
1102 return displaced_normals;
1103 }
1104
1105 io::OutputSpace ElasticVarForm::output_space() const
1106 {
1107 Eigen::VectorXi output_orders = space_.disc_orders;
1108 if (mesh_ && space_.disc_ordersq.size() == space_.disc_orders.size())
1109 {
1110 for (int e = 0; e < output_orders.size(); ++e)
1111 {
1112 if (mesh_->is_prism(e))
1113 output_orders(e) = std::max(space_.disc_orders(e), space_.disc_ordersq(e));
1114 }
1115 }
1116
1117 return {
1118 mesh_.get(),
1119 &space_.geometry_basis_list(),
1120 output_orders,
1121 &space_.polys,
1122 &space_.polys_3d,
1123 &boundary_.total_local_boundary,
1124 nullptr,
1125 nullptr,
1126 &boundary_.dirichlet_nodes,
1127 &boundary_.dirichlet_nodes_position};
1128 }
1129
1130 io::OutStatsData ElasticVarForm::compute_errors(const Eigen::MatrixXd &solution)
1131 {
1132 if (!args["output"]["advanced"]["compute_error"])
1133 return stats;
1134
1135 double tend = 0;
1136 if (!args["time"].is_null())
1137 tend = args["time"]["tend"];
1138
1139 stats.compute_errors(space_.n_bases, space_.basis_list(), space_.geometry_basis_list(), *mesh_, *problem, tend, solution);
1140 return stats;
1141 }
1142
1143 void ElasticVarForm::export_data(const Eigen::MatrixXd &solution) const
1144 {
1145 const io::OutputSpace space = output_space();
1146 if (!space.mesh)
1147 {
1148 logger().error("Load the mesh first!");
1149 return;
1150 }
1151 if (solution.size() <= 0)
1152 {
1153 logger().error("Solve the problem first!");
1154 return;
1155 }
1156
1157 ensure_output_sampler();
1158
1159 const std::string vis_mesh_path = resolve_output_path(args["output"]["paraview"]["file_name"]);
1160 const bool has_time = args.contains("time") && !args["time"].is_null();
1161 double tend = has_time ? args["time"]["tend"].get<double>() : 1.0;
1162 double dt = 1;
1163 if (has_time)
1164 dt = args["time"]["dt"];
1165
1166 const auto opts = export_options(space);
1167 output_geometry_.export_data(
1168 space,
1169 output_field_function(solution, opts),
1170 has_time,
1171 tend, dt,
1172 opts,
1173 vis_mesh_path);
1174
1175 const std::string solution_path = resolve_output_path(args["output"]["data"]["solution"]);
1176 if (!solution_path.empty())
1177 {
1178 const int dim = mesh_->dimension();
1179 const int primary_ndof = std::min<int>(solution.rows(), space_.n_bases * dim);
1180 const Eigen::MatrixXd primary_solution = solution.topRows(primary_ndof);
1181 if (opts.reorder_output && space_.space_in_node_to_node.size() > 0)
1182 {
1183 const Eigen::MatrixXd nodal_solution = utils::unflatten(primary_solution, dim);
1184 Eigen::MatrixXd reordered = Eigen::MatrixXd::Zero(nodal_solution.rows(), nodal_solution.cols());
1185 for (int input_node = 0; input_node < space_.space_in_node_to_node.size(); ++input_node)
1186 {
1187 const int node = space_.space_in_node_to_node(input_node);
1188 if (node >= 0 && node < nodal_solution.rows() && input_node < reordered.rows())
1189 reordered.row(input_node) = nodal_solution.row(node);
1190 }
1191 io::write_matrix(solution_path, reordered);
1192 }
1193 else
1194 {
1195 io::write_matrix(solution_path, primary_solution);
1196 }
1197 }
1198
1199 const std::string nodes_path = resolve_output_path(args["output"]["data"]["nodes"]);
1200 if (!nodes_path.empty())
1201 {
1202 Eigen::MatrixXd nodes = Eigen::MatrixXd::Zero(space_.n_bases, mesh_->dimension());
1203 for (const basis::ElementBases &element_bases : space_.basis_list())
1204 for (const basis::Basis &basis : element_bases.bases)
1205 for (const auto &global : basis.global())
1206 nodes.row(global.index) = global.node;
1207 io::write_matrix(nodes_path, nodes);
1208 }
1209
1210 const std::string stress_path = resolve_output_path(args["output"]["data"]["stress_mat"]);
1211 const std::string mises_path = resolve_output_path(args["output"]["data"]["mises"]);
1212 if ((!stress_path.empty() || !mises_path.empty()) && primary_assembler_)
1213 {
1214 Eigen::MatrixXd stress;
1215 Eigen::VectorXd mises;
1217 *mesh_, problem->is_scalar(), space_.basis_list(), space_.geometry_basis_list(),
1218 space_.disc_orders, space_.disc_ordersq, *primary_assembler_, solution, tend,
1219 stress, mises);
1220 if (!stress_path.empty())
1221 io::write_matrix(stress_path, stress);
1222 if (!mises_path.empty())
1223 io::write_matrix(mises_path, mises);
1224 }
1225 }
1226
1227 void ElasticVarForm::save_json(const Eigen::MatrixXd &solution, std::ostream &out) const
1228 {
1229 if (!mesh_)
1230 {
1231 logger().error("Load the mesh first!");
1232 return;
1233 }
1234 if (solution.size() <= 0)
1235 {
1236 logger().error("Solve the problem first!");
1237 return;
1238 }
1239
1240 logger().info("Saving json...");
1241 const int primary_size = space_.n_bases * mesh_->dimension();
1242 const Eigen::MatrixXd stats_solution =
1243 solution.rows() >= primary_size
1244 ? solution.topRows(primary_size).eval()
1245 : solution;
1246
1247 nlohmann::json j;
1248 stats.save_json(
1249 args, space_.n_bases, 0,
1250 stats_solution, *mesh_, space_.disc_orders, space_.disc_ordersq, *problem,
1251 timings, primary_assembler_ ? primary_assembler_->name() : name(), space_.is_iso_parametric(),
1252 args["output"]["advanced"]["sol_at_node"], j);
1253 out << j.dump(4) << std::endl;
1254 }
1255
1256 void ElasticVarForm::save_elastic_step_state(
1257 const double t0,
1258 const double dt,
1259 const int t,
1260 const time_integrator::ImplicitTimeIntegrator *time_integrator) const
1261 {
1262 if (!mesh_)
1263 return;
1264
1265 const int global_t = output_file_index(t);
1266 const std::string rest_mesh_path = args["output"]["data"]["rest_mesh"].get<std::string>();
1267 bool rest_mesh_written = false;
1268 if (!rest_mesh_path.empty())
1269 {
1270 Eigen::MatrixXd V;
1271 Eigen::MatrixXi F;
1272 build_mesh_matrices(V, F);
1274 resolve_output_path(fmt::format(rest_mesh_path, global_t)),
1275 V, F, mesh_->get_body_ids(), mesh_->is_volume(), /*binary=*/true);
1276 rest_mesh_written = true;
1277 }
1278
1279 save_step_state(t0, dt, t, time_integrator, rest_mesh_written);
1280 }
1281
1282 void ElasticVarForm::build_mesh_matrices(Eigen::MatrixXd &V, Eigen::MatrixXi &F) const
1283 {
1284 assert(mesh_);
1285 assert(space_.basis_list().size() == mesh_->n_elements());
1286 const size_t n_vertices = space_.n_bases - n_obstacle_vertices();
1287 const int dim = mesh_->dimension();
1288
1289 V.resize(n_vertices, dim);
1290 F.resize(space_.basis_list().size(), dim + 1);
1291
1292 for (int i = 0; i < space_.basis_list().size(); i++)
1293 {
1294 const basis::ElementBases &element = space_.basis_list()[i];
1295 for (int j = 0; j < element.bases.size(); j++)
1296 {
1297 const basis::Basis &basis = element.bases[j];
1298 assert(basis.global().size() == 1);
1299 V.row(basis.global()[0].index) = basis.global()[0].node;
1300 if (j < F.cols())
1301 F(i, j) = basis.global()[0].index;
1302 }
1303 }
1304 }
1305
1306} // namespace polyfem::varform
int V
ElementAssemblyValues vals
Definition Assembler.cpp:22
std::array< Matrix< int, 3, 3 >, 3 > space_
static std::shared_ptr< Assembler > make_assembler(const std::string &formulation)
void init(const bool is_volume, const std::vector< basis::ElementBases > &bases, const std::vector< basis::ElementBases > &gbases, const bool is_mass=false)
computes the basis evaluation and geometric mapping for each of the given ElementBases in bases initi...
void init_empty(const bool is_mass=false)
initialize an empty cache.
void compute(const int el_index, const bool is_volume, const Eigen::MatrixXd &pts, const basis::ElementBases &basis, const basis::ElementBases &gbasis)
computes the per element values at the local (ref el) points (pts) sets basis_values,...
std::vector< Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic, 0, 3, 3 > > jac_it
Represents one basis function and its gradient.
Definition Basis.hpp:44
Stores the basis functions for a given element in a mesh (facet in 2d, cell in 3d).
std::vector< Basis > bases
one basis function per node in the element
static void interpolate_at_local_vals(const mesh::Mesh &mesh, const bool is_problem_scalar, const std::vector< basis::ElementBases > &bases, const std::vector< basis::ElementBases > &gbases, const int el_index, const Eigen::MatrixXd &local_pts, const Eigen::MatrixXd &fun, Eigen::MatrixXd &result, Eigen::MatrixXd &result_grad)
interpolate solution and gradient at element (calls interpolate_at_local_vals with sol)
static void compute_stress_at_quadrature_points(const mesh::Mesh &mesh, const bool is_problem_scalar, const std::vector< basis::ElementBases > &bases, const std::vector< basis::ElementBases > &gbases, const Eigen::VectorXi &disc_orders, const Eigen::VectorXi &disc_ordersq, const assembler::Assembler &assembler, const Eigen::MatrixXd &fun, const double t, Eigen::MatrixXd &result, Eigen::VectorXd &von_mises)
compute von mises stress at quadrature points for the function fun, also compute the interpolated fun...
static void write(const std::string &path, const mesh::Mesh &mesh, const bool binary)
saves the mesh
Definition MshWriter.cpp:7
double assigning_rhs_time
time to computing the rhs
double assembling_mass_mat_time
time to assembly mass
all stats from polyfem
int n_flipped
number of flipped elements, compute only when using count_flipped_els (false by default)
void count_flipped_elements(const polyfem::mesh::Mesh &mesh, const std::vector< polyfem::basis::ElementBases > &gbases)
counts the number of flipped elements
Definition OutData.cpp:1811
void compute_mesh_size(const polyfem::mesh::Mesh &mesh_in, const std::vector< polyfem::basis::ElementBases > &bases_in, const int n_samples, const bool use_curved_mesh_size)
computes the mesh size, it samples every edges n_samples times uses curved_mesh_size (false by defaul...
Definition OutData.cpp:1728
long long nn_zero
non zeros and sytem matrix size num dof is the total dof in the system
double mesh_size
max edge lenght
Abstract mesh class to capture 2d/3d conforming and non-conforming meshes.
Definition Mesh.hpp:41
int n_elements() const
utitlity to return the number of elements, cells or faces in 3d and 2d
Definition Mesh.hpp:163
virtual int get_body_id(const int primitive) const
Get the volume selection of an element (cell in 3d, face in 2d)
Definition Mesh.hpp:514
virtual void bounding_box(RowVectorNd &min, RowVectorNd &max) const =0
computes the bbox of the mesh
virtual bool is_volume() const =0
checks if mesh is volume
void update_nodes(const Eigen::VectorXi &in_node_to_node)
Update the node ids to reorder them.
Definition Mesh.cpp:371
int dimension() const
utily for dimension
Definition Mesh.hpp:153
const Eigen::MatrixXd & v() const
Definition Obstacle.hpp:42
static const ProblemFactory & factory()
std::shared_ptr< assembler::Problem > get_problem(const std::string &problem) const
static void p_refine(const mesh::Mesh &mesh, const double B, const bool h1_formula, const int base_p, const int discr_order_max, io::OutStatsData &stats, Eigen::VectorXi &disc_orders)
compute a priori prefinement
Definition APriori.cpp:242
Form representing the contact potential and forces.
Implicit time integrator of a second order ODE (equivently a system of coupled first order ODEs).
static bool boundary_quadrature(const mesh::LocalBoundary &local_boundary, const QuadratureOrders &order, const mesh::Mesh &mesh, const bool skip_computation, Eigen::MatrixXd &uv, Eigen::MatrixXd &points, Eigen::MatrixXd &normals, Eigen::VectorXd &weights, Eigen::VectorXi &global_primitive_ids)
void build_basis(mesh::Mesh &mesh, const bool iso_parametric, const json &args) override
assembler::AssemblyValsCache pure_mass_ass_vals_cache_
std::vector< int > elastic_primitive_to_node() const
void assemble_mass_mat(const mesh::Mesh &mesh, const json &args) override
std::shared_ptr< assembler::Assembler > primary_assembler_
void init(const std::string &formulation, const Units &units, const json &args, const std::string &out_path) override
Initialize the variational formulation with the given parameters.
std::vector< int > elastic_node_to_primitive() const
QuadratureOrders elastic_boundary_samples() const
assembler::AssemblyValsCache ass_vals_cache_
std::vector< io::OutputField > elastic_output_fields(const io::OutputSample &sample, const Eigen::MatrixXd &solution, const io::OutputFieldOptions &options, const mesh::Obstacle *obstacle, const time_integrator::ImplicitTimeIntegrator *time_integrator, const std::vector< std::pair< std::string, std::shared_ptr< solver::Form > > > &named_forms, const solver::Form *elastic_form, const solver::ContactForm *contact_form=nullptr) const
void initial_velocity(Eigen::MatrixXd &velocity) const
std::shared_ptr< assembler::HRZMass > pure_mass_assembler_
void initial_elastic_solution(Eigen::MatrixXd &solution) const
std::shared_ptr< assembler::Mass > mass_assembler_
void initial_acceleration(Eigen::MatrixXd &acceleration) const
std::shared_ptr< assembler::RhsAssembler > rhs_assembler_
assembler::AssemblyValsCache mass_ass_vals_cache_
void load_mesh(const mesh::Mesh &mesh, const json &args) override
void assemble_rhs(const mesh::Mesh &mesh) override
const std::vector< basis::ElementBases > & geometry_basis_list() const
Definition FESpace.hpp:115
std::shared_ptr< GeometryMapping > geometry
Geometric mapping used to integrate this FE space.
Definition FESpace.hpp:89
Eigen::VectorXi disc_orders
Primary polynomial degree for each mesh element.
Definition FESpace.hpp:71
int n_bases
Number of globally indexed scalar basis functions in the space.
Definition FESpace.hpp:65
Eigen::VectorXi space_in_node_to_node
Definition FESpace.hpp:91
const std::vector< basis::ElementBases > & basis_list() const
Definition FESpace.hpp:109
bool is_iso_parametric() const
Definition FESpace.hpp:104
std::shared_ptr< mesh::MeshNodes > mesh_nodes
Optional primitive-to-node mapping for this FE space.
Definition FESpace.hpp:86
std::string resolve_input_path(const std::string &path, const bool only_if_exists=false) const
Definition VarForm.cpp:1057
static void rebuild_node_positions(const std::vector< basis::ElementBases > &bases, const std::vector< int > &node_ids, std::vector< RowVectorNd > &positions)
Definition VarForm.cpp:1071
std::shared_ptr< assembler::Problem > problem
current problem, it contains rhs and bc
Definition VarForm.hpp:191
virtual std::string name() const =0
Get the name of the variational formulation.
std::unique_ptr< mesh::Mesh > mesh_
Definition VarForm.hpp:203
io::OutStatsData stats
Definition VarForm.hpp:195
static bool read_initial_x_from_file(const std::string &state_path, const std::string &x_name, const bool reorder, const Eigen::VectorXi &in_node_to_node, const int dim, Eigen::MatrixXd &x)
Definition VarForm.cpp:39
virtual void init(const std::string &formulation, const Units &units, const json &args, const std::string &out_path)
Initialize the variational formulation with the given parameters.
Definition VarForm.cpp:280
void build_fe_space(mesh::Mesh &mesh, const bool iso_parametric, const Eigen::VectorXi &disc_orders, const std::string &basis_type, const std::string &poly_basis_type, const assembler::Assembler &space_assembler, const int value_dim, const int quadrature_order, const int mass_quadrature_order, const bool use_corner_quadrature, const int n_harmonic_samples, const int integral_constraints, FESpace &space, VarFormBoundaryState &boundary, std::shared_ptr< GeometryMapping > geometry=nullptr)
Definition VarForm.cpp:323
io::OutRuntimeData timings
runtime statistics
Definition VarForm.hpp:198
QuadratureOrders n_boundary_samples(const int discr_order, const int gdiscr_order) const
Definition VarForm.cpp:259
void set_materials(assembler::Assembler &assembler, const int size) const
Definition VarForm.cpp:817
virtual void reset()=0
Definition VarForm.cpp:268
void assign_discr_orders(const json &discr_order, const mesh::Mesh &mesh, Eigen::VectorXi &disc_orders)
Definition VarForm.cpp:745
str func
Definition p_bases.py:417
void q_nodes_2d(const int q, Eigen::MatrixXd &val)
void prism_nodes_3d(const int p, const int q, Eigen::MatrixXd &val)
void p_nodes_2d(const int p, Eigen::MatrixXd &val)
void p_nodes_3d(const int p, Eigen::MatrixXd &val)
void q_nodes_3d(const int q, Eigen::MatrixXd &val)
bool write_matrix(const std::string &path, const Mat &mat)
Writes a matrix to a file. Determines the file format based on the path's extension.
Definition MatrixIO.cpp:42
Eigen::SparseMatrix< double > lump_matrix(const Eigen::SparseMatrix< double > &M)
Lump each row of a matrix into the diagonal.
Eigen::MatrixXd unflatten(const Eigen::VectorXd &x, int dim)
Unflatten rowwises, so every dim elements in x become a row.
std::vector< int > count_invalid(const int dim, const std::vector< basis::ElementBases > &bases, const std::vector< basis::ElementBases > &gbases, const Eigen::VectorXd &u)
Definition Jacobian.cpp:212
Eigen::VectorXd flatten(const Eigen::MatrixXd &X)
Flatten rowwises.
spdlog::logger & logger()
Retrieves the current logger.
Definition Logger.cpp:44
std::array< int, 2 > QuadratureOrders
Definition Types.hpp:19
nlohmann::json json
Definition Common.hpp:9
Eigen::Matrix< double, 1, Eigen::Dynamic, Eigen::RowMajor, 1, 3 > RowVectorNd
Definition Types.hpp:13
bool export_field(const std::string &field) const
Definition OutData.cpp:51
std::vector< std::string > fields
Eigen::VectorXi node_ids
Eigen::MatrixXd normals
Eigen::VectorXi element_ids
Eigen::MatrixXd local_points
const mesh::Mesh * mesh
std::vector< RowVectorNd > neumann_nodes_position
Definition FESpace.hpp:163
std::vector< mesh::LocalBoundary > local_boundary
Definition FESpace.hpp:155
std::vector< mesh::LocalBoundary > local_neumann_boundary
Definition FESpace.hpp:156
std::vector< mesh::LocalBoundary > total_local_boundary
Definition FESpace.hpp:154
std::vector< RowVectorNd > dirichlet_nodes_position
Definition FESpace.hpp:161
std::vector< mesh::LocalBoundary > local_pressure_boundary
Definition FESpace.hpp:157
std::unordered_map< int, std::vector< mesh::LocalBoundary > > local_pressure_cavity
Definition FESpace.hpp:158