On the inversion of polynomials of discrete Laplace matrices

Journal Article (2026)
Author(s)

S. S. Asghar (Universiteit Hasselt)

Q. Peng (Universiteit Leiden, Lancaster University)

F.J. Vermolen (University of Johannesburg, Universiteit Hasselt, TU Delft - Numerical Analysis)

Cornelis Vuik (TU Delft - Numerical Analysis)

Research Group
Numerical Analysis
DOI related publication
https://doi.org/10.1016/j.rinam.2026.100686
More Info
expand_more
Publication Year
2026
Language
English
Research Group
Numerical Analysis
Volume number
29
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on eigenvector and eigenvalue expansions. The method is consistent with previously known expressions of the inverse discretized Laplacian in one spatial dimension (Vermolen et al., 2022). The formalism is further extended to obtain closed form expressions for time-dependent problems.