The original version of this article unfortunately contained mistakes. The aim of this erratum is to correct mistakes of Lemma 1 and claryfy the obscurity of the sentences. In addition, we note that the method works in practice for a nearly self adjoint optimization problems. For non-self adjoint problems the solutions produced by the method are not guaranteed to satisfy first-order necessary optimality conditions.

The first-order necessary conditions for the optimization problem (P) with respect to *ε* amd ** u** are written as follows:

We need adjoint equations to solve (E.2). The solution (*ε*,** u**) provided by the proposed method does not satisfy (E.1) and (E.2). In a discretized form, the Lagrangian is formulated with using the adjoint variable

*v*_{0},

*v*_{1},…,

*v*_{ N }as follows:

The first-order necessary conditions in the discretized form are written as follows:

In (E.5), the adjoint equations should be employed for *k*<*N*. It is not necessary only at *k* = *N*. The sequence {*ε*
_{
k
}} and {*u*_{
k
}} provided by the proposed method does not satisfy (E.4) and (E.5).

The proposed method solves the following equations by generating sequences {*ε*
_{
k
}} and {*u*_{
k
}}:

The sequences {*ε*
_{
k
}} and {*u*_{
k
}} are computed by using the gradient of the following function \(\mathcal {L}_{k}\):

\(\mathcal {L}_{k}\) is the Lagrangian of the following optimization problem (P_{
k
}) for given *u*_{
k−1}:

Therefore, the proposed method can be said to define the sequence of optimization problems \(\mathcal {P} = \{ (\mathrm {P}_{0}), (\mathrm {P}_{1}), \dots , (\mathrm {P}_{N}) \}\) and to approximately trace the path of the optimal solutions of \(\mathcal {P}\). The convergence of the sequence \(\mathcal {P}\) is not guaranteed. If *u*_{
k
} = *u*_{LBM}(*u*_{
k−1},*ε*
_{
k
}) converges, i.e. *u*_{
N−2} = *u*_{
N−1} = *u*_{
N
}, then the sequence \(\mathcal {P}\) converges, i.e. (P_{
N−1}) is equivalent to (P_{
N
}). Even if \(\mathcal {P}\) converges, the optimal solution of (P_{
N
}) does not satisfy the first-order optimality condition of (P_{LBM}).

In the following, we correct the mistakes of the original paper. The following sentence at page 160 (right column line 8) was not correct:

In contrast, we propose the optimization algorithm with proved local optimality under certain assumption.

The sentence should be

In the present paper, we apply the method to various types of problems and study the stability of the method.

The following sentence at page 160 (right column line 29) was not correct, and it should be removed:

Hence, adjoint variables are not required, which reduces computational cost.

After equation (11e), the following equation should be added:

Below the sentence including (12), we add the following sentence to clarify the equation:

It should be clear in (12b) that

is considered a variable dependeing onuεand we obtain \( \frac {\partial (D+C)}{\partial \varepsilon } = \left . \frac {\partial (D+C)}{\partial \boldsymbol {u}} \right |_{\varepsilon } \frac {\partial \boldsymbol {u}}{\partial \varepsilon } + \left . \frac {\partial (D+C)}{\partial \varepsilon } \right |_{\boldsymbol {u}} \) by using the chain rule.

Before Lemma 1, the following sentence was not correct.

Nevertheless, the solution of (12) is at least a local optimal solution of (P) at the final stage (

t=T) ifεconverges with respect to time. This is shown in the following lemma.

The sentence should be be corrected in order to claryfy the limitation of Lemma 1 as follows:

The following lemma shows that, under some assumptions, (11) is satisfied only at

t=T, and does not show (11) is satisfied att<T.

The following sentence in the Lemma 1 was incorrect.

If there exists

T^{′}∈[0,T] such that the solution of (12a) satisfies \( \| \frac {\partial \varepsilon }{\partial t} \| \leq \delta \) for anyδ>0 and anyt∈[T^{′},T], i.e.,ε(t)→ε(T^{′}) =ε(T), then there exists Lagrange multiplier such thatε(t) satisfies the Karush–Kuhn–Tacker (KKT) conditions.

The sentence should be

If there exists

