Related papers: When Lanczos Iterations Generate Symmetric Quadrat…
We establish a version of the Landen's transformation for Weierstrass functions and invariants that is applicable to general lattices in complex plane. Using it we present an effective method for computing Weierstrass functions, their…
The Nystr\"om method is a popular choice for finding a low-rank approximation to a symmetric positive semi-definite matrix. The method can fail when applied to symmetric indefinite matrices, for which the error can be unboundedly large. In…
We examine data-processing of Markov chains through the lens of information geometry. We first establish a theory of congruent Markov morphisms within the framework of stochastic matrices. Specifically, we introduce and justify the concept…
We obtain an expression for the error in the approximation of $f(A) \boldsymbol{b}$ and $\boldsymbol{b}^T f(A) \boldsymbol{b}$ with rational Krylov methods, where $A$ is a symmetric matrix, $\boldsymbol{b}$ is a vector and the function $f$…
Dense particulate flow simulations using integral equation methods demand accurate evaluation of Stokes layer potentials on arbitrarily close interfaces. In this paper, we generalize techniques for close evaluation of Laplace double-layer…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
Many of the input-parameter-to-output-quantity-of-interest maps that arise in computational science admit a surprising low-dimensional structure, where the outputs vary primarily along a handful of directions in the high-dimensional input…
Although using non-Gaussian distributions in economic models has become increasingly popular, currently there is no systematic way for calibrating a discrete distribution from the data without imposing parametric assumptions. This paper…
In this paper we propose the design of an iterative observer using space as a time-like variable and prove its convergence. The iterative observer algorithm solves boundary estimation problem for a steady-state elliptic equation system…
Quadrature rules using higher order digital nets and sequences are known to exploit the smoothness of a function for numerical integration and to achieve an improved rate of convergence as compared to classical digital nets and sequences…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…
We study the numerical solution of forward and inverse acoustic scattering problems by randomly shaped obstacles in three-dimensional space using a fast isogeometric boundary element method. Within the isogeometric framework, realizations…
Layer potentials represent solutions to partial differential equations in an integral equation formulation. When numerically evaluating layer potentials at evaluation points close to the domain boundary, specialized quadrature techniques…
To find the least squares solution of a very large and inconsistent system of equations, one can employ the extended Kaczmarz algorithm. This method simultaneously removes the error term, such that a consistent system is asymptotically…
In this paper we study convergence estimates for a multigrid algorithm with smoothers of successive subspace correction (SSC) type, applied to symmetric elliptic PDEs. First, we revisit a general convergence analysis on a class of multigrid…
While conformal transformations of the plane preserve Laplace's equation, Lorentz-conformal mappings preserve the wave equation. We discover how simple geometric objects, such as quadrilaterals and pairs of crossing curves, are transformed…
Quadratic surfaces gain more and more attention among the Geometric Algebra community and some frameworks were proposed in order to represent, transform, and intersect these quadratic surfaces. As far as the authors know, none of these…
The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The computation of the entries of Jacobi operators associated with orthogonal polynomials has important applications in numerical analysis. From truncating the operator to form a Jacobi matrix, one can apply the Golub--Welsh algorithm to…