共查询到20条相似文献,搜索用时 0 毫秒
1.
The inverse Cauchy problems for elliptic equations, such as the Laplace equation, the Poisson equation, the Helmholtz equation and the modified Helmholtz equation, defined in annular domains are investigated. The outer boundary of the annulus is imposed by overspecified boundary data, and we seek unknown data on the inner boundary through the numerical solution by a spring-damping regularization method and its Lie-group shooting method (LGSM). Several numerical examples are examined to show that the LGSM can overcome the ill-posed behavior of inverse Cauchy problem against the disturbance from random noise, and the computational cost is very cheap. 相似文献
2.
Chein-Shan Liu 《计算机、材料和连续体(英文)》2013,33(2):175-198
An optimal m-vector descent iterative algorithm in a Krylov subspace is developed, of which the m weighting parameters are optimized from a properly defined objective function to accelerate the convergence rate in solving an ill-posed linear problem. The optimal multi-vector iterative algorithm (OMVIA) is convergent fast and accurate, which is verified by numerical tests of several linear inverse problems, including the backward heat conduction problem, the heat source identification problem, the inverse Cauchy problem, and the external force recovery problem. Because the OMVIA has a good filtering effect, the numerical results recovered are quite smooth with small error, even under a large noise up to 10%. 相似文献
3.
自动套印控制系统的研究与设计 总被引:4,自引:3,他引:4
提出了一种凹版印刷机自动套印控制系统。该系统采用滑模变结构理论进行设计,通过永磁同步伺服电机进行套印控制。研究表明,该方法既能有效减少抖动现象,又具有较强的鲁棒性和快速性。 相似文献
4.
In this paper, the inverse Cauchy problems for elliptic equations, including the Laplace equation, the Poisson equation, and the Helmholtz equation, defined in annular domains are investigated. When the outer boundary of an annulus is imposed by overspecified boundary data, we seek unknown data in the inner boundary through a combination of the spring-damping regularization method (SDRM) and the mixed group-preserving scheme (MGPS). Several numerical examples are examined to show that the MGPS plus the SDRM can overcome the ill-posed behavior of this highly ill-conditioned inverse Cauchy problem. The presently proposed novel algorithm has good efficiency and stability against the disturbance from large random noise even up to 50%, and the computational cost of MGPS is very time saving. 相似文献
5.
The nonlinear Poisson problems in heat diffusion governed by elliptic type partial differential equations are solved by a modified globally optimal iterative algorithm (MGOIA). The MGOIA is a purely iterative method for searching the solution vector x without using the invert of the Jacobian matrix D. Moreover, we reveal the weighting parameter αc in the best descent vector w = αcE + DTE and derive the convergence rate and find a criterion of the parameter γ. When utilizing αc and γ, we can further accelerate the convergence speed several times. Several numerical experiments are carefully discussed and validated the proposed method. 相似文献
6.
M. S. Farahani 《Inverse Problems in Science & Engineering》2018,26(5):728-743
It is known that the coupled system consisting of Volterra integral equations of the first and second kind belongs to the class of moderately ill-posed problems. In the present paper, we are interested in numerical solution of Volterra integral-algebraic equations by a direct regularization method, i.e. an approach which does not make use of the adjoint operator as well as any reduction or remodelling of the original problem. A numerical algorithm based on Lavrentiev’s regularization iterated method is constructed that preserves the Volterra structure of the original problem. The convergence analysis of the proposed method is given and its validity and efficiency are also demonstrated through several numerical experiments. 相似文献
7.
8.
分析了一种基于神经网络的滑模系统,文中首先介绍了滑模控制理论,然后采用小波函数对神经网络参数进行训练,使之能对大滞后被控对象以及复杂工业过程也能进行有效控制。 相似文献
9.
S. A. Lukasiewicz M. H. Hojjati 《International journal for numerical methods in engineering》2005,63(2):231-240
This paper presents a new method for solving any combination of linear–non‐linear equations. The method is based on the separation of linear equations in terms of some selected variables from the non‐linear ones. The linear group is solved by means of any method suitable for the linear system. This operation needs no iteration. The non‐linear group, however, is solved by an iteration technique based on a new formula using the Taylor series expansion. The method has been described and demonstrated in several examples of analytical systems with very good results. The new method needs the initial approximations for non‐linear variables only. This requires far less computation than the Newton–Raphson method. The method also has a very good convergence rate. The proposed method is most beneficial for engineering systems that very often involve a large number of linear equations with limited number of non‐linear equations. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
10.
数值流形方法(NMM)中整体逼近函数是通过单位分解将局部逼近函数进行“粘结”而形成的,当将局部函数取为阶数不低于一阶的多项式时便形成了所谓的高阶流形方法。然而高阶流形方法会导致刚度矩阵亏秩,这种亏秩即使在施加完整的位移约束后仍然存在,从而会导致NMM方程组的多解,但是每个解所对应的位移是唯一的,只要能稳定地求得任何一个特解即可。该文根据刚度矩阵的性质提出了改进的LDLT算法,可快速稳定地求得一个特解。结合典型算例,与摄动解法、最小二乘法和二次规划法进行了对比分析。 相似文献
11.
摩擦接触问题的求解是将基于移动最小二乘插值的数值流形法(MLS-NMM)应用到裂纹扩展的必经之路。该文通过结合罚-线性互补方式的施加接触边界条件,并使用拉格朗日乘子法施加本质边界条件,得出一套基于MLS_NMM的摩擦接触问题的求解体系。该方法无需节点与边界重合,则可域外布点和均匀布点,来提高插值精度和降低布点难度,尤其是接触边界处。采用罚-线性互补的方式施加接触条件,使计算格式统一而简洁,利于编程实现。通过算例表明,该方法能准确地模拟接触面的张开、黏结和滑动状态,证明该方法对求解接触摩擦问题是可行的、有效的。 相似文献
12.
13.
14.
线性流形上矩阵方程AX=B的一类反问题 总被引:1,自引:0,他引:1
设SE={A∈Rn×n|||AY-Z||=min;Y,Z∈Rn×p},Ω={zΩRn|Gz=o,GΩRk×n},R≥Ωn×n={A∈Rn×n|zTaZ≥0,(?)Z∈Ω}考虑问题P:给定X,BΩRn×m,找A∈SE∩R≥Ωn×n使得AX=B。本文给出了问题P有解的充分必要条件,并在有解时,给出了通解的表示。 相似文献
15.
Zhong-Zhi Bai Lu Wang & Galina V. Muratova 《East Asian journal on applied mathematics.》2022,12(2):323-332
For solving large-scale sparse inconsistent linear systems by iteration methods, we introduce a relaxation parameter in the probability criterion of the greedyrandomized augmented Kaczmarz method, obtaining a class of relaxed greedy randomized augmented Kaczmarz methods. We prove the convergence of these methods andestimate upper bounds for their convergence rates. Theoretical analysis and numericalexperiments show that these methods can perform better than the greedy randomizedaugmented Kaczmarz method if the relaxation parameter is chosen appropriately. 相似文献
16.
本文给出了极坐标系下弹性力学平面问题的Hamilton正则方程,并提出一种求解该方程的状态空间有限元法。文中通过对Hellinger-Reissner混和变分原理的修正,导出了Hamilton正则方程及其对应能量泛函,然后采用分离变量法对其场变量进行分离变量,这样就可在θ方向采用通常的有限元插值,而沿半径r方向采用状态空间法给出解析解答,从而实现了有限元法与控论制中状态空间的结合。通过计算表明,本文方法精度高。 相似文献
17.
Zekeriya Girgin 《International journal for numerical methods in engineering》2008,75(6):722-734
Nowadays, most of the ordinary differential equations (ODEs) can be solved by modelica‐based approaches, such as Matlab/Simulink, Dymola and LabView, which use simulation technique (ST). However, these kinds of approaches restrict the users in the enforcement of conditions at any instant of the time domain. This limitation is one of the most important drawbacks of the ST. Another method of solution, differential quadrature method (DQM), leads to very accurate results using only a few grids on the domain. On the other hand, DQM is not flexible for the solution of non‐linear ODEs and it is not so easy to impose multiple conditions on the same location. For these reasons, the author aims to eliminate the mentioned disadvantages of the simulation technique (ST) and DQM using favorable characteristics of each method in the other. This work aims to show how the combining method (CM) works simply by solving some non‐linear problems and how the CM gives more accurate results compared with those of other methods. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
18.
Franco Cardin Alberto Lovison Mario Putti 《International journal for numerical methods in engineering》2007,69(9):1804-1818
In this paper we propose the numerical solution of a steady‐state reaction‐diffusion problem by means of application of a non‐local Lyapunov–Schmidt type reduction originally devised for field theory. A numerical algorithm is developed on the basis of the discretization of the differential operator by means of simple finite differences. The eigendecomposition of the resulting matrix is used to implement a discrete version of the reduction process. By the new algorithm the problem is decomposed into two coupled subproblems of different dimensions. A large subproblem is solved by means of a fixed point iteration completely controlled by the features of the original equation, and a second problem, with dimensions that can be made much smaller than the former, which inherits most of the non‐linear difficulties of the original system. The advantage of this approach is that sophisticated linearization strategies can be used to solve this small non‐linear system, at the expense of a partial eigendecomposition of the discretized linear differential operator. The proposed scheme is used for the solution of a simple non‐linear one‐dimensional problem. The applicability of the procedure is tested and experimental convergence estimates are consolidated. Numerical results are used to show the performance of the new algorithm. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
19.
A simple method for computing decentralised stabilising controllers for a class of large-scale (interconnected) linear systems
has been developed. Decentralised controls are optimal controls at subsystem level and are generated from the solution of
algebraic Riccati equations for decoupled subsystems resulting from a new aggregation-decomposition technique. The method
has been illustrated through a numerical example of a large-scale linear system consisting of three subsystems each of the
fourth order 相似文献
20.
Wen-Ting Wu 《East Asian journal on applied mathematics.》2022,12(2):435-448
To complete the convergence theory of the partially randomized extendedKaczmarz method for solving large inconsistent systems of linear equations, we give itsconvergence theorem whether the coefficient matrix is of full rank or not, tall or flat.This convergence theorem also modifies the existing upper bound for the expected solution error of the partially randomized extended Kaczmarz method when the coefficientmatrix is tall and of full column rank. Numerical experiments show that the partiallyrandomized extended Kaczmarz method is convergent when the tall or flat coefficientmatrix is rank deficient, and can also converge faster than the randomized extendedKaczmarz method. 相似文献