Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Rozložník Miroslav"'
In this paper we give the detailed error analysis of two algorithms $W_1$ and $W_2$ for computing the symplectic factorization of a symmetric positive definite and symplectic matrix $A \in \mathbb R^{2n \times 2n}$ in the form $A=LL^T$, where $L \in
Externí odkaz:
http://arxiv.org/abs/2310.07662
Block Gram-Schmidt algorithms serve as essential kernels in many scientific computing applications, but for many commonly used variants, a rigorous treatment of their stability properties remains open. This work provides a comprehensive categorizatio
Externí odkaz:
http://arxiv.org/abs/2010.12058
In this paper we analyze the nearly optimal block diagonal scalings of the rows of one factor and the columns of the other factor in the triangular form of the SR decomposition. The result is a block generalization of the result of the van der Sluis
Externí odkaz:
http://arxiv.org/abs/2004.03288
Publikováno v:
In Linear Algebra and Its Applications 1 April 2022 638:150-195
Autor:
Morikuni, Keiichi, Rozložník, Miroslav
Publikováno v:
SIAM Journal on Matrix Analysis and Applications, Volume 39, Number 2, pp. 1033-1048, June 5, 2018
In this contribution, we study the numerical behavior of the Generalized Minimal Residual (GMRES) method for solving singular linear systems. It is known that GMRES determines a least squares solution without breakdown if the coefficient matrix is ra
Externí odkaz:
http://arxiv.org/abs/1705.03153
The convergence and numerical analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy, which is termed Self Projected Matching Pursuit, is presented. This approach renders an iterative way of solving the least squar
Externí odkaz:
http://arxiv.org/abs/1609.00053