scholarly journals More on the Wilson $W_{tk}(v)$ Matrices

10.37236/3873 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
M.H. Ahmadi ◽  
N. Akhlaghinia ◽  
G.B. Khosrovshahi ◽  
Ch. Maysoori

For integers $0\leq t\leq k\leq v-t$, let $X$ be a $v$-set, and let $W_{tk}(v)$ be a ${v \choose t}\times{v \choose k}$ inclusion matrix where rows and columns are indexed by $t$-subsets and $k$-subsets of $X$, respectively, and for row $T$ and column $K$, $W_{tk}(v)(T,K)=1$ if $T\subseteq K$ and zero otherwise. Since $W_{tk}(v)$ is a full rank matrix, by reordering the columns of $W_{tk}(v)$ we can write $W_{tk}(v) = (S|N)$, where $N$ denotes a set of independent columns of $W_{tk}(v)$. In this paper, first by classifying $t$-subsets and $k$-subsets, we present a new decomposition of $W_{tk}(v)$. Then by employing this decomposition, the Leibniz Triangle, and a known right inverse of $W_{tk}(v)$, we  construct  the inverse of $N$ and consequently special basis for the null space (known as the standard basis) of $W_{tk}(v)$. 

2019 ◽  
Vol 50 (2) ◽  
pp. 1993-2005 ◽  
Author(s):  
Xuanjiao Lv ◽  
Lin Xiao ◽  
Zhiguo Tan ◽  
Zhi Yang ◽  
Junying Yuan

2012 ◽  
Vol 433-440 ◽  
pp. 2680-2686
Author(s):  
Yu Teng ◽  
Yu Zhi Huang ◽  
Zhi Rong Chen

In this paper, robust output regulation problems of singular linear systems are studied. Under appropriate assumptions, it is given that the solvability of robust output regulation problems equals to a specifically row full rank matrix. Moreover, the methods for constructing the feedback regulator are discussed.


2019 ◽  
Vol 141 (7) ◽  
Author(s):  
Daniel Correia ◽  
Daniel N. Wilke

The construction of surrogate models, such as radial basis function (RBF) and Kriging-based surrogates, requires an invertible (square and full rank matrix) or pseudoinvertible (overdetermined) linear system to be solved. This study demonstrates that the method used to solve this linear system may result in up to five orders of magnitude difference in the accuracy of the constructed surrogate model using exactly the same information. Hence, this paper makes the canonic and important point toward reproducible science: the details of solving the linear system when constructing a surrogate model must be communicated. This point is clearly illustrated on a single function, namely the Styblinski–Tang test function by constructing over 200 RBF surrogate models from 128 Latin Hypercubed sampled points. The linear system in the construction of each surrogate model was solved using LU, QR, Cholesky, Singular-Value Decomposition, and the Moore–Penrose pseudoinverse. As we show, the decomposition method influences the utility of the surrogate model, which depends on the application, i.e., whether an accurate approximation of a surrogate is required or whether the ability to optimize the surrogate and capture the optimal design is pertinent. Evidently the selection of the optimal hyperparameters based on the cross validation error also significantly impacts the utility of the constructed surrogate. For our problem, it turns out that selecting the hyperparameters at the lowest cross validation error favors function approximation but adversely affects the ability to optimize the surrogate model. This is demonstrated by optimizing each constructed surrogate model from 16 fixed initial starting points and recording the optimal designs. For our problem, selecting the optimal hyperparameter that coincides with the lowest monotonically decreasing function value significantly improves the ability to optimize the surrogate for most solution strategies.


2016 ◽  
Vol 5 (4) ◽  
pp. 405-441 ◽  
Author(s):  
Maryia Kabanava ◽  
Richard Kueng ◽  
Holger Rauhut ◽  
Ulrich Terstiege

2018 ◽  
Author(s):  
Qingyun Zhang ◽  
Yongsheng Li ◽  
Jingfa Zhang ◽  
Yi Luo

Abstract. The Qinghai-Tibet Railway is located on the Qinghai-Tibet Plateau and is the highest altitude railway in the world. With the influence of human activities and geological disasters, it is necessary to monitor ground deformation along the Qinghai-Tibet Railway. In this paper, Advanced Synthetic Aperture Radar (ASAR) (T405 and T133) and TerraSAR-X data were used to monitor the Lhasa-Nagqu section of the Qinghai-Tibet Railway from 2003 to 2012. The data period covers the time before and after the railway was open (total of ten years). This study used a new analysis method (the Full Rank Matrix (FRAM) Small Baseline Subset InSAR (SBAS) time-series analysis) to analyze the Qinghai-Tibet Railway. Before the opening of the railway (from 2003 to 2005), the Lhasa-Nagqu road surface deformation was not obvious; in 2007, the railway was completed and opened to traffic, and the settlement of the railway in the district of Damxung was obvious (20 mm/yr). After the opening of the railway (from 2008 to 2010), the Damxung area had a significant subsidence area, and the north section of the railway was relatively stable. By analyzing the distribution of geological hazards in the Damxung area, the distribution of the subsidence area was found to coincide with that of the geological hazards, indicating that the occurrence of subsidence in the Damxung area was related to the influence of surrounding geological hazards and faults. Overall, the peripheral surface of the Qinghai-Tibet Railway is relatively stable but still needs to be verified with real-time monitoring to ensure that the safety of the railway is maintained.


Author(s):  
HONG LI ◽  
NA CHEN ◽  
LUOQING LI

This paper considers the problem of recovering a low-rank matrix from a small number of measurements consisting of linear combinations of the matrix entries. We extend the elastic-net regularization in compressive sensing to a more general setting, the matrix recovery setting, and consider the elastic-net regularization scheme for matrix recovery. To investigate on the statistical properties of this scheme and in particular on its convergence properties, we set up a suitable mathematic framework. We characterize some properties of the estimator and construct a natural iterative procedure to compute it. The convergence analysis shows that the sequence of iterates converges, which then underlies successful applications of the matrix elastic-net regularization algorithm. In addition, the error bounds of the proposed algorithm for low-rank matrix and even for full-rank matrix are presented in this paper.


2014 ◽  
Vol 568-570 ◽  
pp. 168-171 ◽  
Author(s):  
Yong Sun ◽  
Jun Wei Zhao

The least square algorithms were widely used in the estimation of localizing and tracing situation in military fields. In this paper, we proposed a method of using a full rank matrix instead of using singular value decomposition to solving the non-full rank matrix. Therefore the improving least square (ILS) algorithm was emerged at this situation. The simulation results show that the proposed tracing algorithm exhibits higher accuracy compared with the least square algorithm. This new method can take full application of the measured information to improved the tracing accuracy in the whole controlled area.


Sign in / Sign up

Export Citation Format

Share Document