The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, based on symbolic computation, the Jacobi elliptic function rational expansion method is extended to uniformly construct more new exact solutions for the generalized derivative Schrodinger equation with nonlinear terms of any order. As a result, some new Jacobi elliptic function solutions are obtained. Of course, some new hyperbolic function solutions or triangular periodic function...
We describe the ideas behind the package `isometry', implemented in Maple to calculate isometry groups of dimensions 2, 3 and 4 in General Relativity. The package extends the functionality of previous programs written to perform invariant classification of space-times in General Relativity. Programming solutions used to surmount problems encountered with the calculation of eigenvectors and the determination...
Symbolic computation has experienced a distinct evolutionary path than numerical computation and this has prevented its proliferation in engineering. This paper offers a contemporary look at how the historical elements in symbolic computation has lead to a renewed interest symbolic in engineering modeling and simulation today. In particular symbolic techniques are showing promise for the modernization...
A noninductive method for mechanical theorem proving is presented, which deals with a recursive class of theorems involving iterative functions and predicates. The method is based on the symbolic evaluation of the formula to be proved and requires no inductive step. Induction is avoided since a metatheorem is proved which establishes the conditions on the evaluation of any formula which are sufficient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.