A numerical experiment with huang algorithm

dc.creatorEsmaeili, Hamid
dc.date.accessioned2019-07-03T16:35:08Z
dc.date.accessioned2022-09-21T16:25:25Z
dc.date.available2019-07-03T16:35:08Z
dc.date.available2022-09-21T16:25:25Z
dc.date.created2019-07-03T16:35:08Z
dc.date.issued2007
dc.identifierhttps://repositorio.unal.edu.co/handle/unal/73608
dc.identifierhttp://bdigital.unal.edu.co/38084/
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3392608
dc.description.abstractIt is believed that the Huang method is the best one to solve a system of linear equations in the class of ABS methods. Having presented 10 versions of the Huang method and compared them numerically, we will compare the best version of the Huang method with LU (along with partial pivoting) and QR (through Householder transformations) methods. Numerical results show that all three methods yield approximately similar output in well-conditioned problems while the Huang method works more effectively in ill-conditioned problems.
dc.languagespa
dc.publisherBoletín de Matemáticas
dc.relationUniversidad Nacional de Colombia Revistas electrónicas UN Boletín de Matemáticas
dc.relationBoletín de Matemáticas
dc.relationBoletín de Matemáticas; Vol. 14, núm. 1 (2007); 1-13 Boletín de Matemáticas; Vol. 14, núm. 1 (2007); 1-13 2357-6529 0120-0380
dc.relationEsmaeili, Hamid (2007) A numerical experiment with huang algorithm. Boletín de Matemáticas; Vol. 14, núm. 1 (2007); 1-13 Boletín de Matemáticas; Vol. 14, núm. 1 (2007); 1-13 2357-6529 0120-0380 .
dc.relationhttp://revistas.unal.edu.co/index.php/bolma/article/view/40455
dc.rightsAtribución-NoComercial 4.0 Internacional
dc.rightshttp://creativecommons.org/licenses/by-nc/4.0/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsDerechos reservados - Universidad Nacional de Colombia
dc.titleA numerical experiment with huang algorithm
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución