dc.contributor.author | Fernández de Bustos, Igor | |
dc.contributor.author | García Marina, Vanesa | |
dc.contributor.author | Urkullu Martín, Gorka | |
dc.contributor.author | Abasolo, Mikel | |
dc.date.accessioned | 2019-01-14T13:03:32Z | |
dc.date.available | 2019-01-14T13:03:32Z | |
dc.date.issued | 2018-12-15 | |
dc.identifier.citation | Journal of Computational and Applied Mathematics 344 : 346-355 (2018) | es_ES |
dc.identifier.issn | 0377-0427 | |
dc.identifier.issn | 1879-1778 | |
dc.identifier.uri | http://hdl.handle.net/10810/30797 | |
dc.description.abstract | The 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.sponsorship | The 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.iso | eng | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation | info:eu-repo/grantAgreement/DPI2016-80372-R | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.subject | minimum linear least squares | es_ES |
dc.subject | LDU | es_ES |
dc.subject | null subspaces | es_ES |
dc.subject | lu factorization | es_ES |
dc.subject | generation | es_ES |
dc.title | An efficient LDU algorithm for the minimal least squares solution of linear systems | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.holder | TheAuthor(s).PublishedbyElsevierB.V.Thisisanopenaccessarticleunderthe CCBY-NC-NDlicense(http://creativecommons.org/licenses/by-nc-nd/4.0/). | es_ES |
dc.rights.holder | Atribución-NoComercial-SinDerivadas (cc by-nc-nd) | * |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0377042718303145?via%3Dihub#! | es_ES |
dc.identifier.doi | 10.1016/j.cam.2018.05.037 | |
dc.departamentoes | Ingeniería mecánica | es_ES |
dc.departamentoeu | Ingeniaritza mekanikoa | es_ES |