• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.22 no.9
• /
• pp.1325-1334
• /
• 1998

The objectives of the present study are to develop a systematic method rather than a conventional trial-and-error method for an optimal shape design using a mathematical theory, and to apply it to engineering problems. In the present study, an optimal condition for a minimum pressure loss in a two-dimensional curved duct flow is derived and then an optimal shape of the curved duct is designed from the optimal condition. In the design procedure, one needs to solve the adjoint Navier-Stokes equations which are derived from the Navier-Stokes equations and the cost function. Therefore, a computer code of solving both the Navier-Stokes and adjoint Navier-Stokes equations together with an automatic grid generation is developed. In a curved duct flow, flow separation occurs due to an adverse pressure gradient, resulting in an additional pressure loss. Optimal shapes of a curved duct are obtained at three different Reynolds numbers of 100, 300 and 800, respectively. In the optimally shaped curved ducts, the separation region does not exist or is significantly reduced, and thus the pressure loss along the curved duct is significantly reduced.

• Nuclear Engineering and Technology
• /
• v.48 no.1
• /
• pp.43-54
• /
• 2016

In the present paper, development of the three-dimensional (3D) computational code based on Galerkin finite element method (GFEM) for solving the multigroup forward/adjoint diffusion equation in both rectangular and hexagonal geometries is reported. Linear approximation of shape functions in the GFEM with unstructured tetrahedron elements is used in the calculation. Both criticality and fixed source calculations may be performed using the developed GFEM-3D computational code. An acceptable level of accuracy at a low computational cost is the main advantage of applying the unstructured tetrahedron elements. The unstructured tetrahedron elements generated with Gambit software are used in the GFEM-3D computational code through a developed interface. The forward/adjoint multiplication factor, forward/adjoint flux distribution, and power distribution in the reactor core are calculated using the power iteration method. Criticality calculations are benchmarked against the valid solution of the neutron diffusion equation for International Atomic Energy Agency (IAEA)-3D and Water-Water Energetic Reactor (VVER)-1000 reactor cores. In addition, validation of the calculations against the $P_1$ approximation of the transport theory is investigated in relation to the liquid metal fast breeder reactor benchmark problem. The neutron fixed source calculations are benchmarked through a comparison with the results obtained from similar computational codes. Finally, an analysis of the sensitivity of calculations to the number of elements is performed.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.308-313
• /
• 2015

This paper describes a technique for complete identification of a two-dimensional scattering object and multiple objects immersed in air using microwaves where the scatterers are assumed to be a homogenous dielectric medium. The employed technique consists of initially retrieving the shape and position of the scattering object using a linear sampling method and then determining the electric permittivity and conductivity of the scatterer using adjoint sensitivity analysis. Incident waves are assumed to be TM (Transverse Magnetic) plane waves. This inversion algorithm results in high computational speed and efficiency, and it can be generalized for any scatterer structure. Also, this method is robust with respect to noise. The numerical results clearly show that this hybrid approach provides accurate reconstructions of various objects.

• Geophysics and Geophysical Exploration
• /
• v.2 no.1
• /
• pp.54-62
• /
• 1999

This paper describes a datuming scheme for a prestack dataset which uses wavefield depth extrapolation. The formulation of the prestack datuming algorithm is performed by finding the adjoint operator to the corresponding forward prestack wavefield extrapolation from a flat surface to an irregular surface. Here I used double-square-root (DSR) equation to extrapolate wavefield in prestack sense. This correspond to the forward model of the well known `survey sinking` prestack imaging algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.66-72
• /
• 2000

Aerodynamic sensitivity analysis is performed for the Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method and a direct differentiation method respectively. Like the mean flow equations, the turbulence model equations are also hand-differentiated to accurately calculate the sensitivity derivatives of flow quantities with respect to design variables in turbulent viscous flows. Both the direct differentiation code and the adjoint variable code adopt the same time integration scheme with the flow solver to efficiently solve the differentiated equations. The sensitivity codes are then compared with the flow solver in terms of solution accuracy, computing time and computer memory requirements. The sensitivity derivatives obtained from the sensitivity codes with different turbulence models are compared with each other. Using two-equation turbulence models, it is observed that a usual assumption of constant turbulent eddy viscosity in adjoint methods may lead to seriously inaccurate results in highly turbulent flows.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.60-65
• /
• 2000

