Related papers: Approximation of the Scattering Amplitude using No…
We address the scattering problem in two-dimensional integrable models, focusing on the sine-Gordon theory. We use the S-matrix bootstrap approach based on analytical properties of the S-matrix to compute scattering amplitudes of the…
We investigate the scattering of light by a nonlinear, anisotropic slab under conical incidence and arbitrary polarization, within the framework of Maxwell's equations, where the nonlinearities are described by nonlinear susceptibility…
In this paper, we propose iterative inner/outer approximations based on a recent notion of block factor-width-two matrices for solving semidefinite programs (SDPs). Our inner/outer approximating algorithms generate a sequence of upper/lower…
Over the fast few years, the numerical success of the generalized alternating direction method of multipliers (GADMM) proposed by Eckstein \& Bertsekas [Math. Prog., 1992] has inspired intensive attention in analyzing its theoretical…
In this paper, a fully aggregation-based algebraic multigrid strategy is developed for nonlinear contact problems of saddle point type using a mortar finite element approach. While the idea of extending multigrid methods to saddle point…
In this paper, we propose and analyze an inexact version of the symmetric proximal alternating direction method of multipliers (ADMM) for solving linearly constrained optimization problems. Basically, the method allows its first subproblem…
An asymptotic analytical approach is proposed for bosonic probability amplitudes in unitary linear networks, such as the optical multiport devices for photons. The asymptotic approach applies for large number of bosons $N\gg M$ in the…
In this paper we present a new highly efficient calculation method for the far field amplitude pattern that arises from scattering problems governed by the d-dimensional Helmholtz equation and, by extension, Schr\"odinger's equation. The…
We introduce a numerical method that enables efficient modelling of light scattering by large, disordered ensembles of non-spherical particles incorporated in stratified media, including when the particles are in close vicinity to each…
We present experimental and theoretical results on a method that applies a numerical solver iteratively to solve several non-negative quadratic programming problems in geometric optimization. The method gains efficiency by exploiting the…
One of the main challenges in obtaining predictions for collider experiments from perturbative quantum field theory, is the direct evaluation of the Feynman integrals it gives rise to. In this chapter, we review an alternative bootstrap…
A version of the projection method for solving the scattering problem for acoustic and electromagnetic waves is proposed and shown to be more efficient numerically than the earlier ones because the corresponding matrix is not…
We introduce a numerical solver for the steady-state Boltzmann equation based on the symmetric Gauss-Seidel (SGS) method. To solve the nonlinear system on each grid cell derived from the SGS method, a fixed-point iteration preconditioned…
The main goal of this paper is to generalize Jacobi and Gauss-Seidel methods for solving non-square linear system. Towards this goal, we present iterative procedures to obtain an approximate solution for non-square linear system. We derive…
In this paper, an efficient iterative method is proposed for solving multiple scattering problem in locally inhomogeneous media. The key idea is to enclose the inhomogeneity of the media by well separated artificial boundaries and then…
This paper is concerned with the low-rank approximation for large-scale nonsymmetric matrices. Inspired by the classical Nystrom method, which is a popular method to find the low-rank approximation for symmetric positive semidefinite…
We present a perturbative technique for modeling the scattering of light by a nonlinear material. This approach eliminates the need for an iterative algorithm to solve the fully coupled nonlinear problem. We demonstrate its effectiveness in…
In this paper, we extend the inexact Uzawa algorithm in [Q. Hu, J. Zou, SIAM J. Matrix Anal., 23(2001), pp. 317-338] to the nonsymmetric generalized saddle point problem. The techniques used here are similar to those in [Bramble \emph{et…
In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global…
We consider saddle point problems which objective functions are the average of $n$ strongly convex-concave individual components. Recently, researchers exploit variance reduction methods to solve such problems and achieve linear-convergence…