Zobrazeno 1 - 10
of 129
pro vyhledávání: '"Holtz, Olga"'
Autor:
Holtz, Olga
Publikováno v:
Notices Amer. Math. Soc. 71 (2024), no. 6, 725-731
This short note for non-experts means to demystify the tasks of evaluating the Riemann Zeta Function at non-positive integers and at even natural numbers, both initially performed by Leonhard Euler. Treading in the footsteps of G. H. Hardy and others
Externí odkaz:
http://arxiv.org/abs/2308.11637
Publikováno v:
PASC '22: Proceedings of the Platform for Advanced Scientific Computing Conference June 2022 Article No. 1 Pages 1-10
Convolutional neural networks (CNNs) are important in a wide variety of machine learning tasks and applications, so optimizing their performance is essential. Moving words of data between levels of a memory hierarchy or between processors on a networ
Externí odkaz:
http://arxiv.org/abs/2204.08279
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity needs to be small. Many sub-cubic algorithms have large leading coefficien
Externí odkaz:
http://arxiv.org/abs/2008.03759
Publikováno v:
Comput. Methods Funct. Theory 16 (2016), no.3, 395 - 431
Given a polynomial \[ f(x)=a_0x^n+a_1x^{n-1}+\cdots +a_n \] with positive coefficients $a_k$, and a positive integer $M\leq n$, we define a(n infinite) generalized Hurwitz matrix $H_M(f):=(a_{Mj-i})_{i,j}$. We prove that the polynomial $f(z)$ does no
Externí odkaz:
http://arxiv.org/abs/1506.07379
Autor:
Holtz, Olga
Publikováno v:
Notices of the American Mathematical Society; Jun/Jul2024, Vol. 71 Issue 6, p725-731, 7p
Autor:
Holtz, Olga Vladimirovna.
Thesis (Ph. D.)--University of Wisconsin--Madison, 2000.
eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 41-44).
eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 41-44).
Externí odkaz:
http://catalog.hathitrust.org/api/volumes/oclc/49217684.html
Publikováno v:
Design and Analysis of Algorithms Volume 7659, 2012, pp 13-36
Graph expansion analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous methods, such as geometric embedding, are not applicable. This has recently been demonstrated for Strassen's and Strassen-like fast
Externí odkaz:
http://arxiv.org/abs/1209.2184
Publikováno v:
Linear Algebra Appl. 438 (2013), no. 5, 2574-2590
We examine when a matrix whose elements are differentiable functions in one variable commutes with its derivative. This problem was discussed in a letter from Issai Schur to Helmut Wielandt written in 1934, which we found in Wielandt's Nachlass. We p
Externí odkaz:
http://arxiv.org/abs/1207.1258
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only recently b
Externí odkaz:
http://arxiv.org/abs/1202.3177
Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on Strassen's fast matrix multiplication and minimizes communication. The a
Externí odkaz:
http://arxiv.org/abs/1202.3173