## 1. Introduction

Interdisciplinary collaborations between different areas of mathematics can be hard work because of different terminology and the difficulty of recognizing the applicability of the methods from one field in the other field. In Linz there is an almost-20-year tradition of bringing together researchers from numerical mathematics and symbolic computation [20, 21, 15, 1], which at the beginning faced exactly these kinds of problems. Additionally, there could be the risk that the results are only interesting for one community and not rewarded by the other one. Fortunately, this didn’t happen in our case: in the current work, we use and invent tools at the frontier of symbolic computation to solve a problem that arose at the frontier of numerical analysis research. Hence, this work improves the knowledge and tools for both communities.

Inverse inequalities of the form

(1) | ||||

(2) |

play an important role in the analysis and design of numerical methods for partial differential equations [4, 22, 2, 6] and in the construction of efficient solvers for the arising linear systems of those methods [10, 23]. Bounds for the constants of the type (1)–(2) have been studied for example in [22, 25, 24, 9, 7], where the asymptotic behaviour with respect to and is covered but usually these constants are over estimated. In many numerical methods a precise knowledge of these constants is required, which motivates this work where we use and present tools from symbolic computation to derive precise estimates.

Here , is a bounded and open set with sufficiently smooth boundary , describing a finite element with diameter which is used in the numerical method (intervals for , often triangles or quadrilaterals for , usually tetrahedra or hexahedra for , …). Let be some infinite-dimensional space of functions defined on such that the solution of the PDE is an element of . With we denote a family of finite-dimensional (usually closed) subspaces of whose dimension depends on ; the desired solution of the PDE is approximated by an element of . Moreover we have some given norms , and which are induced by certain inner products , and , which are used in the analysis of the numerical methods. In general the constants and of (1) and (2) depend on the diameter and on the parameter reflecting the dimension of the space . The dependence with respect to the diameter is obtained by transforming Equations (1) and (2) to a reference domain , i.e.

(3) | ||||

(4) |

and applying a scaling argument [22, 25, 2]. The more challenging problem is to find precise estimates for the constants and with respect to the parameter . The best possible constants by definition are given by

(5) | ||||

(6) |

Introducing for the basis functions , i.e., , we further obtain

with the symmetric and positive (semi-) definite matrices

for . Note that the rows of the matrices are naturally defined via the second argument of the inner product and the columns are given naturally via the first argument of the inner product. Hence, the constants and are given by the largest eigenvalues of the generalized eigenvalue problems

(7) |

i.e.

In this work we want to solve the problems (3) and (4), i.e., determine estimates for and , for the reference domain with

for , where is the space of polynomials of degree less than , i.e.

In Section 2 we state the problem in detail and derive its formulation as a generalized eigenvalue problem of the form (7). The difficulty is now to find an accurate estimate for the largest eigenvalues and for general parameter . Of course one can compute the eigenvalues exactly for a given fixed parameter , which is done for example in [19]. But to derive their exact values or precise estimates for a general parameter one needs techniques from symbolic computation. In Section 3 we use the HolonomicFunctions package [11, 12] to prove a closed-form representation of the characteristic polynomial of our eigenvalue problem, in the spirit of the holonomic ansatz [27] for evaluating determinants. The holonomic ansatz is a very powerful method (it was the key to the “holy grail of enumerative combinatorics” [14]), and a very flexible one, too [16]. For our purposes here we had to adapt this algorithm, which led to a new variant that is applicable to a larger class of determinants. In Section 4, our representation of the characteristic polynomial is used to derive and prove the estimates from below and above

for the constant in the inequality

In Lemmas 4.5 and 4.8 we give much sharper estimates for ; as an application, they allow to tune the parameters of numerical methods precisely. In Section 5 the same representation is used to investigate the asymptotic behaviour of the eigenvalues; on the way we discover some interesting connections to the Taylor expansions of trigonometric functions. As an encore, we deal with the second inequality (4) in Section 6. It turns out that it is considerably simpler and we are able to derive the exact value of .

