Two‐step Newton‐type methods for solving inverse eigenvalue problems

In this paper, we apply the two‐step Newton method to solve inverse eigenvalue problems, including exact Newton, Newton‐like, and inexact Newton‐like versions. Our results show that both two‐step Newton and two‐step Newton‐like methods converge cubically, and the two‐step inexact Newton‐like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of new algorithms.     

A simple network of nodes moving on the circle

Two simple Markov processes are examined, one in discrete and one in continuous time, arising from idealized versions of a transmission protocol for mobile networks. We consider two independent walkers moving with constant speed on the discrete or continuous circle, and changing directions at independent geometric (respectively, exponential) times. One of the walkers carries a message that wishes to travel as far and as fast as possible in the clockwise direction. The message stays with its current carrier unless the two walkers meet, the carrier is moving counter‐clockwise, and the other walker is moving clockwise. Then the message jumps to the other walker. Explicit expressions are derived for the long‐term average clockwise speed and number of jumps made of the message, via the solution of associated boundary value problems. The tradeoff between speed and cost (measured as the rate of jumps) is also examined.     

Convex‐round graphs are circular‐perfect

We show a connection between two concepts that have hitherto been investigated separately, namely convex‐round graphs and circular cliques. The connections are twofold. We prove that the circular cliques are precisely the cores of convex‐round graphs; this implies that convex‐round graphs are circular‐perfect, a concept introduced recently by Zhu [10]. Secondly, we characterize maximal K_r‐free convex‐round graphs and show that they can be obtained from certain circular cliques in a simple fashion. Our proofs rely on several structural properties of convex‐round graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 182–194, 2002     

Right order spectral gap estimates for generating sets of ℤ4

Using coupling arguments, a distance method and Zeifman's method we give sharp estimates on the spectral gap for a special case of the class of Markov chains on generating n‐tuples of Abelian groups. In our case the group is ?₄. © 2002 Wiley Periodicals, Inc. Random Struct. Alg. 20: 220–238, 2002     

Even‐hole‐free graphs part I: Decomposition theorem

We prove a decomposition theorem for even‐hole‐free graphs. The decompositions used are 2‐joins and star, double‐star and triple‐star cutsets. This theorem is used in the second part of this paper to obtain a polytime recognition algorithm for even‐hole‐free graphs. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 6–49, 2002     

A reliability semi‐Markov model involving geometric processes

We consider a semi‐Markov process that models the repair and maintenance of a repairable system in steady state. The operating and repair times are independent random variables with general distributions. Failures can be caused by an external source or by an internal source. Some failures are repairable and others are not. After a repairable failure, the system is not as good as new and our model reflects that. At a non‐repairable failure, the system is replaced by a new one. We assume that external failures occur according to a Poisson process. Moreover, there is an upper limit N of repairs, it is replaced by a new system at the next failure, regardless of its type. Operational and repair times are affected by multiplicative rates, so they follow geometric processes. For this system, the stationary distribution and performance measures as well as the availability and the rate of occurrence of different types of failures in stationary state are calculated. Copyright © 2002 John Wiley & Sons, Ltd.     

An hp‐adaptive refinement strategy for hypersingular operators on surfaces

An adaptive refinement strategy for the hp‐version of the boundary element method with hypersingular operators on surfaces is presented. The error indicators are based on local projections provided by two‐level decompositions of ansatz spaces with additional bubble functions. Assuming a saturation property and locally quasi‐uniform meshes, efficiency and reliability of the resulting error estimator is proved. A second error estimator based on mesh refinement and overlapping decompositions that better fulfills the saturation property is presented. The performance of the algorithm and the estimators is demonstrated for a model problem. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 396–419, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10011     

Asymptotic analysis of (3, 2, 1)‐shell sort

We analyze the (3, 2, 1)‐Shell Sort algorithm under the usual random permutation model. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 59–75, 2002     

Analysis of algebraic systems arising from fourth‐order compact discretizations of convection‐diffusion equations

We study the properties of coefficient matrices arising from high‐order compact discretizations of convection‐diffusion problems. Asymptotic convergence factors of the convex hull of the spectrum and the field of values of the coefficient matrix for a one‐dimensional problem are derived, and the convergence factor of the convex hull of the spectrum is shown to be inadequate for predicting the convergence rate of GMRES. For a two‐dimensional constant‐coefficient problem, we derive the eigenvalues of the nine‐point matrix, and we show that the matrix is positive definite for all values of the cell‐Reynolds number. Using a recent technique for deriving analytic expressions for discrete solutions produced by the fourth‐order scheme, we show by analyzing the terms in the discrete solutions that they are oscillation‐free for all values of the cell Reynolds number. Our theoretical results support observations made through numerical experiments by other researchers on the non‐oscillatory nature of the discrete solution produced by fourth‐order compact approximations to the convection‐diffusion equation. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 155–178, 2002; DOI 10.1002/num.1041     

Indecomposable quasi‐characteristics scheme on pyramidal stencil and its application for numerical simulation of two‐phase flows through heterogeneous porous medium

A new high‐resolution indecomposable quasi‐characteristics scheme with monotone properties based on pyramidal stencil is considered. This scheme is based on consideration of two high‐resolution numerical schemes approximated governing equations on the pyramidal stencil with different kinds of dispersion terms approximation. Two numerical solutions obtained by these schemes are analyzed, and the final solution is chosen according to the special criterion to provide the monotone properties in regions where discontinuities of solutions could arise. This technique allows to construct the high‐order monotone solutions and keeps both the monotone properties and the high‐order approximation in regions with discontinuities of solutions. The selection criterion has a local character suitable for parallel computation. Application of the proposed technique to the solution of the time‐dependent 2D two‐phase flows through the porous media with the essentially heterogeneous properties is considered, and some numerical results are presented. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 44–55, 2002     

