基于离散点和法矢的曲线重构算法

This paper presents a curve reconstruction algorithm based on discrete data points and normal vectors using B-splines.The proposed algorithm has been improved in three steps:parameterization of the discrete data points with tangent vectors,the B-spline knot vector determination by the selected dominant points based on normal vectors,and the determination of the weight to balancing the two errors of the data points and normal vectors in fitting model.Therefore,we transform the B-spline fitting problem into three sub-problems,and can obtain the B-spline curve adaptively.Compared with the usual fitting method which is based on dominant points selected only by data points,the B-spline curves reconstructed by our approach can retain better geometric shape of the original curves when the given data set contains high strength noises.     

二次四元数系统正定解的迭代法

二次四元数系统XAX?BX=P是离散型Lyapunov方程正定解反问题的推广形式.本文在四元数体上讨论它的正定解存在性及迭代求解方法.利用等价二次方程的系数矩阵的极大极小特征值,获得其正定解的存在区间,并针对系数矩阵的不同情况构建出三种收敛的迭代格式.同时根据每种迭代的特点,给出了迭代初始矩阵的选取方法.最后通过四元数矩阵复算子实现Matlab环境下求解.数值算例验证了所给方法的有效及可行性.     

Finite element approximation of nonlocal parabolic problem

In this article, we present a finite element scheme combined with backward Euler method to solve a nonlocal parabolic problem. An important issue in the numerical solution of nonlocal problems while using Newton's method is related to its structure. In fact differently from the local case where the Jacobian matrix is sparse and banded, in the nonlocal case the Jacobian matrix is dense and computations are much more onerous compared to that for differential equations. In order to avoid this difficulty, we use the technique given by Gudi (SIAM J Numer Anal 50 (2012), 657–668) for elliptic nonlocal problem of Kirchhoff type. We discuss the well‐posedness of the weak formulation at continuous as well as at discrete levels. We also derive a priori error estimates for semidiscrete and fully discrete formulations in L² and H¹ norms. Results based on the usual finite element method are provided to confirm the theoretical estimates. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 786–813, 2017     

Integral equations related to the study of an inverse coefficient problem for a system of partial differential equations

We consider an inverse coefficient problem for a linear system of partial differential equations. The values of one solution component on a given curve are used as additional information for determining the unknown coefficient. The proof of the uniqueness of the solution of the inverse problem is based on the analysis of the unique solvability of a homogeneous integral equation of the first kind. The existence of a solution of the inverse problem is proved by reduction to a system of nonlinear integral equations.     

On the Reconstruction of a String from Spectral Data

We consider the problem to reconstruct the mass distribution of a string where the mass is concentrated in a finite number of points, or, equivalently, the problem to reconstruct a simply connected mass spring system with unknown masses and stiffness parameters if the following data are given. Problem 1: The spectra of the string and of a modification of the string, or. Problem 2: The spectra of two different modifications of the string. Here a modification of the string is a string which appears if we link the unknown string with another string of known mass distribution. The paper contains a necessary condition for the existence of a solution of Problem 1, and explicit formulas and an algorithm for the solutions of the Problems 1 and 2 under the condition that there exists a solution. For the case that the mass distribution of the unknown string is not discrete we consider the problem to find discrete approximations of this distribution from the respective spectral data. The methods are based on the spectral theory of generalized second order differential operators as developed by M. G. Krein     

On sinc discretization and banded preconditioning for linear third‐order ordinary differential equations

Some draining or coating fluid‐flow problems and problems concerning the flow of thin films of viscous fluid with a free surface can be described by third‐order ordinary differential equations (ODEs). In this paper, we solve the boundary value problems of such equations by sinc discretization and prove that the discrete solutions converge to the true solutions of the ODEs exponentially. The discrete solution is determined by a linear system with the coefficient matrix being a combination of Toeplitz and diagonal matrices. The system can be effectively solved by Krylov subspace iteration methods, such as GMRES, preconditioned by banded matrices. We demonstrate that the eigenvalues of the preconditioned matrix are uniformly bounded within a rectangle on the complex plane independent of the size of the linear system. Numerical examples are given to illustrate the effective performance of our method. Copyright © 2010 John Wiley & Sons, Ltd.     

