求解线性矩问题的一个修正方法

1．引言许多问题都可化为线性矩问题的求解,最典型的例子就是求解第一类线性积分方程的配置法．第一类算子方程在不同国数空间的离散化得到不同形式的线性矩问题．1968年,地质学家GBackusandFGilbert给出了一种求解线性矩问题的方法,用来求解地球物理反问题,后来称之为B－G方法,山从理论上严格论证了其收敛性．问给出了一种求解线形矩问题的光顺方法,门讨论了再生核空间的rG方法,并将其用于信号处理．以上方法的核心思想是在某类函数空间寻求对利一函数的逼近,从而得到线性矩问题的近似解．本交给出了一种求解线性矩问题的修正方…     

线性算子与右端项都近似给定的有限维正则化方法

本文利用有限维正则化方法来求解线性算子与左端项皆有噪声时的问题，并给出了该方法的误差估计及正则参数选取的标准。     

l~P-系数正则化Shannon采样学习算法收敛速度(英文)

研究l~P-系数正则化意义下Shannon采样学习算法的收敛速度估计问题.借助l~P-空间的凸性不等式给出了样本误差和正则化误差的上界估计,并给出了用K-泛函表示的逼近误差估计.将K-泛函的收敛速度估计转化为平移网络逼近问题,在此基础上给出了用概率表示的学习速度.     

关于半离散Galerkin近似解的L_∞估计的一个注记

在《计算数学》和《高等学校计算数学学报》上最近发表的文章[1]和[2]中,分别讨论了抛物和二阶双曲方程半离散Galerkin近似解(分片线性函数情形)的L_∞估计。文章作者采用正则Green函数方法证明了阶为h~2ln(1/h)的误差估计式。值得指出,[1]和[2]中所给出的估计式的一个不足之处就是它们所需要的精确解的正则性过于强。在这个注记里,我们将说明如下事实,利用熟知的半离散Galerkin近似解的超收敛估计和有限元函数空间的一个弱嵌入性质,可以证明得到阶也是h~2ln(1/h)的误差估计式,然而对解的正则性的要求则较[1]和[2]中估计式所需要的弱得多。 先讨论抛物问题,文[1]讨论的是热传导问题     

双调和方程柯西问题的修正的Tikhonov正则化方法

本文研究了双调和方程柯西问题,这类是不适定的,即问题的解(如果存在)不连续依赖于测量数据.首先在精确解的先验假设下给出问题的条件稳定性结果.接着利用修正的Tikhonov正则化方法求解此不适定问题.在先验和后验正则化参数选取规则下,给出正则解和精确解之间的误差估计式.最后给出几个数值例子验证此正则化方法求解此类反问题的有效性.     

识别Rayleigh-Stokes方程源项的分数阶Landweber迭代正则化方法

该文研究具有Riemann-Liouville时间分数阶导数的Rayleigh-Stokes方程未知源识别问题.首先证明这个问题是不适定的,并应用分数阶Landweber正则化方法求解此反问题.基于条件稳定性结果,在先验和后验正则化参数选取规则下,分别给出精确解与正则解之间的误差估计.最后通过数值例子说明此方法求解此类...     

一阶数值微分的局部正则化方法

本文研究了一阶数值微分问题,将其等价转化为第一类积分方程的求解问题,给出了求解该问题的局部正则化方法.在精确导数的一定假设条件下,讨论了正则化参数的先验选取策略及相应近似导数的误差估计.相对于经典的正则化方法,数值实验表明局部正则化方法能在有效抑制噪声的同时,保证近似导数逼近精确导数的效果,尤其是在精确导数有间断或急剧变化时.     

半线性椭圆型问题Mortar有限元逼近的瀑布型多重网格法

Mortar有限元法作为一个非协调的区域分解技术已得到许多研究者的关注(如文献[2]、[5]等)。本文对半线性椭圆型问题的Mortar有限元逼近提出了瀑布型多重网格法,并给出了此法的误差估计和计算复杂度估计定理。     

非线性不适定问题的正则化方法

本文考虑非线性不适定问题Tx=y的近似求解,利用Тихоноь正则化方法来逼近问题的x-极小模解,当算子和右端都近似已知时,给出一种决定正则化参数的方法,并给出正则解的收效性和渐近收敛阶估计。     

一种迭代正则化方法求解一类同时带有两个扰动数据的反向问题北大核心CSCD

该文考虑了一类带有扰动扩散系数和扰动终值数据的空间分数阶扩散方程反向问题,从终值时刻的测量数据来反演初始时刻数据.该问题是严重不适定的,因此该文提出了一种迭代正则化方法来处理该反向问题,并利用先验正则化参数选取规则得到了正则化解和精确解之间的误差估计,最后进行了一些数值模拟,验证了方法的有效性.     

计算对称破缺Takens-Bogdanov点的有效方法

