About: Finite difference method is a research topic. Over the lifetime, 21603 publications have been published within this topic receiving 468852 citations. The topic is also known as: Finite-difference methods & FDM.
TL;DR: This article proposes to discretize the problem of linear elastic homogenization by finite differences on a staggered grid and introduces fast and robust solvers and reduces the memory consumption of the Moulinec–Suquet algorithms by 50%.
TL;DR: This work considers the enhancement of accuracy, by means of a simple post-processing technique, for finite element approximations to transient hyperbolic equations, and shows results displaying the sharpness of the estimates.
Abstract: We consider the enhancement of accuracy, by means of a simple post-processing technique, for finite element approximations to transient hyperbolic equations. The post-processing is a convolution with a kernel whose support has measure of order one in the case of arbitrary unstructured meshes; if the mesh is locally translation invariant, the support of the kernel is a cube whose edges are of size of the order of Δx only. For example, when polynomials of degree k are used in the discontinuous Galerkin (DG) method, and the exact solution is globally smooth, the DG method is of order k+1/2 in the L2-norm, whereas the post-processed approximation is of order 2k + 1; if the exact solution is in L2 only, in which case no order of convergence is available for the DG method, the post-processed approximation converges with order k + 1/2 in L2(Ω0), where Ω0 is a subdomain over which the exact solution is smooth. Numerical results displaying the sharpness of the estimates are presented.
TL;DR: In this paper, numerical methods for solving the integrodifferential, integral, and surface-integral forms of the neutron transport equation are reviewed, and the solution methods are shown to evolve from only a few...
Abstract: Numerical methods for solving the integrodifferential, integral, and surface-integral forms of the neutron transport equation are reviewed. The solution methods are shown to evolve from only a few ...
TL;DR: The Difference Calculus First-Order Difference Equations Linear Difference Equation with Constant Coefficients Linear Partial Different Equations (LPDE) Nonlinear Difference Equational Problems.
Abstract: The Difference Calculus First-Order Difference Equations Linear Difference Equations Linear Difference Equations with Constant Coefficients Linear Partial Difference Equations Nonlinear Difference Equations Problems Appendix Notes and References Bibliography Index
TL;DR: In this paper, the authors established uniform error bounds for finite difference methods for the nonlinear Schrodinger equation (NLS) perturbed by the wave operator with a perturbation strength described by a dimensionless parameter.
Abstract: We establish uniform error estimates of finite difference methods for the nonlinear Schrodinger equation (NLS) perturbed by the wave operator (NLSW) with a perturbation strength described by a dimensionless parameter $\varepsilon$ ($\varepsilon\in(0,1]$). When $\varepsilon\to0^+$, NLSW collapses to the standard NLS. In the small perturbation parameter regime, i.e., $0<\varepsilon\ll1$, the solution of NLSW is perturbed from that of NLS with a function oscillating in time with $O(\varepsilon^2)$-wavelength at $O(\varepsilon^4)$ and $O(\varepsilon^2)$ amplitudes for well-prepared and ill-prepared initial data, respectively. This high oscillation of the solution in time brings significant difficulties in establishing error estimates uniformly in $\varepsilon$ of the standard finite difference methods for NLSW, such as the conservative Crank-Nicolson finite difference (CNFD) method, and the semi-implicit finite difference (SIFD) method. We obtain error bounds uniformly in $\varepsilon$, at the order of $O(h^2+\tau)$ and $O(h^2+\tau^{2/3})$ with time step $\tau$ and mesh size $h$ for well-prepared and ill-prepared initial data, respectively, for both CNFD and SIFD in the $l^2$-norm and discrete semi-$H^1$ norm. Our error bounds are valid for general nonlinearity in NLSW and for one, two, and three dimensions. To derive these uniform error bounds, we combine $\varepsilon$-dependent error estimates of NLSW, $\varepsilon$-dependent error bounds between the numerical approximate solutions of NLSW and the solution of NLS, together with error bounds between the solutions of NLSW and NLS. Other key techniques in the analysis include the energy method, cut-off of the nonlinearity, and a posterior bound of the numerical solutions by using the inverse inequality and discrete semi-$H^1$ norm estimate. Finally, numerical results are reported to confirm our error estimates of the numerical methods and show that the convergence rates are sharp in the respective parameter regimes.