SWAMP: A two‐dimensional hydrodynamic and quality modeling platform for shallow waters

Water quality two‐dimensional models are often partitioned into separate modules with separate hydraulic and biological units. In most cases this approach results in poor flexibility whenever the biological dynamics has to be adapted to a specific situation. Conversely, an integrated approach is pursued in this article, producing a two‐dimensional hydraulic‐water quality model, named Shallow Water Analysis and Modeling Program (SWAMP) designed for shallow water bodies. The major objective of the work is to create a comprehensive two‐dimensional water quality assessment tool, based on an open framework and combining easy programming of additional procedures with a user‐friendly interface. The model is based on the numerical solution of the partial differential equations describing advection‐diffusion and biological processes on a two‐dimensional rectangular finite elements mesh. The hydraulics and advection‐diffusion modules model were validated both with experimental tracer data collected at a constructed wetland site and a comparison with a commercial hydrodynamic software, showing good agreement in both cases. Moreover, the model was tested in critical conditions for mass conservation, such as time‐varying wet boundary, showing a considerable numerical robustness. In the last part of the article water quality simulations are presented, though validation data are not yet available. Nevertheless, the observed model response demonstrates general consistency with expected results and the advantages of integrating the hydraulic and quality modules. The interactive graphical user interface (GUI) is also shown to represent a simple and effective connective tool to the integrated package. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 663–687, 2002; DOI 10.1002/num.10014     

Codiameters of 3‐connected 3‐domination critical graphs

A graph G is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3‐connected 3‐domination critical graph of order n. In this paper, we show that there is a path of length at least n?2 between any two distinct vertices in G and the lower bound is sharp. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 76–85, 2002     

An efficient high‐order algorithm for solving systems of reaction‐diffusion equations

An efficient higher‐order finite difference algorithm is presented in this article for solving systems of two‐dimensional reaction‐diffusion equations with nonlinear reaction terms. The method is fourth‐order accurate in both the temporal and spatial dimensions. It requires only a regular five‐point difference stencil similar to that used in the standard second‐order algorithm, such as the Crank‐Nicolson algorithm. The Padé approximation and Richardson extrapolation are used to achieve high‐order accuracy in the spatial and temporal dimensions, respectively. Numerical examples are presented to demonstrate the efficiency and accuracy of the new algorithm. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 340–354, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10012     

Forbidden subgraphs that imply hamiltonian‐connectedness*

It is proven that if G is a 3‐connected claw‐free graph which is also H₁‐free (where H₁ consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L . © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 104–119, 2002     

On transport equations driven by a non‐divergence‐free force field

The paper is devoted to initial boundary value problems for transport equations with non‐divergence‐free external field. The crucial role is played by integration along characteristics and associated Green's formula for which we provide a new proof which generalizes and clarifies previous versions. The paper concludes with an application of general theory to the Spencer–Lewis equation. Copyright © 2007 John Wiley & Sons, Ltd.     

3‐colorability of 4‐regular hamiltonian graphs

On the model of the cycle‐plus‐triangles theorem, we consider the problem of 3‐colorability of those 4‐regular hamiltonian graphs for which the components of the edge‐complement of a given hamiltonian cycle are non‐selfcrossing cycles of constant length ≥ 4. We show that this problem is NP‐complete. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 125–140, 2003     

New fast divide‐and‐conquer algorithms for the symmetric tridiagonal eigenvalue problem

In this paper, two accelerated divide‐and‐conquer (ADC) algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost O(N²r) flops in the worst case, where N is the dimension of the matrix and r is a modest number depending on the distribution of eigenvalues. Both of these algorithms use hierarchically semiseparable (HSS) matrices to approximate some intermediate eigenvector matrices, which are Cauchy‐like matrices and are off‐diagonally low‐rank. The difference of these two versions lies in using different HSS construction algorithms, one (denoted by ADC1) uses a structured low‐rank approximation method and the other (ADC2) uses a randomized HSS construction algorithm. For the ADC2 algorithm, a method is proposed to estimate the off‐diagonal rank. Numerous experiments have been carried out to show their stability and efficiency. These algorithms are implemented in parallel in a shared memory environment, and some parallel implementation details are included. Comparing the ADCs with highly optimized multithreaded libraries such as Intel MKL, we find that ADCs could be more than six times faster for some large matrices with few deflations. Copyright © 2016 John Wiley & Sons, Ltd.     

A mixed‐FEM formulation for nonlinear incompressible elasticity in the plane

This article deals with an expanded mixed finite element formulation, based on the Hu‐Washizu principle, for a nonlinear incompressible material in the plane. We follow our related previous works and introduce both the stress and the strain tensors as further unknowns, which yields a two‐fold saddle point operator equation as the corresponding variational formulation. A slight generalization of the classical Babu?ka‐Brezzi's theory is applied to prove unique solvability of the continuous and discrete formulations, and to derive the corresponding a priori error analysis. An extension of the well‐known PEERS space is used to define an stable associated Galerkin scheme. Finally, we provide an a posteriori error analysis based on the classical Bank‐Weiser approach. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 105–128, 2002     

Symmetry of two‐parameter homogeneous transition function

In this paper, we study a very interesting problem, that is, symmetry of the two parameters s,t>0 for a two‐parameter homogeneous transition function and obtain some important and interesting results.     

Least‐squares mixed finite element methods for the incompressible Navier‐Stokes equations

Least‐squares mixed finite element schemes are formulated to solve the evolutionary Navier‐Stokes equations and the convergence is analyzed. We recast the Navier‐Stokes equations as a first‐order system by introducing a vorticity flux variable, and show that a least‐squares principle based on L² norms applied to this system yields optimal discretization error estimates. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 441–453, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10015