Skip to main content
Wiley Open Access Collection logoLink to Wiley Open Access Collection
. 2021 Sep 8;37(10):e3522. doi: 10.1002/cnm.3522

Space–time shape uncertainties in the forward and inverse problem of electrocardiography

Lia Gander 1, Rolf Krause 1, Michael Multerer 1, Simone Pezzuto 1,
PMCID: PMC9285968  PMID: 34410040

Abstract

In electrocardiography, the “classic” inverse problem is the reconstruction of electric potentials at a surface enclosing the heart from remote recordings at the body surface and an accurate description of the anatomy. The latter being affected by noise and obtained with limited resolution due to clinical constraints, a possibly large uncertainty may be perpetuated in the inverse reconstruction. The purpose of this work is to study the effect of shape uncertainty on the forward and the inverse problem of electrocardiography. To this aim, the problem is first recast into a boundary integral formulation and then discretised with a collocation method to achieve high convergence rates and a fast time to solution. The shape uncertainty of the domain is represented by a random deformation field defined on a reference configuration. We propose a periodic‐in‐time covariance kernel for the random field and approximate the Karhunen–Loève expansion using low‐rank techniques for fast sampling. The space–time uncertainty in the expected potential and its variance is evaluated with an anisotropic sparse quadrature approach and validated by a quasi‐Monte Carlo method. We present several numerical experiments on a simplified but physiologically grounded two‐dimensional geometry to illustrate the validity of the approach. The tested parametric dimension ranged from 100 up to 600. For the forward problem, the sparse quadrature is very effective. In the inverse problem, the sparse quadrature and the quasi‐Monte Carlo method perform as expected, except for the total variation regularisation, where convergence is limited by lack of regularity. We finally investigate an H1/2 regularisation, which naturally stems from the boundary integral formulation, and compare it to more classical approaches.

Keywords: H1/2 regularisation, boundary integral formulation, inverse problem of electrocardiography, quasi‐Monte Carlo method, space‐time shape uncertainty, sparse quadrature


The solution to the forward and inverse problems of electrocardiography requires a description of the torso anatomy. The latter varies over time and is source of uncertainty, since it is obtained from images with limited resolution. We study the effect of the space–time shape uncertainty on the forward and inverse solutions. The uncertainty is represented by a random deformation field with high‐dimensional Karhunen–Loève expansion. Therefore, we employ the anisotropic sparse quadrature to estimate our quantities of interest.

graphic file with name CNM-37-0-g003.jpg

1. INTRODUCTION

Electrocardiographic recordings at the body surface, such as the standard 12‐lead electrocardiogram (ECG), are a direct consequence of the electric activity of the heart. The spatial resolution of such recordings depends on the number of electrodes placed on the chest, ranging from no more than 10 of the standard ECG to hundreds of electrodes composing high‐density body surface potential maps (BSPMs). Along with an accurate description of the torso anatomy, BSPMs are sufficiently informative to enable a non‐invasive characterisation of cardiac electrophysiology, termed ECG imaging. 1 ECG imaging technologies have been extensively validated in experimental, animal and, more recently, clinical settings, with promising results. 2

The ECG imaging problem can mathematically be formulated as an inverse problem. The most classical formulation of it is associated with a potential‐based forward problem, which amounts to determining the BSPM on the chest from the electric potential at a surface enclosing the heart, for example, the epicardium. The inverse problem of electrocardiography consists therefore in recovering the epicardial potential from the BSPM. 3 As typical for inverse problems, however, the ECG imaging problem is severely ill‐posed in the sense of Hadamard, since arbitrarily small perturbations of the BSPM, such as noise, may yield large variations in the epicardial potential. It thus requires regularisation to penalise non‐physical solutions and a strategy to optimally select the associated regularisation parameter. For the ECG inverse problem, several kinds of regularisations have been proposed over the last three decades, see Reference 4 for a review. The standard Tikhonov regularisations of zeroth, first or second order 3 , 5 are easy to implement thanks to the closed‐form solution of the quadratic inverse problem. Closely related to the Tikhonov regularisation is the generalised truncated singular value decomposition, in which small singular values of the forward operator are filtered out. 6 The inverse problem can also be interpreted from a Bayesian perspective. 7 In this case, the maximum a posteriori estimator, which matches the classical Tikhonov solution under the usual hypothesis of a standard Gaussian prior distribution, offers more flexibility in embodying prior knowledge in the inverse problem, for example, from a training data set. Non‐smooth regularisations such as total variation (TV) are a valid alternative to quadratic approaches in the presence of sharp gradients in the reconstructed data, 8 but lead to a significantly more difficult solution of the inverse problem. Approximated or smoothed versions of TV are therefore popular. 4 More recently, physiology‐based and spatio‐temporal regularisation approaches have also been considered. 9 , 10

The potential‐based forward problem is particularly attractive when the torso is assumed as a homogeneous electric conductor. Then, the forward problem can be conveniently recast into an integral formulation involving only the boundaries of the torso, that is, the epicardium and the chest, with no need of solving the problem in the full three‐dimensional (3D) domain. 11 , 12 The numerical treatment of the boundary formulation is however less practical than a standard finite element approach in 3D, as it requires special care in the treatment of singular boundary integrals on piecewise smooth surfaces, like triangulated surfaces obtained from the segmentation of cardiac images. Acquired with given clinical constraints, imaging data are typically of limited resolution and noisy. Therefore, the segmentation of selected cavities is challenging and certainly subject to uncertainty. In the case of the heart, segmentation is made even more difficult by the movement of the organ. As a consequence, the resulting segmentation is subject to time‐dependent shape uncertainty. This uncertainty in the anatomy propagates through the solution of the inverse problem, resulting in a reconstruction also affected by uncertainty.

In spite of its acknowledged importance, 13 uncertainty quantification in the context of cardiac modelling has emerged only very recently, see for example References 14, 15, 16, 17. In electrocardiography, the most relevant uncertainty to account for is in the body surface electric recordings. Within a Bayesian framework, the inverse problem maps a prior distribution of the pericardial potentials into a posterior distribution, which also accounts for noise in the input data through the likelihood. 7 Model uncertainty has been considered as well. The electric conductivity of the torso is highly heterogeneous, for example, lungs, blood masses, interstitial tissue, muscles and bones significantly differ in terms of conduction, and uncertain, which may influence the reconstruction as well. 18 , 19 In the present context, shape uncertainty has however received very limited attention thus far, despite preliminary studies showed a non‐negligible impact on the inverse reconstruction. 20 , 21

