Recursive Formula Research Articles

Joint moments of higher order derivatives of CUE characteristic polynomials II: structures, recursive relations, and applications

In a companion paper (Keating and Wei 2023 Int. Math. Res. Not. 2024 9607–32), we established asymptotic formulae for the joint moments of higher order derivatives of the characteristic polynomials of CUE random matrices. The leading order coefficients of these asymptotic formulae are expressed as partition sums of derivatives of determinants of Hankel matrices involving I-Bessel functions, with column indices shifted by Young diagrams. In this paper, we continue the study of these joint moments and establish more properties for their leading order coefficients, including structure theorems and recursive relations. We also build a connection to a solution of the σ-Painlevé III ′ equation. In the process, we give recursive formulae for the Taylor coefficients of the Hankel determinants formed from I-Bessel functions that appear at zero and find some differential equations these determinants satisfy. The approach we establish is applicable to determinants of general Hankel matrices whose columns are shifted by Young diagrams.

A recursive calculation method of vibration displacements using blade tip timing in angular domain

Blade tip timing (BTT) is a non-contact measurement technique that can be used to monitor blade vibration in turbomachinery. The raw data measured by BTT is the arrival time of all blades at the same stage. However, most blade vibration monitoring methods based on BTT require the use of blade vibration displacements, which are derived from the raw arrival time data, the blade rotation radius and speed. Conventional BTT methods calculate blade tip displacements by comparing the measured arrival time with the ideal arrival time. The ideal arrival time is obtained by assuming that the rotational speed is constant in a revolution, which is inconsistent with the fact, especially when the rotational speed changes rapidly. In this paper, a recursive calculation method called recursive BTT is proposed to reduce the influence of rotational speed fluctuation on the accuracy of blade tip displacement calculation. Recursive BTT calculates the displacements in the angular domain instead of the time domain. A recursive formula is constructed in the angular domain to calculate the blade vibration displacement by using the angle between the vibrating blades. Compared with the conventional BTT method, which relies on the once-per-revolution (OPR) signal, recursive BTT makes full use of the arrival time of all blades at the same stage to calculate the displacements. The advantage of recursive BTT is illustrated through a simulation, a laboratory test and a full-scale aeroengine test. To evaluate the reliability of the calculated displacements, strain signals are resampled to compare with the calculated displacements in the laboratory test. In the full-scale aeroengine test, due to the lack of strain signals, BTT displacements are used to track the blade natural frequency to qualitatively indicate the influence of displacements on blade vibration monitoring. The results of finite element analysis and modal test are used for verification in the full-scale aeroengine test. Simulation and experimental results demonstrate that compared with existing methods, recursive BTT is robust for calculating blade vibration displacements.

Analytical method for systems of nonlinear singular boundary value problems

The standard Lane–Emden equations model several physical phenomena such as isotropic continuous media, thermal behaviour of a spherical cloud of gas, and isothermal gas spheres. Systems of Lane–Emden-type equations appear in the modelling of the concentration of carbon substrate and oxygen, catalytic diffusion reactions, the steady state concentration of carbon dioxide, dusty fluid models, and pattern formation. In solving singular boundary value problems, one faces challenges resulting from the divergence of the associated variable coefficients at the singular points. This research article explores the power series approach to analytically approximate solutions to a class of systems of strongly nonlinear singular boundary value problems of Lane–Emden-type. The nonlinear terms in the proposed problems are transformed into power series using the generalised Cauchy product before establishing explicit recursion formulae for the expansion coefficients of the system of series solutions. The initial conditions required in the proposed boundary value problems are assumed and determined from a set of nonlinear algebraic equations resulting from the given right boundary conditions. Three special systems of nonlinear singular boundary value problems of Lane–Emden type are presented to demonstrate the proposed method’s reliability, effectiveness, and accuracy. The obtained approximate solutions are compared with the exact solutions (where they are available), or with other existing results (where the exact solution is not readily available). The series solution of the first example has a slow convergent rate, while the results of the other two examples are in excellent agreement with the exact solutions and other published results.

