首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 171 毫秒
1.
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.  相似文献   

2.
DIVERGENCE - FREE WAVELET SOLUTION TO THE STOKES PROBLEM   总被引:2,自引:0,他引:2  
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.  相似文献   

3.
This paper deals with an inverse problem for recovering the piecewise constant viscoelasticity of a living body from MRE(Magnetic Resonance Elastography)data.Based on a scalar partial differential equation whose solution can approximately simulate MRE data,our inverse coefficient problem is considered as a statistical inverse problem of reconstructing the posterior distribution of unknown viscoelastic modulus.For sampling this distribution,one usually can use the Metropolis-Hastings Markov chain Monte Carlo(MHMCMC)algorithm.However,without an appropriate"proposal"distribution given artificially,the MH-MCMC algorithm is hard to draw samples efficiently.To avoid this,a so-called slice sampling algorithm is introduced in this paper and applied for solving our problem.The performance of these statistical inversion algorithms is numerically tested basing on simulated data.  相似文献   

4.
We discuss a problem to reconstruct the measurable sets in the plane from their fixed finite projections. In the main theorem, we construct an example of connected and simply connected polygons which are not uniquely reconstructed by their fixed finite projections. We also make a comparison between our main theorem and the known results on this problem.  相似文献   

5.
An effective continuous algorithm is proposed to find approximate solutions of NP-hardmax-cut problems.The algorithm relaxes the max-cut problem into a continuous nonlinearprogramming problem by replacing n discrete constraints in the original problem with onesingle continuous constraint.A feasible direction method is designed to solve the resultingnonlinear programming problem.The method employs only the gradient evaluations ofthe objective function,and no any matrix calculations and no line searches are required.This greatly reduces the calculation cost of the method,and is suitable for the solutionof large size max-cut problems.The convergence properties of the proposed method toKKT points of the nonlinear programming are analyzed.If the solution obtained by theproposed method is a global solution of the nonlinear programming problem,the solutionwill provide an upper bound on the max-cut value.Then an approximate solution to themax-cut problem is generated from the solution of the nonlinear programming and providesa lower bound on the max-cut value.Numerical experiments and comparisons on somemax-cut test problems(small and large size)show that the proposed algorithm is efficientto get the exact solutions for all small test problems and well satisfied solutions for mostof the large size test problems with less calculation costs.  相似文献   

6.
We propose a new numerical method for estimating the piecewise constant Robin coefficient in two-dimensional elliptic equation from boundary measurements. The Robin inverse problem is recast into a minimization of an output least-square formulation. A technique based on determining the discontinuous points of the unknown coefficient is suggested, and we investigate the differentiability of the solution and the objective functional with respect to the discontinuous points. Then we apply the Gauss-Newton method for reconstructing the shape of the unknown Robin coefficient. Numerical examples illustrate its efficiency and stability.  相似文献   

7.
For the five-point discrete formulae of directional derivatives in the finite point method,overcoming the challenge resulted from scattered point sets and making full use of the explicit expressions and accuracy of the formulae,this paper obtains a number of theoretical results:(1)a concise expression with definite meaning of the complicated directional difference coefficient matrix is presented,which characterizes the correlation between coefficients and the connection between coefficients and scattered geometric characteristics;(2)various expressions of the discriminant function for the solvability of numerical differentials along with the estimation of its lower bound are given,which are the bases for selecting neighboring points and making analysis;(3)the estimations of combinatorial elements and of each element in the directional difference coefficient matrix are put out,which exclude the existence of singularity.Finally,the theoretical analysis results are verified by numerical calculations.The results of this paper have strong regularity,which lay the foundation for further research on the finite point method for solving partial differential equations.  相似文献   

8.
We consider the following problem: for a collection of points in an n-dimensional space, find a linear projection mapping the points to the ground field such that different points are mapped to different values. Such projections are called normal and are useful for making algebraic varieties into normal positions. The points may be given explicitly or implicitly and the coefficients of the projection come from a subset S of the ground field. If the subset S is small, this problem may be hard. This paper deals with relatively large S, a deterministic algorithm is given when the points are given explicitly, and a lower bound for success probability is given for a probabilistic algorithm from in the literature.  相似文献   

9.
In the application of CAD/CAM. the target form of a curve, which is used for plotting or as the data supplied for CAM, is s set of points on (or near by) the curve,Using the subdivision algorithm, the procedure of curve generation from Control points→Mathematical form of the curve→Points on(or near by) the curve which is used in most systems for curve design, is simplified in this paper to Control points→Points on(or near by) the curve. We also discuss the conditions of shape preserving, polynomial reproducing, continuity as well as the convergent properties of the target curve.  相似文献   

10.
We study a problem concerning the compulsory behavior of the solutions of systems of discrete equations u(k + 1) = F(k, u(k)), k ∈ N(a) = {a, a + 1, a + 2 }, a ∈ N,N= {0, 1,... } and F : N(a) × R^n→R^n. A general principle for the existence of at least one solution with graph staying for every k ∈ N(a) in a previously prescribed domain is formulated. Such solutions are defined by means of the corresponding initial data and their existence is proved by means of retract type approach. For the development of this approach a notion of egress type points lying on the defined boundary of a given domain and with respect to the system considered is utilized. Unlike previous investigations, the boundary can contain points which are not points of egress type, too. Examples are inserted to illustrate the obtained result.  相似文献   

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

12.
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 L2 and H1 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  相似文献   

13.
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.  相似文献   

14.
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  相似文献   

15.
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.  相似文献   

16.
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.  相似文献   

17.
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.  相似文献   

18.
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.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号