No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

We present an efficient null space free Jacobi–Davidson method to compute the positive eigenvalues of time harmonic Maxwell’s equations. We focus on a class of spatial discretizations that guarantee the existence of discrete vector potentials, such as Yee’s scheme and the edge elements. During the Jacobi–Davidson iteration, the correction process is applied to the vector potential instead. The correction equation is solved approximately as in the standard Jacobi–Davidson approach. The computational cost of the transformation from the vector potential to the corrector is negligible. As a consequence, the expanding subspace automatically stays out of the null space and no extra projection step is needed. Numerical evidence confirms that the proposed scheme indeed outperforms the standard and projection-based Jacobi–Davidson methods by a significant margin.

We study a robust and efficient eigensolver for computing a few smallest positive eigenvalues of the three-dimensional Maxwell’s transmission eigenvalue problem. The discretized governing equations by the Nedelec edge element result in a large-scale quadratic eigenvalue problem (QEP) for which the spectrum contains many zero eigenvalues and the coefficient matrices consist of patterns in the matrix form XY^{−1}Z, both of which prevent existing eigenvalue solvers from being efficient. To remedy these difficulties, we rewrite the QEP as a particular nonlinear eigenvalue problem and develop a secant-type iteration, together with an indefinite locally optimal block preconditioned conjugate gradient method (LOBPCG), to sequentially compute the desired positive eigenvalues. Furthermore, we propose a novel method to solve the linear systems in each iteration of LOBPCG. Intensive numerical experiments show that our proposed method is robust, although the desired real eigenvalues are surrounded by complex eigenvalues.

In this paper, a homotopy continuation method for the computation of nonnegative Z-/H-eigenpairs of a nonnegative tensor is presented. We show that the homotopy continuation method is guaranteed to compute a nonnegative eigenpair. Additionally, using degree analysis, we show that the number of positive Z-eigenpairs of an irreducible nonnegative tensor is odd. A novel homotopy continuation method is proposed to compute an odd number of positive Z-eigenpairs, and some numerical results are presented.

No abstract uploaded!

No abstract uploaded!

In this paper, we analyze the Bregman iterative model using the G-norm. Firstly, we show the convergence of the iterative model. Secondly, using the source condition and the symmetric Bregman distance, we consider the error estimations between the iterates and the exact image both in the case of clean and noisy data. The results show that the Bregman iterative model using the G-norm has the similar good properties as the Bregman iterative model using the L2-norm.

A new Tikhonov regularization method of Fuhry and Reichel [A new Tikhonov regularization method, Numerical Algorithms, 59:433-445, 2011] exhibits the excellent properties for ill-posed problems, but it can only deal with small or moderate size problems because of the expensive computation of singular value decomposition (SVD). In this paper, we extend the above new Tikhonov regularization method to solve large-scale problems, e.g., image restoration problem with periodic boundary conditions, and realize this extending by applying Fast Fourier Transformation (FFT) algorithm to the spectral decomposition of the block circulant with circulant blocks (BCCB) matrices. Experimental results confirm the superiority of our new method.

We use a small positive parameter to change the totalvariation function for unconstrainedMRimage reconstruction to a strictly convex perturbed function. Bregman iteration is applied to solve the modified total-variation MR image (TVMRI) reconstruction problem. A lagged diffusivity fixed-point algorithm is applied to solve the minimization problem in the Bregman iteration. We use the periodic boundary condition and a Fourier transform to accelerate TVMRI reconstruction.RealMR images are used to test the approach in numerical experiments. The experimental results demonstrate that the proposed method is very efficient for TVMRI reconstruction.

The problem of compressive-sensing (CS) L2-L1-TV reconstruc- tion of magnetic resonance (MR) scans from undersampled k-space data has been addressed in numerous studies. However, the regularization parameters in models of CS L2-L1-TV reconstruction are rarely studied. Once the regu- larization parameters are given, the solution for an MR reconstruction model is xed and is less eective in the case of strong noise. To overcome this shortcoming, we present a new alternating formulation to replace the standard L2-L1-TV reconstruction model. A weighted-average alternating minimization method is proposed based on this new formulation and a convergence analysis of the method is carried out. The advantages of and the motivation for the pro- posed alternating formulation are explained. Experimental results demonstrate that the proposed formulation yields better reconstruction results in the case of strong noise and can improve image reconstruction via exible parameter slection.

We use a positive parameter to develop a dierentiable perturbed reconstruction model to solve the L1–L2 magnetic resonance image (MRI) reconstruction problem. We use Bregman iterative formulation to solve the dierentiable perturbed L1–L2 model, and lagged diusivity xed-point iteration to solve the minimization problem in the Bregman iteration. Two Fourier transforms and an inverse Fourier transform are used to accelerate L1–L2 MRI reconstruction. Real MR images are used to test the method in numerical experiments. The results demonstrate that the proposed method is very ecient for L1–L2MRI reconstruction.

Image restoration is a common problem in visual process. In this paper, a modified minimization model is presented, which combines the L1 and L2 fidelity terms with a combined quadratic L2 and TV regularizer just as the regularizer of Cai et al. (2013). The combined regularizer has the priorities of preserving desirable edges and ensuring several kinds of noises can be removed clearly. Split-Bregman algorithm is effi- ciently employed to solve this model and convergence analysis is also discussed. Moreover, we extend the proposed model and algorithm for image restoration involving blurry images and color images. Experimental results show that our proposed model and algorithm have good performance both in visual and ISNR values for different kinds of blurs and noises including mixed noise.

Convergence of a second-order shock-capturing scheme for the system of isentropic gas dynamics with $ {L^\infty }$ initial data is established by analyzing the entropy dissipation measures. This scheme is modified from the classical MUSCL scheme to treat the vacuum problem in gas fluids and to capture local entropy near shock waves. Convergence of this scheme for the piston problem is also discussed.

