基于指标形式张量的微分几何定理机器证明

提出了一个基于指标形式张量的微分几何定理的机器证明算法.该算法将微分几何定理转化成带指标的张量多项式的计算问题,然后通过利用重写规则,挖掘等价条件和分次选取条件等方法大大减少了这个多项式系统的方程个数.再利用这个多项式系统本身和关于哑元的方程三角化这个多项式系统,将所得到的首项代入结论, 从而得到了该定理的机器证明.该算法不仅能够证明基于指标形式张量的微分几何定理,也可以用于张量方程的求解.     

小波分式滤波器

1．引言用小波处理实际问题时，对称性具有重要的意义．如果小波不具有对称性，则在信号重构时可能导致失真．我们知道，用多项式滤波器构造的正交小波不具有对称性，这是一个重要的缺欠．本文讨论了分式滤波器，它作为多项式滤波器的最自然的推广和进展，且包含了B样条小波滤波器，可随意构造出对称性小波函数，对实际应用提供了有意义的构造性方法．在小波计算中，为了回避hllrl＊r逆变换，人们通常喜欢用Mdl时算法山，即对尺度函数方程为造迭代格式为了得到迭代收敛（n。、v）条件，通常把滤波器其中以及时，迭代格式（2）逐点收敛于尺…     

小参数在高阶导数项的椭圆型方程第一边值问题的一致收敛差分格式

本文讨论了曲边区域上小参数ε在高阶导数项的椭圆型方程第一边值问题,从一致收敛的必要条件出发构造了特殊的差分格式,证明了差分方程问题解的一致收敛性,估计了收敛的阶数,并讨论了差分方程解的渐近性态.     

椭圆型方程的重叠型区域分裂混合元方法

本文研究椭圆型方程的重叠型区域分解混合元方法，对第一边值和第二边值问题，分别给出了离散形式的区域分解混合元格式；证明了区域分裂格式解的存在唯一性和算法的收敛性，并给出数值算例．     

一类特征值反问题(IEP)的基于矩阵方程的Ulm型算法

应用求解算子方程的Ulm方法构造了求解一类矩阵特征值反问题（IEP）的新算法.所给算法避免了文献[Aishima K.，A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems，Linear Algebra and its Applications，2018，542：310-33]中算法在每次迭代中要求解一个线性方程组的不足，证明了在给定谱数据互不相同的条件下所给算法具有根收敛意义下的二次收敛性.数值实验表明本文所给算法在矩阵阶数较大时计算效果优于上文所给算法.     

非对称线性代数方程组的块向量算法

预条件广义共轭余量法并行和向量计算的关键是预条件计算是否可并行和向量计算，我们利用分而治之的原则，构造了一处块预条件矩阵Ｍ，这里的矩阵Ｍ是通过对线性代数方程组Ａｘ＝ｆ的矩阵Ａ进行块分解，在块分解中利用近似逆技术。这样分解形成的预条件矩阵Ｍ在迭代计算时，可向量或并行计算。     

一类迭代方程C~1类解的讨论

本文讨论一类非多项式形式的函数迭代方程，作者给出了这类方程Ｃ１类解的存在性．唯一性和稳定性条件．     

《数值计算与计算机应用》2021年第42卷第4期摘要

潘佳佳,李会元,二阶椭圆问题的弱迦辽金四边形谱元方法[J].数值计算与计算机应用,2021,42(4):303-322.摘要:本文对二阶椭圆方程特征值问题的弱伽辽金谱元方法开展相关数值研究.与弱有限元方法类似,弱伽辽金谱元方法的逼近函数空间包括各个单元上的独立内部分量、并辅以各单元边界分量作为单元与单元间的联系.本文聚焦任意凸四边形网格剖分下的弱伽辽金四边形谱元方法,弱逼近函数中的各内部分量与边界分量分别由参考正方形单元与参考单元边界上的正交多项式通过双线性变换来构造;而弱梯度逼近空间则由参考正方形上的正交多项式通过Piola变换构造.在此基础上,本文提出了二阶椭圆方程特征值问题的弱伽辽金四边形谱元方法逼近格式和实现算法,并通过对离散弱梯度核空间的系统研究。     

关于函数方程的若干进展

本文介绍了单实变量的函数方程的若干新进展，包括迭代根、Ｓｃｈｒｏｄｅｒ方程和多项式型迭代方程的结果。基本内容有：Ｉ．引言：迭代与相关问题；Ⅱ．迭代根：存在性；Ⅲ．迭代根：唯一性、可微性和分枝；Ⅳ．多项式型迭代方程。     

