Related papers: On Numerical Algorithms for the Solution of a Belt…
An effective algorithm is presented for solving the Beltrami equation fzbar = mu fz in a planar disk. The algorithm involves no evaluation of singular integrals. The strategy, working in concentric rings, is to construct a piecewise linear…
An effective algorithm is presented for solving the Beltrami equation df/dz = mu (df/dzbar) in a planar disk. The disk is triangulated in a simple way and f is approximated by piecewise linear mappings; the images of the vertices of the…
In this paper we propose an algorithm for the numerical solution of arbitrary differential equations of fractional order. The algorithm is obtained by using the following decomposition of the differential equation into a system of…
In this paper, we discuss numerical methods for solving large-scale continuous-time algebraic Riccati equations. These methods have been the focus of intensive research in recent years, and significant progress has been made in both the…
New results regarding the Sobolev regularity of the principal solution of the linear Beltrami equation $\bar{\partial} f = \mu \partial f + \nu \overline{\partial f}$ for discontinuous Beltrami coefficients $\mu$ and $\nu$ are obtained,…
Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series,…
We consider numerical approximations of spectral fractional Laplace-Beltrami problems on closed surfaces. The proposed numerical algorithms rely on their Balakrishnan integral representation and consist of a sinc quadrature coupled with…
We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers.…
A robust, fast and accurate method for solving the Colebrook-like equations is presented. The algorithm is efficient for the whole range of parameters involved in the Colebrook equation. The computations are not more demanding than…
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related…
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software…
The treatment of both aleatory and epistemic uncertainty by recent methods often requires an high computational effort. In this abstract, we propose a numerical sampling method allowing to lighten the computational burden of treating the…
We establish a series of criteria on the existence of regular solutions for the Dirichlet problem to general degenerate Beltrami equations ${\bar{\partial}}f = \mu {\partial f}+\nu {\bar{\partial f}}$ in arbitrary Jordan domains in $\C$.
We estimate the Hoelder exponent $\alpha$ of solutions to the Beltrami equation $\dbar f=\mu\de f$, where the Beltrami coefficient satisfies $\|\mu\|_\infty<1$. Our estimate improves the classical estimate $\alpha\ge\|K_\mu\|^{-1}$, where…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
We settle the problem of the uniqueness of normalized homeomorphic solutions to nonlinear Beltrami equations $\bar\partial f(z)=H(z, \partial f(z))$. It turns out that the uniqueness holds under definite and explicit bounds on the…
Solving the floating-point equation $x \otimes y = z$, where $x$, $y$ and $z$ belong to floating-point intervals, is a common task in automated reasoning for which no efficient algorithm is known in general. We show that it can be solved by…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
This article describes methods for the deterministic simulation of the collisional Boltzmann equation. It presumes that the transport and collision parts of the equation are to be simulated separately in the time domain. Time stepping…