Show simple item record

dc.contributor.authorFernández de Bustos, Igor
dc.contributor.authorGarcía Marina, Vanesa
dc.contributor.authorUrkullu Martín, Gorka
dc.contributor.authorAbasolo Bilbao, Mikel
dc.date.accessioned2019-01-14T13:03:32Z
dc.date.available2019-01-14T13:03:32Z
dc.date.issued2018-12-15
dc.identifier.citationJournal of Computational and Applied Mathematics 344 : 346-355 (2018)es_ES
dc.identifier.issn0377-0427
dc.identifier.issn1879-1778
dc.identifier.urihttp://hdl.handle.net/10810/30797
dc.description.abstractThe minimal least squares solutions is a topic of interest due to the broad range of applications of this problem. Although it can be obtained from other algorithms, such as the Singular Value Decomposition (SVD) or the Complete Orthogonal Decomposition (COD), the use of LDU factorizations has its advantages, namely the computational cost and the low fill-in that can be obtained using this method. If the right and left null-subspaces (which can also be named as Null and Image subspaces, respectively) are to be obtained, the use of these factorizations leads to fundamental subspaces, which are sparse by definition. Here an algorithm that takes advantage of both the Peters-Wilkinson method and Sautter method is presented. This combination allows for a good performance in all cases. The method also optimizes memory use by storing the right null-subspace and the left null-subspace in the factored matrix.es_ES
dc.description.sponsorshipThe authors wish to thank the Spanish Ministry of Economy and Competitiveness for its support through grant DPI2016-80372-R, which also includes funding through European FEDER program; and the Education Department of the Basque Government for its support through grant IT947-16.es_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.relationinfo:eu-repo/grantAgreement/DPI2016-80372-Res_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subjectminimum linear least squareses_ES
dc.subjectLDUes_ES
dc.subjectnull subspaceses_ES
dc.subjectlu factorizationes_ES
dc.subjectgenerationes_ES
dc.titleAn efficient LDU algorithm for the minimal least squares solution of linear systemses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.holderTheAuthor(s).PublishedbyElsevierB.V.Thisisanopenaccessarticleunderthe CCBY-NC-NDlicense(http://creativecommons.org/licenses/by-nc-nd/4.0/).es_ES
dc.rights.holderAtribución-NoComercial-SinDerivadas (cc by-nc-nd)*
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S0377042718303145?via%3Dihub#!es_ES
dc.identifier.doi10.1016/j.cam.2018.05.037
dc.departamentoesIngeniería mecánicaes_ES
dc.departamentoeuIngeniaritza mekanikoaes_ES


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

TheAuthor(s).PublishedbyElsevierB.V.Thisisanopenaccessarticleunderthe CCBY-NC-NDlicense(http://creativecommons.org/licenses/by-nc-nd/4.0/).
Except where otherwise noted, this item's license is described as TheAuthor(s).PublishedbyElsevierB.V.Thisisanopenaccessarticleunderthe CCBY-NC-NDlicense(http://creativecommons.org/licenses/by-nc-nd/4.0/).