Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.14612 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914395788935168 |
|---|---|
| author | Cheng, Daizhan |
| author_facet | Cheng, Daizhan |
| contents | A stationary value based algorithm (SVA) is provided to solve the nearest Kronecker product decomposition (KPD) problem of vector form hypermatrices. Using the algorithm successively, the finite sum KPD is also solved. Then the permutation matrix is introduced. Using it, the KPD of matrix form hypermatrices is converted to its equivalent KPD of vector forms, and then the SVA is also applicable to solve the same problems for vector form hypermatrix. Some numerical examples are presented to demonstrate the new algorithm and to compare it with existing methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14612 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Numerical Solution to KPD Cheng, Daizhan Numerical Analysis A stationary value based algorithm (SVA) is provided to solve the nearest Kronecker product decomposition (KPD) problem of vector form hypermatrices. Using the algorithm successively, the finite sum KPD is also solved. Then the permutation matrix is introduced. Using it, the KPD of matrix form hypermatrices is converted to its equivalent KPD of vector forms, and then the SVA is also applicable to solve the same problems for vector form hypermatrix. Some numerical examples are presented to demonstrate the new algorithm and to compare it with existing methods. |
| title | A Numerical Solution to KPD |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2603.14612 |