相关论文: Elementary Matrix Decomposition and The Computatio…

Electronic structure methods that exploit nonorthogonal Slater determinants face the challenge of efficiently computing nonorthogonal matrix elements. In a recent publication, H. G. A. Burton, J. Chem. Phys. 154, 144109 (2021), I introduced…

This survey provides a practical and algorithmic perspective on Drinfeld modules over $\mathbb F_q[T]$. Starting with the construction of the Carlitz module, we present Drinfeld modules in any rank and some of their arithmetic properties.…

In this article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface…

We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns, e.g. grades to which an image is red, a…

We provably compute the full set of rational points on 1403 Picard curves defined over $\mathbb{Q}$ with Jacobians of Mordell-Weil rank $1$ using the Chabauty-Coleman method. To carry out this computation, we extend Magma code of…

In 1954, Alston S. Householder published \textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower…

Let $E / \mathbb{Q}$ and $A / \mathbb{Q}$ be elliptic curves. We can construct modular points derived from $A$ via the modular parametrisation of $E$. With certain assumptions we can show that these points are of infinite order and are not…

We describe a method for doing computations with Orlov's equivalence between the bounded derived category of certain hypersurfaces and the stable category of graded matrix factorisations of the polynomials describing these hypersurfaces. In…

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

Non-Hermitian topological phases can produce some remarkable properties, compared with their Hermitian counterpart, such as the breakdown of conventional bulk-boundary correspondence and the non-Hermitian topological edge mode. Here, we…

We describe an algorithm to compute the local component at p of the Coleman-Gross p-adic height pairing on divisors on hyperelliptic curves. As the height pairing is given in terms of a Coleman integral, we also provide new techniques to…

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

We develop a decomposition method based on the augmented Lagrangian framework to solve a broad family of semidefinite programming problems, possibly with nonlinear objective functions, nonsmooth regularization, and general linear…

We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…

Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an…

The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an…

A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this…

The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is…

We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…

Coleman integrals is a major tool in the explicit arithmetic of algebraic varieties, notably in the study of rational points on curves. One of the inputs to compute Coleman integrals is the availability of an affine model. We develop a…