Abstract
This paper presents a computer-assisted proof of the existence and unimodality of steady-state solutions for the Proudman–Johnson equation which is representative of two-dimensional fluid flow. The proposed approach is based on an infinite-dimensional fixed-point theorem with interval arithmetic, and is another proof by Miyaji and Okamoto (Jpn J Ind Appl Math 36:287–298, 2019). Verification results show the validity of both proofs.
Similar content being viewed by others
1 Introduction
Consider the following fourth-order nonlinear differential equation:
where
\(R>0\), and k is a given positive integer. The aim of the present paper is to prove, in a computer-assisted manner, that there exists a solution u satisfying (1) and that this solution has a strict extremum at one and only one point in \(\varOmega \). The proof of the existence and extremum of the solution of (1) implies unimodality of the solution for the Proudman–Johnson equation:
which is derived from the two-dimensional Navier–Stokes equations. For more details about the Proudman–Johnson equation and the unimodality of the solution, see the references [2,3,4] and references therein. In a previous paper, one of the authors proved the existence and unimodality for (1) in a rigorously mathematical manner via the multiple shooting method and multiple-precision interval arithmetic for \(R \le 5000\) [4]. In the present paper, we apply a verification algorithm FN-Int [5], which is based on an infinite-dimensional fixed-point Newton-like formulation, and prove the solution has a unique extremum in \(\varOmega \). The procedure does not need multiple-precision interval arithmetic and for readers interested in the details of our computer program, the source code is available for downloading from the first author’s web page. Our proposed approach is another computer-assisted proof of unimodality of the solution for the Proudman–Johnson equation. We do not describe in detail the relative merits of the two approaches in the present paper but would like to point out a couple relative merits as follows . The method described in [4] is applicable mainly to ordinary differential equations, and the authors of [4] reported that there is a unimodal solution for \(k=10\), as well as other values k. The approach presented herein is potentially applicable to more direct multi-dimensional problems, and, for \(k=2\), we successfully prove the existence of a unimodal solution for \(R \le 10000\), which is a wider range than reported in [4].
This paper is organized as follows. Section 2 describes a fixed-point formulation using an approximate solution and verification procedure. Section 3 is devoted to details of the verification procedure. In Sect. 4, we report an enclosing result for the solution of (1). The final section reports on verification results of unimodality.
2 Fixed-point formulation and verification procedure
From the imposed boundary conditions, \(u(0)=u(\pi )= u''(0)=u''(\pi )=0\), we will find the solutions of (1) in the function spaces \(X^l\) (\(l \ge 0\)) by the closure in \(H^l(\varOmega )\) of the linear hull of all functions: \(\sin (mx)\), \(m \in {\mathbb {N}}_+ := \{1,2,\dots \}\). In particular, because our aim is to enclose the weak solutions of (1), we set \(X:=X^3\). We note that
holds for any \([m,n]^T \in {\mathbb {N}}_+^2\), where \({(\,\cdot ,\cdot \,)_{L^2}}\) is the usual \(L^2\)-inner product in \(\varOmega \). For \(\phi _m:= \sin (m x)\), let \(X_N := \text {span} \{ \phi _m \}_{m=1}^N\) be a finite-dimensional approximation subspace of X that depends on a positive integer parameter N which is not less than k. The subspace \(X_N\) is the N-th truncation of the Fourier series of X. Let \(X_*\) be the orthogonal complement of \(X_N\) in X such that \(X=X_N \oplus X_*\). Because of \(\{ {\Vert \phi \Vert _{L^2}}, {\Vert \phi '\Vert _{L^2}}, {\Vert \phi ''\Vert _{L^2}} \} \le {\Vert \phi '''\Vert _{L^2}}\) for \(\phi \in X\) (see proofs in Lemma 1), we define the norm of X as \({\Vert \phi \Vert _X}:= {\Vert \phi '''\Vert _{L^2}}\) by \({\Vert \phi \Vert ^2_{L^2}}={(\,\phi ,\phi \,)_{L^2}}\).
Next, we define a bilinear form B by
Note that \({\hat{u}}=\sin (kx)/k^4\) is a solution of (1) for each R and k because \(B({\hat{u}},{\hat{u}}) =0\). For each \(u, v \in X\) such that
we can find the following:
By using \(\phi _0=0\) and \(\phi _{-m}=-\phi _m\) for \(m \ge 1\), each B(u, v), f(u), and \(f'[u]v\) can be expanded by \(\{\phi _m\}_{m=1}^\infty \) as an element in \(X^0\).
Now, using the standard Newton–Raphson method, we compute \(u_N \in X_N\) satisfying
approximately. We note that \(u_N\) need not to be the exact solution of (8). Fig. 1 shows plots of the approximate solution \(u_N = \sum _{m=1}^N (u_N)_m \phi _m\) and its derivatives of (8) for \(R=5000\), \(N=400\), and \(k=2\). The principal coefficients of the Fourier expansion are as follows:
Remark 1
If \(u(x)=\sum _{m=1}^\infty A_m \phi _m(x)\) is a solution of (1) in \(\varOmega \), then from (6), \(\tilde{u}(x):=\sum _{m=1}^\infty (-1)^m A_m \phi _m(x)\) also satisfies (1) in the same interval \(\varOmega \). Therefore, below, we concentrate on the “maximum” type convex-upward solution, such as in Fig. 1.
Now we find the norm estimations in the following lemma.
Lemma 1
For each \(\psi _* \in X_*\), it is true that
where
Proof
Below, we represent each element \(\psi _* \in X_*\) by \(\psi _* = \displaystyle \sum _{m={N+1}}^\infty A_m \phi _m \in X_*\), with \(A_m \in {\mathrm{I\hspace{-0.22em}R}}\).
-
Proof of (9):
$$\begin{aligned} {\Vert \psi _*\Vert _X^2}&= \dfrac{\pi }{2} \sum _{m=N+1}^\infty m^6 A_m^2 \le \max _{N+1 \le m \le \infty } \dfrac{1}{m^2} \times {\Vert \psi _*''''\Vert ^2_{L^2}} \le \dfrac{1}{(N+1)^2} \times {\Vert \psi _*''''\Vert ^2_{L^2}}. \end{aligned}$$ -
Proof of (10):
$$\begin{aligned} {\Vert \psi _*''\Vert ^2_{L^2}} = \dfrac{\pi }{2} \sum _{m=N+1}^\infty m^4 A_m^2 \le \max _{N+1 \le m \le \infty } \dfrac{1}{m^2} \times {\Vert \psi _*\Vert _X^2} \le \dfrac{1}{(N+1)^2} \times {\Vert \psi _*\Vert _X^2}. \end{aligned}$$ -
Proof of (11):
$$\begin{aligned} {\Vert \psi _*'\Vert ^2_{L^2}} = \dfrac{\pi }{2} \sum _{m=N+1}^\infty m^2 A_m^2 \le \max _{N+1 \le m \le \infty } \dfrac{1}{m^4} \times {\Vert \psi _*\Vert _X^2} \le \dfrac{1}{(N+1)^4} \times {\Vert \psi _*\Vert _X^2}. \end{aligned}$$ -
Proof of (12):
$$\begin{aligned} {\Vert \psi _*\Vert ^2_{L^2}} = \dfrac{\pi }{2} \sum _{m=N+1}^\infty A_m^2 \le \max _{N+1 \le m \le \infty } \dfrac{1}{m^6} \times {\Vert \psi _*\Vert _X^2} \le \dfrac{1}{(N+1)^6} \times {\Vert \psi _*\Vert _X^2}. \end{aligned}$$ -
Proof of (13): From the Cauchy–Schwarz inequality, we have
$$\begin{aligned} {\Vert \psi _*\Vert _{L^\infty (\varOmega )}}&= \max _{x \in \varOmega } \left| \sum _{m=N+1}^\infty A_m \sin (mx) \right| \le \sum _{m=N+1}^\infty |A_m| = \sum _{m=N+1}^\infty m^3 |A_m| \dfrac{1}{m^3} \\&\le \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^6} \right) ^{1/2} \left( \dfrac{\pi }{2} \sum _{m=N+1}^\infty A_m^2 m^6 \right) ^{1/2}\\&= \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^6} \right) ^{1/2} {\Vert \psi _*\Vert _X}; \end{aligned}$$then from
$$\begin{aligned} \sum _{m=N+1}^\infty \dfrac{1}{m^6} \le \int _N^\infty t^{-6} \, dt = \dfrac{1}{5N^5}, \end{aligned}$$we obtain the conclusion.
-
Proof of (14): Because
$$\begin{aligned} {\Vert \psi _*'\Vert _{L^\infty (\varOmega )}}&= \max _{x \in \varOmega } \left| \sum _{m=N+1}^\infty m A_m \sin (mx) \right| \le \sum _{m=N+1}^\infty m|A_m| = \sum _{m=N+1}^\infty m^3 |A_m| \dfrac{1}{m^2} \\&\le \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^4} \right) ^{1/2} \left( \dfrac{\pi }{2} \sum _{m=N+1}^\infty A_m^2 m^6 \right) ^{1/2} \\&= \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^4} \right) ^{1/2} {\Vert \psi _*\Vert _X}, \end{aligned}$$and
$$\begin{aligned} \sum _{m=N+1}^\infty \dfrac{1}{m^4} \le \int _N^\infty t^{-4} \, dt = \dfrac{1}{3N^3}, \end{aligned}$$we have the conclusion.
-
Proof of (15): Because
$$\begin{aligned} {\Vert \psi _*''\Vert _{L^\infty (\varOmega )}}&= \max _{x \in \varOmega } \left| \sum _{m=N+1}^\infty m^2 A_m \sin (mx) \right| \le \sum _{m=N+1}^\infty m^2|A_m| = \sum _{m=N+1}^\infty m^3 |A_m| \dfrac{1}{m} \\&\le \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^2} \right) ^{1/2} \left( \dfrac{\pi }{2} \sum _{m=N+1}^\infty A_m^2 m^6 \right) ^{1/2}\\&= \left( \dfrac{2}{\pi }\sum _{m=N+1}^\infty \dfrac{1}{m^2} \right) ^{1/2} {\Vert \psi _*\Vert _X}, \end{aligned}$$and
$$\begin{aligned} \sum _{m=N+1}^\infty \dfrac{1}{m^2} \le \int _N^\infty t^{-2} \, dt = \dfrac{1}{N}, \end{aligned}$$we have the conclusion.
\(\square \)
Now we apply the verification procedure FN-Int [5, Sect. 2.1], where the name “FN-Int” comes from “Finite,” “Newton,” and “Interval.” For the sake of self-containedness of the manuscript, we give a detailed formulation for problem (1).
By setting
and
problem (1) can be rewritten as an equivalent residual form in order to find \(w \in X\) satisfying
in a weak sense. The term \(r_{2N}\) in (18) is the defect of the approximate solution \(u_N\) and can be re-expanded as an element of \(X_{2N}\). Therefore, we can compute its inner product with \(\{\phi _i\}_{i=1}^N\) and the \(L^2\)-norm by interval arithmetic [7]. It is expected that, if \(u_N\) is an accurate approximation, some norms of w satisfying (19) are small.
By virtue of the property regarding B, the map g from X to \(X^0\) is bounded and continuous. Moreover, it can be shown that for all \(\psi \in X^0\), the linear problem \(\xi '''' = \psi \) has a unique solution \(\xi \in X^4\) (the proof follows the same procedure as in [1]). If we denote this map as \(\varDelta ^{-2}\), then \(\varDelta ^{-2}: X^0 \rightarrow X\) becomes a compact map because of the compactness of the embedding \(H^4(\varOmega ) \hookrightarrow H^3(\varOmega )\). Therefore, (19) can be rewritten as the fixed-point equation
for the compact operator \(F:=\varDelta ^{-2} g\) on X.
Next, for \(u = \sum _{m=1}^\infty A_m \phi _m \in X^0\), we define \(P_N: X^0 \rightarrow X_N\) as the truncation \(P_N u = \sum _{m=1}^N A_m \phi _m \in X_N\). Note that \(P_N|_X\) coincides with the \(H^2_0\)-projection such that
and from (9) of Lemma 1, we can find that
Now, we apply a Newton-like method to the fixed-point equation (20). Using the projection \(P_N\), the fixed-point problem \(w = F(w)\) can be uniquely decomposed as a finite-dimensional (projection) part \(X_N\) and an infinite-dimensional (error) part \(X_*\) as follows:
Here I stands for the identity map on X. Suppose that the restriction of the operator \(P_N(I-F'[0]): X \rightarrow X_N\) to \(X_N\) has an inverse
where \(F'[w]\) denotes the Fréchet derivative of F at w. Note that this assumption is equivalent to the invertibility of a matrix, and it can be checked numerically for actual verified computations [6].
We now define a Newton-like operator \(\mathcal{N}: X \rightarrow X_N\) by
and a compact map \(T: X \rightarrow X\) by
We find that, if \([I-F'[0]]_N^{-1}\) exists, then the two fixed-point problems,
and (20), are equivalent. If the approximate solution \(u_N\) is sufficiently accurate, then the operator \(\mathcal{N}(w)\) for the finite-dimensional part of T will possibly be a retraction. On the other hand, because of (9) in Lemma 1, the magnitude of the infinite-dimensional part of T is expected to be small when the truncation numbers of \(X_N\) are taken to be sufficiently large.
We must now consider how to find a solution of (26) in a set \(W \subset X\), which is referred to as a candidate set. For \(n \ge 1\), an interval vector \({\textbf{c}} = [\underline{{\textbf{c}}}, \overline{{\textbf{c}}}]\) for \(\underline{{\textbf{c}}}, \overline{{\textbf{c}}} \in {\mathrm{I\hspace{-0.22em}R}}^n\) is defined by
(see [6, part 1, chapter 9]). Let \({\mathbb{I}\mathbb{R}}^N\) be the set of N-dimensional interval vectors, and let \([B_i] \in {\mathbb{I}\mathbb{R}}^N\). Because \(N=\dim X_N\), we introduce a finite-dimensional set \(W_N \subset X_N\) which is a set of linear combinations of base functions in \(X_N\) with interval coefficients \(\{B_i\}_{1\le i \le N}\) as follows:
For \(\alpha >0\), an infinite-dimensional set \(W_* \subset X_*\) and a candidate set \(W \subset X\) are taken to be
Now, by defining an \(N \times N\) matrix \(G=[G_{ij}]\) by
we obtain a verification condition.
Theorem 1
For the candidate set \(W \subset X\) defined by (29), let any element \(w \in W\) be represented by
Let \({\textbf{d}}=[d_i] \in {\mathbb{I}\mathbb{R}}^N\) denote an interval enclosure of the set whose i-th component consists of
If, for an interval vector \({\textbf{v}}=[v_i] \in {\mathbb{I}\mathbb{R}}^N\) enclosing the solution \({\textbf{x}} \subset {\mathbb{I}\mathbb{R}}^N\) for the linear equation
the conditions
and
hold, then there exists a fixed point of F in W.
Proof
For each \(w=w_N + w_* \in W\), since
by setting
we obtain
From the definition of \(P_N\), equation (35) is equivalent to
Then, condition (33) ensures that \(\mathcal{N}(w) \in W_N\). Condition (34) also shows that \((I-P_N)F(w) \in W_*\), so we obtain \(T(W) \subset W\), which, by the Schauder fixed-point theorem, ensures the existence of a fixed point of T in the candidate set W. \(\square \)
Remark 2
Note that for all of the computation procedures in Theorem 1, we should consider the effects of rounding errors.
Remark 3
If we obtain a fixed point \(w \in X\) by Theorem 1, we can also assure the existence of a nontrivial solution \(u = u_N + w \in X\) for (1) with the error bound
Moreover, since w can be written as \(w = w_N + w_*, w_N\in W_N, w_* \in W_*\), the estimation (13) in Lemma 1 provides an \(L^\infty \)-error estimate:
3 Details of verification procedure
3.1 Finite-dimensional part
This subsection is devoted to the detailed estimation that satisfies (31). For each \(w \in W\), setting \(w=w_N+w_* \in W_N + W_*\) and \(v_N = u_N+w_N \in X_N\), we have
from (18). We note that it is important to reduce the number of differentiations of infinite-dimensional error part \(w_*\) because we only know its norm and cannot treat \(w_*\) directly in computers. In order to do so, we use the following property regarding B.
Lemma 2
For each \(u,v,w \in X\), it holds that
Proof
Because \(v''\), \(u'w\), \(uw'\), and v have zeros at 0 and \(\pi \), applying partial integration, we have
\(\square \)
By using Lemma 2, the orthogonality of \(P_N\), the Cauchy–Schwarz inequality, and (12) in Lemma 1, the inner product with \(\phi _i\) of \(B(v_N,w_*) + B(w_*,v_N)\) in (38) can be bounded as
where \({\textbf{z}}_1=[(z_1)_i] \in {\mathrm{I\hspace{-0.22em}R}}^N\) satisfies
The inner product with \(\phi _i\) of \(B(w_N,w_N)\) in (38) can be enclosed by \({\textbf{z}}_2=[(z_2)_i] \in {\mathbb{I}\mathbb{R}}^N\) as
(see Sect. 3.3.2). Additionally, the inner product between \(\phi _i\) and \(B(w_*,w_*)\) in (38) is evaluated as
by using \({\Vert \phi _i\Vert _{L^\infty (\varOmega )}}=1\), (10), (11), and (12).
Consequently, setting \({\textbf{z}}_3 = [(z_3)_i] \in {\mathbb{I}\mathbb{R}}^N\) by
the interval enclosure \(d_i\) (\(1 \le i \le N \)) for (31) in Theorem 1 can be computed to satisfy
3.2 Infinite-dimensional part
This subsection is devoted to the detailed estimation that satisfies (34). For each \(w \in W\), since \(g(w) \in X^0\) and \(P_N\) is the truncation of the Fourier series, we have
We note that, for a practical verification, to keep overestimation as low as possible, removing the \(X_N\) part of g(w) is important. From (18), we obtain
The \(L^2\)-norm \({\Vert (I-P_N)r_{2N}\Vert _{L^2}}\) in (44) can be bounded by using interval arithmetic with the fixed approximate solution \(u_N\). We take a bound \(z_9>0\) of the defect satisfying
Next, let us consider the first \(L^2\)-norm in (44). Setting \(w=w_N+w_* \in W_N + W_*\) and \(v_N = u_N + w_N \in X_N\), we obtain
and thus
The upper bound for part (a) on the right-hand side of (46) can be computed by interval arithmetic. We define \(z_4>0\) satisfying
By using Lemma 1 and (28), and setting positive values \(z_k>0\) for \(k=5,6,7,8\) satisfying
we find that the rest of the \(L^2\)-norm terms are bounded as
Consequently, the infinite-dimensional part of (34) can be computed as
In our algorithm, when the Reynolds number is large, the truncation number N should be larger, because each \(d_i\) and \({\Vert (I-P_N)F(w)\Vert _{L^2}}\) are proportional to R.
3.3 \({\mathbf {z_k}}\) (\(1 \le k \le 3\)) and \(z_k\) (\(4 \le k \le 9\))
In this subsection, we describe detailed computations for \({\mathbf {z_1}} \in {\mathrm{I\hspace{-0.22em}R}}^N\), \({\mathbf {z_2}}, {\mathbf {z_3}} \in {\mathbb{I}\mathbb{R}}^N\), and \(z_k \in {\mathrm{I\hspace{-0.22em}R}}\) (\(4 \le k \le 9\)) introduced in previous subsections.
Below, using \((u_N)_m, (w_N)_m, (v_N)_m \in {\mathrm{I\hspace{-0.22em}R}}\) (\(1 \le m \le N\)), we express \(u_N \in X_N\) of (8), any element \(w_N \in W_N\) (\(W_N\) is defined by (27)), and \(v_N = u_N+w_N \in X_N\) as
respectively. Here, note that \((w_N)_m \in B_m\), \((v_N)_m \in (u_N)_m + B_m\) for \(1 \le m \le N\). We also use the same symbols \(E_{2N}\) and \(e_m\) throughout the calculations, redefining them as necessary.
3.3.1 \({\mathbf {z_1}}=[(z_1)_i]\)
For each i (\(1 \le i \le N\)), setting \(\xi _m = \cos (m x)\), we re-expand
Then, by using the interval \((u_N)_m + B_m \in {\mathbb{I}\mathbb{R}}\) enclosing \((v_N)_m\) for \(1 \le m \le N\), we can compute \(e_m^i \in {\mathbb{I}\mathbb{R}}\) (\(1 \le m \le 2N\)) satisfying
Therefore, \((z_1)_i \ge 0\) (\(1 \le i \le N\)) for (40) can be taken to satisfy
which is an upper bound for all \(w_N \in W_N\).
3.3.2 \({\mathbf {z_2}}=[(z_2)_i]\)
The equation (5) implies
Then, by using the interval \(B_m \in {\mathbb{I}\mathbb{R}}\) enclosing \((w_N)_m\) for \(1 \le m \le N\), we can compute \(e_m \in {\mathbb{I}\mathbb{R}}\) (\(1 \le m \le 2N\)) satisfying
Therefore, for each i such that \(1 \le i \le N\), we can take \((z_2)_i\) of (41) to satisfy
which holds for all \(w_N \in W_N\).
3.3.3 \({\mathbf {z_3}}=[(z_3)_i]\) and \(z_9\)
Using (6), the defect \(r_{2N} \in X_{2N}\) of (17) can be expanded as
Then, interval arithmetic gives \(e_m \in {\mathbb{I}\mathbb{R}}\) (\(1 \le m \le 2N\)) satisfying
In the actual computations for the right-hand side of (52), each \((u_N)_m \in {\mathrm{I\hspace{-0.22em}R}}\) (\(1 \le m \le N\)) is translated to an interval that includes \((u_N)_m\).
Therefore, the interval vector \({\textbf{z}}_3=[(z_3)_i] \in {\mathbb{I}\mathbb{R}}^N\) for (42) and the positive value \(z_9\) for (45) can be obtained to satisfy
and
3.3.4 \(z_4\)
From (5), it holds that
Then, by using \(B_m \in {\mathbb{I}\mathbb{R}}\) with \((w_N)_m \in B_m\) and \((u_N)_m + B_m \in {\mathbb{I}\mathbb{R}}\) enclosing \((v_N)_m\) for \(1 \le m \le N\), we can compute \(e_m \in {\mathbb{I}\mathbb{R}}\) (\(1 \le m \le 2N\)) satisfying
Therefore, \((z_4)_i \ge 0\) (\(1 \le i \le N\)) for (47) can be taken to satisfy
which is an upper bound for all \(w_N \in W_N\).
3.3.5 \(z_5\), \(z_6\), \(z_7\), \(z_8\)
For each \(v_N = u_N + w_N \in u_N + W_N\), it is true that
Then, by using the interval \((u_N)_m + B_m \in {\mathbb{I}\mathbb{R}}\) enclosing \((v_N)_m\) for \(1 \le m \le N\), we can compute \(z_5\), \(z_6\), \(z_7\), and \(z_8\) for (48)–(51) by interval arithmetic, which holds for all \(w_N \in W_N\).
4 Enclosing results
This section reports on several computer-assisted results of (1) obtained by Theorem 1. All computations were carried out on the Fujitsu PRIMERGY CX2570 M4; Intel Xeon Gold 6140 (Skylake-SP); 2.3 GHz (Turbo 3.7 GHz) by using INTerval LABoratory Version 11, a toolbox in MATLAB R2019a (9.7.0.1261785) 64-bit (glnxa64) developed by Rump [7] for self-validating algorithms. Therefore, all numerical values in these tables are verified data in the sense of strict rounding error control in the mathematical sense (see [6, part 1, chapter 3]).
Table 1 shows some verification results for \(k=2\). In the table, \(|B_i|:=\max \{|b| \ | \ b \in B_i \}\) is obtained by the INTLAB function mag.
5 Verification of unimodality
In the final section, we prove the unimodality of enclosed solutions in the previous section. Let \(u \in X\) be a verified solution of (1). Then the following conditions assure the unimodality of u [4, Lemma 3.2].
-
1.
h is a real number such that \(0< h < \pi /2\),
-
2.
\(0 \notin u'([0,h]) \cup u'([\pi -h,\pi ])\),
-
3.
\(\text {sgn}(u'([0,h]) \ne \text {sgn}(u'([\pi -h,\pi ]))\),
-
4.
\(0 \notin u''([h,\pi -h])\).
The verified solution of (1) by FN-Int can be enclosed in the set as follows:
Setting
there exist \(v_N \in u_N + W_N\) and \(v_* \in W_*\) such that \(u = v_N + v_*\). Then, for each \(x \in \varOmega \), (14) and (15) imply
and
Therefore, for a subinterval J of \(\varOmega =(0,\pi )\), we can enclose the ranges \(u'(J)\) and \(u''(J)\) by interval arithmetic. Fig. 2 shows enclosing ranges of \(u'(J)\) (black) and \(u''(J)\) (blue dots) in each J. Using this procedure, we can validate the unimodality of all solutions in Table 1 with \(h=2\pi /5\).
References
Cai, S., Nagatou, K., Watanabe, Y.: A numerical verification method for a system of Fitzhugh–Nagumo type. Numer. Funct. Anal. Optim. 33(10), 1195–1220 (2012)
Kim, S.-C., Okamoto, H.: Vortices of large scale appearing in the 2D stationary Navier–Stokes equations at large Reynolds numbers. Jpn. J. Ind. Appl. Math. 27(1), 47–71 (2010)
Kim, S.-C., Okamoto, H.: The generalized Proudman–Johnson equation at large Reynolds numbers. IMA J. Appl. Math. 78(2), 379–403 (2013)
Miyaji, T., Okamoto, H.: Existence proof of unimodal solutions of the Proudman-Johnson equation via interval analysis. Jpn. J. Ind. Appl. Math. 36(1), 287–298 (2019)
Nakao, M.T., Plum, M., Watanabe, Y.: Numerical verification methods and computer-assisted proofs for partial differential equations. In: Volume 53 of Springer Series in Computational Mathematics. Springer Singapore (2019)
Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer. 19, 287–449 (2010)
Rump, S.M.: INTLAB - INTerval LABoratory. In: Tibor Csendes, editor, Developments in Reliable Computing, pp 77–104. Kluwer Academic Publishers, Dordrecht (1999). http://www.ti3.tuhh.de/rump/
Acknowledgements
The authors would like to give sincere thanks to Professor Hisashi Okamoto for giving them the chance to write this paper. The authors also heartily thank the two anonymous referees for their thorough reading and valuable comments. This work was supported by Grants-in-Aid from the Ministry of Education, Culture, Sports, Science and Technology of Japan (Nos. 21H01000, 20H01820, and 15H03637) and the Japan Science and Technology Agency, CREST (No. JPMJCR14D4). The computation was mainly carried out using the computer facilities at the Research Institute for Information Technology, Kyushu University, Japan.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Watanabe, Y., Miyaji, T. Another computer-assisted proof of unimodality of solutions for Proudman–Johnson equation. Japan J. Indust. Appl. Math. 41, 1013–1032 (2024). https://doi.org/10.1007/s13160-023-00639-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-023-00639-x