From the mathematical perspective, sophisticated tools and theory for the treatment of shape uncertainties are already available. Besides the fictitious domain approach considered in Reference 22, one typically distinguishes two approaches to deal with shape uncertainties: the perturbation method, see Reference 23 and the references therein, which is suitable to treat small perturbations of the nominal shape and the domain mapping method, see References 24, 25, 26, 27. Here, we focus on the more flexible domain mapping approach. Then, the computation of quantities of interest, such as expectation and variance of the potential, gives rise to high dimensional quadrature problems for the random parameters. Given sufficient parametric regularity, sophisticated sparse quadrature and quasi‐Monte Carlo methods, see for example References 28, 29, 30, 31, 32, can be applied. If such regularity is not present, one has to resort to the only slowly converging, Monte Carlo method.

This work aims at evaluating the impact of space–time uncertainty on the forward and inverse problems of electrocardiography. To model the shape uncertainty, we consider a space–time reference geometry and a random deformation field, that we represent by its Karhunen–Loève expansion. The covariance of the random deformation field depends on both space and time and accounts for the periodicity of the motion of the heart. Furthermore, we formulate the forward problem as a boundary integral equation by assuming a constant torso conductivity. We refer to Reference 12 for all the details of this approach and in particular for the applied discretisation. The boundary integral formulation is particularly suitable for our purpose, because both input data and observations are confined to a surface, these are the pericardium and the chest, respectively. In order to accelerate the computation of quantities of interest, we discretise the spatial problem with a rapidly converging collocation method, achieving high accuracy already with a relatively coarse mesh, while the deformation field is approximated by an efficient low‐rank technique.

In order to assess the effect of the shape uncertainty, we estimate the expectation and the variance of the chest potential (forward problem) and the pericardial potential (inverse problem) using the anisotropic sparse quadrature method from Reference 28. This approach is validated against the quasi‐Monte Carlo method based on Halton points, see Reference 32. The inverse problem, known to be severely ill‐posed, needs an adequate regularisation. We employ classic regularisations proposed specifically for our problem of interest, such as zero order Tikhonov, the first‐order Tikhonov and TV. 4 The implication of the choice of the regularisation on the convergence rate of the sparse quadrature is also analysed. Finally, we explore an H1/2 regularisation, see References 33, a natural option stemming from the boundary integral formulation of the problem itself.

The paper is organised as follows. In section 2, we introduce the mathematical description of the problem at hand. Section 3 provides the corresponding boundary integral formulation and the discretisation of the involved boundary integral operators. The different regularisation methods for the inverse problem are presented in section 4. Section 5, dedicated to modelling shape uncertainty, is the cornerstone of the present work. Finally, section 6 is devoted to the numerical assessment of a two‐dimensional, Cine Magnetic Resonance Imaging (MRI)‐derived geometry. Herein, we validate the sparse quadrature and we quantify the effect of the shape uncertainty on the forward and inverse problems.

2. PROBLEM FORMULATION

2.1. The forward problem of electrocardiography

Mathematically, we start from a smooth domain Dd representing the torso, whose boundaries are the chest denoted by Γ and the pericardium denoted by . In other words, we have D=Γ and Γ=, see Figure 1 for a visualisation of the domain.

FIGURE 1.

FIGURE 1

2D cross section of the torso reconstructed from an MRI dataset

The pericardium depends periodically on time and is subject to uncertainty. To model the time‐dependence, let 0,T be the time interval of interest, where T>0 is the duration of one heartbeat. To model the uncertainty, let Ω denote a complete and separable probability space, where Ω is a sample space, 2Ω is a σ‐field and :0,1 is a probability measure. In what follows, we write tω with t0,T and ωΩ to indicate the dependence of the pericardium on time and on the random parameter. Obviously, the time‐dependence and the shape uncertainty of the heart also affect the torso, which we denote by Dtω, while we assume the chest Γ to be fixed over time and not being subject to uncertainty.

In the forward problem, given the potential ut:tω at the pericardium, we wish to compute the potential on the chest Γ. Assuming that the torso is a homogeneous volume conductor and that no current sources are present, the extracellular potential yt,ω:Dt,ωR in the whole torso satisfies the mixed boundary value problem

Δyx,t,ω=0,xDtω,ynxx,t,ω=0,xΓ,yx,t,ω=ux,t,xtω. (1)

We remark that in the model the electric conductivity is unit valued, with no loss of generality since its value, being constant, does not influence the solution. Moreover, we assume here that the potential ux,t is given in spatial coordinates. A possibility to guarantee that ux,t is well‐defined for each realisation of the random parameter is to assume that it is given with respect to the hold‐all domain

Dt0,T,ωΩDtω¯×t,

which contains every possible space–time tube.

2.2. The inverse problem of electrocardiography

Given the data ydt:Γ on the chest, the inverse problem corresponding to (1) is to find the potential utω:tω at the pericardium that satisfies

minutωL2tωytωydtL2Γs.t.Equation1holds.

In the forward problem, if utH1/2tω, then the solution satisfies ytωH1Dtω and its trace on Γ is in H1/2Γ. This gives rise to the solution operator

Atω:H1/2tωH1/2Γ.

It is possible to show, see Reference 3, that Atω is injective and continuous for t0,T and almost every ωΩ. In the inverse problem, therefore, if ydtH1/2Γ then there exists a unique minimum utωH1/2tω such that ytω=ydt at Γ. The minimum utω, however, is not stable with respect to perturbations. A common practice is to introduce a regularisation into the problem to recover stability, as follows:

minutωL2tω12AtωutωydtL2Γ2+λ2(u(tω)).

Herein, λ>0 is the regularisation parameter and is the regularisation functional, for which several choices are possible. The optimum can be explicitly computed according to

AtωutωydtAtωδuL2Γ+λutωδu=0,δuL2tω.

Later on we shall discuss different options for the regularisation.

3. BOUNDARY INTEGRAL FORMULATION

3.1. Boundary integral operators

In the following exposition, for the sake of an easier notation, we consider t and ω to be fixed. For a comprehensive exposition of the boundary integral approach, we refer the reader of Reference 12. For a better distinction of quantities that are defined with respect to the boundaries and those which are given on the domain, we introduce for ΦΓD the trace operators

γ0,Φint:H1DH1/2Φandγ1,Φint:H1DH1/2Φ.

