共查询到10条相似文献,搜索用时 0 毫秒
1.
Weighted pseudoinverse matrices are expanded into matrix power series with negative exponents and arbitrary positive parameters.
Based on this expansion, iterative methods for evaluating weighted pseudoinverse matrices and weighted normal pseudosolutions
are designed and analyzed. The iterative methods for weighted normal pseudosolutions are extended to solving constrained least-squares
problems.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 32–62, January–February 2006. 相似文献
2.
Weighted pseudoinverse matrices with positive definite weights are expanded into matrix power products with negative exponents
and arbitrary positive parameters. These expansions are used to develop and analyze iterative methods for evaluating weighted
pseudoinverse matrices and weighted normal pseudosolutions and solving constrained least-squares problems.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 45–64, January–February 2007. 相似文献
3.
The paper reviews studies on the representations and expansions of weighted pseudoinverse matrices with positive definite
weights and on iterative methods and regularized problems for calculation of weighted pseudoinverse matrices and weighted
normal pseudosolutions. The use of these methods to solve constrained least-squares problems is examined.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 47–73, January–February 2008. 相似文献
4.
Three iterative processes are constructed and investigated for computing weighted pseudoinverse matrices with singular weights
and ML-weighted pseudoinverse matrices. Two of them are based on the decompositions of the weighted pseudoinverse matrix with
singular weights into matrix power series, and the third is a generalization of the Schulz method to nonsingular square matrices.
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 150–169, September–October, 1999. 相似文献
5.
The paper reviews studies on the representations and expansions of weighted pseudoinverse matrices with positive semidefinite
weights and on the construction of iterative methods and regularized problems for the calculation of weighted pseudoinverses
and weighted normal pseudosolutions based on these representations and expansions. The use of these methods to solve constrained
least squares problems is examined.
Continued from Cybernetics and Systems Analysis, 44, No. 1, 36–55 (2008).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 75–102, May–June 2008. 相似文献
6.
E. F. Galba 《Cybernetics and Systems Analysis》1998,34(2):245-253
We construct iterative processes to compute the weighted normal pseudosolution with positive definite weights (weighted least
squares solutions with weighted minimum Euclidean norm) for systems of linear algebraic equations (SLAE) with an arbitrary
rectangular real matrix. We examine two iterative processes based on the expansion of the weighted pseudoinversc matrix into
matrix power series. The iterative processes are applied to solve constrained least squares problems that arise in mathematical
programming and to findL-pseudosolutions.
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 116–124, March–April, 1998. 相似文献
7.
Limiting representations for weighted pseudoinverse matrices with positive definite weights are derived. It is shown that regularized problems can be constructed based on such limiting representations intended for evaluation of weighted pseudoinverse matrices and weighted normal pseudosolutions with positive definite weights. The results obtained, concerning regularization of problems on evaluation of weighted normal pseudosolutions, are employed for regularization of least-squares problems with constraints. 相似文献
8.
9.
Sensor position and velocity uncertainties are known to be able to degrade the source localization accuracy significantly. This paper focuses on the problem of locating multiple disjoint sources using time differences of arrival (TDOAs) and frequency differences of arrival (FDOAs) in the presence of sensor position and velocity errors. First, the explicit Cramér–Rao bound (CRB) expression for joint estimation of source and sensor positions and velocities is derived under the Gaussian noise assumption. Subsequently, we compare the localization accuracy when multiple-source positions and velocities are determined jointly and individually based on the obtained CRB results. The performance gain resulted from multiple-target cooperative positioning is also quantified using the orthogonal projection matrix. Next, the paper proposes a new estimator that formulates the localization problem as a quadratic programming with some indefinite quadratic equality constraints. Due to the non-convex nature of the optimization problem, an iterative constrained weighted least squares (ICWLS) method is developed based on matrix QR decomposition, which can be achieved through some simple and efficient numerical algorithms. The newly proposed iterative method uses a set of linear equality constraints instead of the quadratic constraints to produce a closed-form solution in each iteration. Theoretical analysis demonstrates that the proposed method, if converges, can provide the optimal solution of the formulated non-convex minimization problem. Moreover, its estimation mean-square-error (MSE) is able to reach the corresponding CRB under moderate noise level. Simulations are included to corroborate and support the theoretical development in this paper. 相似文献
10.
Ibraheem AlolyanT.E. Simos 《Computers & Mathematics with Applications》2011,62(10):3756-3774
Many simulation algorithms (chemical reaction systems, differential systems arising from the modelling of transient behaviour in the process industries etc.) contain the numerical solution of systems of differential equations. For the efficient solution of the above mentioned problems, linear multistep methods or Runge-Kutta single-step methods are used. For the simulation of chemical procedures the radial Schrödinger equation is used frequently. In the present paper we will study a class of linear multistep methods. More specifically, the purpose of this paper is to develop an efficient algorithm for the approximate solution of the radial Schrödinger equation and related problems. This algorithm belongs in the category of the multistep methods. In order to produce an efficient multistep method the phase-lag property and its derivatives are used. Hence the main result of this paper is the development of an efficient multistep method for the numerical solution of systems of ordinary differential equations with oscillating or periodical solutions. The reason of their efficiency, as the analysis proved, is that the phase-lag and its derivatives are eliminated. Another reason of the efficiency of the new obtained methods is that they have high algebraic order 相似文献