求复矩阵奇异值的复单边Jacobi型方法

Rijk于1989年较详细地讨论了实矩阵奇异值分解(SVD)的单边Jacobi法;并指出在串行环境下,单边Jacobi法与流行的Golub-Reinsch法是竞争的对手,由于Jacobi型方法具有高度并行性,因而在并行环境下,单边Jacobi法就更具吸引力了.     

拟弧长延拓法在静电激励MEMS吸合特性研究中的应用

在静电激励微机电系统MEMS(micro-electro-mechanical systems)吸合特性研究中,基于应变梯度理论的微梁结构的控制方程是非线性高阶微分方程,给方程的求解带来了困难.由于该问题的数学模型本质上是分叉问题,方程的解支上出现奇异点,而运用局部延拓法无法通过奇异点.因此,通过运用广义微分求积法将控制方程降阶离散,结合拟弧长延拓法使迭代顺利通过奇异点,求出了整个解曲线.结果表明,拟弧长延拓法能有效并准确地求解具有分叉现象的高阶微分方程问题,为精确预测静电激励MEMS的吸合电压提供有力帮助.     

单参数非线性问题中高阶奇异点的计算

本文考虑计算单参数非线性问题中高阶奇异点的数值方法，基于确定奇异点的一个普适的扩张系统，结合同伦参数的拟弧长延拓，给出了计算各类高阶奇异点的一个统一算法，数值例子表明了算法的有效性．     

水平线性互补问题投影迭代法和模系矩阵分裂迭代法的等价性

水平线性互补问题(HLCP)是著名线性互补问题(LCP)的重要推广形式之一,投影迭代法和模系矩阵分裂迭代法是最近提出的求解HLCP两类非常有效的热点方法.本文研究表明,尽管这两类方法导出原理不同,但在一定条件下是等价的.特别地,当模系矩阵分裂迭代法中参数矩阵Ω取为特定的正对角矩阵时,投影Jacobi法、投影Gauss-Seidel法和投影SOR法分别等价于模系Jacobi迭代法、加速的模系Gauss-Seidel迭代法和加速的模系SOR迭代法.此外,对一般的正对角矩阵Ω,本文也研究了两类方法的等价性.最后,通过数值算例验证了本文的理论结果.     

指数时程差分与有理谱配点法求解奇异摄动Burgers-Huxley问题

带小参数ε的Burgers-Huxley方程是一类非线性、非定常奇异摄动初边值问题,本文用指数时程差分与有理谱配点法求其数值解.对空间方向的边界层,用带sinh变换的有理谱配点法便Chebyshev节点在边界层处加密,只需取较少节点即可达到较高精度;时间方向采用指数时程差分与4阶Runge-Kutta法相结合的格式,并用围线积分计算矩阵甬数的方法克服了求解奇异摄动问题时遇到的的数值不稳定堆题.数值实验表明,本文提出的方法在求解左、右边界层和内部层的奇异摄动Burgers-Huxley问题都有较高的精度.     

大范围求解非线性方程组的指数同伦法

为了解决关于奇异的非线性方程组求根问题,提出了一种由同伦算法推出大范围收敛的连续型方法-指数同伦法,构造了一类指数同伦方程,克服了Jacobi矩阵的奇异,分析了指数同伦方     

瞬态热传导的奇异边界法及其MATLAB实现

基于动力学问题时间依赖基本解的奇异边界法是一种无网格边界配点法.该方法引入源点强度因子的概念从而避免了基本解的源点奇异性,具有数学简单、编程容易、精度高等优点.将该方法用于瞬态热传导问题的数值模拟,运用MATLAB实现该问题的数值研究,并创建相应的MATLAB工具箱.针对二维和三维瞬态热传导问题,进行了基于反插值技术和经验公式的奇异边界法MATLAB算例实现.针对支撑圆坯低温瞬态温度场的模拟结果表明,瞬态热传导奇异边界法的MATLAB工具箱具有简单、方便、精确可靠的优点.研究成果有助于发展瞬态热传导的奇异边界法,并为瞬态热传导问题的数值分析和仿真提供了一种简单高效的模拟工具.     

最佳等参元

