Related papers: Approximation of the Scattering Amplitude using No…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
Randomized linear system solvers have become popular as they have the potential to reduce floating point complexity while still achieving desirable convergence rates. One particularly promising class of methods, random sketching solvers,…
We present a novel method for approximately equilibrating a matrix $A \in {\bf R}^{m \times n}$ using only multiplication by $A$ and $A^T$. Our method is based on convex optimization and projected stochastic gradient descent, using an…
The demand for inverse design is increasing as the ability to fabricate sub-10 nm features expands the design space by orders of magnitude. Efficient inverse design benefits from differentiable models of light-structure interaction. While…
We consider the numerical approximation of the radiative transfer equation using discontinuous angular and continuous spatial approximations for the even parts of the solution. The even-parity equations are solved using a diffusion…
For the nonsymmetric saddle point problems with nonsymmetric positive definite (1,1) parts, the modified generalized shift-splitting (MGSSP) preconditioner as well as the MGSSP iteration method are derived in this paper, which generalize…
This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing…
In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the…
The objective of this paper is to investigate a new numerical method for the approximation of the self-diffusion matrix of a tagged particle process defined on a grid. While standard numerical methods make use of long-time averages of…
The anisotropic diffusion equation is imperative in understanding cosmic ray diffusion across the Galaxy, the heliosphere, and its interplay with the ambient magnetic field. This diffusion term contributes to the highly stiff nature of the…
We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \in \mathbb{R}^n$. This is equivalent to…
Computation of the trace of a matrix function plays an important role in many scientific computing applications, including applications in machine learning, computational physics (e.g., lattice quantum chromodynamics), network analysis and…
Using the boundary Yang-Baxter equations and exact results on the bulk $S$-matrices, we compute exact boundary scattering amplitudes of the supersymmetric sine-Gordon model with integrable boundary potentials.
In this master thesis, a new approximation scheme to non-relativistic potential scattering is developed and discussed. The starting points are two exact path integral representations of the T-matrix, which permit the application of the…
We apply boundary integral equations for the first time to the two-dimensional scattering of time-harmonic waves from a smooth obstacle embedded in a continuously-graded unbounded medium. In the case we solve the square of the wavenumber…
In this paper we consider symmetric, positive semidefinite (SPSD) matrix $A$ and present two algorithms for computing the $p$-Schatten norm $\|A\|_p$. The first algorithm works for any SPSD matrix $A$. The second algorithm works for…
When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same…
In this paper, we propose a new stochastic alternating direction method of multipliers (ADMM) algorithm, which incrementally approximates the full gradient in the linearized ADMM formulation. Besides having a low per-iteration complexity as…
A method of calculation of the scattering amplitude for fermions and scalar bosons with exchanging of a scalar particle in ladder approximation is suggested. The Bethe-Salpeter ladder integral equations system for the imaginary part of the…
We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of…