نتایج جستجو برای: cholesky decomposition

تعداد نتایج: 99175  

2007
Elizaveta Levina Adam Rothman J. ZHU

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the bandwidth adaptively for each row of the Cholesky factor, using a novel penalty we call nested Lasso. This structure has more flexibility than regular banding, ...

Journal: :IEEE Trans. Communications 2003
Andre Tkacenko P. P. Vaidyanathan

We present a new low-complexity method for the design of channel shortening equalizers for discrete multitone modulation systems using the eigenfilter approach. In contrast to other such methods which require a Cholesky decomposition for each delay parameter value used, ours requires only one such decomposition. Simulation results show that our method performs nearly optimally in terms of obser...

Journal: :Monthly Notices of the Royal Astronomical Society 2018

Journal: :Numerical Linear Algebra with Applications 1995

Journal: :Environmetrics 2022

We propose an approximation to the forward filter backward sampler (FFBS) algorithm for large-scale spatio-temporal smoothing. FFBS is commonly used in Bayesian statistics when working with linear Gaussian state-space models, but it requires inverting covariance matrices which have size of latent state vector. The computational burden associated this operation effectively prohibits its applicat...

Journal: :Appl. Math. Lett. 2007
Michele Benzi Nader Razouk

We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently described by T.-Y. Tam in [Computing Iwasawa decomposition of a symplectic matrix by Cholesky factorization, Appl. Math. Lett. (in press) doi:10.1016/j.aml.2006.03.001]. c © 2006 Elsevier Ltd. All rights reserved.

Journal: :Multiscale Modeling & Simulation 2017
Thomas Y. Hou Qin Li Pengchuan Zhang

Suppose that A ∈ RN×N is symmetric positive semidefinite with rank K ≤ N . Our goal is to decompose A into K rank-one matrices ∑K k=1 gkg T k where the modes {gk} K k=1 are required to be as sparse as possible. In contrast to eigen decomposition, these sparse modes are not required to be orthogonal. Such a problem arises in random field parametrization where A is the covariance function and is ...

2016
Ben Jann

The counterfactual decomposition technique popularized by Blinder (1973, Journal of Human Resources, 436–455) and Oaxaca (1973, International Economic Review, 693–709) is widely used to study mean outcome differences between groups. For example, the technique is often used to analyze wage gaps by sex or race. This article summarizes the technique and addresses several complications, such as the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید