Minimizing multi-homogeneous Bézout numbers by a local search method

Consider the multi-homogeneous homotopy continuation method for solving a system of polynomial equations. For any partition of variables, the multi-homogeneous Bézout number bounds the number of isolated solution curves one has to follow in the method. This paper presents a local search method for finding a partition of variables with minimal multi-homogeneous Bézout number. As with any other local search method, it may give a local minimum rather than the minimum over all possible homogenizations. Numerical examples show the efficiency of this local search method.

     

A quadrature-based approach to improving the collocation method

Summary The collocation method is a popular method for the approximate solution of boundary integral equations, but typically does not achieve the high order of convergence reached by the Galerkin method in appropriate negative norms. In this paper a quadrature-based method for improving upon the collocation method is proposed, and developed in detail for a particular case. That case involves operators with even symbol (such as the logarithmic potential) operating on 1-periodic functions; a smooth-spline trial space of odd degree, with constant mesh spacingh=1/n; and a quadrature rule with 2n points (where ann-point quadrature rule would be equivalent to the collocation method). In this setting it is shown that a special quadrature rule (which depends on the degree of the splines and the order of the operator) can yield a maximum order of convergence two powers ofh higher than the collocation method.     

A two-grid method for elliptic problem with boundary layers

A two-grid method for the elliptic equation with a small parameter ε multiplying the highest derivative is investigated. The difference schemes with the property of ε-uniform convergence on a uniform mesh and on Shishkin mesh are considered. In both cases, a two-grid method for resolving the difference scheme is investigated. A two-grid method has features that are concerned with a uniform convergence of a difference scheme. To increase the accuracy, the Richardson extrapolation in two-grid method is applied. Numerical results are discussed.     

Local limit theorems for occupancy models

We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both Stein's method for distributional approximation and Stein's method for concentration. As applications, we prove local central limit theorems with rate of convergence for the number of germs with d neighbors in a germ‐grain model, and the number of degree‐d vertices in an Erd?s‐Rényi random graph. In both cases, the error rate is optimal, up to logarithmic factors.     

On polyhedral and second-order cone decompositions of semidefinite optimization problems

We study a cutting-plane method for semidefinite optimization problems, and supply a proof of the method’s convergence, under a boundedness assumption. By relating the method’s rate of convergence to an initial outer approximation’s diameter, we argue the method performs well when initialized with a second-order cone approximation, instead of a linear approximation. We invoke the method to provide bound gaps of 0.5–6.5% for sparse PCA problems with 1000s of covariates, and solve nuclear norm problems over 500 × 500 matrices.     

Exact solutions for the generalized Klein–Gordon equation via a transformation and Exp-function method and comparison with Adomian’s method

In this paper, a suitable transformation and a so-called Exp-function method are used to obtain different types of exact solutions for the generalized Klein–Gordon equation. These exact solutions are in full agreement with the previous results obtained in Refs. [Sirendaoreji, Auxiliary equation method and new solutions of Klein–Gordon equations, Chaos, Solitons & Fractals 31 (4) (2007) 943–950; Huiqun Zhang, Extended Jacobi elliptic function expansion method and its applications, Communications in Nonlinear Science and Numerical Simulation, 12 (5) (2007) 627–635]. One of these exact solutions is compared with the approximate solutions obtained by the modified decomposition method. Accurate numerical results for a wider range of time are obtained after using different types of ADM-Padè approximation. Our results show that the Exp-function method is very effective in finding exact solutions for the problem considered while the modified decomposition method is very powerful in finding numerical solutions with good accuracy for nonlinear PDE without any need for a transformation or perturbation.     

Moving planes, moving spheres, and a priori estimates

In this paper, we use the method of moving planes and the method of moving spheres to obtain a priori estimates for the solutions of semi-linear elliptic equations.Using the ‘method of moving planes’, we establish a sharper estimate on the solutions for prescribing scalar curvature equations with indefinite curvature functions and thus generalized a resent result of Lin.Applying ‘the method of moving spheres’, we give a different proof for a well-known sup+inf inequality established by Brezis, Li and Shafrir.     

