A Jacobi–Davidson type method for the product eigenvalue problem

We propose a Jacobi–Davidson type method to compute selected eigenpairs of the product eigenvalue problem _Am?_A1x=λx,$A_m?A_{1}x=\lambda x,$ where the matrices may be large and sparse. To avoid difficulties caused by a high condition number of the product matrix, we split up the action of the product matrix and work with several search spaces. We generalize the Jacobi–Davidson correction equation and the harmonic and refined extraction for the product eigenvalue problem. Numerical experiments indicate that the method can be used to compute eigenvalues of product matrices with extremely high condition numbers.     

Successive projection method for solving the unbalanced Procrustes problem

We present a successive projection method for solving the unbalanced Procrustes problem: given matrix A∈Rn×n and B∈Rn×k, n>k, minimize the residual‖AQ-B‖F with the orthonormal constraint QTQ = Ik on the variant Q∈Rn×k. The presented algorithm consists of solving k least squares problems with quadratic constraints and an expanded balance problem at each sweep. We give a detailed convergence analysis. Numerical experiments reported in this paper show that our new algorithm is superior to other existing methods.     

A mixed problem for the steady Navier–Stokes equations

We consider a mixed boundary problem for the Navier–Stokes equations in a bounded Lipschitz two-dimensional domain: we assign a Dirichlet condition on the curve portion of the boundary and a slip zero condition on its straight portion. We prove that the problem has a solution provided the boundary datum and the body force belong to a Lebesgue’s space and to the Hardy space respectively.     

A new method of solving the coefficient inverse problem

This paper is concerned with the new method for solving the coefficient inverse problem in the reproducing kernel space. It is different from the previous studies. This method gives accurate results and shows that it is valid by the numerical example.     

A singular Cauchy problem for the Euler–Poisson–Darboux equation

We consider a singular Cauchy problem for the Euler–Poisson–Darboux equation of Fuchsian type in the time variable with ramified Cauchy data. In this paper we establish an expansion of the solutions in a series of hypergeometric functions and then investigate the nature of the singularities of the solutions.     

A convergent FEM-DG method for the compressible Navier–Stokes equations

This paper presents a new numerical method for the compressible Navier–Stokes equations governing the flow of an ideal isentropic gas. To approximate the continuity equation, the method utilizes a discontinuous Galerkin discretization on piecewise constants and a basic upwind flux. For the momentum equation, the method is a new combined discontinuous Galerkin and finite element method approximating the velocity in the Crouzeix–Raviart finite element space. While the diffusion operator is discretized in a standard fashion, the convection and time-derivative are discretized using discontinuous Galerkin on the element average velocity and a Lax–Friedrich type flux. Our main result is convergence of the method to a global weak solution as discretization parameters go to zero. The convergence analysis constitutes a numerical version of the existence analysis of Lions and Feireisl.     

A fast matrix–vector multiplication method for solving the radiosity equation

A “fast matrix–vector multiplication method” is proposed for iteratively solving discretizations of the radiosity equation (I — К)u = E. The method is illustrated by applying it to a discretization based on the centroid collocation method. A convergence analysis is given for this discretization, yielding a discretized linear system (I — K _n )u _n = E _n. The main contribution of the paper is the presentation of a fast method for evaluating multiplications K_n v, avoiding the need to evaluate K_n explicitly and using fewer than O(n ²) operations. A detailed numerical example concludes the paper, and it illustrates that there is a large speedup when compared to a direct approach to discretization and solution of the radiosity equation. The paper is restricted to the surface S being unoccluded, a restriction to be removed in a later paper. This revised version was published online in June 2006 with corrections to the Cover Date.     

A meshfree method for solving the Monge–Ampère equation

Numerical Algorithms - This paper solves the two-dimensional Dirichlet problem for the Monge-Ampère equation by a strong meshless collocation technique that uses a polynomial trial space and...     

Abstract Cauchy problem for the Bessel–Struve equation

We consider the Cauchy problem for the Bessel–Struve equation in a Banach space. A sufficient condition for the solvability of this problem is proved, and the solution operator is written in explicit form via the Bessel and Struve operator functions. A number of properties is established for the solutions.     

On the Cauchy–Gelfand problem

The problem posed by Gelfand on the asymptotic behavior (in time) of solutions to the Cauchy problem for a first-order quasilinear equation with Riemann-type initial conditions is considered. By applying the vanishing viscosity method with uniform estimates, exact asymptotic expansions in the Cauchy–Gelfand problem are obtained without a priori assuming the monotonicity of the initial data, and the initial-data parameters responsible for the localization of shock waves are described.     

A combinatorial optimization algorithm for solving the branchwidth problem

In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, by means of combinatorial algorithms that operate on branch decompositions. We develop an implicit enumeration algorithm for the optimal branch decomposition problem and examine its performance on a set of classical graph instances.     

Algorithm for solving the Navier–Stokes equations for the modeling of creeping flows

We study a coupled algorithm for solving the two-dimensional Navier–Stokes equations in the stream function–vorticity variables. The algorithm is based on a finite-difference scheme in which the inertial terms in the vortex transport equation are taken from the lower time layer and the dissipative terms, from the upper time layer. In the linear approximation, we study the stability of this algorithm and use test computations to show its advantages when modeling flows at moderate Reynolds numbers.     

A smoothing Levenberg–Marquardt method for the extended linear complementarity problem

We consider the extended linear complementarity problem (XLCP), of which the linear and horizontal linear complementarity problems are two special cases. We reformulate the XLCP to a smooth equation by using some smoothing functions and propose a Levenberg–Marquardt method to solve the system of smooth equation. The global convergence and local superlinear convergence rate are established under certain conditions. Numerical tests show the effectiveness of the proposed algorithm.     

A Douglas–Rachford splitting method for solving equilibrium problems

We propose a splitting method for solving equilibrium problems involving the sum of two bifunctions satisfying standard conditions. We prove that this problem is equivalent to find a zero of the sum of two appropriate maximally monotone operators under a suitable qualification condition. Our algorithm is a consequence of the Douglas–Rachford splitting applied to this auxiliary monotone inclusion. Connections between monotone inclusions and equilibrium problems are studied.     

The Sinc-collocation method for solving the Thomas–Fermi equation

A numerical technique for solving nonlinear ordinary differential equations on a semi-infinite interval is presented. We solve the Thomas–Fermi equation by the Sinc-Collocation method that converges to the solution at an exponential rate. This method is utilized to reduce the nonlinear ordinary differential equation to some algebraic equations. This method is easy to implement and yields very accurate results.     

The Cauchy problem for the dissipation-modified Kadomtsev–Petviashvili equation

Considered herein is the dissipation-modified Kadomtsev–Petviashvili equation in two space-dimensional case. It is established that the Cauchy problem associated to this equation is locally well-posed in anisotropic Sobolev spaces. It is also shown in some sense that this result is sharp. In addition, the global well-posedness for this equation under suitable conditions is proved.