Related papers: T-matrix calculation via discrete-dipole approxima…
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…
In this paper, we propose an efficient quadratic interpolation formula utilizing solution gradients computed and stored at nodes and demonstrate its application to a third-order cell-centered finite-volume discretization on tetrahedral…
We derive a formula for the light field of a monochromatic plane wave that is truncated and reflected by a spherical mirror. Our formula is valid even for deep mirrors, where the aperture radius approaches the radius of curvature. We apply…
A novel template matching algorithm that can incorporate the concept of deformable parts, is presented in this paper. Unlike the deformable part model (DPM) employed in object recognition, the proposed template-matching approach called…
Explicit time advancement for continuous finite elements requires the inversion of a global mass matrix. For spectral element simulations on quadrilaterals and hexahedra, there is an accurate approximate mass matrix which is diagonal,…
We propose a method for the computation of a consistent system matrix for two- and three-dimensional cone-beam computed tomography (CT). The method relies on the decomposition of the cone-voxel intersection volumes into subvolumes that…
The machine learning explosion has created a prominent trend in modern computer hardware towards low precision floating-point operations. In response, there have been growing efforts to use low and mixed precision in general scientific…
Deming's method is applied for calculating matrix elements allowing to fit orbital parameters for planets. This work provides demonstrations which were missing in our previous paper of 2002.
DDSCAT 7.3 is an open-source Fortran-90 software package applying the discrete dipole approximation to calculate scattering and absorption of electromagnetic waves by targets with arbitrary geometries and complex refractive index. The…
A novel approach to electronic correlations and magnetism of crystals based on realistic electronic structure calculations is reviewed. In its simplest form it is a combination of the ``local density approximation'' (LDA) and the dynamical…
In this paper, we will present advanced discretization methods for solving retarded potential integral equations. We employ a $C^{\infty}$-partition of unity method in time and a conventional boundary element method for the spatial…
Multi-dimensional optimization is widely used in virtually all areas of modern astrophysics. However, it is often too computationally expensive to evaluate a model on-the-fly. Typically, it is solved by pre-computing a grid of models for a…
We study low T-phase-rank approximation of sectorial third-order tensors $\mathscr{A}\in\mathbb{C}^{n\times n\times p}$ under the tensor T-product. We introduce canonical T-phases and T-phase rank, and formulate the approximation task as…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
This work considers the low-rank approximation of a matrix $A(t)$ depending on a parameter $t$ in a compact set $D \subset \mathbb{R}^d$. Application areas that give rise to such problems include computational statistics and dynamical…
This work proposes a model-reduction approach for the material point method on nonlinear manifolds. Our technique approximates the $\textit{kinematics}$ by approximating the deformation map using an implicit neural representation that…
Matrices arising in scientific applications frequently admit linear low-rank approximations due to smoothness in the physical and/or temporal domain of the problem. In large-scale problems, computing an optimal low-rank approximation can be…
We describe and study geometric properties of discrete circular and spherical means of directional derivatives of functions, as well as discrete approximations of higher order differential operators. For an arbitrary dimension we present a…
We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses…
$D$-optimal designs originate in statistics literature as an approach for optimal experimental designs. In numerical analysis points and weights resulting from maximal determinants turned out to be useful for quadrature and interpolation.…