A Deterministic Algorithm for finding the Entire Roots or Extrema of Finitely Smooth Transcendental Univariates arising in Mechanical Vibrations with Application to Nonlinear Eigenvalue Problems

Abstract Vibration and control problems often lead to solving intricate transcendental univariates. However, finding the entire solution set to such functions is an open problem. Existing methods employ i) approximations to convert the problem into a simpler, or generally a proxy, function amenable to the entire solution set, then ii) refinements to remove the approximation error. However, the former could be hampered by the degree of the nonlinearity of the problem and the latter could miss solutions if converged to the same solution for distinct approximate ones. In this paper, a deterministic algorithm is proposed for finding the entire solution set to any finitely smooth univariate for a given interval. The algorithm, utilizing no proxy functions, sweeps the solutions to the univariate through the application of the proposed Principle of Next Solution and a localized solver, the Restrained Newton's method. The next solution is the endpoint of the solutions to the cascade of higher order derivatives of the function. This is useful for parametric studies and eigenvalue problems in vibrations and control, where solutions within particular ranges are of interest. The algorithm also solves the global optimization problem for transcendental univariates. It finds the entire extrema of the problem, among which extracts the global optimizer. The algorithm is naturally parallelizable, allowing the independent processing of subdivisions of the input interval, thus speeding up the computations. Examples from nonlinear eigenvalue problems to a suite of univariate global optimization test problems are presented to demonstrate the superb performance of the proposed algorithm.

Authors

Institutions

Publication Details

Journal
Journal of vibration and acoustics
Published
2026-05-22
DOI
https://doi.org/10.1115/1.4072014
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Deterministic Algorithm for finding the Entire Roots or Extrema of Finitely Smooth Transcendental Univariates arising in Mechanical Vibrations with Application to Nonlinear Eigenvalue Problems

Hafez Tari
Journal of vibration and acoustics
Polynomial and algebraic computation
article

A Deterministic Algorithm for finding the Entire Roots or Extrema of Finitely Smooth Transcendental Univariates arising in Mechanical Vibrations with Application to Nonlinear Eigenvalue Problems

Hafez Tari
article en

Abstract

Abstract Vibration and control problems often lead to solving intricate transcendental univariates. However, finding the entire solution set to such functions is an open problem. Existing methods employ i) approximations to convert the problem into a simpler, or generally a proxy, function amenable to the entire solution set, then ii) refinements to remove the approximation error. However, the former could be hampered by the degree of the nonlinearity of the problem and the latter could miss solutions if converged to the same solution for distinct approximate ones. In this paper, a deterministic algorithm is proposed for finding the entire solution set to any finitely smooth univariate for a given interval. The algorithm, utilizing no proxy functions, sweeps the solutions to the univariate through the application of the proposed Principle of Next Solution and a localized solver, the Restrained Newton's method. The next solution is the endpoint of the solutions to the cascade of higher order derivatives of the function. This is useful for parametric studies and eigenvalue problems in vibrations and control, where solutions within particular ranges are of interest. The algorithm also solves the global optimization problem for transcendental univariates. It finds the entire extrema of the problem, among which extracts the global optimizer. The algorithm is naturally parallelizable, allowing the independent processing of subdivisions of the input interval, thus speeding up the computations. Examples from nonlinear eigenvalue problems to a suite of univariate global optimization test problems are presented to demonstrate the superb performance of the proposed algorithm.

Journal of vibration and acoustics
University of Michigan–Flint (US)
Openalex Percentile: Top 4%
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.