Search

Generalizing wavelets by adding desired redundancy and flexibility, framelets (i.e., wavelet frames) are of interest and importance in many applications such as image processing and numerical algorithms. Several key properties of framelets are high vanishing moments for sparse multiscale representation, fast framelet transforms for numerical efficiency, and redundancy for robustness. However, it is a challenging problem to study and construct multivariate nonseparable framelets, mainly due to their intrinsic connections to factorization and syzygy modules of multivariate polynomial matrices. Moreover, all the known multivariate tight framelets derived from spline refinable scalar functions have only one vanishing moment, and framelets derived from refinable vector functions are barely studied yet in the literature. In this paper, we circumvent the above difficulties through the approach of quasi-tight framelets, which behave almost identically to tight framelets. Employing the popular oblique extension principle (OEP), from an arbitrary compactly supported M-refinable vector function ϕ with multiplicity greater than one, we prove that we can always derive from ϕ a compactly supported multivariate quasi-tight framelet such that: (i) all the framelet generators have the highest possible order of vanishing moments; (ii) its associated fast framelet transform has the highest balancing order and is compact. For a refinable scalar function ϕ (i.e., its multiplicity is one), the above item (ii) often cannot be achieved intrinsically but we show that we can always construct a compactly supported OEP-based multivariate quasi-tight framelet derived from ϕ satisfying item (i). We point out that constructing OEP-based quasi-tight framelets is closely related to the generalized spectral factorization of Hermitian trigonometric polynomial matrices. Our proof is critically built on a newly developed result on the normal form of a matrix-valued filter, which is of interest and importance in itself for greatly facilitating the study of refinable vector functions and multiwavelets/multiframelets. This paper provides a comprehensive investigation on OEP-based multivariate quasi-tight multiframelets and their associated framelet transforms with high balancing orders. This deepens our theoretical understanding of multivariate quasi-tight multiframelets and their associated fast multiframelet transforms.

In the study of the constant in Ahlfors' second fundamental theorem involving a set E_{q} of q points, branch values of covering surfaces outside E_{q} bring a lot of troubles. To avoid this situation, for a given surface S, it is useful to construct a new surface So such that L(So) =H(S), and all branch values of So are contained in E_{q}. The goal of this paper is to prove the existence of such So, which generalizes Lemma 9.1 and Theorem 10.1 in Zhang G.Y.: The precise bound for the area-length ratio in Ahifors' theory of covering surfaces. Invent math 191:197-253(2013), This paper is a preparation for the further research on Ahlfors' theorey of covering surfaces

In this paper, we consider a nonlinear integral eigenvalue problem, which is a reformulation of the transmission eigenvalue problem arising in the inverse scattering theory. The boundary element method is employed for discretization, which leads to a generalized matrix eigenvalue problem. We propose a novel method based on the spectral projection. The method probes a given region on the complex plane using contour integrals and decides if the region contains eigenvalue(s) or not. It is particularly suitable to test if zero is an eigenvalue of the generalized eigenvalue problem, which in turn implies that the associated wavenumber is a transmission eigenvalue. Effectiveness and efficiency of the new method are demonstrated by numerical examples., Comment: The paper has been accepted for publication in SCIENCE CHINA Mathematics

In this paper, we introduce the notions of differential graded (DG) Poisson algebra and DG Poisson module. Let $A$ be any DG Poisson algebra. We construct the universal enveloping algebra of $A$ explicitly, which is denoted by $A^{ue}$. We show that $A^{ue}$ has a natural DG algebra structure and it satisfies certain universal property. As a consequence of the universal property, it is proved that the category of DG Poisson modules over $A$ is isomorphic to the category of DG modules over $A^{ue}$. Furthermore, we prove that the notion of universal enveloping algebra $A^{ue}$ is well-behaved under opposite algebra and tensor product of DG Poisson algebras. Practical examples of DG Poisson algebras are given throughout the paper including those arising from differential geometry and homological algebra., Comment: Accepted by Science China Mathematics

A general analysis framework is presented in this paper for many different types of finite element methods (including various discontinuous Galerkin methods). For the second-order elliptic equation −div(α∇u) = f, this framework employs four different discretization variables, uh, ph, ŭh and $${\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over p} _h}$$ , where uh and ph are for approximation of u and p = −α∇u inside each element, and ŭh and $${\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over p} _h}$$ are for approximation of residual of u and p · n on the boundary of each element. The resulting 4-field discretization is proved to satisfy two types of inf-sup conditions that are uniform with respect to all discretization and penalization parameters. As a result, many existing finite element and discontinuous Galerkin methods can be analyzed using this general framework by making appropriate choices of discretization spaces and penalization parameters.

