Zobrazeno 1 - 10
of 367
pro vyhledávání: '"CARSON, ERIN"'
Autor:
Carson, Erin, Daužickaitė, Ieva
Various approaches to iterative refinement (IR) for least-squares problems have been proposed in the literature and it may not be clear which approach is suitable for a given problem. We consider three approaches to IR for least-squares problems when
Externí odkaz:
http://arxiv.org/abs/2405.18363
Block classical Gram-Schmidt (BCGS) is commonly used for orthogonalizing a set of vectors $X$ in distributed computing environments due to its favorable communication properties relative to other orthogonalization approaches, such as modified Gram-Sc
Externí odkaz:
http://arxiv.org/abs/2405.01298
Autor:
Carson, Erin, Oktay, Eda
With the recent emergence of mixed precision hardware, there has been a renewed interest in its use for solving numerical linear algebra problems fast and accurately. The solution of least squares (LS) problems $\min_x\|b-Ax\|_2$, where $A \in \mathb
Externí odkaz:
http://arxiv.org/abs/2401.03755
Autor:
Khan, Noaman, Carson, Erin
Hardware trends have motivated the development of mixed precision algo-rithms in numerical linear algebra, which aim to decrease runtime while maintaining acceptable accuracy. One recent development is the development of an adaptive precision sparse
Externí odkaz:
http://arxiv.org/abs/2307.03914
The multigrid V-cycle method is a popular method for solving systems of linear equations. It computes an approximate solution by using smoothing on fine levels and solving a system of linear equations on the coarsest level. Solving on the coarsest le
Externí odkaz:
http://arxiv.org/abs/2306.06182
Autor:
Oktay, Eda, Carson, Erin
With the recent emergence of mixed precision hardware, there has been a renewed interest in its use for solving numerical linear algebra problems fast and accurately. The solution of total least squares problems, i.e., solving $\min_{E,r} \| [E, r]\|
Externí odkaz:
http://arxiv.org/abs/2305.19028
Autor:
Carson, Erin, Daužickaitė, Ieva
We consider the split-preconditioned FGMRES method in a mixed precision framework, in which four potentially different precisions can be used for computations with the coefficient matrix, application of the left preconditioner, application of the rig
Externí odkaz:
http://arxiv.org/abs/2303.11901
When the CG method for solving linear algebraic systems was formulated about 70 years ago by Lanczos, Hestenes, and Stiefel, it was considered an iterative process possessing a mathematical finite termination property. CG was placed into a rich mathe
Externí odkaz:
http://arxiv.org/abs/2211.00953
Autor:
Oktay, Eda, Carson, Erin
Using lower precision in algorithms can be beneficial in terms of reducing both computation and communication costs. Motivated by this, we aim to further the state-of-the-art in developing and analyzing mixed precision variants of iterative methods.
Externí odkaz:
http://arxiv.org/abs/2210.08839