Divergence-free wavelet solution to the Stokes problem

In this paper, we use divergence-free wavelets to give an adaptive solution to the velocity field of the Stokes problem. We first use divergence-free wavelets to discretize the divergence-free weak formulation of the Stokes problem and obtain a discrete positive definite linear system of equations whose coefficient matrix is quasi-sparse; Secondly, an adaptive scheme is used to solve the discrete linear system of equations and the error estimation and complexity analysis are given.     

GMRES, L-Curves, and Discrete Ill-Posed Problems

The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. This paper discusses application of the GMRES method to the solution of large linear systems of equations that arise from the discretization of linear ill-posed problems. These linear systems are severely ill-conditioned and are referred to as discrete ill-posed problems. We are concerned with the situation when the right-hand side vector is contaminated by measurement errors, and we discuss how a meaningful approximate solution of the discrete ill-posed problem can be determined by early termination of the iterations with the GMRES method. We propose a termination criterion based on the condition number of the projected matrices defined by the GMRES method. Under certain conditions on the linear system, the termination index corresponds to the vertex of an L-shaped curve.     

On the optimal recovery of a solution of a system of linear homogeneous differential equations

We consider the optimal recovery problem for a solution of a system of linear homogeneous ordinary differential equations with constant self-adjoint coefficient matrix on the basis of inexactly given values of the solution at two time instants.     

The probabilistic 1-maximal covering problem on a network with discrete demand weights

We discuss the probabilistic 1-maximal covering problem on a network with uncertain demand. A single facility is to be located on the network. The demand originating from a node is considered covered if the shortest distance from the node to the facility does not exceed a given service distance. It is assumed that demand weights are independent discrete random variables. The objective of the problem is to find a location for the facility so as to maximize the probability that the total covered demand is greater than or equal to a pre-selected threshold value. We show that the problem is NP-hard and that an optimal solution exists in a finite set of dominant points. We develop an exact algorithm and a normal approximation solution procedure. Computational experiment is performed to evaluate their performance.     

Reconstruction of random-disturbance amplitude in linear stochastic equations from measurements of some of the coordinates

The problem of reconstructing the unknown amplitude of a random disturbance in a linear stochastic differential equation is studied in a fairly general formulation by applying dynamic inversion theory. The amplitude is reconstructed using discrete information on several realizations of some of the coordinates of the stochastic process. The problem is reduced to an inverse one for a system of ordinary differential equations satisfied by the elements of the covariance matrix of the original process. Constructive solvability conditions in the form of relations on the parameters of the system are discussed. A finite-step software implementable solving algorithm based on the method of auxiliary controlled models is tested using a numerical example. The accuracy of the algorithm is estimated with respect to the number of measured realizations.     

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

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

On reflecting boundary conditions for space-fractional equations on a finite interval: Proof of the matrix transfer technique

Even in the one-dimensional case, dealing with the analysis of space-fractional differential equations on finite domains is a difficult issue. On a finite interval coupled with zero flux boundary conditions, different approaches have been proposed to define a space-fractional differential operator and to compute the solution to the corresponding fractional problem, but to the best of our knowledge, a clear relationship between these strategies is yet to be established. Here, by using the theory of α-stable symmetric Lévy flights and the master equation, we derive a discrete representation of the non-local operator embedding in its definition the concept of reflecting boundary conditions. We refer to this discrete operator as the reflection matrix and provide (and prove) a theorem on the analytic expression of its eigenvalues and eigenvectors. We then use this result to compare the reflection matrix to the discrete operator defined via the matrix transfer technique, and establish the validity of the latter technique in producing the correct solution to a space-fractional differential equation on a finite interval with reflecting boundary conditions. We finally discuss and emphasize the challenges in the generalisation of the proposed result to more than one spatial dimension.     

一个求解约束非线性优化问题的微分方程方法

本文构造的求解非线性优化问题的微分方程方法包括两个微分方程系统,第一个系统基于问题函数的一阶信息,第二个系统基于二阶信息．这两个系统具有性质:非线性优化问题的局部最优解是它们的渐近稳定的平衡点,并且初始点是可行点时,解轨迹都落于可行域中．我们证明了两个微分方程系统的离散迭代格式的收敛性定理和基于第二个系统的离散迭代格式的局部二次收敛性质．还给出了基于两个系统的离散迭代方法的数值算例,数值结果表明基于二阶信息的微分方程方法速度更快．     