Throughout the paper, we employ the following notation: denotes the Pochhammer symbol, also known as rising factorial, defined for all nonnegative integers by

We use for the floor function, and for the ceiling function, i.e., the largest integer below , resp. the smallest integer above . For a polynomial we refer to the degree of with respect to the variable by . By we denote the Kronecker delta symbol, i.e., if and . If is the matrix , then we use for its determinant the short-hand notation . The determinant of the matrix is defined to be .

## 2. The Maximal Eigenvalue Problem

Let the reference domain be defined by , the open square of size centered around the origin. For and , we define and to be the unique integers in satisfying . In other words,

For the rest of this section we fix and write shortly and . By employing the standard monomial basis , we obtain the matrix with entries defined by

(8) |

and the matrix with entries

(9) |

Since and are just monomials, these integrals can be evaluated in a straightforward manner:

Similarly

where we assumed that ; otherwise the integral equals to .

We are interested in computing the maximal such that . In the following we derive an equivalent formulation of this problem that involves smaller matrices. For this purpose let

such that the matrix entries and can be written as

This shows that the matrices and can be written as Kronecker products:

These representations as Kronecker products are quite natural since the used basis functions and the reference domain

itself have tensor product structure. In particular we then obtain,

So the problem is equivalent to computing the maximal such that

## 3. Determinant Evaluation

According to the previous discussion, we are now interested in evaluating the determinant

for symbolic ; the desired maximal eigenvalue is then just the largest root of the obtained polynomial. We see that the matrix has zeros at all positions for which

is an odd integer. By applying the permutation

to the rows and to the columns of the matrix, we decompose it into block form and obtainwhere the subscripts indicate the dimensions of the square matrices and , whose entries are independent of the dimension and given by

(10) | ||||

(11) |

Hence the matrices and start as follows:

###### Theorem 3.1.

###### Corollary 3.2.

For all nonnegative integers we have

The key ingredient for the proof of Theorem 3.1 is the following lemma which shows that the quantities and defined there are basically the entries of the last column of the inverses of and , respectively.

###### Lemma 3.3.

With

the following identities hold for all nonnegative integers and for :

###### Proof.

These identities can be proven routinely using the holonomic systems approach [26]. We have carried out the necessary calculations using the HolonomicFunctions package [11, 12]. The results are documented in the supplementary electronic material [13].

First we derive, using holonomic closure properties and creative telescoping, a (left Gröbner) basis for the set of recurrence equations that satisfies. Again applying closure properties (in this case for multiplication) one obtains recurrences for the product , and by creative telescoping, for its definite sum, which we denote by (it is the left-hand side of the first identity). Here we face the problem of poles inside the summation range that are introduced by the certificate of the telescopic relation. We solve this issue by constructing a different certificate, free of the problematic denominators, using an ansatz reminiscent of the polynomial ansatz [11, Sec. 3.4]. The recurrences for have the following form (some polynomial coefficients are omitted for space reasons):

From their support and their leading coefficients it becomes clear that when we want to use them to compute for all , then we have to give the initial conditions , , , and . By verifying that they all equal we have shown that the first identity holds for .

For we can construct, by holonomic substitution, a univariate recurrence satisfied by . It turns out that the corresponding operator is a left multiple of the second-order operator that annihilates . Also in this case, the proof can be completed by checking a few initial conditions. The proof of the second identity is established in an analogous way. ∎

###### Lemma 3.4.

The following determinant evaluations hold for all nonnegative integers :

###### Proof.

These determinants are special cases of Cauchy’s classic double alternant [3]

where are indeterminates; see also [17, Thm. 12, Eq. (5.5)] and [18, Thm. 15] for a proof by factor exhaustion. In order to obtain the first assertion, we specialize and for , and obtain:

The second assertion is derived in a completely analogous way. Note also that these two determinants can be proven routinely using the holonomic ansatz [27]. ∎

###### Proof of Theorem 3.1.

Lemma 3.3

shows that the vector