Error analysis of asymptotic solution of a heavy particle motion equation in fluid flows

For weakly inertial particles subjected to volumetric forces and Stokes drag force in fluid flows, we can solve the simplified particle motion equation using the perturbation method. This method allows us to obtain a recursive formula for the nth-order correction of the asymptotic solution of particle velocity. We verified the error of the asymptotic solution under two typical flow fields: a time-varying uniform flow field with a volumetric force field and a two-dimensional non-uniform cellular flow field. In the former, the relative error of the asymptotic solution of particle velocity and position increases with the Stokes number, and we provided a quantitative analysis of the results. In the latter, we verify and analyze the asymptotic solution from two perspectives: the behavior of a single particle and the collective behaviors of many particles. For asymptotic solutions with maximum velocity and position errors of less than 5%, we select the solution with the lowest order correction and designate it as the optimal asymptotic solution. The order of the optimal asymptotic solution increases with increasing Stokes numbers and motion durations. However, in most cases, for weakly inertial particles [St ∼ O(10−3)], and the time t* ∼ O(10), the first-order asymptotic solution can achieve accuracy, where both St and t* are defined using the flow field characteristic time, Tf = 4π s. The results validate the rationale behind utilizing first-order asymptotic solutions in the fast Eulerian method for turbulent dispersion of weakly inertial particles.

An extension of the Walsh-Hadamard transform to calculate and model epistasis in genetic landscapes of arbitrary shape and complexity.

Accurate models describing the relationship between genotype and phenotype are necessary in order to understand and predict how mutations to biological sequences affect the fitness and evolution of living organisms. The apparent abundance of epistasis (genetic interactions), both between and within genes, complicates this task and how to build mechanistic models that incorporate epistatic coefficients (genetic interaction terms) is an open question. The Walsh-Hadamard transform represents a rigorous computational framework for calculating and modeling epistatic interactions at the level of individual genotypic values (known as genetical, biological or physiological epistasis), and can therefore be used to address fundamental questions related to sequence-to-function encodings. However, one of its main limitations is that it can only accommodate two alleles (amino acid or nucleotide states) per sequence position. In this paper we provide an extension of the Walsh-Hadamard transform that allows the calculation and modeling of background-averaged epistasis (also known as ensemble epistasis) in genetic landscapes with an arbitrary number of states per position (20 for amino acids, 4 for nucleotides, etc.). We also provide a recursive formula for the inverse matrix and then derive formulae to directly extract any element of either matrix without having to rely on the computationally intensive task of constructing or inverting large matrices. Finally, we demonstrate the utility of our theory by using it to model epistasis within both simulated and empirical multiallelic fitness landscapes, revealing that both pairwise and higher-order genetic interactions are enriched between physically interacting positions.

Absorption by a Layered Microbolometer Pixel’s Active Element

Microbolometer arrays, i.e., arrays of micro-scale pixels sensing temperature via resistance changes, have proven to be an effective basis for real-time imaging instrumentation in infrared as well as terahertz frequencies. In previous work, a design of THz and IR absorbing nano-laminates of dielectric and metal layers was studied. It was shown via numerical modeling that absorption may be maximized by appropriate choices of thickness, permittivity and conductivity. In this work, an analytical approach to the problem is formulated based on the standard recursive multiple reflection formulas for multi-layered planar structures. The results fully confirm and extend previous numerical work. A previous relationship between wavelength and silicon thickness for maximum absorption, derived numerically for specific parameter combinations, is now generalized in a parametric closed form. The method can be extended to include multiple lossy dielectric layers and may serve as a tool for optimizing the absorption characteristics of more complex layered absorbing structures. This could enhance the sensitivity of the detection scheme of interest, providing benefits in terms of cost, efficiency, precision, and adjustability.

Labeled partitions in action: Recombination, selection, mutation and more

