A unified set of single step algorithms. Part 1: General formulation and applications (Q3221295)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3888821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified set of single step algorithms. Part 1: General formulation and applications |
scientific article; zbMATH DE number 3888821 |
Statements
A unified set of single step algorithms. Part 1: General formulation and applications (English)
0 references
1984
0 references
single step algorithms
0 references
time marching scheme
0 references
diffusion equations
0 references
Newmark algorithm
0 references
0.8386256098747253
0 references
0.8349278569221497
0 references
0.7869769930839539
0 references
0.776708722114563
0 references
A general algorithm for the numerical solution of systems of the type (1) Mẍ\(+C\dot x+Kx=f\) or (2) Mẍ\(+C\dot xP(x)=f\) in a single time interval [0,\(\Delta\) t] is presented. The order of equation (1) or (2) may be one when the matrix \(M=0\). The solution x is approximated by a polynomial \[ y(t)=\sum^{p-1}_{q=0}x^ q_ n\frac{t^ q}{q!}+\alpha_ n^{(p)\quad}\frac{t^ p}{p!} \] where the values \(x_ n\) of the function x and its derivatives at the starting point \(t=0\) are given and the vector \(\alpha_ n^{(p)}\) is determined. The authors obtain different algorithms using different p and different methods to evaluate the \(\alpha_ n^{(p)}\). The presented algorithm is easily programmed and covers most of the currently used schemes as well as presenting many new possibilities. The authors consider also some particular forms of the general algorithm.
0 references