Search arXiv⌕ Search

arXiv · 2610.05164

Chebyshev-Exact Acceleration under Hessian Variation, II: Computer-Assisted Variational Lower Bound

Abstract

We study two-step recurrences with positive step sizes and nonnegative momentum coefficients whose terminal residual is the Chebyshev minimax polynomial on a prescribed spectral interval $[μ,L]$. These recurrences have the same terminal error on a fixed quadratic, but their first-order responses to stepwise Hessian perturbations can differ. We prove that the sine-Jacobi recurrence of Part I is asymptotically optimal for this response norm within a factor of $1.000004$, uniformly over $0<μ 1.14268353624$, whereas the sine-Jacobi recurrence attains the constant $2\sqrt{c_{\sin}}$ with $c_{\sin}<1.14269218$. The proof reduces the gain to the diagonal energy of a Jacobi Green matrix. A centering lift represents this matrix by an exponential kernel; packing its diagonal into a density on the line preserves the energy and controls the change in the Birman-Schwinger spectrum. A calibrated identity gives a lower bound using the ground parameter and one Fredholm determinant. Two further determinants and a trace observation improve the bound through a pointwise inequality on an explicit compact state region. One rational certificate verifies this inequality by interval arithmetic. A second certificate constructs a density satisfying the selected observations and both normalizations with energy below the sine value. Finally, no $C^1$ function of finitely many observations of the specified kinds gives a locally sharp lower bound at the sine density.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dmitry Pasechnyuk-Vilensky, Takáč. 2026-10-04. Chebyshev-Exact Acceleration under Hessian Variation, II: Computer-Assisted Variational Lower Bound. https://arxiv.org/abs/2610.05164

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

KEEP EXPLORING

Related papers

Diagonally forced systems and the spectral signature of matrix cycles

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which are multiplied by a variable, $σ$, we wish to find the minimal $σ$ such that the eigenvalue of $\mathbf{M}_σ$ is exactly zero. By Gershgorin, we know that $\mathbf{M}_σ$ can be made stable by making $σ$ large enough. We prove a relation which analytically determines when and how we are able to find the value of $σ$ such that the maximal eigenvalue is exactly zero. In so doing, we prove the equivalence of the roots of the characteristic polynomial of $\mathbf{M}_σ$ and the eigenvalues that arise from a scaling operation on $\mathbf{M}$. Further, through the characteristic polynomial, we are able to isolate the dominant feedback cycles comprising the elements of the matrix which, under the action of $σ$, ensures the stability of the system. We then explore, using the stabilising and destabilising cycles within the coefficients of the characteristic polynomial, an intrinsic spectral signature associated with any square matrix based on the sign (or zero) of its respective elements.

math.OC↗

Nonlinear Control Allocation: A Polynomial Approach

Control allocation maps the virtual control inputs requested by a high-level control law onto the physical actuators of a system. When the actuator authority is strongly nonlinear, existing methods rely on local linearization, on incremental updates, or on general nonlinear programming, and may be inaccurate, slow, or trapped in local optima. This paper introduces Polynomial Control Allocation, in which the cost and constraints of the allocation problem are polynomial or rational functions of the states and inputs; radical, trigonometric and tabulated nonlinearities are accommodated by lifting. The first order optimality conditions then form a parametric system of polynomial equations. Its Gr{ö}bner basis and the associated multiplication matrices are computed once, offline. Online, the matrices are evaluated at the current state and all solutions are recovered from the eigenvectors of a random linear combination of them, so that the globally optimal allocation is selected at a predictable computational cost. The framework is illustrated on thrust control of a variable-pitch propeller and on multicopter force allocation, and its computational cost is quantified in terms of polynomial evaluation and eigenvector computation. The method is validated experimentally on a Quanser helicopter model at a 500 Hz control rate, where a two-layer allocation scheme combined with linear model predictive control decouples travel and elevation over multiple full rotations. Monte Carlo comparisons with nonlinear programming and incremental nonlinear control allocation show that Polynomial Control Allocation achieves the lowest allocation error together with the shortest computation time.

math.OC↗

Notes on the discretization of TV-NORM regularized inverse potential problems

We describe a method to discretize optimization problems arising in the regularization of linear inverse problem having compact forward operator defined on 3-D valued measures, compactly supported on a fixed set. The criterion is a quadratic residual attached to the data, with an additive penalization of the total variation of the measure.

math.OC↗