solver_bspline< Real > Struct Template Reference

#include <solver_uv_bspline.hpp>

List of all members.

Public Member Functions

solver_bspline (unsigned n, unsigned d, unsigned N=100)
int insert_knot (const Real &x, int mu)
Real first_root ()

Public Attributes

Real * m_t
Real * m_c
unsigned m_n
unsigned maxn
unsigned m_k
int m_d
Real eps

Detailed Description

template<class Real>
struct mmx::solver_bspline< Real >

Definition at line 30 of file solver_uv_bspline.hpp.

Constructor & Destructor Documentation

solver_bspline	(	unsigned	n,
		unsigned	d,
		unsigned	N = `100`
	)			`[inline]`

Definition at line 36 of file solver_uv_bspline.hpp.

References solver_bspline< Real >::m_c, solver_bspline< Real >::m_t, mmx::N(), and Real.

00036                                                         : m_n(n), maxn(N+n), m_d(d), eps(1e-7) { 
00037     m_t= new Real[2*n+N]; 
00038     for(unsigned i=0; i< 2*n+N; i++) m_t[i]=Real(1);
00039     m_c = new Real[n+N];
00040     for(unsigned i=0; i< n+N; i++) m_c[i]=Real(0);
00041   }

Member Function Documentation

Real first_root ( void ) [inline]

Definition at line 79 of file solver_uv_bspline.hpp.

References mmx::diff(), solver_bspline< Real >::eps, solver_bspline< Real >::insert_knot(), mmx::knotSum(), solver_bspline< Real >::m_c, solver_bspline< Real >::m_d, solver_bspline< Real >::m_k, solver_bspline< Real >::m_n, solver_bspline< Real >::m_t, mmx::max(), solver_bspline< Real >::maxn, mmx::min(), NO_ROOT, and Real.

Referenced by solver< Ring, Bspline >::first_root().

00081 00082 00083 00084 00085 00086 00087 00088       ++k; 00089 00090 00091 00092 00093 00094 00095 00096 00097     } 00098 00099 00100 00101 00102 00103 00104 00105     } 00106 00107 00108 00109 00110 00111 00112 00113 00114 00115 00116 00117 00118 00119   } 00120 00121 00122 00123 00124 }

class="fragment">00080 { unsigned k = 1; Real x = NO_ROOT; for ( ; m_n < maxn; ++m_n ) { while( k<m_n && (m_c[k-1]*m_c[k] > 0.0) ) // Off end? if ( k >= m_n ) { //if (x!= NO_ROOT) //x = -x; // NO_ROOT; x = NO_ROOT; break; // Interval converged? const Real diff = m_t[k+m_d]-m_t[k]; if (diff<eps) { x = m_t[k]; break; const Real av = knotSum(m_t,k-1, m_d); const Real lambda = m_c[k-1]/(m_c[k-1]-m_c[k]); x = (av + lambda*diff)/Real(m_d); // Stopping criterion const Real e = std::max(x, m_t[k+m_d-1]) - std::min(x, m_t[k+1] ); // const Real e = max(fabs(x-t[k+1]),fabs(x-t[k+m_d-1])); if (e < eps) break; // Refine spline insert_knot(x,k); // dx = d*(m_c[k]-m_c[k-1])/(t[k+m_d]-t[k]); m_k = k; return x;

int insert_knot	(	const Real &	x,
		int	mu
	)			`[inline]`

Definition at line 53 of file solver_uv_bspline.hpp.

References solver_bspline< Real >::m_c, solver_bspline< Real >::m_d, solver_bspline< Real >::m_n, solver_bspline< Real >::m_t, mmx::max(), and Real.

Referenced by solver_bspline< Real >::first_root().

00054 {
00055   mu = std::max(mu,m_d);
00056   while ( x>=m_t[mu+1]) mu++;
00057   
00058   for ( int i=m_n; i>mu; i--) {
00059     m_c[i] = m_c[i-1];
00060   }
00061   
00062   for ( int i=mu; i>=mu-m_d+1; i--) {
00063     const Real alpha = (x-m_t[i])/(m_t[i+m_d]-m_t[i]);
00064     m_c[i] = (1.0-alpha) * m_c[i-1] + alpha * m_c[i];
00065   }
00066 
00067   m_t[m_n+m_d] = 1.0;
00068   
00069   for ( int i=m_n; i>mu+1; --i)
00070     m_t[i] = m_t[i-1];
00071   m_t[mu+1] = x;
00072   
00073   //    n++;
00074   return mu;
00075 }