Results 21 to 30 of about 54,360 (214)
Diagonal Hessian Approximation for Limited Memory Quasi-Newton via Variational Principle
Journal of Applied Mathematics, 2013 This paper proposes some diagonal matrices that approximate the (inverse) Hessian by parts using the variational principle that is analogous to the one employed in constructing quasi-Newton updates. The way we derive our approximations is inspired by the
Siti Mahani Marjugi, Wah June Leong
doaj +1 more source
Reconstruction of sparse check matrix for LDPC at high bit error rate
Tongxin xuebao, 2021 In order to reconstruct the sparse check matrix of LDPC, a new algorithm which could directly reconstruct the LDPC was proposed.Firstly, according to the principle of the traditional reconstruction algorithm, the defects of the traditional algorithm and ...
Zhaojun WU +3 more
doaj +2 more sources
Sparse Graph Learning Under Laplacian-Related Constraints
IEEE Access, 2021 We consider the problem of learning a sparse undirected graph underlying a given set of multivariate data. We focus on graph Laplacian-related constraints on the sparse precision matrix that encodes conditional dependence between the random variables ...
Jitendra K. Tugnait
doaj +1 more source
A New Estimation Algorithm for Frequency and Amplitude in Harmonic Signal Processing
IEEE Access, 2020 Low-rank matrix recovery is a large-scale data analysis and processing technology; its related theory has been widely used in image restoration, image denoising, video background modeling, signal recovery and other fields. This paper proposes an improved
Yanbo Mai +4 more
doaj +1 more source
Bidiagonalization of (k, k + 1)-tridiagonal matrices
Special Matrices, 2019 In this paper,we present the bidiagonalization of n-by-n (k, k+1)-tridiagonal matriceswhen n < 2k. Moreover,we show that the determinant of an n-by-n (k, k+1)-tridiagonal matrix is the product of the diagonal elements and the eigenvalues of the matrix ...
Takahira S., Sogabe T., Usuda T.S.
doaj +1 more source
Consistent Block Diagonal and Exclusive Multi-view Subspace Clustering [PDF]
Jisuanji kexueSubspace clustering method provides an effective solution to the clustering problem of high-dimensional multi-view data.Focusing on the issue that the representation matrix cannot obey the block diagonal property directly by using low rank or sparse ...
WU Jie, WAN Yuan, LIU Qiujie
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
Lanczos algorithm explained in statistics
Results in Applied MathematicsThe Lanczos algorithm is a well-known three-term recurrence that can be used to generate an orthogonal basis for a Krylov subspace derived by a symmetric matrix.
Qiang Niu, Mianmian Chen, Jinheng Wu
doaj +1 more source
The impact of leukocyte‐associated RNA retention on platelet RNA‐based cancer detection
Molecular Oncology, EarlyView.Platelets carry RNA signals that may help detect cancer, but platelet samples can also retain RNA from white blood cells. We found that this retained white blood cell signal did not significantly affect machine learning cancer classification, suggesting that the cancer‐related RNA signal in platelets is largely independent of leukocyte‐associated RNA ...
Michał Sieczczyński +12 more
wiley +1 more source
IEEE Access, 2019 In this paper, in order to improve the tracking precision and convergence speed of singular systems with measurement noise in the limited interval, an iterative learning control algorithm with learning gain self-regulation is proposed under the condition
Wei Cao, Jinjie Qiao, Ming Sun
doaj +1 more source