Then, we may write the forward problem according to

Δyx=0,xD,γ1,Γintyx=0,xΓ,γ0,intyx=ux,x.

For xD, the potential yx is given by the representation formula

yx=DGx,xγ1,DintyxdσxDGnxx,xγ0,Dintyxdσx, (2)

where

Gx,x12πlogxx2,d=2,14π1xx2,d=3, (3)

denotes the fundamental solution for the Laplacian. Introducing the single layer operator

V:H1/2DH1/2D,VρxDGx,xρxdσx,

the double layer operator

K:H1/2DH1/2D,KρxDGnxx,xρxdσx

and taking the Dirichlet trace, Equation (2) yields the Dirichlet‐to‐Neumann map

Vγ1,Dinty=12I+Kγ0,Dinty. (4)

Next, introducing for Φ,ΨΓ, the restricted operators

VΦΨ:H1/2ΨH1/2Φ,ΦxVΦΨρxΨGx,xρxdσx

and

KΦΨ:H1/2ΨH1/2Φ,ΦxΦΨρxΨGnx'x,xρxdσx,

we can split up Equation (4) into the system

V∑∑V∑ΓVΓ∑VΓΓγ1,intyγ1,Γinty=12I+K∑∑K∑ΓKΓ∑12I+KΓΓγ0,intyγ0,Γinty.

Rearranging this system in order to move the unknowns γ1,inty and γ0,Γinty to the left side and the data γ0,inty=u and γ1,Γinty=0 to the right side, we arrive at the system boundary integral equations

V∑∑K∑ΓVΓ∑12I+KΓΓγ1,intyγ0,Γinty=12I+K∑∑V∑ΓKΓ∑VΓΓu0. (5)

As V∑∑ is an elliptic operator, considering the Schur complement

S:H1/2ΓH1/2Γ,Sρ12I+KΓΓVΓ∑V∑∑1K∑Γρ

yields the operator equation

Sγ0,Γinty=12VΓ∑V∑∑1+VΓ∑V∑∑1K∑∑KΓ∑u

for the desired potential γ0,Γinty on the chest. In particular, the solution operator A:H1/2H1/2Γ is given by

Au=S112VΓ∑V∑∑1+VΓ∑V∑∑1K∑∑KΓ∑u=γ0,Γinty, (6)

while the Poincaré–Steklov operator :H1/2H1/2 is given by

u=V∑∑112I+K∑∑+K∑ΓAu=γ1,inty. (7)

3.2. Numerical discretisation

Our goal is to discretise the boundary integral equations derived previously. In order to not having to deal with non‐constant coefficients, we shall solve the equations in the spatial coordinate frame, that is, for each tuple tω, assemble the boundary integral operators on tω and Γ. To simplify the notation, in the following quantities we omit the dependency of on t and ω. As the focus of this work is on uncertainty quantification, rather than on the solution of the spatial problem, we restrict ourselves to the simplified 2D anatomy of Figure 1. Hence, from (3), we have

Gx,x=12πlogxx2

and

Gnx'x,x=12πx'logxx2nx'=12πxxnx'2xx22.

Given that the domain Dtω exhibits C2‐boundaries, which are described by the parameterisations γ:0,1tω and γΓ:0,1Γ, we can employ the collocation method from Reference 12. This method is based on the trapezoidal rule and an appropriate desingularisation of the kernel functions. In view of the Euler‐Maclaurin formula, it converges quadratically for C2‐boundaries and exponentially for smooth boundaries. More precisely, given that the solution to (5) satisfies yCkD, there holds

yynLDCnkyCkD

for some C>0, where yn is obtained from the collocation method with n=2j points for some j. We refer to Reference 12 for all the details. For the sake of completeness, we briefly recall the collocation method in Appendix A.

For ΦΓ, we consider the nΦ‐points discretisations si,Φ=i/nΦ for i=0,,nΦ1. Moreover, we denote by InΦnΦ×nΦ the nΦ×nΦ identity matrix. The discretisation results in the block linear system

V∑∑K∑ΓVΓ∑12InΓ+KΓΓρ˜1,ρ0,Γ=12In+K∑∑V∑ΓKΓ∑VΓΓu0nΓ, (8)

cp. (5). Herein

ρ0,ΓyγΓsi,Γi=0nΓ1nΓandρ˜1,ynsi,γsi,γsi,2i=0n1n.

Furthermore, we set

uuγsi,i=0n1n

and 0nΓnΓ is the nΓ‐dimensional vector of zeros.

4. SOLUTION OF THE INVERSE PROBLEM

In the inverse problem, the goal is to reconstruct the potential u at the pericardium tω given noisy data measurements ydH1/2Γ on the chest. In the following exposition, for the sake of an easier notation, we indicate the dependency of on the tuple tω only when specifying function spaces. In particular, we consider the solution operator A:H1/2tωH1/2Γ, cp. (6), and the Poincaré–Steklov operator :H1/2tωH1/2tω, cp. (7). In the discrete setting, we define the vectors

uuγsi,i=0n1n,ydydγΓsi,Γi=0nΓ1nΓ

and

ρ0,ΓyγΓsi,Γi=0nΓ1nΓ,ρ1,ynsi,γsi,i=0n1n.

From (8), we deduce that there exist a matrix AnΓ×n and a matrix Bn×n such that

ρ0,Γ=Auandρ1,=Bu.

In this section, we consider inverse problem solutions of the form

u=argminvL2tω12AvydL2Γ2+λ2v, (9)

where λ>0 is the regularisation parameter and is the regularisation functional. We discretise (9) employing, for ΦΓ, the trapezoidal rule

v,wL2ΦvSΦwwithvvγΦsi,Φi=0nΦ1,wwγΦsi,Φi=0nΦ1,

where SΦnΦ×nΦ is the diagonal mass matrix with entries

SΦi,iγΦ'si,Φ2nΦ

for i=0,,nΦ1. The accuracy of this approximation is consistent with the one obtained by the collocation method, as can easily be inferred from the Euler‐Maclaurin formula.

We arrive at the discrete formulation

u=argminvn12AvydSΓAvyd+λ2Rv, (10)

where R is the discrete regularisation term. The optimisation of the objective function leads to the equation

ASΓAuyd+λ2Ru=0 (11)

for the minimum u. In the following subsections, we present four strategies to solve the inverse problem based on different regularisations.

4.1. Zero order Tikhonov regularisation

