两个分段函数卷积的数值算法

本文推广了文[1]中卷积的数值计算方法，使之适用于更广的范围，并用C语言编程举例说明．     

分段函数卷积的定限及方法的改进

本文讨论了分段函数卷积的定限方法以及简便算法．     

计算函数卷积的两种方法

用图形变换法和积分法分别计算函数的卷积.图形变换法有助于培养学生的直观想象、绘图和工程实践能力,积分法有助于培养学生的逻辑思维和分析能力.两种方法都非常典型,有特点,从不同角度培养学生的计算能力.教学中,教师应将两种方法做一对比,兼收图形变换法形象直观和积分法分析自然之特点,让学生对卷积计算融会贯通.     

广义函数的卷积

在古典分析中,已引入: 定义1 设f∈L_p(-∞,+∞),g∈L_q(-∞,+∞),其中1≤p,q≤+∞,满足1/p+1/q=1,则f和g的卷积定义为: 利用直积的概念,Schwartz L.给出了广义函数卷积的一般定义. 定义2 设f,g是两个广义函数,定义f和g的卷积为: (f*g,φ=(f(x)×g(y),φ(x+y)),φ∈D. 但是,在这里要指出,φ(x+y)已经不是(x,y)空间中的具有有界支集的函数,因而一般地说,定义2是没有意义的. 但对下面两种情况,定义2是有意义的. (1)广义函数f,g之一的支集是有界的; (2)两个广义函数f,g的支集都是同一方向有界的. 1973年Jones D S.研究了广义函数卷积,给出了另外一种广义函数卷积定义.     

整数向量卷积的一个最佳算法

在离散概率、数字信号处理及其他工程问题中,常会遇到两个向量的卷积(这里指的是循环卷积)的计算,即已知向量     

复频域卷积的离散算法

导出了适用于计算机进行计算的复频域卷积的离散算法,应用Durbin拉氏变换数值反演法对复频域卷积结果进行数值反演,可获得时域数值解.将该数值解与解析解进行比较表明,数值解具有较高的精度.     

关于整数向量卷积的一个算法的时间复杂度

众所周知,两个n维整数向量循环卷积的常规算法(即按定义计算)的时间复杂度为O(n~2),现在已有时间复杂度为O(nlog_2n)的快速算法,[1]中提出一个新算法,称其时间复杂度为O(n),因而是最佳的。 本文首先指出[1]的错误原因,再根据算法分析理论得出[1]中算法的时间复杂度不低于O(n~2log_2n),因而比常规算法的运算量还大。     

关于矩阵乘法与整数卷积最佳算法运算量的估计

§1.引言 [1]通过构造一个大整数然后作整数乘除法给出了用于有理数矩阵相乘的算法,运算量为O(n~2),达到了矩阵乘法复杂性下界,是最佳算法。[2]曾指出[1]中忽略了不同字长有不同运算量这一事实。但对[1]中算法复杂性未作具体讨论和质疑。最近,[3]—[4]采用类似于[1]中的大整数乘除法分别提出整数向量卷积的算法,并认为运算量级为     

超大型二维循环卷积的FPT和FNT混合算法

本文将FPT和FNT相结合提出了一种计算超大型二维循环卷积的迭代算法,它的基础是应用了FPT.与二维循环卷积的FPT算法相比,乘法量减少了一个数量级,同时实际取消了FNT算法中卷积规模所受到的字长的限制.     

尺度函数的两个性质

Two properties are given in this paper about the scaling function: suppose Vj; j ∈ Z is a multiresolution analysis with a continuous scaling function φ which have compact support set and that φ the Fourier transform of φ is a continuous real function, compactly supported, then φ(0) ≠ 0 and when supp φ = [a1,b1]∪[a2,b2](b1 < a2,0 < a2), then we havea1 ≤ 0, 0 < b1, a1 < b2/2 ≤ b1, 2π < b2 - a1 ≤ 8π.     

振荡函数的Hermite数值积分公式

本文讨论了振荡函数形如∫１－１ｆ（ｘ）ｓｉｎωｘｄｘ，∫１－１ｆ（ｘ）ｃｏｓωｘｄｘ的Ｈｅｒｍｉｔｅ积分公式，它基于ｆ（ｘ）的Ｈｅｒｍｉｔｅ插值多项式的一些结论，导出了依赖于ｘｎｊ的ａｎｊ及不依赖于ｘｎｊ的ｇ（ｋ，ｗ）的权数因子的递推关系式，并给出误差分析．     

Cascadic Multigrid Method for Isoparametric Finite Element with Numerical Integration

The purpose of this paper is to study the cascadic multigrid method for the secondorder elliptic problems with curved boundary in two-dimension which are discretized by the isoparametric finite element method with numerical integration. We show that the CCG method is accurate with optimal complexity and traditional multigrid smoother (likesymmetric Gauss-Seidel, SSOR or damped Jacobi iteration) is accurate with suboptimal complexity.     

Convolution quadrature time-domain boundary element method for 2-D fluid-saturated porous media

For large-scale wave analyses of fluid-saturated porous media, a conventional time-domain boundary element method (BEM) cannot be applied because of the following reasons: (1) no time-domain fundamental solutions are known for some problems, (2) the method sometimes suffers from instability, and (3) the analyses require large amounts of computational time and memory. In this study, an innovative time-domain BEM is developed for a fluid-saturated porous medium. The formulation presented herein overcomes the above disadvantages using a convolution quadrature method (CQM), first proposed by Lubich, and hybrid-parallelization with both MPI and OpenMP. Problems involving the scattering of an incident plane wave by cavities in a 2-D poroelastic medium are solved as a means of validating the proposed method.     

The Atoms of the Free Multiplicative Convolution of Two Probability Distributions

We determine the atoms of the free multiplicative convolution of two measures supported on the unit circle or on the positive real line. Analogous results were proved earlier for free additive convolution. Submitted: January 20, 2002?Revised: March 20, 2002.     

A Convolution Method for Numerical Solution of Backward Stochastic Differential Equations

We propose a new method for the numerical solution of backward stochastic differential equations (BSDEs) which finds its roots in Fourier analysis. The method consists of an Euler time discretization of the BSDE with certain conditional expectations expressed in terms of Fourier transforms and computed using the fast Fourier transform (FFT). The problem of error control is addressed and a local error analysis is provided. We consider the extension of the method to forward-backward stochastic differential equations (FBSDEs) and reflected FBSDEs. Numerical examples are considered from finance demonstrating the performance of the method.     

Summatory Formula of the Convolution of Two Arithmetical Functions

 We study the asymptotic formula of for some arithmetical functions f and g. This generalizes the case investigated by Balakrishnan and Pétermann. Received 15 January 2001; in revised form 7 July 2001     

Summatory Formula of the Convolution of Two Arithmetical Functions

 We study the asymptotic formula of for some arithmetical functions f and g. This generalizes the case investigated by Balakrishnan and Pétermann.     

二进小波变换的卷积定理

本文研究二进小波变换在信号处理中的应用.首先证明了两个满足容许性条件和规范性条件的二进小波的卷积和相关仍满足容许性和规范性条件,然后证明了二进小波变换的卷积定理和相关性定理,最后给出数值例子说明二进小波变换的卷积定理在加噪信号重构中的优越性.     

Convolution Estimates and Model Surfaces of Low Codimension

For k≥d/2 we give examples of measures on k-surfaces in ℝ ^d . These measures satisfy convolution estimates which are nearly optimal. The author was supported in part by NSF grant DMS-0552041.     

A Property of Piecewise Smooth Functions

Piecewise smooth equations are increasingly important in the numerical treatment of complementarity problems and models of equilibrium. This note brings out a property of the functions that enter such equations, for instance through penalty expressions.