A fast algorithm for group square-root Lasso based group-sparse regression

2021 ◽  
pp. 108142
Author(s):  
Chunlei Zhao ◽  
Xingpeng Mao ◽  
Minqiu Chen ◽  
Changjun Yu
Author(s):  
Chunxiong Zheng ◽  
Xiang Ma

Abstract This paper is concerned with a fast finite element method for the three-dimensional Poisson equation in infinite domains. Both the exterior problem and the strip-tail problem are considered. Exact Dirichlet-to-Neumann (DtN)-type artificial boundary conditions (ABCs) are derived to reduce the original infinite-domain problems to suitable truncated-domain problems. Based on the best relative Chebyshev approximation for the square-root function, a fast algorithm is developed to approximate exact ABCs. One remarkable advantage is that one need not compute the full eigensystem associated with the surface Laplacian operator on artificial boundaries. In addition, compared with the modal expansion method and the method based on Pad$\acute{\textrm{e}}$ approximation for the square-root function, the computational cost of the DtN mapping is further reduced. An error analysis is performed and numerical examples are presented to demonstrate the efficiency of the proposed method.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
F. Soleymani ◽  
M. Sharifi ◽  
S. Shateyi ◽  
F. Khaksar Haghani

Using the relation between a principal matrix square root and its inverse with the geometric mean, we present a fast algorithm for computing the geometric mean of two Hermitian positive definite matrices. The algorithm is stable and possesses a high convergence order. Some experiments are included to support the proposed computational algorithm.


2010 ◽  
Author(s):  
Deng Ding ◽  
Chon Ip Chao ◽  
Jane W. Z. Lu ◽  
Andrew Y. T. Leung ◽  
Vai Pan Iu ◽  
...  
Keyword(s):  

2019 ◽  
Author(s):  
Ranmji Venkataramanan ◽  
Sekhar Tatikonda ◽  
Andrew Barron
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document