等参元及其参数变换的插值方法。是有限元分析的有力工具之一,在工程计算中,得到广泛的应用. 在有限元分析中,当采用等参元时,一旦单元的等参坐标变换的Jacobi矩阵发生奇异,就要中止计算,下机修改原有的单元剖分,直到所有单元的Jacobi矩阵均非奇异. [1]突破原等参元的规定,给出了八节点Serendipity等参元的修改公式;[2]也给出了类似的修改公式.上述均以数值例子说明新公式的优点.而[3—6]完整、系统地给出     

非线性动力系统中两鞍-结分岔点间非稳定曲线的确定

采用将伪弧长延拓法与Poincaré映射法相结合的方法,确定非自治动力系统中两鞍-结分岔点间非稳定曲线,并对采用一般延拓法时出现的奇异性进行了证明。该方法引入了一正则化方程,避免了在求解过程中出现的奇异问题,并给出了相应的迭代格式。在曲线的延拓过程中,由于存在两个延拓方向,为保证将曲线延拓出来,给出了一种确定切线方向的方法,该方法在分析非线性振动系统中的双稳态现象等问题是很有效的。     

混合勒贝格空间上双参数奇异积分算子的端点弱估计（英文）

本文研究了混合勒贝格空间上双参数奇异积分算子的有界性.利用双参数奇异积分算子在勒贝格空间的有界性和一个向量值延拓理论.获得了双参数奇异积分算子在混合勒贝格空间上的端点弱估计和强型估计.并给出了乘积空间上非卷积型奇异积分算子的一个应用.这些结果将文献[3]中的结论推广到混合范数情形.     

Linear system solution by null‐space approximation and projection (SNAP)

Solutions of large sparse linear systems of equations are usually obtained iteratively by constructing a smaller dimensional subspace such as a Krylov subspace. The convergence of these methods is sometimes hampered by the presence of small eigenvalues, in which case, some form of deflation can help improve convergence. The method presented in this paper enables the solution to be approximated by focusing the attention directly on the ‘small’ eigenspace (‘singular vector’ space). It is based on embedding the solution of the linear system within the eigenvalue problem (singular value problem) in order to facilitate the direct use of methods such as implicitly restarted Arnoldi or Jacobi–Davidson for the linear system solution. The proposed method, called ‘solution by null‐space approximation and projection’ (SNAP), differs from other similar approaches in that it converts the non‐homogeneous system into a homogeneous one by constructing an annihilator of the right‐hand side. The solution then lies in the null space of the resulting matrix. We examine the construction of a sequence of approximate null spaces using a Jacobi–Davidson style singular value decomposition method, called restarted SNAP‐JD, from which an approximate solution can be obtained. Relevant theory is discussed and the method is illustrated by numerical examples where SNAP is compared with both GMRES and GMRES‐IR. Copyright © 2006 John Wiley & Sons, Ltd.     

Jacobi Spectral Methods for Volterra-Urysohn Integral Equations of Second Kind with Weakly Singular Kernels

Abstract

In this article, we discuss Jacobi spectral Galerkin and iterated Jacobi spectral Galerkin methods for Volterra-Urysohn integral equations with weakly singular kernels and obtain the convergence results in both the infinity and weighted L²-norm. We show that the order of convergence in iterated Jacobi spectral Galerkin method improves over Jacobi spectral Galerkin method. We obtain the convergence results in two cases when the exact solution is sufficiently smooth and non-smooth. For finding the improved convergence results, we also discuss Jacobi spectral multi-Galerkin and iterated Jacobi spectral multi-Galerkin method and obtain the convergence results in weighted L²-norm. In fact, we prove that the iterated Jacobi spectral multi-Galerkin method improves over iterated Jacobi spectral Galerkin method. We provide numerical results to verify the theoretical results.     

An iterative method based on equation decomposition for the fourth‐order singular perturbation problem

In this article, we propose an iterative method based on the equation decomposition technique ( 1 ) for the numerical solution of a singular perturbation problem of fourth‐order elliptic equation. At each step of the given method, we only need to solve a boundary value problem of second‐order elliptic equation and a second‐order singular perturbation problem. We prove that our approximate solution converges to the exact solution when the domain is a disc. Our numerical examples show the efficiency and accuracy of our method. Our iterative method works very well for singular perturbation problems, that is, the case of 0 < ε ? 1, and the convergence rate is very fast. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

