耦合Burgers方程的Painleve分析和相关性质

为研究耦合Burgers方程的可积性,利用WTC测试方法,给出了第一类Burgers方程的Painleve性质和第二类Burgers方程的条件Painleve性质．进而得到了第一类方程的变量分离解和第二类方程的（N2＋3N＋6/2）-参数Lie点对称群．     

耦合Burgers方程的Painleve分析和相关性质

为研究耦合Burgers方程的可积性，利用WTC测试方法，给出了第一类Burgers方程的Painleve性质和第二类Burgers方程的条件Painleve性质．进而得到了第一类方程的变量分离解和第二类方程的（N2＋3N＋6/2）-参数Lie点对称群．     

Volterra方程数值解中带自适应步长控制的Runge-Kutta方法(英文)

在本文中我们构造了解第二类Volterra方程的一般Runge-Kutta方法,并且研究了第二类Volterra方程数值解法的自适应步长控制。     

POISSON方程新的边界积分方程

POISSON方程边界值问题边界元法所应用的边界积分方程,其类型,关于未知位势导数是第一类积分方程,关于未知位势是第二类积分方程。本本文从格林公式出发,通过建立位势的单、双场守恒积分公式,推导出POISSON方程新的边界积分方程,其类型与经典方程相反,关于未知位势是第一类积分方程,关于未知位势导数是第二类积分方程。     

两类可积的二阶线性方程

讨论了两类二阶变系数线性方程及其解．第一类包含常系数方程，第二类包含Eular方程．     

概率框架下一类算子方程逼近解的优化

引入概率框架下算子方程逼近解的优化问题, 证明了一个沟通算子方程在概率框架下的最优逼近解的阶与概率宽度渐近阶之间关系的一般性的结果, 并由此得到了以混合偏导数确定的多元Sobolev类中的函数为核的第二类Fredholm积分方程类在概率框架下最优逼近解的精确阶.     

用第二类Fredholm积分方程求解弹性半空间上弹性板的垂直振动

根据混合边值条件,建立均布简谐荷载作用下弹性半空间上弹性板振动的对偶积分方程.用Abel变换化对偶积分方程为第二类Fredholm积分方程,并进行了数值计算.     

浅析数学物理方程求解中的延拓思想——以波动方程为例

应用延拓方法和无界波动方程定解问题的达朗贝尔公式,求解半无界波动方程的定解问题,其中的边界条件分别为第一类和第二类非齐次型.旨在拓宽学生的解题思路,使学生灵活掌握解题方法,并为《数学物理方程》课程的教学提供些许参考.     

Minkowski空间中定向曲面上的第二类松弛弹性线

在Minkowski空间中,定义了定向曲面上的第二类松弛弹性线,推导了在定向曲面上的第二类松弛弹性线的Euler-Lagrange方程．进一步阐明了,这些曲线是否落在曲率线上,最后给出相关的实例．     

Volterra积分方程的蒙特卡罗数值求解方法

本文讨论了第一类、第二类以及具有奇异核的Volterra积分方程的数值解问题.利用重要抽样蒙特卡罗随机模拟方法获得积分方程解的近似计算结果.通过对文献中算例的实现表明文中所提方法扩展了Volterra型积分方程的数值求解方法,     

矩阵方程AX=B的双反对称最佳逼近解

本文主要讨论下而两个问题并得到相关结果:问题Ⅰ:给定A ∈ R~(k×n),B ∈ R~(k×n),求X ∈ BASR~(n×n),使得AX=B.问题Ⅱ:给定X* ∈R~(n×n),求X使得‖X-X~*‖=minX∈S_E‖X-X~*‖,其中S_E是问题Ⅰ的解集合,‖·‖是Frobenius范数.通过对上述问题的讨论给出了问题Ⅰ解存在的充分必要条件和其解的一般表达式同时给出了问题Ⅱ的解,算法,和数值例子.     

Convergence of an Alternating Method to Solve the Cauchy Problem for Poisson's Equation

