Shift‐invert Lanczos method for the symmetric positive semidefinite Toeplitz matrix exponential

The Lanczos method with shift‐invert technique is exploited to approximate the symmetric positive semidefinite Toeplitz matrix exponential. The complexity is lowered by the Gohberg–Semencul formula and the fast Fourier transform. Application to the numerical solution of an integral equation is studied. Numerical experiments are carried out to demonstrate the effectiveness of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.     

The restarted shift‐and‐invert Krylov method for matrix functions

In this paper, the numerical evaluation of matrix functions expressed in partial fraction form is addressed. The shift‐and‐invert Krylov method is analyzed, with special attention to error estimates. Such estimates give insights into the selection of the shift parameter and lead to a simple and effective restart procedure. Applications to the class of Mittag–Leffler functions are presented. Copyright © 2012 John Wiley & Sons, Ltd.     

A Power–Arnoldi algorithm for computing PageRank

The PageRank algorithm plays an important role in modern search engine technology. It involves using the classical power method to compute the principle eigenvector of the Google matrix representing the web link graph. However, when the largest eigenvalue is not well separated from the second one, the power method may perform poorly. This happens when the damping factor is sufficiently close to 1. Therefore, it is worth developing new techniques that are more sophisticated than the power method. The approach presented here, called Power–Arnoldi, is based on a periodic combination of the power method with the thick restarted Arnoldi algorithm. The justification for this new approach is presented. Numerical tests illustrate the efficiency and convergence behaviour of the new algorithm. Copyright © 2007 John Wiley & Sons, Ltd.     

A direct method for solving block‐Toeplitz with near‐circulant‐block systems with applications to hybrid manufacturing systems

In this paper, we present a direct method for solving linear systems of a block‐Toeplitz matrix with each block being a near‐circulant matrix. The direct method is based on the fast Fourier transform (FFT) and the Sherman–Morrison–Woodbury formula. We give a cost analysis for the proposed method. The method is then applied to solve the steady‐state probability distribution of a hybrid manufacturing system which consists of a manufacturing process and a re‐manufacturing process. Copyright © 2005 John Wiley & Sons, Ltd.     

A fast algorithm for computing the smallest eigenvalue of a symmetric positive‐definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive‐definite (SPD) Toeplitz matrix. An algorithm for computing upper and lower bounds to the smallest eigenvalue of a SPD Toeplitz matrix has been recently derived (Linear Algebra Appl. 2007; DOI: 10.1016/j.laa.2007.05.008 ). The algorithm relies on the computation of the R factor of the QR factorization of the Toeplitz matrix and the inverse of R. The simultaneous computation of R and R^?1 is efficiently accomplished by the generalized Schur algorithm. In this paper, exploiting the properties of the latter algorithm, a numerical method to compute the smallest eigenvalue and the corresponding eigenvector of SPD Toeplitz matrices in an accurate way is proposed. Copyright © 2008 John Wiley & Sons, Ltd.     

An adaptive sampling method for high‐dimensional shift‐invariant signals

In this paper, an adaptive method for sampling and reconstructing high‐dimensional shift‐invariant signals is proposed. First, the integrate‐and‐fire sampling scheme and an approximate reconstruction algorithm for one‐dimensional bandlimited signals are generalized to shift‐invariant signals. Then, a high‐dimensional shift‐invariant signal is reduced to be a sequence of one‐dimensional shift‐invariant signals along the trajectories parallel to some coordinate axis, which can be approximately reconstructed by the generalized integrate‐and‐fire sampling scheme. Finally, an approximate reconstruction for the high‐dimensional shift‐invariant signal is obtained by solving a series of stable linear systems of equations. The main result shows that the final reconstructed error is completely determined by the initial threshold in integrate‐and‐fire sampling scheme, which is generally very small. Copyright © 2017 John Wiley & Sons, Ltd.     

An exponential high‐order compact ADI method for 3D unsteady convection–diffusion problems

In this article, we develop an exponential high order compact alternating direction implicit (EHOC ADI) method for solving three dimensional (3D) unsteady convection–diffusion equations. The method, which requires only a regular seven‐point 3D stencil similar to that in the standard second‐order methods, is second order accurate in time and fourth‐order accurate in space and unconditionally stable. The resulting EHOC ADI scheme in each alternating direction implicit (ADI) solution step corresponding to a strictly diagonally dominant matrix equation can be solved by the application of the one‐dimensional tridiagonal Thomas algorithm with a considerable saving in computing time. Numerical experiments for three test problems are carried out to demonstrate the performance of the present method and to compare it with the classical Douglas–Gunn ADI method and the Karaa's high‐order compact ADI method. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

Further results on exponential stability of discrete‐time BAM neural networks with time‐varying delays

This paper is concerned with the exponential stability for the discrete‐time bidirectional associative memory neural networks with time‐varying delays. Based on Lyapunov stability theory, some novel delay‐dependent sufficient conditions are obtained to guarantee the globally exponential stability of the addressed neural networks. In order to obtain less conservative results, an improved Lyapunov–Krasovskii functional is constructed and the reciprocally convex approach and free‐weighting matrix method are employed to give the upper bound of the difference of the Lyapunov–Krasovskii functional. Several numerical examples are provided to illustrate the effectiveness of the proposed method. Copyright © 2017 John Wiley & Sons, Ltd.     