JACOBI PSEUDOSPECTRAL METHOD FOR FOURTH ORDER PROBLEMS

In this paper, we investigate Jacobi pseudospectral method for fourth order problems. We establish some basic results on the Jacobi-Gauss-type interpolations in non-uniformly weighted Sobolev spaces, which serve as important tools in analysis of numerical quadratures, and numerical methods of differential and integral equations. Then we propose Jacobi pseudospectral schemes for several singular problems and multiple-dimensional problems of fourth order. Numerical results demonstrate the spectral accuracy of these schemes, and coincide well with theoretical analysis.     

一类不可微二次规划逆问题

本文求解了一类二次规划的逆问题,具体为目标函数是矩阵谱范数与向量无穷范数之和的最小化问题.首先将该问题转化为目标函数可分离变量的凸优化问题,提出用G-ADMM法求解.并结合奇异值阈值算法,Moreau-Yosida正则化算法,matlab优化工具箱的quadprog函数来精确求解相应的子问题.而对于其中一个子问题的精确求解过程中发现其仍是目标函数可分离变量的凸优化问题,由于其变量都是矩阵,所以采用适合多个矩阵变量的交替方向法求解,通过引入新的变量,使其每个子问题的解都具有显示表达式.最后给出采用的G-ADMM法求解本文问题的数值实验.数据表明,本文所采用的方法能够高效快速地解决该二次规划逆问题.     

Hermite三次样条多小波自然边界元法

针对应用自然边界元方法解上半平面的Laplace方程的Neumann边值问题时存在奇异积分的困难,本文提出了Hermite三次样条多小波自然边界元法.Hermite三次样条多小波具有较短的紧支集、很好的稳定性和显式表达式,而且它们在不同层上的导数还是相互正交的.因此,本文将它与自然边界元法相结合,利用小波伽辽金法离散自然边界积分方程,使自然边界积分方程中的强奇异积分化为弱奇异积分,从而降低了问题的复杂性.文中给出的算例表明了该方法的可行性和有效性.     

Solving singular second order three-point boundary value problems using reproducing kernel Hilbert space method

This paper investigates the numerical solutions of singular second order three-point boundary value problems using reproducing kernel Hilbert space method. It is a relatively new analytical technique. The solution obtained by using the method takes the form of a convergent series with easily computable components. However, the reproducing kernel Hilbert space method cannot be used directly to solve a singular second order three-point boundary value problem, so we convert it into an equivalent integro-differential equation, which can be solved using reproducing kernel Hilbert space method. Four numerical examples are given to demonstrate the efficiency of the present method. The numerical results demonstrate that the method is quite accurate and efficient for singular second order three-point boundary value problems.     

二维刚性边值问题的小波-吉尔解法

本文利用微分方程数值解的离散小波表示，讨论了此类方程在满足一定初始条件和边值条件下，在一个方向上利用小波伽辽金法，另一方向上利用吉尔方法进行求解，提出了一种解二维刚性初，边值问题的小波数值算法，计算结果表明，利用该方法所求得的数值解精度高，而且由小波特有的性质，它特别适用于求解带有奇异摄动的刚性问题。     

A new Jacobi rational–Gauss collocation method for numerical solution of generalized pantograph equations

This paper is concerned with a generalization of a functional differential equation known as the pantograph equation which contains a linear functional argument. In this article, a new spectral collocation method is applied to solve the generalized pantograph equation with variable coefficients on a semi-infinite domain. This method is based on Jacobi rational functions and Gauss quadrature integration. The Jacobi rational-Gauss method reduces solving the generalized pantograph equation to a system of algebraic equations. Reasonable numerical results are obtained by selecting few Jacobi rational–Gauss collocation points. The proposed Jacobi rational–Gauss method is favorably compared with other methods. Numerical results demonstrate its accuracy, efficiency, and versatility on the half-line.     

New third-order method for solving systems of nonlinear equations

In this paper, we present a new iterative method to solve systems of nonlinear equations. The main advantages of the method are: it has order three, it does not require the evaluation of any second or higher order Fréchet derivative and it permits that the Jacobian be singular at some points. Thus, the problem due to the fact that the Jacobian is numerically singular is solved. The third order convergence in both one dimension and for the multivariate case are given. The numerical results illustrate the efficiency of the method for systems of nonlinear equations.