Results 161 to 170 of about 1,179,942 (315)
Row‐Aware Randomized SVD With Applications
ABSTRACT The randomized singular value decomposition proposed in [28] has certainly become one of the most well‐established randomization‐based algorithms in numerical linear algebra. The key ingredient of the entire procedure is the computation of a subspace which is close to the column space of the target matrix A∈ℝm×n$$ \mathbf{A}\in {\mathbb{R}}^{m\
Davide Palitta, Sascha Portaro
wiley +1 more source
Efficient Implementation of Low Complexity High Throughput QR Decomposition for MIMO Systems
MIMO techniques have been widely adopted to increase the data transmission rate or to improve the quality of services(QoS) in recent wireless communication system. thus MIMO signal processing plays an important role and attracts much attentions in system
Behera, Sarat Kumar
core
Gram Decay and Intrinsic Dimensions of Krylov Subspaces
ABSTRACT Krylov subspace methods solve large sparse linear systems Ax=b$$ Ax=b $$ by building a sequence of polynomial approximations to A−1b$$ {A}^{-1}b $$ from successive matrix‐vector products. In finite precision, the number of numerically independent directions that can be extracted from this sequence is bounded by the intrinsic information ...
Stephen J. Thomas
wiley +1 more source
On the QR Decomposition of H-Matrices
The hierarchical (H-) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear algebra like matrix-matrix and matrix-vector products, matrix inversion and LU decomposition can be implemented efficiently using the H-matrix format ...
Benner, Peter, Mach, Thomas
openaire +1 more source
Toward an Efficient Shifted Cholesky QR for Applications in Model Order Reduction Using pyMOR
ABSTRACT Many model order reduction (MOR) methods rely on the computation of an orthonormal basis of a subspace onto which the large full order model is projected. Numerically, this entails the orthogonalization of a set of vectors. The nature of the MOR process imposes several requirements for the orthogonalization process.
Maximilian Bindhak +2 more
wiley +1 more source
Improving S-Curve Bias Through Joint Compensation of HPA and Filter Distortions. [PDF]
Chen L, Yang Y, Xiong T, Chen L, Liu Y.
europepmc +1 more source
Toward a Mixed‐Precision ADI Method for Lyapunov Equations
ABSTRACT We apply mixed‐precision to the low‐rank Lyapunov ADI (LR‐ADI) by performing certain aspects of the algorithm in a lower working precision. Namely, we accumulate the overall solution, solve the linear systems comprising the ADI iteration, and store the inner low‐rank factors of the residuals in various combinations of IEEE 754 single and ...
Jonas Schulze, Jens Saak
wiley +1 more source
GAPIT version 4: integration of GWAS into genomic prediction. [PDF]
Wang J, Zhang Z.
europepmc +1 more source
ABSTRACT Does autonomy support retain its motivational benefits when digital distraction pervades the classroom? Drawing on self‐determination theory and cognitive‐resource perspectives, we proposed the Cognitive Availability Hypothesis: when attentional resources are depleted by smartphone presence, task choice cannot fulfill its motivational ...
Haiyan Xu, Bei Zhang, Wei Wei
wiley +1 more source
Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCA. [PDF]
Kang J, Stephens M.
europepmc +1 more source

