Abstract
Implicit methods for time integration suffer from certain drawbacks when compared to explicit schemes, but have also their own advantages. Implicit programs are often characterized by a high degree of generality. The time step length is not so strongly limited by stability considerations and the cost of one time step is thus a not so critical criterion of performance. This allows for more frequent use of auxiliary memory, and thus a more flexible organization in the library of elements, and the size of the problems to be solved.
| Original language | English |
|---|---|
| Title of host publication | Comput Methods for Transient Anal |
| Publisher | North-Holland Comput Methods in Mech. v 1 Amsterdam, Neth and |
| Pages | 417-471 |
| Number of pages | 55 |
| ISBN (Print) | 0444864792 |
| State | Published - 1983 |
| Externally published | Yes |