Continuous-discontinuous finite element method for convection-diffusion problems with characteristic layers

We study convergence properties of a numerical method for convection-diffusion problems with characteristic layers on a layer-adapted mesh. The method couples standard Galerkin with an h-version of the nonsymmetric discontinuous Galerkin finite element method with bilinear elements. In an associated norm, we derive the error estimate as well as the supercloseness result that are uniform in the perturbation parameter. Applying a post-processing operator for the discontinuous Galerkin method, we construct a new numerical solution with enhanced convergence properties.     

Parameter estimation in convection dominated nonlinear convection–diffusion problems by the relaxation method and the adjoint equation

The development of numerical methods for strongly nonlinear convection–diffusion problems with dominant convection is an ongoing topic in numerical analysis. For inverse problems in this setting, there is a need of fast and accurate solvers. Here, we present operator splitting with a Riemann solver for the convective part and a relaxation method for the diffusive part, as a means to achieve this goal. Combined with the adjoint equation method this allows us to solve inverse problems within reasonable time frames and with modest computing power. As an example, the dual-well experiment is considered and the adjoint method is compared with a conjugate gradient algorithm and a Levenberg–Marquardt type of iteration method.     

A variant of Nitsche's method

We present a method that aims to reconcile Nitsche's method with the traditional finite element method ('weak' versus 'strong implementation' of essential boundary conditions). We retain the original idea of a variational formulation based on an extended energy, but replace the original boundary terms by domain terms involving weak derivatives. The solution of the proposed method coincides, for the Poisson problem, with the one of the traditional method, which in particular shows monotonicity under the standard angle condition for the Courant element. For more general second-order problems, it allows for the weighting of boundary terms inherent to Nitsche's method. This is of particular interest for singularly perturbed problems.     

Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices

In this paper, the problem of inverting regular matrices with arbitrarily large condition number is treated in double precision defined by IEEE 754 floating point standard. In about 1984, Rump derived a method for inverting arbitrarily ill-conditioned matrices. The method requires the possibility to calculate a dot product in higher precision. Rump's method is of theoretical interest. Rump made it clear that inverting an arbitrarily ill-conditioned matrix in single or double precision does not produce meaningless numbers, but contains a lot of information in it. Rump's method uses such inverses as preconditioners. Numerical experiments exhibit that Rump's method converges rapidly for various matrices with large condition numbers. Why Rump's method is so efficient for inverting arbitrarily ill-conditioned matrices is a little mysterious. Thus, to prove its convergence is an interesting problem in numerical error analysis. In this article, a convergence theorem is presented for a variant of Rump's method.     

Kepler equation and accelerated Newton method

We study the efficiency of the accelerated Newton method (Garlach, SIAM Rev. 36 (1994) 272–276) for several orders of convergence versus Danby's method for the resolution of Kepler's equation; we find that the cited method of order three is competitive with Danby's method and the classical Newton's method. We also generalize the accelerated Newton method for the resolution of system of algebraic equations, obtaining a formula of order three and a proof of its convergence; its application to several examples shows that its efficiency is greater than Newton's method.     

Modified Newton’s method for systems of nonlinear equations with singular Jacobian

It is well known that Newton’s method for a nonlinear system has quadratic convergence when the Jacobian is a nonsingular matrix in a neighborhood of the solution. Here we present a modification of this method for nonlinear systems whose Jacobian matrix is singular. We prove, under certain conditions, that this modified Newton’s method has quadratic convergence. Moreover, different numerical tests confirm the theoretical results and allow us to compare this variant with the classical Newton’s method.     

A Fourier spectral-discontinuous Galerkin method for time-dependent 3-D Schrödinger–Poisson equations with discontinuous potentials

In this paper, we propose a high order Fourier spectral-discontinuous Galerkin method for time-dependent Schrödinger–Poisson equations in 3-D spaces. The Fourier spectral Galerkin method is used for the two periodic transverse directions and a high order discontinuous Galerkin method for the longitudinal propagation direction. Such a combination results in a diagonal form for the differential operators along the transverse directions and a flexible method to handle the discontinuous potentials present in quantum heterojunction and supperlattice structures. As the derivative matrices are required for various time integration schemes such as the exponential time differencing and Crank Nicholson methods, explicit derivative matrices of the discontinuous Galerkin method of various orders are derived. Numerical results, using the proposed method with various time integration schemes, are provided to validate the method.     

