# Simple algorithm for correction of a finite matrix group known   approximately

**Authors:** Andrey S. Mysovsky

arXiv: 1907.13543 · 2019-09-04

## TL;DR

This paper presents a simple iterative correction algorithm for reconstructing finite unitary matrix groups from approximate elements, ensuring consistency with group properties and additional conditions, implemented in open source Python.

## Contribution

Introduces a novel correction formula and iterative method for reconstructing finite matrix groups from approximate data, with practical implementation.

## Key findings

- Fast convergence of the correction algorithm.
- Effective reconstruction of group elements from approximate data.
- Open source Python implementation available.

## Abstract

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction formula for such group. When applied iteratively this formula gives fast convergence of the group elements and allows to perform the group reconstruction. Next we considered small unitary rotation of entire group which makes the group consistent with a set of additional conditions. For example, we might demand that group elements act on certain set of vectors in a predefined manner. Again, iterative procedure based on this correction shows fast convergence. All algorithms developed in this paper were implemented in a Python library which is available as open source software.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1907.13543/full.md

## Figures

3 figures with captions in the complete paper: https://tomesphere.com/paper/1907.13543/full.md

## References

12 references — full list in the complete paper: https://tomesphere.com/paper/1907.13543/full.md

---
Source: https://tomesphere.com/paper/1907.13543