Effective computation of Moore-Penrose inverses over fields of rational functions by specializations

Juana Sendra

Home/Archive/arXiv

arXiv · 2610.08676

Effective computation of Moore-Penrose inverses over fields of rational functions by specializations

Juana Sendra

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we consider matrices whose entries are rational functions of several parameters over a Moore-Penrose field, that is, a field with an involutory automorphism over which every matrix has Moore-Penrose inverse. We prove that over any such field the Penrose conditions can be solved with linear algebra alone, even though they form a polynomial system of degree two. We then bound the degrees of the numerator and of the denominator of the pseudoinverse in terms of the degree of the entries and of the rank, and not of the dimensions of the matrix. Specialization is the thread: the closed form is computed once over the field of rational functions, and the question is at which parameter values it still returns the pseudoinverse of the specialized matrix. We determine the values where it does not, from the matrix alone and before computing the pseudoinverse. They are the zeros of a polynomial built from the maximal minors, and they are the values at which the rank decreases. This turns previous sufficient conditions into an exact characterization. The theory also gives symbolic algorithms for the real, the complex and the parametric case, which we implement in Maple and test on 972 timed replications. We also apply them to a Leontief economic model, where the excluded value is the point at which the economy stops being viable.

Explore related subjects

math.NA cs.NA math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Juana Sendra. 2026-10-06. Effective computation of Moore-Penrose inverses over fields of rational functions by specializations. https://arxiv.org/abs/2610.08676

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

KEEP EXPLORING

Related papers

arXiv2026

A mixed Petrov-Galerkin Cosserat rod finite element formulation

This paper presents a total Lagrangian mixed Petrov-Galerkin finite element formulation that provides a computationally efficient approach for analyzing Cosserat rods that is free of singularities and locking. To achieve a singularity-free orientation parametrization of the rod, the nodal kinematical unknowns are defined as the nodal centerline positions and unit quaternions. We apply Lagrange interpolation to all nodal kinematic coordinates, and in combination with a projection of non-unit quaternions, this leads to an interpolation with orthonormal cross-section-fixed bases. To eliminate locking effects such as shear locking, the variational Hellinger-Reissner principle is applied, resulting in a mixed approach with additional fields composed of resultant contact forces and moments. Since the mixed formulation contains the constitutive law in compliance form, it naturally incorporates constrained theories, such as the Kirchhoff-Love theory. This study specifically examines the influence of the additional internal force fields on the numerical performance, including locking mitigation and robustness. Using well-established benchmark examples, the method demonstrates enhanced computational robustness and efficiency, as evidenced by the reduction in required load steps and iterations when applying the standard Newton-Raphson method.

math.NA↗

arXiv2026

Beyond the summation-by-parts property: nullspace consistency, sparsity, and regularization for FSBP operators

We investigate the construction and performance of summation-by-parts (SBP) operators, which offer a powerful framework for the systematic development of structure-preserving numerical discretizations of partial differential equations. Previous approaches for the construction of SBP operators have usually relied on either local methods or sparse differentiation matrices, as commonly used in finite difference schemes. However, these methods often impose implicit requirements that are not part of the formal SBP definition. We demonstrate that adherence to the SBP definition alone does not guarantee the desired accuracy, and we make additional conditions explicit that SBP operators need to satisfy in order to achieve accuracy. While these conditions are known in the SBP literature, they are usually enforced only implicitly by the respective construction procedure. Specifically, we analyze the error minimization for an augmented basis, discuss the role of sparsity, and examine the importance of nullspace consistency in the construction of SBP operators. A dispersion and dissipation analysis shows that the loss of accuracy has two sources. First, a lack of nullspace consistency produces stationary modes, which are neither transported nor damped by the scheme and whose contribution to the error converges more slowly under mesh refinement. Second, the physical mode, i.e., the discrete approximation of an exact traveling wave, can be poorly resolved, and the resulting error dominates in long-time simulations. Furthermore, we show how these design criteria can be integrated into a recently proposed optimization-based construction procedure for function space SBP (FSBP) operators on arbitrary grids. Our findings are supported by numerical experiments that illustrate the improved accuracy of the numerical solutions obtained with the proposed SBP operators.

math.NA↗

arXiv2026

A discontinuous Galerkin method for elliptic-hyperbolic equations: the Tricomi problem

We present and analyze a discontinuous Galerkin method for the numerical solution of a class of second-order linear mixed-type partial differential equations, i.e. equations that change their nature from elliptic to hyperbolic through the computational domain. Well-posedness of the discrete problem is established via coercivity in an energy norm, achieved through the Morawetz multiplier technique. We derive $hp$-a priori error estimates in the energy norm, which we use to prove convergence rates for standard and quasi-Trefftz polynomial spaces. Numerical experiments validate the theoretical results.

math.NA↗