dc.contributor.author |
Volkov V. |
|
dc.contributor.author |
Dem’yanov D. |
|
dc.date.accessioned |
2020-01-21T20:40:39Z |
|
dc.date.available |
2020-01-21T20:40:39Z |
|
dc.date.issued |
2019 |
|
dc.identifier.issn |
0965-5425 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/157595 |
|
dc.description.abstract |
© 2019, Pleiades Publishing, Ltd. Abstract: The problem of solving overdetermined, underdetermined, singular, or ill conditioned SLAEs using matrix canonization is considered. A modification of an existing canonization algorithm based on matrix decomposition is proposed. Formulas using LU decomposition, QR decomposition, LQ decomposition, or singular value decomposition, depending on the properties of the given matrix, are obtained. A method for evaluating the condition number of the canonization problem is proposed. It is based on computing the norm of the matrices obtained as a result of canonization; this method does not require the original matrix to be inverted. A general step-by-step matrix canonization algorithm is described and implemented in MATLAB. The implementation is tested on a set of 100 000 randomly generated matrices. The testing results confirmed the validity and efficiency of the proposed algorithm. |
|
dc.relation.ispartofseries |
Computational Mathematics and Mathematical Physics |
|
dc.subject |
column space |
|
dc.subject |
condition number |
|
dc.subject |
LQ decomposition |
|
dc.subject |
LU decomposition |
|
dc.subject |
matrix canonization |
|
dc.subject |
nullspace |
|
dc.subject |
QR decomposition |
|
dc.subject |
row space |
|
dc.subject |
singular value decomposition |
|
dc.subject |
system of linear algebraic equations |
|
dc.subject |
tablet method |
|
dc.title |
Application of Matrix Decompositions for Matrix Canonization |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
11 |
|
dc.relation.ispartofseries-volume |
59 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
1759 |
|
dc.source.id |
SCOPUS09655425-2019-59-11-SID85076235075 |
|