Related papers: Fast sixth-order algorithm based on the generalize…
The Feynman-Kac equation governs the distribution of the statistical observable -- functional, having wide applications in almost all disciplines. After overcoming challenges from the time-space coupled nonlocal operator and the possible…
We propose a new fast algorithm for solving one of the standard formulations of frame-based image deconvolution: an unconstrained optimization problem, involving an $\ell_2$ data-fidelity term and a non-smooth regularizer. Our approach is…
Wavelet based algorithms in numerical analysis are similar to other transform methods in that vectors and operators are expanded into a basis and the computations take place in this new system of coordinates. However, due to the recursive…
An important topic of interest in imaging is the construction of protocols that are not diffraction limited. This can be achieved in a variety of ways, including classical superresolution techniques or quantum entanglement-based protocols.…
We present a new adaptive method for electronic structure calculations based on novel fast algorithms for reduction of multivariate mixtures. In our calculations, spatial orbitals are maintained as Gaussian mixtures whose terms are selected…
An accelerated class of adaptive scheme of iterative thresholding algorithms is studied analytically and empirically. They are based on the feedback mechanism of the null space tuning techniques (NST+HT+FB). The main contribution of this…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
A generalized Hubbard-Stratonovitch transformation relating an integral over random unitary N times N matrices to an integral over Efetov's unitary sigma model manifold, is introduced. This transformation adapts the supersymmetry method to…
A single-step high-order implicit time integration scheme for the solution of transient and wave propagation problems is presented. It is constructed from the Pad\'e expansions of the matrix exponential solution of a system of first-order…
Robust stability problem of integral delay systems with uncertain kernel matrix functions is addressed in this paper. On the basis of characteristic equation and the argument principle, an algorithm is generated which is shown to outperform…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
We describe a suite of fast algorithms for evaluating Jacobi polynomials, applying the corresponding discrete Sturm-Liouville eigentransforms and calculating Gauss-Jacobi quadrature rules. Our approach is based on the well-known fact that…
Interior Point Methods are widely used to solve Linear Programming problems. In this work, we present two primal affine scaling algorithms to achieve faster convergence in solving Linear Programming problems. In the first algorithm, we…
Schemes with the second-order approximation in time are considered for numerical solving the Cauchy problem for an evolutionary equation of first order with a self-adjoint operator. The implicit two-level scheme based on the Pad\'{e}…
A new exponentially convergent algorithm is proposed for an abstract the first order differential equation with unbounded operator coefficient possessing a variable domain. The algorithm is based on a generalization of the Duhamel integral…
The usefulness of Gabor frames depends on the easy computability of a suitable dual window. This question is addressed under several aspects: several versions of Schulz's iterative algorithm for the approximation of the canonical dual…
Generalized Chebyshev acceleration is a semi-iterative technique applicable to a basic iterative method only when the eigenvalues of the iteration matrix satisfy a highly restrictive inclusion condition. In this work, we relax this…
Learning based 6D object pose estimation methods rely on computing large intermediate pose representations and/or iteratively refining an initial estimation with a slow render-compare pipeline. This paper introduces a novel method we call…
A class of fast greedy block Kaczmarz methods combined with general greedy strategy and average technique are proposed for solving large consistent linear systems. Theoretical analysis of the convergence of the proposed method is given in…
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast…