Results 21 to 30 of about 2,984,671 (302)
The Limiting Spectra of Girko’s Block-Matrix [PDF]
10 ...
openaire +2 more sources
Practical method to solve large least squares problems using Cholesky decomposition
In Geomatics, the method of least squares is commonly used to solve the systems of observation equations for a given number of unknowns. This method is basically implemented in case of having number observations larger than the number of unknowns ...
Ghadi Younis
doaj +1 more source
Aiming at addressing the problem of high computational cost of the traditional Kalman filter in SINS/GPS, a practical optimization algorithm with offline-derivation and parallel processing methods based on the numerical characteristics of the system is ...
Shaoxing Hu +3 more
doaj +1 more source
The polar decomposition of block companion matrices [PDF]
Let L(λ) = Inλm + Am−1λm−1 + …+A1λ + A0 be an n × n monic matrix polynomial, and let CL be the corresponding block companion matrix. In this note, we extend a known result on scalar polynomials to obtain a formula for the polar decomposition of CL when ...
Psarrakos, P +3 more
core +1 more source
Deep Subspace Clustering with Block Diagonal Constraint
The deep subspace clustering method, which adopts deep neural networks to learn a representation matrix for subspace clustering, has shown good performance.
Jing Liu, Yanfeng Sun, Yongli Hu
doaj +1 more source
Lossy Compression using Adaptive Polynomial Image Encoding
In this paper, an efficient lossy compression approach using adaptive-block polynomial curve-fitting encoding is proposed. The main idea of polynomial curve fitting is to reduce the number of data elements in an image block to a few coefficients.
OTHMAN, S. +3 more
doaj +1 more source
The influence of acrylate triblock copolymer embedded in matrix on composite structures’ responses to low-velocity impacts [PDF]
In passive safety structures the use of composite materials has increased significantly recently due to their low specific mass and high energy absorption capacities.
Frédéric Leonardi +7 more
core +1 more source
A preconditioned fast collocation method for a linear bond-based peridynamic model
We develop a fast collocation method for a static bond-based peridynamic model. Based on the analysis of the structure of the stiffness matrix, a fast matrix-vector multiplication technique was found, which can be used in the Krylov subspace iteration ...
Xuhao Zhang +3 more
doaj +1 more source
Walsh–Hadamard Kernel Feature-Based Image Compression Using DCT with Bi-Level Quantization
To meet the high bit rate requirements in many multimedia applications, a lossy image compression algorithm based on Walsh–Hadamard kernel-based feature extraction, discrete cosine transform (DCT), and bi-level quantization is proposed in this paper. The
Dibyalekha Nayak +3 more
doaj +1 more source
The selection of optimal designs for generalized linear mixed models is complicated by the fact that the Fisher information matrix, on which most optimality criteria depend, is computationally expensive to evaluate.
Waite, Timothy W +3 more
core +1 more source