修正共轭梯度算法求解四元数Sylvester张量方程

本文提出一类张量形式的修正共轭梯度算法求解四元数Sylvester张量方程.证明在不计舍入误差的情况下,所提方法可在有限迭代步内获得张量方程组的解.进一步,通过选择特殊类型的初始张量,可获得方程组的唯一极小Frobenius范数解.通过数值算例验证了所提出算法的可行性和有效性.     

Additive schwarz methods for indefinite hypersingular integral equations in R3 - the p-version

We propose and analyze preconditioners for the p-version of the boundary element method in three dimensions. We consider indefinite hypersingular integral equations on surfaces and use quadrilateral elements for the boundary discretization. We use the GMRES method as iterative solver for the linear systems and prove for an overlapping additive Schwarz method that the number of iterations is bounded. This bound is independent of the polynomial degree of the ansatz functions and of the size of the underlying mesh. For a modified diagonal scaling, which uses special basis functions, we prove that the number of iterations grows only polylogarithmically in the polynomial degree. Here, a sufficiently fine mesh is required. Numerical results supporting the theory are presented.     

Continuous preconditioners for the mixed Poisson problem

In this note, we show how to apply preconditioners designed for piecewise linear finite element discretizations of the Poisson problem as preconditioners for the mixed problem. Our preconditioner can be applied both to the original and to the reduced Schur complement problem. Combined with a suitable iterative method, the number of iterations required to solve the preconditioned system will have the same dependency on the mesh size as for the preconditioner applied to the Poisson problem. The presented theory is demonstrated by numerical examples.     

Analysis of optimal preconditioners for CutFEM

In this article, we consider a class of unfitted finite element methods for scalar elliptic problems. These so-called CutFEM methods use standard finite element spaces on a fixed unfitted triangulation combined with the Nitsche technique and a ghost penalty stabilization. As a model problem we consider the application of such a method to the Poisson interface problem. We introduce and analyze a new class of preconditioners that is based on a subspace decomposition approach. The unfitted finite element space is split into two subspaces, where one subspace is the standard finite element space associated to the background mesh and the second subspace is spanned by all cut basis functions corresponding to nodes on the cut elements. We will show that this splitting is stable, uniformly in the discretization parameter and in the location of the interface in the triangulation. Based on this we introduce an efficient preconditioner that is uniformly spectrally equivalent to the stiffness matrix. Using a similar splitting, it is shown that the same preconditioning approach can also be applied to a fictitious domain CutFEM discretization of the Poisson equation. Results of numerical experiments are included that illustrate optimality of such preconditioners for the Poisson interface problem and the Poisson fictitious domain problem.     

Iterative solution techniques for finite element applications

An iterative solver has been recently developed to solve very large systems of linear equations. The application of such a solver in commercial finite element software is not yet accepted. The purpose of the paper is to describe the new iterative solver and report on the practical application of this capability in different fields of interest.

The iterative solver uses the conjugate gradient method and employs two types of preconditioning: the traditional Jacobi and the incomplete Cholesky decomposition method. An option has been added for diagonal scaling to handle matrices whose entries greatly differ in magnitude. This paper illustrates the reduction possible in both central processor time and disk storage for problems with very large, well-conditioned matrices. Problems arising in electromagnetic analysis as well as in structural analysis have been solved with different options available in the iterative solver and compared with the standard, direct solver results. Guidelines on the use of the new solver and the status of research on even more efficient preconditioners are given.     

An iterative substructuring method for the p-version of the boundary element method for hypersingular integral operators in three dimensions

Summary. We study preconditioners for the -version of the boundary element method for hypersingular integral equations in three dimensions. The preconditioners are based on iterative substructuring of the underlying ansatz spaces which are constructed by using discretely harmonic basis functions. We consider a so-called wire basket preconditioner and a non-overlapping additive Schwarz method based on the complete natural splitting, i.e. with respect to the nodal, edge and interior functions, as well as an almost diagonal preconditioner. In any case we add the space of piecewise bilinear functions which eliminate the dependence of the condition numbers on the mesh size. For all these methods we prove that the resulting condition numbers are bounded by . Here, is the polynomial degree of the ansatz functions and is a constant which is independent of and the mesh size of the underlying boundary element mesh. Numerical experiments supporting these results are reported. Received July 8, 1996 / Revised version received January 8, 1997     

