Related papers: Recursive calculation of matrix elements for the g…
Optimizing deep learning models is generally performed in two steps: (i) high-level graph optimizations such as kernel fusion and (ii) low level kernel optimizations such as those found in vendor libraries. This approach often leaves…
We present a mechanism to compute a sketch (succinct summary) of how a complex modular deep network processes its inputs. The sketch summarizes essential information about the inputs and outputs of the network and can be used to quickly…
Microscopic nuclear structure calculations have been performed within the framework of the unitary-model-operator approach. Ground-state and single-particle energies are calculated for nuclei around ^{14}C, ^{16}O and ^{40}Ca with modern…
We describe the use of the Density Matrix Renormalization Group method as a means of approximately solving large-scale nuclear shell-model problems. We focus on an angular-momentum-conserving variant of the method and report test results…
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x…
The generalized recurrence plot is a modern tool for quantification of complex spatial patterns. Its application spans the analysis of trabecular bone structures, Turing patterns, turbulent spatial plankton patterns, and fractals.…
Lie-integration is one of the most efficient algorithms for numerical integration of ordinary differential equations if high precision is needed for longer terms. The method is based on the computation of the Taylor-coefficients of the…
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed scheme consists of a sparse preconditioner that increases the skew-symmetric part and makes the main diagonal of the coefficient matrix as close…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
An algorithm for sequential calculation of non-isotropic matrix elements of the collision integral which are necessary for the solution of the non-linear Boltzmann equation by moment method is proposed. Isotropic matrix elements that we…
We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a…
A computational scheme for reasoning about dynamic systems using (causal) probabilistic networks is presented. The scheme is based on the framework of Lauritzen and Spiegelhalter (1988), and may be viewed as a generalization of the…
This study presents a theoretical model for a self-replicating mechanical system inspired by biological processes within living cells and supported by computer simulations. The model decomposes self-replication into core components, each of…
Different strategies of reliability theory for the analysis of coherent systems have been studied by various researchers. Here, the Gini-type index is utilized as an applicable tool for the study and comparison of the ageing properties of…
We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
An incoherent low-rank matrix can be efficiently reconstructed after observing a few of its entries at random, and then solving a convex program that minimizes the nuclear norm. In many applications, in addition to these entries,…
We consider evaluation of matrix elements with the coupled-cluster method. Such calculations formally involve infinite number of terms and we devise a method of partial summation (dressing) of the resulting series. Our formalism is built…
We give recursive formulas for the generating elements in the Milnor basis of the mod 2 motivic Steenrod algebra.
A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive…