A subgradient method based dual decomposition distributed algorithm is presented. The algorithm requires the objective function to be convex. But traditional subgradient methods suffer from step curse and require that the objective function is strict convex. Different from subgradient approaches, some new ...
The `ordinary' iteration method with one single iteration vector can often yield an eigenvector and its eigenvalue in very short time. But since this cannot be guaranteed, the method cannot be recommended for general use. In order to prevent possible poor convergence, the computation is carried...
The speed and convergence of the method are compared with the existing methods in the form of three examples, and the initial values of the costates are obtained by an efficient technique in each iteration.Shirazian, MohammadIranian Journal of Numerical Analysis & Op...
However, the iterative methods get very complicated to program, and the Gaussian method is still preferred. It seems that the Nystrm method with product integration (Section 4.2) is a better numerical method. Iterative methods for singular equations are presented in Section 7.8 and those for the ...
This paper is devoted to the setting and analysis of a Petrov–Galerkin wavelet-fictitious domain numerical method for the approximation of the solution of... BACCOU,JEAN,LIANDRAT,... - 《Mathematical Models & Methods in Applied Sciences》 被引量: 17发表: 2006年 ...
Gaussian elimination and the method of conjugate... Sarkar,T.,Arvas,... - 《Antennas & Propagation IEEE Transactions on》 被引量: 223发表: 1985年 Numerical Methods for Calculating Poles of the Scattering Matrix With Applications in Grating Theory Waveguide and resonant properties of diffractive ...
The method has been implemented to algebraic equations, ordinary and partial differential equations successfully. Based on the formalism developed previously, in this work, purely numerical versions of the perturbation–iteration algorithms are proposed for the first time for first-order nonlinear ordinary...
Keywords Complex symmetric linear system PMHSS method Convergence theory Iterative methods Numerical experiment Sorry, something went wrong. Please try again and make sure cookies are enabledReferences [1] Bai Z.Z., Benzi M., Chen F. On preconditioned MHSS iteration methods for complex symmetric li...
Methods:Iteration, recovery, interfere and linely test were tried by an established way, and also compared with HK method. 方法: 用已建立的方法进行重复性试验 、 回收试验 、 干扰试验、线性范围试验, 并和HK法进行比较. 期刊摘选 A rapiditerationalgorithm adapting to ballistic missile trajectory design...
contrast spatial structurefemtosecond laser pulsefiniteヾifference schemeNeumann problem solvabilitynumerical methodoptical bistabilitydoi:10.1002/cmm4.1092Vyacheslav TrofimovMaria LoginovaVladimir EgorenkovJohn Wiley & Sons, LtdComputational and Mathematical Methods...