* Interface to GiNaC's initially known functions. */
/*
- * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2005 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef __GINAC_INIFCNS_H__
#define __GINAC_INIFCNS_H__
+#include "numeric.h"
#include "function.h"
#include "ex.h"
/** Complex conjugate. */
DECLARE_FUNCTION_1P(conjugate_function)
+
+/** Real part. */
+DECLARE_FUNCTION_1P(real_part_function)
+
+/** Imaginary part. */
+DECLARE_FUNCTION_1P(imag_part_function)
/** Absolute value. */
DECLARE_FUNCTION_1P(abs)
+/** Step function. */
+DECLARE_FUNCTION_1P(step)
+
/** Complex sign. */
DECLARE_FUNCTION_1P(csgn)
return function(zeta2_SERIAL::serial, ex(p1), ex(p2));
}
class zeta_SERIAL;
-template<> inline bool is_the_function<class zeta_SERIAL>(const ex& x)
+template<> inline bool is_the_function<zeta_SERIAL>(const ex& x)
{
return is_the_function<zeta1_SERIAL>(x) || is_the_function<zeta2_SERIAL>(x);
}
return function(G3_SERIAL::serial, ex(x), ex(s), ex(y));
}
class G_SERIAL;
-template<> inline bool is_the_function<class G_SERIAL>(const ex& x)
+template<> inline bool is_the_function<G_SERIAL>(const ex& x)
{
return is_the_function<G2_SERIAL>(x) || is_the_function<G3_SERIAL>(x);
}
return function(psi2_SERIAL::serial, ex(p1), ex(p2));
}
class psi_SERIAL;
-template<> inline bool is_the_function<class psi_SERIAL>(const ex & x)
+template<> inline bool is_the_function<psi_SERIAL>(const ex & x)
{
return is_the_function<psi1_SERIAL>(x) || is_the_function<psi2_SERIAL>(x);
}
ex lsolve(const ex &eqns, const ex &symbols, unsigned options = solve_algo::automatic);
+/** Find a real root of real-valued function f(x) numerically within a given
+ * interval. The function must change sign across interval. Uses Newton-
+ * Raphson method combined with bisection in order to guarantee convergence.
+ *
+ * @param f Function f(x)
+ * @param x Symbol f(x)
+ * @param x1 lower interval limit
+ * @param x2 upper interval limit
+ * @exception runtime_error (if interval is invalid). */
+const numeric fsolve(const ex& f, const symbol& x, const numeric& x1, const numeric& x2);
+
/** Check whether a function is the Order (O(n)) function. */
inline bool is_order_function(const ex & e)
{