Related papers: T-matrix calculation via discrete-dipole approxima…
An extended version of the R-matrix methodology is presented for calculation of radiative parameters for improved plasma opacities. Contrast and comparisons with existing methods primarily relying on the Distorted Wave (DW) approximation…
Suitable discretizations through tensor product formulas of popular multidimensional operators (diffusion or diffusion--advection, for instance) lead to matrices with $d$-dimensional Kronecker sum structure. For evolutionary Partial…
A novel hybrid method based on Mie theory and the Discrete Dipole Approximation (DDA) was developed to study the microscopic parameters governing the optical response of tunable photonic crystals (PC). The method is based on a two-step…
Topological Data Analysis (TDA) provides a pipeline to extract quantitative topological descriptors from structured objects. This enables the definition of topological loss functions, which assert to what extent a given object exhibits some…
Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix. The main aims of this paper are to propose and study tensor singular value decomposition based on…
Multiple scattering theory is applied to low-energy electron collisions with a complex target formed of two molecular scatterers. The total T-matrix is expressed in terms of the T-matrix for each isolated molecule. We apply the approach to…
We provide a theoretical foundation for the statistical approach for computing the absorption properties of particles in the Rayleigh domain. We present a general method based on the Discrete Dipole Approximation (DDA) to compute the…
The transition matrix, frequently abbreviated as T-matrix, contains the complete information in a linear approximation of how a spatially localized object scatters an incident field. The T-matrix is used to study the scattering response of…
Semi-analytic expressions for the static limit of the T-matrix for electromagnetic scattering are derived for a circular torus, expressed in bases of both toroidal and spherical harmonics. The scattering problem for an arbitrary static…
An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…
In industrial inspection and component alignment tasks, template matching requires efficient estimation of a target's position and geometric state (rotation and scaling) under complex backgrounds to support precise downstream operations.…
In general, matrix or tensor-valued functions are approximated using the method developed for vector-valued functions by transforming the matrix-valued function into vector form. This paper proposes a tensor-based interpolation method to…
Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological -- and indeed, linear -- algebra. However, matrices in this domain are typically large, with rows and columns…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…
This paper develops fast and efficient algorithms for computing Tucker decomposition with a given multilinear rank. By combining random projection and the power scheme, we propose two efficient randomized versions for the truncated…
Computational methods for electromagnetic and light scattering can be used for the calculation of optical forces and torques. Since typical particles that are optically trapped or manipulated are on the order of the wavelength in size,…
We introduce a new geometric framework for the set of symmetric positive-definite (SPD) matrices, aimed to characterize deformations of SPD matrices by individual scaling of eigenvalues and rotation of eigenvectors of the SPD matrices. To…
Dynamic mode decomposition (DMD) is a recently developed tool for the analysis of the behavior of complex dynamical systems. In this paper, we will propose an extension of DMD that exploits low-rank tensor decompositions of potentially…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…