Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumerical scheme based on the spectral method for calculating nonlinear hyperbolic evolution equations
72
0
0.0
(
0
)
Added by
Yoritaka Iwata
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
High-precision numerical scheme for nonlinear hyperbolic evolution equations is proposed based on the spectral method. The detail discretization processes are discussed in case of one-dimensional Klein-Gordon equations. In conclusion, a numerical scheme with the order of total calculation cost $O(N log 2N)$ is proposed. As benchmark results, the relation between the numerical precision and the discretization unit size are demonstrated.
rate research
Read More
We numerically study solitary waves in the coupled nonlinear Schrodinger equations. We detect pitchfork bifurcations of the fundamental solitary wave and compute eigenvalues and eigenfunctions of the corresponding eigenvalue problems to determine the spectral stability of solitary waves born at the pitchfork bifurcations. Our numerical results demonstrate the theoretical ones which the authors obtained recently. We also compute generalized eigenfunctions associated with the zero eigenvalue for the bifurcated solitary wave exhibiting a saddle-node bifurcation, and show that it does not change its stability type at the saddle-node bifurcation point.
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility method with a suitable Carleman weight function. The presence of the Carleman weight function allows us to employ a Carleman estimate to prove the convergence of the sequence generated by the iterative scheme above to the desired solution. The convergence of the iteration is fast at an exponential rate without the need of an initial good guess. We apply this method to compute solutions to some general quasilinear elliptic equations and a large class of first-order Hamilton-Jacobi equations. Numerical results are presented.
This article is concerned with the derivation of numerical reconstruction schemes for the inverse moving source problem on determining source profiles in (time-fractional) evolution equations. As a continuation of the theoretical result on the uniqueness, we adopt a minimization procedure with regularization to construct iterative thresholding schemes for the reduced backward problems on recovering one or two unknown initial value(s). Moreover, an elliptic approach is proposed to solve a convection equation in the case of two profiles.
Spectral residual methods are powerful tools for solving nonlinear systems of equations without derivatives. In a recent paper, it was shown that an acceleration technique based on the Sequential Secant Method can greatly improve its efficiency and robustness. In the present work, an R implementation of the method is presented. Numerical experiments with a widely used test bed compares the presented approach with its plain (i.e. non-accelerated) version that makes part of the R package BB. Additional numerical experiments compare the proposed method with NITSOL, a state-of-the-art solver for nonlinear systems. The comparison shows that the acceleration process greatly improves the robustness of its counterpart included in the existent R package. As a by-product, an interface is provided between R and the consolidated CUTEst collection, which contains over a thousand nonlinear programming problems of all types and represents a standard for evaluating the performance of optimization methods.
We introduce a high-order numerical scheme for fractional ordinary differential equations with the Caputo derivative. The method is developed by dividing the domain into a number of subintervals, and applying the quadratic interpolation on each subinterval. The method is shown to be unconditionally stable, and for general nonlinear equations, the uniform sharp numerical order $3- u$ can be rigorously proven for sufficiently smooth solutions at all time steps. The proof provides a general guide for proving the sharp order for higher-order schemes in the nonlinear case. Some numerical examples are given to validate our theoretical results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