In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modeled by a measure-valued ordinary differential equation. We provide a stochastic representation for the solution of this model via duality to a new labeled partitioning process with Markovian labels. In the special case of single-crossover, this leads to a recursive solution formula. This extends (and unifies) previous results on the selection–recombination equation. As a concrete example, we consider the selection–mutation–recombination equation.

Interior solution of azimuthally symmetric case of Laplace equation in orthogonal similar oblate spheroidal coordinates

Curvilinear coordinate systems distinct from the rectangular Cartesian coordinate system are particularly valuable in the field calculations as they facilitate the expression of boundary conditions of differential equations in a reasonably simple way when the coordinate surfaces fit the physical boundaries of the problem. The recently finalized orthogonal similar oblate spheroidal (SOS) coordinate system can be particularly useful for a physical processes description inside or in the vicinity of the bodies or particles with the geometry of an oblate spheroid. The solution of the azimuthally symmetric case of the Laplace equation was found for the interior space in the orthogonal SOS coordinates. In the frame of the derivation of the harmonic functions, the Laplace equation was separated by a special separation procedure. A generalized Legendre equation was introduced as the equation for the angular part of the separated Laplace equation. The harmonic functions were determined as relations involving generalized Legendre functions of the first and of the second kind. Several lower-degree functions are reported. Recursion formula facilitating determination of the higher-degree harmonic functions was found. The general solution of the azimuthally symmetric Laplace equation for the interior space in the SOS coordinates is reported.

Quantum knot mosaics and bounds of the growth constant

The discovery of the Jones polynomial made an important connection between quantum physics and knot theory. Kauffman and Lomonaco introduced the knot mosaic system to define the quantum knot system for the purpose of representing an actual physical quantum system. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot [Formula: see text]-mosaic is an [Formula: see text] array of 11 mosaic tiles representing a knot diagram by adjoining properly. The total number [Formula: see text] of knot [Formula: see text]-mosaics, which indicates the dimension of the Hilbert space of the quantum knot system, is known to grow in a quadratic exponential rate. Recently, Oh et al. developed the state matrix recursion method producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. Furthermore, they showed the existence of the knot mosaic constant [Formula: see text] and found its upper and lower bounds in a series of papers. The latest upper bound was obtained through two new concepts: quasimosaics and cling mosaics. As a sequel to this research program, we adjust the state matrix recursion method to handle cling mosaics inside a quasimosaic, which is called the progressive state matrix recursion method. This method provides recursive matrix-relations producing a sharper bound of the knot mosaic constant: [Formula: see text]

Probabilistic Stirling numbers and applications

AbstractWe introduce probabilistic Stirling numbers of the first kind $$s_Y(n,k)$$ s Y ( n , k ) associated with a complex-valued random variable Y satisfying appropriate integrability conditions, thus completing the notion of probabilistic Stirling numbers of the second kind $$S_Y(n,k)$$ S Y ( n , k ) previously considered by the first author. Combinatorial interpretations, recursion formulas, and connections between $$s_Y(n,k)$$ s Y ( n , k ) and $$S_Y(n,k)$$ S Y ( n , k ) are given. We show that such numbers describe a large subset of potential polynomials, on the one hand, and the moments of sums of i. i. d. random variables, on the other, establishing their precise asymptotic behavior without appealing to the central limit theorem. We explicitly compute these numbers when Y has a certain familiar distribution, providing at the same time their combinatorial meaning.

Multidirectional cascade of square MIMO LTI subsystems: Transfer function representation

This paper considers continuous transfer function representation for a cascade composed of N mutually interconnected square multiple-input multiple-output (MIMO) linear time-invariant (LTI) subsystems with general multidirectional input–output configurations. Such cascaded structure can arise, e.g., from the spatial discretization of one-dimensional distributed parameter systems (DPSs) described by partial differential equations (PDEs) with boundary conditions representing different configurations of boundary input signals. As shown in the paper, the transfer function matrix of the resulting cascade can be calculated using the Redheffer star product of the subsystems’ transfer function matrices, which simplifies into the usual matrix product for the unidirectional cascade. For the particular case of 2 × 2 cascade composed of rational transfer function subsystems, the recursive formulas for its boundary and distributed transfer functions have been derived for both uni- and multidirectional configurations. The well-posedness and the stability criteria are also analyzed, proving to be more restrictive for the multidirectional cascade than for the unidirectional one due to the internal positive feedback in the first case. As shown in the attached example, the presented results can be used to approximate one-dimensional distributed parameter systems using rational transfer function subsystems representing the spatial sections of the original DPS.

