Results 1 to 10 of about 54,257 (145)
Missing value imputation in a data matrix using the regularised singular value decomposition
MethodsX, 2023 Some statistical analysis techniques may require complete data matrices, but a frequent problem in the construction of databases is the incomplete collection of information for different reasons. One option to tackle the problem is to estimate and impute
Sergio Arciniegas-Alarcón +3 more
doaj +1 more source
Hybrid Precoding for Massive mmWave MIMO Systems
IEEE Access, 2019 Due to high costs and power consumptions, fully digital baseband precoding schemes are usually prohibitive in millimeter-wave massive MIMO systems. Therefore, hybrid precoding strategies become promising solutions.
Xianru Liu +6 more
doaj +1 more source
Fast and accurate con-eigenvalue algorithm for optimal rational approximations [PDF]
, 2012 The need to compute small con-eigenvalues and the associated con-eigenvectors of positive-definite Cauchy matrices naturally arises when constructing rational approximations with a (near) optimally small $L^{\infty}$ error. Specifically, given a rational
Beylkin, G., Haut, T. S.
core +1 more source
Eigenvectors of random matrices: A survey [PDF]
, 2016 Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.Comment ...
O'Rourke, Sean, Vu, Van, Wang, Ke
core +3 more sources
On non-normality and classification of amplification mechanisms in stability and resolvent analysis [PDF]
, 2017 We seek to quantify non-normality of the most amplified resolvent modes and predict their features based on the characteristics of the base or mean velocity profile.
Dawson, Scott T. M. +3 more
core +3 more sources
An efficient Fredholm method for calculation of highly excited states of billiards [PDF]
, 2007 A numerically efficient Fredholm formulation of the billiard problem is presented. The standard solution in the framework of the boundary integral method in terms of a search for roots of a secular determinant is reviewed first.
Abramovitz M +21 more
core +2 more sources
Fast Algorithms for the computation of Fourier Extensions of arbitrary length [PDF]
, 2015 Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$ with $T>1$, a
Daan Huybrechs +3 more
core +3 more sources
Products, coproducts and singular value decomposition
, 2004 Products and coproducts may be recognized as morphisms in a monoidal tensor category of vector spaces. To gain invariant data of these morphisms, we can use singular value decomposition which attaches singular values, ie generalized eigenvalues, to these
B. Fauser +13 more
core +2 more sources
Perturbative method for generalized spectral decompositions [PDF]
, 2000 Imposing analytic properties to states and observables we construct a perturbative method to obtain a generalized biorthogonal system of eigenvalues and eigenvectors for quantum unstable systems.
Betan, Rodolfo M. Id +2 more
core +1 more source
IEEE AccessIt is necessary to identify the parameters for an equivalent circuit model of Li-ion batteries and understand their degradation conditions in electric vehicles and consumer electronic devices.
Takeshi Inoue, Daiki Komatsu
doaj +1 more source