25#include <unsupported/Eigen/SparseExtra>
27#include <polysolve/linear/FEMSolver.hpp>
37 const std::string full_mat_path =
args[
"output"][
"data"][
"full_mat"];
38 if (!full_mat_path.empty())
39 Eigen::saveMarket(stiffness, full_mat_path);
45 const Eigen::MatrixXd &solution,
54 Eigen::MatrixXd &solution)
87 const bool is_time_dependent =
args.contains(
"time") && !
args[
"time"].is_null();
96 if (!
args.contains(
"preset_problem"))
98 problem = std::make_shared<assembler::GenericScalarProblem>(
"GenericScalar");
102 tmp[
"is_time_dependent"] = is_time_dependent;
105 auto bc =
args[
"boundary_conditions"];
119 t0 = is_time_dependent ?
args[
"time"][
"t0"].get<
double>() : 0.0;
120 time_steps = is_time_dependent ?
args[
"time"][
"time_steps"].get<
int>() : 0;
121 dt = is_time_dependent ?
args[
"time"][
"dt"].get<
double>() : 0.0;
140 Eigen::VectorXi space_disc_orders, space_disc_ordersq;
143 if (
args[
"space"][
"use_p_ref"])
147 args[
"space"][
"advanced"][
"B"],
148 args[
"space"][
"advanced"][
"h1_formula"],
149 args[
"space"][
"discr_order"],
150 args[
"space"][
"advanced"][
"discr_order_max"],
154 logger().info(
"min p: {} max p: {}", space_disc_orders.minCoeff(), space_disc_orders.maxCoeff());
162 args[
"space"][
"basis_type"],
163 args[
"space"][
"poly_basis_type"],
166 args[
"space"][
"advanced"][
"quadrature_order"],
167 args[
"space"][
"advanced"][
"mass_quadrature_order"],
168 args[
"space"][
"advanced"][
"use_corner_quadrature"],
169 args[
"space"][
"advanced"][
"n_harmonic_samples"],
170 args[
"space"][
"advanced"][
"integral_constraints"],
188 std::vector<int> unused_neumann_boundary_nodes;
196 unused_neumann_boundary_nodes,
215 if (
problem->is_nodal_dimension_dirichlet(n_id, tag, 0))
225 if (
args[
"space"][
"advanced"][
"count_flipped_els"])
228 const int n_samples = 10;
238 logger().info(
"Building cache...");
242 logger().info(
" took {}s", timer.getElapsedTime());
254 json rhs_solver_params =
args[
"solver"][
"linear"];
255 if (!rhs_solver_params.contains(
"Pardiso"))
256 rhs_solver_params[
"Pardiso"] = {};
257 rhs_solver_params[
"Pardiso"][
"mtype"] = -2;
264 args[
"space"][
"advanced"][
"bc_method"],
278 delta = (max - min) / 2. + min;
280 p_params[
"bbox_center"] = {delta(0), delta(1), delta(2)};
282 p_params[
"bbox_center"] = {delta(0), delta(1)};
289 logger().info(
"Assigning rhs...");
302 if (!
problem->is_time_dependent())
313 logger().info(
"Assembling mass mat...");
317 assert(
mass_.size() > 0);
320 for (
int k = 0; k <
mass_.outerSize(); ++k)
322 for (StiffnessMatrix::InnerIterator it(
mass_, k); it; ++it)
324 assert(it.col() == k);
332 if (
args[
"solver"][
"advanced"][
"lump_mass_matrix"])
347 if (solution.size() > 0)
350 if (
problem->is_time_dependent())
354 solution.resize(
rhs_.size(), 1);
363 logger().error(
"Load the mesh first!");
366 if (solution.size() <= 0)
368 logger().error(
"Solve the problem first!");
372 logger().info(
"Saving json...");
374 const Eigen::MatrixXd stats_solution =
375 solution.rows() >= primary_size
376 ? solution.topRows(primary_size).eval()
384 args[
"output"][
"advanced"][
"sol_at_node"], j);
385 out << j.dump(4) << std::endl;
393 for (
int e = 0; e < output_orders.size(); ++e)
395 if (
mesh_->is_prism(e))
415 if (!
args[
"output"][
"advanced"][
"compute_error"])
419 if (!
args[
"time"].is_null())
420 tend =
args[
"time"][
"tend"];
431 logger().error(
"Load the mesh first!");
434 if (solution.size() <= 0)
436 logger().error(
"Solve the problem first!");
443 const bool has_time =
args.contains(
"time") && !
args[
"time"].is_null();
444 double tend = has_time ?
args[
"time"][
"tend"].get<
double>() : 1.0;
459 if (!solution_path.empty())
461 const int primary_ndof = std::min<int>(solution.rows(),
space_.
n_bases);
462 const Eigen::MatrixXd primary_solution = solution.topRows(primary_ndof);
465 const Eigen::MatrixXd nodal_solution =
utils::unflatten(primary_solution, 1);
466 Eigen::MatrixXd reordered = Eigen::MatrixXd::Zero(nodal_solution.rows(), nodal_solution.cols());
470 if (node >= 0 && node < nodal_solution.rows() && input_node < reordered.rows())
471 reordered.row(input_node) = nodal_solution.row(node);
482 if (!nodes_path.empty())
487 for (
const auto &global : basis.global())
488 nodes.row(global.index) = global.node;
496 Eigen::MatrixXd stress;
497 Eigen::VectorXd mises;
502 if (!stress_path.empty())
504 if (!mises_path.empty())
511 const Eigen::MatrixXd &solution,
514 std::vector<io::OutputField> fields;
521 const int primary_ndof = std::min<int>(solution.rows(),
space_.
n_bases);
522 const Eigen::MatrixXd primary_solution = solution.topRows(primary_ndof);
524 const auto sample_dof_field = [&](
const Eigen::MatrixXd &dof_values, Eigen::MatrixXd &values, Eigen::MatrixXd *gradients =
nullptr) ->
bool {
525 if (dof_values.size() <= 0)
528 if (has_element_samples)
540 gradients->row(i).setZero();
544 Eigen::MatrixXd local_sol, local_grad;
547 element_id, sample.
local_points.row(i), dof_values, local_sol, local_grad);
548 values(i) = local_sol(0);
550 gradients->row(i) = local_grad;
553 if (output_rows > values.rows())
555 const int previous_rows = values.rows();
556 values.conservativeResize(output_rows, Eigen::NoChange);
557 values.bottomRows(output_rows - previous_rows).setZero();
560 gradients->conservativeResize(output_rows, Eigen::NoChange);
561 gradients->bottomRows(output_rows - previous_rows).setZero();
569 values.resize(sample.
node_ids.size(), 1);
570 for (
int i = 0; i < sample.
node_ids.size(); ++i)
572 const int node_id = sample.
node_ids(i);
573 if (node_id < 0 || node_id >= dof_values.rows())
575 values(i) = dof_values(node_id);
577 return sample.
points.rows() == 0 || sample.
points.rows() == values.rows();
583 const auto ¶view_options =
args[
"output"][
"paraview"][
"options"];
584 if (has_element_samples &&
problem->has_exact_sol() && sample.
points.rows() == output_rows)
586 Eigen::MatrixXd exact;
588 if (exact.rows() == output_rows)
594 Eigen::MatrixXd values;
595 if (sample_dof_field(primary_solution, values))
601 if ((paraview_options[
"nodes"] || (!options.
fields.empty() && options.
export_field(
"nodes")))
602 && has_element_samples
605 Eigen::MatrixXd dof_ids(primary_ndof, 1);
606 dof_ids.col(0).setLinSpaced(primary_ndof, 0, primary_ndof - 1);
607 Eigen::MatrixXd values;
608 if (sample_dof_field(dof_ids, values))
612 if ((paraview_options[
"jacobian_validity"] || (!options.
fields.empty() && options.
export_field(
"validity")))
613 && has_element_samples
614 &&
mesh_->dimension() == 1
618 Eigen::MatrixXd validity = Eigen::MatrixXd::Zero(output_rows, 1);
619 for (
int i = 0; i < sample.
element_ids.size(); ++i)
620 validity(i) = std::find(invalid_elements.begin(), invalid_elements.end(), sample.
element_ids(i)) != invalid_elements.end();
624 const bool export_solution_gradient =
626 if (options.
export_field(
"solution") || export_solution_gradient)
628 Eigen::MatrixXd values, gradients;
629 if (sample_dof_field(
631 export_solution_gradient ? &gradients :
nullptr))
635 if (export_solution_gradient)
640 if (paraview_options[
"material"] && has_element_samples)
642 const auto ¶ms = primary_assembler_->parameters();
643 std::map<std::string, Eigen::MatrixXd> param_values;
644 for (
const auto &[p, _] : params)
645 param_values[p].setZero(output_rows, 1);
647 Eigen::MatrixXd rhos = Eigen::MatrixXd::Zero(output_rows, 1);
648 const auto &density = mass_assembler_->density();
649 for (
int i = 0; i < sample.local_points.rows(); ++i)
651 const int element_id = sample.element_ids(i);
655 for (
const auto &[p, func] : params)
656 param_values.at(p)(i) = func(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
657 rhos(i) = density(sample.local_points.row(i), sample.points.row(i), sample.time, element_id);
660 for (
const auto &[name, values] : param_values)
661 if (options.export_field(name))
663 if (options.export_field(
"rho"))
667 if (paraview_options[
"body_ids"] && options.export_field(
"body_ids") && has_element_samples)
669 Eigen::MatrixXd ids = Eigen::MatrixXd::Zero(output_rows, 1);
670 for (
int i = 0; i < sample.element_ids.size(); ++i)
672 const int element_id = sample.element_ids(i);
674 ids(i) = mesh_->get_body_id(element_id);
686 logger().info(
"Assembling stiffness mat...");
687 assert(primary_assembler_->is_linear());
688 assert(problem->is_scalar());
690 primary_assembler_->assemble(mesh_->is_volume(),
space_.n_bases,
space_.basis_list(),
space_.geometry_basis_list(), ass_vals_cache_, 0, stiffness);
693 timings.assembling_stiffness_mat_time = timer.getElapsedTime();
694 logger().info(
" took {}s", timings.assembling_stiffness_mat_time);
696 stats.nn_zero = stiffness.nonZeros();
697 stats.num_dofs = stiffness.rows();
698 stats.mat_size = (
long long)stiffness.rows() * (
long long)stiffness.cols();
699 logger().info(
"sparsity: {}/{}", stats.nn_zero, stats.mat_size);
704 void ScalarVarForm::solve_linear_system(
705 const std::unique_ptr<polysolve::linear::Solver> &solver,
708 const bool compute_spectrum,
709 Eigen::MatrixXd &sol)
711 assert(primary_assembler_->is_linear());
712 assert(problem->is_scalar());
713 assert(rhs_assembler_ !=
nullptr);
716 stats.spectrum = dirichlet_solve(
720 boundary_.boundary_nodes,
723 args[
"output"][
"data"][
"stiffness_mat"],
729 solver->get_info(stats.solver_info);
731 const auto error = (A *
x - b).norm();
733 logger().error(
"Solver error: {}", error);
735 logger().debug(
"Solver error: {}", error);
738 void ScalarVarForm::solve_linear_system_with_constraints(
739 const std::unique_ptr<polysolve::linear::Solver> &solver,
742 const bool compute_spectrum,
745 Eigen::MatrixXd &sol)
747 const json &periodic_conditions = args[
"boundary_conditions"][
"periodic"];
748 const json &zero_mean = args[
"constraints"][
"zero_mean"];
749 const bool add_zero_mean =
750 zero_mean.is_boolean()
751 ? zero_mean.get<
bool>()
752 : (zero_mean.is_array()
753 && std::find(zero_mean.begin(), zero_mean.end(), 0) != zero_mean.end());
754 const bool has_global_constraints = !periodic_conditions.empty() || add_zero_mean;
756 if (!has_global_constraints)
758 solve_linear_system(solver, A, b, compute_spectrum, sol);
762 if (!zero_mean.is_boolean() && !zero_mean.is_array())
766 if (constraint_mass.rows() != A.rows() || constraint_mass.cols() != A.cols())
768 mass_assembler_->assemble(
769 mesh_->is_volume(),
space_.n_bases,
space_.basis_list(),
space_.geometry_basis_list(),
770 mass_ass_vals_cache_, 0, constraint_mass,
true);
772 if (constraint_mass.rows() != A.rows() || constraint_mass.cols() != A.cols())
773 log_and_throw_error(
"Unable to assemble scalar constraint mass matrix for {} DoFs", A.rows());
775 std::vector<std::shared_ptr<solver::AugmentedLagrangianForm>> constraint_forms;
776 if (!boundary_.boundary_nodes.empty())
778 constraint_forms.push_back(std::make_shared<solver::BCLagrangianForm>(
779 A.rows(), boundary_.boundary_nodes, boundary_.local_boundary,
780 boundary_.local_neumann_boundary, boundary_samples, constraint_mass,
781 *rhs_assembler_, 0, problem->is_time_dependent(), time));
784 for (
const json &condition : periodic_conditions)
786 const int fe_space = condition.value(
"fe_space", -1);
787 if (fe_space >= 0 && fe_space != 0)
790 const std::array<int, 2> boundary_ids = {{condition[
"boundary_ids"][0].get<
int>(),
791 condition[
"boundary_ids"][1].get<int>()}};
792 constraint_forms.push_back(std::make_shared<solver::PeriodicBoundaryLagrangianForm>(
793 A.rows(), 1, *mesh_,
space_.basis_list(),
794 boundary_.total_local_boundary, boundary_ids,
795 condition.value(
"tolerance", 1e-5)));
800 const Eigen::VectorXd
weights = constraint_mass * Eigen::VectorXd::Ones(A.rows());
801 const double weight_sum =
weights.cwiseAbs().sum();
805 std::vector<Eigen::Triplet<double>>
entries;
807 for (
int dof = 0; dof <
weights.size(); ++dof)
813 constraint_forms.push_back(std::make_shared<solver::MatrixLagrangianForm>(
814 C, Eigen::MatrixXd::Zero(1, 1)));
817 if (constraint_forms.empty())
819 solve_linear_system(solver, A, b, compute_spectrum, sol);
823 auto constraint_solver = polysolve::linear::Solver::create(args[
"solver"][
"linear"],
logger());
824 std::shared_ptr<polysolve::linear::Solver> shared_constraint_solver(std::move(constraint_solver));
826 A.rows(), time, {}, constraint_forms, shared_constraint_solver,
827 1, 1, constraint_mass, 1);
830 const Eigen::VectorXd affine_offset =
835 Eigen::VectorXd reduced_solution;
836 stats.spectrum = dirichlet_solve(
837 *solver, A, b, {}, reduced_solution, A.rows(),
838 args[
"output"][
"data"][
"stiffness_mat"],
842 solver->get_info(stats.solver_info);
844 const double error = (A * reduced_solution - b).norm();
846 logger().error(
"Solver error: {}", error);
848 logger().debug(
"Solver error: {}", error);
853 auto solver = polysolve::linear::Solver::create(args[
"solver"][
"linear"],
logger());
854 logger().info(
"{}...", solver->name());
856 const int gdiscr_order = mesh_->orders().size() <= 0 ? 1 : mesh_->orders().maxCoeff();
857 const QuadratureOrders boundary_samples = n_boundary_samples(
space_.disc_orders.maxCoeff(),
space_.disc_ordersq.maxCoeff(), gdiscr_order);
859 rhs_assembler_->set_bc(
860 boundary_.local_boundary, boundary_.boundary_nodes, boundary_samples,
861 (primary_assembler_->name() !=
"Bilaplacian") ? boundary_.local_neumann_boundary : std::vector<mesh::LocalBoundary>(), rhs_);
864 build_stiffness_mat(A);
866 Eigen::VectorXd b = rhs_;
867 solve_linear_system_with_constraints(
868 solver, A, b, args[
"output"][
"advanced"][
"spectrum"],
869 boundary_samples, 1, sol);
874 solve_data_.elastic_form = std::make_shared<solver::ElasticForm>(
876 *primary_assembler_, ass_vals_cache_, 0, 0, mesh_->is_volume(),
877 args[
"solver"][
"advanced"][
"jacobian_threshold"],
878 args[
"solver"][
"advanced"][
"check_inversion"],
879 args[
"solver"][
"advanced"][
"conservative_max_iter"]);
880 solve_data_.body_form = std::make_shared<solver::BodyForm>(
881 space_.ndof(), 0, boundary_.boundary_nodes, boundary_.local_boundary,
882 boundary_.local_neumann_boundary, boundary_samples, rhs_, *rhs_assembler_,
883 mass_assembler_->density(),
false,
false);
884 solve_data_.body_form->update_quantities(0, sol);
891 assert(problem->is_time_dependent());
892 assert(rhs_assembler_ !=
nullptr);
894 auto solver = polysolve::linear::Solver::create(args[
"solver"][
"linear"],
logger());
895 logger().info(
"{}...", solver->name());
898 args[
"time"][
"integrator"]);
899 bdf->init(sol, Eigen::VectorXd::Zero(sol.size()), Eigen::VectorXd::Zero(sol.size()), dt);
900 time_integrator = bdf;
901 restore_checkpoint_integrator(
902 time_integrator,
"/checkpoint/state/primary_integrator", dt,
905 save_timestep(t0, 0, t0, dt, sol);
909 Eigen::MatrixXd current_rhs = rhs_;
912 build_stiffness_mat(stiffness);
914 const int gdiscr_order = mesh_->orders().size() <= 0 ? 1 : mesh_->orders().maxCoeff();
916 for (
int t = 1; t <= time_steps; ++t)
918 const double time = t0 + t * dt;
920 rhs_assembler_->compute_energy_grad(
921 boundary_.local_boundary, boundary_.boundary_nodes, mass_assembler_->density(), n_b_samples,
922 boundary_.local_neumann_boundary, rhs_, time, current_rhs);
924 rhs_assembler_->set_bc(
925 boundary_.local_boundary, boundary_.boundary_nodes, n_b_samples, boundary_.local_neumann_boundary, current_rhs, sol, time);
928 Eigen::VectorXd b = (mass_ * bdf->weighted_sum_x_prevs()) / bdf->beta_dt();
929 for (
int i : boundary_.boundary_nodes)
933 solve_linear_system_with_constraints(
935 args[
"output"][
"advanced"][
"spectrum"].get<bool>() && t == time_steps,
936 n_b_samples, time, sol);
940 bdf->update_quantities(sol);
941 save_timestep(time, t, t0, dt, sol);
942 save_step_state(t0, dt, t, sol, time_integrator.get());
944 logger().info(
"{}/{} t={}", t, time_steps, time);
945 notify_time_step(t, time_steps, t0, dt);
949 void ScalarVarForm::solve_problem(
950 Eigen::MatrixXd &sol,
955 (!initial_condition_override
956 || (initial_condition_override->
velocity.size() == 0
957 && initial_condition_override->
acceleration.size() == 0))
958 &&
"Scalar formulations do not accept initial velocity or acceleration overrides");
960 stats.spectrum.setZero();
964 logger().info(
"Solving {}", primary_assembler_->name());
969 if (initial_condition_override && initial_condition_override->
solution.size() != 0)
971 sol = initial_condition_override->
solution;
973 sol.rows() ==
space_.ndof() && sol.cols() == 1
974 &&
"Scalar initial solution override must match the simulation DOFs and have one column");
976 else if (sol.size() <= 0)
977 prepare_initial_solution(sol);
980 sol.conservativeResize(Eigen::NoChange, 1);
983 time_integrator =
nullptr;
984 if (problem->is_time_dependent())
985 solve_transient(sol, post_step);
987 solve_static(sol, post_step);
990 timings.solving_time = timer.getElapsedTime();
991 logger().info(
" took {}s", timings.solving_time);
std::vector< Eigen::Triplet< double > > entries
std::array< Matrix< int, 3, 3 >, 3 > space_
#define POLYFEM_SCOPED_TIMER(...)
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.
Represents one basis function and its gradient.
Stores the basis functions for a given element in a mesh (facet in 2d, cell in 3d).
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...
void export_data(const OutputSpace &space, const OutputFieldFunction &output_fields, const bool is_time_dependent, const double tend_in, const double dt, const ExportOptions &opts, const std::string &vis_mesh_path) const
exports everytihng, txt, vtu, etc
double assigning_rhs_time
time to computing the rhs
double assembling_mass_mat_time
time to assembly mass
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
void compute_errors(const int n_bases, const std::vector< polyfem::basis::ElementBases > &bases, const std::vector< polyfem::basis::ElementBases > &gbases, const polyfem::mesh::Mesh &mesh, const assembler::Problem &problem, const double tend, const Eigen::MatrixXd &sol)
compute errors
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...
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
void save_json(const nlohmann::json &args, const int n_bases, const int n_pressure_bases, const Eigen::MatrixXd &sol, const mesh::Mesh &mesh, const Eigen::VectorXi &disc_orders, const Eigen::VectorXi &disc_ordersq, const assembler::Problem &problem, const OutRuntimeData &runtime, const std::string &formulation, const bool isoparametric, const int sol_at_node_id, nlohmann::json &j) const
saves the output statistic to a json object
Abstract mesh class to capture 2d/3d conforming and non-conforming meshes.
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.
virtual int get_node_id(const int node_id) const
Get the boundary selection of a node.
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
virtual TVector full_to_reduced_grad(const TVector &full) const
TVector reduced_to_full(const TVector &reduced) const
void full_hessian_to_reduced_hessian(StiffnessMatrix &hessian) const
class to store time stepping data
std::shared_ptr< assembler::RhsAssembler > rhs_assembler
static std::shared_ptr< BDF > construct_bdf_integrator(const json ¶ms, DynamicOrder dynamic_order=DynamicOrder::Second)
Construct a BDF integrator for algorithms using BDF-specific operations.
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.
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)
spdlog::logger & logger()
Retrieves the current logger.
std::array< int, 2 > QuadratureOrders
Eigen::Matrix< double, 1, Eigen::Dynamic, Eigen::RowMajor, 1, 3 > RowVectorNd
void log_and_throw_error(const std::string &msg)
Eigen::SparseMatrix< double, Eigen::ColMajor > StiffnessMatrix
bool export_field(const std::string &field) const
std::vector< std::string > fields
Eigen::VectorXi primitive_ids
Eigen::VectorXi element_ids
Eigen::MatrixXd local_points