The zero order Tikhonov regularisation penalises the L2‐norm of the Dirichlet data at tω, see Reference 34, and the regularisation functional in (9) reads

v=vL2tω2.

The discrete regularisation term in (10) is thus

Rv=vSv

and in (11) we have

Ru=2Su.

4.2. First‐order Tikhonov regularisation

The first‐order Tikhonov regularisation penalises the L2‐norm of the Neumann data at tω, see Reference 34, and the regularisation functional in (9) is

v=vL2tω2.

Then the discrete regularisation term in (10) is

Rv=vBSBv

and in (11) we have

Ru=2BSBu.

4.3. H1/2 regularisation

When penalising the H1/2‐norm of the Dirichlet data at tω, the regularisation functional in (9) is given by

v=vH1/2tω2=vvL2tω.

The resulting discrete regularisation term in (10) is

Rv=vBSv

and its Fréchet derivative in (11) is

R'u=SB+Bu.

4.4. Total variation regularisation

In the TV regularisation, we penalise the L1‐norm of the Neumann data at tω, that is, the regularisation functional in (9) is

v=vL1tω.

As the L1‐norm is non‐differentiable, it is common to employ the approximation

vL1tω=tωvxdσxtωvx2+βdσx,

where β>0 is a small constant (typically β=105). This introduces a non‐linearity in the optimality condition. This difficulty is handled in Reference 4 by using the zero order Tikhonov solution u0 in the non‐linear term. This approach is equivalent to set

v=tω2u0x2+β1vx2dσx

in (9). The discretisation requires the definition of the diagonal matrix Wβu0n×n with entries

Wβu0i,i2Bu0i2+β1

for i=0,,n1, where u0 is the discrete zero order Tikhonov solution. The discrete regularisation term in (10) then reads

Rv=vBWβu0SBv,

while in (11) it results in

R'u=2BWβu0SBu.

5. UNCERTAINTY QUANTIFICATION

5.1. Modelling time‐dependent shape uncertainty

In order to assess the shape uncertainty of the pericardium tω, we assume the existence of a reference domain Drefd, with boundaries ref and Γ, and a random deformation field

χ:Dref×0,T×Ωd

such that

Dtω=χDreftω=χDreftω,

where

Dreft=EχDreft.

Herein, the expectation is given in terms of the Bochner integral

Eχx^tΩχx^tωdℙ.

Introducing the space–time cylinder QrefDref×0,T with coordinates

x^tz^Qref,

we can interpret χ as a random deformation field χz^ω acting on the space–time cylinder. A similar model has originally been introduced in Reference 25 for the stationary case. Assuming

χL2ΩC1Qrefd,

it is possible to expand χz^ω in a Karhunen–Loève expansion, cf., Reference 35 according to

χz^ω=Eχz^+k=1λkχkz^Ykω.

Herein, λkχk are the eigen‐pairs of the integral operator defined by the matrix valued covariance function

Covχ:Qref×Qrefd×d,Covχz^z^Ωχz^ωEχz^χz^ωEχz^dℙ,

while Yk is a family of uncorrelated random variables with normalised variance.

To avoid distortion of the space–time tubes χQrefω, ωΩ, and hence to guarantee well‐posedness of the boundary value problem at hand, cf. (1), we impose the uniformity condition

χωC1Qref¯d,χ1ωC1Qω¯d<Cuni

for some constant Cuni>0 uniformly in ωΩ. 1 As a consequence, the random variables' Yk ranges are bounded. Therefore, without loss of generality we may assume Yk:Ω1,1, k=1,2,. In particular, we obtain

tω=χreftωandΓ=χΓtω.

Replacing the random variables by their image 1,1, we arrive at the parametrised Karhunen–Loève expansion

χz^ξ=Eχz^+k=1λkχkz^ξk,ξ1,1.

For the numerical computation of the Karhunen–Loève expansion, it is sufficient to know the expectation and the covariance at ref×0,T, see Reference 36. In our concrete case, it is even sufficient to only compute the Karhunen–Loève expansion in the space–time collocation points. To this end, we employ the pivoted Cholesky decomposition, see References 25, 37, 38. These results in a finite rank Karhunen–Loève expansion

χz^iξ=Eχz^i+k=1Kλkχkz^iξk,ξ1,1K, (12)

where z^i are the space–time collocation points on ref×0,T and K is the dimension of the random parameter space.

5.2. Computation of quantities of interest

We make the common assumption that the random variables are even independent and uniformly distributed. Then, the push‐forward measure is given by the product density

ρξk=1Kρkξkwithρk12.

Hence, we can now express quantities of interest, such as the moments of the potential on the chest, by means of an integral with respect to 1,1K. It holds for the moments that

myx,tΩyx,t,ωmd=1,1Kyx,t,ξmρξdξ,m*.

Especially, the expectation and the variance are given by

Eyx,t=1yx,tandVyx,t=2yx,t1yx,t2.

In practice, the moments need to be approximated by a quadrature rule, that is,

myx,ti=1Nwiyx,t,ξim,

where ξi1,1K for i=1,,N are the quadrature points and wi are the corresponding weights. Due to the space–time modelling, the random parameter space is very high‐dimensional, and appropriate quadrature rules need to be employed. In this article, we employ the anisotropic sparse quadrature from Reference 28, which is based on the Gauss–Legendre quadrature rule. For the sparse quadrature to converge, the quantity of interest needs to be regular with respect to the random parameter ξ1,1K. For the forward problem, such results are available, we refer to Reference 25. For the Dirichlet control problem with an affine random diffusion coefficient, such results have also been derived in Reference 39.

6. NUMERICAL EXPERIMENTS

In this section, we present numerical experiments to assess the validity of the approach. To obtain a space–time reference torso anatomy, we have segmented cardiac magnetic resonance (CMR) imaging data previously acquired. 40 The temporal image stack was obtained from a cine ECG‐triggered segmented steady‐state free precession sequence in mid‐ventricular short‐axis orientation. Slice thickness and voxel resolution were 8 and 1.36 mm, respectively. The 25‐phase temporal stack covered the whole heartbeat, with an RR interval on the surface ECG of T=690 ms. Images were reordered such that the first image at t=0 ms corresponded to the diastole, defined by the maximal left ventricular cavity volume. The systole, defined by the minimum cavity volume, occurred at t=270 ms. The segmentation was performed by manual contour tracing of the epicardium for each image. In order to end up with a smooth computational domain, we performed a least‐squares fit of the contours using a truncated Fourier series with a threshold of 103 in the relative root‐mean‐square error. Finally, we interpolated the extracted shapes to get a pericardial representation at 50 time instants. The chest was also previously segmented from ultra‐fast gradient‐echo “VIBE” images in axial, coronal, and sagittal orientations to produce a smooth three‐dimensional closed surface modelled in Blender.2 As shown in Figure 1, the contour of the chest was eventually obtained by intersecting the chest surface with the orientation plane of the pericardium.