A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata

In this paper we consider an inverse problem for a damped vibration system from the noisy measured eigendata, where the mass, damping, and stiffness matrices are all symmetric positive‐definite matrices with the mass matrix being diagonal and the damping and stiffness matrices being tridiagonal. To take into consideration the noise in the data, the problem is formulated as a convex optimization problem involving quadratic constraints on the unknown mass, damping, and stiffness parameters. Then we propose a smoothing Newton‐type algorithm for the optimization problem, which improves a pre‐existing estimate of a solution to the inverse problem. We show that the proposed method converges both globally and quadratically. Numerical examples are also given to demonstrate the efficiency of our method. Copyright © 2008 John Wiley & Sons, Ltd.     

高精度参数估计问题

对高精度参数的估计问题进行了研究.在观测数据无误差的情况下,将微分方程组转化为线性方程组,利用矩阵的奇异值分解给出了参数的最优解.在有观测数据误差的情况下,采用高斯-牛顿迭代法进行求解,给出了改进的高斯-牛顿法和阻尼最小二乘算法;通过灰色估计法给出了模型的初始解,通过微分方程数值解法计算模型迭代过程中误差和偏导数.最后,通过对迭代过程中的状态变量引入误差项,导出了基于总体最小二乘的高斯-牛顿迭代法,从系统的角度解决了观测时间有误差下的参数估计问题.     

Construction of ODE Curves

This paper deals with a construction problem of free-form curves from data constituted by some approximation points and a boundary value problem for an ordinary differential equation (ODE). The solution of this problem is called an ODE curve. We discretize the problem in a space of B-spline functions. Finally, we analyze a graphical example in order to illustrate the validity and effectiveness of our method.     

Convergence acceleration of preconditioned conjugate gradient solver based on error vector sampling for a sequence of linear systems

In this article, we focus on solving a sequence of linear systems that have identical (or similar) coefficient matrices. For this type of problem, we investigate subspace correction (SC) and deflation methods, which use an auxiliary matrix (subspace) to accelerate the convergence of the iterative method. In practical simulations, these acceleration methods typically work well when the range of the auxiliary matrix contains eigenspaces corresponding to small eigenvalues of the coefficient matrix. We develop a new algebraic auxiliary matrix construction method based on error vector sampling in which eigenvectors with small eigenvalues are efficiently identified in the solution process. We use the generated auxiliary matrix for convergence acceleration in the following solution step. Numerical tests confirm that both SC and deflation methods with the auxiliary matrix can accelerate the solution process of the iterative solver. Furthermore, we examine the applicability of our technique to the estimation of the condition number of the coefficient matrix. We also present the algorithm of the preconditioned conjugate gradient method with condition number estimation.     

The Inverse Problem Method on the Half-Line and a Nested System of Riccati Equations

A mixed problem for the nonlinear Bogoyavlenskii system on the half-line is studied by the inverse problem method. The solution of the mixed problem is reduced to the solution of the inverse spectral problem of recovering a forth-order differential operator on the half-line from the Weyl matrix. We derive evolution equations for the elements of the Weyl matrix and give an algorithm for the solution of the mixed problem. Evolution equations of the elements of the Weyl matrix are nonlinear. It is shown that they can be reduced to a nested system of three successively solvable matrix Riccati equations.     

一类抛物型方程系数反问题的分裂算法

考虑利用终端时刻的温度u(x,T)=Z_T(x)反演热传导方程u_t-a~2u_(xx) q(x)u=0,x∈(0,1)中的未知系数q(x)的反问题.通过引进变换v(x,t)=(u_t(x,t)/u(x,t))将此非线性不适定问题的求解分解为两步.首先利用输入数据迭代求解一个非线性的正问题(该过程独立于未知系数),得到其迭代解v~(k)(x,t).其次利用q(x)与v(x,t)的关系式求出q(x)的近似解.对提出的反演方法,证明了采用的变换的可行性,得到了原反问题与由变换后的非线性正问题反演q(x)的等价性并且证明了迭代解的收敛性,给出了收敛速度.数值结果表明了该方法的有效性.