| 694 | } // interpolateVelocity |
| 695 | |
| 696 | void |
| 697 | IBMethod::interpolateLinearizedVelocity(const int u_data_idx, |
| 698 | const std::vector<Pointer<CoarsenSchedule<NDIM>>>& u_synch_scheds, |
| 699 | const std::vector<Pointer<RefineSchedule<NDIM>>>& u_ghost_fill_scheds, |
| 700 | const double data_time) |
| 701 | { |
| 702 | std::vector<Pointer<LData>>*U_jac_data, *X_LE_data; |
| 703 | bool* X_LE_needs_ghost_fill; |
| 704 | getLinearizedVelocityData(&U_jac_data); |
| 705 | getLECouplingPositionData(&X_LE_data, &X_LE_needs_ghost_fill, data_time); |
| 706 | d_l_data_manager->interp(u_data_idx, *U_jac_data, *X_LE_data, u_synch_scheds, u_ghost_fill_scheds, data_time); |
| 707 | resetAnchorPointValues(*U_jac_data, |
| 708 | /*coarsest_ln*/ 0, |
| 709 | /*finest_ln*/ d_hierarchy->getFinestLevelNumber()); |
| 710 | return; |
| 711 | } // interpolateLinearizedVelocity |
| 712 | |
| 713 | void |
| 714 | IBMethod::forwardEulerStep(const double current_time, const double new_time) |
no test coverage detected