Zobrazeno 1 - 10
of 934
pro vyhledávání: '"G.1.3"'
The evolution of floating-point computation has been shaped by algorithmic advancements, architectural innovations, and the increasing computational demands of modern technologies, such as artificial intelligence (AI) and high-performance computing (
Externí odkaz:
http://arxiv.org/abs/2411.12090
Owing to the diverse scales and varying distributions of sparse matrices arising from practical problems, a multitude of choices are present in the design and implementation of sparse matrix-vector multiplication (SpMV). Researchers have proposed man
Externí odkaz:
http://arxiv.org/abs/2411.10143
Iterative solvers are frequently used in scientific applications and engineering computations. However, the memory-bound Sparse Matrix-Vector (SpMV) kernel computation hinders the efficiency of iterative algorithms. As modern hardware increasingly su
Externí odkaz:
http://arxiv.org/abs/2411.04686
Autor:
Veneva, Milena
This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algori
Externí odkaz:
http://arxiv.org/abs/2411.11889
Autor:
Meerbergen, Karl, Wang, Zhijun
The numerical solution of singular generalized eigenvalue problems is still challenging. In Hochstenbach, Mehl, and Plestenjak, Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation, SIMAX 2019, a rank-completing perturba
Externí odkaz:
http://arxiv.org/abs/2411.02895
We study algorithms for approximating the spectral density of a symmetric matrix $A$ that is accessed through matrix-vector product queries. By combining a previously studied Chebyshev polynomial moment matching method with a deflation step that appr
Externí odkaz:
http://arxiv.org/abs/2410.21690
All rings are commutative, and all modules are unital. The purpose of this paper is to investigate the characterizations of weakly pseudo primary 2-absorbing sub-module in terms of some types of modules. We provide characterizations for the class of
Externí odkaz:
http://arxiv.org/abs/2410.20264
Autor:
Müller, Eike Hermann
The incompressible Euler equations are an important model system in computational fluid dynamics. Fast high-order methods for the solution of this time-dependent system of partial differential equations are of particular interest: due to their expone
Externí odkaz:
http://arxiv.org/abs/2410.09790
We propose new algorithms to efficiently average a collection of points on a Grassmannian manifold in both the centralized and decentralized settings. Grassmannian points are used ubiquitously in machine learning, computer vision, and signal processi
Externí odkaz:
http://arxiv.org/abs/2410.08956
Autor:
Keegan, Katherine, Newman, Elizabeth
Tensor decompositions have become essential tools for feature extraction and compression of multiway data. Recent advances in tensor operators have enabled desirable properties of standard matrix algebra to be retained for multilinear factorizations.
Externí odkaz:
http://arxiv.org/abs/2409.19402