• Title/Summary/Keyword: elliptic problems

Search Result 158, Processing Time 0.028 seconds

Reduction factor of multigrid iterations for elliptic problems

  • Kwak, Do-Y.
    • Journal of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.7-15
    • /
    • 1995
  • Multigrid method has been used widely to solve elliptic problems because of its applicability to many class of problems and fast convergence ([1], [3], [9], [10], [11], [12]). The estimate of convergence rate of multigrid is one of the main objectives of the multigrid analysis ([1], [2], [5], [6], [7], [8]). In many problems, the convergence rate depends on the regularity of the solutions([5], [6], [8]). In this paper, we present an improved estimate of reduction factor of multigrid iteration based on the proof in [6].

  • PDF

A Historical Overview of Elliptic Curves (타원곡선의 역사 개관)

  • Koh, Youngmee;Ree, Sangwook
    • Journal for History of Mathematics
    • /
    • v.28 no.2
    • /
    • pp.85-102
    • /
    • 2015
  • Elliptic curves are a common theme among various fields of mathematics, such as number theory, algebraic geometry, complex analysis, cryptography, and mathematical physics. In the history of elliptic curves, we can find number theoretic problems on the one hand, and complex function theoretic ones on the other. The elliptic curve theory is a synthesis of those two indeed. As an overview of the history of elliptic curves, we survey the Diophantine equations of 3rd degree and the congruent number problem as some of number theoretic trails of elliptic curves. We discuss elliptic integrals and elliptic functions, from which we get a glimpse of idea where the name 'elliptic curve' came from. We explain how the solution of Diophantine equations of 3rd degree and elliptic functions are related. Finally we outline the BSD conjecture, one of the 7 millennium problems proposed by the Clay Math Institute, as an important problem concerning elliptic curves.

ON A CLASS OF NONCOOPERATIVE FOURTH-ORDER ELLIPTIC SYSTEMS WITH NONLOCAL TERMS AND CRITICAL GROWTH

  • Chung, Nguyen Thanh
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1419-1439
    • /
    • 2019
  • In this paper, we consider a class of noncooperative fourth-order elliptic systems involving nonlocal terms and critical growth in a bounded domain. With the help of Limit Index Theory due to Li [32] combined with the concentration compactness principle, we establish the existence of infinitely many solutions for the problem under the suitable conditions on the nonlinearity. Our results significantly complement and improve some recent results on the existence of solutions for fourth-order elliptic equations and Kirchhoff type problems with critical growth.

ERROR ESTIMATES OF MIXED FINITE ELEMENT APPROXIMATIONS FOR A CLASS OF FOURTH ORDER ELLIPTIC CONTROL PROBLEMS

  • Hou, Tianliang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.4
    • /
    • pp.1127-1144
    • /
    • 2013
  • In this paper, we consider the error estimates of the numerical solutions of a class of fourth order linear-quadratic elliptic optimal control problems by using mixed finite element methods. The state and co-state are approximated by the order $k$ Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise polynomials of order $k(k{\geq}1)$. $L^2$ and $L^{\infty}$-error estimates are derived for both the control and the state approximations. These results are seemed to be new in the literature of the mixed finite element methods for fourth order elliptic control problems.

ELLIPTIC OBSTACLE PROBLEMS WITH MEASURABLE NONLINEARITIES IN NON-SMOOTH DOMAINS

  • Kim, Youchan;Ryu, Seungjin
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.1
    • /
    • pp.239-263
    • /
    • 2019
  • The $Calder{\acute{o}}n$-Zygmund type estimate is proved for elliptic obstacle problems in bounded non-smooth domains. The problems are related to divergence form nonlinear elliptic equation with measurable nonlinearities. Precisely, nonlinearity $a({\xi},x_1,x^{\prime})$ is assumed to be only measurable in one spatial variable $x_1$ and has locally small BMO semi-norm in the other spatial variables x', uniformly in ${\xi}$ variable. Regarding non-smooth domains, we assume that the boundaries are locally flat in the sense of Reifenberg. We also investigate global regularity in the settings of weighted Orlicz spaces for the weak solutions to the problems considered here.

Numerical simulations of elliptic particle suspensions in sliding bi-periodic frames

  • Chung, Hee-Taeg;Kang, Shin-Hyun;Hwang, Wook-Ryol
    • Korea-Australia Rheology Journal
    • /
    • v.17 no.4
    • /
    • pp.171-180
    • /
    • 2005
  • We present numerical results for inertialess elliptic particle suspensions in a Newtonian fluid subject to simple shear flow, using the sliding bi-periodic frame concept of Hwang et al. (2004) such that a particulate system with a small number of particles could represent a suspension system containing a large number of particles. We report the motion and configurational change of elliptic particles in simple shear flow and discuss the inter-relationship with the bulk shear stress behaviors through several example problems of a single, two-interacting and ten particle problems in a sliding bi-periodic frame. The main objective is to check the feasibility of the direct simulation method for understanding the relationship between the microstructural evolution and the bulk material behaviors.

A SIXTH-ORDER OPTIMAL COLLOCATION METHOD FOR ELLIPTIC PROBLEMS

  • Hong, Bum-Il;Ha, Sung-Nam;Hahm, Nahm-Woo
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.513-522
    • /
    • 1999
  • In this paper we present a collocation method based on biquintic splines for a fourth order elliptic problems. To have a better accuracy we formulate the standard collocation method by an appro-priate perturbation on the original differential equations that leads to an optimal approximating scheme. As a result computational results confirm that this method is optimal.