An aerodynamic design method has been developed by using a three-dimensional unstructured Euler code and an adjoint code with a discrete approach. The resulting adjoint code is applied to a wing design problem of super-sonic transport with a wing-body-nacelle configuration. Hicks-Henne shape functions are adopted far the surface geometry perturbation, and the elliptic equation method is employed fer the interior grid modification during the design process. Interior grid sensitivities are neglected except those for design parameters associated with nacelle translation. The Sequential Quadratic Programming method is used to minimize the drag with constraints on the lift and airfoil thickness. Successful design results confirm validity and efficiency of the present design method.

• Atmosphere
• /
• v.23 no.1
• /
• pp.33-37
• /
• 2013

In meteorology, exploitation of Kalman filter as a data assimilation system is virtually impossible due to simultaneous requirements of adjoint model and large computer resource. The other substitute of utilizing ensemble Kalman filter is only affordable by compensating an enormous usage of computing resource. Furthermore, the latter employs ensemble integration sets for evolving the background error covariance matrix by compensating the dynamical feature of the temporal evolution of weather conditions. We propose a new implementation method that works without the adjoint model by utilizing the explicit expression of the background error covariance matrix in backward evolution. It will also break a barrier in the evolution of the covariance matrix. The method may be applied with a slight modification to the real time assimilation or the retrospective analysis.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.423-430
• /
• 2002

Given operators X and Y acting on a Hilbert space H, an interpolating operator is a bounded operator A such that AX = Y. An interpolating operator for n-operators satisfies the equation $AX_{}i$ = $Y_{i}$ for i/ = 1,2,…, n. In this article, we obtained the following : Let X ＝ ($x_{i\sigma(i)}$ and Y ＝ ($y_{ij}$ be operators in B(H) such that $X_{i\sigma(i)}\neq\;0$ for all i. Then the following statements are equivalent. (1) There exists an operator A in Alg L such that AX = Y, every E in L reduces A and A is a self-adjoint operator. (2) sup ${\frac{\parallel{\sum^n}_{i=1}E_iYf_i\parallel}{\parallel{\sum^n}_{i=1}E_iXf_i\parallel}n\;\epsilon\;N,E_i\;\epsilon\;L and f_i\;\epsilon\;H}$ < $\infty$ and $x_{i,\sigma(i)}y_{i,\sigma(i)}$ is real for all i = 1,2, ....

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.215-223
• /
• 2017

In this paper, we establish results about operators similar to their adjoints. This is carried out in the setting of bounded and also unbounded operators on a Hilbert space. Among the results, we prove that an unbounded closed operator similar to its adjoint, via a cramped unitary operator, is self-adjoint. The proof of this result works also as a new proof of the celebrated result by Berberian on the same problem in the bounded case. Other results on similarity of hyponormal unbounded operators and their self-adjointness are also given, generalizing well known results by Sheth and Williams.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.55-60
• /
• 2007

Given operators X and Y acting on a Hilbert space $\cal{H}$, an interpolating operator is a bounded operator A such that AX = Y. In this article, we showed the following : Let $\cal{L}$ be a subspace lattice acting on a Hilbert space $\cal{H}$ and let X and Y be operators in $\cal{B}(\cal{H})$. Let P be the projection onto $\bar{rangeX}$. If FE = EF for every $E\in\cal{L}$, then the following are equivalent: (1) $sup\{{{\parallel}E^{\perp}Yf\parallel\atop \parallel{E}^{\perp}Xf\parallel}\;:\;f{\in}\cal{H},\;E\in\cal{L}\}\$ < $\infty$, $\bar{range\;Y}\subset\bar{range\;X}$, and < Xf, Yg >=< Yf,Xg > for any f and g in $\cal{H}$. (2) There exists a self-adjoint operator A in Alg$\cal{L}$ such that AX = Y.