In an earlier paper published in the Journal of Natural Sciences Research in 2015 on how to balance chemical equations using matrix algebra, Gabriel and Onwuka showed how to reduce the resulting matrix to echelon form...In an earlier paper published in the Journal of Natural Sciences Research in 2015 on how to balance chemical equations using matrix algebra, Gabriel and Onwuka showed how to reduce the resulting matrix to echelon form using elementary row operations. However, they did not show how elementary row operations can be used in reducing the resulting echelon matrix to row reduced echelon form. We show that the solution obtained is actually the nullspace of the matrix. Hence, the solution can be infinitely many. In addition, we show that instead of manually using row operations to reduce the matrix to row reduced echelon form, software environments like octave or Matlab can be used to reduce the matrix directly. In all the examples presented in this paper, we reduced all matrices to row reduced echelon form showing all row operations, which was not clearly stated in the Gabriel and Onwuka paper. Most importantly, with the availability of Mathematical software, we show that we do not need to carry out these row operations by brute force.展开更多
In computing the desired complex eigenpair of a matrix, we show that by adding Ruhe’s normalization to the matrix pencil, we obtain a square nonlinear system of equations. In this work, we show that the corresponding...In computing the desired complex eigenpair of a matrix, we show that by adding Ruhe’s normalization to the matrix pencil, we obtain a square nonlinear system of equations. In this work, we show that the corresponding Jacobian is non-singular at the root and that with an appropriately chosen initial guesses, Ruhe’s normalization with a fixed complex vector not only converges quadratically but also faster than the earlier Algorithms for the numerical computation of the complex eigenpair of a matrix. The mathematical tools used in this work are Newton and Gauss-Newton’s methods.展开更多
文摘In an earlier paper published in the Journal of Natural Sciences Research in 2015 on how to balance chemical equations using matrix algebra, Gabriel and Onwuka showed how to reduce the resulting matrix to echelon form using elementary row operations. However, they did not show how elementary row operations can be used in reducing the resulting echelon matrix to row reduced echelon form. We show that the solution obtained is actually the nullspace of the matrix. Hence, the solution can be infinitely many. In addition, we show that instead of manually using row operations to reduce the matrix to row reduced echelon form, software environments like octave or Matlab can be used to reduce the matrix directly. In all the examples presented in this paper, we reduced all matrices to row reduced echelon form showing all row operations, which was not clearly stated in the Gabriel and Onwuka paper. Most importantly, with the availability of Mathematical software, we show that we do not need to carry out these row operations by brute force.
文摘In computing the desired complex eigenpair of a matrix, we show that by adding Ruhe’s normalization to the matrix pencil, we obtain a square nonlinear system of equations. In this work, we show that the corresponding Jacobian is non-singular at the root and that with an appropriately chosen initial guesses, Ruhe’s normalization with a fixed complex vector not only converges quadratically but also faster than the earlier Algorithms for the numerical computation of the complex eigenpair of a matrix. The mathematical tools used in this work are Newton and Gauss-Newton’s methods.
