Searcharxiv⌕ Search

arXiv subjects

Yuto Miyatake

Publications and source records attributed to Yuto Miyatake.

41 records · Page 3Linked to original sources

A cost-efficient variant of the incremental Newton iteration for the matrix $p$th root

Incremental Newton (IN) iteration, proposed by Iannazzo, is stable for computing the matrix $p$th root, and its computational cost is $\mathcal{O}(n^3p)$ flops per iteration. In this paper, a cost-efficient variant of IN iteration is presented. The computational cost of the variant well agrees with $\mathcal{O} (n^3 \log p)$ flops per iteration, if $p$ is up to at least 100.

math.NA↗

Energy-preserving $H^1$-Galerkin schemes for the Hunter--Saxton equation

We consider the numerical integration of the Hunter--Saxton equation, which models the propagation of weakly nonlinear orientation waves. For the equation, we present two weak forms and their Galerkin discretizations. The Galerkin schemes preserve the Hamiltonian of the equation and can be implemented with cheap $H^1$ elements. Numerical experiments confirm the effectiveness of the schemes.

math.NA↗

A characterization of energy-preserving methods and the construction of parallel integrators for Hamiltonian systems

High order energy-preserving methods for Hamiltonian systems are presented. For this aim, an energy-preserving condition of continuous stage Runge--Kutta methods is proved. Order conditions are simplified and parallelizable conditions are also given. The computational cost of our high order methods is comparable to that of the average vector field method of order two.

math.NA↗

On a relationship between the T-congruence Sylvester equation and the Lyapunov equation

We consider the T-congruence Sylvester equation $AX+X^{\rm T}B=C$, where $A\in \mathbb R^{m\times n}$, $B\in \mathbb R^{n\times m}$ and $C\in \mathbb R^{m\times m}$ are given, and matrix $X \in \mathbb R^{n\times m}$ is to be determined. The T-congruence Sylvester equation has recently attracted attention because of a relationship with palindromic eigenvalue problems. For example, necessary and sufficient conditions for the existence and uniqueness of solutions, and numerical solvers have been intensively studied. In this note, we will show that, under a certain condition, the T-congruence Sylvester equation can be transformed into the Lyapunov equation. This may lead to further properties and efficient numerical solvers by utilizing a great deal of studies on the Lyapunov equation.

math.NA↗

Structure-preserving integrators for the Benjamin-type equations

The numerical integration of the Benjamin and Benjamin--Ono equations are considered. They are non-local partial differential equations involving the Hilbert transform, and due to this, so far quite few structure-preserving integrators have been proposed. In this paper, a new reformulation of the equations is stated, and new structure-preserving discretizations are proposed based on it. Numerical experiments confirm the effectiveness of the proposed integrators.

math.NA↗