Uniqueness of the Eigenvalue Inverse Problem for a Class of X-type Matrices with Linear Relations

Constraining a matrix by adding additional conditions to determine the matrix if given eigenpairs is called the eigenvalue inverse problem for matrices. The eigenvalue inverse problem of a matrix can be based on a given combination of different eigenvectors and real numbers to inverse a matrix method, and the method of inversion varies for different types of matrices. In this paper, we investigate the eigenvalue inverse problem for a class of X-type matrices characterized by linear relations, Invert the matrix based on its characteristics, determine eigenvalues and eigenvectors, and finally, prove that the solution of the problem exists and is unique, derive a series of expressions and recursive formulas, and we also check the algorithm’s accuracy correctness by giving different instances.

On the accurate computation of the Newton form of the Lagrange interpolant

AbstractIn recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great precision, even for large ill-conditioned matrices. In this framework, the present work provides the factorization of the collocation matrices of Newton bases—of relevance when considering the Lagrange interpolation problem—together with an algorithm that allows to numerically compute it to high relative accuracy. This further allows to determine the coefficients of the interpolating polynomial and to compute the singular values and the inverse of the collocation matrix. Conditions that guarantee high relative accuracy for these methods and, in the former case, for the classical recursion formula of divided differences, are determined. Numerical errors due to imprecise computer arithmetic or perturbed input data in the computation of the factorization are analyzed. Finally, numerical experiments illustrate the accuracy and effectiveness of the proposed methods with several algebraic problems, in stark contrast with traditional approaches.

Study of cellular structures built from self-similar models and repeatable structures manufactured by FDM/FFF technology

Appropriate recursive formulas were obtained for generating repeatable and self-similar cellular structures obtained from PLA using the FDM/FFF method. The H1s, H2s self-similar models show mechanical self-similarity relationships based on simulation and compression test. In addition, the H1s models show higher displacement values than the H1i recurrent models. For the results of the H2s models, it is not conclusive whether they show higher displacement values.

Finite region stability and networked predictive control for 2-D nonlinear time-delayed systems with quantization, packet dropouts and random disturbances

In this paper, we focus on the finite region stability (FRS) and networked predictive control (NPC) problems for two-dimensional (2-D) networked control systems (NCS) with time delays, quantization errors, packet losses and random disturbances described by the Roesser model. The random packet dropouts and disturbances are modeled as Bernoulli process, and the sufficient conditions of FRS and finite region boundedness (FRB) for 2-D NCS are obtained by using the expectation to process the Lyapunov function difference, so as to better study the transient performance of the systems. According to the recursive formula, an active compensation scheme for time delays of NPC is proposed, which takes into account quantization errors, packet losses, nonlinearity and interferences. Introducing FRS and FRB into 2-D NCS and considering the above factors in NPC scheme are new attempts made in this paper. An example is used to demonstrate the validity of the conclusions in the end.

Novel recursive formula for removing damping distortion effect on bridge mode shape restoration using a two-axle scanning vehicle

