Related papers: Numerical Solution of the Beltrami Equation
We propose a method to simultaneously compute scalar basis functions with an associated functional map for a given pair of triangle meshes. Unlike previous techniques that put emphasis on smoothness with respect to the Laplace--Beltrami…
Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open…
This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
The embeddability problem is a very old and hard problem in discrete holomorphic iteration which deals with determining general conditions on a given univalent self-map $\varphi$ of the unit disc $\mathbb D$ in order to be contained in a…
In this contribution we present a new computational method for coupled bulk-surface problems on time-dependent domains. The method is based on a space-time formulation using discontinuous piecewise linear elements in time and continuous…
The application of the approximation-operational approach to solving linear differential equations of fractional order with variable coefficients is considered. It is shown that the method can also be applied to solving differential…
The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a modified Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e. the equations within the system are…
This paper develops and analyzes an efficient numerical method for solving elliptic partial differential equations, where the diffusion coefficients are random perturbations of deterministic diffusion coefficients. The method is based upon…
In this paper, a new rigorous numerical method to compute fundamental matrix solutions of non-autonomous linear differential equations with periodic coefficients is introduced. Decomposing the fundamental matrix solutions $\Phi(t)$ by their…
Analytical approach to SLAM problem was introduced in the recent years. In our work we investigate the method numerically with the motivation of using the algorithm in a real hardware experiments. We perform a robustness test of the…
This paper uses the HCT finite element method and mesh adaptation technology to solve the nonlinear plate bending problem and conducts error analysis on the iterative method, including a priori and a posteriori error estimates. Our…
The Numerical Assembly Technique is extended to investigate arbitrary planar frame structures with the focus on the computation of natural frequencies. This allows us to obtain highly accurate results without resorting to spatial…
With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM) mimics a second order Crank-Nicolson scheme for certain types of balance laws (Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to…
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…
This paper presents an efficient spectral method for solving the fractional Fredholm integro-differential equations. The non-smoothness of the solutions to such problems leads to the performance of spectral methods based on the classical…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…