Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array
© 2016 Elsevier B.V. There are a number of relevant physical problems in which their problem domains consist of the repetition of a given subdomain. The traditional multi-frontal solver implementations, like MUMPS or SuperLU, get on the input the global sparse linear system of equations. They are no...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier Ltd
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/72836 |
| _version_ | 1848762854095716352 |
|---|---|
| author | Martinez-Fernandez, I. Wozniak, M. Garcia-Castillo, L. Paszynski, Maciej |
| author_facet | Martinez-Fernandez, I. Wozniak, M. Garcia-Castillo, L. Paszynski, Maciej |
| author_sort | Martinez-Fernandez, I. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | © 2016 Elsevier B.V. There are a number of relevant physical problems in which their problem domains consist of the repetition of a given subdomain. The traditional multi-frontal solver implementations, like MUMPS or SuperLU, get on the input the global sparse linear system of equations. They are not aware of the structure of the computational mesh. They do not know that some parts of the mesh, i.e., some sub-domains are identical. In such a case, some sub-matrices of the global matrix are identical. However, when we assemble the matrices corresponding to identical sub-domains into a global sparse system, they overlap, and we ignore that they corresponded to identical sub-domains. In this paper we advocate another approach to this computational problem, based on the additional knowledge of the structure of the computational mesh. We propose a wrapper over a multi-frontal solver that partitions the computational problem into a cascade of sub-problems, for which a traditional multi-frontal solver is called and asked for the Schur complements. Such solver wrapper can massively reuse computations performed over identical sub-domains, as well as it can propagate this reuse technique towards further elimination steps. We test our reuse solver on a problem consisting of an arrays of antennas and compare it against the execution time of a traditional sparse matrix-based multi-frontal solver called for the entire domain. |
| first_indexed | 2025-11-14T10:54:11Z |
| format | Journal Article |
| id | curtin-20.500.11937-72836 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:54:11Z |
| publishDate | 2017 |
| publisher | Elsevier Ltd |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-728362018-12-13T09:33:49Z Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array Martinez-Fernandez, I. Wozniak, M. Garcia-Castillo, L. Paszynski, Maciej © 2016 Elsevier B.V. There are a number of relevant physical problems in which their problem domains consist of the repetition of a given subdomain. The traditional multi-frontal solver implementations, like MUMPS or SuperLU, get on the input the global sparse linear system of equations. They are not aware of the structure of the computational mesh. They do not know that some parts of the mesh, i.e., some sub-domains are identical. In such a case, some sub-matrices of the global matrix are identical. However, when we assemble the matrices corresponding to identical sub-domains into a global sparse system, they overlap, and we ignore that they corresponded to identical sub-domains. In this paper we advocate another approach to this computational problem, based on the additional knowledge of the structure of the computational mesh. We propose a wrapper over a multi-frontal solver that partitions the computational problem into a cascade of sub-problems, for which a traditional multi-frontal solver is called and asked for the Schur complements. Such solver wrapper can massively reuse computations performed over identical sub-domains, as well as it can propagate this reuse technique towards further elimination steps. We test our reuse solver on a problem consisting of an arrays of antennas and compare it against the execution time of a traditional sparse matrix-based multi-frontal solver called for the entire domain. 2017 Journal Article http://hdl.handle.net/20.500.11937/72836 10.1016/j.jocs.2016.10.008 Elsevier Ltd restricted |
| spellingShingle | Martinez-Fernandez, I. Wozniak, M. Garcia-Castillo, L. Paszynski, Maciej Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title | Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title_full | Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title_fullStr | Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title_full_unstemmed | Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title_short | Mesh-based multi-frontal solver with reuse of partial LU factorizations for antenna array |
| title_sort | mesh-based multi-frontal solver with reuse of partial lu factorizations for antenna array |
| url | http://hdl.handle.net/20.500.11937/72836 |