This work concerns the development of iterative algorithms for the solution of the Cauchy problem for the Poisson equation. We accelerate the process proposed by Kozlov et al. [V.A. Kozlov, V.G. Maz'ya and A.V. Fomin (1991). An iterative method for solving the Cauchy problem for elliptic equations. Comput. Maths. Phys. , 31 (1), 45-52.] by making use of a relaxation of the Dirichlet data. We provide theoretical justification of the convergence of the new algorithm, and present some results of numerical experiments with the method.     

Explicit solution for a Stefan problem with variable latent heat and constant heat flux boundary conditions

In Voller, Swenson and Paola [V.R. Voller, J.B. Swenson, C. Paola, An analytical solution for a Stefan problem with variable latent heat, Int. J. Heat Mass Transfer 47 (2004) 5387-5390], and Lorenzo-Trueba and Voller [J. Lorenzo-Trueba, V.R. Voller, Analytical and numerical solution of a generalized Stefan problem exhibiting two moving boundaries with application to ocean delta formation, J. Math. Anal. Appl. 366 (2010) 538-549], a model associated with the formation of sedimentary ocean deltas is studied through a one-phase Stefan-like problem with variable latent heat. Motivated by these works, we consider a two-phase Stefan problem with variable latent of fusion and initial temperature, and constant heat flux boundary conditions. We obtain the sufficient condition on the data in order to have an explicit solution of a similarity type of the corresponding free boundary problem for a semi-infinite material. Moreover, the explicit solution given in the first quoted paper can be recovered for a particular case by taking a null heat flux condition at the infinity.     

用数值积分的初参数法解波纹管

本文把波纹管的边值问题化为初值问题,根据B.B.Новожилов的环壳方程[8].用S.Gill方法[10],求出半圆弧波纹管的数值解.计算了在轴向力和内压作用下的变形和应力分布,其结果和钱伟长教授的一般解完全一致.本文提出的外推公式可以显著地提高离散化方法的计算精度.文后附有WANG 2200VS计算机上BASIC语言的源程序.     

Some iterative algorithms for positive definite solution to nonlinear matrix equations

This paper is concerned with the unique positive definite solution to a system of nonlinear matrix equations $X-A^*\bar{Y}^{-1}A=I_n$ and $Y-B^*\bar{X}^{-1}B=I_n$, where $A,B\in\mathbb{C}^{n\times n}$ are given matrices. Based on the special structure of the system of nonlinear matrix equations, the system can be equivalently reformulated as $V-C^*\bar{V}^{-1}C=I_{2n}$. Moreover, by means of Sherman-Moorison-Woodbury formula, we derive the relationship between the solutions of $V-C^*\bar{V}^{-1}C =I_{2n}$ and the well studied standard nonlinear matrix equation $Z+D^*Z^{-1}D=Q$, where $D$, $Q$ are uniquely determined by $C$. Then, we present a structure-preserving doubling algorithm and two modified structure-preserving doubling algorithms to compute the positive definite solution of the system. Furthermore, cyclic reduction algorithm and two modified cyclic reduction algorithms for the positive definite solution of the system are proposed. Finally, some numerical examples are presented to illustrate the efficiency of the theoretical results and the behavior of the considered algorithms.     

双对称非负定阵一类逆特征值问题的最小二乘解

１．引言 逆特征值问题在工程中有广泛的应用,其研究已有一些很好的结果［１－５］．最近,文［６］还研究了双对称矩阵逆特征值问题,即研究了如下两个问题： 问题Ａ．已知Ｘ∈Ｒｎｘｍ,Ａ＝ｄｉａｇ（λ１…,λｍ）,求Ａ∈ＢＳＲｎｘｎ使 ＡＸ＝ＸＡ,其中 Ｒｎｘｍ表示全体 ｎ ｘ ｍ实矩阵集合, ＢＳＲｎｘｎ表示全体 ｎ ｘ ｎ双对称阵集合． 问题Ｂ．已知Ａ＊ＥＲｎｘｎ,求Ａ∈ＳＥ使 ｜｜Ａ＊－Ａ｜｜＝ ｉｎｆ ｜｜Ａ＊－Ａ｜｜ ＡＦＳＥ其中 ＳＥ是问题 Ａ的解集合,｜｜． ｜｜表示 Ｆｒｏｂｅｎｉｕｓ范数． 在实际问题中, …     

COMPUTING THE NEAREST BISYMMETRIC POSITIVE SEMIDEFINITE MATRIX UNDER THE SPECTRAL RESTRICTION

Let A and C denote real n × n matrices. Given real n-vectors x1, ... ,xm, m ≤ n, and a set of numbers L = {λ1,λ2,... ,λm}. We describe (I) the set (?) of all real n × n bisymmetric positive seidefinite matrices A such that Axi is the "best" approximate to λixi, i = 1,2,...,m in Frobenius norm and (II) the Y in set (?) which minimize Frobenius norm of ||C - Y||.An existence theorem of the solutions for Problem I and Problem II is given and the general expression of solutions for Problem I is derived. Some sufficient conditions under which Problem I and Problem II have an explicit solution is provided. A numerical algorithm of the solution for Problem II has been presented.     

A simulation-based approach to two-stage stochastic programming with recourse

In this paper we consider stochastic programming problems where the objective function is given as an expected value function. We discuss Monte Carlo simulation based approaches to a numerical solution of such problems. In particular, we discuss in detail and present numerical results for two-stage stochastic programming with recourse where the random data have a continuous (multivariate normal) distribution. We think that the novelty of the numerical approach developed in this paper is twofold. First, various variance reduction techniques are applied in order to enhance the rate of convergence. Successful application of those techniques is what makes the whole approach numerically feasible. Second, a statistical inference is developed and applied to estimation of the error, validation of optimality of a calculated solution and statistically based stopping criteria for an iterative alogrithm. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Supported by CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico), Brasília, Brazil, through a Doctoral Fellowship under grant 200595/93-8.     

An iterative algorithm for the least squares bisymmetric solutions of the matrix equations

In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X₀, a solution X^* can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of initial matrix. Furthermore, in the solution set of the above problem, the unique optimal approximation solution to a given matrix in the Frobenius norm can be derived by finding the least norm bisymmetric solution of a new corresponding minimum Frobenius norm problem. Given numerical examples show that the iterative algorithm is quite effective in actual computation.     

基于多项式实数根的三维井眼轨道设计理论

三维井眼轨道设计问题需要求解多元非线性方程组,由于未知数多、方程的非线性强,一般难以求出解析解,通常使用数值迭代方法求数值解.对三维s型轨道设计问题依据已知设计参数进行了分类,发现了一套有效的数学化简技巧,求出了第1类初值问题的解析解和第Ⅱ-Ⅳ类初值问题的拟解析解.提出了轨道设计问题的特征多项式的新概念,并证明了轨道设计问题是否有解取决于特征多项式是否有实数根,解的个数不多于实数根的个数或个数的二倍.所提出的基于特征多项式实数根的拟解析算法对于求解轨道设计问题具有计算速度快、计算可靠性高、易于计算机编程实现等优点,在三维水平井轨道设计、三维绕障井轨道设计、防碰设计等方面具有比数值迭代方法更好的计算性能.