One‐bit sigma‐delta quantization with exponential accuracy

One‐bit quantization is a method of representing bandlimited signals by ±1 sequences that are computed from regularly spaced samples of these signals; as the sampling density λ → ∞, convolving these one‐bit sequences with appropriately chosen filters produces increasingly close approximations of the original signals. This method is widely used for analog‐to‐digital and digital‐to‐analog conversion, because it is less expensive and simpler to implement than the more familiar critical sampling followed by fine‐resolution quantization. However, unlike fine‐resolution quantization, the accuracy of one‐bit quantization is not well‐understood. A natural error lower bound that decreases like 2^?λ can easily be given using information theoretic arguments. Yet, no one‐bit quantization algorithm was known with an error decay estimate even close to exponential decay. In this paper, we construct an infinite family of one‐bit sigma‐delta quantization schemes that achieves this goal. In particular, using this family, we prove that the error signal for π‐bandlimited signals is at most O(2^?.07λ). © 2003 Wiley Periodicals, Inc.     

Quantized CP approximation and sparse tensor interpolation of function‐generated data

In this article, we consider the iterative schemes to compute the canonical polyadic (CP) approximation of quantized data generated by a function discretized on a large uniform grid in an interval on the real line. This paper continues the research on the quantics‐tensor train (QTT) method (“O(d log N)‐quantics approximation of N‐d tensors in high‐dimensional numerical modeling” in Constructive Approximation, 2011) developed for the tensor train (TT) approximation of the quantized images of function related data. In the QTT approach, the target vector of length 2^L is reshaped to a Lth‐order tensor with two entries in each mode (quantized representation) and then approximated by the QTT tensor including 2r²L parameters, where r is the maximal TT rank. In what follows, we consider the alternating least squares (ALS) iterative scheme to compute the rank‐r CP approximation of the quantized vectors, which requires only 2rL?2^L parameters for storage. In the earlier papers (“Tensors‐structured numerical methods in scientific computing: survey on recent advances” in Chemom Intell Lab Syst, 2012), such a representation was called Q_Can format, whereas in this paper, we abbreviate it as the QCP (quantized canonical polyadic) representation. We test the ALS algorithm to calculate the QCP approximation on various functions, and in all cases, we observed the exponential error decay in the QCP rank. The main idea for recovering a discretized function in the rank‐r QCP format using the reduced number of the functional samples, calculated only at O(2rL) grid points, is presented. The special version of the ALS scheme for solving the arising minimization problem is described. This approach can be viewed as the sparse QCP‐interpolation method that allows to recover all 2rL representation parameters of the rank‐r QCP tensor. Numerical examples show the efficiency of the QCP‐ALS‐type iteration and indicate the exponential convergence rate in r.     

Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Stability of nonconstant steady‐state solutions for 2‐fluid nonisentropic Euler‐Poisson equations in semiconductor

We consider the periodic problem for 2‐fluid nonisentropic Euler‐Poisson equations in semiconductor. By choosing a suitable symmetrizers and using an induction argument on the order of the time‐space derivatives of solutions in energy estimates, we obtain the global stability of solutions with exponential decay in time near the nonconstant steady‐states for 2‐fluid nonisentropic Euler‐Poisson equations. This improves the results obtained for models with temperature diffusion terms by using the pressure functions p^ν in place of the unknown variables densities n^ν.     

The unconditional stability and mass‐preserving S‐DDM scheme for solving parabolic equations in three dimensions

In this paper, the unconditional stability and mass‐preserving splitting domain decomposition method (S‐DDM) for solving three‐dimensional parabolic equations is analyzed. At each time step level, three steps (x‐direction, y‐direction, and z‐direction) are proposed to compute the solutions on each sub‐domains. The interface fluxes are first predicted by the semi‐implicit flux schemes. Second, the interior solutions and fluxes are computed by the splitting implicit solution and flux coupled schemes. Last, we recompute the interface fluxes by the explicit schemes. Due to the introduced z‐directional splitting and domain decomposition, the analysis of stability and convergence is scarcely evident and quite difficult. By some mathematical technique and auxiliary lemmas, we prove strictly our scheme meet unconditional stability and give the error estimates in L²‐norm. Numerical experiments are presented to illustrate the theoretical analysis.     

