학과 세미나 및 콜로퀴엄
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) by embedding physical laws directly into the learning process. However, a critical question remains: How do we validate that PINNs accurately solve these PDEs?
This talk explores the types of mathematical validation required to ensure that PINNs can reliably approximate solutions to PDEs. We will discuss the conditions under which PINNs can converge to the correct solution, the relationship between minimizing residuals and achieving accurate results, and the role of optimization algorithms in this process. Our goal is to provide a clear understanding of the theoretical foundations needed to trust PINNs in practical applications while addressing the challenges in this emerging field.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for numerical solution of partial differential equations. We start with a detailed explanation of the method for the Poisson equation and then extend the study to other PDEs. We shall show that the numerical solution can approximate the exact PDE solution very well. Then we present a large amount of numerical experimental results to demonstrate the performance of the method over the two- and three-dimensional settings.
We consider the Euler-Poisson system, which describes the ion dynamics in electrostatic plasmas. In plasma physics, the pressureless model is often employed to simplify analysis. However, the behavior of solutions to the pressureless model generally differs from that of the isothermal model, both qualitatively and quantitatively - for instance, in the case of blow-up solutions.
In previous work, we investigated a class of initial data leads to finite-time C^1 blow-up solutions. In order to understand more precise blow-up profiles, we construct blow-up solutions converging to the stable self-similar blow-up profile of the Burgers equation. For the isothermal model, the density and velocity exhibit C^{1/3} regularity at the blow-up time. For the pressureless model, we provide the exact blow-up profile of the density function, showing that the density is not a Dirac measure at the moment of blow-up.
We also consider the peaked traveling solitary waves, which are not differentiable at a point. Our findings show that the singularities of these peaked solitary waves have nothing to do with the Burgers blow-up singularity. We study numerical solutions to the Euler-Poisson system to provide evidence of whether there are solutions whose blow-up nature is not shock-like.
This talk is based on collaborative work with Junho Choi (KAIST), Yunjoo Kim, Bongsuk Kwon, Sang-Hyuck Moon, and Kwan Woo (UNIST)
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.
The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.