Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.01233

Singular vector spaces for computing the structured distance to singularity

Lauri Nyman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Finding the distance to singularity for a matrix is a ubiquitous problem in numerical linear algebra, and is elegantly solved by the Eckart-Young-Mirsky theorem. Its structured variant naturally emerges when one considers structured matrices, and wants to preserve their structure. Recent work has shown that this problem is particularly important for a class of matrix nearness problems that either entirely or partly reduce to a structured distance to singularity problem. In this work, we propose a new framework for addressing this problem, based on the concept of singular vector spaces, that is, linear subsets of the set of singular matrices. We analyze singular vector spaces in the context of this problem, prove new results, and detail how a specific subfamily of singular vector spaces can be incorporated into a practical algorithm. The resulting algorithm is based on globally minimizing a certain objective function alternatingly in its arguments. Numerical experiments demonstrate that this new algorithm is remarkably faster than the state-of-the-art, while the quality of the output remains comparable. This makes it possible to solve problems of much larger size than what was previously possible.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lauri Nyman. 2026-03-01. Singular vector spaces for computing the structured distance to singularity. https://arxiv.org/abs/2603.01233

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

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