use of org.matheclipse.core.expression.ASTSeriesData in project symja_android_library by axkr.
the class D method binaryD.
/**
* Evaluate <code>D(functionO>fX, x)</code> for some general cases.
*
* @param functionOfX the function of <code>x</code>
* @param x derive w.r.t this variable
* @param ast
* @param engine
* @return
*/
private static IExpr binaryD(final IExpr functionOfX, IExpr x, final IAST ast, EvalEngine engine) {
int[] dim = functionOfX.isPiecewise();
if (dim != null) {
return dPiecewise(dim, (IAST) functionOfX, ast, engine);
}
if (functionOfX instanceof ASTSeriesData) {
ASTSeriesData series = ((ASTSeriesData) functionOfX);
if (series.getX().equals(x)) {
final IExpr temp = ((ASTSeriesData) functionOfX).derive(x);
if (temp != null) {
return temp;
}
return F.NIL;
}
return F.C0;
}
if (functionOfX.isFree(x, true)) {
return F.C0;
}
if (functionOfX.isNumber()) {
// D[x_?NumberQ,y_] -> 0
return F.C0;
}
if (functionOfX.equals(x)) {
// D[x_,x_] -> 1
return F.C1;
}
if (functionOfX.isAST()) {
final IAST function = (IAST) functionOfX;
final IExpr header = function.head();
if (function.isPlus()) {
// D(a_+b_+c_,x_) -> D(a,x)+D(b,x)+D(c,x)
IExpr result = function.mapThread(F.D(F.Slot1, x), 1);
return engine.evaluate(result);
} else if (function.isTimes()) {
return function.map(F.PlusAlloc(16), new BinaryBindIth1st(function, F.D(S.Null, x)));
} else if (function.isPower()) {
// f ^ g
final IExpr f = function.base();
final IExpr g = function.exponent();
if (g.isFree(x)) {
// g*D(f,y)*f^(g-1)
return F.Times(g, F.D(f, x), F.Power(f, g.dec()));
}
if (f.isFree(x)) {
if (f.isE()) {
return F.Times(F.D(g, x), F.Exp(g));
}
// D(g,y)*Log(f)*f^g
return F.Times(F.D(g, x), F.Log(f), F.Power(f, g));
}
// D[f_^g_,y_]:= f^g*(((g*D[f,y])/f)+Log[f]*D[g,y])
final IASTAppendable resultList = F.TimesAlloc(2);
resultList.append(F.Power(f, g));
resultList.append(F.Plus(F.Times(g, F.D(f, x), F.Power(f, F.CN1)), F.Times(F.Log(f), F.D(g, x))));
return resultList;
} else if (function.isAST(S.Surd, 3)) {
// Surd[f,g]
final IExpr f = function.base();
if (function.exponent().isInteger()) {
final IInteger g = (IInteger) function.exponent();
if (g.isMinusOne()) {
return F.Times(F.CN1, F.D(f, x), F.Power(f, F.CN2));
}
final IRational gInverse = g.inverse();
if (g.isNegative()) {
if (g.isEven()) {
return F.Times(gInverse, F.D(f, x), F.Power(F.Surd(f, g.negate()), g.dec()));
}
return F.Times(gInverse, F.D(f, x), F.Power(f, F.CN1), F.Power(F.Surd(f, g.negate()), F.CN1));
}
return F.Times(gInverse, F.D(f, x), F.Power(F.Surd(f, g), g.dec().negate()));
}
} else if ((header == S.Log) && (function.isAST2())) {
if (function.isFreeAt(1, x)) {
// D[Log[i_FreeQ(x), x_], z_]:= (x*Log[a])^(-1)*D[x,z];
return F.Times(F.Power(F.Times(function.arg2(), F.Log(function.arg1())), F.CN1), F.D(function.arg2(), x));
}
// } else if (header == F.LaplaceTransform && (listArg1.size()
// == 4)) {
// if (listArg1.arg3().equals(x) && listArg1.arg1().isFree(x,
// true)) {
// // D(LaplaceTransform(c,t,s), s) -> -c / s^2
// return F.Times(-1L, listArg1.arg2(), F.Power(x, -2L));
// } else if (listArg1.arg1().equals(x)) {
// // D(LaplaceTransform(c,t,s), c) -> 1/s
// return F.Power(x, -1L);
// } else if (listArg1.arg1().isFree(x, true) &&
// listArg1.arg2().isFree(x, true) && listArg1.arg3().isFree(x,
// true))
// {
// // D(LaplaceTransform(c,t,s), w) -> 0
// return F.C0;
// } else if (listArg1.arg2().equals(x)) {
// // D(LaplaceTransform(c,t,s), t) -> 0
// return F.C0;
// }
} else if (function.isAST1() && ast.isEvalFlagOff(IAST.IS_DERIVATIVE_EVALED)) {
IAST[] derivStruct = function.isDerivativeAST1();
if (derivStruct != null && derivStruct[2] != null) {
IAST headAST = derivStruct[1];
IAST a1Head = derivStruct[0];
if (a1Head.isAST1() && a1Head.arg1().isInteger()) {
try {
int n = ((IInteger) a1Head.arg1()).toInt();
IExpr arg1 = function.arg1();
if (n > 0) {
IAST fDerivParam = Derivative.createDerivative(n + 1, headAST.arg1(), arg1);
if (x.equals(arg1)) {
return fDerivParam;
}
return F.Times(F.D(arg1, x), fDerivParam);
}
} catch (ArithmeticException ae) {
}
}
return F.NIL;
}
return getDerivativeArg1(x, function.arg1(), header, engine);
} else if (function.isAST() && ast.isEvalFlagOff(IAST.IS_DERIVATIVE_EVALED)) {
return getDerivativeArgN(x, function, header);
}
}
return F.NIL;
}
use of org.matheclipse.core.expression.ASTSeriesData in project symja_android_library by axkr.
the class SerializableTest method testPowerSeries.
public void testPowerSeries() {
equalsCopy(new ASTSeriesData(F.x, F.a, F.List(F.C0, F.C1, F.C3), 0, 10, 1));
// Series(Log(x),{x,a,4})
EvalEngine engine = EvalEngine.get();
IExpr result = engine.evaluate(F.Series(F.Log(F.x), F.List(F.x, F.a, F.C4)));
equalsCopy(result);
}
use of org.matheclipse.core.expression.ASTSeriesData in project symja_android_library by axkr.
the class OutputFormFactory method convert.
private void convert(final Appendable buf, final IExpr o, final int precedence, boolean isASTHead) throws IOException {
if (o instanceof IAST) {
final IAST list = (IAST) o;
if (!list.isPresent()) {
append(buf, "NIL");
return;
}
if (o.isDataset()) {
// TODO improve output
buf.append(o.toString());
return;
} else if (o.isAssociation()) {
convertAssociation(buf, (IAssociation) o);
return;
} else if (o.isAST(S.Association, 1)) {
buf.append("<||>");
return;
}
IExpr header = list.head();
if (!header.isSymbol()) {
// print expressions like: f(#1, y)& [x]
IAST[] derivStruct = list.isDerivativeAST1();
if (derivStruct != null) {
IAST a1Head = derivStruct[0];
IAST headAST = derivStruct[1];
if (a1Head.isAST1() && a1Head.arg1().isInteger() && headAST.isAST1() && (headAST.arg1().isSymbol() || headAST.arg1().isAST()) && derivStruct[2] != null) {
try {
int n = ((IInteger) a1Head.arg1()).toInt();
if (n == 1 || n == 2) {
IExpr symbolOrAST = headAST.arg1();
convert(buf, symbolOrAST, Integer.MIN_VALUE, false);
if (n == 1) {
append(buf, "'");
} else if (n == 2) {
append(buf, "''");
}
convertArgs(buf, symbolOrAST, list);
return;
}
} catch (ArithmeticException ae) {
}
}
}
convert(buf, header, Integer.MIN_VALUE, true);
// avoid fast StackOverflow
append(buf, "[");
for (int i = 1; i < list.size(); i++) {
convert(buf, list.get(i), Integer.MIN_VALUE, false);
if (i < list.argSize()) {
append(buf, ",");
}
}
append(buf, "]");
return;
}
if (header.isSymbol()) {
ISymbol head = (ISymbol) header;
int functionID = head.ordinal();
if (functionID > ID.UNKNOWN) {
switch(functionID) {
case ID.TwoWayRule:
case ID.UndirectedEdge:
if (list.isAST2()) {
convert(buf, list.arg1(), Integer.MIN_VALUE, false);
buf.append("<->");
convert(buf, list.arg2(), Integer.MIN_VALUE, false);
return;
}
break;
case ID.DirectedEdge:
if (list.isAST2()) {
convert(buf, list.arg1(), Integer.MIN_VALUE, false);
buf.append("->");
convert(buf, list.arg2(), Integer.MIN_VALUE, false);
return;
}
break;
}
}
final Operator operator = getOperator(head);
if (operator != null) {
if (operator instanceof PostfixOperator) {
if (list.isAST1()) {
convertPostfixOperator(buf, list, (PostfixOperator) operator, precedence);
return;
}
} else {
if (convertOperator(operator, list, buf, isASTHead ? Integer.MAX_VALUE : precedence, head)) {
return;
}
}
}
if (functionID > ID.UNKNOWN) {
switch(functionID) {
case ID.Inequality:
if (list.size() > 3 && convertInequality(buf, list, precedence)) {
return;
}
break;
case ID.Quantity:
// if (head.equals(F.SeriesData) && (list.size() == 7)) {
if (list instanceof IQuantity) {
if (convertQuantityData(buf, (IQuantity) list, precedence)) {
return;
}
}
break;
case ID.SeriesData:
// if (head.equals(F.SeriesData) && (list.size() == 7)) {
if (list instanceof ASTSeriesData) {
if (convertSeriesData(buf, (ASTSeriesData) list, precedence)) {
return;
}
}
break;
case ID.SparseArray:
if (list.isSparseArray()) {
buf.append(list.toString());
return;
}
break;
case ID.Parenthesis:
convertArgs(buf, S.Parenthesis, list);
return;
case ID.List:
convertList(buf, list, false);
return;
case ID.MatrixForm:
if (list.isASTOrAssociation() && list.size() > 1) {
// see also MatrixForm in MathML or TeX format for "graphical representation".
IExpr normal = list.arg1().normal(false);
if (normal.isList()) {
// && normal.isMatrix() != null) {
IntList dims = LinearAlgebra.dimensions((IAST) normal, S.List);
convertList(buf, (IAST) normal, dims.size() >= 2);
return;
}
convert(buf, normal, Integer.MIN_VALUE, false);
return;
}
break;
case ID.Out:
if (list.isAST1() && list.arg1().isInteger()) {
int lineNumber = list.arg1().toIntDefault();
if (lineNumber == -1) {
buf.append("%");
return;
} else if (lineNumber == -2) {
buf.append("%%");
return;
}
}
break;
case ID.Part:
if (list.size() >= 3) {
convertPart(buf, list);
return;
}
break;
case ID.Slot:
if (list.isAST1() && list.arg1().isInteger()) {
convertSlot(buf, list);
return;
}
break;
case ID.SlotSequence:
if (list.isAST1() && list.arg1().isInteger()) {
convertSlotSequence(buf, list);
return;
}
break;
case ID.Defer:
case ID.HoldForm:
if (list.isAST1()) {
convert(buf, list.arg1(), Integer.MIN_VALUE, false);
return;
}
break;
case ID.DirectedInfinity:
if (list.isDirectedInfinity()) {
// head.equals(F.DirectedInfinity))
if (list.isAST0()) {
append(buf, "ComplexInfinity");
return;
}
if (list.isAST1()) {
if (list.arg1().isOne()) {
append(buf, "Infinity");
return;
} else if (list.arg1().isMinusOne()) {
if (Precedence.PLUS < precedence) {
append(buf, "(");
}
append(buf, "-Infinity");
if (Precedence.PLUS < precedence) {
append(buf, ")");
}
return;
} else if (list.arg1().isImaginaryUnit()) {
append(buf, "I*Infinity");
return;
} else if (list.arg1().isNegativeImaginaryUnit()) {
append(buf, "-I*Infinity");
return;
}
}
}
break;
case ID.Optional:
if (list.isAST2() && (list.arg1().isBlank() || list.arg1().isPattern())) {
convert(buf, list.arg1(), Integer.MIN_VALUE, false);
buf.append(":");
convert(buf, list.arg2(), Integer.MIN_VALUE, false);
return;
}
break;
case ID.Complex:
if (list.isAST2()) {
// used for visual comparison of steps
boolean isZeroRealPart = list.arg1().isZero();
final int prec = isZeroRealPart ? Precedence.TIMES : Precedence.PLUS;
if (prec < precedence) {
append(buf, "(");
}
if (isZeroRealPart) {
buf.append("I*");
convert(buf, list.arg2(), Precedence.TIMES, false);
} else {
convert(buf, list.arg1(), Precedence.PLUS, false);
buf.append("+I*");
convert(buf, list.arg2(), Precedence.TIMES, false);
}
if (prec < precedence) {
append(buf, ")");
}
return;
}
break;
case ID.Rational:
if (list.isAST2()) {
// used for visual comparison of steps
IExpr numerator = list.arg1();
final boolean isNegative = numerator.isNegative();
final int prec = isNegative ? Precedence.PLUS : Precedence.TIMES;
if (prec < precedence) {
append(buf, "(");
}
convert(buf, list.arg1(), Precedence.DIVIDE, false);
buf.append("/");
convert(buf, list.arg2(), Precedence.DIVIDE, false);
if (prec < precedence) {
append(buf, ")");
}
return;
}
break;
}
} else {
if (list instanceof ASTRealVector || list instanceof ASTRealMatrix) {
convertList(buf, list, false);
return;
}
}
}
convertAST(buf, list);
} else if (o instanceof ISignedNumber) {
convertNumber(buf, (ISignedNumber) o, precedence, NO_PLUS_CALL);
} else if (o instanceof IComplexNum) {
convertDoubleComplex(buf, (IComplexNum) o, precedence, NO_PLUS_CALL);
} else if (o instanceof IComplex) {
convertComplex(buf, (IComplex) o, precedence, NO_PLUS_CALL);
} else if (o instanceof ISymbol) {
convertSymbol(buf, (ISymbol) o);
} else if (o instanceof IPatternObject) {
convertPattern(buf, (IPatternObject) o);
} else if (o instanceof IStringX) {
convertString(buf, ((IStringX) o).toString());
} else {
convertString(buf, o.toString());
}
}
Aggregations