when expanding an expression like (x+1)^7*(x-2)^9, how do arrange the terms by increasing/decreasing degree? ie ax^16+bx^15+cx^14+...
Is there a way to create periodic piecewise functions in Maple 10 for use in solving differential equations with periodic forcing functions?
I've been trying to find information about this apparently elusive (or perhaps obscure) topic without a lot of luck. I was curious if anyone had ever heard of a technique for solving an nth-order nonhomogeneous linear ODE with constant coefficients by means of Duhamel's Convolution Principle. The guy who taught this technique to me didn't believe in using textbooks (or staying in accordance with predefined curricula) and he basically just taught whatever he wanted. He essentially claimed that any nth-order nonhomogeneous linear ODE with constant coefficients could be solved by first solving the associated homogeneous equation, and then, writing a new function (he usually called it theta(t)) using the same form as the solution to the associated homogeneous equation but with initial conditions such that, for t = 0, theta of t, theta prime of t, theta double prime of t, etc., all equaled 0, except for the final condition (theta^(n-1)(t)) which equaled 1.
I have a large program I have been writing using Maple 10 classic. The heart of the prgram is a large iterative loop that spits out various data as it converges on a solution. My problem is that I would like to see certain data and suppress other output. I accordingly assign a colon and semi-colon to the respective lines. But wether Maple actually displays what I want of not seems random. The screen is flooded with unwanted interim data, and only select desired output gets through. Is there some rule with what Maple outputs if its in an iterative or nested iterative loop?
Hello, everyone! I have a very nice, very sparse linear system (only containing 1s and -1s, with at most 2 entries per column). Thus, I immediately thought to take advantage the SparseIterative (or SparseDirect) methods associated with LinearAlgebra,LinearSolve, but alas, it isn't quite working.
This is what I loosely do:
gen_linear_system := proc(... some parameters ...)
ls_m := Matrix(len, total_var, datatype='integer', storage='sparse');
... (fill matrix with appropriate 1s and -1s)
solve_linear_system := proc(system_matrix::Matrix)
I want to do maplet application that fourier series calculate given funtions
how do I?
I have two implicit functions (hyperboloid)：
sqrt((x-28)^2+(y-2)^2+(z-2)^2)-sqrt((x-20)^2+(y+20)^2+(z-6)^2) = 2
sqrt((x+15)^2+(y-2)^2+(z-2)^2)-sqrt((x-20)^2+(y+20)^2+(z-6)^2) = 10
I am able to plot these two functions through display3d, but right now I want to plot the intersection line. Anybody has comments or suggestions?
Thanks a lot,
Hi, How do i make maple to write a fist derivative with respect to time ie i want maple to show y' in the output.
I'm trying to make a 3D-plot of a function f(x,y) that is discontinuous but can not figure out how to do it. I'm new to Maple but I found that there's an option discont=true for 2D-plots. Something similar for 3D?
I want clear some variable Not all of them in
my program(restart command clear all of them),
is it possible in Maple to do that?Tanx.
I have a problem:
I have an ODE, dT/dy, that depends on y and k, but k itself depends on rho and T. The only problem is rho cannot be obtained analytically--it's a complicated function. However, I can use a rootfinding algorithm,(fsolve), to determine rho at given values of y, thereby making my ODE solvable. I want to use dsolve to numerically solve this ode. The problem is I can't seem to be able to input the fsolve equation as an argument to the dsolve command. It keeps telling me :
Error in fsolve, y is not solved for. But my intention is to use y to solve for T and rho in dsolve. If anyone has any idea I would greatly appreciate it.
Hi people, I have two questions and help on any of them would be greatly appreciated.
1. My first question is how would i find the point(s) where the two equations intersect?
4*(x-1)^2+(y-2)^2 = 5;
x^2+4*y^2 = 1;
2. My second question is how do i find the turning points of a function?
Again any help is really appreciated. Thanks in advance.
Does anyone know how to include an fsolve command incorporated into the dsolve command?
In other words, as dsolve iterates the runge kutta procedure, it uses the inital values to use fsolve which would then be used over again in the rk procedure..
Where can I find a description for the various variants of numtheory:-cfrac,
which goes more into details than the online help? For example one can guess
how an approximating sum can be obtained from
numtheory:-cfrac((a+x)^k, x, 7, 'diag', 'simregular', 'quotients');
but I prefer to cross-check against a confirmed formula
instead of guessing.
If somebody would be so kind to point me to some source to look at ... or
even knows it already ...:
how does one evaluate the above list to get a value?
edited to add: I mean a way which can be compiled and without running through