Zobrazeno 1 - 10
of 122
pro vyhledávání: '"65y04"'
Autor:
Hunhold, Laslo
Recent evaluations have highlighted the tapered posit number format as a promising alternative to the uniform precision IEEE 754 floating-point numbers, which suffer from various deficiencies. Although the posit encoding scheme offers superior coding
Externí odkaz:
http://arxiv.org/abs/2404.18603
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:
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:
Aksoy, Sinan G., Bennink, Ryan, Chen, Yuzhou, Frías, José, Gel, Yulia R., Kay, Bill, Naumann, Uwe, Marrero, Carlos Ortiz, Petyuk, Anthony V., Roy, Sandip, Segovia-Dominguez, Ignacio, Veldt, Nate, Young, Stephen J.
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut alg
Externí odkaz:
http://arxiv.org/abs/2303.11464
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
Autor:
Borges, Carlos F.
The reciprocal square root is an important computation for which many sophisticated algorithms exist (see for example \cite{Moroz,863046,863031} and the references therein). A common theme is the use of Newton's method to refine the estimates. In thi
Externí odkaz:
http://arxiv.org/abs/2112.14321
Autor:
Jongeneel, Wouter
Zeroth-order optimization methods are developed to overcome the practical hurdle of having knowledge of explicit derivatives. Instead, these schemes work with merely access to noisy functions evaluations. One of the predominant approaches is to mimic
Externí odkaz:
http://arxiv.org/abs/2112.07488
Autor:
Ghosh, Kaushik, Mukhopadhyay, Mayukh
Publikováno v:
Five Shades of Emerging Business Cases, Eliva Press, Moldova, EU, Chapter 6, pp. 91-110, 2021, ISBN 9781636483955
The current discourse delves into the effectiveness of h-index as an author level metric. It further reviews and explains the algorithmic complexity of calculating h-index through algebraic method. To conduct the algebraic analysis propositional alge
Externí odkaz:
http://arxiv.org/abs/2109.15123
Autor:
Sharipov, Ruslan
Hadamard's maximal determinant problem consists in finding the maximal value of the determinant of a square $n\times n$ matrix whose entries are plus or minus ones. This is a difficult mathematical problem which is not yet solved. In the present pape
Externí odkaz:
http://arxiv.org/abs/2104.01749
Most zeroth-order optimization algorithms mimic a first-order algorithm but replace the gradient of the objective function with some gradient estimator that can be computed from a small number of function evaluations. This estimator is constructed ra
Externí odkaz:
http://arxiv.org/abs/2103.05478