Optimal large‐time behavior of the Vlasov‐Maxwell‐Boltzmann system in the whole space

In this paper we study the large‐time behavior of classical solutions to the two‐species Vlasov‐Maxwell‐Boltzmann system in the whole space \input amssym ${\Bbb R}^3$ . The existence of global‐in‐time nearby Maxwellian solutions is known from Strain in 2006. However, the asymptotic behavior of these solutions has been a challenging open problem. Building on our previous work on time decay for the simpler Vlasov‐Poisson‐Boltzmann system, we prove that these solutions converge to the global Maxwellian with the optimal decay rate of O(t^{−3/2 + 3/(2r)}) in the L (L)‐norm for any 2 ≤ r ≤ ∞ if initial perturbation is smooth enough and decays in space velocity fast enough at infinity. Moreover, some explicit rates for the electromagnetic field tending to 0 are also provided. © 2011 Wiley Periodicals, Inc.     

On Saint‐Venant's principle in a poroelastic arch‐like region

In this paper we consider the state of plane strain in an elastic material with voids occupying a curvilinear strip as an arch‐like region described by R: a<r<b, 0<θ<ω, where r and θ are polar coordinates and a, b, and ω (<2π) are prescribed positive constants. Such a curvilinear strip is maintained in equilibrium under self‐equilibrated traction and equilibrated force applied on one of the edges, whereas the other three edges are traction free and subjected to zero volumetric fraction or zero equilibrated force. In fact, we study the case when one right or curved edge is loaded. Our aim is to derive some explicit spatial estimates describing how some appropriate measures of a specific Airy stress function and volume fraction evolve with respect to the distance to the loaded edge. The results of the present paper prove how the spatial decay rate varies with the constitutive profile. For the problem corresponding to a loaded right edge, we are able to establish an exponential decay estimate with respect to the angle θ. Whereas for the problem corresponding to a loaded curved edge, we establish an algebraical spatial decay with respect to the polar distance r, provided the angle ω is lower than the critical value $\pi\sqrt{2}$. The intended applications of these results concern various branches of medicine as for example the bone implants. Copyright © 2010 John Wiley & Sons, Ltd.     

Finite‐time synchronization of a class of N‐coupled complex partial differential systems with time‐varying delay

This study examines finite‐time synchronization for a class of N‐coupled complex partial differential systems (PDSs) with time‐varying delay. The problem of finite‐time synchronization for coupled drive‐response PDSs with time‐varying delay is similarly considered. The synchronization error dynamic of the PDSs is defined in the q‐dimensional spatial domain. We construct a feedback controller to achieve finite‐time synchronization. Sufficient conditions are derived by using the Lyapunov‐Krasoviskii stability approach and inequalities technology to ensure that the proposed networks achieve synchronization in finite time. The proposed systems demonstrate extensive application. Finally, an example is used to verify the theoretical results.     

Lq‐estimates for the stationary Oseen equations on the exterior of a rotating obstacle

We study the Dirichlet problem for the stationary Oseen equations around a rotating body in an exterior domain. Our main results are the existence and uniqueness of weak and very weak solutions satisfying appropriate L^q‐estimates. The uniqueness of very weak solutions is shown by the method of cut‐off functions with an anisotropic decay. Then our existence result for very weak solutions is deduced by a duality argument from the existence and estimates of strong solutions. From this and interior regularity of very weak solutions, we finally establish the complete D^1,r‐result for weak solutions of the Oseen equations around a rotating body in an exterior domain, where 4/3<r <4. Here, D^1,r is the homogeneous Sobolev space.     

Investigations of nonstandard,Mickens‐type,finite‐difference schemes for singular boundary value problems in cylindrical or spherical coordinates

It is well known that standard finite‐difference schemes for singular boundary value problems involving the Laplacian have difficulty capturing the singular (??(1/r) or ??(log r)) behavior of the solution near the origin (r = 0). New nonstandard finite‐difference schemes that can capture this behavior exactly for certain singular boundary value problems encountered in theoretical aerodynamics are presented here. These schemes are special cases of nonstandard finite differences which have been extensively researched by Professor Ronald E. Mickens of Clark Atlanta University in their most general form. Several examples of these “Mickens‐type” finite differences that illustrate both their accuracy and utility for singular boundary value problems in both cylindrical and spherical co‐ordinates are investigated. The numerical results generated by the Mickens‐type schemes are compared favorably with solutions obtained from standard finite‐difference schemes. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 380–398, 2003.     

