• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1131-1141
• /
• 2010

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Some numerical experiments are given to show the efficiency of the preconditioner.

• 로봇학회논문지
• /
• 제11권2호
• /
• pp.92-99
• /
• 2016

An electro-hydraulic actuator (EHA) is widely used in industrial motion systems and the increasing bandwidth of EHA position control is important issue. The model-inverse feedforward controller is known to extend the bandwidth of system. When the system has non-minimum phase (NMP) zeros, direct model inversion makes system unstable. To overcome this problem, an approximate model-inverse method is used. A representative approximate model inversion method is zero phase error tracking control (ZPETC). However, if zeros locate right half plane of z-plane, the approximate inverse model amplifies the high-frequency response. In this paper, to solve the problem of ZPETC, an adaptive model-inverse control is proposed. The adaptive algorithm updates feedforward term in real-time. The effectiveness of the proposed adaptive model-inverse position control strategy is verified by comparison with typical proportional-integral (PI) control and feedforward control by experiments. As a result, the proposed adaptive controller extends the bandwidth of EHA position control.

• 제어로봇시스템학회논문지
• /
• 제7권12호
• /
• pp.993-1000
• /
• 2001

Configuration-dependent nonlinear coefficient matrices in the dynamic equation of robot manipulator impose computa- tional burden in real-time implementation of tracking control based on the inverse dynamics controller. However, parallel manipulators such as Stewart platform have relatively small workspace compared to serial manipulators. Based on the characteristics of small motion range. nonlinear coefficient matrices can be approxiamted to constant ones. The modeling errors caused by such approximation are compensated for by H-infinity controller that treats the modeling errors disturbance. The proposed inverse dynamics controller with approximate dynamics combined with H-infinity control shows good tracking performance even for fast tracking control in which computation of full inverse dynamics is not easy to implement.

• 대한수학회논문집
• /
• 제28권2호
• /
• pp.407-418
• /
• 2013

This paper studies a computational iterative method to find accurate approximations for the inverse of real or complex matrices. The analysis of convergence reveals that the method reaches seventh-order convergence. Numerical results including the comparison with different existing methods in the literature will also be considered to manifest its superiority in different types of problems.

• Journal of the Korean Data and Information Science Society
• /
• 제25권4호
• /
• pp.903-914
• /
• 2014

The inverse Weibull distribution has been proposed as a model in the analysis of life testing data. Also, inverse Weibull distribution has been recently derived as a suitable model to describe degradation phenomena of mechanical components such as the dynamic components (pistons, crankshaft, etc.) of diesel engines. In this paper, we derive the approximate maximum likelihood estimators of the scale parameter and the shape parameter in the inverse Weibull distribution under multiply type-II censoring. We also develop four modified empirical distribution function (EDF) type tests for the inverse Weibull or extreme value distribution based on multiply type-II censored samples. We also propose modified normalized sample Lorenz curve plot and new test statistic.

• 한국항공운항학회지
• /
• 제16권2호
• /
• pp.21-27
• /
• 2008

An inverse method is introduced to construct the problem for the error analysis of the numerical solution of initial value problem. These problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The process leading to the exact solution makes use of an initially available approximate numerical solution. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. Using this special case exact solution, it is possible to investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution.

• International Journal of Reliability and Applications
• /
• 제8권1호
• /
• pp.1-16
• /
• 2007

In this paper, we derive exact explicit expressions for the triple and quadruple moments of the lower record values from inverse the Weibull (IW) distribution. Next, we present and calculate the coefficients of the best linear unbiased estimates of the location and scale parameters of IW distribution (BLUEs) for different choices of the shape parameter and records size. We then use the higher order moments and the calculated BLUEs to compute the mean, variance, and the coefficients of skewness and kurtosis of certain linear functions of lower record values. By using the coefficients of the skewness and kurtosis, we develop approximate confidence intervals for the location and scale parameters of the IW distribution using Edgeworth approximate values and then compare them with the corresponding intervals constructed through Monte Carlo simulations. Finally, we apply the findings of the paper to some simulated data.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.687-696
• /
• 2010

In this paper, an algorithm for computing the sparse approximate inverse factor of matrix $A^{T}\;A$, where A is an $m\;{\times}\;n$ matrix with $m\;{\geq}\;n$ and rank(A) = n, is proposed. The computation of the inverse factor are done without computing the matrix $A^{T}\;A$. The computed sparse approximate inverse factor is applied as a preconditioner for solving normal equations in conjunction with the CGNR algorithm. Some numerical experiments on test matrices are presented to show the efficiency of the method. A comparison with some available methods is also included.

• International Journal of Aeronautical and Space Sciences
• /
• 제3권2호
• /
• pp.46-58
• /
• 2002

An inverse method is introduced to construct benchmark problems for the numerical solution of initial value problems. Benchmark problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The solution is constructed such that it lies near a given approximate numerical solution, and therefore the special case solution can be generated in a versatile and physically meaningful fashion and can serve as a benchmark problem to validate approximate solution methods. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. A multi-variable orthogonal function expansion method and computer symbol manipulation are successfully used for this process. Using this special case exact solution, it is possible to directly investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given code and a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution. Illustrative examples show the utility of this method not only for the ordinary differential equations (ODEs) but for the partial differential equations (PDEs).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권12호
• /
• pp.4567-4583
• /
• 2021

This study proposes an analytical approximation algorithm based on extreme value theory (EVT) for the inverse of the power of the incomplete Gamma function. First, the Gumbel function is used to approximate the power of the incomplete Gamma function, and the corresponding inverse problem is transformed into the inversion of an exponential function. Then, using the tail equivalence theorem, the normalized coefficient of the general Weibull distribution function is employed to replace the normalized coefficient of the random variable following a Gamma distribution, and the approximate closed form solution is obtained. The effects of equation parameters on the algorithm performance are evaluated through simulation analysis under various conditions, and the performance of this algorithm is compared to those of the Newton iterative algorithm and other existing approximate analytical algorithms. The proposed algorithm exhibits good approximation performance under appropriate parameter settings. Finally, the performance of this method is evaluated by calculating the thresholds of space-time block coding and space-frequency block coding pattern recognition in multiple-input and multiple-output orthogonal frequency division multiplexing. The analytical approximation method can be applied to other related situations involving the maximum statistics of independent and identically distributed random variables following Gamma distributions.