In Figure 2, we summarised the input data for the forward and inverse problem and the geometry of the pericardium, superimposed with the CMR images. To model the uncertainty, we selected the resulting reference shape of the pericardium reft, for t0,T, as the space–time mean of the random deformation field χ. The covariance of χ evaluated at the points z^=x^t with x^reft and z^=x^t with x^reft was the product of a matrix‐valued kernel in space and a scalar kernel in time. For the spatial component of the covariance, we considered the Matérn kernel

kνMd=σ221νΓν2νdρνKν2νdρ,

with parameters ρ=50, σ2=4/3 and different values of the smoothness index ν. Note that in the definition of kνM, the function Γ is the gamma function and Kν is the modified Bessel function of the second kind. Since we are interested in modelling the uncertainty due to the noise and the limited resolution of CMR, the distance d=dx^x^ used in the definition of the kernel, was measured with the Euclidean norm in 2. In contrast, for the distance in time between t and t', we take into account the periodicity of the motion of the pericardium. To do so, we first scale the interval 0,T to 02π with the mapping

η:0,T02π,t2πtT,

and then we compute the geodesic distance

θt,t'=arccoscosηtηt'.

FIGURE 2.

FIGURE 2

Geometry and input data. First row: cardiac magnetic resonance images with superimposed segmented chest (blue) and time‐dependent pericardium (red). The shaded region around the pericardium represents the shape confidence interval, obtained as Et±1.96StdDevt. The yellow dots correspond to γΓ0 and γreft0. Second row: forward data uγst. Third row: inverse data ydγΓst

Finally, to model an additional correlation between neighbouring time slices, we employ the sine power kernel

kSPθ=1sinθ/22=cosθ/22=12cosθ+1,

see Reference 41. Employing a tensor product construction, we end up with the covariance function

Covχz^z^=kSPθt,tk5/2Mx^tx^t200kMx^tx^t2.

Note that we assume here that there is no correlation between the two spatial components of the deformation field. By construction, the joint covariance kernel is positive‐definite on the space 2×S1, where S1 is the unit circle.

In the forward problem, the pericardial potential ux,t was defined analytically as a T‐periodic function in the variable t. For convenience, we set ux,t=uγtωst, being s0,1 the normalised curvilinear coordinate. We simulated a left bundle branch block, that is the extracellular potential consisted in a propagation from free wall of the right ventricle, at s=0, towards the free wall of the left ventricle, at s=0.5. The propagation took 150 ms, consistent with a long QRS complex. The specific analytical form of ux,t is given in Appendix B.

To generate the input data for the inverse problem, we computed the solution of the forward problem on the space–time reference geometry and eventually added Gaussian noise with zero mean and variance 108, corresponding to a signal‐to‐noise ratio of approximately 46 dB.

Concerning the space discretisation, we considered n=nΓ=500 collocation points. This resulted in a truncated Karhunen–Loève expansion with K=648 terms, obtained with a tolerance of 104. That is, the parametric dimension of the UQ problem was 648, thus high‐dimensional. We remark that, since the boundaries are represented by trigonometric polynomials and all data are smooth functions, the collocation method converges exponentially. Resulting in spatial approximation errors for the chosen number of boundary points, which are already of the order of the machine precision.

Since we wish to employ the sparse quadrature to estimate our quantities of interest, we first numerically tested its convergence by comparing it to the quasi‐Monte Carlo method based on the Halton set, see Reference 32. We tested the convergence of the first and second moment of the forward and inverse solution at t=189 ms. The time‐independent problem yielded a truncated Karhunen–Loève expansion of K=101 terms. To validate the applicability of the sparse quadrature, we consider the approximation error of the moments by a comparison to the quasi‐Monte Carlo method based on Halton points. The accuracy of approximately 5105 was achieved by using 17'799 quadrature points within the sparse quadrature. Figure 3 shows the convergence plot of the forward solution. We experimentally observed a convergence rate of 0.75. The obtained result indeed corroborates that the forward problem is smooth in the parametric space.

FIGURE 3.

FIGURE 3

Convergence plot of the first (1) and second (2) moment of the forward solution

For the inverse problem, we tested the regularisations reported in section 4. The regularisation parameter was determined with the L‐curve method, see Reference 34, on the space–time reference geometry. For each regularisation, we then chose the maximal regularisation parameter over all the time steps. This might have led to over‐regularisation for some time steps, but it has the benefit of limiting the oscillations in the numerical solution of the inverse problem. The values of the chosen regularisation parameters λ are reported in Table 1.

TABLE 1.

Regularisation parameter choice for the zero‐order Tikhonov, first‐order Tikhonov, H1/2 and total variation regularisations

Zero‐order Tikhonov First‐order Tikhonov
H1/2
Total variation
λ
106
103
105
105

Figure 4 shows the convergence plots of the inverse solutions. We can observe convergence towards the reference moments for the zero order Tikhonov, the first‐order Tikhonov and the H1/2 regularisations. Instead, the curves resulting from the TV regularisation flatten out, meaning that there is no convergence and suggesting that this regularisation is not sufficiently smooth with respect to the random parameter, and therefore inadequate for the sparse quadrature approach. In contrast, the other regularisations are to be suitable for the sparse quadrature approach.

FIGURE 4.

FIGURE 4

Convergence plot of the first (1) and second (2) moment of the inverse solution with (A) zero‐order Tikhonov, (B) first‐order Tikhonov, (C) H1/2 and (D) total variation regularisation

Next, we present the corresponding numerical results for the inverse problem, when employing the H1/2 regularisation. We estimate the mean and the standard deviation of the forward and inverse solution. The computed quantities of interest for the forward problem are shown in Figure 5. We can observe that the expectation was very close to the chest potential computed on the space–time reference geometry. Moreover, the standard deviation is small and it mainly affects the regions with higher amplitude during the depolarisation phase. In particular, the standard deviation is higher close to γΓ0. The reason for this phenomenon is that points in the vicinity of γΓ0 are close to the heart, see Figure 2. Therefore the effect of the shape uncertainty on the forward solution is limited.