T^{′}∈[0,T] such that the solution of (12) satisfies \( \| \frac {\partial \varepsilon }{\partial t} \| \leq \delta \) for anyδ>0 and anyt∈[T^{′},T], i.e.,ε(t)→ε(T^{′}) =ε(T), then there exists Lagrange multiplier such thatε(T) satisfies (11) att=T.

The following sentence in the proof of Lemma 1 was incorrect.

Let

(v,xt) =and0γ_{3}=M(T), then the left-hand side of (11a) reduces to$$\begin{array}{@{}rcl@{}} \frac{\partial\mathcal{L}}{\partial\varepsilon} (\boldsymbol{x}, t)\,=\, \left\{\begin{array}{l} \gamma_{1}(\boldsymbol{x}, t) \,-\, \gamma_{2} (\boldsymbol{x}, t) ~ \text{for~} t\!<\!T, \\ \frac{\partial(D+C)}{\partial\varepsilon} (\boldsymbol{x}, T) \,+\, \gamma_{1}(\boldsymbol{x}, t) \,-\, \gamma_{2} (\boldsymbol{x}, t)\,+\, M(T) ~ \text{for~} t\,=\,T. \end{array}\right. \end{array} $$

The sentence should be as follows.

Let \(\boldsymbol {v}(\boldsymbol {x}, t) = - \left . \frac {\partial (D+C)}{\partial \boldsymbol {u}} \right |_{\varepsilon } \) and

γ_{3}=M(T), then Eq. (11f) is satisfied and the left-hand side of (11a) at timet=Treduces to$$\begin{array}{@{}rcl@{}} \frac{\partial\mathcal{L}}{\partial\varepsilon} (\boldsymbol{x}, T)\!\!&=&\!\! \left. \frac{\partial(D\!\,+\,C)}{\partial\varepsilon}(\boldsymbol{x}, T) \right|_{\boldsymbol{u}} \,-\, \left\langle \frac{\partial\boldsymbol{u}_{\text{NS}}}{\partial\varepsilon}(\boldsymbol{x}, T), v(\boldsymbol{x}, T) \right\rangle \\&&+ \gamma_{1}(\boldsymbol{x}, T) - \gamma_{2} (\boldsymbol{x}, T)+ M(T) \\ &=& \frac{\partial(D+C)}{\partial\varepsilon} (\boldsymbol{x}, T) + \gamma_{1}(\boldsymbol{x}, T) \\ &&- \gamma_{2} (\boldsymbol{x}, T)+ M(T) , \end{array} $$where we use \( \frac {\partial (D+C)}{\partial \varepsilon } = \left . \frac {\partial (D+C)}{\partial \boldsymbol {u}} \right |_{\varepsilon } \frac {\partial \boldsymbol {u}}{\partial \varepsilon } + \left . \frac {\partial (D+C)}{\partial \varepsilon } \right |_{\boldsymbol {u}} \) and (12a).

The Case 1 in the proof of Lemma 1 was incorrect and it should be removed.

The following sentence in the Lemma 2 was incorrect.

then there exists Lagrange multiplier such that

ε(t) satisfies the KKT conditions (11) in a discrete form.

The sentence should be

then

ε_{ N }satisfies (11) in a discrete form atk=N.

The following equation which defines the inlet velocity in section 4.2 was in correctly typeset.

The equation should be as follows.

The following sentence at page 171 (right column line 15) was not correct:

Also, it does not need to solve adjoint equations.

The sentence should be

Also, it does not solve adjoint equations.

The following sentence at page 171 (right column line 17) was not correct and it should be removed

Moreover, if the method converges, then the obtained solution is guaranteed to be at least a local optimal solution.

## Acknowledgments

We express our gratitude to Dr. Evgrafov for pointing out the mistakes.

## Author information

## Additional information

The online version of the original article can be found at http://dx.doi.org/10.1007/s00158-014-1123-x.

## Rights and permissions

## About this article

### Cite this article

Yonekura, K., Kanno, Y. Erratum to: A flow topology optimization method for steady state flow using transient information of flow field solved by lattice Boltzmann method.
*Struct Multidisc Optim* **54, **193–195 (2016). https://doi.org/10.1007/s00158-016-1472-8

Published:

Issue Date: