Related papers: Short note on the mass matrix for Gauss-Lobatto gr…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…
The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic…
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…
Higher order coefficients of the inverse mass expansion of one-loop effective actions are obtained from a one-dimensional path integral representation. For the case of a massive scalar loop in the background of both a scalar potential and a…
While an explicit basis is common in the study of Euclidean spaces, it is usually implied in the study of inertial relativistic systems. There are some conceptual advantages to including the basis in the study of special relativistic…
In this paper, we introduce new representation and characterization of the weighted core inverse of matrices. Several properties of these inverses and their interconnections with other generalized inverses are also explored. Through…
This paper introduces a new Monte Carlo algorithm to invert large matrices. It is based on simultaneous coupled draws from two random vectors whose covariance is the required inverse. It can be considered a generalization of a previously…
A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…
Generating 2-by-2 unitary matrices in floating-precision arithmetic is a delicate task. One way to reduce the accumulation error is to use less floating-point operations to compute each of the entries in the 2-by-2 unitary matrix. This…
This note considers the computation of the logarithm of symmetric positive definite matrices using the Gauss--Legendre (GL) quadrature. The GL quadrature becomes slow when the condition number of the given matrix is large. In this note, we…
Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…
We apply a method recently introduced to the statistical literature to directly estimate the precision matrix from an ensemble of samples drawn from a corresponding Gaussian distribution. Motivated by the observation that cosmological…
By designating one eigenvector of the mass matrix, one can reduce the free parameters in the mass matrix effectively. Applying this method to the quark mass matrix and to the lepton mass matrix, we find that this method is consistent with…
In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over $\mathbb{F}_2=\{0,1\}$ with high probability and can be transformed into echelon form in almost linear time by a simple…
For a prototype quadratic Hamiltonian describing a driven, dissipative system, exact matrix elements of the reduced density matrix are obtained from a generating function in terms of the normal characteristic functions. The approach is…
This paper provides an algorithm for simulating improper (or noncircular) complex-valued stationary Gaussian processes. The technique utilizes recently developed methods for multivariate Gaussian processes from the circulant embedding…
A quark mass matrix model $M_q=M_e^{1/2} O_q M_e^{1/2} $ is proposed where $M_e^{1/2}={\rm diag}(\sqrt{m_e},\sqrt{m_\mu},\sqrt{m_\tau})$ and $O_q$ is a unit matrix plus a rank one matrix. Up- and down-quark mass matrices $M_u$ and $M_d$ are…
In the finite difference approximation of the fractional Laplacian the stiffness matrix is typically dense and needs to be approximated numerically. The effect of the accuracy in approximating the stiffness matrix on the accuracy in the…