Fast Parallel Matrix Inversion Algorithms (Q4124326)

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 3550178
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast Parallel Matrix Inversion Algorithms
    scientific article; zbMATH DE number 3550178

      Statements

      Fast Parallel Matrix Inversion Algorithms (English)
      0 references
      0 references
      1976
      0 references
      complexity
      0 references
      matrix inversion
      0 references
      solvability
      0 references
      system of n equations in n unknowns
      0 references
      determinant
      0 references
      characteristic polynomial
      0 references
      parallel algorithms
      0 references
      \(I(n)\), \(E(n)\), \(D(n)\) und \(P(n)\) bezeichnen der Reihe nach die Komplexität, um eine \(n\times n\)-Matrix zu invertieren, um ein Gleichungssystem mit \(n\) Gleichungen in \(n\) Unbekannten zu lösen, um die Determinante und das charakteristische Polynom einer \(n\times n\)-Matrix zu finden, wobei jeweils Parallelrechnung zugelassen ist. Gezeigt wird \(2\log n \le I(n), E(n), D(n), P(n) \le O(\log^2 n)\).
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references