Results 281 to 290 of about 168,042 (312)
Some of the next articles are maybe not open access.
On Rank and Kernel of ℤ4-Linear Codes
2008A code ${\cal C}$ is a quaternary linear code if ${\cal C}$ is asubgroup of Z. In this paper, the rank and dimension of the kernelfor Z4-linear codes, which are the corresponding binarycodes of quaternary linear codes, are studied. The possible valuesof these two parameters for Z4-linear codes, givinglower and upper bounds, are established.
Cristina Fernández-Córdoba +2 more
openaire +1 more source
Build to order linear algebra kernels
2008 IEEE International Symposium on Parallel and Distributed Processing, 2008The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex task that reduces the productivity of computational scientists. Software libraries such as the Basic Linear Algebra Subprograms (BLAS) ameliorate this problem by providing a ...
Jeremy G. Siek +2 more
openaire +1 more source
Acta Universitatis Nicolai Copernici, Ekonomia, 2012 The aim of this paper is to presents the results of simulation studies of size and power of the kernel linearity test, which belongs to a class of nonparametric tests. Simulation survey was carried out for linear and nonlinear models estimated by Ordinary Least Squares Method and Maximum Likelihood Method.
openaire
On Identification of Memory Kernels in Linear Viscoelasticity
Mathematische Nachrichten, 1993AbstractThe inverse problem of identification of the memory kernel in the linear constitutive stress‐strain‐relation of Boltzmann type is reduced to an optimal control problem for an initial‐boundary‐value problem of the related wave equation for the displacement.For the control problem the existence of an optimal control is proved, where both ...
openaire +2 more sources
Computation of the kernel of linear fractional representations
Proceedings of 2003 IEEE Conference on Control Applications, 2003. CCA 2003., 2004This paper presents several algorithms for computing the kernel of a linear fractional representation (LFR). This problem is shown to be multi-criteria because, in addition to numerical stability, the complexity of the kernel (/spl Delta/-block size) and its well-posedness radius must also be optimized.
openaire +1 more source
Kernels for Linear Transformations
Journal of the London Mathematical Society, 1969openaire +1 more source
Linear discriminant analysis with generalized kernel constraint for robust image classification
Pattern Recognition, 2023Shuyi Li, Hengmin Zhang, Ruijun Ma
exaly
A stable and efficient technique for linear boundary value problems by applying kernel functions
Applied Numerical Mathematics, 2022Xiuying Li, H L Wang, Boying Wu
exaly