Methods for the numerical solution of the Benjamin‐Bona‐Mahony‐Burgers equation

L^∞‐error estimates for finite element for Galerkin solutions for the Benjamin‐Bona‐Mahony‐Burgers (BBMB) equation are considered. A priori bound and the semidiscrete Galerkin scheme are studied using appropriate projections. For fully discrete Galerkin schemes, we consider the backward Euler method and analyze the corresponding error estimates. For a second order accuracy in time, we propose a three‐level backward method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

GPBi‐CGstab(L): A Lanczos‐type product method unifying Bi‐CGstab(L) and GPBi‐CG

Lanczos‐type product methods (LTPMs), in which the residuals are defined by the product of stabilizing polynomials and the Bi‐CG residuals, are effective iterative solvers for large sparse nonsymmetric linear systems. Bi‐CGstab(L) and GPBi‐CG are popular LTPMs and can be viewed as two different generalizations of other typical methods, such as CGS, Bi‐CGSTAB, and Bi‐CGStab2. Bi‐CGstab(L) uses stabilizing polynomials of degree L, while GPBi‐CG uses polynomials given by a three‐term recurrence (or equivalently, a coupled two‐term recurrence) modeled after the Lanczos residual polynomials. Therefore, Bi‐CGstab(L) and GPBi‐CG have different aspects of generalization as a framework of LTPMs. In the present paper, we propose novel stabilizing polynomials, which combine the above two types of polynomials. The resulting method is referred to as GPBi‐CGstab(L). Numerical experiments demonstrate that our presented method is more effective than conventional LTPMs.     

Sigma–delta quantization errors and the traveling salesman problem

In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maximal and mean square errors as a result of quantization. We focus on the sigma–delta modulation quantization scheme in the finite frame expansion setting. We show that this problem is related to the classical Traveling Salesman Problem (TSP) in the Euclidean space. It is known [Benedetto et al., Sigma–delta () quantization and finite frames, IEEE Trans. Inform. Theory 52, 1990–2005 (2006)] that the error bounds from the sigma–delta scheme depends on the ordering of the frame elements. By examining a priori bounds for the Euclidean TSP we show that error bounds in the sigma–delta scheme is superior to those from the pulse code modulation (PCM) scheme in general. We also give a recursive algorithm for finding an ordering of the frame elements that will lead to good maximal error and mean square error. Supported in part by the National Science Foundation grant DMS-0139261.     

Refinable Functions with Exponential Decay: An?Approach via Cascade Algorithms

Refinable functions with exponential decay arise from applications such as the Butterworth filters in signal processing. Refinable functions with exponential decay also play an important role in the study of Riesz bases of wavelets generated from multiresolution analysis. A fundamental problem is whether the standard solution of a refinement equation with an exponentially decaying mask has exponential decay. We investigate this fundamental problem by considering cascade algorithms in weighted L _p spaces (1≤p≤∞). We give some sufficient conditions for the cascade algorithm associated with an exponentially decaying mask to converge in weighted L _p spaces. Consequently, we prove that the refinable functions associated with the Butterworth filters are continuous functions with exponential decay. By analyzing spectral properties of the transition operator associated with an exponentially decaying mask, we find a characterization for the corresponding refinable function to lie in weighted L ₂ spaces. The general theory is applied to an interesting example of bivariate refinable functions with exponential decay, which can be viewed as an extension of the Butterworth filters.     

Exponential stability in one‐dimensional non‐linear thermoelasticity with second sound

In this paper, we consider a one‐dimensional non‐linear system of thermoelasticity with second sound. We establish an exponential decay result for solutions with small ‘enough’ initial data. This work extends the result of Racke (Math. Methods Appl. Sci. 2002; 25 :409–441) to a more general situation. Copyright © 2004 John Wiley & Sons, Ltd.     

Stability and convergence of two‐grid Crank‐Nicolson extrapolation scheme for the time‐dependent natural convection equations