Infinite‐dimensional exponential attractors for fourth‐order nonlinear parabolic equations in unbounded domains

We study in this article the long‐time behavior of solutions of fourth‐order parabolic equations in bfR³. In particular, we prove that under appropriate assumptions on the nonlinear interaction function and on the external forces, these equations possess infinite‐dimensional exponential attractors whose Kolmogorov's ε‐entropy satisfies an estimate of the same type as that obtained previously for the ε‐entropy of the global attractor. Copyright © 2011 John Wiley & Sons, Ltd.     

A class of vector‐valued dilation‐and‐modulation frames on the half real line

Vector‐valued frames were first introduced under the name of superframes by Balan in the context of signal multiplexing and by Han and Larson from the mathematical aspect. Since then, the wavelet and Gabor frames in have interested many mathematicians. The space models vector‐valued causal signal spaces because of the time variable being nonnegative. But it admits no nontrivial shift‐invariant system and thus no wavelet or Gabor frame since is not a group by addition (not as ). Observing that is a group by multiplication, we, in this paper, introduce a class of multiplication‐based dilation‐and‐modulation ( ) systems, and investigate the theory of frames in . Since is not closed under the Fourier transform, the Fourier transform does not fit . We introduce the notion of Θ_a transform in , and using Θ_a‐transform matrix method, we characterize frames, Riesz bases, and dual frames in and obtain an explicit expression of duals for an arbitrary given frame. An example theorem is also presented.     

Least‐squares solutions and least‐rank solutions of the matrix equation AXA* = B and their relations

A Hermitian matrix X is called a least‐squares solution of the inconsistent matrix equation AXA^* = B, where B is Hermitian. A^* denotes the conjugate transpose of A if it minimizes the F‐norm of B ? AXA^*; it is called a least‐rank solution of AXA^* = B if it minimizes the rank of B ? AXA^*. In this paper, we study these two types of solutions by using generalized inverses of matrices and some matrix decompositions. In particular, we derive necessary and sufficient conditions for the two types of solutions to coincide. Copyright © 2012 John Wiley & Sons, Ltd.     

Tuned preconditioners for inexact two‐sided inverse and Rayleigh quotient iteration

Convergence results are provided for inexact two‐sided inverse and Rayleigh quotient iteration, which extend the previously established results to the generalized non‐Hermitian eigenproblem and inexact solves with a decreasing solve tolerance. Moreover, the simultaneous solution of the forward and adjoint problem arising in two‐sided methods is considered, and the successful tuning strategy for preconditioners is extended to two‐sided methods, creating a novel way of preconditioning two‐sided algorithms. Furthermore, it is shown that inexact two‐sided Rayleigh quotient iteration and the inexact two‐sided Jacobi‐Davidson method (without subspace expansion) applied to the generalized preconditioned eigenvalue problem are equivalent when a certain number of steps of a Petrov–Galerkin–Krylov method is used and when this specific tuning strategy is applied. Copyright © 2014 John Wiley & Sons, Ltd.     

An efficient pseudo‐spectral Legendre–Galerkin method for solving a nonlinear partial integro‐differential equation arising in population dynamics

The pseudo‐spectral Legendre–Galerkin method (PS‐LGM) is applied to solve a nonlinear partial integro‐differential equation arising in population dynamics. This equation is a competition model in which similar individuals are competing for the same resources. It is a kind of reaction–diffusion equation with integral term corresponding to nonlocal consumption of resources. The proposed method is based on the Legendre–Galerkin formulation for the linear terms and interpolation operator at the Chebyshev–Gauss–Lobatto (CGL) points for the nonlinear terms. Also, the integral term, which is a kind of convolution, is directly computed by a fast and accurate method based on CGL interpolation operator, and thus, the use of any quadrature formula in its computation is avoided. The main difference of the PS‐LGM presented in the current paper with the classic LGM is in treating the nonlinear terms and imposing boundary conditions. Indeed, in the PS‐LGM, the nonlinear terms are efficiently handled using the CGL points, and also the boundary conditions are imposed strongly as collocation methods. Combination of the PS‐LGM with a semi‐implicit time integration method such as second‐order backward differentiation formula and Adams‐Bashforth method leads to reducing the complexity of computations and obtaining a linear algebraic system of equations with banded coefficient matrix. The desired equation is considered on one and two‐dimensional spatial domains. Efficiency, accuracy, and convergence of the proposed method are demonstrated numerically in both cases. Copyright © 2012 John Wiley & Sons, Ltd.     

An alternating direction method for linear‐constrained matrix nuclear norm minimization

