• Title/Summary/Keyword: Solution space discretization

Search Result 31, Processing Time 0.026 seconds

ERROR ESTIMATES FOR A GALERKIN METHOD FOR A COUPLED NONLINEAR SCHRÖDINGER EQUATIONS

  • Omrani, Khaled;Rahmeni, Mohamed
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.1
    • /
    • pp.219-244
    • /
    • 2020
  • In this paper, we approximate the solution of the coupled nonlinear Schrödinger equations by using a fully discrete finite element scheme based on the standard Galerkin method in space and implicit midpoint discretization in time. The proposed scheme guarantees the conservation of the total mass and the energy. First, a priori error estimates for the fully discrete Galerkin method is derived. Second, the existence of the approximated solution is proved by virtue of the Brouwer fixed point theorem. Moreover, the uniqueness of the solution is shown. Finally, convergence orders of the fully discrete Crank-Nicolson scheme are discussed. The end of the paper is devoted to some numerical experiments.

Free Oscillation Analysis in the Coastal Area using Integrated Finite Difference Method (적분차분법을 이용한 연안역에서의 해수고유진동해석)

  • LEE Byung-Gul
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.27 no.6
    • /
    • pp.782-786
    • /
    • 1994
  • Integrated finite difference method (IFDM) is used to solve one dimensional free oscillation problem in the coastal area. To evaluate the solution accuracy of IFDM in free oscillation analysis, two finite difference equations based on area discretization method and point discretization method are derived from the governing equations of free oscillation, respectively. The difference equations are transformed into a generalized eigenvalue problem, respectively. A numerical example is presented, for which the analytical solution is available, for comparing IFDM to conventional finite difference equation (CFDM), qualitatively. The eigenvalue matrices are solved by sub-space iteration method. The numerical results of the two methods are in good agreement with analytical ones, however, IFDM yields better solution than CFDM in lower modes because IFDM only includes first order differential operator in finite difference equation by Green's theorem. From these results, it is concluded that IFDM is useful for the free oscillation analysis in the coastal area.

  • PDF

FINITE ELEMENT APPROXIMATION OF THE DISCRETE FIRST-ORDER SYSTEM LEAST SQUARES FOR ELLIPTIC PROBLEMS

  • SHIN, Byeong-Chun
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.3
    • /
    • pp.563-578
    • /
    • 2005
  • In [Z. Cai and B. C. Shin, SIAM J. Numer. Anal. 40 (2002), 307-318], we developed the discrete first-order system least squares method for the second-order elliptic boundary value problem by directly approximating $H(div){\cap}H(curl)-type$ space based on the Helmholtz decomposition. Under general assumptions, error estimates were established in the $L^2\;and\;H^1$ norms for the vector and scalar variables, respectively. Such error estimates are optimal with respect to the required regularity of the solution. In this paper, we study solution methods for solving the system of linear equations arising from the discretization of variational formulation which possesses discrete biharmonic term and focus on numerical results including the performances of multigrid preconditioners and the finite element accuracy.

SPARSE GRID STOCHASTIC COLLOCATION METHOD FOR STOCHASTIC BURGERS EQUATION

  • Lee, Hyung-Chun;Nam, Yun
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.193-213
    • /
    • 2017
  • We investigate an efficient approximation of solution to stochastic Burgers equation driven by an additive space-time noise. We discuss existence and uniqueness of a solution through the Orstein-Uhlenbeck (OU) process. To approximate the OU process, we introduce the Karhunen-$Lo{\grave{e}}ve$ expansion, and sparse grid stochastic collocation method. About spatial discretization of Burgers equation, two separate finite element approximations are presented: the conventional Galerkin method and Galerkin-conservation method. Numerical experiments are provided to demonstrate the efficacy of schemes mentioned above.

A Comparative Study of Transcription Techniques for Nonlinear Optimal Control Problems Using a Pseudo-Spectral Method

  • Kim, Chang-Joo;Sung, Sangkyung
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.16 no.2
    • /
    • pp.264-277
    • /
    • 2015
  • This article investigates various transcription techniques for the Legendre pseudospectral (PS) method to compare the pros and cons of each approach. Eight combinations from four different types of collocation points and two discretization methods for dynamic constraints, which differentiate Legendre PS transcription techniques, are implemented to solve a carefully selected test set of nonlinear optimal control problems (NOCPs). The convergence property and prediction accuracy are compared to provide a useful guideline for selecting the best combination. The tested NOCPs consist of the minimum time, minimum energy, and problems with state and control constraints. Therefore, the results drawn from this comparative study apply to the solution of similar types of NOCPs and can mitigate much debate about the best combinations. Additionally, important findings from this study can be used to improve the numerical efficiency of the Legendre PS methods. Three PS applications to the aerospace engineering problems are demonstrated to prove this point.

A MESH INDEPENDENCE PRINCIPLE FOR PERTURBED NEWTON-LIKE METHODS AND THEIR DISCRETIZATIONS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.139-159
    • /
    • 2000
  • In this manuscript we study perturbed Newton-like methods for the solution of nonlinear operator equations in a Banach space and their discretized versions in connection with the mesh independence principle. This principle asserts that the behavior of the discretized process is asymptotically the same as that for the original iteration and consequently, the number of steps required by the two processes to converge to within a given tolerance is essentially the same. So far this result has been proved by others using Newton's method for certain classes of boundary value problems and even more generally by considering a Lipschitz uniform discretization. In some of our earlierpapers we extend these results to include Newton-like methods under more general conditions. However, all previous results assume that the iterates can be computed exactly. This is mot true in general. That in why we use perturbed Newton-like methods and even more general conditions. Our results, on the one hand, extend, and on the other hand, make more practical and applicable all previous results.

