RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2019 Volume 59, Number 11, Pages 1823–1835 (Mi zvmmf10976)

This article is cited in 3 papers

Application of matrix decompositions for matrix canonization

V. G. Volkov, D. N. Demyanov

Naberezhnye Chelny Institute, Branch of Kazan Federal University, Naberezhnye Chelny, 423812 Russia

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.

Key words: system of linear algebraic equations, matrix canonization, tablet method, singular value decomposition, QR decomposition, LQ decomposition, LU decomposition, condition number, nullspace, row space, column space.

UDC: 519.61

Received: 04.03.2019
Revised: 04.03.2019
Accepted: 08.07.2019

DOI: 10.1134/S0044466919110152


 English version:
Computational Mathematics and Mathematical Physics, 2019, 59:11, 1759–1770

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024