FIGURE 5.

FIGURE 5

Solution of the forward problem. First row: expectation and confidence interval (blue), and solution with reference geometry (dashed black). Second row: contour plots in space–time of the reference solution, expected solution and standard deviation

The computed quantities of interest for the inverse problem are shown in Figure 6. We observe that the expectation deviates slightly from the pericardial potential and shows some oscillations in the depolarisation phase. This is due to the ill‐posedness of the inverse problem and the effect of the regularisation. Indeed, the Tikhonov regularisation, especially at lower order, tends to introduce oscillations in the solution, if the regularisation parameter is not sufficiently large. On the other hand, a strong regularisation yields smoothed out gradients, thus less accurate inverse solution. The H1/2 regularisation might therefore introduce oscillations as well. In the bottom row of Figure 6, the standard deviation is larger than in the forward problem and the shape uncertainty mainly affects regions with large gradients. In the depolarisation phase, the potential is steeper and, consequently, the standard deviation is larger. This fact may have a consequence on the quality of derived quantities such as the activation map, usually obtained from the point with largest negative deflection in the signals. In conclusion, the effect of the shape uncertainty is much more relevant for the inverse problem than for the forward problem.

FIGURE 6.

FIGURE 6

Solution of the inverse problem. First row: expectation and confidence interval (red), and reference solution (dashed black). Second row: contour plots in space–time of the reference solution, expected solution and standard deviation

7. CONCLUSIONS

In this work, we have considered the forward and inverse problem of electrocardiography in the presence of space–time shape uncertainties. The high parametric dimensionality of the problem, along with the non‐linear map between the input and output uncertainties, renders the problem challenging from the mathematical and the numerical perspective.

To address space–time shape uncertainties, we have suggested a model by random space–time deformation fields with a periodic‐in‐time covariance kernel. This approach resulted in a high‐dimensional uncertainty quantification problem. To make this dimensionality feasible for numerical computations, we rely on the one hand on a low‐rank representation of the random deformation field and efficient quadrature techniques on the other hand. The resulting spatial problem for each quadrature point in the parameter was addressed by a boundary integral formulation in combination with a highly accurate and fast collocation method. The numerical results indicate that shape uncertainties affect the solution much more strongly in the inverse problem than in the forward one, as a consequence of the ill‐posedness. Moreover, it was observed that the regularisation of the inverse solution may affect the regularity of the solution with respect to the stochastic parameter, with possible limitations in the convergence order of the quadrature method. Especially, the TV regularisation showed poor performance in this respect, while the H1/2 regularisation is suitable for this problem, both in terms of regularity and quality of the reconstruction.

Future research directions include the transition to 3D models and the generalisation to piecewise‐constant conductivities in the torso. In this case, it is still possible to leverage on the boundary integral formulation. From the mathematical perspective, a general result on the parametric regularity of the inverse problem is still missing. Such a result would help to shed some light on the sub‐optimal convergence rate observed in our experiments and the apparent lack of parametric regularity of the inverse problem with TV regularisation. Finally, from the clinical perspective, we shall further investigate how segmentation uncertainty may be modelled. As a matter of fact, the uncertainty likely results from multiple sources. Besides noise, CMR images are affected by breath holding, which may limit the volume of the heart and spatio‐temporal mis‐registration. The segmentation process may amplify the acquisition uncertainty, depending on the method. Importantly, the segmentation is sometimes a non‐smooth operation, in the sense that small perturbation in the images could yield large and possibly topological changes in the contour. Therefore, special care will be needed in order to correctly model the uncertainty from clinical data.

ACKNOWLEDGEMENTS

This work was financially supported by the Theo Rossi di Montelera Foundation, the Metis Foundation Sergio Mantegazza, the Fidinam Foundation, the Horten Foundation and the CSCS—Swiss National Supercomputing Centre production grant s1074. Open Access Funding provided by Universita della Svizzera Italiana.

Appendix A. Collocation method

Considering the parameterisations γΓ:0,1Γ and γ:0,1, the Dirichlet‐to‐Neumann map (4) in dimension d=2 reads, for ΦΓ and s0,1,

14πΨΓ01kΦ,ΨVs,rρ˜1,Ψrdr=12ρ0,Φs+12πΨΓ01kΦ,ΨKs,rρ0,Ψrdr,

where

kΦ,ΨVs,rlogγΦsγΨr22,kΦ,ΨKs,rγΦsγΨrnr,Ψ2γΦsγΨr22γΨr2

and

ρ0,ΦsyγΦs,ρ˜1,Φsyns,ΦγΦsγΦ's2.

We consider the nΓ‐points discretisation of Γ and the n‐points discretisation of , where nΓ and n are even numbers, and, for ΦΓ, we represent ρ0,Φ and ρ˜1,Φ as a linear combination of the trigonometric Lagrange polynomials Lj, for j=0,,nΦ1, that is,

ρ0,Φs=j=0nΦ1ρ0,jΦLjsandρ˜1,Φs=j=0nΦ1ρ˜1,jΦLjs.

Note that, considering the discretisation si=i/nΦ for i=0,,nΦ1, it holds Ljsi=δi,j. Using the representation of ρ0,Φ and ρ˜1,Φ, we end up with

14πΨΓj=0nΨ101kΦ,ΨVsirLjrdrρ˜1,jΨ=12ρ0,iΦ+12πΨΓj=0nΨ101kΦ,ΨKsirLjrdrρ0,jΨ

for i=0,,nΦ1 and ΦΓ. The goal is now to discretise the above equation. To do so, we consider the discretisation rj=j/nΨ for j=0,,nΨ1 and we distinguish between four different kinds of matrices.

In the case ΨΦ, the kernel functions do not exhibit singularities. Hence, we may directly employ the trapezoidal rule to obtain the collocation approximation of the corresponding boundary integral operators. Using the trapezoidal rule, we have

14πj=0nΨ101kΦ,ΨVsirLjrdrρ˜1,jΨ14πnΨj=0nΨ1kΦ,ΨVsirjρ˜1,jΨ,

therefore, we define the matrix VΦΨnΦ×nΨ whose entries, for i=0,,nΦ1 and j=0,,nΨ1, are

VΦΨi,j14πnΨkΦ,ΨVsirj.

Similarly, by the trapezoidal rule we have