Preconditioning technique for a simultaneous solution to wind-membrane interaction

  • Sun, Fang-jin;Gu, Ming
    • Wind and Structures
    • /
    • v.22 no.3
    • /
    • pp.349-368
    • /
    • 2016
  • A preconditioning technique is presented for a simultaneous solution to wind-membrane interaction. In the simultaneous equations, a linear elastic model was employed to deal with the fluid-structure data transfer at the interface. A Lagrange multiplier was introduced to impose the specified boundary conditions at the interface and strongly coupled simultaneous equations are derived after space and time discretization. An initial linear elastic model preconditioner and modified one were derived by treating the linearized elastic model equation as a saddle point problem, respectively. Accordingly, initial and modified fluid-structure interaction (FSI) preconditioner for the simultaneous equations were derived based on the initial and modified linear elastic model preconditioners, respectively. Wind-membrane interaction analysis by the proposed preconditioners, for two and three dimensional membranous structures respectively, was performed. Comparison was made between the performance of initial and modified preconditioners by comparing parameters such as iteration numbers, relative residuals and convergence in FSI computation. The results show that the proposed preconditioning technique greatly improves calculation accuracy and efficiency. The priority of the modified FSI preconditioner is verified. The proposed preconditioning technique provides an efficient solution procedure and paves the way for practical application of simultaneous solution for wind-structure interaction computation.

Sequential Convex Programming Based Performance Analysis of UAV Design (순차 컨벡스 프로그래밍 기반 무인기 설계 형상의 성능 분석)

  • Ko, Hyo-Sang;Choi, Hanlim;Jang, Jong-Youn;Kim, Joon;Ryu, Gu-Hyun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.11
    • /
    • pp.771-781
    • /
    • 2022
  • Sequential convex programming based performance analysis of the designed UAV is performed. The nonlinear optimization problems generated by aerodynamics are approximated to socond order program by discretization and convexification. To improve the performance of the algorithm, the solution of the relaxed problem is used as the initial trajectory. Dive trajectory optimization problem is analyzed through iterative solution procedure of approximated problem. Finally, the maximum final velocity according to the performance of the actuator model was compared.

AN EFFICIENT INCOMPRESSIBLE FREE SURFACE FLOW SIMULATION USING GPU (GPU를 이용한 효율적인 비압축성 자유표면유동 해석)

  • Hong, H.E.;Ahn, H.T.;Myung, H.J.
    • Journal of computational fluids engineering
    • /
    • v.17 no.2
    • /
    • pp.35-41
    • /
    • 2012
  • This paper presents incompressible Navier-Stokes solution algorithm for 2D Free-surface flow problems on the Cartesian mesh, which was implemented to run on Graphics Processing Units(GPU). The INS solver utilizes the variable arrangement on the Cartesian mesh, Finite Volume discretization along Constrained Interpolation Profile-Conservative Semi-Lagrangian(CIP-CSL). Solution procedure of incompressible Navier-Stokes equations for free-surface flow takes considerable amount of computation time and memory space even in modern multi-core computing architecture based on Central Processing Units(CPUs). By the recent development of computer architecture technology, Graphics Processing Unit(GPU)'s scientific computing performance outperforms that of CPU's. This paper focus on the utilization of GPU's high performance computing capability, and presents an efficient solution algorithm for free surface flow simulation. The performance of the GPU implementations with double precision accuracy is compared to that of the CPU code using an representative free-surface flow problem, namely. dam-break problem.

Numerical description of start-up viscoelastic plane Poiseuille flow

  • Park, Kwang-Sun;Kwon, Young-Don
    • Korea-Australia Rheology Journal
    • /
    • v.21 no.1
    • /
    • pp.47-58
    • /
    • 2009
  • We have investigated the transient behavior of 1D fully developed Poiseuille viscoelastic flow under finite pressure gradient described by the Oldroyd-B and Leonov constitutive equations. For analysis we employ a simple $2^{nd}$ order discretization scheme such as central difference for space and the Crank-Nicolson for time approximation. For the analysis of the Oldroyd-B model, we also apply the analytical solution, which is obtained again in this work in terms of elementary solution procedure simpler than the previous one (Waters and King, 1970). Both models demonstrate qualitatively similar solutions, but their eventual steady flowrate exhibits noticeable difference due to the absence or presence of shear thinning behavior. In the inertialess flow, the flowrate instantaneously attains a large value corresponding to the Newtonian creeping flow and then decreases to its steady value when the applied pressure gradient is low. However with finite liquid density the flow field shows severe fluctuation even accompanying reversals of flow directions. As the assigned pressure gradient increases, the flowrate achieves its steady value significantly higher than its value during oscillations after quite long period of time. We have also illustrated comparison between 1D and 2D results and possible mechanism of complex 2D flow rearrangement employing a previous solution of [mite element computation. In addition, we discuss some mathematical points regarding missing boundary conditions in 2D modeling due to the change of the type of differential equations when varying from inertialess to inertial flow.