smbinterp/interp/tools.py

67 lines
1.4 KiB
Python
Raw Normal View History

import os
2010-10-23 12:49:15 -07:00
import inspect
import numpy as np
import logging
log = logging.getLogger("interp")
2009-12-27 09:48:27 -08:00
def rms(errors):
"""
root mean square calculation
"""
r = 0.0
for i in errors:
r += np.power(i, 2)
r = np.sqrt(r / len(errors))
return r
2011-03-23 23:26:27 -07:00
def baker_exact_2D(X):
"""
2011-03-22 13:20:48 -07:00
the exact function (2D) used from baker's article (for testing)
"""
x ,y = X
2011-03-22 13:20:48 -07:00
answer = np.power((np.sin(x * np.pi) * np.cos(y * np.pi)), 2)
log.debug(answer)
return answer
2011-03-23 23:26:27 -07:00
def friendly_exact_2D(X):
2011-03-22 13:20:48 -07:00
"""
A friendlier 2D func
"""
x ,y = X
answer = 1.0 + x*x + y*y
log.debug(answer)
return answer
2011-03-23 23:26:27 -07:00
def baker_exact_3D(X):
"""
the exact function (3D) used from baker's article (for testing)
"""
x = X[0]
y = X[1]
z = X[2]
answer = np.power((np.sin(x * np.pi / 2.0) * np.sin(y * np.pi / 2.0) * np.sin(z * np.pi / 2.0)), 2)
log.debug(answer)
return answer
2011-03-23 23:26:27 -07:00
def friendly_exact_3D(X):
2011-03-02 22:44:08 -08:00
x,y,z = X
return 1 + x*x + y*y + z*z
def improved_answer(answer, exact, verbose=False):
if not answer['error']:
return True
2011-03-22 13:20:48 -07:00
2010-10-29 11:42:05 -07:00
log.debug('qlin: %s' % answer['qlin'])
log.debug('error: %s' % answer['error'])
log.debug('final: %s' % answer['final'])
log.debug('exact: %s' % exact)
if np.abs(answer['final'] - exact) <= np.abs(answer['qlin'] - exact):
2010-10-29 11:42:05 -07:00
log.debug(":) improved result")
return True
else:
2010-10-29 11:42:05 -07:00
log.debug(":( damaged result")
return False