Keywords: Additive/multiplicative splitting iteration method Singular linear systems Hermitian matrix Semiconvergence a b s t r a c t In this paper, we investigate the additive, multiplicative and general splitting iteration methods for solving singular linear systems. When the coefficient matrix is Hermitian, the semiconvergence conditions are proposed, which generalize some results of Bai [Z....

bootstrapping the dea is one of the current methods of measuring robust efficiency by constructing a confidence interval and measuring the noise (bias) in production. in this study, two estimators: the conventional data envelopment analysis (dea) and bootstrap simulation with 2,000 bootstrap iterations were applied on a cross sectional data of 296 broiler farms in peninsular malaysia. the objec...

cerebellar model articulation controller neural network is a computational model of cerebellum which acts as a lookup table. the advantages of cmac are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. in the training phase, the disadvantage of some cmac models is unstable phenomenon...

High-performance scalar processors are characterized by multiple pipelined functional units that can be initiated simultaneously to exploit instruction level parallelism. For scientific codes, the performance of these processors depends heavily on memory bandwidth. To achieve peak processor rate, data must be supplied to the arithmetic units at the peak aggregate rate of consumption. Access ord...

This paper presents a comparison between variational iteration method (VIM) and modfied variational iteration method (MVIM) for approximate solution a system of Volterra integral equation of the first kind. We convert a system of Volterra integral equations to a system of Volterra integro-di®erential equations that use VIM and MVIM to approximate solution of this system and hence obtain an appr...

In this paper, the Kadomtsev-Petviashvili equation is solved by using the Adomian’s decomposition method , modified Adomian’s decomposition method , variational iteration method , modified variational iteration method, homotopy perturbation method, modified homotopy perturbation method and homotopy analysis method. The existence and uniqueness of the solution and convergence of the proposed...

Markov decision processes (MDPs) are used to model stochastic systems in many applications, but computing good policies becomes hard when the effective horizon become very large. In “A First-Order Approach Accelerated Value Iteration,” Goyal and Grand-Clément present a connection between value iteration (VI) algorithms gradient descent methods from convex optimization use acceleration momentum ...

Electron mobility in GaN and InN are calculated, by solving Boltzmann equation using iteration model, as a function of temperature for carrier concentrations of 10 16 , 10 17 , and 10 18 cm -3 . Both GaN and InN have maximum mobility between 100 and 200 K, depending on the electron density. The theoretical maximum mobility in GaN and InN at 300 K are about 1000 and 4400 cm 2 V -1 s 1. We compar...

We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, complemented by step-size optimization at each iteration. The advantages of the new algorithm over existing non-unitary AJD algorithms are in the ability to accommodate non-positive-definite matrices (compared to Pham’s algorit...