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 build_elastic_basis(mesh, iso_parametric, args, -1);
147 }
148
149 void ElasticVarForm::build_elastic_basis(mesh::Mesh &mesh, const bool iso_parametric, const json &args, const int fe_space_id)
150 {
151 assert(problem);
152 assert(primary_assembler_);
153 assert(mass_assembler_);
154 assert(pure_mass_assembler_);
155
156 Eigen::VectorXi space_disc_orders, space_disc_ordersq;
157 assign_discr_orders(args["space"], fe_space_id, mesh, space_disc_orders, space_disc_ordersq);
158
159 if (args["space"]["use_p_ref"])
160 {
162 mesh,
163 args["space"]["advanced"]["B"],
164 args["space"]["advanced"]["h1_formula"],
165 args["space"]["discr_order"],
166 args["space"]["advanced"]["discr_order_max"],
167 stats,
168 space_disc_orders);
169
170 logger().info("min p: {} max p: {}", space_disc_orders.minCoeff(), space_disc_orders.maxCoeff());
171 }
172
174 mesh,
175 iso_parametric,
176 space_disc_orders,
177 space_disc_ordersq,
178 args["space"]["basis_type"],
179 args["space"]["poly_basis_type"],
181 mesh.dimension(),
182 args["space"]["advanced"]["quadrature_order"],
183 args["space"]["advanced"]["mass_quadrature_order"],
184 args["space"]["advanced"]["use_corner_quadrature"],
185 args["space"]["advanced"]["n_harmonic_samples"],
186 args["space"]["advanced"]["integral_constraints"],
187 space_,
188 boundary_);
189
190 problem->update_nodes(space_.space_in_node_to_node);
192
194 for (const auto &lb : boundary_.total_local_boundary)
195 boundary_.local_boundary.emplace_back(lb);
196
197 std::vector<basis::ElementBases> empty_pressure_bases;
198 std::vector<int> empty_pressure_boundary_nodes;
199 problem->setup_bc(
200 mesh, space_.n_bases,
201 space_.basis_list(), space_.geometry_basis_list(), empty_pressure_bases,
207 empty_pressure_boundary_nodes,
209
212
213 const auto &current_bases = space_.geometry_basis_list();
214 if (args["space"]["advanced"]["count_flipped_els"])
215 stats.count_flipped_elements(mesh, current_bases);
216
217 const int n_samples = 10;
218 stats.compute_mesh_size(mesh, current_bases, n_samples, args["output"]["advanced"]["curved_mesh_size"]);
219
220 logger().info("flipped elements {}", stats.n_flipped);
221 logger().info("h: {}", stats.mesh_size);
222
223 if (space_.n_bases <= args["solver"]["advanced"]["cache_size"])
224 {
225 igl::Timer timer;
226 timer.start();
227 logger().info("Building cache...");
228 ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases);
229 mass_ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases, true);
230 pure_mass_ass_vals_cache_.init(mesh.is_volume(), space_.basis_list(), current_bases, true);
231 logger().info(" took {}s", timer.getElapsedTime());
232 }
233 else
234 {
238 }
239 }
240
242 {
243 json rhs_solver_params = args["solver"]["linear"];
244 if (!rhs_solver_params.contains("Pardiso"))
245 rhs_solver_params["Pardiso"] = {};
246 rhs_solver_params["Pardiso"]["mtype"] = -2;
247
248 rhs_assembler_ = std::make_shared<assembler::RhsAssembler>(
249 *primary_assembler_, *mesh_, nullptr,
253 args["space"]["advanced"]["bc_method"],
254 rhs_solver_params,
255 /*fe_space_id=*/-1);
256 }
257
259 {
260 igl::Timer timer;
261 json p_params = {};
262 p_params["formulation"] = primary_assembler_->name();
263 p_params["root_path"] = root_path;
264 {
265 RowVectorNd min, max, delta;
266 mesh.bounding_box(min, max);
267 delta = (max - min) / 2. + min;
268 if (mesh.is_volume())
269 p_params["bbox_center"] = {delta(0), delta(1), delta(2)};
270 else
271 p_params["bbox_center"] = {delta(0), delta(1)};
272 }
273 problem->set_parameters(p_params, root_path);
274
275 rhs_.resize(0, 0);
276
277 timer.start();
278 logger().info("Assigning rhs...");
279
281 assert(rhs_assembler_ != nullptr);
282 rhs_assembler_->assemble(mass_assembler_->density(), rhs_);
283 rhs_ *= -1;
284
285 timings.assigning_rhs_time = timer.getElapsedTime();
286 logger().info(" took {}s", timings.assigning_rhs_time);
287 }
288
289 void ElasticVarForm::assemble_mass_mat(const mesh::Mesh &mesh, const json &args)
290 {
291 if (!problem->is_time_dependent())
292 {
293 avg_mass_ = 1;
295 if (!primary_assembler_->is_linear())
297 return;
298 }
299
300 mass_.resize(0, 0);
301
302 igl::Timer timer;
303 timer.start();
304 logger().info("Assembling mass mat...");
305
307 if (!primary_assembler_->is_linear())
309
310 assert(mass_.size() > 0);
311
312 avg_mass_ = 0;
313 for (int k = 0; k < mass_.outerSize(); ++k)
314 for (StiffnessMatrix::InnerIterator it(mass_, k); it; ++it)
315 {
316 assert(it.col() == k);
317 avg_mass_ += it.value();
318 }
319
320 avg_mass_ /= mass_.rows();
321 logger().info("average mass {}", avg_mass_);
322
323 if (args["solver"]["advanced"]["lump_mass_matrix"])
325
326 timer.stop();
327 timings.assembling_mass_mat_time = timer.getElapsedTime();
328 logger().info(" took {}s", timings.assembling_mass_mat_time);
329
330 stats.nn_zero = mass_.nonZeros();
331 stats.num_dofs = mass_.rows();
332 stats.mat_size = (long long)mass_.rows() * (long long)mass_.cols();
333 logger().info("sparsity: {}/{}", stats.nn_zero, stats.mat_size);
334 }
335
337 Eigen::MatrixXd &velocity,
338 const InitialConditionOverride *override,
339 const std::string &state_prefix) const
340 {
341 assert(rhs_assembler_ != nullptr);
342 if (override && override->velocity.size() != 0)
343 {
344 velocity = override->velocity;
345 assert(
346 velocity.rows() == space_.ndof() && velocity.cols() >= 1
347 && "Initial velocity override must match the simulation DOFs");
348 return;
349 }
350
351 const bool was_velocity_loaded = read_initial_x_from_file(
352 resolve_input_path(args["input"]["data"]["state"]), state_prefix + "v",
353 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
354 mesh_->dimension(), velocity);
355
356 if (!was_velocity_loaded)
357 rhs_assembler_->initial_velocity(velocity);
358 }
359
361 Eigen::MatrixXd &acceleration,
362 const InitialConditionOverride *override,
363 const std::string &state_prefix) const
364 {
365 assert(rhs_assembler_ != nullptr);
366 if (override && override->acceleration.size() != 0)
367 {
368 acceleration = override->acceleration;
369 assert(
370 acceleration.rows() == space_.ndof() && acceleration.cols() >= 1
371 && "Initial acceleration override must match the simulation DOFs");
372 return;
373 }
374
375 const bool was_acceleration_loaded = read_initial_x_from_file(
376 resolve_input_path(args["input"]["data"]["state"]), state_prefix + "a",
377 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
378 mesh_->dimension(), acceleration);
379
380 if (!was_acceleration_loaded)
381 rhs_assembler_->initial_acceleration(acceleration);
382 }
383
385 Eigen::MatrixXd &solution,
386 const InitialConditionOverride *override,
387 const std::string &state_prefix) const
388 {
389 assert(rhs_assembler_ != nullptr);
390 if (override && override->solution.size() != 0)
391 {
392 solution = override->solution;
393 assert(
394 solution.rows() == space_.ndof() && solution.cols() >= 1
395 && "Initial solution override must match the simulation DOFs");
396 return;
397 }
398
399 const bool was_solution_loaded = read_initial_x_from_file(
400 resolve_input_path(args["input"]["data"]["state"]), state_prefix + "u",
401 args["input"]["data"]["reorder"], space_.space_in_node_to_node,
402 mesh_->dimension(), solution);
403
404 if (!was_solution_loaded)
405 {
406 if (problem->is_time_dependent())
407 rhs_assembler_->initial_solution(solution);
408 else
409 {
410 solution.resize(rhs_.size(), 1);
411 solution.setZero();
412 }
413 }
414 }
415
417 {
418 const int gdiscr_order = mesh_->orders().size() <= 0 ? 1 : mesh_->orders().maxCoeff();
419 return n_boundary_samples(space_.disc_orders.maxCoeff(), space_.disc_ordersq.maxCoeff(), gdiscr_order);
420 }
421
423 {
424 if (!mesh_ || !space_.geometry)
425 return {};
426
427 const auto &nodes = space_.is_iso_parametric() ? space_.mesh_nodes : space_.geometry->mesh_nodes;
428 if (!nodes)
429 return {};
430
431 auto indices = nodes->primitive_to_node();
432 indices.resize(mesh_->n_vertices());
433 return indices;
434 }
435
437 {
438 const auto p2n = elastic_primitive_to_node();
439 const int n_geometry_bases = space_.geometry ? space_.geometry->n_bases : 0;
440 std::vector<int> indices(n_geometry_bases, -1);
441 for (int i = 0; i < int(p2n.size()); ++i)
442 {
443 if (p2n[i] >= 0 && p2n[i] < int(indices.size()))
444 indices[p2n[i]] = i;
445 }
446 return indices;
447 }
448
449 std::vector<io::OutputField> ElasticVarForm::elastic_output_fields(
450 const io::OutputSample &sample,
451 const Eigen::MatrixXd &solution,
452 const io::OutputFieldOptions &options,
453 const mesh::Obstacle *obstacle,
454 const time_integrator::ImplicitTimeIntegrator *time_integrator,
455 const std::vector<std::pair<std::string, std::shared_ptr<solver::Form>>> &named_forms,
456 const solver::Form *elastic_form,
457 const solver::ContactForm *contact_form) const
458 {
459 std::vector<io::OutputField> fields;
460 if (!mesh_ || !problem || solution.size() <= 0)
461 return fields;
462
463 const bool has_element_samples = sample.local_points.rows() > 0 && sample.local_points.rows() == sample.element_ids.size();
464 const int output_rows = sample.points.rows() > 0 ? sample.points.rows() : std::max<int>(sample.local_points.rows(), sample.node_ids.size());
465
466 const int actual_dim = problem->is_scalar() ? 1 : mesh_->dimension();
467 const auto &paraview_options = args["output"]["paraview"]["options"];
468 const bool material_params = paraview_options["material"];
469 const bool body_ids = paraview_options["body_ids"];
470 const bool velocity = paraview_options["velocity"];
471 const bool acceleration = paraview_options["acceleration"];
472 const bool forces = paraview_options["forces"] && !problem->is_scalar();
473 const bool tensor_values = paraview_options["tensor_values"] && !problem->is_scalar();
474 const bool scalar_values = paraview_options["scalar_values"];
475 const bool use_spline = args["space"]["basis_type"] == "Spline";
476 const bool explicit_fields = !options.fields.empty();
477
478 const auto resize_to_output_rows = [&](Eigen::MatrixXd &values) {
479 if (output_rows <= values.rows())
480 return;
481
482 const int previous_rows = values.rows();
483 values.conservativeResize(output_rows, values.cols());
484 values.bottomRows(output_rows - previous_rows).setZero();
485 };
486
487 const auto append_obstacle_values = [&](Eigen::MatrixXd &sampled_values, const Eigen::MatrixXd &dof_values) -> bool {
488 if (!obstacle || obstacle->n_vertices() <= 0)
489 {
490 resize_to_output_rows(sampled_values);
491 return sample.points.rows() == 0 || sample.points.rows() == sampled_values.rows();
492 }
493
494 const bool has_obstacle_rows =
495 sample.points.rows() == sampled_values.rows() + obstacle->n_vertices()
496 && sample.points.cols() == obstacle->v().cols()
497 && sample.points.bottomRows(obstacle->n_vertices()).isApprox(obstacle->v());
498
499 if (!has_obstacle_rows)
500 return sample.points.rows() == 0 || sample.points.rows() == sampled_values.rows();
501
502 sampled_values.conservativeResize(sampled_values.rows() + obstacle->n_vertices(), sampled_values.cols());
503 if (dof_values.rows() >= obstacle->ndof())
504 sampled_values.bottomRows(obstacle->n_vertices()) =
505 utils::unflatten(dof_values.bottomRows(obstacle->ndof()), sampled_values.cols());
506 else
507 sampled_values.bottomRows(obstacle->n_vertices()).setZero();
508 return true;
509 };
510
511 const auto sample_dof_field = [&](const Eigen::MatrixXd &dof_values, const int field_dim, Eigen::MatrixXd &values) -> bool {
512 if (dof_values.size() <= 0 || field_dim <= 0)
513 return false;
514
515 if (has_element_samples)
516 {
517 values.resize(sample.local_points.rows(), field_dim);
518 for (int i = 0; i < sample.local_points.rows(); ++i)
519 {
520 const int element_id = sample.element_ids(i);
521 if (element_id < 0)
522 {
523 values.row(i).setZero();
524 continue;
525 }
526
527 Eigen::MatrixXd local_sol, local_grad;
530 element_id, sample.local_points.row(i), dof_values, local_sol, local_grad);
531
532 for (int d = 0; d < field_dim; ++d)
533 values(i, d) = local_sol(d);
534 }
535
536 return append_obstacle_values(values, dof_values);
537 }
538
539 if (sample.node_ids.size() > 0)
540 {
541 values.resize(sample.node_ids.size(), field_dim);
542 for (int i = 0; i < sample.node_ids.size(); ++i)
543 {
544 const int node_id = sample.node_ids(i);
545 for (int d = 0; d < field_dim; ++d)
546 {
547 const int dof = node_id * field_dim + d;
548 if (dof < 0 || dof >= dof_values.rows())
549 return false;
550 values(i, d) = dof_values(dof);
551 }
552 }
553
554 return sample.points.rows() == 0 || sample.points.rows() == values.rows();
555 }
556
557 return false;
558 };
559
560 const auto append_sampled_dof_field = [&](const std::string &name, const Eigen::MatrixXd &dof_values, const int field_dim) {
561 Eigen::MatrixXd values;
562 if (sample_dof_field(dof_values, field_dim, values))
563 fields.push_back({name, values, io::OutputField::Association::Point});
564 };
565
566 const auto append_scalar_values = [&]() {
567 if (!scalar_values || problem->is_scalar() || !has_element_samples)
568 return;
569
570 const bool wants_scalar = options.fields.empty()
571 || options.export_field("von_mises")
572 || options.export_field("von_mises_avg");
573 if (!wants_scalar)
574 return;
575
576 std::vector<assembler::Assembler::NamedMatrix> point_values;
577 for (int i = 0; i < sample.local_points.rows(); ++i)
578 {
579 const int element_id = sample.element_ids(i);
580 if (element_id < 0)
581 continue;
582
583 std::vector<assembler::Assembler::NamedMatrix> local_values;
584 primary_assembler_->compute_scalar_value(
585 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
586 local_values);
587
588 if (point_values.empty())
589 {
590 point_values.resize(local_values.size());
591 for (int k = 0; k < local_values.size(); ++k)
592 {
593 point_values[k].first = local_values[k].first;
594 point_values[k].second.setZero(output_rows, local_values[k].second.cols());
595 }
596 }
597
598 for (int k = 0; k < local_values.size(); ++k)
599 point_values[k].second.row(i) = local_values[k].second;
600 }
601
602 for (const auto &[name, values] : point_values)
603 {
604 if (options.export_field(name))
605 fields.push_back({name, values, io::OutputField::Association::Point});
606 }
607 };
608
609 const auto append_tensor_values = [&]() {
610 if (!tensor_values || problem->is_scalar() || !has_element_samples)
611 return;
612
613 const bool wants_tensor = options.fields.empty()
614 || options.export_field("cauchy_stess")
615 || options.export_field("pk1_stess")
616 || options.export_field("pk2_stess")
617 || options.export_field("F");
618 if (!wants_tensor)
619 return;
620
621 std::vector<assembler::Assembler::NamedMatrix> point_values;
622 for (int i = 0; i < sample.local_points.rows(); ++i)
623 {
624 const int element_id = sample.element_ids(i);
625 if (element_id < 0)
626 continue;
627
628 std::vector<assembler::Assembler::NamedMatrix> local_values;
629 primary_assembler_->compute_tensor_value(
630 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
631 local_values);
632
633 if (point_values.empty())
634 {
635 point_values.resize(local_values.size());
636 for (int k = 0; k < local_values.size(); ++k)
637 {
638 point_values[k].first = local_values[k].first;
639 point_values[k].second.setZero(output_rows, local_values[k].second.cols());
640 }
641 }
642
643 for (int k = 0; k < local_values.size(); ++k)
644 point_values[k].second.row(i) = local_values[k].second;
645 }
646
647 for (const auto &[name, values] : point_values)
648 {
649 if (!options.export_field(name))
650 continue;
651
652 const int stride = mesh_->dimension();
653 assert(values.cols() % stride == 0);
654 for (int i = 0; i < values.cols(); i += stride)
655 {
656 const int ii = (i / stride) + 1;
657 fields.push_back({fmt::format("{:s}_{:d}", name, ii), values.middleCols(i, stride), io::OutputField::Association::Point});
658 }
659 }
660 };
661
662 const auto append_averaged_values = [&]() {
663 if (use_spline || problem->is_scalar() || !has_element_samples || (!scalar_values && !tensor_values))
664 return;
665
666 const bool wants_avg = options.fields.empty()
667 || options.export_field("von_mises_avg")
668 || options.export_field("cauchy_stess_avg")
669 || options.export_field("pk1_stess_avg")
670 || options.export_field("pk2_stess_avg")
671 || options.export_field("F_avg");
672 if (!wants_avg)
673 return;
674
675 Eigen::MatrixXd areas(space_.n_bases, 1);
676 areas.setZero();
677 std::vector<assembler::Assembler::NamedMatrix> tmp_s, tmp_t;
678 std::vector<Eigen::MatrixXd> avg_scalar, avg_tensor;
679
680 for (int e = 0; e < int(space_.basis_list().size()); ++e)
681 {
682 Eigen::MatrixXd local_pts;
683 if (mesh_->is_simplex(e))
684 {
685 if (mesh_->dimension() == 3)
686 autogen::p_nodes_3d(space_.disc_orders(e), local_pts);
687 else
688 autogen::p_nodes_2d(space_.disc_orders(e), local_pts);
689 }
690 else if (mesh_->is_cube(e))
691 {
692 if (mesh_->dimension() == 3)
693 autogen::q_nodes_3d(space_.disc_orders(e), local_pts);
694 else
695 autogen::q_nodes_2d(space_.disc_orders(e), local_pts);
696 }
697 else if (mesh_->is_prism(e))
698 {
699 autogen::prism_nodes_3d(space_.disc_orders(e), space_.disc_ordersq(e), local_pts);
700 }
701 else
702 {
703 continue;
704 }
705
706 const basis::ElementBases &bs = space_.basis_list()[e];
707 const basis::ElementBases &gbs = space_.geometry_basis_list()[e];
708
709 assembler::ElementAssemblyValues vals;
710 vals.compute(e, mesh_->is_volume(), bs, gbs);
711 const double area = (vals.det.array() * vals.quadrature.weights.array()).sum();
712
713 if (scalar_values)
714 primary_assembler_->compute_scalar_value(assembler::OutputData(sample.time, e, bs, gbs, local_pts, solution), tmp_s);
715 if (tensor_values)
716 primary_assembler_->compute_tensor_value(assembler::OutputData(sample.time, e, bs, gbs, local_pts, solution), tmp_t);
717
718 if (avg_scalar.empty() && !tmp_s.empty())
719 {
720 avg_scalar.resize(tmp_s.size());
721 for (auto &m : avg_scalar)
722 m.setZero(space_.n_bases, 1);
723 }
724 if (avg_tensor.empty() && !tmp_t.empty())
725 {
726 avg_tensor.resize(tmp_t.size());
727 for (auto &m : avg_tensor)
728 m.setZero(space_.n_bases, actual_dim * actual_dim);
729 }
730
731 for (size_t j = 0; j < bs.bases.size(); ++j)
732 {
733 const basis::Basis &b = bs.bases[j];
734 if (b.global().size() > 1)
735 continue;
736
737 const int index = b.global().front().index;
738 areas(index) += area;
739 for (int k = 0; k < tmp_s.size(); ++k)
740 avg_scalar[k](index) += tmp_s[k].second(j) * area;
741 for (int k = 0; k < tmp_t.size(); ++k)
742 avg_tensor[k].row(index) += tmp_t[k].second.row(j) * area;
743 }
744 }
745
746 for (auto &m : avg_scalar)
747 for (int i = 0; i < m.rows(); ++i)
748 if (areas(i) > 0)
749 m(i) /= areas(i);
750 for (auto &m : avg_tensor)
751 for (int i = 0; i < m.rows(); ++i)
752 if (areas(i) > 0)
753 m.row(i) /= areas(i);
754
755 for (int k = 0; k < tmp_s.size(); ++k)
756 {
757 const std::string name = fmt::format("{:s}_avg", tmp_s[k].first);
758 if (!options.export_field(name))
759 continue;
760
761 Eigen::MatrixXd sampled;
762 if (sample_dof_field(avg_scalar[k], 1, sampled))
763 fields.push_back({name, sampled, io::OutputField::Association::Point});
764 }
765
766 for (int k = 0; k < tmp_t.size(); ++k)
767 {
768 const std::string base_name = fmt::format("{:s}_avg", tmp_t[k].first);
769 if (!options.export_field(base_name))
770 continue;
771
772 Eigen::MatrixXd sampled;
773 if (!sample_dof_field(utils::flatten(avg_tensor[k]), actual_dim * actual_dim, sampled))
774 continue;
775
776 const int stride = mesh_->dimension();
777 for (int i = 0; i < sampled.cols(); i += stride)
778 {
779 const int ii = (i / stride) + 1;
780 fields.push_back({fmt::format("{:s}_{:d}", base_name, ii), sampled.middleCols(i, stride), io::OutputField::Association::Point});
781 }
782 }
783 };
784
785 const auto append_material_fields = [&]() {
786 if (!material_params || !has_element_samples)
787 return;
788
789 const auto &params = primary_assembler_->parameters();
790 std::map<std::string, Eigen::MatrixXd> param_values;
791 for (const auto &[p, _] : params)
792 param_values[p].setZero(output_rows, 1);
793 Eigen::MatrixXd rhos = Eigen::MatrixXd::Zero(output_rows, 1);
794
795 const auto &density = mass_assembler_->density();
796 for (int i = 0; i < sample.local_points.rows(); ++i)
797 {
798 const int element_id = sample.element_ids(i);
799 if (element_id < 0)
800 continue;
801
802 for (const auto &[p, func] : params)
803 param_values.at(p)(i) = func(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
804 rhos(i) = density(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
805 }
806
807 for (const auto &[name, values] : param_values)
808 if (options.export_field(name))
809 fields.push_back({name, values, io::OutputField::Association::Point});
810 if (options.export_field("rho"))
811 fields.push_back({"rho", rhos, io::OutputField::Association::Point});
812 };
813
814 const auto append_body_ids = [&]() {
815 if (!body_ids || !options.export_field("body_ids") || !has_element_samples)
816 return;
817
818 Eigen::MatrixXd ids = Eigen::MatrixXd::Zero(output_rows, 1);
819 for (int i = 0; i < sample.element_ids.size(); ++i)
820 {
821 const int element_id = sample.element_ids(i);
822 if (element_id >= 0)
823 ids(i) = mesh_->get_body_id(element_id);
824 }
825 fields.push_back({"body_ids", ids, io::OutputField::Association::Point});
826 };
827
828 const auto compute_traction_forces = [&]() {
829 Eigen::MatrixXd traction_forces;
830 traction_forces.setZero(space_.n_bases * actual_dim, 1);
831
832 Eigen::MatrixXd uv, points, normals;
833 Eigen::VectorXd weights;
834 Eigen::VectorXi global_primitive_ids;
835 assembler::ElementAssemblyValues vals;
836
837 for (const auto &lb : boundary_.total_local_boundary)
838 {
839 const int e = lb.element_id();
840 const bool has_samples = utils::BoundarySampler::boundary_quadrature(
841 lb, elastic_boundary_samples(), *mesh_, false, uv, points, normals, weights, global_primitive_ids);
842 if (!has_samples)
843 continue;
844
845 const basis::ElementBases &bs = space_.basis_list()[e];
846 const basis::ElementBases &gbs = space_.geometry_basis_list()[e];
847 vals.compute(e, mesh_->is_volume(), points, bs, gbs);
848
849 for (int n = 0; n < normals.rows(); ++n)
850 {
851 Eigen::MatrixXd deform_mat = Eigen::MatrixXd::Zero(actual_dim, actual_dim);
852 for (const auto &b : vals.basis_values)
853 {
854 for (const auto &g : b.global)
855 {
856 for (int d = 0; d < actual_dim; ++d)
857 deform_mat.row(d) += solution(g.index * actual_dim + d) * b.grad.row(n);
858 }
859 }
860
861 Eigen::MatrixXd trafo = vals.jac_it[n].inverse() + deform_mat;
862 normals.row(n) = normals.row(n) * trafo.inverse();
863 normals.row(n).normalize();
864 }
865
866 std::vector<assembler::Assembler::NamedMatrix> tensor_flat;
867 primary_assembler_->compute_tensor_value(assembler::OutputData(sample.time, e, bs, gbs, points, solution), tensor_flat);
868
869 for (long n = 0; n < vals.basis_values.size(); ++n)
870 {
871 const assembler::AssemblyValues &v = vals.basis_values[n];
872 const int g_index = v.global[0].index * actual_dim;
873 for (int q = 0; q < points.rows(); ++q)
874 {
875 assert(tensor_flat[0].first == "cauchy_stess");
876 Eigen::MatrixXd stress_tensor = utils::unflatten(tensor_flat[0].second.row(q), actual_dim);
877 traction_forces.block(g_index, 0, actual_dim, 1) += stress_tensor * normals.row(q).transpose() * v.val(q) * weights(q);
878 }
879 }
880 }
881
882 return traction_forces;
883 };
884
885 const auto append_traction_force = [&]() {
886 if (problem->is_scalar() || !explicit_fields || !options.export_field("traction_force"))
887 return;
888
889 if (has_element_samples && sample.normals.rows() == sample.local_points.rows() && sample.primitive_ids.size() == sample.local_points.rows())
890 {
891 const Eigen::MatrixXd displaced_normals = displaced_output_normals(sample, solution);
892 const Eigen::MatrixXd &normals = displaced_normals.rows() == sample.normals.rows() ? displaced_normals : sample.normals;
893 Eigen::MatrixXd values = Eigen::MatrixXd::Zero(output_rows, actual_dim);
894 for (int i = 0; i < sample.local_points.rows(); ++i)
895 {
896 const int element_id = sample.element_ids(i);
897 if (element_id < 0)
898 continue;
899
900 std::vector<assembler::Assembler::NamedMatrix> tensor_flat;
901 primary_assembler_->compute_tensor_value(
902 assembler::OutputData(sample.time, element_id, space_.basis_list()[element_id], space_.geometry_basis_list()[element_id], sample.local_points.row(i), solution),
903 tensor_flat);
904
905 assert(tensor_flat[0].first == "cauchy_stess");
906 Eigen::Map<Eigen::MatrixXd> tensor(tensor_flat[0].second.data(), actual_dim, actual_dim);
907 values.row(i) = normals.row(i) * tensor;
908
909 double area = 0;
910 const int primitive_id = sample.primitive_ids(i);
911 if (mesh_->is_volume())
912 {
913 if (mesh_->is_simplex(element_id))
914 area = mesh_->tri_area(primitive_id);
915 else if (mesh_->is_cube(element_id))
916 area = mesh_->quad_area(primitive_id);
917 else if (mesh_->is_prism(element_id))
918 area = mesh_->n_face_vertices(primitive_id) == 4 ? mesh_->quad_area(primitive_id) : mesh_->tri_area(primitive_id);
919 }
920 else
921 {
922 area = mesh_->edge_length(primitive_id);
923 }
924 values.row(i) *= area;
925 }
926 fields.push_back({"traction_force", values, io::OutputField::Association::Point});
927 return;
928 }
929
930 append_sampled_dof_field("traction_force", compute_traction_forces(), actual_dim);
931 };
932
933 append_scalar_values();
934 append_tensor_values();
935 append_averaged_values();
936 append_material_fields();
937 append_body_ids();
938
939 if ((paraview_options["jacobian_validity"] || (explicit_fields && options.export_field("validity")))
940 && has_element_samples
941 && sample.primitive_ids.size() == 0)
942 {
943 const auto invalid_elements = utils::count_invalid(
944 mesh_->dimension(), space_.basis_list(), space_.geometry_basis_list(), solution);
945 Eigen::MatrixXd validity = Eigen::MatrixXd::Zero(output_rows, 1);
946 for (int i = 0; i < sample.element_ids.size(); ++i)
947 {
948 validity(i) = std::find(
949 invalid_elements.begin(), invalid_elements.end(), sample.element_ids(i))
950 != invalid_elements.end();
951 }
952 fields.push_back({"validity", validity, io::OutputField::Association::Point});
953 }
954
955 if (problem->is_time_dependent())
956 {
957 if (velocity && options.export_field("velocity"))
958 append_sampled_dof_field(
959 "velocity",
960 time_integrator ? time_integrator->v_prev() : Eigen::VectorXd::Zero(solution.size()),
961 actual_dim);
962 if (acceleration && options.export_field("acceleration"))
963 append_sampled_dof_field(
964 "acceleration",
965 time_integrator ? time_integrator->a_prev() : Eigen::VectorXd::Zero(solution.size()),
966 actual_dim);
967 }
968
969 if (forces)
970 {
971 const double s = time_integrator ? time_integrator->acceleration_scaling() : 1;
972 for (const auto &[name, form] : named_forms)
973 {
974 const std::string field_name = name + "_forces";
975 if (!options.export_field(field_name))
976 continue;
977
978 Eigen::VectorXd force;
979 if (form && form->enabled())
980 {
981 form->first_derivative(solution, force);
982 force *= -1.0 / s;
983 }
984 else
985 {
986 force.setZero(solution.size());
987 }
988 append_sampled_dof_field(field_name, force, actual_dim);
989 }
990 }
991
992 append_traction_force();
993
994 if (explicit_fields && options.export_field("gradient_of_elastic_potential") && elastic_form)
995 {
996 Eigen::VectorXd potential_grad;
997 elastic_form->first_derivative(solution, potential_grad);
998 append_sampled_dof_field("gradient_of_elastic_potential", potential_grad, actual_dim);
999 }
1000
1001 if (explicit_fields && options.export_field("gradient_of_contact_potential") && contact_form && contact_form->weight() > 0)
1002 {
1003 Eigen::VectorXd potential_grad;
1004 contact_form->first_derivative(solution, potential_grad);
1005 potential_grad *= -contact_form->barrier_stiffness() / contact_form->weight();
1006 append_sampled_dof_field("gradient_of_contact_potential", potential_grad, actual_dim);
1007 }
1008
1009 append_primary_output_fields(fields, sample, solution, options, obstacle);
1010 return fields;
1011 }
1012
1013 void ElasticVarForm::append_primary_output_fields(
1014 std::vector<io::OutputField> &fields,
1015 const io::OutputSample &sample,
1016 const Eigen::MatrixXd &solution,
1017 const io::OutputFieldOptions &options,
1018 const mesh::Obstacle *obstacle) const
1019 {
1020 if (!mesh_ || solution.size() <= 0)
1021 return;
1022
1023 const int dim = mesh_->dimension();
1024 const bool has_element_samples =
1025 sample.local_points.rows() > 0
1026 && sample.local_points.rows() == sample.element_ids.size();
1027 const bool export_solution_gradient =
1028 !options.fields.empty() && options.export_field("solution_gradient");
1029
1030 Eigen::MatrixXd values, gradients;
1031 if (has_element_samples)
1032 {
1033 values.resize(sample.local_points.rows(), dim);
1034 if (export_solution_gradient)
1035 gradients.resize(sample.local_points.rows(), dim * mesh_->dimension());
1036 for (int i = 0; i < sample.local_points.rows(); ++i)
1037 {
1038 const int element_id = sample.element_ids(i);
1039 if (element_id < 0)
1040 {
1041 values.row(i).setZero();
1042 if (gradients.rows() > 0)
1043 gradients.row(i).setZero();
1044 continue;
1045 }
1046
1047 Eigen::MatrixXd local_value, local_gradient;
1049 *mesh_, dim, space_.basis_list(), space_.geometry_basis_list(),
1050 element_id, sample.local_points.row(i), solution,
1051 local_value, local_gradient);
1052 values.row(i) = local_value;
1053 if (gradients.rows() > 0)
1054 gradients.row(i) = local_gradient;
1055 }
1056
1057 if (obstacle && obstacle->n_vertices() > 0
1058 && sample.points.rows() == values.rows() + obstacle->n_vertices()
1059 && sample.points.cols() == obstacle->v().cols()
1060 && sample.points.bottomRows(obstacle->n_vertices()).isApprox(obstacle->v()))
1061 {
1062 values.conservativeResize(values.rows() + obstacle->n_vertices(), Eigen::NoChange);
1063 if (solution.rows() >= obstacle->ndof())
1064 values.bottomRows(obstacle->n_vertices()) =
1065 utils::unflatten(solution.bottomRows(obstacle->ndof()), dim);
1066 else
1067 values.bottomRows(obstacle->n_vertices()).setZero();
1068 if (gradients.rows() > 0)
1069 {
1070 gradients.conservativeResize(values.rows(), Eigen::NoChange);
1071 gradients.bottomRows(obstacle->n_vertices()).setZero();
1072 }
1073 }
1074 }
1075 else if (sample.node_ids.size() > 0)
1076 {
1077 values.resize(sample.node_ids.size(), dim);
1078 for (int i = 0; i < sample.node_ids.size(); ++i)
1079 {
1080 for (int d = 0; d < dim; ++d)
1081 {
1082 const int dof = sample.node_ids(i) * dim + d;
1083 if (dof < 0 || dof >= solution.rows())
1084 return;
1085 values(i, d) = solution(dof);
1086 }
1087 }
1088 }
1089 else
1090 {
1091 return;
1092 }
1093
1094 if (sample.points.rows() > 0 && values.rows() != sample.points.rows())
1095 return;
1096 if (options.export_field("displacement"))
1097 fields.push_back({"displacement", values, io::OutputField::Association::Point});
1098 if (options.export_field("solution"))
1099 fields.push_back({"solution", values, io::OutputField::Association::Point});
1100 if (export_solution_gradient && gradients.rows() == values.rows())
1101 fields.push_back({"solution_gradient", gradients, io::OutputField::Association::Point});
1102
1103 if (options.export_field("displaced_normals"))
1104 {
1105 Eigen::MatrixXd normals = displaced_output_normals(sample, solution);
1106 if (normals.rows() == values.rows())
1107 fields.push_back({"displaced_normals", normals, io::OutputField::Association::Point});
1108 }
1109 }
1110
1111 Eigen::MatrixXd ElasticVarForm::displaced_output_normals(
1112 const io::OutputSample &sample,
1113 const Eigen::MatrixXd &solution) const
1114 {
1115 if (!mesh_
1116 || sample.normals.rows() == 0
1117 || sample.normals.rows() != sample.local_points.rows()
1118 || sample.local_points.rows() != sample.element_ids.size())
1119 return {};
1120
1121 const int dim = mesh_->dimension();
1122 Eigen::MatrixXd displaced_normals = sample.normals;
1123 for (int i = 0; i < sample.local_points.rows(); ++i)
1124 {
1125 const int element_id = sample.element_ids(i);
1126 if (element_id < 0)
1127 continue;
1128
1129 Eigen::MatrixXd local_value, local_gradient;
1131 *mesh_, dim, space_.basis_list(), space_.geometry_basis_list(),
1132 element_id, sample.local_points.row(i), solution,
1133 local_value, local_gradient);
1134
1135 Eigen::MatrixXd deformation = Eigen::MatrixXd::Identity(dim, dim);
1136 for (int d = 0; d < dim; ++d)
1137 deformation.row(d) += local_gradient.block(0, d * dim, 1, dim);
1138 displaced_normals.row(i) = sample.normals.row(i) * deformation.inverse();
1139 displaced_normals.row(i).normalize();
1140 }
1141 return displaced_normals;
1142 }
1143
1144 io::OutputSpace ElasticVarForm::output_space() const
1145 {
1146 Eigen::VectorXi output_orders = space_.disc_orders;
1147 if (mesh_ && space_.disc_ordersq.size() == space_.disc_orders.size())
1148 {
1149 for (int e = 0; e < output_orders.size(); ++e)
1150 {
1151 if (mesh_->is_prism(e))
1152 output_orders(e) = std::max(space_.disc_orders(e), space_.disc_ordersq(e));
1153 }
1154 }
1155
1156 return {
1157 mesh_.get(),
1158 &space_.geometry_basis_list(),
1159 output_orders,
1160 &space_.polys,
1161 &space_.polys_3d,
1162 &boundary_.total_local_boundary,
1163 nullptr,
1164 nullptr,
1165 &boundary_.dirichlet_nodes,
1166 &boundary_.dirichlet_nodes_position};
1167 }
1168
1169 io::OutStatsData ElasticVarForm::compute_errors(const Eigen::MatrixXd &solution)
1170 {
1171 if (!args["output"]["advanced"]["compute_error"])
1172 return stats;
1173
1174 double tend = 0;
1175 if (!args["time"].is_null())
1176 tend = args["time"]["tend"];
1177
1178 stats.compute_errors(space_.n_bases, space_.basis_list(), space_.geometry_basis_list(), *mesh_, *problem, tend, solution);
1179 return stats;
1180 }
1181
1182 void ElasticVarForm::export_data(const Eigen::MatrixXd &solution) const
1183 {
1184 const io::OutputSpace space = output_space();
1185 if (!space.mesh)
1186 {
1187 logger().error("Load the mesh first!");
1188 return;
1189 }
1190 if (solution.size() <= 0)
1191 {
1192 logger().error("Solve the problem first!");
1193 return;
1194 }
1195
1196 ensure_output_sampler();
1197
1198 const std::string vis_mesh_path = resolve_output_path(args["output"]["paraview"]["file_name"]);
1199 const bool has_time = args.contains("time") && !args["time"].is_null();
1200 double tend = has_time ? args["time"]["tend"].get<double>() : 1.0;
1201 double dt = 1;
1202 if (has_time)
1203 dt = args["time"]["dt"];
1204
1205 const auto opts = export_options(space);
1206 output_geometry_.export_data(
1207 space,
1208 output_field_function(solution, opts),
1209 has_time,
1210 tend, dt,
1211 opts,
1212 vis_mesh_path);
1213
1214 const std::string solution_path = resolve_output_path(args["output"]["data"]["solution"]);
1215 if (!solution_path.empty())
1216 {
1217 const int dim = mesh_->dimension();
1218 const int primary_ndof = std::min<int>(solution.rows(), space_.n_bases * dim);
1219 const Eigen::MatrixXd primary_solution = solution.topRows(primary_ndof);
1220 if (opts.reorder_output && space_.space_in_node_to_node.size() > 0)
1221 {
1222 const Eigen::MatrixXd nodal_solution = utils::unflatten(primary_solution, dim);
1223 Eigen::MatrixXd reordered = Eigen::MatrixXd::Zero(nodal_solution.rows(), nodal_solution.cols());
1224 for (int input_node = 0; input_node < space_.space_in_node_to_node.size(); ++input_node)
1225 {
1226 const int node = space_.space_in_node_to_node(input_node);
1227 if (node >= 0 && node < nodal_solution.rows() && input_node < reordered.rows())
1228 reordered.row(input_node) = nodal_solution.row(node);
1229 }
1230 io::write_matrix(solution_path, reordered);
1231 }
1232 else
1233 {
1234 io::write_matrix(solution_path, primary_solution);
1235 }
1236 }
1237
1238 const std::string nodes_path = resolve_output_path(args["output"]["data"]["nodes"]);
1239 if (!nodes_path.empty())
1240 {
1241 Eigen::MatrixXd nodes = Eigen::MatrixXd::Zero(space_.n_bases, mesh_->dimension());
1242 for (const basis::ElementBases &element_bases : space_.basis_list())
1243 for (const basis::Basis &basis : element_bases.bases)
1244 for (const auto &global : basis.global())
1245 nodes.row(global.index) = global.node;
1246 io::write_matrix(nodes_path, nodes);
1247 }
1248
1249 const std::string stress_path = resolve_output_path(args["output"]["data"]["stress_mat"]);
1250 const std::string mises_path = resolve_output_path(args["output"]["data"]["mises"]);
1251 if ((!stress_path.empty() || !mises_path.empty()) && primary_assembler_)
1252 {
1253 Eigen::MatrixXd stress;
1254 Eigen::VectorXd mises;
1256 *mesh_, problem->is_scalar(), space_.basis_list(), space_.geometry_basis_list(),
1257 space_.disc_orders, space_.disc_ordersq, *primary_assembler_, solution, tend,
1258 stress, mises);
1259 if (!stress_path.empty())
1260 io::write_matrix(stress_path, stress);
1261 if (!mises_path.empty())
1262 io::write_matrix(mises_path, mises);
1263 }
1264 }
1265
1266 void ElasticVarForm::save_json(const Eigen::MatrixXd &solution, std::ostream &out) const
1267 {
1268 if (!mesh_)
1269 {
1270 logger().error("Load the mesh first!");
1271 return;
1272 }
1273 if (solution.size() <= 0)
1274 {
1275 logger().error("Solve the problem first!");
1276 return;
1277 }
1278
1279 logger().info("Saving json...");
1280 const int primary_size = space_.n_bases * mesh_->dimension();
1281 const Eigen::MatrixXd stats_solution =
1282 solution.rows() >= primary_size
1283 ? solution.topRows(primary_size).eval()
1284 : solution;
1285
1286 nlohmann::json j;
1287 stats.save_json(
1288 args, space_.n_bases, 0,
1289 stats_solution, *mesh_, space_.disc_orders, space_.disc_ordersq, *problem,
1290 timings, primary_assembler_ ? primary_assembler_->name() : name(), space_.is_iso_parametric(),
1291 args["output"]["advanced"]["sol_at_node"], j);
1292 out << j.dump(4) << std::endl;
1293 }
1294
1295 void ElasticVarForm::save_elastic_step_state(
1296 const double t0,
1297 const double dt,
1298 const int t,
1299 const time_integrator::ImplicitTimeIntegrator *time_integrator) const
1300 {
1301 if (!mesh_)
1302 return;
1303
1304 const int global_t = output_file_index(t);
1305 const std::string rest_mesh_path = args["output"]["data"]["rest_mesh"].get<std::string>();
1306 bool rest_mesh_written = false;
1307 if (!rest_mesh_path.empty())
1308 {
1309 Eigen::MatrixXd V;
1310 Eigen::MatrixXi F;
1311 build_mesh_matrices(V, F);
1313 resolve_output_path(fmt::format(rest_mesh_path, global_t)),
1314 V, F, mesh_->get_body_ids(), mesh_->is_volume(), /*binary=*/true);
1315 rest_mesh_written = true;
1316 }
1317
1318 save_step_state(t0, dt, t, time_integrator, rest_mesh_written);
1319 }
1320
1321 void ElasticVarForm::build_mesh_matrices(Eigen::MatrixXd &V, Eigen::MatrixXi &F) const
1322 {
1323 assert(mesh_);
1324 assert(space_.basis_list().size() == mesh_->n_elements());
1325 const size_t n_vertices = space_.n_bases - n_obstacle_vertices();
1326 const int dim = mesh_->dimension();
1327
1328 V.resize(n_vertices, dim);
1329 F.resize(space_.basis_list().size(), dim + 1);
1330
1331 for (int i = 0; i < space_.basis_list().size(); i++)
1332 {
1333 const basis::ElementBases &element = space_.basis_list()[i];
1334 for (int j = 0; j < element.bases.size(); j++)
1335 {
1336 const basis::Basis &basis = element.bases[j];
1337 assert(basis.global().size() == 1);
1338 V.row(basis.global()[0].index) = basis.global()[0].node;
1339 if (j < F.cols())
1340 F(i, j) = basis.global()[0].index;
1341 }
1342 }
1343 }
1344
1345} // namespace polyfem::varform
int V
ElementAssemblyValues vals
Definition Assembler.cpp:26
std::vector< std::pair< int, double > > weights
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:2815
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:2732
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:49
int n_elements() const
utitlity to return the number of elements, cells or faces in 3d and 2d
Definition Mesh.hpp:174
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:525
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:456
int dimension() const
utily for dimension
Definition Mesh.hpp:164
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_
void build_elastic_basis(mesh::Mesh &mesh, const bool iso_parametric, const json &args, const int fe_space_id)
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
std::shared_ptr< assembler::HRZMass > pure_mass_assembler_
std::shared_ptr< assembler::Mass > mass_assembler_
std::shared_ptr< assembler::RhsAssembler > rhs_assembler_
assembler::AssemblyValsCache mass_ass_vals_cache_
void initial_velocity(Eigen::MatrixXd &velocity, const InitialConditionOverride *override=nullptr, const std::string &state_prefix="") const
void load_mesh(const mesh::Mesh &mesh, const json &args) override
void initial_acceleration(Eigen::MatrixXd &acceleration, const InitialConditionOverride *override=nullptr, const std::string &state_prefix="") const
void initial_solution(Eigen::MatrixXd &solution, const InitialConditionOverride *override=nullptr, const std::string &state_prefix="") const
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
Eigen::VectorXi disc_ordersq
Secondary polynomial degree for anisotropic bases, e.g. prisms.
Definition FESpace.hpp:74
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:1105
static void rebuild_node_positions(const std::vector< basis::ElementBases > &bases, const std::vector< int > &node_ids, std::vector< RowVectorNd > &positions)
Definition VarForm.cpp:1119
std::shared_ptr< assembler::Problem > problem
current problem, it contains rhs and bc
Definition VarForm.hpp:214
virtual std::string name() const =0
Get the name of the variational formulation.
std::unique_ptr< mesh::Mesh > mesh_
Definition VarForm.hpp:226
void assign_discr_orders(const json &space_args, const mesh::Mesh &mesh, Eigen::VectorXi &disc_orders, Eigen::VectorXi &disc_ordersq)
Definition VarForm.cpp:745
io::OutStatsData stats
Definition VarForm.hpp:218
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:38
QuadratureOrders n_boundary_samples(const int discr_order, const int discr_orderq, const int gdiscr_order) const
Definition VarForm.cpp:255
void build_fe_space(mesh::Mesh &mesh, const bool iso_parametric, const Eigen::VectorXi &disc_orders, const Eigen::VectorXi &disc_ordersq, 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:319
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:276
io::OutRuntimeData timings
runtime statistics
Definition VarForm.hpp:221
void set_materials(assembler::Assembler &assembler, const int size) const
Definition VarForm.cpp:869
virtual void reset()=0
Definition VarForm.cpp:264
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, const unsigned max_iter)
Definition Jacobian.cpp:122
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:56
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