• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 추계학술대회논문집 I
• /
• pp.52-57
• /
• 2001

In this paper, the optimum designs of air-bearing surface(ABS) are achieved effectively by using reduced basis concept which can reduce the number of design variables although the design space is distended. Generally, the optimization method is more effective than the trial and error. However, the efficiency of the former is largely dependent on the number of the design variables. In order to reduce the number of design variables and increase the efficiency, reduced basis concept is applied. We can define the desired design as a linear combination of basis designs using this concept. From this optimization method with reduced basis concept, we easily obtain the optimum designs of ABS whose target flying heights are 25, 20, 15 nm.

• 대한기계학회논문집A
• /
• 제27권3호
• /
• pp.343-348
• /
• 2003

In this study, optimum designs of the air-bearing surface (ABS) are achieved using the reduced basis concept which can effectively reduce the number of design variables without cutting down on the design space. Even though the optimization method is easier and more applicable to handle than the trial-and-error method, its efficiency is largely dependent on the number of the design variables. Hence, the reduced basis concept is applied, by which the desired design can be defined as a linear combination of basis designs. The simulation results show the effectiveness of the proposed approach by obtaining the optimum solutions of the sliders whose target flying heights are 25, 20, and 15nm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권4호
• /
• pp.196-220
• /
• 2021

This study formulates a new geometric parameterization scheme to effectively address numerical analysis subject to the variation of the fiber radius of a square unit cell. In particular, the proposed mesh-morphing approach may lead to a parameterized weak form whose bilinear and linear forms are affine in the geometric parameter of interest, i.e. the fiber radius. As a result, we may certify the reduced basis analysis of a square unit cell model for any parameters in a predetermined parameter domain with a rigorous a posteriori error bound. To demonstrate the utility of the proposed geometric parameterization, we consider a two-dimensional, steady-state heat conduction analysis dependent on two parameters: a fiber radius and a thermal conductivity. For rapid yet rigorous a posteriori error evaluation, we estimate a lower bound of a coercivity constant via the min-θ method as well as the successive constraint method. Compared to the corresponding finite element analysis, the constructed reduced basis analysis may yield nearly the same solution at a computational speed about 29 times faster on average. In conclusion, the proposed geometric parameterization scheme is conducive for accurate yet efficient reduced basis analysis.

• 대한수학회지
• /
• 제59권6호
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.1-1
• /
• 2003

In this talk, a reduced-order modeling methodology based on centroidal Voronoi tessellations (CVT's)is introduced. CVT's are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. The discrete data sets, CVT's are closely related to the h-means clustering techniques. Even with the use of good mesh generators, discretization schemes, and solution algorithms, the computational simulation of complex, turbulent, or chaotic systems still remains a formidable endeavor. For example, typical finite element codes may require many thousands of degrees of freedom for the accurate simulation of fluid flows. The situation is even worse for optimization problems for which multiple solutions of the complex state system are usually required or in feedback control problems for which real-time solutions of the complex state system are needed. There hava been many studies devoted to the development, testing, and use of reduced-order models for complex systems such as unsteady fluid flows. The types of reduced-ordered models that we study are those attempt to determine accurate approximate solutions of a complex system using very few degrees of freedom. To do so, such models have to use basis functions that are in some way intimately connected to the problem being approximated. Once a very low-dimensional reduced basis has been determined, one can employ it to solve the complex system by applying, e.g., a Galerkin method. In general, reduced bases are globally supported so that the discrete systems are dense; however, if the reduced basis is of very low dimension, one does not care about the lack of sparsity in the discrete system. A discussion of reduced-ordering modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples and is also shown to be inexpensive to apply compared to other reduced-order methods.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2001년도 봄 학술발표회 논문집
• /
• pp.827-832
• /
• 2001

A multi-level optimum design algorithm for prestressed concrete (PSC) box girders is proposed in this paper. To save the numerical efforts, a multi-level optimization technique using model coordination method that separately utilizes both tendon profile design and section design is incorporated. And also, a reduced basis technique for the efficient tendon profile optimization is proposed in this paper. From the numerical investigations, it may be positively stated that the optimum design of PSC box girder based on the new approach proposed in this study will lead to more rational and economical design compared with the currently available designs.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2001년도 가을 학술발표회 논문집
• /
• pp.235-242
• /
• 2001

An optimization algoriam for the optimum design of prestressed concrete (PSC) box girder bridges is proposed in this paper. In order to optimize the tendon profile efficiently, a reduced basis technique is introduced. The optimization algorithm which includes the tendon profile, tendon size and concrete dimensions optimization problem of the PSC box girder bridges is verified on the Genetic algorikhm (GA) from the numerical examples. it may be positively stated that the optimum design of the PSC box girder bridges based on the new approach proposed in this study will lead to more rational and economical design compared with the currently available designs.

• Structural Engineering and Mechanics
• /
• 제8권1호
• /
• pp.73-84
• /
• 1999

This paper is concerned with shape optimization problems by the boundary element method (BEM) emphasizing the use of a reduced basis reanalysis technique proposed recently by the author. Problems of this class are conventionally carried out iteratively through an optimizer; a sequential quadratic programming-based optimizer is used in this study. The iterative process produces a succession of intermediate designs. Repeated analyses for the systems associated with these intermediate designs using an exact approach such as the LU decomposition method are time consuming if the order of the systems is large. The newly developed reanalysis technique devised for boundary element systems is utilized to enhance the computational efficiency in the repeated system solvings. Presented numerical examples on optimal shape design problems in electric potential distribution and elasticity show that the new reanalysis technique is capable of speeding up the design process without sacrificing the accuracy of the optimal solutions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권4호
• /
• pp.293-305
• /
• 2009

In this article, we study a reduced-order modelling for distributed feedback control problem of the Burgers equations. Brief review of the centroidal Voronoi tessellation (CVT) are provided. A weighted (nonuniform density) CVT is introduced and low-order approximate solution and compensator-based control design of Burgers equation is discussed. Through weighted CVT (or CVT-nonuniform) method, obtained low-order basis is applied to low-order functional gains to design a low-order controller, and by using the low-order basis order of control modelling was reduced. Numerical experiments show that a solution of reduced-order controlled Burgers equation performs well in comparison with a solution of full order controlled Burgers equation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권2호
• /
• pp.141-159
• /
• 2009

In this article, we consider a weighted CVT-based reduced-order modelling for Burgers equation. Brief review of the CVT (centroidal Voronoi tessellation) approaches to reduced-order bases are provided. In CVT-reduced order modelling, we start with a snapshot set just as is done in a POD (Proper Orthogonal Decomposition)-based setting. So far, the CVT was researched with uniform density ($\rho$(y) = 1) to determine the basis elements for the approximatin subspaces. Here, we shall investigate the technique of CVT with nonuniform density as a procedure to determine the basis elements for the approximating subspaces. Some numerical experiments including comparison of two CVT (CVT-uniform and CVT-nonuniform)-based algorithm with numerical results obtained from FEM(finite element method) and POD-based algorithm are reported.