mm-404 === Subject: Re: MuPAD: it does not plotfunc2d Does the grapcs tool vcam.exe run dalone? Please start Progam Files->MuPAD Pro 2.5.3->Tools->VCam Grapcs Tool Any errors? If yes, what errors? Second try: open Vcam.exe with an example file via Progam Files->MuPAD Pro 2.5.3->Tools->Vcam Demo Again, any errors? If yes, what errors? -- *---* MuPAD -- The Open Computer Algebra System *---*| |*--|* Ralf llebrand (tonner@mupad.de) *---* === Subject: Re: MuPAD: it does not plotfunc2d > Does the grapcs tool vcam.exe run dalone? Please start > Progam Files->MuPAD Pro 2.5.3->Tools->VCam Grapcs Tool Any errors? If yes, what errors? No errors! > Second try: open Vcam.exe with an example file via > Progam Files->MuPAD Pro 2.5.3->Tools->Vcam Demo Again, any errors? If yes, what errors? No errors, but notng, notng at all, happens when I run Vcam Demo. (No window pops up.) o PS: Could you please reply to my e-mail address too? === Subject: Registering *flat* 2D projection of 3D triangle Given 3 pairs of corresponding 3D and 2D points, (the first not co-linear and the second not all confused), I want a closed form expression/algorithm for the linear conformal map that maps each 3D point to the corresponding 2D point - equivalent to the composition of a rotation, a flat proj onto the x-y plane, multiplication by a scalar and finally a translation (for ince). Google is choke-full of references for the more complex problem when the projection is perspective, but I've been unable to find sometng for ts simpler problem. Before trying to figure it out (and debug it) myself, I thought I might have a better chance by asking humans, but the appropriate newsgroup isn't obvious. Wle not 100% sure, I believe the flat projection removes the ambiguities of the perspective version of the problem. === Subject: Conference Announcement I would like to draw your attention of the following conference, Crystallography at the start of the 21st century: Mathematical and Symmetry Aspects as a satellite of the XXII European Crystallograpc Meeting (ECM-22) Ts satellite conference will consist of six thematic sessions (half a day per session). Registered participants are encouraged to submit poster presentations, wch will be on display during the whole satellite. Full papers are also welcome, and will be printed, after peer-review, in Zeitschrift fur Krystallography, together with the Proceedings, wch will consist of the texts of the six sessions. Details, including the program of the six sessions of the satellite, can be found at the following address: http://www.lcm3b.uhp-nancy.fr/mathcryst/satellite.htm We have done all the efforts to keep the costs at the minimal possible level, and thus the registration fees as low as possible. Even if you are not directly interested, I take the liberty of asking you to forward ts message to those colleagues of yours who may be interested. http://www.lcm3b.uhp-nancy.fr/mathcryst/satellite.htm === hj Subject: Re: fourier transforms... help!!! I was really surprised to see that so many people gave me an answer. By the way, I've just passed the exam with flying colors. Alejandro === Subject: [MuPad]Global Variables How does one declare global variables? (I've searched for 'global variables' in the help.) Raymond. === Subject: Re: [MuPad]Global Variables says... > How does one declare global variables? (I've searched for 'global variables' in the > help.) Raymond. > It looks to me (see the documentation under proc) that witn a procedure one declares *local* variables, wch would seem to imply that undeclared vars default to global (though I'm not sure of ts). See also the save keyword in a proc. Subject: Computer Algebra Algorithms Can anyone please point me to a good basic textbok or reference on computer algebra algorithms. I am mainly interested in writing C code for simple algebraic simplication. , M. G. === Subject: Re: Computer Algebra Algorithms > Can anyone please point me to a good basic textbok or reference on > computer algebra algorithms. I am mainly interested in writing C code > for simple algebraic simplication. , M. G. Computer Algebra by Davenport, Siret & Tournier. Mathematics for Computer Algebra by Mignotte. -- ^^^^^^^^^^^^^^^^^^ http://galileo.phys.virginia.edu/~jvn/ === Subject: Re: Computer Algebra Algorithms If you describe your application a little more, you will get more useful information. What, for example, is your data? polynomials? how many variables? exact coefficients? log, cos, sin? sqrt? Are you interested in the application, or are you interested in learning? Why are you using C? Can anyone please point me to a good basic textbok or reference on > computer algebra algorithms. I am mainly interested in writing C code > for simple algebraic simplication. , M. G. === Subject: do loops by support1.mathforum.org (8.11.6/8.11.6/The Math Forum, $Revision: 1.9 primary) id hB21lCg06943; I am trying to set up a look for Newtion's method for an iteration, for numerical methods. I have no idea how to get started. === Subject: Re: do loops I am trying to set up a look for Newtion's method for an iteration, > for numerical methods. I have no idea how to get started. Ts is OT here. Try sci.math.num-analysis. I also discuss it in my notes, Lectures in Computational Physics, that you can find as a *.pdf file on http://www.phys.virginia.edu/classes/551.jvn.fall01/ It's a bit long (about 5.8 Mb) but perhaps worth downloading if you are on a fst link. -- ^^^^^^^^^^^^^^^^^^ http://galileo.phys.virginia.edu/~jvn/ === Subject: Reply to Maple 9 Integration... by support1.mathforum.org (8.11.6/8.11.6/The Math Forum, $Revision: 1.9 primary) id hB2LOOq25793; some progress since the last time when I had the question. === Subject: spd proof by support1.mathforum.org (8.11.6/8.11.6/The Math Forum, $Revision: 1.9 primary) id hB62e3l11175; help!- I need to confirm that when A (nxn) is symmetric positive definite and Q(nxk) has full column rank, then T=(Q^T*A*Q) is also spd. if you could refer me to a text or website, that would be most helpful. === Subject: Re: spd proof help!- I need to confirm that when A (nxn) is symmetric positive > definite and Q(nxk) has full column rank, then T=(Q^T*A*Q) is also > spd. if you could refer me to a text or website, that would be most > helpful. Nobody replied because the proof is obvious: take the diagonal matrix element of T in ANY basis. It is manifestly > 0. QED. PDQ. -- ^^^^^^^^^^^^^^^^^^ http://galileo.phys.virginia.edu/~jvn/ === Subject: spd proof by support1.mathforum.org (8.11.6/8.11.6/The Math Forum, $Revision: 1.9 primary) id hB62e4R11214; I was hoping anyone could refer me to a text or website for: confirm that when A (nxn) is symmetric positive def (spd) and Q (nxk) === Subject: spd proof figured out by support1.mathforum.org (8.11.6/8.11.6/The Math Forum, $Revision: 1.9 primary) id hB7DWvk26247; Never mind. after much thought and tribulation, I figured it out... so, I won't need references or referrals. If anyone is curious, I can send them the proof.