相关论文: Universal algorithms for generalized discrete matr…
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized…
We present a novel approach for the numerical solution of problems of diffraction by open arcs in two dimensional space. Our methodology relies on composition of {\em weighted versions} of the classical integral operators associated with…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
Splitting methods have emerged as powerful tools to address complex problems by decomposing them into smaller solvable components. In this work, we develop a general approach to forward-backward splitting methods for solving monotone…
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from…
A well known numerical task is the inversion of large symmetric tridiagonal Toeplitz matrices, i.e., matrices whose entries equal $a$ on the diagonal and $b$ on the extra diagonals ($a, b\in \mathbb R$). The inverses of such matrices are…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
We propose a variational splitting technique for the generalized-$\alpha$ method to solve hyperbolic partial differential equations. We use tensor-product meshes to develop the splitting method, which has a computational cost that grows…
We prove that Toeplitz operators are norm dense in the Toeplitz algebra $\mathfrak{T}(L^\infty)$ over the weighted Bergman space $\mathcal{A}^2_\nu(\Omega)$ of a bounded symmetric domain $\Omega\subset\mathbb{C}^n$. Our methods use…
Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
Despite the number of relevant considerations in the literature, the algebra of generalized symmetries of the Burgers equation has not been exhaustively described. We fill this gap, presenting a basis of this algebra in an explicit form and…
We review a method providing explicit formulas for the Jack polynomials. Our method is based on the relation of the Jack polynomials to the eigenfunctions of a well-known exactly solvable quantum many-body system of Calogero-Sutherland…
It is often easier to study pseudo-Riemannian manifolds by presenting them as surfaces in some ambient space. We propose an algorithm for construction of explicit isometric embeddings of pseudo-Riemannian manifolds with symmetries into an…
The generalized weak Galerkin (gWG) finite element method is proposed and analyzed for the biharmonic equation. A new generalized discrete weak second order partial derivative is introduced in the gWG scheme to allow arbitrary combinations…
This paper is about GMRES algorithms for the solution of nonsingular linear systems. We first consider basic algorithms and study their convergence. We then focus on acceleration strategies and parallel algorithms that are useful for…
We present an algorithm for determining the minimal order differential equations associated to a given Feynman integral in dimensional or analytic regularisation. The algorithm is an extension of the Griffiths-Dwork pole reduction adapted…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…