Open Access Open Access  Restricted Access Subscription or Fee Access

A Detailed Step-By-Step Procedure on Finding the Square Root of a 4 × 4 Positive Definite Symmetric Matrix for Engineering Applications



The main focus of this study is to present a detailed step by step procedure to determine the square root of a symmetric positive definite non-singular matrix. The procedure involved four steps which are Gram–Schmidt orthogonalization, Schur form, U matrix, and square root of matrix, which are discussed in this study. Few examples are solved to learn and practice. Necessary checks were performed, and the results show that the square root matrix is correct.

Full Text:



Bjorck A, Hammarling S. A Schur method for the square root of a matrix. Linear Algebra Appl. 1983; 52/53: 127–140p. Elsevier Science Publishing Co., Inc., 1983

Manninen P, Oster P (Eds.). PARA 2012, LNCS 7782. Berlin, Heidelberg: Springer-Verlag; 2013, pp. 171–182.

Deadman E, Higham N, Ralha R. Blocked Algorithms for the Matrix Square Root. Numerical Algorithms Group, University of Manchester; 2012.

Franca LP. An algorithm to compute the square root of a 3x3 positive definite matrix. Comput Math Appl. 1989; 1(5): 459–466p.

Deadman E, Higham NJ, Ralha R. A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root. University of Manchester. 2012. MIMS EPrint: 2012.26.

Rhudy M, Gu Y, Gross J, Napolitano MR. Evaluation of matrix square root operations for UKF within a UAV GPS/INS sensor fusion application. Int J Navig Observ. 2011; 2011. Hindawi Publishing Corporation. doi:10.1155/2011/416828.

Song X, Zhang Y, Liang D. Input Forces Estimation for nonlinear systems by applying a square-root cubature Kalman filter. Materials. 2017; 10: 1162p. Doi:10.3390/ma10101162. Available from


  • There are currently no refbacks.