Some algorithms of computer algebra
| dc.contributor.author | Porkuian, O. | |
| dc.contributor.author | Timoshyn, A. | |
| dc.contributor.author | Timoshyna, L. | |
| dc.date.accessioned | 2023-10-18T12:43:44Z | |
| dc.date.available | 2023-10-18T12:43:44Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | The article describes one of the methods for computing determinants without using fractions proposed by Bareiss. This problem has a clear algorithmic character in nature and refers to the field of computer algebra. The implementation of this algorithm is proposed in the known Maxima system of symbolic computations. In addition, this method makes it possible to get enough convenient formula for the calculation of the matrix of unitriangular transformation of a quadratic form to a canonical one. | |
| dc.identifier.citation | Porkuian O. Some algorithms of computer algebra / O. Porkuian, A. Timoshyn, L. Timoshyna // ТЕKA. Commission of motorization and energetics in agriculture. – 2016. – Vol. 16, No.2. – Р. 33-36 | |
| dc.identifier.uri | https://dspace.snu.edu.ua/handle/123456789/734 | |
| dc.language.iso | en | |
| dc.subject | computer algebra | |
| dc.subject | Maxima system | |
| dc.subject | determinant | |
| dc.subject | Bareiss algorithm | |
| dc.subject | a quadratic form | |
| dc.subject | unitriangular transformation | |
| dc.title | Some algorithms of computer algebra | |
| dc.type | Article |