view alignedTimestep.m @ 711:397d1b22cc37 feature/quantumTriangles

Changed closure and penalty ao that sparse matrices are created in DiffOpTimeDep
author Ylva Rydin <ylva.rydin@telia.com>
date Thu, 30 Nov 2017 18:01:21 +0100
parents c71095442c57
children
line wrap: on
line source

% Calcualtes the largest timestep smaller than k_max that gives an integer
% number of timesteps to time T.
%   k_max -- largest allowable timestep
%   T     -- time to align with
%
% Returns:
%   k -- calculated timestep
%   N -- number to of timestep to reach T
function [k, N] = alignedTimestep(k_max, T)
    N = ceil(T/k_max);
    k = T/N;
end