Takuya Tsuchiya

Takuya Tsuchiya, Makoto Nakamura

The computational analysis of the Cauchy problem for semi-linear Klein-Gordon equations in the de Sitter spacetime is considered. Several simulations are performed to show the time-global behaviors of the solutions of the equations in the spacetime based on the structure-preserving scheme. It is remarked that the sufficiently large Hubble constant yields the strong diffusion-effect which gives the long and stable simulations for the defocusing semi-linear terms. The reliability of the simulations is confirmed by the preservation of the numerically modified Hamiltonian of the equations.

Kenta Kobayashi, Takuya Tsuchiya

We consider the error analysis of Lagrange interpolation on triangles and tetrahedrons. For Lagrange interpolation of order one, Babuška and Aziz showed that squeezing a right isosceles triangle perpendicularly does not deteriorate the optimal approximation order. We extend their technique and result to higher-order Lagrange interpolation on both triangles and tetrahedrons. To this end, we make use of difference quotients of functions with two or three variables. Then, the error estimates on squeezed triangles and tetrahedrons are proved by a method that is a straightforward extension of the original given by Babuška-Aziz.

Kenta Kobayashi, Takuya Tsuchiya

We discuss the error analysis of the lowest degree Crouzeix-Raviart and Raviart-Thomas finite element methods applied to a two-dimensional Poisson equation. To obtain error estimations, we use the techniques developed by Babuška-Aziz and the authors. We present error estimates in terms of the circumradius and the diameter of triangles in which the constants are independent of the geometric properties of the triangulations. Numerical experiments confirm the results obtained.

Takuya Tsuchiya, Gen Yoneda

We derive the discretized Maxwell's equations using the discrete variational derivative method (DVDM), calculate the evolution equation of the constraint, and confirm that the equation is satisfied at the discrete level. Numerical simulations showed that the results obtained by the DVDM are superior to those obtained by the Crank-Nicolson scheme. In addition, we study the two types of the discretized Maxwell's equations by the DVDM and conclude that if the evolution equation of the constraint is not conserved at the discrete level, then the numerical results are also unstable.

Aymeric Grodet, Takuya Tsuchiya

Finite element approximations of minimal surface are not always precise. They can even sometimes completely collapse. In this paper, we provide a simple and inexpensive method, in terms of computational cost, to improve finite element approximations of minimal surfaces by local boundary mesh refinements. By highlighting the fact that a collapse is simply the limit case of a locally bad approximation, we show that our method can also be used to avoid the collapse of finite element approximations. We also extend the study of such approximations to partially free boundary problems and give a theorem for their convergence. Numerical examples showing improvements induced by the method are given throughout the paper.

Takuya Tsuchiya, Makoto Nakamura

We perform some simulations of the semilinear Klein--Gordon equation with a power-law nonlinear term and propose each of the quantitative evaluation methods for the stability and convergence of numerical solutions. We also investigate each of the thresholds in the methods by varying the amplitude of the initial value and the mass, and propose appropriate values.

Takuya Tsuchiya, Gen Yoneda

We propose a new numerical scheme of evolution for the Einstein equations using the discrete variational derivative method (DVDM). We derive the discrete evolution equation of the constraint using this scheme and show the constraint preserves in the discrete level. In addition, to confirm the numerical stability using this scheme, we perform some numerical simulations by discretized equations with the Crank-Nicolson scheme and with the new scheme, and we find that the new discretized equations have better stability than that of the Crank-Nicolson scheme.

Kenta Kobayashi, Takuya Tsuchiya

We consider surface area approximations by Lagrange and Crouzeix--Raviart interpolations on triangulations. For Lagrange interpolation, we give an alternative proof for Young's classical result that claims the areas of inscribed polygonal surfaces converge to the area of the original surface under the maximum angle condition on the triangulation. For Crouzeix--Raviart interpolation we show that the approximated surface areas converge to the area of the original surface without any geometric conditions on the triangulation.

Kenta Kobayashi, Takuya Tsuchiya

We present the error analysis of Lagrange interpolation on triangles. A new \textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on triangles are imposed in order to get this type of error estimates.

Kenta Kobayashi, Takuya Tsuchiya

We discuss the error analysis of linear interpolation on triangular elements. We claim that the circumradius condition is more essential then the well-known maximum angle condition for convergence of the finite element method. Numerical experiments show that this condition is the best possible. We also point out that the circumradius condition is closely related to the definition of surface area.