In this paper, we consider the Crank‐Nicolson extrapolation scheme for the 2D/3D unsteady natural convection problem. Our numerical scheme includes the implicit Crank‐Nicolson scheme for linear terms and the recursive linear method for nonlinear terms. Standard Galerkin finite element method is used to approximate the spatial discretization. Stability and optimal error estimates are provided for the numerical solutions. Furthermore, a fully discrete two‐grid Crank‐Nicolson extrapolation scheme is developed, the corresponding stability and convergence results are derived for the approximate solutions. Comparison from aspects of the theoretical results and computational efficiency, the two‐grid Crank‐Nicolson extrapolation scheme has the same order as the one grid method for velocity and temperature in H¹‐norm and for pressure in L²‐norm. However, the two‐grid scheme involves much less work than one grid method. Finally, some numerical examples are provided to verify the established theoretical results and illustrate the performances of the developed numerical schemes.     

Global dynamics of the Boussinesq‐Burgers system with large initial data

In this paper, we study the global existence and asymptotic behavior of the Boussinesq‐Burgers system subject to the Dirichlet boundary conditions. Based on the L^p(p > 2) estimates of the solution, which are different from the standard L²‐based energy methods, we show that the classical solutions exist globally and converge to their boundary data at an exponential decay rate as time goes to infinity for large initial data. Copyright © 2016 John Wiley & Sons, Ltd.     

Finite element approximations to one‐phase nonlinear free boundary problem in groundwater contamination flow

In this article, we consider a single‐phase coupled nonlinear Stefan problem of the water‐head and concentration equations with nonlinear source and permeance terms and a Dirichlet boundary condition depending on the free‐boundary function. The problem is very important in subsurface contaminant transport and remediation, seawater intrusion and control, and many other applications. While a Landau type transformation is introduced to immobilize the free boundary, a transformation for the water‐head and concentration functions is defined to deal with the nonhomogeneous Dirichlet boundary condition, which depends on the free boundary function. An H¹‐finite element method for the problem is then proposed and analyzed. The existence of the approximation solution is established, and error estimates are obtained for both the semi‐discrete schemes and the fully discrete schemes. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Large‐time behavior of solutions to the Rosenau equation with damped term

In this paper, we consider the initial value problem for the Rosenau equation with damped term. The decay structure of the equation is of the regularity‐loss type, which causes the difficulty in high‐frequency region. Under small assumption on the initial value, we obtain the decay estimates of global solutions for n≥1. The proof also shows that the global solutions may be approximated by the solutions to the corresponding linear problem for n≥2. We prove that the global solutions may be approximated by the superposition of nonlinear diffusion wave for n = 1. Copyright © 2016 John Wiley & Sons, Ltd.     

Sigma Delta Quantization with Harmonic Frames and Partial Fourier Ensembles

Sigma Delta (\(\Sigma \Delta \)) quantization, a quantization method first surfaced in the 1960s, has now been widely adopted in various digital products such as cameras, cell phones, radars, etc. The method features a great robustness with respect to quantization noises through sampling an input signal at a Super-Nyquist rate. Compressed sensing (CS) is a frugal acquisition method that utilizes the sparsity structure of an objective signal to reduce the number of samples required for a lossless acquisition. By deeming this reduced number as an effective dimensionality of the set of sparse signals, one can define a relative oversampling/subsampling rate as the ratio between the actual sampling rate and the effective dimensionality. When recording these “compressed” analog measurements via Sigma Delta quantization, a natural question arises: will the signal reconstruction error previously shown to decay polynomially as the increase of the vanilla oversampling rate for the case of band-limited functions, now be decaying polynomially as that of the relative oversampling rate? Answering this question is one of the main goals in this direction. The study of quantization in CS has so far been limited to proving error convergence results for Gaussian and sub-Gaussian sensing matrices, as the number of bits and/or the number of samples grow to infinity. In this paper, we provide a first result for the more realistic Fourier sensing matrices. The main idea is to randomly permute the Fourier samples before feeding them into the quantizer. We show that the random permutation can effectively increase the low frequency power of the measurements, thus enhance the quality of \(\Sigma \Delta \) quantization.