In this thesis, a novel framework for the construction and analysis of strong linearizations for matrix polynomials is presented. Strong linearizations provide the standard means to transform polynomial eigenvalue problems into equivalent generalized eigenvalue problems while preserving the complete finite and infinite eigenstructure of the problem. After the transformation, the QZ algorithm or special methods appropriate for structured linearizations can be applied for finding the eigenvalues efficiently. The block Kronecker ansatz spaces proposed here establish an innovative and flexible approach for the construction of strong linearizations in the class of strong block minimal bases pencils. Moreover, they represent a new vector-space-setting for linearizations of matrix polynomials that additionally provides a common basis for various existing techniques on this task (such as Fiedler-linearizations). New insights on their relations, similarities and differences are revealed. The generalized eigenvalue problems obtained often allow for an efficient numerical solution. This is discussed with special attention to structured polynomial eigenvalue problems whose linearizations are structured as well. Structured generalized eigenvalue problems may also lead to equivalent structured (standard) eigenvalue problems. Thereby, the transformation produces matrices that can often be regarded as selfadjoint or skewadjoint with respect to some indefinite inner product. Based on this observation, normal matrices in indefinite inner product spaces and their spectral properties are studied and analyzed. Multiplicative and additive canonical decompositions respecting the matrix structure induced by the inner product are established. weiterlesen