This is the first of a series of papers on the subject of projection methods for viscous incompressible flow calculations. The purpose of these papers is to provide a thorough understanding of the numerical phenomena involved in the projection methods, particularly when boundaries are present, and point to ways of designing more efficient, robust, and accurate numerical methods based on the primitive variable formulation. This paper contains the following topics: 1. convergence and optimal error estimates for both velocity and pressure up to the boundary; 2. explicit characterization of the numerical boundary layers in the pressure approximations and the intermediate velocity fields; 3. the effect of choosing different numerical boundary conditions at the projection step. We will show that a different choice of boundary conditions gives rise to different boundary layer structures. In particular, the straightforward Dirichlet boundary condition for the pressure leads to O(1) numerical boundary layers in the pressure and deteriorates the accuracy in the interior; and 4. postprocessing the numerical solutions to get more accurate approximations for the pressure.

We begin a systematical study on the effect of numerical viscosities. In this paper we investigate the behavior of shock-capturing methods for slowly moving shocks. It is known that for slowly moving shocks even a first-order scheme, such as the Godunov or Roe type methods, will generate downstream oscillatory wave patterns that cannot be effectively damped by the dissipation of these first-order schemes. The purpose of this paper is to understand the formation and behavior of these downstream patterns. Our study shows that the downstream errors are generated by the unsteady nature of the viscous shock profiles and behave diffusively. The scenario is as follows. When solving the compressible Euler equations by shock capturing methods, the smeared density profile introduces a momentum spike at the shock location if the shock moves slowly. Downstream waves will necessarily emerge in order to balance the momentum mass carried by the spike for the momentum conservation. Although each family of waves decays inl∞andl2while they preserve the same mass, the perturbing nature of the viscous or spike profile is a constant source for the generation of new downstream waves, causing spurious solutions foralltime. Higher order TVD or ENO type interpolations accentuate this problem.

In this paper, we review some recent progress made in [4, 5, 6] on finite difference schemes for viscous incompressible flows using vorticity formulation. The main purpose of this series of papers [4, 5, 6] is to resurrect the idea of using local vorticity boundary condition for unsteady calculation. The emphasis is on simplicity of the methods. Three main issues will be discussed: efficient time-stepping procedures and cell Reynolds number constraints, efficient methods in 3D on non-staggered grids and efficient high order methods using compact differencing.

This paper discusses three basic issues related to the design of finite difference schemes for unsteadyviscous incompressible flows using vorticity formulations: the boundary condition for vorticity, an efficient time-stepping procedure, and the relation between these schemes and the ones based on velocity-pressure formulation. We show that many of the newly developed global vorticity boundary conditions can actually be written as some local formulas derived earlier. We also show that if we couple a standard centered difference scheme with third- or fourth-order explicit Runge-Kutta methods, the resulting schemes have nocell Reynolds number constraints. For high Reynolds number flows, these schemes are stable under the CFL condition given by the convective terms. Finally, we show that the classical MAC scheme is the same as Thom's formula coupled with second-order centered differences in the interior, in the sense that one can define discrete vorticity in a natural way for the MAC scheme and get the same values as the ones computed from Thom's formula. We use this to derive an efficient fourth-order Runge-Kutta time discretization for the MAC scheme from the one for Thom's formula. We present numerical results for driven cavity flow at high Reynolds number (10 ).

A new fourth-order accurate finite difference scheme for the computation of unsteady viscous incompressible flows is introduced. The scheme is based on the vorticity-stream function formulation. It is essentially compact and has the nice features of a compact scheme with regard to the treatment of boundary conditions. It is also very efficient, at every time step or Runge–Kutta stage, only two Poisson-like equations have to be solved. The Poisson-like equations are amenable to standard fast Poisson solvers usually designed for second order schemes. Detailed comparison with the second-order scheme shows the clear superiority of this new fourth-order scheme in resolving both the boundary layers and the gross features of the flow. This efficient fourth-order scheme also made it possible to compute the driven cavity flow at Reynolds number 106on a 10242grid at a reasonable cost. Fourth-order convergence is proved under mild regularity requirements. This is the first such result to our knowledge

This is the second of a series of papers on the subject of projection methods for viscous incompressible flow calculations. The purpose of the present paper is to explain why the accuracy of the velocity approximation is not affected by (1) the numerical boundary layers in the approximation of pressure and the intermediate velocity field and (2) the noncommutativity of the projection operator and the laplacian. This is done by using a Godunov–Ryabenki type of analysis in a rigorous fashion. By doing so, we hope to be able to convey the message that normal mode analysis is basically sufficient for understanding the stability and accuracy of a finite-difference method for the Navier–Stokes equation even in the presence of boundaries. As an example, we analyze the second-order projection method based on pressure increment formulations used by van Kan and Bell, Colella, and Glaz. The leading order error term in this case is of $O(\Delta t)$ and behaves as high frequency oscillations over the whole domain, compared with the $O(\Delta t^{{1 / 2}} )$ numerical boundary layers found in the second-order Kim–Momn method.

Simple, efficient, and accurate finite difference methods are introduced for 3D unsteady viscous incompressible flows in the vorticity–vector potential formulation on nonstaggered grids. Two different types of methods are discussed. They differ in the implementation of the normal component of the vorticity boundary condition and consequently the enforcement of the divergence free condition for vorticity. Both second-order and fourth-order accurate schemes are developed. A detailed accuracy test is performed, revealing the structure of the error and the effect of how the convective terms are discretized near the boundary. The influence of the divergence free condition for vorticity to the overall accuracy is studied. Results on the cubic driven cavity flow at Reynolds number 500 and 3200 are shown and compared with that of the MAC scheme.