Stability and accuracy of difference schemes for hyperbolic problems

Bounds for the error order and error constant of full- and semidiscretizations of hyperbolic problems are given. In order to be able to compare fulldiscretizations a scaling is introduced. This scaling reflects the amount of work needed to perform one time step. Using the semidiscretization associated with the fulldiscretization lower bounds for these scaled error constants are given. These results are derived using the order star technique.