In this paper, numerical analysis is carried out for a class of history-dependent variational-hemivariational inequalities arising in contact problems. Three different numerical treatments for temporal discretization are proposed to approximate the continuous model. Fixed-point iteration algorithms are employed to implement the implicit scheme and the convergence is proved with a convergence rate independent of the time step-size and mesh grid-size. A special temporal discretization is introduced for the history-dependent operator, leading to numerical schemes for which the unique solvability and error bounds for the temporally discrete systems can be proved without any restriction on the time step-size. As for spatial approximation, the finite element method is applied and an optimal order error estimate for the linear element solutions is provided under appropriate regularity assumptions. Numerical examples are presented to illustrate the theoretical results., 33 pages,6 figures

In this paper, new Levin methods are presented for calculating oscillatory integrals with algebraic and/or logarithmic singularities. To avoid singularity, the technique of singularity separation is applied and then the singular ODE occurring in classic Levin methods is converted into two kinds of non-singular ODEs. The solutions of one can be obtained explicitly, while those of the other can be solved efficiently by collocation methods. The proposed methods can attach arbitrarily high asymptotic orders and also enjoy superalgebraic convergence with respect to the number of collocation points. Several numerical experiments are presented to validate the efficiency of the proposed methods., Accepted for publication in SCIENCE CHINA Mathematics

In this paper, we consider the {\it tensor absolute value equations} (TAVEs), which is a newly introduced problem in the context of multilinear systems. Although the system of TAVEs is an interesting generalization of matrix {\it absolute value equations} (AVEs), the well-developed theory and algorithms for AVEs are not directly applicable to TAVEs due to the nonlinearity (or multilinearity) of the problem under consideration. Therefore, we first study the solutions existence of some classes of TAVEs with the help of degree theory, in addition to showing, by fixed point theory, that the system of TAVEs has at least one solution under some checkable conditions. Then, we give a bound of solutions of TAVEs for some special cases. To find a solution to TAVEs, we employ the generalized Newton method and report some preliminary results., Comment: 26 pages and 4 tables

Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by confocal ellipses, are given. A numerical example which illustrates the calculation of these error bounds is included., This paper has been accepted for publication in SCIENCE CHINA Mathematics

The interior penalty methods using $C^0$ Lagrange elements ($C^0$IPG) developed in the last decade for the fourth order problems are an interesting topic in academia at present. In this paper, we discuss the adaptive fashion of $C^0$IPG method for the Helmholtz transmission eigenvalue problem.We give the a posteriori error indicators for primal and dual eigenfunctions, and prove their reliability and efficiency. We also give the a posteriori error indicator for eigenvalues and design a $C^0$IPG adaptive algorithm. Numerical experiments show that this algorithm is efficient and can get the optimal convergence rate.

In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a polynomial algebra $\mathbb{k}[x_1,x_2,\cdots, x_n]$ with $|x_i|=1$, for any $i\in \{1,2,\cdots, n\}$. We describe all possible differential structures on DG polynomial algebras; compute their DG automorphism groups; study their isomorphism problems; and show that they are all homologically smooth and Gorestein DG algebras. Furthermore, it is proved that the DG polynomial algebra $\mathcal{A}$ is a Calabi-Yau DG algebra when its differential $\partial_{\mathcal{A}}\neq 0$ and the trivial DG polynomial algebra $(\mathcal{A}, 0)$ is Calabi-Yau if and only if $n$ is an odd integer., It has been accepted for publication in SCIENCE CHINA Mathematics. 20 pages

In this paper we study the robustness properties of dimensionality reduction with Gaussian random matrices having arbitrarily erased rows. We first study the robustness property against erasure for the almost norm preservation property of Gaussian random matrices by obtaining the optimal estimate of the erasure ratio for a small given norm distortion rate. As a consequence, we establish the robustness property of Johnson-Lindenstrauss lemma and the robustness property of restricted isometry property with corruption for Gaussian random matrices. Secondly, we obtain a sharp estimate for the optimal lower and upper bounds of norm distortion rates of Gaussian random matrices under a given erasure ratio. This allows us to establish the strong restricted isometry property with the almost optimal RIP constants, which plays a central role in the study of phaseless compressed sensing., 22 pages