This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a discrete-type flow depending only on the initial matrix pencil. Via this recursion relationship, we propose an accelerated iterative method to compute the stable subspace and use it to provide a theoretical result to solve the principal square root of a given matrix, both nonsingular and singular. We show that this method can not only find out the matrix square root, but also construct an iterative approach which converges to the square root with any desired order.

The main purpose of this paper is to analyze the stability and error estimates of the local discontinuous Galerkin (LDG) methods coupled with implicit-explicit (IMEX) time discretization schemes, for solving multi-dimensional convection-diffusion equations with nonlinear convection. By establishing the important relationship between the gradient and the interface jump of the numerical solution with the independent numerical solution of the gradient in the LDG method, on both rectangular and triangular elements, we can obtain the same stability results as in the one-dimensional case, i.e, the IMEX LDG schemes are unconditionally stable for the multi-dimensional convection-diffusion problems, in the sense that the time-step $\dt$ is only required to be upper-bounded by a positive constant independent of the spatial mesh size $h$. Furthermore, by the aid of the so-called elliptic projection and the adjoint argument, we can also obtain optimal error estimates in both space and time, for the corresponding fully discrete IMEX LDG schemes, under the same condition, i.e, if piecewise polynomial of degree $k$ is adopted on either rectangular or triangular meshes, we can show the convergence accuracy is of order $\Ocal(h^{k+1}+\dt^s)$ for the $s$-th order IMEX LDG scheme ($s=1,2,3$) under consideration. Numerical experiments are also given to verify our main results.

In this paper, we explore a unified way to construct smoothing functions for solving the absolute value equation associated with second-order cone (SOCAVE). Numerical comparisons are presented, which illustrate what kinds of smoothing functions work well along with the smoothing Newton algorithm. In particular, the numerical experiments show that the well known loss function widely used in engineering community is the worst one among the constructed smoothing functions, which indicates that the other proposed smoothing functions can be employed for solving engineering problems.

It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the "curse of dimensionality" in some degree. In this note, we first give the error estimate of hyperbolic cross (HC) approximations with generalized Hermite functions. The exponential convergence in both regular and optimized hyperbolic cross approximations has been shown. Moreover, the error estimate of Hermite spectral method to high-dimensional linear parabolic PDEs with HC approximations has been investigated in the properly weighted Korobov spaces. The numerical result verifies the exponential convergence of this approach.

Consider the problem of reconstructing unknown Robin inclusions inside a heat conductor from boundary measurements. This problem arises from active thermography and is formulated as an inverse boundary value problem for the heat equation. In our previous works, we proposed a sampling-type method for reconstructing the boundary of the Robin inclusion and gave its rigorous mathematical justification. This method is non-iterative and based on the characterization of the solution to the so-called Neumann-to-Dirichlet map gap equation. In this paper, we give a further investigation of the reconstruction method from both the theoretical and numerical points of view. First, we clarify the solvability of the Neumann-to-Dirichlet map gap equation and establish a relation of its solution to the Green function associated with an initial-boundary value problem for the heat equation inside the Robin inclusion. This naturally provides a way of computing this Green function from the Neumann-to-Dirichlet map and explains what is the input for the linear sampling method. Assuming that the Neumann-to-Dirichlet map gap equation has a unique solution, we also show the convergence of our method for noisy measurements. Second, we give the numerical implementation of the reconstruction method for two-dimensional spatial domains. The measurements for our inverse problem are simulated by solving the forward problem via the boundary integral equation method. Numerical results are presented to illustrate the efficiency and stability of the proposed method. By using a finite sequence of transient input over a time interval, we propose a new sampling method over the time interval by single measurement which is most likely to be practical.