Explicit expression and fast algorithms for the inverse of some matrices arising from implicit time integration
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913464644009984 |
|---|---|
| author | Shishun, Li Huile, Wei |
| author_facet | Shishun, Li Huile, Wei |
| contents | In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit Runge-Kutta schemes and block implicit methods, can also be explicitly determined. Adiitionally, we introduce three fast algorithms for computing the elements of the inverse of these matrices in $O(n^2)$ arithmetic operations, i.e., the first one is based on Traub algorithm for fast inversion of Vandermonde matrices, while the other two utilize the special structure of the matrices. Finally, some symbolic and numerical results are presented to show that our algorithms are both highly efficient and accurate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_04316 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Explicit expression and fast algorithms for the inverse of some matrices arising from implicit time integration Shishun, Li Huile, Wei Numerical Analysis In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit Runge-Kutta schemes and block implicit methods, can also be explicitly determined. Adiitionally, we introduce three fast algorithms for computing the elements of the inverse of these matrices in $O(n^2)$ arithmetic operations, i.e., the first one is based on Traub algorithm for fast inversion of Vandermonde matrices, while the other two utilize the special structure of the matrices. Finally, some symbolic and numerical results are presented to show that our algorithms are both highly efficient and accurate. |
| title | Explicit expression and fast algorithms for the inverse of some matrices arising from implicit time integration |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2408.04316 |