Bounds on the determinant of an exponential matrix

Michael S. Floater

Home/Archive/arXiv

arXiv · 2603.19900

Bounds on the determinant of an exponential matrix

Michael S. Floater

View original source ↗Read source document ↗Export metadata ↓

Abstract

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

Explore related subjects

math.NA cs.NA

Keep this discovery

BibTeX RIS

Michael S. Floater. 2026-09-07. Bounds on the determinant of an exponential matrix. https://arxiv.org/abs/2603.19900

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.NA subject math.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence

We propose the specular gradient method for one-dimensional convex optimization. Assuming that the minimum is attained and a suitable initial distance bound holds, we establish R-linear convergence using normalized steps of geometrically decreasing length. Neither strong convexity nor differentiability is required.

math.OC↗

arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗

arXiv2026

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA↗