English
Related papers

Related papers: The Light Scattering and Fast Mie Algorithm

200 papers

The knowledge of the exact structure of the optical system PSF enables a high-quality image reconstruction in fluorescence microscopy. Accurate PSF models account for the vector nature of light and the phase and amplitude modifications.…

t is a known fact that near field diffraction or Fresnel diffraction calculations are difficult to perform exactly. It is in general necessary to make some approximations in order to obtain a more suitable form. In this work, a numerical…

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…

Computational Physics · Physics 2023-04-19 Johan Lundgren , Kurt Schab , Miloslav Capek , Mats Gustafsson , Lukas Jelinek

This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…

Data Structures and Algorithms · Computer Science 2021-03-05 Andreas Rosowski

The problem of reconstructing an object from the measurements of the light it scatters is common in numerous imaging applications. While the most popular formulations of the problem are based on linearizing the object-light relationship,…

Computer Vision and Pattern Recognition · Computer Science 2017-12-15 Yanting Ma , Hassan Mansour , Dehong Liu , Petros T. Boufounos , Ulugbek S. Kamilov

In this manuscript we investigate the capabilities of the Discrete Dipole Approximation (DDA) to simulate scattering from particles that are much larger than the wavelength of the incident light, and describe an optimized publicly available…

Optics · Physics 2007-05-23 Maxim A. Yurkin , Valeri P. Maltsev , Alfons G. Hoekstra

Matrix multiplication (hereafter we use the acronym MM) is among the most fundamental operations of modern computations. The efficiency of its performance depends on various factors, in particular vectorization, data movement and arithmetic…

Data Structures and Algorithms · Computer Science 2015-02-09 Victor Y. Pan

We introduce fast algorithms for correlation clustering with respect to the Min Max objective that provide constant factor approximations on complete graphs. Our algorithms are the first purely combinatorial approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-01-31 Sami Davies , Benjamin Moseley , Heather Newman

Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we…

Cosmology and Nongalactic Astrophysics · Physics 2017-02-17 Xiao Fang , Jonathan A. Blazek , Joseph E. McEwen , Christopher M. Hirata

We propose a Fourier-based learning algorithm for highly nonlinear multiclass classification. The algorithm is based on a smoothing technique to calculate the probability distribution of all classes. To obtain the probability distribution,…

Machine Learning · Computer Science 2022-11-17 Soheil Mehrabkhani

Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…

Quantum Physics · Physics 2025-08-21 Florian Oberender

High-throughput spectrometers are capable of producing data sets containing thousands of spectra for a single biological sample. These data sets contain a substantial amount of redundancy from peptides that may get selected multiple times…

Data Structures and Algorithms · Computer Science 2013-01-08 Fahad Saeed , Trairak Pisitkun , Mark A. Knepper , Jason D. Hoffert

The paper addresses the problem of optimizing a class of composite functions on Riemannian manifolds and a new first order optimization algorithm (FOA) with a fast convergence rate is proposed. Through the theoretical analysis for FOA, it…

Numerical Analysis · Computer Science 2015-12-08 Haoran Chen , Yanfeng Sun , Junbin Gao , Yongli Hu

A detailed analysis of the wave-mode structure in a bend and its incorporation into a stable algorithm for calculation of the scattering matrix of the bend is presented. The calculations are based on the modal approach. The stability and…

Quantum Physics · Physics 2009-11-13 Martin Horvat , Tomaz Prosen

This paper presents a new method, based on the well-known method of moments (MoM), for the numerical electromagnetic analysis of scattering and radiation from metallic or dielectric structures, or both structure types in the same…

We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…

Quantum Physics · Physics 2007-05-23 Geza Toth , Juan Jose Garcia-Ripoll

A classical way for exploring the scattering behavior of a small sphere is to approximate Mie coefficients with a Taylor series expansion. This ansatz delivered a plethora of insightful results, mostly for small spheres supporting localized…

Optics · Physics 2016-11-15 Dimitrios C. Tzarouchis , Pasi Ylä-Oijala , Ari Sihvola

We derive a set of sum rules for the light-by-light scattering and fusion: $\gamma\gamma \to all$, and verify them in lowest order QED calculations. A prominent implication of these sum rules is the superconvergence of the…

High Energy Physics - Phenomenology · Physics 2010-12-02 Vladimir Pascalutsa , Marc Vanderhaeghen

Cross-sections for particles scattered from selected spatial geometries exhibit many of the same interesting features as Mie scattering.

Optics · Physics 2025-07-29 S. Subedi , T. Curtright

This paper presents a novel formulation and consequently a new solution for two dimensional TM electromagnetic integral equations by the method of moments in polar coordination. The main idea is the reformulation of the 2-D problem…

Numerical Analysis · Mathematics 2021-07-29 Mahdi Parizi , Mansor Nakhkash