Related papers: A faster, high precision algorithm for calculating…
This paper develops a new class of algorithms for general linear systems and eigenvalue problems. These algorithms apply fast randomized sketching to accelerate subspace projection methods, such as GMRES and Rayleigh--Ritz. This approach…
We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…
The inverse Langevin function is a fundamental part of the statistical chain models used to describe the behavior of polymeric-like materials, appearing also in other fields such as magnetism, molecular dynamics and even biomechanics. In…
Two popular and often applied methods to obtain two-dimensional point sets with the optimal order of $L_p$ discrepancy are digit scrambling and symmetrization. In this paper we combine these two techniques and symmetrize $b$-adic Hammersley…
Transport phenomena-describing the movement of particles, energy, or other physical quantities-are fundamental in various scientific disciplines, including nuclear physics, plasma physics, astrophysics, engineering, and the natural…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few…
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…
Many man-made objects are characterised by a shape that is symmetric along one or more planar directions. Estimating the location and orientation of such symmetry planes can aid many tasks such as estimating the overall orientation of an…
In recent years, attention has been focused on the relationship between black-box optimiza- tion problem and reinforcement learning problem. In this research, we propose the Mirror Descent Search (MDS) algorithm which is applicable both for…
Computation of the large sparse matrix exponential has been an important topic in many fields, such as network and finite-element analysis. The existing scaling and squaring algorithm (SSA) is not suitable for the computation of the large…
A new anisotropic mesh adaptation strategy for finite element solution of elliptic differential equations is presented. It generates anisotropic adaptive meshes as quasi-uniform ones in some metric space, with the metric tensor being…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
In this note we introduce the M$S_n$ estimator (for Multivariate $S_n$) a new robust estimator of multivariate ranking. Like MVE and MCD it searches for an $h$-subset which minimizes a criterion. The difference is that the new criterion…
We study the problem of scheduling $n$ independent moldable tasks on $m$ processors that arises in large-scale parallel computations. When tasks are monotonic, the best known result is a $(\frac{3}{2}+\epsilon)$-approximation algorithm for…
We develop a very simple compensated scheme for computing very accurate Givens rotations. The approach is significantly more straightforward than the one in \cite{borges2021fast}, and the derivation leads to a very satisfying algorithm…
TMAC is a toolbox written in C++11 that implements algorithms based on a set of modern methods for large-scale optimization. It covers a variety of optimization problems, which can be both smooth and nonsmooth, convex and nonconvex, as well…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
This work presents a fast and non-convex algorithm for robust subspace recovery. The data sets considered include inliers drawn around a low-dimensional subspace of a higher dimensional ambient space, and a possibly large portion of…