To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively...To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. Algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.展开更多
Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for mat...Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for matrix inversion. A global register file （RF） is used to connect al the clusters. Two nearby clusters share a local register file. The instruction sets are also designed for the VLIW processor. Experimental results show that the proposed VLIW architecture takes only 45 latency to invert a 4 × 4 matrix when running at 150 MHz. The proposed design is roughly five times faster than the DSP solution in processing speed.展开更多
The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covarian...The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.展开更多
Estimating the spatial distribution of coseismic slip is an ill-posed inverse problem, and solutions may be extremely oscillatory due to measurement errors without any constraints on the coseismic slip distribution. I...Estimating the spatial distribution of coseismic slip is an ill-posed inverse problem, and solutions may be extremely oscillatory due to measurement errors without any constraints on the coseismic slip distribution. In order to obtain stable solution for coseismic slip inversion, regularization method with smoothness-constrained was imposed. Trade-off parameter in regularized inversion, which balances the minimization of the data misfit and model roughness, should be a critical procedure to achieve both resolution and stability. Then, the active constraint balancing approach is adopted, in which the trade-off parameter is regarded as a spatial variable at each model parameter and automatically determined via the model resolution matrix and the spread function. Numerical experiments for a synthetical model indicate that regularized inversion using active constraint balancing approach can provides stable inversion results and have low sensitivity to the knowledge of the exact character of the Gaussian noise. Regularized inversion combined with active constraint balancing approach is conducted on the 2005 Nias earthquake. The released moment based on the estimated coseismic slip distribution is 9.91×1021 N·m, which is equivalent to a moment magnitude of 8.6 and almost identical to the value determined by USGS. The inversion results for synthetic coseismic uniform-slip model and the 2005 earthquake show that smoothness-constrained regularized inversion method combined with active constraint balancing approach is effective, and can be reasonable to reconstruct coseismic slip distribution on fault.展开更多
Geological structures often exhibit smooth characteristics away from sharp discontinuities. One aim of geophysical inversion is to recover information about the smooth structures as well as about the sharp discontinui...Geological structures often exhibit smooth characteristics away from sharp discontinuities. One aim of geophysical inversion is to recover information about the smooth structures as well as about the sharp discontinuities. Because no specific operator can provide a perfect sparse representation of complicated geological models, hyper-parameter regularization inversion based on the iterative split Bregman method was used to recover the features of both smooth and sharp geological structures. A novel preconditioned matrix was proposed, which counteracted the natural decay of the sensitivity matrix and its inverse matrix was calculated easily. Application of the algorithm to synthetic data produces density models that are good representations of the designed models. The results show that the algorithm proposed is feasible and effective.展开更多
Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research exten...Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research extends existing work in the literature.展开更多
By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-H...By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.展开更多
文摘To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. Algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.
基金supported by the National Natural Science Foundation of China(6110015561227004+4 种基金613720716137213161201289)the Fundamental Research Funds of the Central Universities of China(K5051302096JB140207)
文摘Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for matrix inversion. A global register file （RF） is used to connect al the clusters. Two nearby clusters share a local register file. The instruction sets are also designed for the VLIW processor. Experimental results show that the proposed VLIW architecture takes only 45 latency to invert a 4 × 4 matrix when running at 150 MHz. The proposed design is roughly five times faster than the DSP solution in processing speed.
文摘The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.
基金Projects(41604111,41541036) supported by the National Natural Science Foundation of China
文摘Estimating the spatial distribution of coseismic slip is an ill-posed inverse problem, and solutions may be extremely oscillatory due to measurement errors without any constraints on the coseismic slip distribution. In order to obtain stable solution for coseismic slip inversion, regularization method with smoothness-constrained was imposed. Trade-off parameter in regularized inversion, which balances the minimization of the data misfit and model roughness, should be a critical procedure to achieve both resolution and stability. Then, the active constraint balancing approach is adopted, in which the trade-off parameter is regarded as a spatial variable at each model parameter and automatically determined via the model resolution matrix and the spread function. Numerical experiments for a synthetical model indicate that regularized inversion using active constraint balancing approach can provides stable inversion results and have low sensitivity to the knowledge of the exact character of the Gaussian noise. Regularized inversion combined with active constraint balancing approach is conducted on the 2005 Nias earthquake. The released moment based on the estimated coseismic slip distribution is 9.91×1021 N·m, which is equivalent to a moment magnitude of 8.6 and almost identical to the value determined by USGS. The inversion results for synthetic coseismic uniform-slip model and the 2005 earthquake show that smoothness-constrained regularized inversion method combined with active constraint balancing approach is effective, and can be reasonable to reconstruct coseismic slip distribution on fault.
基金Projects(41174061,41374120)supported by the National Natural Science Foundation of China
文摘Geological structures often exhibit smooth characteristics away from sharp discontinuities. One aim of geophysical inversion is to recover information about the smooth structures as well as about the sharp discontinuities. Because no specific operator can provide a perfect sparse representation of complicated geological models, hyper-parameter regularization inversion based on the iterative split Bregman method was used to recover the features of both smooth and sharp geological structures. A novel preconditioned matrix was proposed, which counteracted the natural decay of the sensitivity matrix and its inverse matrix was calculated easily. Application of the algorithm to synthetic data produces density models that are good representations of the designed models. The results show that the algorithm proposed is feasible and effective.
文摘Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research extends existing work in the literature.
基金Project(10171031) supported by the National Natural Science Foundation of China
文摘By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.