12πj=0nΨ101kΦ,ΨKsirLjrdrρ0,jΨ12πnΨj=0nΨ1kΦ,ΨKsirjρ0,jΨ.

Hence, we define the matrix KΦΨnΦ×nΨ whose entries, for i=0,,nΦ1 and j=0,,nΨ1, are

KΦΨi,j12πnΨkΦ,ΨKsirj.

If Ψ=Φ the kernel functions exhibit a singularity for s=r. This singularity can be dealt with as follows: We split

kΦ,ΦVs,r=kΦ,ΦV,1s,r+kΦ,ΦV,2s,r,

where

kΦ,ΦV,1s,rlogγΦsγΦr224sin2πsr

and

kΦ,ΦV,2s,rlog4sin2πsr.

Then, for the first term, using again the trapezoidal rule, we arrive at

14πj=0nΦ101kΦ,ΦV,1sirLjrdrρ˜1,jΦ14πnΦj=0nΦ1kΦ,ΦV,1sirjρ˜1,jΦ.

Since

limsrkΦ,ΦV,1s,r=logγΦ'r2π22,

we set

kΦ,ΦV,1sirjlogγΦ'rj2π22

for si=rj and we define the matrix VΦΦ1nΦ×nΦ with

VΦΦ1i,j14πnΦkΦ,ΦV,1sirjfori,j=0,,nΦ1.

Since nΦ is an even number, we have nΦ=2mΦ and for the second term it holds

14πj=0nΦ101kΦ,ΦV,2sirLjrdrρ˜1,jΦ14πj=0nΦ1Rjsiρ˜1,jΦ,

where

Rjsi=1mΦk=1mΦ11kcos2πksirj+1nΦcos2πmΦsirj,

cp. Reference 12. This gives rise to the matrix VΦΦ2nΦ×nΦ with

VΦΦ2i,j14πRjsifori,j=0,,nΦ1.

Finally, we set

VΦΦVΦΦ1+VΦΦ2nΦ×nΦ.

For the double layer operator, we have

12πj=0nΦ101kΦ,ΦKsirLjrdrρ0,jΦ12πnΦj=0nΦ1kΦ,ΦKsirjρ0,jΦ.

Since

limsrkΦ,ΦKs,r=γΦ''rnr,Φ22γΦ'r2,

we set

kΦ,ΦKsirjγΦ''rjnrj,Φ22γΦ'rj2

for si=rj and we define the matrix KΦΦnΦ×nΦ with

KΦΦi,j12πnΦkΦ,ΦKsirjfori,j=0,,nΦ1.

Appendix B. Forward problem data

The evolution in time of the pericardial potential at the point γtω0 from which the stimulus is delivered is given, for t0,T, by

uγtω0t=udept+urept,

with

udept=25tanh2t/T0.180.5+t/T0.18/0.1cosh2t/T0.180.5+t/T0.18/0.12

and

urept=2522πexp100t/T0.632+exp100t/T+0.372.

For the other points on the pericardium tω, the potential is shifted in time according to the arrival time of the stimulus. For s0,1, the shift is given by

δs=0.22cos2πsπ+1/2

and the pericardial pericardial is given by

uγtωst=udeptδsT+ureptδsT.

Gander L, Krause R, Multerer M, Pezzuto S. Space–time shape uncertainties in the forward and inverse problem of electrocardiography. Int J Numer Meth Biomed Engng. 2021;37(10):e3522. doi: 10.1002/cnm.3522

Funding information CSCS—Swiss National Supercomputing Centre, Grant/Award Number: s1074; the Horten Foundation; the Fidinam Foundation; the Metis Foundation Sergio Mantegazza; Theo Rossi di Montelera Foundation

Endnotes

1

For the collocation method, we require also χtωC2Dref¯ for t0,T,ωΩ.

