Zobrazeno 1 - 10
of 6 512
pro vyhledávání: '"Mathematical software"'
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
The factorization of skew-symmetric matrices is a critically understudied area of dense linear algebra (DLA), particularly in comparison to that of symmetric matrices. While some algorithms can be adapted from the symmetric case, the cost of algorith
Externí odkaz:
http://arxiv.org/abs/2411.09859
Sequential sampling models (SSMs) are a widely used framework describing decision-making as a stochastic, dynamic process of evidence accumulation. SSMs popularity across cognitive science has driven the development of various software packages that
Externí odkaz:
http://arxiv.org/abs/2411.06631
This article presents a zeroth order probabilistic global optimization algorithm -- SwiftNav -- for (not necessarily convex) functions over a compact domain. A discretization procedure is deployed on the compact domain, starting with a small step-siz
Externí odkaz:
http://arxiv.org/abs/2411.03851
Autor:
Molu, Lekan
Publikováno v:
The 63rd IEEE Conference on Decision and Control, Milan, 2024
This paper describes open-source scientific contributions in python surrounding the numerical solutions to hyperbolic Hamilton-Jacobi (HJ) partial differential equations viz., their implicit representation on co-dimension one surfaces; dynamics evolu
Externí odkaz:
http://arxiv.org/abs/2411.03501
Autor:
Musfeldt, Caleb
This thesis details a Python-based software designed to calculate the Jones polynomial, a vital mathematical tool from Knot Theory used for characterizing the topological and geometrical complexity of curves in \( \mathbb{R}^3 \), which is essential
Externí odkaz:
http://arxiv.org/abs/2410.22652
Consider a finite directed graph without cycles in which the arrows are weighted. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context of fraud
Externí odkaz:
http://arxiv.org/abs/2411.00819
We present skwdro, a Python library for training robust machine learning models. The library is based on distributionally robust optimization using optimal transport distances. For ease of use, it features both scikit-learn compatible estimators for
Externí odkaz:
http://arxiv.org/abs/2410.21231
Autor:
Paszyński, Maciej
We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications algorithm
Externí odkaz:
http://arxiv.org/abs/2410.21050
A sequential solver for differential-algebraic equations with embedded optimization criteria (DAEOs) was developed to take advantage of the theoretical work done by Deussen et al. Solvers of this type separate the optimization problem from the differ
Externí odkaz:
http://arxiv.org/abs/2410.15963