Inversion of a perturbed matrix
نویسنده
چکیده
An efficient formula is developed for computing the inverse of a given matrix perturbed by any diverting matrix. The matrix entries may be scattering within this diverting matrix. © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
Detection of perturbed quantization (PQ) steganography based on empirical matrix
Perturbed Quantization (PQ) steganography scheme is almost undetectable with the current steganalysis methods. We present a new steganalysis method for detection of this data hiding algorithm. We show that the PQ method distorts the dependencies of DCT coefficient values; especially changes much lower than significant bit planes. For steganalysis of PQ, we propose features extraction from the e...
متن کاملA Direct Matrix Inversion-Less Analysis for Distribution System Power Flow Considering Distributed Generation
This paper presents a new direct matrix inversion-less analysis for radial distribution systems (RDSs). The method can successfully deal with weakly meshed distribution systems. (WMDSs). Being easy to implement, direct methods (DMs) provide an excellent performance. Matrix inversion is the mean reason of divergence and low-efficiency in power flow algorithms. In this paper, the performance of t...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملSingularly Perturbed Finite Markov Chains with General Ergodic Structure
We analyse singularly perturbed Markov chains. Most previous research has been done under the assumption that the perturbed Markov chain is either ergodic or unichain. In this paper we do not impose any restrictions on the ergodic structure of the perturbed chain. The present approach is based on the inversion of analytic matrix-valued functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006