A Newton-like method for nonlinear system of equations

Tanabe (1988) proposed a variation of the classical Newton method for solving nonlinear systems of equations, the so-called Centered Newton method. His idea was based on a deviation of the Newton direction towards a variety called “Central Variety”. In this paper we prove that the Centered Newton method is locally convergent and we present a globally convergent method based on the centered direction used by Tanabe. We show the effectiveness of our proposal for solving nonlinear system of equations and compare with the Newton method with line search.     

Chebyshev pseudospectral method for computing numerical solution of convection–diffusion equation

A method for computing highly accurate numerical solutions of 1D convection–diffusion equations is proposed. In this method, the equation is first discretized with respect to the spatial variable, transforming the original problem into a set of ordinary differential equations, and then the resulting system is integrated in time by the fourth-order Runge–Kutta method. Spatial discretization is done by using the Chebyshev pseudospectral collocation method. Before describing the method, we review a finite difference-based method by Salkuyeh [D. Khojasteh Salkuyeh, On the finite difference approximation to the convection–diffusion equation, Appl. Math. Comput. 179 (2006) 79–86], and, contrary to the proposal of the author, we show that this method is not suitable for problems involving time dependent boundary conditions, which calls for revision. Stability analysis based on pseudoeigenvalues to determine the maximum time step for the proposed method is also carried out. Superiority of the proposed method over a revised version of Salkuyeh’s method is verified by numerical examples.     

A dual iterative substructuring method with a penalty term

An iterative substructuring method with Lagrange multipliers is considered for second order elliptic problems, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point problem by addition of a penalty term with a positive penalization parameter η, we propose a dual substructuring method which is implemented iteratively by the conjugate gradient method. In spite of the absence of any preconditioners, it is shown that the proposed method is numerically scalable in the sense that for a large value of η, the condition number of the resultant dual problem is bounded by a constant independent of both the subdomain size H and the mesh size h. Computational issues and numerical results are presented. This work was partially supported by the SRC/ERC program of MOST/KOSEF(R11-2002-103).     

Statistic D-Property of Voronoi Summation Methods of Class W Q 2

We propose a general method for obtaining Tauberian theorems with remainder for one class of Voronoi summation methods for double sequences of elements of a locally convex, linear topological space. This method is a generalization of the Davydov method of C-points.     

Extension of VIKOR method for decision making problem based on hesitant fuzzy set

The multiple criteria decision making (MCDM) methods VIKOR and TOPSIS are all based on an aggregating function representing “closeness to the ideal”, which originated in the compromise programming method. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an “individual regret” for the “opponent”, which is an effective tool in multi-criteria decision making, particularly in a situation where the decision maker is not able, or does not know to express his/her preference at the beginning of system design. The TOPSIS method determines a solution with the shortest distance to the ideal solution and the greatest distance from the negative-ideal solution, but it does not consider the relative importance of these distances. And, the hesitant fuzzy set is a very useful tool to deal with uncertainty, which can be accurately and perfectly described in terms of the opinions of decision makers. In this paper, we develop the E-VIKOR method and TOPSIS method to solve the MCDM problems with hesitant fuzzy set information. Firstly, the hesitant fuzzy set information and corresponding concepts are described, and the basic essential of the VIKOR method is introduced. Then, the problem on multiple attribute decision marking is described, and the principles and steps of the proposed E-VIKOR method and TOPSIS method are presented. Finally, a numerical example illustrates an application of the E-VIKOR method, and the result by the TOPSIS method is compared.     

On iterative methods for the quadratic matrix equation with M-matrix

In this paper, we consider Newton’s method and Bernoulli’s method for a quadratic matrix equation arising from an overdamped vibrating system. By introducing M-matrix to this equation, we provide a sufficient condition for the existence of the primary solution. Moreover, we show that Newton’s method and Bernoulli’s method with an initial zero matrix converge to the primary solvent under the proposed sufficient condition.