Mercurial > repos > public > sbplib
view +noname/convergence.m @ 87:0a29a60e0b21
In Curve: Rearranged for speed. arc_length_fun is now a property of Curve. If it is not supplied, it is computed via the derivative and spline fitting. Switching to the arc length parameterization is much faster now. The new stuff can be tested with testArcLength.m (which should be deleted after that).
author | Martin Almquist <martin.almquist@it.uu.se> |
---|---|
date | Sun, 29 Nov 2015 22:23:09 +0100 |
parents | c6eb3af205c0 |
children | 7bb2ef637142 |
line wrap: on
line source
% Reference is either a key or a function handle function [q, e, h, runtime] = convergence(filename, errorFunc, reference, method, order, m, T) default_arg('errorFunc', @scheme.error1d); sf = SolutionFile(filename); % Generate convergence, error, and efficiency plots for each search key with more than one entry. for i = 1:length(m) key.method = method; key.order = order; key.m = m(i); key.T = T; entry = sf.get(key); [e(i),h(i)] = errorForEntry(key, entry, errorFunc, reference,T); runtime(i) = entry.runtime; end q = convergence(e,h); end function [e, h] = errorForEntry(key,entry, errorFunc, reference,T) v_repr = entry.repr; discr = entry.discr; % Get the solution to be compared v = v_repr.v; % Get the reference solution vector if isa(reference,'function_handle'); x = v_repr.x; v_ref = reference(x,T); else % Downsample the reference solution x = v_repr.x; x_ref = reference.x; [~,I] = ismember(x,x_ref,'rows'); if any(I == 0) error('Solution and reference solution seem to be on different grids.'); end v_ref = reference.v(I); end e = errorFunc(discr,v, v_ref); h = discr.h; end