A QMR-based interior-point algorithm for solving linear programs

A new approach for the implementation of interior-point methods for solving linear programs is proposed. Its main feature is the iterative solution of the symmetric, but highly indefinite 2×2-block systems of linear equations that arise within the interior-point algorithm. These linear systems are solved by a symmetric variant of the quasi-minimal residual (QMR) algorithm, which is an iterative solver for general linear systems. The symmetric QMR algorithm can be combined with indefinite preconditioners, which is crucial for the efficient solution of highly indefinite linear systems, yet it still fully exploits the symmetry of the linear systems to be solved. To support the use of the symmetric QMR iteration, a novel stable reduction of the original unsymmetric 3×3-block systems to symmetric 2×2-block systems is introduced, and a measure for a low relative accuracy for the solution of these linear systems within the interior-point algorithm is proposed. Some indefinite preconditioners are discussed. Finally, we report results of a few preliminary numerical experiments to illustrate the features of the new approach.     

Block ILU Preconditioners for a Nonsymmetric Block-Tridiagonal M-Matrix

We propose block ILU (incomplete LU) factorization preconditioners for a nonsymmetric block-tridiagonal M-matrix whose computation can be done in parallel based on matrix blocks. Some theoretical properties for these block ILU factorization preconditioners are studied and then we describe how to construct them effectively for a special type of matrix. We also discuss a parallelization of the preconditioner solver step used in nonstationary iterative methods with the block ILU preconditioners. Numerical results of the right preconditioned BiCGSTAB method using the block ILU preconditioners are compared with those of the right preconditioned BiCGSTAB using a standard ILU factorization preconditioner to see how effective the block ILU preconditioners are.     

A numerical study of optimized sparse preconditioners

Preconditioning strategies based on incomplete factorizations and polynomial approximations are studied through extensive numerical experiments. We are concerned with the question of the optimal rate of convergence that can be achieved for these classes of preconditioners.Our conclusion is that the well-known Modified Incomplete Cholesky factorization (MIC), cf. e.g., Gustafsson [20], and the polynomial preconditioning based on the Chebyshev polynomials, cf. Johnson, Micchelli and Paul [22], have optimal order of convergence as applied to matrix systems derived by discretization of the Poisson equation. Thus for the discrete two-dimensional Poisson equation withn unknowns,O(n ^1/4) andO(n ^1/2) seem to be the optimal rates of convergence for the Conjugate Gradient (CG) method using incomplete factorizations and polynomial preconditioners, respectively. The results obtained for polynomial preconditioners are in agreement with the basic theory of CG, which implies that such preconditioners can not lead to improvement of the asymptotic convergence rate.By optimizing the preconditioners with respect to certain criteria, we observe a reduction of the number of CG iterations, but the rates of convergence remain unchanged.Supported by The Norwegian Research Council for Science and the Humanities (NAVF) under grants no. 413.90/002 and 412.93/005.Supported by The Royal Norwegian Council for Scientific and Industrial Research (NTNF) through program no. STP.28402: Toolkits in industrial mathematics.     

Multilevel preconditioners for discretizations of the biharmonic equation by rectangular finite elements

Recently, some new multilevel preconditioners for solving elliptic finite element discretizations by iterative methods have been proposed. They are based on appropriate splittings of the finite element spaces under consideration, and may be analyzed within the framework of additive Schwarz schemes. In this paper we discuss some multilevel methods for discretizations of the fourth-order biharmonic problem by rectangular elements and derive optimal estimates for the condition numbers of the preconditioned linear systems. For the Bogner–Fox–Schmit rectangle, the generalization of the Bramble–Pasciak–Xu method is discussed. As a byproduct, an optimal multilevel preconditioner for nonconforming discretizations by Adini elements is also derived.     

Numerical solution of the Falkner-Skan equation based on quasilinearization

We present two iterative methods for solving the Falkner-Skan equation based on the quasilinearization method. We formulate the original problem as a new free boundary value problem. The truncated boundary depending on a small parameter is an unknown free boundary and has to be determined as part of solution. Using a change of variables, the free boundary value problem is transformed to a problem defined on [0, 1]. We apply the quasilinearization method to solve the resulting nonlinear problem. Then we propose two different iterative algorithms by means of a cubic spline solver. Numerical results for various instances are compared with those reported previously in the literature. The comparisons show the accuracy, robustness and efficiency of the presented methodology.