我们将提出一种直接方法来计算对称破缺Takens-Bogdanov分歧点,这种方法构造了不引进零向量作为变量的小扩张系统,从而减少了计算量并节约了内存,数值例子的计算成功地说明了方法的有效性。     

Left distance binary tree representations

We present a new scheme for representing binary trees. The scheme is based on rotations as a previous scheme of Zerling. In our method the items of a representation have a natural geometric interpretation, and the algorithms related to the method are simple. We give an algorithm for enumerating all the representations for trees onn nodes, and an algorithm for building the tree corresponding to a given representation.This work was supported by the Academy of Finland.     

A Modified Alternating Direction Method for Variational Inequality Problems

The alternating direction method is an attractive method for solving large-scale variational inequality problems whenever the subproblems can be solved efficiently. However, the subproblems are still variational inequality problems, which are as structurally difficult to solve as the original one. To overcome this disadvantage, in this paper we propose a new alternating direction method for solving a class of nonlinear monotone variational inequality problems. In each iteration the method just makes an orthogonal projection to a simple set and some function evaluations. We report some preliminary computational results to illustrate the efficiency of the method. Accepted 4 May 2001. Online publication 19 October, 2001.     

A New Efficient Transform Mechanism with Convergence Analysis of the Space-Fractional Telegraph Equations

This article"s goal is to investigate the space-fractional telegraph equation using an effective method called the Adomian natural decomposition method (ANDM), which is a combination of the Adomian decomposition method (ADM) and the natural transform method (NTM). Using the Banach fixed point theorem, we explore proofs for the existence and uniqueness theorems applying it to a nonlinear differential equation. Using our method, exact solutions of the space-fractional telegraph equation and time-fractional diffusion problems have been obtained. To demonstrate the effectiveness of the suggested scheme, four examples are provided.     

一个修正的Newton法之改进

众所周知,多项式方程的求解有很多应用背景,而Newton法是一种常用的数值方法,因此有不少文献讨论Newton法的各种改进,包括用于求解多项式方程时的变形[1-7],在文[1]中,Ehrlich,L.W.提出了一个同时决定n次多项式的n个单根的迭代法.对方程     

Approximation of the eigenvalues of a fourth order differential equation with non-smooth coefficients

The eigenvalues of a fourth order, generalized eigenvalue problem in one dimension, with non-smooth coefficients are approximated by a finite element method, introduced in an earlier work by the author and A. Lutoborski, in the context of a similar source problem with non-smooth coefficients. Error estimates for the approximate eigenvalues and eigenvectors are obtained, showing a better performance of this method, when applied to eigenvalue approximation, compared to a standard finite element method with arbitrary mesh.     

D.c. sets,d.c. functions and nonlinear equations

Ad.c. set is a set which is the difference of two convex sets. We show that any set can be viewed as the image of a d.c. set under an appropriate linear mapping. Using this universality we can convert any problem of finding an element of a given compact set in ⁿ into one of finding an element of a d.c. set. On the basis of this approach a method is developed for solving a system of nonlinear equations—inequations. Unlike Newton-type methods, our method does not require either convexity, differentiability assumptions or an initial approximate solution.The revision of this paper was produced during the author's stay supported by a Sophia lecturing-research grant at Sophia University (Tokyo, Japan).     

A general performance analysis method for uniform memory architectures

The performance of a multiprocessor system greatly depends on the bandwidth of its memory architecture. In this paper, uniform memory architectures with various interconnection networks including crossbar, multiple-buses and generalized shuffle networks are studied. We propose a general method based on the Markov chain model by assuming that the blocked memory requests will be redistributed to the memory modules in the next memory cycle. This assumption results in an analysis with lower complexity where the number of states is linearly proportional to the number of processors. Moreover, it can provide excellent estimation on the system power and memory bandwidth for all three types of interconnection networks as compared with the simulation results in which the blocked memory requests are resubmitted to the same memory module. Comparisons also show that our method is more general and precise than most existing analysis methods. The method is further extended to estimate the performance of multiprocessor system with caches. The approximation results are also shown to be remarkably good.     

Simultaneous identification of convection velocity and source strength in a convection–diffusion equation

In this work we are concerned with the analysis on a simultaneous finite element reconstruction of the convection velocity and source strength in a time-dependent convection–diffusion equation. The ill-posed problem is formulated into an output least-squares nonlinear minimization by an appropriately selected Tikhonov regularization. The regularizing effect and mathematical properties of the regularized system are justified and demonstrated. The nonlinear optimization problem is approximated by a fully discrete finite element method, whose convergence is rigorously established.     

基于模糊的投影寻踪算法在中医证候分类中的应用

本文提出一种新的聚类算法-基于模糊的投影寻踪算法,可以有效的处理医学中常常遇到的高维混合数据的模糊聚类问题.并将其应用在慢性肾衰的辩证分析问题中,为已有的慢性肾衰证候的分型标准提供科学支持.本文的研究方法为中医辩证的现代化研究开拓了新的思路,值得进一步深入探讨。