SearcharxivSearch

arXiv subjects

Kobe Bruyninckx

Publications and source records attributed to Kobe Bruyninckx.

2 recordsLinked to original sources

Compact Rational Krylov for Parametrized Systems with Application to BEM Frequency Sweeping

In parametrized linear systems $\mathsf{P}(μ)\mathsf{x}=\mathsf{b}$ the system matrix $\mathsf{P}$ depends nonlinearly on a parameter $μ$ and solutions are sought for many values of this parameter. We show that the compact rational Krylov (CORK) framework, originally introduced to solve nonlinear eigenvalue problems, can be used to efficiently produce approximate solutions to such a system for many values of the parameter at once. In this approach, the parametrized system is first linearized, resulting in a large shifted linear system $(\boldsymbol{\mathsf{A}}-μ\boldsymbol{\mathsf{B}})\boldsymbol{\mathsf{y}}=\boldsymbol{\mathsf{d}}$. We formulate a left- and right-preconditioned rational Krylov GMRES method for shifted linear systems. In the setting of parametrized linear systems, these can exploit the structure in the linearization, and in combination with the CORK framework, computational and memory complexity mainly depend on the problem size, less the degree of the linearization. Additionally, we show how to incorporate a right-hand side $\mathsf{b}(μ)$ that also depends on the parameter, how to choose the shifts to steer convergence and how to allow for inexact solves at these shifts throughout the iterations. As an application we consider the 'frequency sweeping' of Helmholtz scattering problems through the Boundary Element Method (BEM), enabled via an efficient representation of the dense but data-sparse wavenumber-dependent system matrix.

math.NA

Uniform H-matrix Compression with Applications to Boundary Integral Equations

Boundary integral equations lead to dense system matrices when discretized, yet they are data-sparse. Using the $\mathcal{H}$-matrix format, this sparsity is exploited to achieve $\mathcal{O}(N\log N)$ complexity for storage and multiplication by a vector. This is achieved purely algebraically, based on low-rank approximations of subblocks, and hence the format is also applicable to a wider range of problems. The $\mathcal{H}^2$-matrix format improves the complexity to $\mathcal{O}(N)$ by introducing a recursive structure onto subblocks on multiple levels. However, in many cases this comes with a large proportionality constant, making the $\mathcal{H}^2$-matrix format advantageous mostly for large problems. In this paper we investigate the usefulness of a matrix format that lies in between these two: Uniform $\mathcal{H}$-matrices. An algebraic compression algorithm is introduced to transform a regular $\mathcal{H}$-matrix into a uniform $\mathcal{H}$-matrix, which maintains the asymptotic complexity. Using examples of the BEM formulation of the Helmholtz equation, we show that this scheme lowers the storage requirement and execution time of the matrix-vector product without significantly impacting the construction time.

math.NA