Symbolic derivative
Differentiate the bounded real grammar up to order 4 and keep the original excluded points.
- Runs in your browser
- No upload
- Check before download
Differentiate the bounded real grammar up to order 4 and keep the original excluded points.
Model, grammar and limits
All variables and coefficients are dimensionless, and angles are in radians. Use explicit multiplication and decimal points. Expression grammar: + - * / ^, parentheses, x (or t, y, v for ODEs; n, a, b for recurrences), pi, e, sin, cos, tan, exp, ln, sqrt and abs. No assignments, code or custom calls.
Expressions: up to 512 characters, 128 tokens and depth 32; generated output up to 8192 characters, 512 tokens and depth 64. Polynomial degree up to 12, matrices up to 6×6 (augmented up to 6×7), 2D or 3D vectors, ODEs up to 2000 steps, Taylor order up to 12, Fourier up to 24 harmonics and 2048 intervals, interpolation up to 50 points (polynomial: up to 12), series up to 2000 terms, recurrences up to 1000 terms with an 8192-bit rational bound. A 15-second worker deadline stops unresolved work.
Exact identities apply only on original domains; numeric residuals, error estimates and sampled plots are not proofs of global accuracy/convergence. This educational model is not a hardware, medical, financial or engineering approval. No input is sent or silently stored; download a raw backup before reset or closing. Input data, formulas and filenames are never sent. Only with your optional consent, Refentra sends aggregate counts of actions and outcomes, without input content.
Formal verification:512 terms,1024 candidate products,32 atoms per monomial,2048 characters per atom,8192-character canonical keys. Rational-root profile: primitive constant/leading integers≤1000000 and20000 candidates; remaining factors are not proved irreducible.
Principal real roots retain their branch: sqrt(x²) is not x for negative x. Gauss–Kronrod 15/7 uses eight initial panels and interval-bounded trigonometric phase changes≤π/2 per panel. Limits:20000 evaluations/depth18. Local error estimates are not guaranteed bounds; unresolved resolution/convergence rejects. Factorial series use expm1 for small amplitudes.
d(fg)/dx=f′g+fg′; d(f(g(x)))/dx=f′(g(x))g′(x)
Declared inputs
Declared inputs
| Value | Unit |
|---|---|
| Expression | x^3+sin(x) |
| Order 1 | 1 |
| Interval start 1 | -2 |
| Interval end 1 | 2 |
Sources and licenses
Nerdamer1.1.13 Copyright (c) 2015 Martin Donk Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Use the declared profile
- Declared inputs
Differentiate the bounded real grammar up to order 4 and keep the original excluded points. All variables and coefficients are dimensionless, and angles are in radians. Use explicit multiplication and decimal points. Expression grammar: + - * / ^, parentheses, x (or t, y, v for ODEs; n, a, b for recurrences), pi, e, sin, cos, tan, exp, ln, sqrt and abs. No assignments, code or custom calls.
- Calculate
d(fg)/dx=f′g+fg′; d(f(g(x)))/dx=f′(g(x))g′(x) Expressions: up to 512 characters, 128 tokens and depth 32; generated output up to 8192 characters, 512 tokens and depth 64. Polynomial degree up to 12, matrices up to 6×6 (augmented up to 6×7), 2D or 3D vectors, ODEs up to 2000 steps, Taylor order up to 12, Fourier up to 24 harmonics and 2048 intervals, interpolation up to 50 points (polynomial: up to 12), series up to 2000 terms, recurrences up to 1000 terms with an 8192-bit rational bound. A 15-second worker deadline stops unresolved work.
- Download CSV report
Exact identities apply only on original domains; numeric residuals, error estimates and sampled plots are not proofs of global accuracy/convergence. This educational model is not a hardware, medical, financial or engineering approval. No input is sent or silently stored; download a raw backup before reset or closing. Input data, formulas and filenames are never sent. Only with your optional consent, Refentra sends aggregate counts of actions and outcomes, without input content.
Model questions
Which model is used?
Differentiate the bounded real grammar up to order 4 and keep the original excluded points.
Which syntax and units are supported?
All variables and coefficients are dimensionless, and angles are in radians. Use explicit multiplication and decimal points. Expression grammar: + - * / ^, parentheses, x (or t, y, v for ODEs; n, a, b for recurrences), pi, e, sin, cos, tan, exp, ln, sqrt and abs. No assignments, code or custom calls.
What do the error estimates and limits mean?
Expressions: up to 512 characters, 128 tokens and depth 32; generated output up to 8192 characters, 512 tokens and depth 64. Polynomial degree up to 12, matrices up to 6×6 (augmented up to 6×7), 2D or 3D vectors, ODEs up to 2000 steps, Taylor order up to 12, Fourier up to 24 harmonics and 2048 intervals, interpolation up to 50 points (polynomial: up to 12), series up to 2000 terms, recurrences up to 1000 terms with an 8192-bit rational bound. A 15-second worker deadline stops unresolved work. Formal verification:512 terms,1024 candidate products,32 atoms per monomial,2048 characters per atom,8192-character canonical keys. Rational-root profile: primitive constant/leading integers≤1000000 and20000 candidates; remaining factors are not proved irreducible.
Where are my inputs processed and saved?
Exact identities apply only on original domains; numeric residuals, error estimates and sampled plots are not proofs of global accuracy/convergence. This educational model is not a hardware, medical, financial or engineering approval. No input is sent or silently stored; download a raw backup before reset or closing. Input data, formulas and filenames are never sent. Only with your optional consent, Refentra sends aggregate counts of actions and outcomes, without input content.