is, up to a scalar multiple, the -th column of for . Since the entries of this vector (and of course those of the matrices itself) are polynomials in , this shows that and that . Note that both polynomials and have degree in . Next we argue that also the determinants of and have degree in , which is the maximal possible—taking into account that the matrix entries are linear polynomials in . Observe that the matrix entries in Lemma 3.4 are precisely . Thus Lemma 3.4 implies that converges to a nonzero constant (only depending on ) as goes to infinity. Hence for , which means that the two determinants are now determined up to a multiplicative constant not depending on . By noting that the polynomials are monic and that the expressions given in Lemma 3.4 are, up to sign, the leading coefficients of and , respectively, the assertion of the theorem is proven. ∎Note that our proof of the determinant evaluations in Theorem 3.1 is very reminiscent of Zeilberger’s holonomic ansatz [27]. In fact, the only difference is that we chose to normalize the vector in a different way as Zeilberger would do it: while he suggests the normalization , we normalize such that and is a monic polynomial with . (The same discussion applies to , of course.)

In the original formulation of the holonomic ansatz, i.e., with the normalization , the final result in the case of success is a holonomic recurrence, i.e., a linear recurrence with polynomial coefficients, for . However, this ansatz is not at all guaranteed to succeed: even if the matrix entries are holonomic, this doesn’t mean that the sequence of quotients of consecutive determinants is a holonomic sequence. The determinant of is such an example: the polynomials satisfy the second-order recurrence

which means that (most likely) the quotient doesn’t satisfy a holonomic recurrence of any order. (We have strong evidence that this quotient is non-holonomic, but we haven’t tried to prove this rigorously.) Provided that this is true, the original holonomic ansatz must fail.

Thanks to the additional parameter that appears polynomially in the matrix entries, we can identify the determinant of in the denominators of the inverse matrix. Thus a natural normalization of the vector would be such that . In that case, the final result would be a holonomic recurrence for ; hence this variant is applicable when the determinant itself is a holonomic sequence in . Unfortunately, that’s not the case for the matrix because of the non-holonomic prefactor . This explains why we had to choose yet another normalization, in order to separate the holonomic and the non-holonomic part of the determinant. For each part then we had to prove a different determinant evaluation: for the holonomic “polynomial part” this was done in Lemma 3.3, for the non-holonomic “constant part” in Lemma 3.4. It is not unlikely that there are many more examples of determinants where the original holonomic ansatz fails, but where the modifications described here lead to success.

At the end of this section we want to briefly discuss an alternative way to derive the polynomials . In our above considerations we started with the monomial basis when formulating the eigenvalue problem. Alternatively, one could employ the Legendre basis leading to the following determinant:

(note that only the matrix entries on the main diagonal depend on ). Indeed any basis for the space can be used for the computation of the eigenvalues given in (7). So by construction, this determinant leads to the same family of polynomials , and in fact we have that does not depend on . Doing the same block decomposition as before, we obtain the two families of matrices

where stands for , whose determinants are given by

Note that these determinants are “nicer” than the ones we considered above, because their leading coefficients form holonomic sequences (actually they are hypergeometric). So it seems that we should have started with this formulation. But there is also a drawback: the matrix entries are defined in terms of , which on the one hand yields nicely structured matrices (constant along “hooks”, with a perturbation on the diagonal) such as

but on the other hand requires case distinctions that make the proofs of the relevant identities (the analog of Lemma 3.3) more complicated.

## 4. Upper and Lower Bounds on the Maximal Root of

In this section we give lower and upper bounds on the maximal root of . Recall that we are interested in the maximal root of

We will prove that the maximal root of is equal to the maximal root of . We prove this in Lemma 4.6 which is based on Lemmas 4.2, 4.3, and 4.5, which are technical in nature. A lower and an upper bound on the maximal root of are given in Lemma 4.5. A better upper bound is given in Lemma 4.8. These two lemmas are based on Lemma 4.3. Recall the definition of .

###### Definition 4.1.

To simplify notation in this section, we introduce the polynomials

(14) |

which correspond (up to sign) to the coefficients of :