|
D.15.5.16 timestep
Procedure from library finitediff.lib (see finitediff_lib).
- Usage:
- timestep(M); M a square matrix with polynomials over the basering as entries;
- Return:
- type list; gives two matrices M1,M2 that are the splitting of M with respect to the degree of the variable t in the entries, where the first list-entry M1 consists of the polynomials of the highest timelevel and M2 of the lower levels in the form: M=0 => M1=M2, i.e. M1-M2=M
- Note:
- intended to be used for the finite-difference-scheme-construction and partition into the several time steps
Example:
|