Global Matrix Decomposition Algorithm

From GM-RKB
(Redirected from global matrix factorization)
Jump to navigation Jump to search

A Global Matrix Decomposition Algorithm is a Matrix Decomposition Algorithm that is a Global Data Algorithm.



References

2014

2011

  • (Lin & Pomerleano, 2011) ⇒ Kevin H. Lin, and Daniel Pomerleano. (2011). “Global matrix factorizations." arXiv preprint arXiv:1101.5847.
    • ABSTRACT: We study matrix factorization and curved module categories for Landau-Ginzburg models (X,W) with X a smooth variety, extending parts of the work of Dyckerhoff. Following Positselski, we equip these categories with model category structures. Using results of Rouquier and Orlov, we identify compact generators. Via To\"en's derived Morita theory, we identify Hochschild cohomology with derived endomorphisms of the diagonal curved module; we compute the latter and get the expected result. Finally, we show that our categories are smooth, proper when the singular locus of W is proper, and Calabi-Yau when the total space X is Calabi-Yau.

1990