Related papers: Linear algebra algorithms for divisors on an algeb…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
We study the geometry of flag manifolds under different embeddings into a product of Grassmannians. We show that differential geometric objects and operations -- tangent vector, metric, normal vector, exponential map, geodesic, parallel…
We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…
This work presents a novel matrix-based method for constructing an approximation Hessian using only function evaluations. The method requires less computational power than interpolation-based methods and is easy to implement in matrix-based…
A certain representation for the Heisenberg algebra in finite-difference operators is established. The Lie-algebraic procedure of discretization of differential equations with isospectral property is proposed. Using $sl_2$-algebra based…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…
We establish a Lefschetz hyperplane theorem for the Berkovich analytifications of Jacobians of curves over an algebraically closed non-Archimedean field. Let $J$ be the Jacobian of a curve $X$, and let $W_d \subset J$ be the locus of…
A distributed algorithm is described for solving a linear algebraic equation of the form $Ax=b$ assuming the equation has at least one solution. The equation is simultaneously solved by $m$ agents assuming each agent knows only a subset of…
As quantum hardware rapidly advances toward the early fault-tolerant era, a key challenge is to develop quantum algorithms that are not only theoretically sound but also hardware-friendly on near-term devices. In this work, we propose a…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
In this paper we analyze the computational costs of various operations and algorithms in algebraic number fields using exact arithmetic. Let $K$ be an algebraic number field. In the first half of the paper, we calculate the running time and…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
This paper presents a detailed discussion of the ``Newton's method'' algorithm for finding apparent horizons in 3+1 numerical relativity. We describe a method for computing the Jacobian matrix of the finite differenced $H(h)$ function by…
In this paper we propose a direct and explicit realization of addition of divisors by means of an iterative reduction algorithm. Each iteration of the algorithm is the reduction of a degree $g+1$ divisor to a divisor of degree~$g$. Such an…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the…
For the case of algebraic curves - compact Riemann surfaces - it is shown that de Rham cohomology group $H^{1}_{\mathrm{dR}}(X,\mathbb{C})$ of a genus $g$ Riemann surface $X$ has a natural structure of a symplectic vector space. Every…