Aliasing Error of Sampling Series in Wavelet Subspaces

Alising error arises whenever a sampling formula, valid for a prescribed space, is applied to a function in a bigger space. In this work, we estimate the aliasing error of classic and average sampling expansions in wavelet subspaces of a multiresolution analysis.     

On the double commutant of Cowen-Douglas operators

Let T be a Cowen-Douglas operator. In this paper, we study the von Neumann algebra V^?(T) consisting of operators commuting with both T and T^? from a geometric viewpoint. We identify operators in V^?(T) with connection-preserving bundle maps on E(T), the holomorphic Hermitian vector bundle associated to T. By studying such bundle maps, the structure of V^?(T) as well as information on reducing subspaces of T can be determined.     

Recursion relations for the extended Krylov subspace method

The evaluation of matrix functions of the form f(A)v, where A is a large sparse or structured symmetric matrix, f is a nonlinear function, and v is a vector, is frequently subdivided into two steps: first an orthonormal basis of an extended Krylov subspace of fairly small dimension is determined, and then a projection onto this subspace is evaluated by a method designed for small problems. This paper derives short recursion relations for orthonormal bases of extended Krylov subspaces of the type K^m,mi+1(A)=span{A^-m+1v,…,A^-1v,v,Av,…,A^miv}, m=1,2,3,…, with i a positive integer, and describes applications to the evaluation of matrix functions and the computation of rational Gauss quadrature rules.     

Schur complement‐based domain decomposition preconditioners with low‐rank corrections

This paper introduces a robust preconditioner for general sparse matrices based on low‐rank approximations of the Schur complement in a Domain Decomposition framework. In this ‘Schur Low Rank’ preconditioning approach, the coefficient matrix is first decoupled by a graph partitioner, and then a low‐rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface unknowns. The method avoids explicit formation of the Schur complement. We show the feasibility of this strategy for a model problem and conduct a detailed spectral analysis for the relation between the low‐rank correction and the quality of the preconditioner. We first introduce the SLR preconditioner for symmetric positive definite matrices and symmetric indefinite matrices if the interface matrices are symmetric positive definite. Extensions to general symmetric indefinite matrices as well as to nonsymmetric matrices are also discussed. Numerical experiments on general matrices illustrate the robustness and efficiency of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.     

一种求解三维热辐射输运方程的整体预处理迭代方法及并行计算

为三维灰体热辐射输运方程的隐式离散纵标方法发展一个整体预处理迭代方法并研制并行程序.该方法采用组装线性代数方程组策略,同时求出所有离散方向上的辐射强度.借助预处理的Krylov子空间迭代法,避免复杂网格上扫描算法可能遇到的死锁问题,能够提高健壮性和计算效率.空间离散上采用一阶迎风有限体积格式.数值实验测试变形六面体网格...     

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.     

Parallel characteristic finite element method for time‐dependent convection–diffusion problem

Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd.     

BiCGstab(l) and other hybrid Bi-CG methods

It is well-known that Bi-CG can be adapted so that the operations withA ^T can be avoided, and hybrid methods can be constructed in which it is attempted to further improve the convergence behaviour. Examples of this are CGS, Bi-CGSTAB, and the more general BiCGstab(l) method. In this paper it is shown that BiCGstab(l) can be implemented in different ways. Each of the suggested approaches has its own advantages and disadvantages. Our implementations allow for combinations of Bi-CG with arbitrary polynomial methods. The choice for a specific implementation can also be made for reasons of numerical stability. This aspect receives much attention. Various effects have been illustrated by numerical examples.     

Extremally disconnected spaces, subspaces and retracts

A characterization of compact subspaces of extremally disconnected spaces is given which is similar to Gleason's characterization that the extremally disconnected spaces are projective for the class of compact spaces. An equivalence is established between the questions of whether every basically disconnected space is embeddable into an extremally disconnected space and the Borel lifting problems for the category algebras of generalized Cantor cubes. We study an inductive method of strengthening the product topology on the Cantor cubes to extremally disconnected topologies and use this to establish, from CH, that every compact F-space of weight c⁺ embeds into an extremally disconnected space.     

Stabilizability in Asymptotically Finite-Dimensional Semigroups

We study a semigroup of linear operators on a Banach space X which satisfies the condition codim X ₀<, where We show that X ₀ is closed and establish some properties of the asymptotic behavior of the subspaces complementing X ₀ to X.