Two‐grid methods for mixed finite‐element solution of coupled reaction‐diffusion systems

We develop 2‐grid schemes for solving nonlinear reaction‐diffusion systems: where p = (p, q) is an unknown vector‐valued function. The schemes use discretizations based on a mixed finite‐element method. The 2‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. The iterative algorithms examined here extend a method developed earlier for single reaction‐diffusion equations. An application to prepattern formation in mathematical biology illustrates the method's effectiveness. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 589–604, 1999     

A two‐grid method for mixed finite‐element solution of reaction‐diffusion equations

We present a scheme for solving two‐dimensional, nonlinear reaction‐diffusion equations, using a mixed finite‐element method. To linearize the mixed‐method equations, we use a two grid scheme that relegates all the Newton‐like iterations to a grid Δ_H much coarser than the original one Δ_h, with no loss in order of accuracy so long as the mesh sizes obey . The use of a multigrid‐based solver for the indefinite linear systems that arise at each coarse‐grid iteration, as well as for the similar system that arises on the fine grid, allows for even greater efficiency. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 317–332, 1999     

Negative norm least‐squares methods for the velocity‐vorticity‐pressure Navier–Stokes equations

We develop and analyze a least‐squares finite element method for the steady state, incompressible Navier–Stokes equations, written as a first‐order system involving vorticity as new dependent variable. In contrast to standard L² least‐squares methods for this system, our approach utilizes discrete negative norms in the least‐squares functional. This allows us to devise efficient preconditioners for the discrete equations, and to establish optimal error estimates under relaxed regularity assumptions. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 237–256, 1999     

Continuous Galerkin finite element methods for a forward‐backward heat equation

A space‐time finite element method is introduced to solve a model forward‐backward heat equation. The scheme uses the continuous Galerkin method for the time discretization. An error analysis for the method is presented. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 257–265, 1999     

Chromatic‐index‐critical graphs of even order