Mode shapes recovered for bridges are often distorted by bridge damping when using the vehicle scanning method (VSM). To remedy such an effect, a novel recursive formula utilizing the spatial correlation between the front and rear contact points of a two-axle scanning vehicle is theoretically established. For a bridge subjected to a two-axle moving test vehicle, the dynamic response of the system is first derived in closed form. The vehicle-bridge contact response is used as a substitute for the vehicle response in signal processing, since it is free of the masking effect posed by vehicle frequencies. Using either the Hilbert transform (HT) or wavelet transform (WT), instantaneous amplitudes are extracted for the component response of the bridge of concern. Further, recursive formula that accounts for the spatial correlation between the two contact points is established to recover the undistorted bridge mode shapes. The following are the conclusions: (1) The distortion effect of damping on bridge mode shapes can be effectively removed by the recursive formula against various factors; (2) the WT is more effective in recovering undistorted bridge mode shapes than the HT; and (3) the proposed formula works well for restoring the mode shapes of bridges with rough pavement, by adding an accompanying truck during the vehicle scanning.

Twisted elliptic genera

We study the twisted elliptic genera of 2d (0, 4) SCFTs associated with the BPS strings in the twisted circle compactification of 6d rank-one (1, 0) SCFTs. Such objects can arise when the 6d gauge algebra allows outer automorphism, thus are classified by twisted affine Lie algebras. We study several fascinating aspects of the twisted elliptic genera including 2d localization, twisted elliptic blowup equations, Higgsing and spectral flow symmetry. We derive a recursion formula with respect to the number of strings to exactly compute the twisted elliptic genera. We also investigate the modular bootstrap of twisted one-string elliptic genera and find the modularity of congruence subgroups Γ1(N) naturally appears with possible N = 2, 3, 4. Geometrically, our study solves the refined BPS partition functions of the underlying genus-one fibered Calabi-Yau threefolds with N-section.

An objective FE-formulation for Cosserat rods based on the spherical Bézier interpolation

A generalization of the spherical linear interpolation (or slerp) for the finite rotations to the case of more than two control variables on SO(3) is introduced to design an objective FE-formulation for the non-linear space Cosserat rod model. The interpolation uses the De Casteljau’s algorithm.In this way, the same interpolation degree can be used for the placement of the centroid curve and for the finite rotation of the cross-section. A recursive formula is obtained for the interpolation of the rotations. Similar recursive formulas are derived for the spin and the curvature vector, leading to a generalization of the Bézier basis functions on the manifold SO(3).The rod formulation so obtained is invariant under a rigid rotation (objective), in the sense that the patch-test with respect to the rigid body motion is satisfied. Furthermore, an optimal path-independence is achieved as verified by several numerical investigations.

A surface area formula for compact hypersurfaces in Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document}

The classical Cauchy surface area formula states that the surface area of the boundary ∂K=Σ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\partial K=\\Sigma $\\end{document} of any n-dimensional convex body in the n-dimensional Euclidean space Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document} can be obtained by the average of the projected areas of Σ along all directions in Sn−1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{S}^{n-1}$\\end{document}. In this note, we generalize the formula to the boundary of arbitrary n-dimensional submanifold in Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document} by introducing a natural notion of projected areas along any direction in Sn−1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{S}^{n-1}$\\end{document}. This surface area formula derived from the new notion coincides with not only the result of the Crofton formula but also with that of De Jong (Math. Semesterber. 60(1):81–83, 2013) by using a tubular neighborhood. We also define the projected r-volumes of Σ onto any r-dimensional subspaces and obtain a recursive formula for mean projected r-volumes of Σ.

Distributions of 4-subtree patterns for uniform random unrooted phylogenetic trees

Tree shape statistics based on peripheral structures have been utilized to study evolutionary mechanisms and inference methods. Partially motivated by a recent study by Pouryahya and Sankoff on modeling the accumulation of subgenomes in the evolution of polyploids, we present the distribution of subtree patterns with four or fewer leaves for the unrooted Proportional to Distinguishable Arrangements (PDA) model. We derive a recursive formula for computing the joint distributions, as well as a Strong Law of Large Numbers and a Central Limit Theorem for the joint distributions. This enables us to confirm several conjectures proposed by Pouryahya and Sankoff, as well as provide some theoretical insights into their observations. Based on their empirical datasets, we demonstrate that the statistical test based on the joint distribution could be more sensitive than those based on one individual subtree pattern to detect the existence of evolutionary forces such as whole genome duplication.