REFERENCES

  • 1. Ramanathan C, Ghanem RN, Jia P, Ryu K, Rudy Y. Noninvasive electrocardiographic imaging for cardiac electrophysiology and arrhythmia. Nat Med. 2004;10(4):422‐428. 10.1038/nml011 [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 2. Cluitmans M, Brooks DH, MacLeod R, et al. Validation and opportunities of electrocardiographic imaging: from technical achievements to clinical applications. Front Physiol. 2018;9:1‐19. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 3. Colli Franzone P, Guerri L, Taccardi B, Viganotti C. Finite element approximation of regularized solutions of the inverse potential problem of electrocardiography and applications to experimental data. Calcolo. 1985;22(1):91‐186. [Google Scholar]
  • 4. Karoui A, Bear L, Migerditichan P, Zemzemi N. Evaluation of fifteen algorithms for the resolution of the electrocardiography imaging inverse problem using ex‐vivo and in‐silico data. Front Physiol. 2018;9:1708. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 5. Rudy Y. and Messinger‐Rapport B.. “The inverse problem in electrocardiography: solutions in terms of epicardial potentials.” In: Crit Rev Biomed Eng. Vol. 16. Case Western Reserve University; 1988: 215‐268. [PubMed] [Google Scholar]
  • 6. Hansen P. C., Sekii T., and Shibahashi H.. “The modified truncated SVD method for regularization in general form”. In: SIAM J Sci Stat Comput. Vol. 13. SIAM; 1992:1142‐1150. [Google Scholar]
  • 7. Serinagaoglu Y., Brooks D. H., and MacLeod R. S.. “Bayesian solutions and performance analysis in bioelectric inverse problems”. In: IEEE Trans Biomed Eng. Vol. 52. IEEE; 2005:1009‐1020. [DOI] [PubMed] [Google Scholar]
  • 8. Ghosh S. and Rudy Y.. “Application of l1‐norm regularization to epicardial potential solution of the inverse electrocardiography problem”. In: Ann Biomed Eng. Vol. 37. Springer; 2009:902‐912. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9. Cluitmans MJ, Clerx M, Vandersickel N, Peeters RL, Volders PG, Westra RL. Physiology‐based regularization of the electrocardiographic inverse problem. Med Biol Eng Comput. 2017;55(8):1353‐1365. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10. Schuler S, Wachter A, Dössel O. Electrocardiographic imaging using a spatiotemporal basis of body surface potentials‐application to atrial ectopic activity. Front Physiol. 2018;9:1, 13. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 11. Barr RC, Ramsey M, Spach MS. Relating epicardial to body surface potential distributions by means of transfer coefficients based on geometry measurements. IEEE Trans Biomed Eng. 1977;1:1‐11. [DOI] [PubMed] [Google Scholar]
  • 12. Kress R. Linear Integral Equations. Vol 82. Springer; 1989. [Google Scholar]
  • 13. Clayton RH, Aboelkassem Y, Cantwell CD, et al. An audit of uncertainty in multi‐scale cardiac electrophysiology models. Philos Trans R Soc A. 2020;378(2173):20190335. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14. Quaglino A, Pezzuto S, Koutsourelakis P‐S, Auricchio A, Krause R. Fast uncertainty quantification of activation sequences in patient‐specific cardiac electrophysiology meeting clinical time constraints. Int J Numer Meth Biomed Eng. 2018;34(7):e2985. [DOI] [PubMed] [Google Scholar]
  • 15. Rodríguez‐Cantano R, Sundnes J, Rognes ME. Uncertainty in cardiac myofiber orientation and stiffnesses dominate the variability of left ventricle deformation response. Int J Numer Meth Biomed Eng. 2019;35(5):e3178. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16. Pathmanathan P, Cordeiro JM, Gray RA. Comprehensive uncertainty quantification and sensitivity analysis for cardiac action potential models. Front Physiol. 2019;10:721. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17. Corrado C, Razeghi O, Roney C, et al. Quantifying atrial anatomy uncertainty from clinical data and its impact on electro‐physiology simulation predictions. Med Image Anal. 2020;61:101626. [DOI] [PubMed] [Google Scholar]
  • 18. Aboulaich R, Fikal N, El Guarmah E, Zemzemi N. Stochastic finite element method for torso conductivity uncertainties quantification in electrocardiography inverse problem. Math Model Nat Phenom. 2016;11(2):1‐19. [Google Scholar]
  • 19. Fikal N, Aboulaich R, Guarmah E, Zemzemi N. Propagation of two independent sources of uncertainty in the electrocardiography imaging inverse solution. Math Model Nat Phenom. 2019;14(2):206. [Google Scholar]
  • 20. Tate JD, Zemzemi N, Good WW, van Dam P, Brooks DH, MacLeod RS. Effect of segmentation variation on ECG imaging. In: 2018 Computing in Cardiology Conference (CinC). IEEE, 2018:1‐4. [DOI] [PMC free article] [PubMed]
  • 21. Stoks J, Cluitmans MJM, Peeters R, Volders PGA. The influence of using a static diastolic geometry in ECG imaging. In: 2019 Computing in Cardiology (CinC). IEEE. 2019:1‐4.
  • 22. Canuto C, Kozubek T. A fictitious domain approach to the numerical solution of PDEs in stochastic domains. Numer Math. 2007;107(2):257‐293. [Google Scholar]
  • 23. Harbrecht H, Schneider R, Schwab C. Sparse second moment analysis for elliptic problems in stochastic domains. Numer Math. 2008;109(3):385‐414. [Google Scholar]
  • 24. Xiu D, Tartakovsky DM. Numerical methods for differential equations in random domains. SIAM J Sci Comput. 2006;28(3):1167‐1185. [Google Scholar]
  • 25. Harbrecht H, Peters M, Siebenmorgen M. Analysis of the domain mapping method for elliptic diffusion problems on random domains. Numer Math. 2016;134(4):823‐856. [Google Scholar]
  • 26. Gantner RN, Peters MD. Higher‐order quasi‐Monte Carlo for Bayesian shape inversion. SIAM/ASA J Uncertainty Quantif. 2018;6(2):707‐736. [Google Scholar]
  • 27. Church L, Djurdjevac A, Elliott CM. A domain mapping approach for elliptic equations posed on random bulk and surface domains. Numer Math. 2020;146(1):1‐49. [Google Scholar]
  • 28. Haji‐Ali A‐L, Harbrecht H, Peters M, Siebenmorgen M. Novel results for the anisotropic sparse grid quadrature. J Complexity. 2018;47:62‐85. [Google Scholar]
  • 29. Nobile F, Tempone R, Webster C. A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J Numer Anal. 2008;46(5):2309‐2345. [Google Scholar]
  • 30. Nobile F, Tempone R, Webster CG. An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J Numer Anal. 2008;46(5):2411‐2442. [Google Scholar]
  • 31. Dick J, Kuo F, Le Gia Q, Nuyens D, Schwab C. Higher order QMC Petrov–Galerkin discretization for affine parametric operator equations with random field inputs. SIAM J Numer Anal. 2014;52(6):2676‐2702. [Google Scholar]
  • 32. Caflisch R. Monte Carlo and quasi‐Monte Carlo methods. Acta Numer. 1998;7:1‐49. [Google Scholar]
  • 33. Of G, Phan TX, Steinbach O. Boundary element methods for Dirichlet boundary control problems. Math Meth Appl Sci. 2010;33:2187‐2205. [Google Scholar]
  • 34. Mueller JL, Siltanen S. Linear and nonlinear inverse problems with practical applications. Vol. 10. Siam; 2012.
  • 35. Loève M. Probability Theory. I+I. 4th. Graduate Texts in Mathematics 45. New York: Springer; 1977. [Google Scholar]
  • 36. Dölz J, Harbrecht H, Jerez‐Hanckes C, Multerer M. Isogeometric multilevel quadrature for forward and inverse random acoustic scattering. 2020.
  • 37. Harbrecht H, Peters M, Schneider R. On the low‐rank approximation by the pivoted Cholesky decomposition. Appl Numer Math. 2012;62(4):428‐440. [Google Scholar]
  • 38. Harbrecht H, Peters M, Siebenmorgen M. Efficient approximation of random helds for numerical applications. Numer Lin Algebra Appl. 2015;22:596‐617. [Google Scholar]
  • 39. Kunoth A, Schwab C. Analytic regularity and GPC approximation for control problems constrained by linear parametric elliptic and parabolic PDEs. SIAM J Control Optim. 2013;51(3):2442‐2471. [Google Scholar]
  • 40. Potse M, Krause D, Kroon W, et al. Patient‐specihc modelling of cardiac electrophysiology in heart‐failure patients. Europace. 2014;16(suppl 4):iv56‐iv61. 10.1093/europace/euu257 [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 41. Gneiting T. Strictly and non‐strictly positive dehnite functions on spheres. Bernoulli. 2013;19(4):1327‐1349. [Google Scholar]

Articles from International Journal for Numerical Methods in Biomedical Engineering are provided here courtesy of Wiley

RESOURCES