A k‐critical (multi‐) graph G has maximum degree k, chromatic index χ′(G) = k + 1, and χ′(G − e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k‐critical (multi‐) graphs with certain properties to obtain counterexamples to some well‐known conjectures. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 27–36, 1999     

Indirect methods of collocation: Trefftz‐Herrera collocation

A nonstandard collocation method (TH‐collocation) is presented, where collocation is used to construct specialized weighting functions instead of the solution itself, as it is usual, so that in this sense it is an indirect method. TH‐collocation is shown to be as accurate as standard collocation, but computationally far more efficient. The present article is the first of a series devoted to explore thoroughly collocation methods. The following classification of collocation methods is introduced: direct‐nonoverlapping; indirect‐nonoverlapping; direct‐overlapping; and indirect‐overlapping. Most of the effort reported in the literature has gone to direct‐nonoverlapping methods. The procedure presented in this article falls into the indirect‐nonoverlapping category and it is based on Trefftz‐Herrera formulation. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 709–738, 1999     

An upwinding cell‐centered method with piecewise constant velocity over covolumes

We analyze as a covolume method an upwinding cell‐centered method derived from a mixed formulation of the convection–diffusion equation. The covolume method uses primal and dual partitions of the problem domain to assign degrees of freedom and is a natural generalization of the well known MAC (Marker and Cell) method. The concentration is cell‐centered (piecewise constant with respect to the primal partition), and the velocity is covolume‐ or co‐cell centered (piecewise constant with respect to the dual partition). Convergence results are demonstrated in the L² norm. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 49–62, 1999     

Nonstandard methods for the convective‐dispersive transport equation with nonlinear reactions

A new nonstandard Eulerian‐Lagrangian method is constructed for the one‐dimensional, transient convective‐dispersive transport equation with nonlinear reaction terms. An “exact” difference scheme is applied to the convection‐reaction part of the equation to produce a semi‐discrete approximation with zero local truncation errors with respect to time. The spatial derivatives involved in the remaining dispersion term are then approximated using standard numerical methods. This approach leads to significant, qualitative improvements in the behavior of the numerical solution. It suppresses the numerical instabilities that arise from the incorrect modeling of derivatives and nonlinear reaction terms. Numerical experiments demonstrate the scheme's ability to model convection‐dominated, reactive transport problems. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 617–624, 1999     

A finite element method for the axisymmetric three‐field Stokes system with a discontinuous pressure

A quadrilateral based velocity‐pressure‐extrastress tensor mixed finite element method for solving the three‐field Stokes system in the axisymmetric case is studied. The method derived from Fortin's Q₂ − P₁ velocity‐pressure element is to be used in connection with the standard Galerkin formulation. This makes it particularly suitable for the numerical simulation of viscoelastic flow. It is proven to be second‐order convergent in the natural weighted Sobolev norms, for the system under consideration. The crucial result that the method is uniformly stable is proven for the case of rectangular meshes. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 739–763, 1999     

Mixed formulation of the two‐layer quasi‐geostrophic equations of the ocean

In this article, we propose a mixed variational formulation for the streamfunction vorticity potential form for the two‐layer quasi‐geostrophic model of the ocean. We prove the existence and uniqueness of solutions of the mixed variational problem. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 489–502, 1999     

Subspace‐by‐subspace preconditioners for structured linear systems

We consider the iterative solution of symmetric positive‐definite linear systems whose coefficient matrix may be expressed as the outer product of low‐rank terms. We derive suitable preconditioners for such systems, and demonstrate their effectiveness on a number of test examples. We also consider combining these methods with existing techniques to cope with the commonly‐occuring case where the coefficient matrix is the linear sum of elements, some of which are of very low rank. Copyright © 1999 John Wiley & Sons, Ltd.     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

Taylor‐Galerkin B‐spline finite element method for the one‐dimensional advection‐diffusion equation

The advection‐diffusion equation has a long history as a benchmark for numerical methods. Taylor‐Galerkin methods are used together with the type of splines known as B‐splines to construct the approximation functions over the finite elements for the solution of time‐dependent advection‐diffusion problems. If advection dominates over diffusion, the numerical solution is difficult especially if boundary layers are to be resolved. Known test problems have been studied to demonstrate the accuracy of the method. Numerical results show the behavior of the method with emphasis on treatment of boundary conditions. Taylor‐Galerkin methods have been constructed by using both linear and quadratic B‐spline shape functions. Results shown by the method are found to be in good agreement with the exact solution. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

The steady‐state probabilities for regenerative semi‐Markov processes with application to prevention and screening

There is a growing interest in planning and implementing broad‐scale clinical trials with a focus on prevention and screening. Often, the data‐generating mechanism for such experiments can be viewed as a semi‐Markov process. In this communication, we develop general expressions for the steady‐state probabilities for regenerative semi‐Markov processes. Hence, the probability of being in a certain state at the time of recruitment to a clinical trial can be calculated. An application to breast cancer prevention is demonstrated. Copyright © 1999 John Wiley & Sons, Ltd.     

Strong convergence of the split‐step θ‐method for stochastic age‐dependent population equations

In this paper, we constructed the split‐step θ (SSθ)‐method for stochastic age‐dependent population equations. The main aim of this paper is to investigate the convergence of the SS θ‐method for stochastic age‐dependent population equations. It is proved that the proposed method is convergent with strong order 1/2 under given conditions. Finally, an example is simulated to verify the results obtained from the theory, and comparative analysis with Euler method is given, the results show the higher accuracy of the SS θ‐method. Copyright © 2014 John Wiley & Sons, Ltd.     

On the complexity of branch‐and‐bound search for random trees

Let T_n be a b‐ary tree of height n, which has independent, non‐negative, identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Consider the problem of finding the minimum leaf value of T_n. Assume that the edge random variable X is nondegenerate, has E {X^θ}<∞ for some θ>2, and satisfies bP{X=c}<1 where c is the leftmost point of the support of X. We analyze the performance of the standard branch‐and‐bound algorithm for this problem and prove that the number of nodes visited is in probability (β+o(1))ⁿ, where β∈(1, b) is a constant depending only on the distribution of the edge random variables. Explicit expressions for β are derived. We also show that any search algorithm must visit (β+o(1))ⁿ nodes with probability tending to 1, so branch‐and‐bound is asymptotically optimal where first‐order asymptotics are concerned. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 309–327, 1999     

On Finite 2‐Path‐Transitive Graphs

The class of graphs that are 2‐path‐transitive but not 2‐arc‐transitive is investigated. The amalgams for such graphs are determined, and structural information regarding the full automorphism groups is given. It is then proved that a graph is 2‐path‐transitive but not 2‐arc‐transitive if and only if its line graph is half‐arc‐transitive, thus providing a method for constructing new families of half‐arc‐transitive graphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 225–237, 2013     

Construction of uniquely H‐colorable graphs

We shall prove that for any graph H that is a core, if χ(G) is large enough, then H × G is uniquely H‐colorable. We also give a new construction of triangle free graphs, which are uniquely n‐colorable. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 1–6, 1999     

A nonconventional Eulerian‐Lagrangian single‐node collocation method with Hermite polynomials for unsteady‐state advection‐diffusion equations

We developed a nonconventional Eulerian‐Lagrangian single‐node collocation method (ELSCM) with piecewise‐cubic Hermite polynomials as basis functions for the numerical simulation to unsteady‐state advection‐diffusion transport partial differential equations. This method greatly reduces the number of unknowns in the conventional collocation method, and generates accurate numerical solutions even if very large time steps are taken. The method is relatively easy to formulate. Numerical experiments are presented to show the strong potential of this method. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 271–283, 2003.