The aim of the nuclear norm minimization problem is to find a matrix that minimizes the sum of its singular values and satisfies some constraints simultaneously. Such a problem has received more attention largely because it is closely related to the affine rank minimization problem, which appears in many control applications including controller design, realization theory, and model reduction. In this paper, we first propose an exact version alternating direction method for solving the nuclear norm minimization problem with linear equality constraints. At each iteration, the method involves a singular value thresholding and linear matrix equations which are solved exactly. Convergence of the proposed algorithm is followed directly. To broaden the capacity of solving larger problems, we solve approximately the subproblem by an iterative method with the Barzilai–Borwein steplength. Some extensions to the noisy problems and nuclear norm regularized least‐square problems are also discussed. Numerical experiments and comparisons with the state‐of‐the‐art method FPCA show that the proposed method is effective and promising. Copyright © 2011 John Wiley & Sons, Ltd.     

Dimension estimate of the exponential attractor for the chemotaxis‐growth system

We consider a chemotaxis‐growth model which takes into account diffusion, chemotaxis, production of chemical substance, and growth. We present estimates from above and below of the fractal dimension dim?? of the exponential attractor ?? in terms of the coefficients of the system. Comparisons are made between the sizes of the global and exponential attractors. Numerical simulations are presented which confirm the analytical results obtained. Copyright © 2006 John Wiley & Sons, Ltd.     

A variable nonlinear splitting algorithm for reaction diffusion systems with self‐ and cross‐ diffusion

Self‐ and cross‐diffusion are important nonlinear spatial derivative terms that are included into biological models of predator–prey interactions. Self‐diffusion models overcrowding effects, while cross‐diffusion incorporates the response of one species in light of the concentration of another. In this paper, a novel nonlinear operator splitting method is presented that directly incorporates both self‐ and cross‐diffusion into a computational efficient design. The numerical analysis guarantees the accuracy and demonstrates appropriate criteria for stability. Numerical experiments display its efficiency and accuracy.     

Robust Stability Criterion for Discrete‐Time Nonlinear Switched Systems with Randomly Occurring Delays via T–S Fuzzy Approach

This article investigates exponential stability of uncertain discrete‐time nonlinear switched systems with parameter uncertainties and randomly occurring delays via Takagi–Sugeno fuzzy approach. The randomness of time‐varying delay is characterized by introducing a Bernoulli stochastic variable that follows certain probability distribution. By adopting the average dwell‐time approach with Lyapunov–Krasovskii functional and using convex reciprocal lemma, delay‐dependent sufficient conditions for exponential stability of the switched fuzzy system are derived in terms of linear matrix inequalities (LMIs), which can be solved readily using any LMI solvers. Finally, illustrative examples are provided to demonstrate the effectiveness of the proposed approach. © 2014 Wiley Periodicals, Inc. Complexity 20: 49–61, 2015     

Analysis of newton multilevel stabilized finite volume method for the three‐dimensional stationary Navier‐Stokes equations

This article proposes and analyzes a multilevel stabilized finite volume method(FVM) for the three‐dimensional stationary Navier–Stokes equations approximated by the lowest equal‐order finite element pairs. The method combines the new stabilized FVM with the multilevel discretization under the assumption of the uniqueness condition. The multilevel stabilized FVM consists of solving the nonlinear problem on the coarsest mesh and then performs one Newton correction step on each subsequent mesh thus only solving one large linear systems. The error analysis shows that the multilevel‐stabilized FVM provides an approximate solution with the convergence rate of the same order as the usual stabilized finite element solution solving the stationary Navier–Stokes equations on a fine mesh for an appropriate choice of mesh widths: h_j ～ h_j‐1², j = 1,…,J. Therefore, the multilevel stabilized FVM is more efficient than the standard one‐level‐stabilized FVM. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Existence,blow‐up,and exponential decay estimates for a system of nonlinear wave equations with nonlinear boundary conditions

This paper is devoted to the study of a system of nonlinear equations with nonlinear boundary conditions. First, on the basis of the Faedo–Galerkin method and standard arguments of density corresponding to the regularity of initial conditions, we establish two local existence theorems of weak solutions. Next, we prove that any weak solutions with negative initial energy will blow up in finite time. Finally, the exponential decay property of the global solution via the construction of a suitable Lyapunov functional is presented. Copyright © 2013 John Wiley & Sons, Ltd.     

A memory‐efficient finite volume method for advection‐diffusion‐reaction systems with nonsmooth sources

We present a parallel matrix‐free implicit finite volume scheme for the solution of unsteady three‐dimensional advection‐diffusion‐reaction equations with smooth and Dirac‐Delta source terms. The scheme is formally second order in space and a Newton–Krylov method is employed for the appearing nonlinear systems in the implicit time integration. The matrix‐vector product required is hardcoded without any approximations, obtaining a matrix‐free method that needs little storage and is well‐suited for parallel implementation. We describe the matrix‐free implementation of the method in detail and give numerical evidence of its second‐order convergence in the presence of smooth source terms. For nonsmooth source terms, the convergence order drops to one half. Furthermore, we demonstrate the method's applicability for the long‐time simulation of calcium flow in heart cells and show its parallel scaling. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 143–167, 2015